A method is proposed to find key components of traffic networks with homogenous and heterogeneous topologies, in which heavier traffic flow is transported. One component, called the skeleton, is the minimum spanning t...
详细信息
A method is proposed to find key components of traffic networks with homogenous and heterogeneous topologies, in which heavier traffic flow is transported. One component, called the skeleton, is the minimum spanning tree (MST) based on the zero flow cost (ZCMST). The other component is the infinite incipient percolation cluster (IIC) which represents the spine of the traffic network. Then, a new method to analysis the property of the bottleneck in a large scale traffic network is given from a macroscopic and statistical viewpoint. Moreover, three effective strategies are proposed to alleviate traffic congestion. The significance of the findings is that one can significantly improve the global transport by enhancing the capacity in the ZCMST with a few links, while for improving the local traffic property, improving a tiny fraction of the traffic network in the IIC is effective. The result can be used to help traffic managers prevent and alleviate traffic congestion in time, guard against the formation of congestion bottleneck, and make appropriate policies for traffic demand management. Meanwhile, the method has very important theoretical significance and practical worthiness in optimizing traffic organization, traffic control, and disposal of emergency.
In order to improve the face recognition performance using Gabor wavelet, a multi-channel dimension reduction scheme (MDRS) employing PCA algorithm is proposed. In addition, the selection of scales and orientations in...
详细信息
The memory state feedback control problem for a class of discrete-time systems with input delay and unknown state delay is addressed based on LMIs and Lyapunov-Krasovskii functional method. Under the action of our des...
详细信息
The memory state feedback control problem for a class of discrete-time systems with input delay and unknown state delay is addressed based on LMIs and Lyapunov-Krasovskii functional method. Under the action of our designed adaptive control law, the unknown time-delay parameter is included in memory state feedback controller. Using LMI technique, delay-dependent sufficient conditions for the existence of the feedback controller are obtained. Finally, the effectiveness of the proposed design method is demonstrated by a numerical example.
The evolutionary prisoner＇s dilemma game is investigated under different initial distributions for cooperators and defectors on scale-free networks with a tunable clustering coefficient. It is found that, on the one ...
The evolutionary prisoner＇s dilemma game is investigated under different initial distributions for cooperators and defectors on scale-free networks with a tunable clustering coefficient. It is found that, on the one hand, cooperation can be enhanced with the increasing clustering coefficient when only the most connected nodes are occupied by cooperators initially. On the other hand, if cooperators just occupy the lowest-degree nodes at the beginning, then the higher the value of the clustering coefficient, the more unfavorable the environment for cooperators to survive for the increment of temptation to defect. Thereafter, we analytically argue these nontrivial phenomena by calculating the cooperation probability of the nodes with different degrees in the steady state, and obtain the critical values of initial frequency of cooperators below which cooperators would vanish finally for the two initial distributions.
In order to have a self-organized multi-agent system exhibit some expected collective behavior,it is necessary that some agents(called leaders) are informed about the expected behavior and able to *** a fundamental qu...
详细信息
In order to have a self-organized multi-agent system exhibit some expected collective behavior,it is necessary that some agents(called leaders) are informed about the expected behavior and able to *** a fundamental question is: how many such leaders are needed? Naturally the answer depends on the model *** this paper the model proposed by Vicsek et *** used for the *** analyzing the system dynamics and estimating the characteristics of the initial neighbor graph,a lower bound on the ratio of leaders is provided that guarantees the expected consensus being reached almost surely.
Robust real-time tracking of non-rigid objects is a challenging task. Color is a powerful feature for tracking deformable objects in image sequences with complex backgrounds. Color distribution is applied, as it is ro...
详细信息
We study the effects of degree correlations on the evolution of cooperation in the prisoner＇s dilemma game with individuals located on two types of positively correlated networks. It is shown that the positive degree...
详细信息
We study the effects of degree correlations on the evolution of cooperation in the prisoner＇s dilemma game with individuals located on two types of positively correlated networks. It is shown that the positive degree correlation can either promote or inhibit the emergence of cooperation depending on network configurations. Furthermore, we investigate the probability to cooperate as a function of connectivity degree, and find that high-degree individuals generally have a higher tendency to cooperate. Finally, it is found that small-degree individuals usually change their strategy more frequently, and such change is shown to be unfavourable to cooperation for both kinds of networks.
We investigate the evolutionary Prisoner＇s Dilemma and the Snowdrift Game on small-world networks in a realistic social context where individuals consider their local contributions to their group and update their str...
详细信息
We investigate the evolutionary Prisoner＇s Dilemma and the Snowdrift Game on small-world networks in a realistic social context where individuals consider their local contributions to their group and update their strategies by self-questioning. An individual with introspection can determine whether its current strategy is superior by playing a virtual round of the game and its local contribution is defined as the sum of all the payoffs its neighbors collect against it. In our model, the performance of an individual is determined by both its payoff and local contribution through a linear combination. We demonstrate that the present mechanism can produce very robust cooperative behavior in both games. Furthermore, we provide theoretical analysis based on mean-field approximation, and find that the analytical predictions are qualitatively consistent with the simulation results.
To facilitate the configuration selection of reconfigurable manufacturing systems, it needs to generate K (predefined number) best configurations as candidates for a given demand period. This paper presents a systemat...
详细信息
To facilitate the configuration selection of reconfigurable manufacturing systems, it needs to generate K (predefined number) best configurations as candidates for a given demand period. This paper presents a systematic approach for the problem of generating single-product flow-line (SPFL) configurations. The problem is to determine the SPFL configuration's parameters including number of workstations, number of paralleling machines and machine type as well as assigned operations for each workstation. Given an operation precedence graph (PG) and machine options for each operation, the objective is to minimise the capital costs of SPFL configurations subject to space limitation, investment limitation, and capacity constraint as well as precedence constraints among operations. For linear PG with one feasible operation sequence (FOS), a constrained K-shortest paths (CKSP) formulation is developed and a CKSP algorithm is introduced to generate K-best configurations including the optimal and near-optimal ones. For simple PG (a small number of FOSs), the K-best configurations are found by repeatedly solving the CKSP problem associated with every FOS. For general PG (numerous FOSs), a GA based approach is proposed to identify K-best configurations through searching within the optimal configurations associated with all FOSs. Case studies illustrate the effectiveness and efficiency of our approach.
In this paper,the mean-square exponential stability problem is investigated for stochastic Markovian jump open-loop systems with mode-dependent time-varying *** constructing a modified Lyapunov-Krasovskii functional,a...
In this paper,the mean-square exponential stability problem is investigated for stochastic Markovian jump open-loop systems with mode-dependent time-varying *** constructing a modified Lyapunov-Krasovskii functional,a delay-dependent sufficient condition for the solvability of the above problem is presented in terms of linear matrix inequalities（LMIs）.The decay rate can be a given finite positive constant and synchronously the derivative of time-varying delays is only required to have a upper bound which is not required to be less than *** examples are presented to illustrate the effectiveness of the theoretical result.
暂无评论