奥林匹克主义的历史哲学审视——兼评迪卡娅·凯泽斯塔提乌的“当代奥林匹克主义意识形态的本质变迁”

迪卡娅·凯泽斯塔提乌把奥林匹克主义看作一种被顾拜旦、卡尔.蒂姆、奥林匹克学院等"代理人"不断阐释与建构的元叙事哲学。在评述其博士论文并对奥林匹克主义进行历史哲学审视的基础上认为,立足批判现实主义的立场,以现代性、文化帝国主义、全球化理论为视角,运用质性研究范式,方可深刻阐释倡导普世伦理的奥林匹克主义与地缘政治、社会文化、经济博弈中的哲学议题。并指出多元文化主义是奥林匹克主义未来走向的必由之路。     

Security control for networked control systems with randomly occurring integrity check protection subject to randomly occurring zero-value attacks

This paper investigates the problem of secure control for networked control systems (NCSs) under randomly occurring zero-value attacks (ROZVAs). Specifically, ROZVAs only offset the true signal without injecting obfuscated information or noises, and possess the minimum energy of the added malicious information. To protect system stability against ROZVA, randomly occurring integrity check protection (ROICP) is introduced which prevents malicious data injection with less energy cost than persistently occurring protection. Besides the random phenomena of ROZVA and ROICP, which are characterized by two mutually independent random variables obeying the Bernoulli distribution, the randomly occurring time delays caused by ROICP are also considered in system modelling. According to the built stochastic linear system model, security analysis of the NCS with ROICP subject to ROZVA is carried out and sufficient condition for stochastic stability is derived via a linear matrix inequality (LMI) approach. Based on the proposed condition, a compensation feedback controller is designed to facilitate system stability. Finally, simulation results show the effectiveness of the proposed method.     

Distributed control of cluster lag consensus for first-order multi-agent systems on QUAD vector fields

This paper addresses the problem of cluster lag consensus for first-order multi-agent systems which can be formulated as moving agents in a capacity-limited network. A distributed control protocol is developed based on local information, and the robustness of the protocol is analyzed by using tools of Frobenius norm, Lyapunov functional and matrix theory. It is shown that when the root agents of the clusters are influenced by the active leader and the intra-coupling among agents is stronger enough, the multi-agent system will reach cluster lag consensus. Moreover, cluster lag consensus for multi-agent systems with a time-varying communication topology and heterogeneous multi-agent systems with a directed topology are studied. Finally, the effectiveness of the proposed protocol is demonstrated by some numerical simulations.     

Non-fragile control of positive Markovian jump systems

This paper investigates the non-fragile control for positive Markovian jump systems both in continuous-time and discrete-time cases with actuator uncertainty. It is assumed that the coefficient matrices of the non-fragile controller is unknown and bounded. The state-feedback controller gain consists of nominal controller gain and gain perturbation. First, a set of state-feedback controllers for the considered system are designed by using a stochastic co-positive Lyapunov function integrated with linear programming approach. Under the designed controllers, the resulting closed-loop systems are positive and stochastically stable. Then, the proposed controller design approach is extended to discrete-time systems. Through comparisons, it is shown that existing results are special cases of the presented ones in the paper. Finally, two examples are given to illustrate the effectiveness of the proposed design.     

Uniform upper bound of the second largest eigenvalue of stochastic matrices with equal-neighbor rule

Given the number of vertices only, we provide a uniform upper bound of the second largest eigenvalue (SLE) of stochastic matrices induced from rooted graphs under the equal-neighbor rule, by acquiring a tight upper bound of its scrambling constant (SC). Furthermore, with the concept of canonical form of rooted graphs, we find the least connective topology of rooted graphs in the sense of SC. When more information on the graph topology is available, a more accurate bound is also provided. Our result is applied to estimate the convergence rate of consensus protocols studied in system and control literature.