S-bases of proportional algebra.
Schur's Theorem on the Stability of Networks
A complex polynomial is called a Hurwitz polynomial if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical networks.In this article we prove Schur's criterion [17] that allows to decide whether a polynomial p(x) is Hurwitz without explicitly computing its roots: Schur's recursive algorithm successively constructs polynomials pi(x) of lesser degree by division with x - c, ℜ {c} < 0, such that pi(x) is Hurwitz if...
Semi-Markov-based approach for the analysis of open tandem networks with blocking and truncation
This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are nonexponentially distributed with means sA and sB , respectively. Both nodes have buffers with finite capacities. In this type of network, if the second...
Signals generated in memristive circuits
Signals generated in circuits that include nano-structured elements typically have strongly distinct characteristics, particularly the hysteretic distortion. This is due to memristance, which is one of the key electronic properties of nanostructured materials. In this article, we consider signals generated from a memrsitive circuit model. We demonstrate numerically that such signals can be efficiently represented in certain custom-designed nonorthogonal bases. The proposed method ensures that the...
Signed directed graph based modeling and its validation from process knowledge and process data
This paper is concerned with the fusion of information from process data and process connectivity and its subsequent use in fault diagnosis and process hazard assessment. The Signed Directed Graph (SDG), as a graphical model for capturing process topology and connectivity to show the causal relationships between process variables by material and information paths, has been widely used in root cause and hazard propagation analysis. An SDG is usually built based on process knowledge as described by...
Single-sweep timing simulation
Singular fractional linear systems and electrical circuits
A new class of singular fractional linear systems and electrical circuits is introduced. Using the Caputo definition of the fractional derivative, the Weierstrass regular pencil decomposition and the Laplace transformation, the solution to the state equation of singular fractional linear systems is derived. It is shown that every electrical circuit is a singular fractional system if it contains at least one mesh consisting of branches only with an ideal supercapacitor and voltage sources or at least...
Some necessary and sufficient conditions for the output controllability of temporal Boolean control networks
This paper investigates the output controllability problem of temporal Boolean networks with inputs (control nodes) and outputs (controlled nodes). A temporal Boolean network is a logical dynamic system describing cellular networks with time delays. Using semi-tensor product of matrices, the temporal Boolean networks can be converted into discrete time linear dynamic systems. Some necessary and sufficient conditions on the output controllability via two kinds of inputs are obtained by providing...
Some nonlinear shift register generators
Some Properties of the Combinational Measure of Complexity of Binary Words
Some remarks on the canonical forms for pseudo-Boolean functions.
Stanovení podmínek stability při návrzích metodou geometrického místa kořenů
Sur la minimisation d'une expression représentant une famille de fonctions booléennes
Syntéza sekvenčních obvodů s využitím obecných paměťových elementů
Synthesis of finite state machines for CPLDs
The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented approach...
Synthesis of probability transformers
The behavior of a Markov network with respect to an absorbing class: the target algorithm
In this paper, we face a generalization of the problem of finding the distribution of how long it takes to reach a “target” set T of states in Markov chain. The graph problems of finding the number of paths that go from a state to a target set and of finding the n-length path connections are shown to belong to this generalization. This paper explores how the state space of the Markov chain can be reduced by collapsing together those states that behave in the same way for the purposes of calculating...
The computation of characteristic vectors of logical-probabilistic expressions
The conjunction of a particular form of majority logic functions and some of its properties
The full periodicity kernel for a class of graph maps.