相关论文: First-order Complete and Computationally Complete …

Over the last decade, the term spatial computing has grown to have two different, though not entirely unrelated, definitions. The first definition of spatial computing stems from industry, where it refers primarily to new kinds of…

Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While researchers have identified many uses of spatial conjunction, its…

We consider the classical concept of time of permanence and observe that its quantum equivalent is described by a bona fide self-adjoint operator. Its interpretation, by means of the spectral theorem, reveals that we have to abandon not…

Fitting Gaussian Processes (GPs) provides interpretable aleatoric uncertainty quantification for estimation of spatio-temporal fields. Spatio-temporal deep learning models, while scalable, typically assume a simplistic independent…

The solutions of Hamiltonian equations are known to describe the underlying phase space of a mechanical system. In this article, we propose a novel spatio-temporal model using a strategic modification of the Hamiltonian equations,…

Continuous time (CT) and discrete time (DT) linear time invariant (LTI) systems are commonly introduced through distinct mathematical formalisms, which can obscure their underlying dynamical equivalence. This tutorial presents a unified…

Code based Language Models (LMs) have shown very promising results in the field of software engineering with applications such as code refinement, code completion and generation. However, the task of time and space complexity classification…

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a…

Spatiotemporal chaotic systems are difficult to characterize in a model-free manner because of their high dimensionality, strong nonlinearity, and sensitivity to initial conditions. Coupled map lattices, as a representative class of…

A natural language interface (NLI) to databases is an interface that translates a natural language question to a structured query that is executable by database management systems (DBMS). However, an NLI that is trained in the general…

A crucial assumption to reduce computational complexity in spatial-temporal data analysis is separability, which factors the covariance structure into a purely spatial and a purely temporal component. In this paper, we develop statistical…

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

Decision trees are simple, yet powerful, classification models used to classify categorical and numerical data, and, despite their simplicity, they are commonly used in operations research and management, as well as in knowledge mining.…

We study the enumeration of answers to ontology-mediated queries (OMQs) where the ontology is a set of guarded TGDs or formulated in the description logic ELI and the query is a conjunctive query (CQ). In addition to the traditional notion…

The geometric concept of geodesic completeness depends on the choice of the metric field or "metric frame". We develop a frame-invariant concept of "generalised geodesic completeness" or "time completeness". It is based on the notion of…

In quantum gravity, one seeks to combine quantum mechanics and general relativity. In such attempts, one comes across the `problem of time' impasse: the notion of time is conceptually different in each of these theories. In this paper, I…

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. Most often, these formulas are from first-order logic, giving rise to the dynamic…

Visualizing changes over time is fundamental to learning from the past and anticipating the future. However, temporal semantics can be complicated, and existing visualization tools often struggle to accurately represent these complexities.…

Air pollution is a great concern because of its impact on human health and on the environment. Statistical models play an important role in improving knowledge of this complex spatio-temporal phenomenon and in supporting public agencies and…