Related papers: On Three Alternative Characterizations of Combined…
Provenance is information about the origin, derivation, ownership, or history of an object. It has recently been studied extensively in scientific databases and other settings due to its importance in helping scientists judge data validity,…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
The network inference problem consists of reconstructing the edge set of a network given traces representing the chronology of infection times as epidemics spread through the network. This problem is a paradigmatic representative of…
We assign generalised convolutions (resp. traces) to graphs whose edges are decorated by smooth kernels (resp. smoothing operators) on a closed manifold. To do so, we introduce the concept of TraPs (Traces and Permutations), which roughly…
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose…
The trace or the $0$th Hochschild--Mitchell homology of a linear category $\mathcal{C}$ may be regarded as a kind of decategorification of $\mathcal{C}$. We compute traces of the two versions $\dot{\mathcal{U}}$ and $\dot{\mathcal{U}}^*$ of…
Even though clustering trajectory data attracted considerable attention in the last few years, most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying…
We provide the first comprehensive study on how to classify trajectories using only their spatial representations, measured on 5 real-world data sets. Our comparison considers 20 distinct classifiers arising either as a KNN classifier of a…
Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network…
Deligne has defined a category which interpolates among the representations of the various symmetric groups. In this paper we show Deligne's category admits a unique nontrivial family of modified trace functions. Such modified trace…
We introduce stratified toposes, which are toposes that are stratified by a suitable hierarchy of universes. The term `stratified topos' recalls the notion of stratified pseudotopos of Moerdijk and Palmgren (2002). However, the details of…
Distributed systems are comprised of many components that communicate together to form an application. Distributed tracing gives us visibility into these complex interactions, but it can be difficult to reason about the system's behavior,…
The paper establishes the Krein and Koplienko trace formulas for multivariable operator functions on symmetrically normed ideals of bounded operators. Results are proved for self-adjoint and maximal dissipative operators. They cover both…
The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…
Given a braided pivotal category $\mathcal C$ and a pivotal module tensor category $\mathcal M$, we define a functor $\mathrm{Tr}_{\mathcal C}:\mathcal M \to \mathcal C$, called the associated categorified trace. By a result of…
A new category of algebro-geometric objects is defined. This construction is a vast generalization of existing F1-theories, as it contains the the theory of monoid schemes on the one hand and classical algebraic theory, e.g. Grothendieck…
The conjugacy class of a generic unimodular 2 by 2 complex matrix is determined by its trace, which may be an arbitrary complex number. In the nineteenth century, it was known that a generic pair (X,Y) of such pairs is determined up to…
Learning to compute, the ability to model the functional behavior of a circuit graph, is a fundamental challenge for graph representation learning. Yet, the dominant paradigm is architecturally mismatched for this task. This flawed…
Taking advantage of a recently discovered associativity property of rule compositions, we extend the classical concurrency theory for rewriting systems over adhesive categories. We introduce the notion of tracelets, which are defined as…
Runtime predictive analyses enhance coverage of traditional dynamic analyses based bug detection techniques by identifying a space of feasible reorderings of the observed execution and determining if any of these witnesses the violation of…