نتایج جستجو برای: collision probability
تعداد نتایج: 264069 فیلتر نتایج به سال:
Robotic manipulators designed for home assistance and new surgical procedures often have significant uncertainty in their actuation due to compliance requirements, cost constraints, and size limits. We introduce a new integrated motion planning and control algorithm for robotic manipulators that makes safety a priority by explicitly considering the probability of unwanted collisions. We first p...
The method of stable random projections is useful for efficiently approximating the lα distance (0 < α ≤ 2) in high dimension and it is naturally suitable for data streams. In this paper, we propose to use only the signs of the projected data and we analyze the probability of collision (i.e., when the two signs differ). Interestingly, when α = 1 (i.e., Cauchy random projections), we show that t...
Orbit determination in application to the estimation of impact probability has the goal of determining the evolution of the state probability density function (pdf) and determining a measure of the probability of collision. Nonlinear gravitational interaction and non-conservative forces can make the pdf far from Gaussian. This work implements three nonlinear sequential estimators: the Extended ...
We investigate autonomous opportunistic spectrum access (OSA) strategies for a distributed CR network, where two or more distributed CRs sense the channels sequentially in some sensing order until they find a free channel to transmit on, if one exists. First, we evaluate the performance of a traditional OSA strategy in terms of probability of success (probability that a given cognitive radio fi...
In Wireless Local Area Network, wireless node will suffer due to the hidden terminal node. This hidden terminal node leads to high collision, high drop rate of packets and high delay. To avoid this hidden terminal node, wireless nodes use the control messages to know the status of the destination nodes. Another issue in the WLAN is less coverage range with lesser number of nodes. To increase th...
MD4 is a hash function developed by Rivest in 1990. It serves as the basis for most of the dedicated hash functions such as MD5, SHAx, RIPEMD, and HAVAL. In 1996, Dobbertin showed how to find collisions of MD4 with complexity equivalent to 2 MD4 hash computations. In this paper, we present a new attack on MD4 which can find a collision with probability 2−2 to 2−6, and the complexity of finding ...
Today’s vehicle collision prediction algorithms are rule-based, and have not benefited from the recent developments in deep learning. This is because it is almost impossible to collect a large amount of collision data from the real world. To address this challenge, we collect a large accident data set using a popular video game named GTA V. Using this accident data set, we develop efficient pre...
To solve the RFID tag collision problem, a new anti-collision algorithm is proposed by improving the binary tree search algorithm. Through improving the requesting establishment, this algorithm reduces the probability of collision bits and the number of tags requiring collision detection time by using the even number bits for impact identification. The simulation results show that compared with...
clear the advantage of the fact that an attacker can know all intermediate values in calculating an outIn this paper we revisit the tequniques for collision put. This fact is the most different assumption for attacks and study the relation between maximum an attacker from block cipher’s case. differential characteristic probability and a limit of However Wang et al. showed in the last two years...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید