Unsolicited emails and online scams can erode both consumer confidence and consumer safety when interacting and transacting over the Internet. This paper uses content analysis to identify the most frequent psychological tricks used in scamming and the most frequent flags which alert consumers to the illegitimate and unsolicited nature of the contact. Findings are then explored in light of individual thinking styles to reveal how some consumers may be more vulnerable to online scams as a result of their own personal preference for thinking in a particular way. The rationale is to establish a foundation for the use of content analysis of unsolicited emails to offer insight into the possible relationship between a consumer’s style of thinking and online victimization.
Recent advances in WSN (Wireless Sensor Networks) have led to many routing protocols designed for more efficiency of energy utilization in the WSN field. While many routing protocols have been proposed in this field, a single routing protocol cannot be energy-efficient if the environment of the sensor network varies. This paper presents a FAR (Fuzzy logic based Adaptive Routing) algorithm that provides energy-efficiency by dynamically changing the protocols installed at the sensor nodes. The algorithm changes protocols based on the output of the fuzzy logic which is the fitness level of the protocols for the environment. A simulation is performed to show the usefulness of the proposed algorithm.
Recently, mining information in sports video data, especially soccer video, has become an active research topic. In this paper, a new algorithm for detection of expected goal events in soccer video is proposed. The proposed algorithm is composed of two main steps. Firstly, video is segmented into its constituent shots and these shots are categorized into two groups, namely long shots and non-long shots. Secondly, long shots are examined to detect expected goal events. Our scheme uses the playfield boundary feature for shot boundary detection, shot classification, and expected goal events detection. Therefore, this feature is extracted only one time and the algorithm is speedy. It is noticeable that the proposed algorithm is robust to blurring and spatial downsampling. Moreover, experimental results on various broadcast soccer videos show that our algorithm can achieve high accuracy and especially high speed.
Context-awareness has been considered as promising topic in pervasive computing area, but a review of the existing approaches shown that developing diverse application services in this area is still motivated based on the analysis of existing approaches in literature. This paper proposed a context-aware system, which can provide more specific information and services about the situation where you may arrange a business meeting as a case study. In developing a context awareness application, we adopted an approach that selects and combines the strengths of the reviewed methodologies. As an infrastructure for supporting this development, a framework architecture prototype was constructed. Especially, we focused on ontologies which make it possible to reason semantic notion.
Nowadays, Effectiveness and benefits of mobile phone technologies appeared more than expected. During the recent decade, using of mobile phone improved from telephone call tools to a remote control, transfer messages and financial transactions tools. One of the most important challenges in the mservices area is the security issue. Different papers have discussed various aspects of secured networks. But, until now a extensive ranking approach has not been presented to overcome the security issues. In this paper, first the security technologies and their applications have reviewed. Then the future trends of mobile technology in the world and current condition of mobile users in Iran have investigated. The result of literature reviews showed 13 security technologies and 6 groups of applications. In the next step, with designing a questionnaire for collecting and analyzing the opinion of experts, the importance of different security technologies within six types of mobile service have scrutinized.
Quick sort algorithm is studied thoroughly, a new incomplete quick sort algorithm is designed, and then a novel image median filtering algorithm based on incomplete quick sort algorithm is proposed to improve the filtering speed. The new algorithm considers in detail the characteristic of image median filtering (In median filtering algorithm, the sorting operation of all pixel values is not necessary, the median value can be given by many other methods), and can give the median value by only sorting part of the pixels value in the neighborhood, thus it can reduce many data move operations, and then greatly improve the speed of image median filtering. Algorithm analysis and a lot of experiment results show that, the new algorithm greatly improves the speed of image median filtering, and can keep the edge, outline, texture and much other information to a great extent.
Text clustering is one of the difficult and hot research fields in the text mining research. Combing Map Reduce framework and the neuron initialization method of VPSOM (vector pressing SelfOrganizing Model) algorithm, a new text clustering algorithm is presented. It divides the large text vector dataset into data blocks, each of which then processed in different distributed data node of Map Reduce framework with agglomerative hierarchical clustering algorithm. The experiment results indicate that the improved algorithm has a higher efficiency and a better accuracy.
In this paper, we are going to introduce new services in Cloud Computing environment. Three Cloud Computing services are already classified by the researchers such as Software as a Service (SaaS), Platform as a Service (PaaS) and Infrastructure as a Service (IaaS). Each of defined services serves distinct purpose. Here, we propose some more fundamental services which are still undefined to the researchers in most of the cases. Each type of utility service is shown with an example which is interrelated with the engineering college scenario. An engineering college hierarchical framework is used as a case study where in each cloud is defined as a private or public or hybrid cloud. This hierarchical design is based on the typical resource environment found in many academic institutions.
This paper reports on the use of a twisted map digital chaotic sequence as a carrier signal in a COOK system. The sequence generated shows low cross-correlation properties with very large signal space which is desirable for spread spectrum communication. A potentially cost-effective solution for wideband communications is to use a wideband chaotic carrier. COOK offers the simplest solution to chaotic communication. In COOK, the chaotic signal is multiplied directly by the bit sequence to be transmitted, i.e. radiation of a chaotic signal is disabled for bit’0’ and enabled for bit ‘1. COOK offers the simplest solution to chaotic communication. Since non-coherent demodulation is used in COOK, synchronization is unnecessary. The system was simulated by SimulinkMatlab
Natural and friendly interface is critical for the development of service robots. Gesture-based interface offers a way to enable untrained users to interact with robots more easily and efficiently. Robots are, or soon will be, used in such critical domains as search and rescue, military battle, mine and bomb detection, scientific exploration, law enforcement, and hospital care. Such robots must coordinate their behaviors with the requirements and expectations of human team members; they are more than mere tools but rather quasi-team members whose tasks have to be integrated with those of humans. In this sense, this paper goal is to present a method which is used for Posture recognition technique applied in ubiquitous computing and used the efficient bio inspired posture recognition algorithm for our proposed scheme. Here we present a scheme which reduces the size of the database which is used to store different postures of human beings which are used by robot as commands. The picture frame may divide into different scan lines and pixel color value under these scan lines are examined to guess the particular posture of user. The robot may use this as command and act accordingly.
Multi-authenticated encryption is an important message transmission technique, which can send message in a secure and authentic way, and allows a group of signers to cooperatively produce a valid authenticated ciphertext so that only the specific recipient can recover the message and verify the signature. In 2008, Wu et al. proposed a convertible multi-authenticated encryption scheme. However, Tsai et al. showed that the computational complexity of this scheme is rather high and the message redundancy is used. To improve the computational efficiency and remove the message redundancy, they proposed a new convertible multi-authenticated encryption scheme based on the intractability of one-way hash functions and discrete logarithms. In this paper, we show that Tsai et al.’s scheme is not secure against rogue-key attacks. To overcome such attack, we give an improved multi-authenticated encryption scheme by including two hash functions. And our improved scheme is the same efficiency as Tsai et.al.’s scheme.
Content-based image retrieval, which provides convenient ways to retrieve images from large image databases, has been studied actively. However, many previous image retrieval techniques do not look at regions in an image. In this paper, we present a novel region matching method for contentbased image retrieval. In this method, the region dependences in each image are first computed in order to select the most interesting region from each image. Further, the distance of regions between different images is defined. Finally, the similar-ity measurement formulation is proposed. Experimental results show that the proposed method can improve the precision rate and the recall rate of image retrieval.
Nowadays, data partition plays an important role in eliminating duplicate data in green storage and cloud storage system. Fixed-sized chunking and content based chunking are two kinds of commonly used partition methods to break a file into a sequence of blocks. Meanwhile, inverted index has become the standard indexing method in modern information retrieval field. For conveniently analyzing, the inverted index is represented as inverted matrix and a MapReduce strategy is used to decompose a complex matrix computation into a set of smaller parallelizable sub-matrix computations. In order to efficiently take advantage of the block information to calculate file correlation, we propose a novel Block-Ranking method which utilizes the number of duplicate blocks to weight the correlation among files. The experiment indicates that Block-Ranking algorithm has rapidly enhanced the retrieval efficiency in network storage environment.
XTR is an excellent public key system that can achieve the same communication and security advantages at a much lower computational cost because of small keys and fast key selection.XTR can apply in variety of environments that relies on the subgroup of discrete logarithm problem. This paper programs a large integer library and based on which achieves the XTR Diffie-Hellman agreement.
In this paper, we propose a classified credential selection scheme with disclosure-minimizing privacy and give protocols for realizing it in point-based management model. The client has two or more classes of credentials, and defines a quantitative privacy score for each credential, while the server defines a point value for each credential disclosed by the client and a minimum access threshold of point values to access a resource. When the server requires the client to disclose at least one credential in each class, the proposed scheme allows the server and client to jointly compute an optimal subset of credentials without revealing their private information such that the total private scores of disclosed credentials is minimal while the server’s access threshold is satisfied. We also prove the security of the protocols in our scheme in the semi-honest model.
This paper investigated the nature of learning process in human playing a competitive game with binary choices. As in reinforcement learning, the subject's choice during a competitive game was biased by its choice and reward history, as well as by the strategies of its opponent. Furthemore, consistent with predictions of the reinforcement learning model, we found that the magnitude of ERPs after losing to the computer opponent predicted whether subjects would change decision behavior on the subsequent trial, but in our experiment, the subject's decision wasn't systematically influenced by the cumulative effects of reward history.
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business logics, and provide more functions etc.. However, the existing Web services composition approach cannot be fit for the kind of Web service. In order to solve the problem, we propose the notation of the inverted interface dependency and extend it to OWL-S firstly. A large-granularity Web service is regarded as a group of the inverted interface dependency. Then we propose an automatic composition approach based on the idea of proofs as programs. The main idea of the method is as follows. Specification of composition requirement is described as a proposition which can be proved by related theory. The proof can be viewed as a solution of composition specification. By the case study, the availability of the approach is approved. At last, we develop a prototype JTangComposition to implement our approach.
In this paper, we present an improved biometric identity based encryption scheme which is based on Baek et al’s scheme. By using fuzzy extractor to construct the public key of a user, we reduce the number of exponentiations of encryption algorithm, the number of MaptoPoint hash function and the length of ciphertext from O(n) to O(1). Furthermore, we proved the proposed scheme satisfy the security requirement under indistinguishability of encryptions under fuzzy selective-ID, chosen plaintext attack (IND-FSID-CPA).
As the number of specified bits of different test patterns varies widely in a deterministic test cube, all test patterns are concatenated to a data flow. The original test data can be re-divided by 2 to the power of integer according to the successful characteristics of the LFSR coding, whose length equals to the power of 2 in every division. In the new test approach, the numbers of specific bits in the new test vectors are very close. Hence the encoding efficiency can be enhanced in the process of LFSR. And experimental results show that the compression ratio of this scheme can improve 2.32 % than that of hybrid coding. Compared with the previous schemes, the proposed scheme can increase the encoding efficiency with simple decompression structure and less area overhead.
