Markov analysis of qualitative dynamics1

Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient.     

Locked discrete event systems: How to model and how to unlock

To model qualitative aspects of discrete event systems, i.e., the order of the events is of sole importance, we use a triple consisting of the set of all possible events (the alphabet), the set of all behavior (possible strings of events), and the set of all tasks (completed behavior). We use this view to model synchronous as well as asynchronous connection of systems. Moreover, it is easy to define notions like deadlock and livelock in this view. We give a method to construct a second system that, in connection with the original system, gets rid of its deadlock and/or livelock. A state-space representation is introduced. In this representation computations can be done effectively.     

偏振模色散统计特性的研究

利用动态方程研究了偏振模色散矢量的统计特性 ,分别用统计系综和频率系综两种方法进行数值模拟。数值结果表明 ,统计系综和频率系综两种方法的结果一致。在大归一化距离条件下 ,均方根时延的平方随归一化距离线性变化 ;偏振模色散矢量的各个分量服从高斯分布 ,差分群时延服从麦克斯韦分布 ;偏振模色散矢量弥散于整个邦加球     

Achieving fair service with a hybrid scheduling scheme for CICQ switches

Providing performance guarantees for arriving traffic flows has become an important measure for today’s routing and switching systems. However, none of current scheduling algorithms built on CICQ (combined input and cross-point buffered) switches can provide flow level performance guarantees. Aiming at meeting this requirement, the feasibility of implementing flow level scheduling is discussed thoroughly. Then, based on the discussion, it comes up with a hybrid and stratified fair scheduling (HSFS) scheme, which is hierarchical and hybrid, for CICQ switches. With HSFS, each input port and output port can schedule variable length packets independently with a complexity of O(1). Theoretical analysis show that HSFS can provide delay bound, service rate and fair performance guarantees without speedup. Finally, we implement HSFS in SPES (switch performance evaluation system) to verify the analytical results.     

Stability analysis and H∞ control for hybrid complex dynamical networks with coupling delays

This paper formulates and studies a model of complex dynamical networks with switching topology and coupling delays. Based on the hybrid control and Lyapunov function, the stability and robust H_∞ control of such networks with impulsive and switching effects, which have not been studied before, are addressed with some criteria derived. Examples are given to illustrate the effectiveness of the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Stabilization of Rössler chaotic dynamical system using fuzzy logic control algorithm

This paper proposes a fuzzy logic control algorithm (FLCA) to stabilize the Rössler chaotic dynamical system. The fuzzy logic control system is based on a Takagi-Sugeno-Kang inference engine and the stability analysis in the sense of Lyapunov is carried out using Lyapunov’s direct method. The new FLCA is formulated to offer sufficient inequality stability conditions. The asymptotic complexity of our algorithm is analyzed and proved to be lower in comparison with that of linear matrix inequality-based FLCAs. A set of simulation results illustrates the effectiveness of the proposed FLCA.     

Downscaling of the flood discharge in a probabilistic framework

Many modeled and observed data are in coarse resolution, which are required to be downscaled. This study develops a probabilistic method to downscale 3-hourly runoff to hourly resolution. Hourly data recorded at the Poldokhtar Stream gauge (Karkheh River basin, Iran) during flood events (2009–2019) are divided into two groups including calibration and validation. Statistical tests including Chi-Square and Kolmogorov–Smirnov test indicate that the Burr distribution is proper distribution functions for rising and falling limbs of the floods’ hydrograph in calibration (2009–2013). A conditional ascending/descending random sampling from the constructed distributions on rising/falling limb is applied to produce hourly runoff. The hourly-downscaled runoff is rescaled based on observation to adjust mean three-hourly data. To evaluate the efficiency of the developed method, statistical measures including root mean square error, Nash–Sutcliffe efficiency, Kolmogorov-Smirnov, and correlation are used to assess the performance of the downscaling method not only in calibration but also in validation (2014–2019). Results show that the hourly downscaled runoff is in close agreement with observations in both calibration and validation periods. In addition, cumulative distribution functions of the downscaled runoff closely follow the observed ones in rising and falling limb in two periods. Although the performance of many statistical downscaling methods decreases in extreme values, the developed model performs well at different quantiles (less and more frequent values). This developed method that can properly downscale other hydroclimatological variables at any time and location is useful to provide high-resolution inputs to drive other models. Furthermore, high-resolution data are required for valid and reliable analysis, risk assessment, and management plans.     

基于线性动态系统稀疏编码的异常事件检测

线性动态系统模型结合稀疏编码实现异常事件检测。线性动态系统可有效地捕捉动态纹理在时间和空间的转移信息,描述视频的时空小块。然而,线性动态系统属于非欧氏空间,无法直接用传统的稀疏编码进行异常检测。基于约束凸优化公式,将相似性变换与稀疏编码结合,可实现线性动态系统稀疏编码的优化求解。实验表明,所提出的方法具有更好的性能。     

Methodology for estimating probability of dynamical system’s failure for concrete gravity dam简

Methodology for the reliability analysis of hydraulic gravity dam is the key technology in current hydropower construction.Reliability analysis for the dynamical dam safety should be divided into two phases：failure mode identification and the calculation of the failure probability.Both of them are studied based on the mathematical statistics and structure reliability theory considering two kinds of uncertainty characters（earthquake variability and material randomness）.Firstly,failure mode identification method is established based on the dynamical limit state system and verified through example of Koyna Dam so that the statistical law of progressive failure process in dam body are revealed; Secondly,for the calculation of the failure probability,mathematical model and formula are established according to the characteristics of gravity dam,which include three levels,that is element failure,path failure and system failure.A case study is presented to show the practical application of theoretical method and results of these methods.     

基于动态优化PCA人脸识别算法的实现

提出一种人脸识别动态优化PCA算法。采用ORL人脸数据库,对数据库中图像进行放缩归一化操作并按升序或降序排列。然后,将数据库分为最大值类、中值类、最小值类三个部分,求其各类平均值,特征值个数选取9和10,实现人脸识别和重建。随机采样人脸图像,采用DCT算法将其转换到频域进行分析,通过比较整个数据库平均脸与三类中各自平均脸,算法运行后,特征值个数可以实现自动优化。实验结果显示,该算法在一定程度上可用来对传统PCA算法部分关键参数进行优化。