Distributed adaptive synchronization control for complex dynamical networks with nonlinear derivative coupling is proposed. The distributed adaptive strategies are constituted by directed connections among nodes. By means of the parameters separation, the nonlinear functions can be transformed into the linearly form. Then effective distributed adaptive techniques are designed to eliminate the effect of time-varying parameters and made the considered network synchronize a given trajectory in the sense of square error norm. Furthermore, the coupling matrix is not assumed to be symmetric or irreducible. An example shows the applicability and feasibility of the approach.

A new concept of $H_{\infty }$ formation is proposed to handle a group of agents navigating in a free and an obstacle-laden environment while maintaining a desired formation and changing formations when required. With respect to the requirements of changing formation subject to internal or external events, a hybrid multiagent system (HMAS) is formulated in this paper. Based on the fact that obstacles impose the negative effect on the formation of HMAS, the $H_{\infty }$ formation is introduced to reflect the above disturbed situation and quantify the attenuation level of obstacle avoidance via the $H_{\infty }$-norm of formation stability. An improved Newtonian potential function and a set of repulsive functions are employed to guarantee the HMAS formation-keeping and collision-avoiding from obstacles in a path planning problem, respectively. Simulation results in this paper show that the proposed formation algorithms can effectively allow the multiagent system to avoid penetration into obstacles while accomplishing prespecified global objective successfully.

The structural scheme of mechanical elastic energy storage (MEES) system served by permanent magnet synchronous motor (PMSM) and bidirectional converters is designed. The aim of the research is to model and control the complex electromechanical system. The mechanical device of the complex system is considered as a node in generalized coordinate system, the terse nonlinear dynamic model of electromechanical coupling for the electromechanical system is constructed through Lagrange-Maxwell energy method, and the detailed deduction of the mathematical model is presented in the paper. The theory of direct feedback linearization (DFL) is applied to decouple the nonlinear dynamic model and convert the developed model from nonlinear to linear. The optimal control theory is utilized to accomplish speed tracking control for the linearized system. The simulation results in three different cases show that the proposed nonlinear dynamic model of MEES system is correct; the designed algorithm has a better control performance in contrast with the conventional PI control.

This paper details the infinite dimensional dynamics of a prototype microfluidic thermal process that is used for genetic analysis purposes. Highly effective infinite dimensional dynamics, in addition to collocated sensor and actuator architecture, require the development of a precise control framework to meet the very tight performance requirements of this system, which are not fully attainable through conventional lumped modeling and controller design approaches. The general partial differential equations describing the dynamics of the system are separated into steady-state and transient parts which are derived for a carefully chosen three-dimensional axisymmetric model. These equations are solved analytically, and the results are verified using an experimentally verified precise finite element method (FEM) model. The final combined result is a framework for designing a precise tracking controller applicable to the selected lab-on-a-chip device.

In this paper, we consider a single-index varying-coefficient model with application to longitudinal data. In order to accommodate the within-group correlation, we apply the block empirical likelihood procedure to longitudinal single-index varying-coefficient model, and prove a nonparametric version of Wilks’ theorem which can be used to construct the block empirical likelihood confidence region with asymptotically correct coverage probability for the parametric component. In comparison with normal approximations, the proposed method does not require a consistent estimator for the asymptotic covariance matrix, making it easier to conduct inference for the model's parametric component. Simulations demonstrate how the proposed method works.

This paper addresses the adaptive synchronization of complex dynamical networks with nonlinear dynamics. Based on the Lyapunov method, it is shown that the network can synchronize to the synchronous state by introducing local adaptive strategy to the coupling strengths. Moreover, it is also proved that the convergence speed of complex dynamical networks can be increased via designing a state predictor. Finally, some numerical simulations are worked out to illustrate the analytical results.

The flight scheduling is a real-time optimization problem. Whenever the schedule is disrupted, it will not only cause inconvenience to passenger, but also bring about a large amount of operational losses to airlines. Especially in case an irregular flight happens, the event is unanticipated frequently. In order to obtain an optimal policy in airline operations, this paper presents a model in which the total delay minutes of passengers are considered as the optimization objective through reassigning fleets in response to the irregular flights and which takes into account available resources and the estimated cost of airlines. Owing to the uncertainty of the problem and insufficient data in the decision-making procedure, the traditional modeling tool (probability theory) is abandoned, the uncertainty theory is applied to address the issues, and an uncertain programming model is developed with the chance constraint. This paper also constructs a solution method to solve the model based on the classical Hungarian algorithm under uncertain conditions. Numerical example illustrates that the model and its algorithm are feasible to deal with the issue of irregular flight recovery.

A new topic in the analyses of complex systems dynamics, considering that the movements of complex system entities take place on continuum but nondifferentiable curves, is proposed. In this way, some properties of complex systems (barotropic-type behaviour, self-similarity behaviour, chaoticity through turbulence and stochasticization, etc.) are controlled through nondifferentiability of motion curves. These behaviours can simulate the standard properties of the complex systems (emergence, self-organization, adaptability, etc.).

An improved Susceptible-Infected-Susceptible (SIS) epidemic diffusion model with population migration between two cities is modeled. Global stability conditions for both the disease-free equilibrium and the endemic equilibrium are analyzed and proved. The main contribution of this paper is reflected in epidemic modeling and analysis which considers unequal migration rates, and only susceptible individuals can migrate between the two cities. Numerical simulation shows when the epidemic diffusion system is stable, number of infected individuals in one city can reach zero, while the number of infected individuals in the other city is still positive. On the other hand, decreasing population migration in only one city seems not as effective as improving the recovery rate for controlling the epidemic diffusion.

This survey note describes a new type of distributed parameter control systems—the two-point boundary value problems for infinite-dimensional dynamical systems, particularly, for hyperbolic systems of partial differential equations of second order, some of the discoveries that have been done about it and some unresolved questions.

Multiangle social network recommendation algorithms (MSN) and a new assessment method, called similarity network evaluation (SNE), are both proposed. From the viewpoint of six dimensions, the MSN are classified into six algorithms, including user-based algorithm from resource point (UBR), user-based algorithm from tag point (UBT), resource-based algorithm from tag point (RBT), resource-based algorithm from user point (RBU), tag-based algorithm from resource point (TBR), and tag-based algorithm from user point (TBU). Compared with the traditional recall/precision (RP) method, the SNE is more simple, effective, and visualized. The simulation results show that TBR and UBR are the best algorithms, RBU and TBU are the worst ones, and UBT and RBT are in the medium levels.

Proper orthogonal decomposition is a popular approach for determining the principal spatial structures from the measured data. Generally, model reduction using empirical eigenfunctions (EEFs) can generate a relatively low-dimensional model among all linear expansions. However, the neglectful modes representing only a tiny amount of energy will be crucial in the modeling for certain type of nonlinear partial differential equations (PDEs). In this paper, an optimal combination of EEFs is proposed for model reduction of nonlinear partial differential equations (PDEs), obtained by the basis function transformation from the initial EEFs. The transformation matrix is derived from straightforward optimization techniques. The present new EEFs can keep the dynamical information of neglectful modes and generate a lower-dimensional and more precise dynamical system for the PDEs. The numerical example shows its effectiveness and feasibility for model reduction of the nonlinear PDEs.

Computing the average shortest-path length of a large scale-free network needs much memory space and computation time. Hence, parallel computing must be applied. In order to solve the load-balancing problem for coarse-grained parallelization, the relationship between the computing time of a single-source shortest-path length of node and the features of node is studied. We present a dynamic programming model using the average outdegree of neighboring nodes of different levels as the variable and the minimum time difference as the target. The coefficients are determined on time measurable networks. A native array and multimap representation of network are presented to reduce the memory consumption of the network such that large networks can still be loaded into the memory of each computing core. The simplified load-balancing model is applied on a network of tens of millions of nodes. Our experiment shows that this model can solve the load-imbalance problem of large scale-free network very well. Also, the characteristic of this model can meet the requirements of networks with ever-increasing complexity and scale.

Vehicle crash test is considered to be the most direct and common approach to assess the vehicle crashworthiness. However, it suffers from the drawbacks of high experiment cost and huge time consumption. Therefore, the establishment of a mathematical model of vehicle crash which can simplify the analysis process is significantly attractive. In this paper, we present the application of LPV-ARMAX model to simulate the car-to-pole collision with different initial impact velocities. The parameters of the LPV-ARMAX are assumed to have dependence on the initial impact velocities. Instead of establishing a set of LTI models for vehicle crashes with various impact velocities, the LPV-ARMAX model is comparatively simple and applicable to predict the responses of new collision situations different from the ones used for identification. Finally, the comparison between the predicted response and the real test data is conducted, which shows the high fidelity of the LPV-ARMAX model.