Solving integer programming by evolutionary soft agent

Many practical problems in commerce and industry involve finding the best way to allocate scarce resources a-mong competing activities. This paper focuses on the problem of integer programming, and describes an evolutionary soft a-gent model to solve it. In proposed model, agent is composed of three components: goal, environment and behavior. Experimental shows the model has the characters of parallel computing and goal driving. Foundation item: Supported by the National Natural Science Foundation of China( 60205007) , Natural Science Foundation of Guangdong Province(001264), Research Foundation of Software Technology Key Laboratory in Guangdong Province and Research Foundation of State Key Laboratory for Novel Software Technology at Nanjing University Biography: Yin Jian ( 1968-), male, Associate professor, research direction: artificial intelligence, data mining.     

Finite volume methods for solving electromagnetic problems in nonhomogeneous media

This article shall review some of the recent advances on finite volume methods for solving electromagnetic problems in nonhomogeneous media. The stability, convergence and applications of the finite volume methods will be discussed. Foundation item: Supported by State Key Laboratory of Software Engineering, Wuhan University and a Direct Grant of CUHK, Hong Kong Biography: Zou Jun(1962-), male, Professor, research direction: numerical solutions of electromagnetic maxwell systems, numerical solutions of Interface problems, inverse problems, domain decomposition methods.     

A feedback-based web search engine

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected hy them. Since the selections of the search results cannot affect the future ones. they may not cover most people‘s interests. In this paper, feedback informarion produced by the users‘ accessing lists will be represented By the rough set and can reconstruct the query string and influence the search results. And thus the search engines can provide self-adaptability.     

Testing Forms in Web Applications Automatically

Forms enhance both the dynamic and interactive abilities of Web applications and the system complexity. And it is especially important to test forms completely and thoroughly. Therefore, this paper discusses how to carry out the form testing by different methods in the related testing phases. Namely, at first, automatically abstracting forms in the Web pages by parsing the HTML documents; then, ohtai ning the testing data with a certain strategies, such as by requirement specifications, by mining users＇ hefore input informarion or by recording meehanism; and next executing the testing actions automatically due to the well formed test cases; finally, a case study is given to illustrate the convenient and effective of these methods.     

Phylogeny constructed by using diversity increment

A new approach based on the concept of the diversity increment is applied to reconstruct a phylogeny. The phylogeny of the Eutherian orders use concatenated H-stranded amino acid sequences, and the result is consistent with the commonly accepted one for the Eutherians. Foundation item: Supported by the National Natural Science Foundation of China ( 30170214) and the Open Foundation of the State Key Laboratory of Software Engineer, Wuhan University, China. Biography: Shi Feng ( 1966- ), male, Ph. D, Associate professor, research direction: bioinformatics.     

Some massively parallel algorithms from nature

We introduced the work on parallel problem solvers from physics and biology being developed by the research team at the State Key Laboratory of Software Engineering, Wuhan University. Results on parallel solvers include the following areas: Evolutionary algorithms based on imitating the evolution processes of nature for parallel problem solving, especially for parallel optimization and model-building; Asynchronous parallel algorithms based on domain decomposition which are inspired by physical analogies such as elastic relaxation process and annealing process, for scientific computations, especially for solving nonlinear mathematical physics problems. All these algorithms have the following common characteristics: inherent parallelism, self-adaptation and self-organization, because the basic ideas of these solvers are from imitating the natural evolutionary processes. Foundation item: Supported by the National Natural Science Foundation of China (No. 60133010, No. 70071042, No. 60073043) and National Laboratory for Parallel and Distributed Processing Biography: Li Yan (1974-), female, Ph. D candidate, research direction: evolutionary computation.     

Time-Based Dynamic Trust Model Using Ant Colony Algorithm

The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a trust-vector, which figures the trust intensity between this entity and the others. The trust intensity is dynamic due to the time and the inter-operation between two entities, a method is proposed to quantify this change based on the mind of ant colony algorithm and then an algorithm for the transfer of trust relation is also proposed. Furthermore, this paper analyses the influence to the trust intensity among all entities that is aroused by the change of trust intensity between the two entities, and presents an algorithm to resolve the problem. Finally, we show the process of the trusts＇ change that is aroused by the time＇s lapse and the inter-operation through an instance.     

The evolutionary computation techniques for protein structure prediction: A survey

In this paper, the applications of evolutionary al gorithm in prediction of protein secondary structure and tertiary structures are introduced, and recent studies on solving protein structure prediction problems using evolutionary algorithms are reviewed, and the challenges and prospects of EAs applied to protein structure modeling are analyzed and discussed. Foundation item: Supported by the National Natural Science Foundation of China( 60133010,70071042,60073043) Biography: Zou Xiu-fen ( 1966-), female, Associate professor, research direction:evolutionary computing, parallel computing, bioinformatics.     

Dynamic Vector Space Secret Sharing Based on Certificates

A vector space secret sharing scheme based on certificates is proposed in this paper. The difficulties of solving discrete logarithm assure confidential information＇s security, and the use of each participant＇s certificate makes the dealer have no need to transfer secret information to the participants. The proposed scheme is dynamic. It can effectively check cheaters and does not have secure channel requirements.     

Evolutionary graph drawing algorithms

In this paper, graph drawing algorithms based on genetic algorithms are designed for general undirected graphs and directed graphs. As being shown, graph drawing algorithms designed by genetic algorithms have the following advantages: the frames of the algorithms are unified, the method is simple, different algorithms may be attained by designing different objective functions, therefore enhance the reuse of the algorithms. Also, aesthetics or constrains may be added to satisfy different requirements. Foundation item: Supported by the National Natural Science Foundation of China(60133010,60073043,70071042) Biography: Huang Jing-wei ( 1956-), male, Professor, research direction: the design and analysis of algorithms and evolutionary computation.     

A Multi-objective optimal evolutionary algorithm based on tree-ranking

Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcomings, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare-to front, retain the diversity of the population, and use less time. Foundation item: Supported by the National Natural Science Foundation of China(60073043, 70071042, 60133010) Biography: Shi Chuan( 1978-), male, Master candidate, research direction; intellective computation, evolutionary computation.     

Methods of constructing optimal wavelet filters based on genetic algorithm

In this paper, algorithms of constructing wavelet filters based on genetic algorithm are studied with emphasis on how to construct the optimal wavelet filters used to compress a given image,due to efficient coding of the chromosome and the fitness function, and due to the global optimization algorithm, this method turns out to be perfect for the compression of the images. Foundation item: Supported by the Natural Science Foundation of Education of Hunan Province(21010506) Biography: Wen Gao-jin( 1978-), male, Master candidate, research direction: evolutionary computing.     

Applying evolutionary algorithm to public key cryptosystems

A best algorithm generated scheme is proposed in the paper by making use of the thought of evolutionary algorithm, which can generate dynamically the best algorithm of generating primes in RSA cryptography under different conditions. Taking into account the factors of time, space and security integrated, this scheme possessed strong practicability. The paper also proposed a model of multi-degree parallel evolutionary algorithm to evaluate synthetically the efficiency and security of the public key cryptography. The model contributes to designing public key cryptography system too. Foundation item: Supported by the Hi-Tech Research and Development Foundation item: Supported by the Hi-Tech Research and Development Biography; Tu Hang (1975-), male, Ph. D candidate, research directions: Biography; Tu Hang (1975-), male, Ph. D candidate, research directions:     

A generic design model for evolutionary algorithms

A generic design model for evolutionary algorithms is proposed in this paper. The model, which was described by UML in details, focuses on the key concepts and mechanisms in evolutionary algorithms. The model not only achieves separation of concerns and encapsulation of implementations by classification and abstraction of those concepts, it also has a flexible architecture due to the application of design patterns. As a result, the model is reusable, extendible, easy to understand, easy to use, and easy to test. A large number of experiments applying the model to solve many different problems adequately illustrate the generality and effectivity of the model. Foundation item: Supported by the National Natural Science Foundatron of China (70071042, 60073043, 60133010) Biography: He Feng (1974-), male, Ph. D candidate, research direction evolutionary computation, software engineering.     

Analysis and Application of Covert Channels of Internet Control Message Protocol

Based on the analysis of the covert channel＇s working mechanism of the internet control message protocol （ICMP） in internet protocol version 4 （IPv4） and Internet Protocol version 6 （IPv6）, the ICMP covert channd＇s algorithms of the IPv4 and IPv6 are presented, which enable automatic channeling upon IPv4/v6 nodes with non-IPv4-compatible address, and the key transmission is achieved by using this channel in the embedded Internet terminal. The result shows that the covert channel＇s algorithm, which we implemented if, set correct, the messages of this covert channel might go through the gateway and enter the local area network.     

Point-tree structure genetic programming method for discontinuous function’s regression

A new point-tree data structure genetic programming (PTGP) method is proposed. For the discontinuous function regression problem, the proposed method is able to identify both the function structure and discontinuities points simultaneously. It is also easy to be used to solve the continuous function’s regression problems. The numerical experiment results demonstrate that the point-tree GP is an efficient alternative way to the complex function identification problems. Foundation item: Supported by the National Natural Science Foundation (60173046) and the Natural Science Foundation of Hubei Province (2002AB040) Biography: Xiong Sheng-wu (1966-), male, Associate professor, research direction: evolutionary computing, parallel computing.     

Improved Authenticated Multi-Key Agreement Protocol

Zhou et al give an attack on Ham＇s modified authenticated multi-key agreement protocol, and give a protocol that can prevent the unknown key-share attack. The paper points out that the protocol is vulnerable to a concatenation attack. This paper proposes an improved authenticated multi-key agreement protocol which shows how to make Harn＇s protocol more secure by modifying the signature and verification. And this protocol can escape the concatenation attack.     

Parallel implementations of modeling

First, an asynchronous distributed parallel evolutionary modeling algorithm (PEMA) for building the model of system of ordinary differential equations for dynamical systems is proposed in this paper. Then a series of parallel experiments have been conducted to systematically test the influence of some important parallel control parameters on the performance of the algorithm. A lot of experimental results are obtained and we make some analysis and explanations to them. Foundation item: Supported by the National Natural Science Foundation of China (60133010, 70071042, 60073043) Biography: Cao Hong-qing ( 1972-), female, Associate professor, research direction; evolutionary computing, parallel computing.     

Convergence in the<Emphasis Type="Italic">r</Emphasis>-th mean and the Marcinkiewicz type weak law of large numbers for weighted sums of<Emphasis Type="Italic">L</Emphasis><Subscript>q</Subscript>-mixingale arrays

L _r convergence and convergence in probability for weighted sums ofL _q-mixingale arrays have been discussed and the Marcinkiewicz type weak law of large numbers forL _q-mixingale arrays has been obtained. Foundation item: Supported by the National Natural Science Foundation of China (10071058) Biography: Gan Shi-xin (1939-), male, Professor, research direction; martingale theory, probability limiting theory and Banach space geometry theory.