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.
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.
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 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.
Object tracking algorithm using modified Particle filter in low frame rate(LFR) video is proposed in this paper,which the object moving significantly and randomly between consecutive frames in the low frame rate ***,P...
详细信息
Object tracking algorithm using modified Particle filter in low frame rate(LFR) video is proposed in this paper,which the object moving significantly and randomly between consecutive frames in the low frame rate ***,Particle filtering use motion transitions to model the movement of the ***,in object tracking with low frame rate sequences,it is very difficult to model significant random jumps of *** key notion of our solution is that using the object detection and extraction to locate the tracked object,while not using the dynamical *** propagate the sample set around the detected regions,which the samples are assumed to be uniformly distributed in the neighborhoods of the detected *** is similar to the general particle filter to propagate *** we compute the likelihood between the target model and the candidate regions,which are based on color histogram *** extensive experiments show that the proposed algorithm performs robustly in a large variety of tracking scenarios.
Previous studies suggest that cooperation prevails when individuals can switch their interaction partners quickly. However, it is still unclear how quickly individuals should switch adverse partners to maximize cooper...
详细信息
Previous studies suggest that cooperation prevails when individuals can switch their interaction partners quickly. However, it is still unclear how quickly individuals should switch adverse partners to maximize cooperation. To address this issue, we propose a simple model of coevolutionary prisoner’s dilemma in which individuals are allowed to either adjust their strategies or switch their defective partners. Interestingly, we find that, depending on the game parameter, there is an optimal tendency of switching adverse partnerships that maximizes the fraction of cooperators in the population. We confirm that the stabilization of cooperation by partner switching remains effective under some situations, where either normalized or accumulated payoff is used in strategy updating, and where either only cooperators or all individuals are privileged to sever disadvantageous partners. We also provide an extended pair approximation to study the coevolutionary dynamics. Our results may be helpful in understanding the role of partner switching in the stabilization of cooperation in the real world.
暂无评论