نتایج جستجو برای: مدل rng

تعداد نتایج: 120600  

2009
Milan Lukic Bogdan Pavkovic Nathalie Mitton Ivan Stojmenovic

Existing theoretical and simulation studies on georouting appear detached from experimental studies in real environments. We set up our test environment by using WSN430 wireless sensor nodes. To overcome the need for significant number of wireless nodes required to perform a realistic experiment in high density network, we introduce a novel approach emulation by using relatively small number of...

Journal: :Ad Hoc Networks 2005
Julien Iguchi-Cartigny François Ingelrest David Simplot-Ryl Ivan Stojmenovic

In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the network. We consider both topology control and broadcast oriented protocols, for which all existing solutions require global network information. In this paper, we describe new localized protocols where nodes require only...

Journal: :Peer-to-Peer Networking and Applications 2011
Oscar Escalante Tania Pérez Julio Solano-González Ivan Stojmenovic

In a broadcasting problem, a message is sent from a source to all the other nodes in the network. Blind flooding is a classical mechanism for broadcasting, where each node retransmits received message to all its neighbors. Despite its important advantages, an increase in the number of requests or the network size or density produces communication overheads that limit the scalability of blind fl...

2006
DEAN RADIN ROGER NELSON YORK DOBYNS JOOP HOUTKOOPER

Experiments suggesting the existence of mind-matter interaction (MMI) effects on the outputs of random number generators (RNG) have been criticized based on the questionable assumption that MMI effects operate uniformly on each random bit, independent of the number of bits used per sample, the rate at which bits are generated, or the psychological conditions of the task. This ‘‘influence-per-bi...

2004
Andrzej Trybulec

(4) For every function yielding function f holds Subf rng f = rng f . (5) For all sets A, B, x and for every function f such that x ∈ A and f ∈ BA holds f (x) ∈ B. (6) For all sets A, B, C such that if C = / 0, then B = / 0 or A = / 0 and for every function f from A into CB holds domκ f (κ) = A 7−→ B. Let us mention that / 0 is function yielding. In the sequel n denotes a natural number and p, ...

Journal: :CoRR 2007
Richard P. Brent

A pseudo-random number generator (RNG) might be used to generate w-bit random samples in d dimensions if the number of state bits is at least dw. Some RNGs perform better than others and the concept of equidistribution has been introduced in the literature in order to rank different RNGs. We define what it means for a RNG to be (d,w)-equidistributed, and then argue that (d,w)-equidistribution i...

2006
Rong Wan Jiaping Liu Zhiwei Wang

ABSTRCT: Use CFD method to study of the air distribution of certain practical project. By using three-dimensional RNG k-εturbulent model, the air distribution of an underground main workshop in hydropower station with heat source at non-isothermal condition has been designed by means of numerical simulation. Solve the controlling equations by using the soft ware of computational fluid dynamics ...

Journal: :Symposium - International Astronomical Union 1993

Journal: :Discrete Mathematics, Algorithms and Applications 2009

Journal: :Optics express 2015
M Stipčević J E Bowers

We present a first random number generator (RNG) which simultaneously uses independent spatial and temporal quantum randomness contained in an optical system. Availability of the two independent sources of entropy makes the RNG resilient to hardware failure and signal injection attacks. We show that the deviation from randomness of the generated numbers can be estimated quickly from simple meas...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید