10763979
Flocking Motion of Mobile Agents with a Leader Based on Distance-Dependent Adjacency Matrix
In this study, a novel procedure is presented for control and analysis of multiple autonomous agents with point mass dynamics achieving flocking motion with a time variant leader. Two control laws are proposed for a group of autonomous agents to achieve flocking formations related to two different centers (mass center and geometric center) of the flock. The first one is designed for flocking motion based on mass center and the second for geometric center. Distance-dependent adjacency matrix is used to quantify the way agents influence each other. Theoretical analysis is established to indicate the stability (cohesiveness, collision avoidance and velocity matching) of the control systems using classical Lyapunov theory. Finally, a simulation example is demonstrated to validate the theoretical results.
31796281
Reliable Robust Controller Design for Nonlinear State-Delayed Systems Based on Neural Networks
An approach is investigated for the adaptive guaranteed cost control design for a class of nonlinear state-delayed systems. The nonlinear term is approximated by a linearly parameterized neural networks( LPNN). A linear state feedback H∞ control law is presented. An adaptive weight adjustment mechanism for the neural networks is developed to ensure H∞ regulation performance. It is shown that the control gain matrices and be transformed into a standard linear matrix inequality problem and solved via a developed recurrent neural network.
16741593
A Log Analysis Audit Model Based on Optimized Clustering Algorithm
In view of the problem how to detect the network unknown attacks, a security log analysis audit model based on optimized clustering algorithm is proposed in this paper. Since the main question which influence the clustering algorithm application in the log analysis is uneasy to determine the network attack type and the cluster number, so we bring forward an optimized cluster algorithm to solve this problem. By means of simulated experiments, this algorithm is proved feasible, efficient and extensible for unknown intrusion detection.
14381667
Transformation of landscape planning and design in computer supported cooperative work era
From the point of design methodology, change quickly development computer technology of computer supported cooperative work (CSCW) has influence on the actions of landscape planning and design, such as renovation of design tradition conception, new ways for shape originality, and testing method for landscape planning and design. It has practicality value of determining computer technology values in landscape architecture design and thinking.
13982371
Parallel implementation of the global optimization algorithm based on uniform distributional design and Powell method
The global optimization for complex functions method is in dire need of new computation. By combining the Powell method, which finds a partial optimum solution, with the uniform distribution design method, which uses evenly spaced test points at higher dimensional space, allows for a new algorithm which is capable of solving the global optimization function. This new algorithm is robust enough to search global optimal solution. Its time complexity is proportional to the number of initial points and to the square dimensions of the problem, and its spatial complexity is in proportion to the number of the initial points and the dimensions of the problem. Also, the algorithm has good parallel efficiency and will have broader potential applications
303731
Keyphrase-Based Information Sharing in the ACORN Multi-agent Architecture
The ACORN provides an agent-based architecture for information retrieval and provision across networks. The main objective of this paper is to present the design and implementation of information sharing in a community of mobile agents in ACORN, based on keyphrase sharing and comparison among agents. In keyphrase-based information sharing, keyphrases and their weights are used to represent user interests and document contents. Agents use these keyphrase-weight pairs to find other relevant agents. Two similarity measures, the substring indexing method and the Cosine measure method, are compared. The ACORN with Cosine measure is found to be more efficient in terms of meaningful information exchange and execution time.
18580310
1-Persistent Collision-Free CSMA Protocols for Opportunistic Optical Hyperchannels
Recently, a new WDM optical network infrastructure named SMART [1], which is capable of dynamically setting up, modifying, and tearing down optical connections, was proposed. The performance of SMART is determined by the performance of its hyperchannels, which are essentially optical buses or light-trails. Previously proposed CSMA protocols for unidirectional optical buses can be used as distributed medium access control protocols for hyperchannels. However, these protocols are either unfair, or not work-conserving. In this paper, we propose a class of work-conserving, collision-free, and fair CSMA protocols for opportunistic hyperchannels which are tailored hyperchannels for SMART. We show that the performances of our proposed protocols are much better than that of p i -persistent CSMA and that of priority-based CSMA protocol in terms of throughput and fairness.