Stability Analysis of Social Foraging Swarm with Interaction Time Delays
This paper considers a swarm model with an attraction-repulsion function involving variable communication time lags and an attractant/repellent. It is proved that for quadratic attractant/repellent profiles the members of the swarm with time delays will aggregate and form a cohesive cluster of finite size in a finite time. Moreover, all the swarm members will converge to more favorable areas of the quadratic attractant/repellent profiles under certain conditions in the presence of communication delays.

title: Collective Behavior of Dynamic Swarm with General Topology and Complex Communication Time-Delays
abstract: This paper presents a complex interaction delayed swarm model with a general topology to study the collective behavior of a group of autonomous agents using the nearest neighbor rulers in the presence of communication delays. It is proved that under certain conditions the swarm members will converge to a finite region around the swarm weighted center and move together in a cohesive cluster following the motion of the weighted center. For general cases, the delayed swarm may display more complex dynamics, including oscillation and divergence, depending on the delay values. This suggests that the time delay may have significant consequence in the collective dynamics of swarms.

title: Flocking of Multi-Vehicle Systems With A Leader
abstract: We study the coordinated motion of a group of vehicles with a leader based on nearest neighbor rules. The leader may be a special vehicle in the group or an external signal (virtual leader) to steer the vehicle group. The control law consists of two parts: a potential field force that makes the vehicles attract to each other and at the same time avoid collision in the group, and an alignment force that makes all vehicles' headings and speeds to converge respectively to common values. We assume that the interaction patterns are either fixed or switching based on the information topologies of the leader and member vehicles. Our approach is based on the Lyapunov theory and basic graph theory. We also consider the effect of noise on the collective dynamics of the group. Numerical simulations are worked out to illustrate the analytical results

title: Complex Analysis of Anisotropic Swarms
abstract: This paper considers a continuous time swarm model with individuals moving with a nutrient profile (or an attractant/repellent) in an n-dimensional space. The swarm behavior is a result of a balance between inter-individual interplays as well as the interplays of the swarm agents with their environment. It is proved that the swarm members aggregate and eventually form a cohesive cluster of finite size around the swarm weighted center in a finite time under certain conditions.

title: Controllability of a Leader-Follower Dynamic Network with Interaction Time Delays
abstract: This paper studies the controllability of a leader-follower network of dynamic agents in the presence of communication delays. The network dynamics is governed by nearest neighbor rules over a fixed communication topology. The leader is a particular agent acting as an external input to steer the other member agents. We derive sufficient conditions of the controllability of the dynamic network and give an example to illustrate the main results.

title: Collective Behavior Analysis of a Class of Social Foraging Swarms
abstract: This paper considers an anisotropic swarm model that consists of a group of mobile autonomous agents with an attraction-repulsion function that can guarantee collision avoidance between agents and a Gaussian-type attractant/repellent nutrient profile. The swarm behavior is a result of a balance between inter-individual interplays as well as the interplays of the swarm individuals (agents) with their environment. It is proved that the members of a reciprocal swarm will aggregate and eventually form a cohesive cluster of finite size. It is shown that the swarm system is completely stable, that is, every solution converges to the equilibrium point set of the system. Moreover, it is also shown that all the swarm individuals will converge to more favorable areas of the Gaussian profile under certain conditions. The results of this paper provide further insight into the effect of the interaction pattern on self-organized motion for a Gaussian-type attractant/repellent nutrient profile in a swarm system.

title: An EM based training algorithm for cross-language text categorization
abstract: Due to the globalization on the Web, many companies and institutions need to efficiently organize and search repositories containing multilingual documents. The management of these heterogeneous text collections increases the costs significantly because experts of different languages are required to organize these collections. Cross-language text categorization can provide techniques to extend existing automatic classification systems in one language to new languages without requiring additional intervention of human experts. In this paper, we propose a learning algorithm based on the EM scheme which can be used to train text classifiers in a multilingual environment. In particular, in the proposed approach, we assume that a predefined category set and a collection of labeled training data is available for a given language L/sub 1/. A classifier for a different language L/sub 2/ is trained by translating the available labeled training set for L/sub 1/ to L/sub 2/ and by using an additional set of unlabeled documents from L/sub 2/. This technique allows us to extract correct statistical properties of the language L/sub 2/ which are not completely available in automatically translated examples, because of the different characteristics of language L/sub 1/ and of the approximation of the translation process. Our experimental results show that the performance of the proposed method is very promising when applied on a test document set extracted from newsgroups in English and Italian.

title: Hybrid Particle Swarm Optimization for Flow Shop Scheduling with Stochastic Processing Time
abstract: The stochastic flow shop scheduling with uncertain processing time is a typical NP-hard combinatorial optimization problem and represents an important area in production scheduling, which is difficult because of inaccurate objective estimation, huge search space, and multiple local minima. As a novel evolutionary technique, particle swarm optimization (PSO) has gained much attention and wide applications for both function and combinatorial problems, but there is no research on PSO for stochastic scheduling cases. In this paper, a class of PSO approach with simulated annealing (SA) and hypothesis test (HT), namely PSOSAHT is proposed for stochastic flow shop scheduling with uncertain processing time with respect to the makespan criterion (i.e. minimizing the maximum completion time). Simulation results demonstrate the feasibility, effectiveness and robustness of the proposed hybrid algorithm. Meanwhile, the effects of noise magnitude and number of evaluation on searching performances are also investigated.

title: Web Page Cleaning for Web Mining through Feature Weighting
abstract: Unlike conventional data or text, Web pages typically contain a large amount of information that is not part of the main contents of the pages, e.g., banner ads, navigation bars, and copyright notices. Such irrelevant information (which we call Web page noise) in Web pages can seriously harm Web mining, e.g., clustering and classification. In this paper, we propose a novel feature weighting technique to deal with Web page noise to enhance Web mining. This method first builds a compressed structure tree to capture the common structure and comparable blocks in a set of Web pages. It then uses an information based measure to evaluate the importance of each node in the compressed structure tree. Based on the tree and its node importance values, our method assigns a weight to each word feature in its content block. The resulting weights are used in Web mining. We evaluated the proposed technique with two Web mining tasks, Web page clustering and Web page classification. Experimental results show that our weighting method is able to dramatically improve the mining results.

title: Development Of An Soi-Based Micro Check Valve
abstract: This paper presents a bulk micromachined check valve with very high frequency and extremely low leak rates. The valve is designed to have a hexagonal orifice, a hexagonal membrane flap and three flexible tethers. The three elbow-shaped flexible tethers are used both to secure the membrane flap to the valve seat and to abtain a large flap displacement in the forward flow direction. SOI wafer and DRIE technology are used to implement this micro valve. A very simple farbication process has been developed, and only two photolithographic masks are employed. Preliminary testing on a 1.5 milimeters size check valve shows that a maximum flow rate (DI water) of 35.6ml/min was obtained at pressure drop of 65.5kPa and negligible leakage rate in the reverse flow direction observed at pressure up to 600kPa.

title: Performance Analysis of the HLLACF
abstract: With the popular using of anonymous communication systems, security and overhead traffic attract more attention. HLLCAF was presented to improve the performance of anonymous communication systems. This paper analyzes HLLACF's security and an evaluation algorithm for security is presented. In the end, a simulation experiment and result analysis is given. The theoretic analysis and simulation experiment indicate that the HLLACF can prevent AS-Level passive attack and other similar attacks well while decreasing communication delay and HLLACF also scales well.