随机能源Logistic反馈控制系统的分岔研究

建立了非线性随机动力模型—带噪声的能源Logistic反馈控制模型,应用随机平均法对随机动力模型进行了简化,得到了一个二维的扩散过程.二维过程满足Ito型随机微分方程,应用不变测度理论研究了该模型的随机分岔.最后,给出了数值实验验证了相应的结论.     

基于自适应动态规划的随机时滞线性二次型最优跟踪控制

针对模型未知且带有时滞的随机线性二次型(SLQ)最优跟踪控制问题,提出了一种自适应动态规划(ADP)算法.首先,利用双因果坐标变换导出原时滞系统的等效系统,构造一个新的由等效系统和命令生成器组成的增广系统,并给出该增广系统的随机代数方程.其次,为了解决随机线性二次最优跟踪控制问题,将随机问题转化为确定性问题.然后提出ADP算法,并给出该算法的收敛性分析.为了实现ADP算法,设计了三种神经网络,分别近似最优性能指标函数,最优控制增益矩阵和系统模型.最后,通过一个数值算例验证算法的有效性.     

一种改进的混沌序列产生方法

根据灰度图像的二维直方图的特点,在已有的二维Arnold混沌系统的基础上,结合Bernstein形式的Bézier曲线的生成算法,给出了一种基于生成Bézier曲线的de Casteljau算法构造伪随机序列的方法,实验结果表明生成的二维序列不仅具有伪随机性,而且还具有在近似圆盘中随机分布的性质,这使得该伪随机序列更适合对灰度图像的二维灰度直方图进行基于混沌优化的图像分割.在此基础上,给出了一种基于混沌优化的二维最大熵的灰度图像分割算法,该算法对于含噪图像取得了良好的分割效果.     

M/M/∞随机服务系统的一个递推方法

本文提出一个处理 M/M/∞随机服务系统瞬时行为的交错递推方法.由此不仅可得瞬时状态分布,还给出各种二维随机过程及输出过程的分布、一系列瞬时条件分布、诸过程的瞬时相关系数.最后,当 t 充分大时,对各种瞬时概率给出方便的渐近公式.     

一类二维Markov跳跃非线性时滞系统的镇定控制

研究一类二维Markov跳跃非线性时滞系统的镇定控制问题.给出了Markov跳跃非线性时滞系统解的存在唯一性的一个充分条件,以及系统依概率全局渐近稳定的判别准则.通过构造适当形式的Lyapunov函数,采用积分反推方法给出了一类二维Markov跳跃非线性时滞系统的无记忆状态反馈控制器.证明了在该控制律的作用下,闭环系统平衡点依概率全局渐近稳定.     

有采购提前期的两部件串联系统的更换策略

研究了由两个不同型部件组成的串联系统的最优更换策略,当部件需要更换时,新的同型部件需要提前订购.当部件发生故障时对其进行维修,维修后的工作时间形成随机递减的几何过程,且每次故障后的修理时间形成随机递增的几何过程.以部件更换前的故障次数(N_1,N_2)为策略,以系统经长期运行单位时间内的期望费用最小为目标,研究了二维最优策略问题,给出了寻找最优策略的方法和数值分析.     

M(t)/M/(t)/∞排队系统的瞬时性质

Saaty、Collings与Stoneman给出了M(t)/M(t)/∞排队的瞬时队长分布,张福基进一步讨论了成批到达的情况.本文提出一个母函数递推方法,对系统中各种一维、二维瞬时分布均给出详尽刻划.系统的描述及λ(t)、μ(t)约定同[4].记     

一类混合0-1非凸二次约束二次规划问题的近似算法

研究一类混合0-1非凸二次约束二次规划问题的近似算法.该问题是在M个非凸二次约束与一个基数约束下,求解一个n维向量的极小范数,变量包含M个0-1变量与一个n维连续向量.该问题是NP-难的.在求解其半正定规划(SDP)松弛问题的基础上,提出了一种随机舍入算法,能够得到原始的问题的一个可行解.数值仿真实验结果表明该方法是十分有效的.     

有延迟修理的两部件串联系统的预防维修策略

研究由两个部件串联组成的系统的预防维修策略, 当系统的工作时间达到T时进行预防维修, 预防维修使部件恢复到上一次故障维修后的状态. 当部件发生故障后进行故障维修, 因为各种原因可能会延迟修理. 部件在每次故障维修后的工作时间形成随机递减的几何过程, 且每次故障后的维修时间形成随机递增的几何过程. 以部件进行预防维修的间隔T和更换前的故障次数N组成的二维策略(T,N)为策略, 利用更新过程和几何过程理论求出了系统经长期运行单位时间内期望费用的表达式, 并给出了具体例子和数值分析.     

n维可投影LOtka-Volterra竞争系统的渐近性

对于二维和三维的Lotka-Volterra竞争系统,已有文献证明:当每一个坐标轴上的平衡点均为渐近稳定时,该系统几乎所有解趋于坐标轴上平衡点所组成的点集,即,不趋于坐标轴上平衡点的解集,其测度为零.由此, van den Driessche和Zeeman于1998年提出猜测:对n(n>3)维Lotka-Volterra竞争系统,当每一个坐标轴上的平衡点均为渐近稳定时,该系统几乎所有解趋于坐标轴上平衡点所组成的点集,即,不趋于坐标轴上平衡点的解集,其在n维空间的测度为零.本文证明当n维Lotka-Volterra竞争系统可被逐维投影到一维系统时,该猜测成立,并给出了可投影条件的代数判据.本文所得结论包含了已有文献的结果.     

Geometric decay in level-expanding QBD models

Level-expanding quasi-birth-and-death (QBD) processes have been shown to be an efficient modeling tool for studying multi-dimensional systems, especially two-dimensional ones. Computationally, it changes the more challenging problem of dealing with algorithms for two-dimensional systems to a less challenging one for block-structured transition matrices of QBD type with varying finite block sizes. In this paper, we focus on tail asymptotics in the stationary distribution of a level-expanding QBD process. Specifically, we provide sufficient conditions for geometric tail asymptotics for the level-expanding QBD process, and then apply the result to an interesting two-dimensional system, an inventory queue model.     

Multi-state throughput analysis of a two-stage manufacturing system with parallel unreliable machines and a finite buffer

This paper models and analyzes the throughput of a two-stage manufacturing system with multiple independent unreliable machines at each stage and one finite-sized buffer between the stages. The machines follow exponential operation, failure, and repair processes. Most of the literature uses binary random variables to model unreliable machines in transfer lines and other production lines. This paper first illustrates the importance of using more than two states to model parallel unreliable machines because of their independent and asynchronous operations in the parallel system. The system balance equations are then formulated based on a set of new notations of vector manipulations, and are transformed into a matrix form fitting the properties of the Quasi-Birth–Death (QBD) process. The Matrix-Analytic (MA) method for solving the generic QBD processes is used to calculate the system state probability and throughput. Numerical cases demonstrate that solution method is fast and accurate in analyzing parallel manufacturing systems, and thus prove the applicability of the new model and the effectiveness of the MA-based method. Such multi-state models and their solution techniques can be used as a building block for analyzing larger, more complex manufacturing systems.     

Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue

This paper studies a multi-server queueing system with multiple types of customers and last-come-first-served (LCFS) non-preemptive service discipline. First, a quasi-birth-and-death (QBD) Markov process with a tree structure is defined and some classical results of QBD Markov processes are generalized. Second, the MMAP[K]/PH[K]/N/LCFS non-preemptive queue is introduced. Using results of the QBD Markov process with a tree structure, explicit formulas are derived and an efficient algorithm is developed for computing the stationary distribution of queue strings. Numerical examples are presented to show the impact of the correlation and the pattern of the arrival process on the queueing process of each type of customer.     

Queues with boundary assistance: the effects of truncation

We study a system of two queues with boundary assistance, represented as a continuous-time Quasi-Birth-and-Death process (QBD). Under our formulation, this QBD has a ‘doubly infinite’ number of phases. We determine the convergence norm of Neuts’ R-matrix and, consequently, the interval in which the decay rate of the infinite system can lie.     

A New Method for Finding the Characteristic Roots of E<Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>/E<Subscript><Emphasis Type="Italic">m</Emphasis></Subscript>/1 Queues

In 1953, Smith (Proc Camb Philos Soc 49:449–461, 1953), and, following him, Syski (1960) suggested a method to find the waiting time distribution for one server queues with Erlang-n arrivals and Erlang-m service times by using characteristic roots. Syski shows that these roots can be determined from a very simple equation, but an equation of degree n + m. Syski also shows that almost all of the characteristic roots are complex. In this paper, we derive a set of equations, one for each complex root, which can be solved by Newton’s method using real arithmetic. This method simplifies the programming logic because it avoids deflation and the subsequent polishing of the roots. Using the waiting time distribution, Syski then derived the distribution of the number in the system after a departure. E _n /E _m /1 queues can also formulated as quasi birth-death (QBD) processes, and in this case, the characteristic roots discussed by Syski are closely related to the eigenvalues of the QBD process. The QBD process provides information about the number in system at random times, but they are much more difficult to formulate and solve.     

An Algorithmic Approach for Sensitivity Analysis of Perturbed Quasi-Birth-and-Death Processes

In this paper, we present an algorithmic approach for sensitivity analysis of stationary and transient performance measures of a perturbed continuous-time level-dependent quasi-birth-and-death (QBD) process with infinitely-many levels. By developing a new LU-type RG-factorization using the censoring technique, we obtain the maximal negative inverse of the infinitesimal generator of the QBD process. The derivatives of the stationary performance measures of the QBD process can then be expressed and computed in terms of the maximal negative inverse, overcoming the computational difficulty arising from the use of group inverses of infinite size in the current literature (see Cao and Chen [11]). We also use a stochastic integral functional to study the transient performance measure of the QBD process and show how to use the algorithmic approach for its sensitivity analysis. As an example, a perturbed MAP/PH/1 queue is also analyzed.     

Asymptotics for the sojourn time distribution in the queue defined by a general QBD process with a countable phase space

We consider a FIFO queue defined by a QBD process. When the number of phases of the QBD process is finite, it has been proved that the stationary distribution of sojourn times in that queue can be represented as a phase-type distribution. In this paper, we extend this result to the case where the number of phases of the QBD process is countably many and obtain several kinds of asymptotic formula for the steady-state tail probability of sojourn times in the queue when the tail probability decays in exact exponential form.     

On an unreliable-server retrial queue with customer feedback and impatience

Analysis of an unreliable-server retrial queue with customer's feedback and impatience is presented. Truncated classical and constant retrial policies are taken into account. This system is analyzed as a process of quasi-birth-and-death (QBD). The quasi-progression algorithm is applied to compute the rate matrix of QBD model. A recursive solver algorithm for computing the stationary probabilities is also developed. To make the investigated system viable economically, a cost function is developed to decide the optimum values of servers, mean service rate and mean repair rate. Quasi-Newton method, pattern search method and Nelder–Mead simplex direct search method are employed to implement the optimization tasks. Under optimum operating conditions, numerical results are provided for a comparison of retrial policies. We also give a potential application to illustrate the system's applicability.     

An auxiliary server threshold queueing model and its application to the operational characteristics of web server system

This paper analyzes an auxiliary server queueing model in which secondary servers are added to the main server(s) when the queue length exceeds some predetermined threshold value at the main queue. We model this system by the level-dependent quasi-birth-death (QBD) process and develop computation algorithms. We apply this model to the web-server system to explore some specific operational characteristics and draw some useful conclusions.     

Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue

In this paper, we study a discrete time queueing system with multiple types of customers and a first-come-first-served (FCFS) service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual customers have PH-distributions. A GI/M/1 type Markov chain for a generalized age process of batches of customers is introduced. The steady state distribution of the GI/M/1 type Markov chain is found explicitly and, consequently, the steady state distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. We show that the generalized age process and a generalized total workload process have the same steady state distribution. We prove that the waiting times and sojourn times have PH-distributions and find matrix representations of those PH-distributions. When the arrival process is a Markov arrival process with marked transitions, we construct a QBD process for the age process and the total workload process. The steady state distributions of the waiting times and the sojourn times, both at the batch level and the customer level, are obtained from the steady state distribution of the QBD process. A number of numerical examples are presented to gain insight into the waiting processes of different types of customers.AMS subject classification: 60K25, 60J10This revised version was published online in June 2005 with corrected coverdate