This paper presents a method for computing a minimal bounding ellipsoid that contains the solution set to the uncertain linear equations. Particularly, we aim at finding a bounding ellipsoid for static response of structures, where both external forces and elastic moduli of members are assumed to be imprecisely known and bounded. By using the Slemma, we formulate a semidefinite programming (SDP...

In the recent IEEE communication letter “Grouping-ProofDistance-Bounding Protocols: Keep All Your Friends Close” by Karlsson and Mitrokotsa, a protocol for grouping-proof distance-bounding (GPDB) is proposed. In this letter, we show that the proof that is generated by the proposed GBDP protocol does not actually prove anything. Furthermore, we provide a construction towards a distance-bounding ...

We show that over the base system P− + Σ2-bounding, the existence of a 1-generic degree < 0′′ bounding a minimal degree is equivalent to Σ2-induction.

A set X is prime bounding if for every complete atomic decidable (CAD) theory T there is a prime model A of T decidable in X. It is easy to see that X = 0′ is prime bounding. Denisov claimed that every X <T 0′ is not prime bounding, but we discovered this to be incorrect. Here we give the correct characterization that the prime bounding sets X ≤T 0′ are exactly the sets which are not low2. Reca...

Training an object class detector typically requires a large set of images annotated with bounding-boxes, which is expensive and time consuming to create. We propose novel approach to annotate object locations which can substantially reduce annotation time. We first track the eye movements of annotators instructed to find the object and then propose a technique for deriving object bounding-boxe...

The greatst drawback of Monte Carlo Markov chain methods is lack of knowledge of the mixing time of the chain. The use of bounding chains solves this difficulty for some chains by giving theoretical and experimental upper bounds on the mixing time. Moreover, when used with methodologies such as coupling from the past, bounding chains allow the user to take samples drawn exactly from the station...

Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protocols of Hu, Perrig and Johnson (2003), Sastry, Shankar and Wagner (2003), and Čapkun and Hubaux (2005, 2006) are vulnerable to a guessing attack where the malicious prover preemptively transmits guessed values for a num...

The attractors of Iterated Function Systems in Euclidean space IFS fractals have been the subject of great interest for their ability to visually model a wide range of natural phenomena. Indeed computer-generated plants are often modeled using 3D IFS fractals, and thus their extent in virtual space is a fundamental question, whether for collision detection or ray tracing. A great variety of alg...

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. In this paper, we present a formal analysis of SKI, which recently emerged as the first family of lightweight and provably secure distance bounding protocols. More precisely, we explicate a general formalis...

AIrstract--In standard parameter bounding identification a time-domain bound on the noise signal is used to construct parameter bounds. One of the properties of this standard approach is that there is no consistency if a conservative noise bound has been chosen. It is shown that alternative bounds on the noise signal give rise to consistent parameter bounding identification methods; i.e., asymp...