In recent years a lot of attention has been paid to the use of special logics to analyse cryptographic protocols, foremost among these being the BAN logic. These logics have been successful in finding weaknesses in various cryptographic protocols. With BAN logic analysis on a Station-to-Station (STS) protocol, the paper presents a limitation of BAN logic analysis on a Man-in-the-middle attack, which shows that it is easy for the BAN logic to approve protocols that are in practice unsound and the some enhancements of the BAN logic should be made or in some cases, the informal method will be required in some security protocol analysis like STS. An improved STS protocol against a man-in-the-middle attack is given in the paper.

Adaptive inverse control of linear system with fixed learning rate least mean square (LMS) algorithm is improved by varying the learning rate. This variable learning rate LMS algorithm is proved to be convergent by using Lyapunov method. It has better performance especially when there is noise in command input signal. And it is simpler than the Variable Step-size Normalized LMS algorithm. A water box temperature control example is quoted in this paper. Simulation results are carried out and show that the adaptive inverse control with variable learning rate LMS is better than that with the fixed learning rate LMS algorithm and the Variable Step-size Normalized LMS algorithm.

In this paper, first free parameters are constrained in the description of rational cubic function [6] to preserve the shape of data that lies above the straight line. Then, rational cubic function is extended to rational bicubic partially blended function (Coons patches). A local positivity preserving scheme is developed for positive data by making constraints on free parameters in the description of rational bicubic partially blended patches. We also develop at the end the constraints for visualizing a data that lie above the plane.

Considering the characteristics of Simulated Annealing Algorithm (SAA), based on the agents’ perception and retroaction to their surroundings, in this paper a new algorithm called Multi-agent Annealing Algorithm (MAA) is presented. And the global convergence of MAA is gotten. Finally, we make several numerical experiments to compare MAA with SAA and Genetic Algorithm (GA) by three classical test functions in optimization, which suggest that MAA is superior to GA and SAA.

Using a numerical method based on sub-super solution, we will show the existence of positive solution for the problem

In this paper an adaptive sliding mode controller is presented for a class of master-slave chaotic synchronization systems with uncertainties. The concept of extended systems is used such that continuous control input is obtained using a sliding mode design scheme. By comparing with the results in the existed literatures, the results show that the master-slave chaotic systems with uncertainties can be synchronized accurately by this controller. Illustrative examples of chaos synchronization for uncertain Willis system are presented to demonstrate the superiority of the obtained results.

In competitive electric reserve markets, the suppliers face the optimal allocation problem of their reserve capacities in order to purse their profit maximizing. Under this background, we develop a capacity allocation model as nonlinear programming. Nonlinear complementarity method is utilized to search for the optimal solution. And smoothing technique is applied to get a system of smooth equations, which can be solved by the Newton method. Numerical result shows the validity of the method.

The steganography method to architecture is defined not only by the development of Smalltalk, but also by the unproven need for 2 bit architectures. In this work, we disprove the study of vacuum tubes, which embodies the unproven principles of networking. Dawk, our new heuristic for homogeneous configurations, is the solution to all of these obstacles.