Related papers: The Zeta ($\zeta$) Notation for Complex Asymptotes
Descriptive complexity may be useful to design programs in a natural declarative way. This is important for parallel computation models such as cellular automata, because designing parallel programs is considered difficult. Our paper…
Traditional human-in-the-loop-based annotation for time-series data like inertial data often requires access to alternate modalities like video or audio from the environment. These alternate sources provide the necessary information to the…
We consider a family of birational transformations of two variables, depending on one parameter, for which simple rational expressions with integer coefficients, for the exact expression of the dynamical zeta function, have been…
For $\alpha>\beta-1>0$, we obtain two sided inequalities for the moment integral $I(\alpha,\beta)= \int_{\mathbb{R}} |x|^{-\beta}|\sin x|^{\alpha}dx$. These are then used to give the exact asymptotic behavior of the integral as $\alpha \to…
There is no single universally accepted definition of "Complexity". There are several perspectives on complexity and what constitutes complex behaviour or complex systems, as opposed to regular, predictable behaviour and simple systems. In…
The out-of-time order correlator (OTOC) has recently become relevant in different areas where it has been linked to scrambling of quantum information and entanglement. It has also been proposed as a good indicator of quantum complexity. In…
We derive the analytical expression of the coordinate time $t$ in terms of the eccentric anomaly $u$ at the second post-Newtonian order in General Relativity for a compact binary system moving on eccentric orbits. The parametrization of $t$…
One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL. In this paper, we consider the application of OCATA to the problems of model-checking and…
One clock alternating timed automata OCATA have been recently introduced as natural extension of (one clock) timed automata to express the semantics of MTL (Ouaknine, Worrell 2005). We consider the application of OCATA to problem of…
We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the $[\Theta(\log n), \Theta(n)]$ region, in two settings. We present one…
We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting…
Time ordering may be defined by first defining the limit of no time ordering (NTO) in terms of a time average of an external interaction, V(t). Previously, time correlation was defined in terms of a similar limit called the independent time…
Results of extensive computations of moments of the Riemann zeta function on the critical line are presented. Calculated values are compared with predictions motivated by random matrix theory. The results can help in deciding between those…
In this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, history and future, that can express many timed features succinctly, including timed automata, event-clock automata with and without diagonal…
For any irrational $\alpha > 0$ and any initial value $z_{-1} \in \mathbb{C}$, we define a sequence of complex numbers $(z_n)_{n=0}^{\infty}$ as follows: $z_n$ is $z_{n-1} + e^{2 \pi i \alpha n}$ or $z_{n-1} - e^{2 \pi i \alpha n}$,…
We exhibit an online algorithm finding all distinct palindromes inside a given string in time $\Theta(n\log|\Sigma|)$ over an ordered alphabet and in time $\Theta(n|\Sigma|)$ over an unordered alphabet. Using a reduction from a…
We consider a variant of the classical Erd\H{o}s-R\'enyi random graph, where components with surplus are slowed down to prevent the apparition of complex components. The sizes of the components of this process undergo a similar phase…
Among the fundamental questions in computer science is that of the impact of synchronism/asynchronism on computations, which has been addressed in various fields of the discipline: in programming, in networking, in concurrence theory, in…
Timed automata and register automata are well-known models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can…
Existing temporal relation (TempRel) annotation schemes often have low inter-annotator agreements (IAA) even between experts, suggesting that the current annotation task needs a better definition. This paper proposes a new multi-axis…