Related papers: On the waiting time till some patterns occur in i.…
Linear properties are ubiquitous in the representations of language models; however, testing them experimentally remains a challenging task. This work focuses on relational linearity: the hypothesis that, for a fixed relation (e.g.,…
Consider an M/M/$s$ queue with the additional feature that the arrival rate is a random variable of which only the mean, variance, and range are known. Using semi-infinite linear programming and duality theory for moment problems, we…
The ordinal patterns of a fixed number of consecutive values in a time series is the spatial ordering of these values. Counting how often a specific ordinal pattern occurs in a time series provides important insights into the properties of…
Let $X$ be a chemical reaction process, modeled as a multi-dimensional continuous-time jump process. Assume that at given times $0< t_1 < \cdots <t_n$, linear combinations $v_i = L_i X(t_i),\, i=1,\dots ,n$ are observed for given matrices…
We show that the delay time distribution for wave reflection from a one-dimensional random potential is related directly to that of the reflection coefficient, derived with an arbitrarily small but uniform imaginary part added to the random…
This paper addresses the qualitative theory of mixed-order positive linear coupled systems with bounded or unbounded delays. First, we introduce a general result on the existence and uniqueness of solutions to mixed-order linear coupled…
The time needed to exchange information in the physical world induces a delay term when the respective system is modeled by differential equations. Time delays are hence ubiquitous, being furthermore likely to induce instabilities and with…
Techniques for decision making with knowledge of linear constraints on condition probabilities are examined. These constraints arise naturally in many situations: upper and lower condition probabilities are known; an ordering among the…
The time delay between the receptions of ultra-relativistic particles emitted simultaneously is a useful observable for both fundamental physics and cosmology. The expression of the delay when the particles travel through an arbitrary…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log. For example, "a given action is always followed by another action before a given deadline". This…
We exploit recent results on the stability and performance analysis of positive Markov jump linear systems (MJLS) for the design of interval observers for MJLS with and without delays. While the conditions for the $L_1$ performance are…
The problem of finding factors of a text string which are identical or similar to a given pattern string is a central problem in computer science. A generalised version of this problem consists in implementing an index over the text to…
This paper performs the analysis necessary to bound the running time of known, efficient algorithms for generating all longest common subsequences. That is, we bound the running time as a function of input size for algorithms with time…
Internal Pattern Matching (IPM) queries on a text $T$, given two fragments $X$ and $Y$ of $T$ such that $|Y|<2|X|$, ask to compute all exact occurrences of $X$ within $Y$. IPM queries have been introduced by Kociumaka, Radoszewski, Rytter,…
The equidistant subsequence pattern matching problem is considered. Given a pattern string $P$ and a text string $T$, we say that $P$ is an \emph{equidistant subsequence} of $T$ if $P$ is a subsequence of the text such that consecutive…
We discuss the method recently proposed by S. Chubanov for the linear feasibility problem. We present new, concise proofs and interpretations of some of his results. We then show how our proofs can be used to find strongly polynomial time…
We consider the problem of constructing Lyapunov functions for linear differential equations with delays. For such systems it is known that exponential stability implies the existence of a positive Lyapunov function which is quadratic on…
We present here a system with collection of random walks relaying a signal in one dimension in the presence of delays. We are interested in the time for a signal to travel from one end (start) to the other end (finish) of the lined group of…
In this paper, motivated by the notion of independent identically distributed (IID) random variables under sub-linear expectations initiated by Peng, we investigate a law of the iterated logarithm for capacities. It turns out that our…