We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digita...We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the transient distributions of the system length and of the system waiting time in a simple and unified manner. From these distributions, important performance measures of practical interest can be easily obtained. Numerical examples concerning the superposition of certain video traffics are presented at the end.展开更多
Recently, an approach for the rapid detection of small oscillation faults based on deterministic learning theory was proposed for continuous-time systems. In this paper, a fault detection scheme is proposed for a clas...Recently, an approach for the rapid detection of small oscillation faults based on deterministic learning theory was proposed for continuous-time systems. In this paper, a fault detection scheme is proposed for a class of nonlinear discrete-time systems via deterministic learning. By using a discrete-time extension of deterministic learning algorithm, the general fault functions （i.e., the internal dynamics） underlying normal and fault modes of nonlinear discrete-time systems are locally-accurately approximated by discrete-time dynamical radial basis function （RBF） networks. Then, a bank of estimators with the obtained knowledge of system dynamics embedded is constructed, and a set of residuals are obtained and used to measure the differences between the dynamics of the monitored system and the dynamics of the trained systems. A fault detection decision scheme is presented according to the smallest residual principle, i.e., the occurrence of a fault can be detected in a discrete-time setting by comparing the magnitude of residuals. The fault detectability analysis is carried out and the upper bound of detection time is derived. A simulation example is given to illustrate the effectiveness of the proposed scheme.展开更多
The M?ller algorithm is a self-stabilizing minor component analysis algorithm.This research document involves the study of the convergence and dynamic characteristics of the M?ller algorithm using the deterministic di...The M?ller algorithm is a self-stabilizing minor component analysis algorithm.This research document involves the study of the convergence and dynamic characteristics of the M?ller algorithm using the deterministic discrete time(DDT)methodology.Unlike other analysis methodologies,the DDT methodology is capable of serving the distinct time characteristic and having no constraint conditions.Through analyzing the dynamic characteristics of the weight vector,several convergence conditions are drawn,which are beneficial for its application.The performing computer simulations and real applications demonstrate the correctness of the analysis’s conclusions.展开更多
广义次成分分析(generalized minor component analysis, GMCA)在现代信号处理的许多领域具有重要作用.目前现有的大多算法不能同时具备与算法对应的信息准则,以及收敛性、自稳定性和多个广义次成分提取的性能.针对上述问题,利用一种新...广义次成分分析(generalized minor component analysis, GMCA)在现代信号处理的许多领域具有重要作用.目前现有的大多算法不能同时具备与算法对应的信息准则,以及收敛性、自稳定性和多个广义次成分提取的性能.针对上述问题,利用一种新的信息传播规则,推导出一种广义次成分提取算法,并采用确定离散时间方法(deterministic discrete time, DDT)对算法的全局收敛性能进行分析;同时,通过理论分析算法的收敛性能与算法初始状态的关系,表明算法具有自稳定性.进一步地,探索了算法在多重广义次成分提取方面的应用.相比之前的算法,所提算法具有更快的收敛速度. Matlab仿真验证了所提出算法的各项性能.展开更多
文摘We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the transient distributions of the system length and of the system waiting time in a simple and unified manner. From these distributions, important performance measures of practical interest can be easily obtained. Numerical examples concerning the superposition of certain video traffics are presented at the end.
基金This work was supported by the National Science Fund for Distinguished Young Scholars （No. 61225014）, the National Major Scientific Instruments Development Project （No. 61527811）, the National Natural Science Foundation of China （Nos. 61304084, 61374119）, the Guangdong Natural Science Foundation （No. 2014A030312005）, and the Space Intelligent Control Key Laboratory of Science and Technology for National Defense.
文摘Recently, an approach for the rapid detection of small oscillation faults based on deterministic learning theory was proposed for continuous-time systems. In this paper, a fault detection scheme is proposed for a class of nonlinear discrete-time systems via deterministic learning. By using a discrete-time extension of deterministic learning algorithm, the general fault functions （i.e., the internal dynamics） underlying normal and fault modes of nonlinear discrete-time systems are locally-accurately approximated by discrete-time dynamical radial basis function （RBF） networks. Then, a bank of estimators with the obtained knowledge of system dynamics embedded is constructed, and a set of residuals are obtained and used to measure the differences between the dynamics of the monitored system and the dynamics of the trained systems. A fault detection decision scheme is presented according to the smallest residual principle, i.e., the occurrence of a fault can be detected in a discrete-time setting by comparing the magnitude of residuals. The fault detectability analysis is carried out and the upper bound of detection time is derived. A simulation example is given to illustrate the effectiveness of the proposed scheme.
基金supported by the National Natural Science Foundation of China(61903375,61673387,61374120)Shaanxi Province Natural Science Foundation(2016JM6015)。
文摘The M?ller algorithm is a self-stabilizing minor component analysis algorithm.This research document involves the study of the convergence and dynamic characteristics of the M?ller algorithm using the deterministic discrete time(DDT)methodology.Unlike other analysis methodologies,the DDT methodology is capable of serving the distinct time characteristic and having no constraint conditions.Through analyzing the dynamic characteristics of the weight vector,several convergence conditions are drawn,which are beneficial for its application.The performing computer simulations and real applications demonstrate the correctness of the analysis’s conclusions.
文摘广义次成分分析(generalized minor component analysis, GMCA)在现代信号处理的许多领域具有重要作用.目前现有的大多算法不能同时具备与算法对应的信息准则,以及收敛性、自稳定性和多个广义次成分提取的性能.针对上述问题,利用一种新的信息传播规则,推导出一种广义次成分提取算法,并采用确定离散时间方法(deterministic discrete time, DDT)对算法的全局收敛性能进行分析;同时,通过理论分析算法的收敛性能与算法初始状态的关系,表明算法具有自稳定性.进一步地,探索了算法在多重广义次成分提取方面的应用.相比之前的算法,所提算法具有更快的收敛速度. Matlab仿真验证了所提出算法的各项性能.
