A new class of (2k, k, 1) convolutional codes is proposed based on the method that creating long codes by short ones in this paper, by embedding (2k, k) double loop cyclic codes in (2, 1, 1) convolutional codes. The structural mechanism of the codes is revealed by defining a state transition matrix and using algebraic method. It is then shown that the code structure is excellent in both proport...

A class of queueing networks which may have an arbitrary topology, and consist of single-server fork-join nodes with both infinite and finite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector ...

Abst rac t . Linear algebraic techniques for place/transition nets are surveyed. In particular, place and transition invariant vectors and their application to verification, proof and analysis of behavioral properties of marked Petri nets are l)resented. The considered properties are the nonreachabi l i ty of a marking and conditious that hold true for all reachable markings. In addition, it is...

This paper proposes a state-based labeling for acoustic patterns of speech and a method for using this labelling in noiserobust automatic speech recognition. Acoustic time-frequency segments of speech, exemplars, are obtained from a training database and associated with time-varying state labels using the transcriptions. In the recognition phase, noisy speech is modeled by a sparse linear combi...

Shearer height adjusting is a key technology for shearer automation. Considering constraints of present shearer height adjusting, this paper built grey-markovian memory cutting algorithm after analyzing traditional shearer memory cutting algorithm. We firstly constructed prediction mechanism using grey model, then determined state transition probability matrix using markovian, so as to revise f...

Standard subspace algorithms learn Linear Dynamical Systems (LDSs) from time series with the least-square method, where the stability of the system is not naturally guaranteed. In this paper, we propose a novel approach for learning stable systems by enforcing stability directly on the leastsquare solutions. To this end, we first explore the spectral-radius property of the least-square transiti...

Equation (1) is called the measurement equation. It relates the measured observable variables that provide information on αt. We use Zt ∈ M (pt ×m) to denote the matrix of factor loadings. The Ht ∈M (pt × pt) matrix is the variance-covariance matrix of the measurement noise vector, εt. Equation (2) is called the transition equation. We use Gt ∈ M (m×m) to denote the matrix of factor coefficient...

Let mij be the mean first passage time from state i to state j in an n-state ergodic homogeneous Markov chain with transition matrix T . Let G be the weighted digraph without loops whose vertex set is the set of states of the Markov chain and arc weights are equal to the corresponding transition probabilities. We show that