Abstract: This paper suggests an approach to software system architecture specification based on behavior models. The behavior of the system is defined as an event occurring probability and time. The behavior of the system over a time of stationary Markov process is completely characterized by the one step transition matrix, the matrix of instantaneous transition rates. Given the element of the...

There are infinitely many transformations A of the eigenvectors resulting in a soft membership matrix χ satisfying the positivity and partition of unity constraints. Consequently, we have to determine the transformation A that satisfies some optimality condition. The starting point is the question whether it is possible to define some simplified dynamics on the coarse grained state space. Can w...

This paper describes a compression algorithm for probability transition matrices. The compressed matrix is itself a probability transition matrix. In general the compression is not error-free, but the error appears to be small even for high levels of compression.

We study combinatorial multi-armed bandit with probabilistically triggered arms and semi-bandit feedback (CMAB-T). We resolve a serious issue in the prior CMAB-T studies where the regret bounds contain a possibly exponentially large factor of 1/p∗, where p∗ is the minimum positive probability that an arm is triggered by any action. We address this issue by introducing a triggering probability m...

This paper addresses the problem of H∞ filter design for discrete-time Markov jump linear systems (MJLS) with transition probability matrix affected by uncertainties. The proposed methodology allows to take into account the different types of uncertainties usually adopted in MJLS in a systematic way. New conditions are given for H∞ filter design with partial, complete or null Markov mode availa...

This paper shows how the eigenstructure of the adjacency matrix can be used for the purposes of robust graph-matching. We commence from the observation that the leading eigenvector of a transition probability matrix is the steady state of the associated Markov chain. When the transition matrix is the normalised adjacency matrix of a graph, then the leading eigenvector gives the sequence of node...

We describe a new synthesis procedure for designing asynchronous controllers from burst-mode specifications, a class of specifications allowing multiple input change fundamental mode operation. Our implementation of burst-mode state machines uses standard combinational logic, generates low-latency outputs and guarantees freedom from hazards at the gate level. It requires no locally-synthesized ...

The effect of anharmonicity in the intramolecular modes of a model system for exothermic intramolecular nonadiabatic electron transfer is probed by examining the dependence of the transition probability on the exoergicity. The Franck-Condon factor for the Morse potential is written in terms of the Gauss hypergeometric function both for a ground initial state and for the general case, and compar...

BACKGROUND Adaptive designs are becoming increasingly important in clinical research. One approach subdivides the study into several (two or more) stages and combines the p-values of the different stages using Fisher's combination test. METHODS Alternatively to Fisher's test, the recently proposed truncated product method (TPM) can be applied to combine the p-values. The TPM uses the product ...

In this paper, the propagation of electromagnetic waves through an infinite slab of uni- or bi- axial chiral medium is analytically formulated for an arbitrary incidence using 4×4 matrix method. In this powerful method, a state vector differential equation is extracted whose solution is given in terms of a transition matrix relating the tangential components of electric and magnetic fields at t...