Real-time guaranteed cost control of MIMO networked control systems with packet disordering

This paper discusses guaranteed cost control for multi-input and multi-output (MIMO) networked control systems (NCSs) with multi-channel packet disordering. Considering the time-varying and bounded network transmission delay, packet dropout and packet disordering, a novel model of NCSs is proposed by introducing the concept of packet displacement. It is worthwhile mentioned that this model can fully describe the dynamic characteristic of network and always guarantee the newest control input executed by the plant, which makes that the plant can be controlled in real time. The resulting closed-loop systems are jump linear systems due to the newest signals executed subject to Markovian chains. A real-time controller is designed for uncertain and certain NCSs based on Markovian theory combined with linear matrix inequality (LMI) techniques such that the closed-loop cost function value is not more than a specified upper bound that varies according to Quality of Services (QOS). Finally, numerical examples are given to illustrate the effectiveness of the proposed method.     

一种结合DWT和FARIMA的网络拥塞控制机制

针对自相似流量具有的长相关和突发性特征,结合离散小波变换(DWT)和时间序列分析中的FARIMA过程,提出构建一种混合的网络流量预测模型来对网络行为的发展趋势进行分析和预测,并以预测结果辅助AQM的REM显式拥塞标记,从而提高流量控制的动态性以实现对传统网络协议策略的优化.实验表明该方案可有效改善协议性能,具有良好的稳定性和低丢失率特征.     

基于多智能体的大众生产系统稳定性研究

采用多智能体建模与仿真的方法,基于REPAST平台分别研究大众生产系统在智能体数量不能增加的封闭系统中以及智能体数量能够增长、具有生命期限且网络结构是动态变化的开放系统中的稳定性。分析结果表明,在封闭系统中,智能体数量无法大量增长,外部干扰会通过智能体之间的网络拓扑结构扩大化,从而使系统走向崩溃;而在开放系统中,智能体数量能够快速增长,并具有生命期限时,系统最终稳定时会运行在较低水平上,但整个系统不会出现崩塌现象。     

Design guidelines for Classroom Multiplayer Presential Games (CMPG)

In a Classroom Multiplayer Presential Game (CMPG) peers interact collaboratively with the virtual world and amongst themselves in a shared space. The design of this kind of game, however, is a complex process that must consider instruction strategies, methodology, usability and ludic aspects. This article’s aim is to develop and systematize guidelines for the design of CMPGs. To develop these guidelines we used a three-step process: evaluating an initial implementation of a CMPG and finding its problems; defining guidelines that can help overcome these problems; and redesigning the game based on the guidelines before testing it in a real class scenario to assess how helpful the guidelines were in solving the initial problems.     

The efficiency of identifying timed automata and the power of clocks

We develop theory on the efficiency of identifying (learning) timed automata. In particular, we show that: (i) deterministic timed automata cannot be identified efficiently in the limit from labeled data and (ii) that one-clock deterministic timed automata can be identified efficiently in the limit from labeled data. We prove these results based on the distinguishability of these classes of timed automata. More specifically, we prove that the languages of deterministic timed automata cannot, and that one-clock deterministic timed automata can be distinguished from each other using strings in length bounded by a polynomial. In addition, we provide an algorithm that identifies one-clock deterministic timed automata efficiently from labeled data.Our results have interesting consequences for the power of clocks that are interesting also out of the scope of the identification problem.     

Global existence and nonexistence for degenerate parabolic equations with nonlinear boundary flux

In this paper, by constructing various kinds of sub- and super-solutions and using the basic properties of M-matrix, we give the necessary and sufficient conditions of global existence for nonnegative solutions to a degenerate parabolic system with completely coupled boundary conditions, which generalize the recent results of, for instance, Cui [Z. Cui, Critical curves of the non-Newtonian polytropic filtration equations coupled with nonlinear boundary conditions, Nonlinear Anal. 68 (2008) 3201–3208], Zhou–Mu [J. Zhou, C. Mu, Algebraic criteria for global existence or blow-up for a boundary coupled system of nonlinear diffusion equations, Appl. Anal. 86 (2007) 1185–1197] etc.     

On global solutions to fractional functional differential equations with infinite delay in Fréchet spaces

In this paper, we investigate global uniqueness results for fractional functional differential equations with infinite delay in Fréchet spaces. We shall rely on a nonlinear alternative of Leray-Schauder type in Fréchet spaces due to Frigon and Granas. The results are obtained by using the α-resolvent family (S_α(t))_t≥0 on a complex Banach space X combined with the above-mentioned fixed point theorem. As an application, a controllability result with one parameter is also provided to illustrate the theory.     

Multilevel augmentation algorithms based on fast collocation methods for solving ill-posed integral equations

This paper continues the theme of the recent work Chen et al. (2008) [18], in which fast collocation methods are introduced for solving ill-posed Fredholm integral equations of the first kind. We develop in this paper multilevel augmentation algorithms, which lead to fast solutions of the discrete equations resulting from fast collocation methods. Regularization parameter choice strategies are given for proposed methods. The theoretical analysis and numerical experiments illustrate the accuracy and efficiency of the algorithm.     

On a new class of analytic functions associated with conic domain

The aim of this paper is to generalize the conic domain defined by Kanas and Wisniowska, and define the class of functions which map the open unit disk E onto this generalized conic domain. A brief comparison between these conic domains is the main motivation of this paper. A correction is made in selecting the range interval of order of conic domain.     

Further results of recursive evaluation for compound distribution with the severity distribution of mixed type

Yang et al. [J.P. Yang, S.H. Cheng, Q. Wu, Recursive equations for compound distribution with the severity distribution of the mixed type, Science in China Series A 48 (2005) 594-609] investigated a recursive procedure for a kind of compound distributions with the number of claims belonging to (a,b)-family and the severity distribution of the mixed type. In this paper, we extend their results by assuming that the claim number belongs to a larger class. As applications, the excess-of-loss reinsurance treaty is discussed and concrete examples are considered in some detail.