17698779
Neural Network Identification Method Applied to the Nonlinear System
A kind of neural network solution method has been proposed in the paper aiming at a class of non-linear process control system with the characteristic of time delay. In this scheme, a new-type associative memory neural network is used to model the controlled system, and the fuzzy neural network with inverse identification structure is adopted to control the nonlinear process system. This fuzzy neural network control method adopts the structure of three layers combine neural network identifier with inverse structure. Computer simulation and lab application show that it is effective to adopt this scheme to control on-linear process system with time delay.
13120258
Hybrid Ant Colony Algorithm and Its Application on Function Optimization
A new hybrid ant colony algorithm was proposed. Firstly, weight factor was introduced to the binary ant colony algorithm, and then we obtained a new probability by combining probability model of Population based incremental learning (PBIL) with transfer probability of ants pheromone . The new population are produced by probability model of PBIL, transfer probability of ants pheromone and the probability of proposed algorithm so that population polymorphism is ensured and the optimal convergence rate and the ability of breaking away from the local minima are improved. Optimization simulation results based on the benchmark test functions show that the hybrid algorithm has higher convergence rate and stability than binary ant colony algorithm (BACA) and Population based incremental learning (PBIL).
13160546
A Population-Based Incremental Learning Algorithm with Elitist Strategy
The population-based incremental learning (PBIL) is a novel evolutionary algorithm combined the mechanisms of the Genetic Algorithm with competitive learning. In this paper, the influence of the number of selected best solutions on the convergence speed of the PBIL is studied by experiment. Based on experimental results, a PBIL algorithm with elitist strategy, named Double Learning PBIL (DLPBIL), is proposed. The new algorithm learns both the selected best solutions in current population and the optimal solution found so far in the algorithm at same time. Experimental results show that the DLPBIL out-performs the standard PBIL. Both the convergence speed and the solution quality are improved.
42790149
Dynamic Complexities in a Lotka-volterra Predator-prey Model Concerning impulsive Control Strategy
Based on the classical Lotka–Volterra predator–prey system, an impulsive differential equation to model the process of periodically releasing natural enemies and spraying pesticides at different fixed times for pest control is proposed and investigated. It is proved that there exists a globally asymptotically stable pest-eradication periodic solution when the impulsive period is less than some critical value. Otherwise, the system can be permanent. We observe that our impulsive control strategy is more effective than the classical one if we take chemical control efficiently. Numerical results show that the system we considered has more complex dynamics including period-doubling bifurcation, symmetry-breaking bifurcation, period-halving bifurcation, quasi-periodic oscillation, chaos and nonunique dynamics, meaning that several attractors coexist. Finally, a pest–predator stage-structured model for the pest concerning this kind of impulsive control strategy is proposed, and we also show that there exists a ...
44654033
Existence and uniqueness of solutionsto first-order multipoint boundary value problems
In this paper, we give existence and uniqueness results for solutions of multipoint boundary value problems of the form 
x'=f(t,x(t))+e(t),t∈(0,1),∑j=1mAjx(ηj)=0, 
where ƒ : [0,1] × Rn → Rn is a Caratheodory function, Ajs (j = 1, 2,, m) are constant square matrices of order n, 0 < η1 η2 << ηm−1, < ηm ⪯ 1, and e(t) ∈ L1([0,1], Rn). The existence of solutions is proven by the coincidence degree theory. As an application, we also give one example to demonstrate our results.
15938540
A small listener for heterogeneous mobile devices: a service enabler with a uniform Web object view
We recently developed "system on mobile devices" (SyD) middleware for rapidly developing and deploying collaborative distributed applications over a collection of autonomous Web objects and data-stores, independent of the underlying device, data, or network. SyDListener is a key component of SyD middleware. SyDListener provides a set of interfaces and classes that allows distributed SyD-based application components to communicate seamlessly in mobile environments. SyDListener provides a uniform object view of the underlying server application and enables client applications to remotely invoke those methods using XML messages. SyDListener is implemented as a multi-threaded wrapper with simple persistence management and asynchronous invocation functionality for J2ME mobile information device profile (MIDP) on connected limited device configuration (CLDL) devices. We discuss the functionality, architecture, implementation, and performance of SyDListener. We believe it is the first comprehensive working prototype of its kind for Java-enabled handhelds with a small footprint of 10 KB.
120066926
Entropy-based metrics in swarm clustering
Ant-based clustering methods have received significant attention as robust methods for clustering. Most ant-based algorithms use local density as a metric for determining the ants' propensities to pick up or deposit a data item; however, a number of authors in classical clustering methods have pointed out the advantages of entropy-based metrics for clustering. We introduced an entropy metric into an ant-based clustering algorithm and compared it with other closely related algorithms using local density. The results strongly support the value of entropy metrics, obtaining faster and more accurate results. Entropy governs the pickup and drop behaviors, while movement is guided by the density gradient. Entropy measures also require fewer training parameters than density-based clustering. The remaining parameters are subjected to robustness studies, and a detailed analysis is performed. 
 
In the second phase of the study, we further investigated Ramos and Abraham's (In: Proc 2003 IEEE Congr Evol Comput, Hoboken, NJ: IEEE Press; 2003. pp 1370–1375) contention that ant-based methods are particularly suited to incremental clustering. Contrary to expectations, we did not find substantial differences between the efficiencies of incremental and nonincremental approaches to data clustering. © 2009 Wiley Periodicals, Inc.
2862662
Distributed network self-management model based on CSCW
Computer network system has become a large-scale distributed system. But various kinds of existing network management solutions cannot manage it efficiently and network management is facing the new challenges. Applying the principles of CSCW to network management by multi-agent system is a novel train of thought of constructing the new generation network management system. Distributed network self-management model (DNSM), which is based on multi-agent system, adopts the management policies based on management domain and provides users with Web-based management way, was put forward in this paper. This model not only provides network management with more intelligence but also avoids the usage of amounts of network bandwidth. The experimental results show that DNSM is better than the existing network management solutions on performance for the large-scale computer network.