相关论文: Adaptive Fibonacci and Pairing Heaps

We present an algorithm that quickly finds falsifying inputs for hybrid systems, i.e., inputs that steer the system towards violation of a given temporal logic requirement. Our method is based on a probabilistically directed search of an…

Humans effortlessly navigate the physical world by predicting how objects behave under gravity and contact forces, yet how such judgments support sequential physical planning under resource constraints remains poorly understood. Research on…

We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and…

Priority queues are fundamental data structures with widespread applications in various domains, including graph algorithms and network simulations. Their performance critically impacts the overall efficiency of these algorithms.…

Adaptive networks are a novel class of dynamical networks whose topologies and states coevolve. Many real-world complex systems can be modeled as adaptive networks, including social networks, transportation networks, neural networks and…

Adaptive network dynamical systems describe the co-evolution of dynamical quantities on the nodes as well as dynamics of the network connections themselves. For dense networks of many nodes, the resulting dynamics are typically…

Frequency hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, we investigate constructions of FHSs and FHS sets with…

Uncertainty quantification of predictive models is crucial in decision-making problems. Conformal prediction is a general and theoretically sound answer. However, it requires exchangeable data, excluding time series. While recent works…

We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires $O(\log n)$ amortized…

Adaptive coupling in networks of interacting neurons has gained recent attention due to the many applications both in biological and in artificial neural networks, where adaptive coupling or synaptic plasticity is considered as a key factor…

In this paper, incremental adaptive mechanisms are presented and characterized, to provide design hints for the development of continuous-time adaptive systems. The comparison with the conventional integral adaptive systems indicates that…

In the recent years, Hopf algebras have been introduced to describe certain combinatorial properties of quantum field theories. I will give a basic introduction to these algebras and review some occurrences in particle physics.

We introduce a model of adaptive temporal networks whose evolution is regulated by an interplay between node activity and dynamic exchange of information through links. We study the model by using a master equation approach. Starting from a…

Multi-relation Question Answering is a challenging task, due to the requirement of elaborated analysis on questions and reasoning over multiple fact triples in knowledge base. In this paper, we present a novel model called Interpretable…

In this paper, we review existing points-to Separation Logics for dynamic memory reasoning and we find that different usages of heap separation tend to be an obstacle. Hence, two total and strict spatial heap operations are proposed upon…

The neural mechanisms supporting flexible relational inferences, especially in novel situations, are a major focus of current research. In the complementary learning systems framework, pattern separation in the hippocampus allows rapid…

We introduce an adaptive scattered data fitting scheme as extension of local least squares approximations to hierarchical spline spaces. To efficiently deal with non-trivial data configurations, the local solutions are described in terms of…

We present the multi-hop extensions of the recently proposed energy-efficient time synchronization scheme for wireless sensor networks, which is based on the asynchronous source clock frequency recovery and reversed two-way message…

We describe the dynamics of a simple adaptive network. The network architecture evolves to a number of disconnected components on which the dynamics is characterized by the possibility of differently synchronized nodes within the same…

Reconfigurable optical topologies are emerging as a promising technology to improve the efficiency of datacenter networks. This paper considers the problem of scheduling opportunistic links in such reconfigurable datacenters. We study the…