An evolutionary design model for constraint optimization problems through transformation of optimization models is constructed, and then a multi-population genetic algorithm with narrowing of the search space is prese...
详细信息
An evolutionary design model for constraint optimization problems through transformation of optimization models is constructed, and then a multi-population genetic algorithm with narrowing of the search space is presented to solve the problem. By defining the probabilities that the optimal solution occurs in each population, information-entropy is introduced into evolution process. The probabilities can be obtained by explicitly solving the multi-objective optimization problem with information entropy, which are just Lagrange multipliers in the Kuhn-Tucker condition of the problem, and then the coefficients of narrowing of the searching space for multi-population genetic algorithm can be given to control contraction of the solution space. The premature problem can be avoided by keeping diversity among different populations. The algorithm can be ensured by very rapid and steady convergence using solution space contraction criterion. The ability of searching optimization solution for the evolution algorithms is enhanced by introducing entropy. Numerical examples show that the method has very high accuracy and effectiveness.
A repository-based method to acquire the discussion clues in the text is presented in this paper. In this method, the topic concepts of the text and each paragraph are found out on the basis of the relevance between t...
详细信息
A repository-based method to acquire the discussion clues in the text is presented in this paper. In this method, the topic concepts of the text and each paragraph are found out on the basis of the relevance between the control words in the text and each concept in the concept net, and the discussion clues are acquired on the basis of the relevance comp.tation of each concept. The effects of different depiction manners and the existing replacements are avoided. Experimental results show that, by using the proposed method, the accuracy of text topic identification reaches 82% and that of paragraph topic identification reaches 70%.
The rule sets extracted by traditional algorithm are usually very large, because it includes many redundant rules. The number of rules can be reduced using closed item sets. The relationship of generalization and spec...
详细信息
The rule sets extracted by traditional algorithm are usually very large, because it includes many redundant rules. The number of rules can be reduced using closed item sets. The relationship of generalization and specialization among concepts of concept lattice is very suitable for extracting rules. A new and more advantageous lattice structure for extracting rules is proposed based on the theory of concept lattice and the concept of closed item set. Then, an incremental algorithm based on closed label for constructing lattice and algorithm for rules extracting are developed. Finally, a visual and easily understandable set of rules is presented to user, who can selectively derive other rules of interest. The example shows that the algorithm used in this paper can efficiently extract rule-generating set.
Teamwork is an effective way of cooperative problem solving in dynamic and unpredictable application contexts. The concept of joint intention is the key of teamwork. How various speech actions can be used by software ...
详细信息
Teamwork is an effective way of cooperative problem solving in dynamic and unpredictable application contexts. The concept of joint intention is the key of teamwork. How various speech actions can be used by software Agents to form, maintain and dissolve joint intention is a significant problem needed to be investigated. This paper aims to design a teamwork protocol based on FIPA (foundation for intelligent physical Agent) ACL (Agent communication language) which is a promising Agent communication language. To this aim, the sufficiency of the FIPA ACL in supporting Agents to form the required joint intention in teamwork is analyzed first. Specifically, the notions of the joint-request and delegation-request are distinguished and the insufficiency of the delegation-request in supporting teamwork is pointed out. Thus a new joint-request action is defined to extend the FIPA ACL. Some properties of the joint-request are also discussed. Based on the defined action, a teamwork protocol with a formal semantic description is proposed and its application is demonstrated finally. The teamwork protocol describes a new interaction pattern, which differs from those of the existing elementary request protocol, contract-net protocol and auction protocols within the FIPA Interaction Protocol Specifications. The proposed protocol can facilitate the design of interaction modules in multi-Agent teamwork.
Many emerging mobile wireless applications for emergency and military situations depend upon secure group communications. But group key management in mobile ad-hoc networks faces a great challenge because of mobility,...
详细信息
Many emerging mobile wireless applications for emergency and military situations depend upon secure group communications. But group key management in mobile ad-hoc networks faces a great challenge because of mobility, unreliable links and multi-hop communications. Based on the threshold secret sharing mechanism and RSA encryption technique, a novel group key management framework named DGKMF (distributed group key management framework) is proposed in this paper, in which each entity holds a secret share and multiple entities in a local neighborhood can jointly update the group key. Simulation results demonstrate that DGKMF is better than other algorithms and protocols such as CKD, GDH v.2 and BD in the group rekey success ratio and delay.
A network intrusion detection strategy based on MIB-I is proposed. It solves the security problems of SNMPvl and SNMPv2, and avoids using SNMPv3 that is comp.icated and only partly supported by manufacturers. SNMPvl i...
详细信息
A network intrusion detection strategy based on MIB-I is proposed. It solves the security problems of SNMPvl and SNMPv2, and avoids using SNMPv3 that is comp.icated and only partly supported by manufacturers. SNMPvl is adopted in the proposed strategy because it is widely supported by manufacturers. By analyzing the data from MIB-II, the security of network can be monitored from the data link layer, network layer, transport layer and application layer of TCP/IP protocols. Experimental results show that the proposed strategy can detect network intrusion in time and fit into the security management of small and medium sized networks.
Via analyzing news data on the Internet, an algorithm is presented for news event detection and tracking based on a dynamic evolution model, which borrows the idea of single-pass clustering and combines the specialtie...
详细信息
Via analyzing news data on the Internet, an algorithm is presented for news event detection and tracking based on a dynamic evolution model, which borrows the idea of single-pass clustering and combines the specialties of news. The dynamic model is given based on the living characteristics of news event, including similarity comp.ting model based on time distance between news story and news event, event model evolution algorithm, and dynamic threshold idea. This algorithm can automatically organize news data into news special topics, and furthermore provide personalized service for users. Finally, experimental results are used to indicate the validity of the algorithm.
Traditional software process models are mostly static, mechanical, and passive. Traditional approach requires modeler to determine all the possible conditions the software process will encounter and to define explicit...
详细信息
Traditional software process models are mostly static, mechanical, and passive. Traditional approach requires modeler to determine all the possible conditions the software process will encounter and to define explicitly the solutions into a process model. It lacks the ability to allow further deliberations when the modeled environment changes. This paper presents an Agent-based self-adaptive software process model. In this approach, software process is modeled as peers: process Agents. These software process Agents can adapt themselves to the software process environment and act with initiative and autonomy. When the process environment changes, the process agents can dynamically change their behavior to ensure that the development goal can still be achieved.
Scramble algorithms, which are also called pure-position permutation algorithms, are commonly used as an image encryption, are investigated in this paper. Unfortunately, they are frail under known-text attack. Accordi...
详细信息
Scramble algorithms, which are also called pure-position permutation algorithms, are commonly used as an image encryption, are investigated in this paper. Unfortunately, they are frail under known-text attack. According to the weakness of pure position permutation algorithm, we put forward an effective decryption algorithm for all pure-position permutation algorithms. First, a summary of the pure position permutation image encryption algorithms is given by introducing the concept of ergodic matrices. Secondly, by using probability theory and algebra knowledge, the decryption probability of pure-position permutation algorithms is verified theoretically. Then, by defining operation system of fuzzy ergodic matrices, we improve a specific decryption algorithm. Finally, some simulation results are shown.
Scheduling algorithms based on task duplication are of better performance than non-duplication ones. The paper analyzes typical scheduling algorithms based on task duplication (e.g. TDS, OSA algorithm) and their assum...
详细信息
Scheduling algorithms based on task duplication are of better performance than non-duplication ones. The paper analyzes typical scheduling algorithms based on task duplication (e.g. TDS, OSA algorithm) and their assumptions, then puts forward the algorithm of Processor Pre-Allocation (PPA) based on task duplication, whose primary aim is to get the shortest scheduling length, and secondary aim to utilize less number of processors, without any restricted conditions of task comp.ting time and communication time between tasks (namely task granularity is not taken into account). comp.red with correlative algorithms, PPA algorithm has advantages in scheduling length and the number of processors over others, but has the same time comp.exity. That is important for embedded real-time distributed systems.
暂无评论