English
Related papers

Related papers: The Zeta ($\zeta$) Notation for Complex Asymptotes

200 papers

We present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team semantics, LTL is able to express hyperproperties, which have…

Logic in Computer Science · Computer Science 2025-10-14 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann

A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and not the entities themselves, a temporal graph may be viewed…

Discrete Mathematics · Computer Science 2015-03-03 Othon Michail

Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orientation framework, which can be thought of as mapping an…

Databases · Computer Science 2020-06-26 Michael Yu , Lu Qin , Ying Zhang , Wenjie Zhang , Xuemin Lin

Time-Basic Petri nets, is a powerful formalism for modeling real-time systems where time constraints are expressed through time functions of marking's time description associated with transition, representing possible firing times. We…

Logic in Computer Science · Computer Science 2021-03-15 Matteo Camilli

The Riemann-Siegel theta function $\vartheta(t)$ is examined for $t\to+\infty$. Use of the refined asymptotic expansion for $\log\,\g(z)$ shows that the expansion of $\vartheta(t)$ contains an infinite sequence of increasingly subdominant…

Classical Analysis and ODEs · Mathematics 2020-04-09 R. B. Paris

Time-varying networks describe a wide array of systems whose constituents and interactions evolve over time. They are defined by an ordered stream of interactions between nodes, yet they are often represented in terms of a sequence of…

Statistical Mechanics · Physics 2013-10-23 Bruno Ribeiro , Nicola Perra , Andrea Baronchelli

The Argand diagram is used to display some characteristics of the Riemann Zeta function. The zeros of the Zeta function on the complex plane give rise to an infinite sequence of closed loops, all passing through the origin of the diagram.…

chao-dyn · Physics 2009-10-22 R. K. Bhaduri , Avinash Khare , J. Law

Ontology alignment, a critical process in the Semantic Web for detecting relationships between different ontologies, has traditionally focused on identifying so-called "simple" 1-to-1 relationships through class labels and properties…

Artificial Intelligence · Computer Science 2024-07-24 Reihaneh Amini , Sanaz Saki Norouzi , Pascal Hitzler , Reza Amini

This paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and assigns a data value to a fixed, finite set of attributes.…

Logic in Computer Science · Computer Science 2016-01-12 Normann Decker , Daniel Thoma

In a recent paper we have considered the long time asymptotics of the periodic Toda lattice under a short range perturbation and we have proved that the perturbed lattice asymptotically approaches a modulated lattice. In the present paper…

Exactly Solvable and Integrable Systems · Physics 2010-05-26 Spyridon Kamvissis , Gerald Teschl

Temporal text, i.e., time-stamped text data are found abundantly in a variety of data sources like newspapers, blogs and social media posts. While today's data management systems provide facilities for searching full-text data, they do not…

Databases · Computer Science 2018-10-16 Kai Lin , Subhasis Dasgupta , Amarnath Gupta

We study the characteristic function and moments of the integer-valued random variable $\lfloor X+\alpha\rfloor$, where $X$ is a continuous random variables. The results can be regarded as exact versions of Sheppard's correction. Rounded…

Probability · Mathematics 2007-05-23 Svante Janson

Recent explainable artificial intelligence (XAI) methods for time series primarily estimate point-wise attribution magnitudes, while overlooking the directional impact on predictions, leading to suboptimal identification of significant…

Machine Learning · Computer Science 2025-06-06 Hyeongwon Jang , Changhun Kim , Eunho Yang

Some asymptotic notions for random variables are discussed. In particular, different versions of O and o for sequences of random variables are studied. The results are elementary and more or less well-known, but collected here for future…

Probability · Mathematics 2011-08-22 Svante Janson

We study the problem of optimal observability and prove time asymptotic observability estimates for the Schr\"odinger equation with a potential in $L^{\infty}(\Omega)$, with $\Omega\subset \mathbb{R}^d$, using spectral theory. An elegant…

Analysis of PDEs · Mathematics 2018-10-09 Alden Waters , Ekaterina Merkurjev

An analytic representation with Theta functions on a torus, for systems with variables in Z(d), is considered. Another analytic representation with Theta functions on a strip, for systems with positions in a circle S and momenta in Z, is…

Mathematical Physics · Physics 2015-08-04 P. Evangelides , C. Lei , A. Vourdas

Human annotation is a time-consuming task that requires a significant amount of effort. To address this issue, interactive data annotation utilizes an annotation model to provide suggestions for humans to approve or correct. However,…

Computation and Language · Computer Science 2024-06-04 Chen Huang , Yiping Jin , Ilija Ilievski , Wenqiang Lei , Jiancheng Lv

We consider a Dirichlet series $\sum_{n=1}^{\infty}a_n^{-s}$, where $a_n$ satisfies a linear recurrence of arbitrary degree with integer coefficients. Under suitable hypotheses, we prove that it has a meromorphic continuation to the complex…

Number Theory · Mathematics 2023-01-30 Álvaro Serrano Holgado , Luis Manuel Navas Vicente

Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract…

Formal Languages and Automata Theory · Computer Science 2023-06-22 S. Akshay , Paul Gastin , Shankara Narayanan Krishna

We evaluate two large language models (LLMs) ability to perform argumentative reasoning. We experiment with argument mining (AM) and argument pair extraction (APE), and evaluate the LLMs' ability to recognize arguments under progressively…

Computation and Language · Computer Science 2025-07-03 Adrian de Wynter , Tangming Yuan
‹ Prev 1 8 9 10 Next ›