We consider time-dependence of dynamical transport, following a recent study of the stadium billiard in which classical transmission and reflection probabilities were shown to exhibit exponential or algebraic decay depending on the choice of the lead or “hole”, raising the question of whether this feature is due to special properties of the stadium. The system considered here is much more gener...

We investigate the problem of storing a subset of the elements of a boundeduniverse so that searches can be performed in constant time and the space used is within a constant factor of the minimum required. Initially we focus on the static version of this problem and conclude with an enhancement that permits insertions and deletions.

We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called “definitive consensus conjecture” which states that for an undirected connected graph G with diameter D there exist D matrices whose nonzero-pattern complies with the edg...

Testing embedded cores in a System-on-a-chip necessitates the use of a Test Access Mechanism, which provides for transportation of the test data between the chip and the core I/Os. To relax the requirements on the test access mechanism at the core output side, we outline a space and time compaction scheme which minimizes test application time and required test bandwidth at the same time. To imp...

Delay Tolerant Networks (DTNs) are wireless networks in which end-to-end connectivity is sporadic. Routing in DTNs uses past connectivity information to predict future node meeting opportunities. Recent research efforts consider the use of social network analysis (i.e., node communities, centralities etc.) for this forecast. However, most of these works focus on unicast. We believe that group c...

This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs as well as for several restricted graph classes. In particular, an O(vfvT)-additive approximation algorithm is given for broadcasting in general graphs, and an O(log n/ log log n) (multiplicative) ratio approximation is given ...

Motivated by the demand for an effective background model, robust to non-stationary environmental changes in outdoor scenes, we present a technique using Combinatorial Optimization to extract near-optimal background estimates from blocks of temporally localized frames. Using an existing graph cut technique in conjunction with subspace analysis, we demonstrate a novel background model exhibiting...

Feige and Rabinovich, in [FR], gave a deterministic O(log n) approximation for the time it takes a random walk to cover a given graph starting at a given vertex. This approximation algorithm was shown to work for arbitrary reversible Markov Chains. We build on the results of [FR], and show that the original algorithm gives a O(log n) approximation as it is, and that it can be modified to give a...

The time-optimal control of exible structures is considered. We formulate the general time-optimal control problem for single-axis exible structures, and analytical results are given for the number of control switches for the one-bending-mode case, with and without damping. When there is no damping , it is shown that the time optimal control generally has 3 switches and is an odd function of ti...