BEHAVIORAL RANDOM NUMBER GENERATOR IN CRYPTOGRAPHY

Techniques are described herein for using vehicle data for the creation of a seed number for cryptography generation in-car as a potential replacement for private keys. In this approach, each vehicle generates its keys by itself and is also able to rekey independently without the need for a central key generation system. Unlike vehicle keys today, which are generated centrally (mostly at manufacture time) and thus are exposed to a single source of failure if the key generator is compromised, the impact of a key compromise as described herein is isolated to one vehicle. Thus, whereas a threat today would compromising an entire fleet (e.g., millions) of vehicles, the threat of compromising an entire fleet is significantly minimized using techniques described herein as the scale of the problem now changes from attacking a single point of failure to having to break into multiple vehicles at the same time. With a tunable key refresh rate and independent rekeying, the scale of the problem is made many orders of magnitude more difficult for the attacker

NETWORK-AWARE VR APPLICATIONS

Elements of a modern network environment contain a wealth of important information. Such information may include an advanced digital network architecture management platform’s awareness of the location and wireless coverage information for all of the access points (APs) in a physical space and a cloud-based location services platform’s awareness of the physical location of all of the wireless devices in that space. Techniques are presented herein that support the conveyance of such information to a virtual reality (VR) device for integration with the VR experience of the device user. Though such an integration a user may, for example, be prompted to navigate to a location that offers the best wireless connectivity, thus yielding a better VR experience through less jitter, crisper frames, lower latency for remote frame rendering, etc

Modulation of Robot Orientation via Leg-Obstacle Contact Positions

We study a quadrupedal robot traversing a structured (i.e., periodically spaced) obstacle field driven by an open-loop quasi-static trotting walk. Despite complex, repeated collisions and slippage between robot legs and obstacles, the robot’s horizontal plane body orientation (yaw) trajectory can converge in the absence of any body level feedback to stable steady state patterns. We classify these patterns into a series of “types” ranging from stable locked equilibria, to stable periodic oscillations, to unstable or mixed period oscillations. We observe that the stable equilibria can bifurcate to stable periodic oscillations and then to mixed period oscillations as the obstacle spacing is gradually increased. Using a 3D-reconstruction method, we experimentally characterize the robot leg-obstacle contact configurations at each step to show that the different steady patterns in robot orientation trajectories result from a self-stabilizing periodic pattern of leg-obstacle contact positions. We present a highly-simplified coupled oscillator model that predicts robot orientation pattern as a function of the leg-obstacle contact mechanism. We demonstrate that the model successfully captures the robot steady state for different obstacle spacing and robot initial conditions. We suggest in simulation that using the simplified coupled oscillator model we can create novel control strategies that allow multi-legged robots to exploit obstacle disturbances to negotiate randomly cluttered environments. For more information: Kod*lab (link to kodlab.seas.upenn.edu

Optimal interpreters for lambda-calculus based functional languages

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1990.Includes bibliographical references (leaves 195-197).by Vinod Kumar Kathail.Ph.D

Acceleration of Algebraic Recurrences on Processors with Instruction Level Parallelism

Architectures with instruction level parallelism such as VLIW and superscalar processors provide parallelism in the form of a limited number of pipelined functional units. For these architectures, recurrence height reduction techniques provide significant speedups when they are properly applied. This paper introduces a new technique, called blocked back-substitution

Height Reduction of Control Recurrences for ILP Processors

The performance of applications executing on processors with instruction level parallelism is often limited by control and data dependences. Performance bottlenecks caused by dependences can frequently be eliminated through transformations which reduce the height of critical paths through the program. While height reduction techniques are not always helpful, their utility can be demonstrated in a broad range of important situations. This paper focuse