A constant of 2 appears in the security bounds of the Galois/Counter Mode of Operation, GCM. In this paper, we first develop an algorithm to generate nonces that have a high counter-collision probability. We show concrete examples of nonces with the counter-collision probability of about 2/2. This shows that the constant in the security bounds, 2, cannot be made smaller than 2 if the proof reli...

In this report, we present a methodology for assessing the benefits of different vehicle coordination strategies on the safety of a platoon during emergency braking. One can say that a coordinated braking strategy B is more beneficial than a strategy A, if strategy B leads to a larger reduction in the probability of a collision, the expected number of collisions, and the expected relative veloc...

An implicit, but not necessarily obvious, assumption in all of the current techniques for assessing satellite collision probability is that the relative position uncertainty is perfectly correlated in time. If there is any mis-modeling of the dynamics in the propagation of the relative position error covariance matrix, time-wise de-correlation of the uncertainty will increase the probability of...

Rising deployment of Unmanned Aerial Assets in complex operations requires innovative automatic coordination algorithms, especially for decentralized collision avoidance. The paper investigates a stochastic Probability Collectives (PC) optimizer for the collision avoidance problem defined as an optimization task where efficiency criteria, collision penalties and airplanes’ missions are integrat...

The potential use of systems that seek to communicate a warning of impending collision directly to the driver is examined. Technological advances in collision-warning systems include reliable, low-cost radars, sensors with low noise levels, and the development of accurate detection algorithms for particular crash types, e.g. rear-end collisions. However, fundamental practical constraints make p...

We propose an algorithmic framework for efficient anytime motion planning on large dense geometric roadmaps, in domains where collision checks and therefore edge evaluations are computationally expensive. A large dense roadmap (graph) can typically ensure the existence of high quality solutions for most motion-planning problems, but the size of the roadmap, particularly in high-dimensional spac...

This work seeks to develop an analytical model for the per-node throughput analysis of IEEE 802.11 WLAN networks with hidden nodes by extending Bianchi’s model. With the analytic model we derive the per-node throughput of each node and quantify the impact of hidden nodes on per-node throughput. Through our analysis, we find that nodes having more hidden nodes are likely to have worse throughput...

The Total Collision Energy (TCE) model is used to simulate chemical reactions in the Direct Simulation Monte Carlo method. Colliding particle pairs with total collision energy (translational plus internal energy) greater than an activation energy are accepted for reaction with a probability which depends on the amount of the collision energy in excess of the activation energy. Constants in the ...