Applied Mechanics and Materials Vols. 135-136

Abstract: Multiple has accused of unknown parameter optimization problems of implementation of the object. Containing identification link should adaptive objective coordinate optimization control system. The local objects in decomposition based on optimizing, application target coordinate law to selected optimal criteria based on the minimum value to ensure coordinated operation in the process of making optimal index for global convergence, achieve the purpose of overall optimization. In order to execute real time on-line identification, Recursion least square method (RLS) could be used for the estimation of object parameter in the identification section.

Abstract: For the limited calculation of mobile device, the difficulty of finding big prime number and the complexity of RSA exponential modular computation, this paper proposes a modified algorithm to find prime numbers in the RSA algorithm. It modifies the method of random numbers generation to improve the efficiency of pre-screening algorithm. To reduce the terminal calculation and accelerate the speed of key-pair generation, it transfers the most time-consuming operation of big prime number modular exponentiation to the servers. Based on the key-pair generation algorithm, this paper finally proposes a terminal registration scheme of mobile payment.

Abstract: In this paper, an all CMOS current reference circuit which generates a reference current independent of PVT (Process, supply Voltage, and Temperature) variations is presented. The circuit consists of a self-biased current source (SBCS) and two nested connected transistors which supply a voltage with positive temperature coefficient and the resulting reference circuit has low temperature coefficient. It is based on CSMC 0.5um mixed-signal process with the supply voltage of 5V. The precision of reference current is about ±3.05% when considering the process, supply voltage and temperature variation at the same time.

Abstract: Aiming at the deficiency of research on reliability evaluation of Web Services composition models, basing on the theories and methods of stochastic Petri net, this paper proposes an approach to reliability evaluation of web services composition based on business process execution language (BPEL). Firstly, the Web Services composition model is analyzed and built basing on the stochastic Petri net, and then the BPEL processes are transformed into composite service process Net model (CSPNet) correspondingly. Combining with the reliabilities of component services and the structures of CSPNet, the reliability formula of several composite services are obtained. Finally, a recursive algorithm is built to evaluate the reliability of Web Services composition. The experimental results show that the approach to reliability evaluation of web Services composition based on BPEL is simple, tractable and efficient.

Abstract: One critical issue in wireless sensor networks is how to gather sensed information in an energy-efficient way since the energy is a scarce resource in a sensor node. Cluster-based architecture is an effective architecture for data-gathering in wireless sensor networks. In this paper, by taking the nodes energy consumption into account, we first derive the optimal number of clusters for data gathering in sensor networks. To balance the cluster heads energy consumption, we propose a mixed communication modes where the cluster heads can transmit data to the base station in either single-hop or multi-hop. We then develop a data gathering method based on the optimal number of clusters and mixed communication modes. The simulation results show that the proposed method outperforms LEACH and HEED in terms of network lifetime by balancing energy dissipation.

Abstract: Acquisition time of precision ranging code is long under the conditions of large Doppler shift, the carrier frequency domain FFT-based fast acquisition theory was analyzed, and the method of carrier Doppler compensation estimates to complete the PN code Doppler compensation was directly used in spread spectrum ranging signal acquisition. Comparing with the traditional parallel acquisition approach, the Doppler frequency estimation accuracy and acquisition speed is greatly improved, the acquisition time is shorter than long code segment with the traditional parallel acquisition method. Comparing with the method of short code supporting for long code, the channel energy is saved.

Abstract: Proxy multi-signature is an extension of the basic proxy signature primitive, and permits two or more entities to delegate their signing capabilities to the same other entity. Combining proxy multi-signature with identity based cryptography, in this paper, We construct a concrete identity based proxy multi-signature scheme by using bilinear pairings. Analysis shows that the scheme is capable of resisting forgery attack and can satisfy all the required security properties of a proxy signature. Furthermore, the new scheme is very simple and efficient computationally. It has the property that the size of a proxy multi-signature is independent of the number of the original signers.

Abstract: Managing identity is an issue that has been dealt with in various contexts. This paper explores the problem in identity management from the perspective of IT-enabled Services, with special emphasis on the Japanese context. It is an illustration of problems involved in the introduction of a unified national digital identification system in Japan. This paper also presents a framework, which serves to enhance ITeS characteristics of digital identification system in Japan. Results from a survey about trust are also included.

Abstract: Image scrambling is an important technique in digital image encryption and digital image watermarking. This paper proposes a new image scrambling method, which based on chaotic sequence and space-bit-plane operation (SBPO). First, every eight pixels from different areas of image were selected according to chaotic sequence, and grouped together to form a collection. Second, the SBPO was performed in every collection and built eight pixels of the image with new values. The scrambling image was generated when all pixels were processed. This method can scramble image not only based on the pixel’s position but also the value and their corresponding probability. The experimental results show that this scrambling method possesses perfect confusion properties and it can resist various attacks.

Abstract: Fingerprint segmentation is an important step in an automatic fingerprint recognition system. Due to applications of various sensors, fingerprint segmentation inevitably suffers from sensor interoperability problem. K-means algorithm is one solution to address the sensor interoperability problem in fingerprint segmentation. However, the traditional k-means based method does not well deal with the border between the foreground and the background. The over-segmentation of foreground area may appear and some important minutiae are lost. To effectively address the issue, we propose an improved k-means based segmentation method with sensor interoperability called ISKI. ISKI performs the secondary determination to the blocks which have similar distances with the two cluster centers after k-means clustering. The proposed method is applied on a number of fingerprint databases which are collected by various sensors. Experimental results show our proposed method significantly improves the accuracy of segmentation.