We provide a useful method for calculating the state vector of a state equation efficiently in a max-plus algebraic system. For a discrete event system whose precedence relationships are represented by a directed acyclic graph, computing the transition matrix, which includes the Kleene star operation of a weighted adjacency matrix, is occasionally the bottleneck. On the other hand, the common o...

BACKGROUND Multiple sclerosis (MS) is a chronic inflammatory disease of central nervous system (CNS) and is the most common cause of neurologic disability in young adults (20-40 years old). About 2.5 million patients all over the world are suffering from MS. Common symptoms of the disease include sensory disorders, optic neuritis, and limb weakness. Following disease progression, other symptoms...

Introduction Recently, MITRE/SEDI developed a new draft component schema for OVAL to support interaction with the Trusted Platform Module (TPM). At a basic level, this is no different than most other component schemas: it simply expands OVAL's ability to collect system state information into a new component. However, because of some of the unique features of the TPM, this expansion of OVAL also...

Upon increasing the electron density in a quantum wire, the one-dimensional electron system undergoes a transition to a quasi-one-dimensional state. In the absence of interactions between electrons, this corresponds to filling up the second subband of transverse quantization, and there are two gapless excitation modes above the transition. On the other hand, strongly interacting one-dimensional...

Traditional queueing theory deals mainly with one-dimensional stochastic processes like queue or orbit length, virtual or actual waiting or sojourn time, busy period, etc. Discrete or continuous time one-dimensional Markov chains and renewal theory are the main tools for their investigation. However, the increasing complexity of the modern telecommunication networks (heterogeneous bursty correl...

In high-speed data networks, the bit-error-rate specification on the system can be very stringent, i.e., 10 14. At such error rates, it is not feasible to evaluate the performance of a design using straightforward, simulation based, approaches. Nevertheless performance prediction before actual hardware is built is essential for the design process. This work introduces a stochastic model and an ...

Heyman gives an interesting factorization of I ? P , where P is the transition probability matrix for an ergodic Markov Chain. We show that this factoriza-tion is valid if and only if the Markov chain is recurrent. Moreover, we provide a decomposition result which includes all ergodic, null recurrent as well as the transient Markov chains as special cases. Such a decomposition has been shown to...