Imagine that you and some friends are playing a version of roulette. The wheel is divided into 36 sectors, alternately colored red and black. Before spinning the wheel, the contestant chooses a color and then wins or loses depending on whether or not his color comes up. You, the master player, have honed an ability to spin the wheel exactly 3620◦ with high probability. Thus, if the wheel is ini...

In this work, we describe the first single-key attack on the full version of Grain-128 that can recover arbitrary keys. Our attack is based on a new version of a cube tester, which is a factor of about 2 faster than exhaustive search. To practically verify our results, we implemented the attack on the reconfigurable hardware cluster RIVYERA and tested the main components of the attack for dozen...

We describe a new architecture for passive robots and haptic displays, which we call a programmable constraint machine (PCM). An n-dof PCM can, under computer control, exhibit constraints (smooth, impenetrable virtual surfaces of dimensionality < n), or it can allow free n-dof motion. At the heart of the PCM is a nonholonomic element, which is used as a continuously variable transmission (CVT)....

Introduction: Curiosity has been traversing across the northern plains of Gale Crater since August 2012 and on 1/6/17 (Sol 1571) has traveled over ~15 km (based on wheel odometry). The rover is approaching a prominent hematite-bearing ridge, which it will ascend to make measurements, thereafter continuing south up the slopes of Mount Sharp. Curiosity has already encountered multiple mobility is...

Multi-site testing is a technique where a large number of dies are tested in parallel to increase silicon test throughput. The stimuli is stored on the tester and applied concurrently to all the dies on the test board and compared against the response data. To achieve multi-site testing of 16X, 32X, 64X, or 128X, the number of tester-contacted pins must be very low. The overall tester data and ...

The problem of testing monotonicity of a Boolean function f : {0, 1}n → {0, 1} has received much attention recently. Denoting the proximity parameter by ε, the best tester is the non-adaptive Õ( √ n/ε) tester of Khot-Minzer-Safra (FOCS 2015). Let I(f) denote the total influence of f . We give an adaptive tester whose running time is I(f)poly(ε logn).

1. Presenting lower and upper bounds on the complexity of testing Bipartitness; specifically, we present a poly(1/ǫ) · Õ( √ k)-time tester, and an Ω √ k) lower bound on the query complexity of any tester for Bipartitness. 2. Reviewing a quasi-poly(1/ǫ)-time tester for Planarity. The result extends to testing any minor-closed property (i.e., a graph property that is preserved under the omission ...

Wheel wear has been a concern in the railway for several decades. Studying the form change of the wheel/rail contacts in particular railways consisting of sharp curves helps to identify the risk of severe or catastrophic wear to minimize maintenance costs in order to be competitive in the transportation business. In this paper, the wheel/rail contact was studied on the particular railways. The ...

It is adaptive to remember animates, particularly animate agents, because they play an important role in survival and reproduction. Yet, surprisingly, the role of animacy in mnemonic processing has received little direct attention in the literature. In two experiments, participants were presented with pronounceable nonwords and properties characteristic of either living (animate) or nonliving (...

A lateral vehicle localization method by omni-image analysis is proposed for car driving assistance. The method estimates analytically the position and orientation of a lateral vehicle by utilizing the geometric properties of a circular-shaped wheel image of the lateral car taken by a single omni-camera with a hyperboloidal-shaped mirror. Analytical solutions are made possible for fast computat...