Related papers: State and history in operating systems
We consider a type of optimal switching problems with non-uniform execution delays and ramping. Such problems frequently occur in the operation of economical and engineering systems. We first provide a solution to the problem by applying a…
A system s behavior is typically specified through models such as state diagrams that describe how the system should behave. According to researchers, it is not clear what a state actually represents regarding the system to be modeled.…
This paper explores the connection between dynamical system properties and statistical physics of ensembles of such systems. Simple models are used to give novel phase transitions; particularly for finite N particle systems with many…
Recurrence is a fundamental property of dynamical systems, which can be exploited to characterise the system's behaviour in phase space. A powerful tool for their visualisation and analysis called recurrence plot was introduced in the late…
Autocatalytic reaction system with a small number of molecules is studied numerically by stochastic particle simulations. A novel state due to fluctuation and discreteness in molecular numbers is found, characterized as extinction of…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
We explore the main processes involved in the evolution of general quantum systems by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by…
The Poisson process of order $i$ is a weighted sum of independent Poisson processes and is used to model the flow of clients in different services. In the paper below we study some extensions of this process, for different forms of the…
The dynamics of an open quantum system can be described by a quantum operation, a linear, complete positive map of operators. Here, I exhibit a compact expression for the time reversal of a quantum operation, which is closely analogous to…
We explore recursive programming with extensible data types. Row types make the structure of data types first class, and can express a variety of type system features including record subtyping and combination of case branches. Our goal is…
Recurrence plots exhibit line structures which represent typical behaviour of the investigated system. The local slope of these line structures is connected with a specific transformation of the time scales of different segments of the…
Business process simulation is an approach to evaluate business process changes prior to implementation. Existing methods in this field primarily support tactical decision-making, where simulations start from an empty state and aim to…
Recurrence in the classical random walk is well known and described by the P\'olya number. For quantum walks, recurrence is similarly understood in terms of the probability of a localized quantum walker to return to its origin. Under…
In this paper a system-oriented formalism of Quantum Information Processing is presented. Its form resembles that of standard signal processing, although further complexity is added in order to describe pure quantum-mechanical effects and…
Reservoir computing is a popular approach to design recurrent neural networks, due to its training simplicity and approximation performance. The recurrent part of these networks is not trained (e.g., via gradient descent), making them…
Closed-loop reference models have recently been proposed for states accessible adaptive systems. They have been shown to have improved transient response over their open loop counter parts. The results in the states accessible case are…
The tail measure of a regularly varying stationary time series has been recently introduced. It is used in this contribution to reconsider certain properties of the tail process and establish new ones. A new formulation of the time change…
To reversify an arbitrary sequential algorithm $A$, we gently instrument $A$ with bookkeeping machinery. The result is a step-for-step reversible algorithm that mimics $A$ step-for-step and stops exactly when $A$ does. Without loss of…
In this paper we will present some alternative types of mathematical description and methods of solution of the fractional-order dynamical system in the state space. We point out the difference in the true sense of the name "state" space…
An approach for the description of stochastic systems is derived. Some of the variables in the system are studied forward in time, others backward in time. The approach is based on a perturbation expansion in the strength of the coupling…