We report a 12.5 Gb/s physical random number generator (RNG) that uses high-speed threshold detection of the spectrally-sliced incoherent light produced by a fiber amplifier. The system generates a large-amplitude, easily measured, fluctuating signal with bandwidth that is constrained only by the optical filter and electrical detector used. The underlying physical process (spontaneous emission)...

Bloom filters are a probabilistic data structure used to evaluate set membership. A group of hash functions are used to map elements into a Bloom filter and to test elements for membership. In this paper, we propose using multiple groups of hash functions and selecting the group that generates the Bloom filter instance with the smallest number of bits set to 1. We evaluate the performance of th...

Using the CFD model, a new ventilation system design will be found later taking into consideration the ventilation efficiency such as uniformity, stability, and suitability of environmental factors in a naturally ventilated broiler house. Because conducting a field experiment for the ventilation study presented so many difficulties, a reliable 3-dimentional computational fluid dynamics (CFD) mo...

Vortex shedding from a circular cylinder and from an inclined flat plate is computed with a finite volume CFD code with RNG k-ε turbulence model. The wake behind the circular cylinder consists of two trains of vortices of equal strengths. Dependence of vortex patterns on Reynolds numbers at Re between 10 and 10 is investigated. Flow over the inclined flat plate is asymmetric and unequal charact...

CFD modeling using RANS and LES of pollutant dispersion in a three-dimensional street canyon is investigated by comparison with measurements. The purpose of this study is to confirm the accuracy of LES in modeling plume dispersion in a simple street canyon model and to clarify the mechanism of the discrepancy in relation to RANS computation. Simple LES modeling is shown by comparison with wind ...

In this paper X denotes a set, R, R1, R2 denote binary relations, x, y, z denote sets, and n, m, k denote natural numbers. Let us consider a binary relation R on X. Now we state the propositions: (1) fieldR ⊆ X. (2) If x, y ∈ R, then x, y ∈ X. Now we state the propositions: (3) Let us consider sets X, Y . Then (idX)Y = X ∩ Y . (4) 〈x, y〉 ∈ R |2 X if and only if x, y ∈ X and 〈x, y〉 ∈ R. (5) dom(...

The following three propositions are true: (1) For all binary relations a, b holds a · b = a b. (2) Let X be a set, L be a non empty relational structure, S be a non empty relational substructure of L, f , g be functions from X into the carrier of S, and f , g be functions from X into the carrier of L. If f ′ = f and g = g and f ¬ g, then f ′ ¬ g. (3) Let X be a set, L be a non empty relational...

The problem of efficiently disseminating data from a mobile stimulus (source) to multiple mobile users (sinks) in a large-scale sensor network has been challenging. We address this problem by proposing a minimum-energy tree-based data dissemination scheme, Dynamic Localized Minimum-Energy Agent Tree-Based Scheme (DLATS). We exploit the fact that sensor nodes are stationary and location-aware. I...

For simplicity, we adopt the following convention: X denotes a real unitary space, x, y, y1, y2 denote points of X, i, j denote natural numbers, D1 denotes a non empty set, and p1, p2 denote finite sequences of elements of D1. Next we state the proposition (1) Suppose p1 is one-to-one and p2 is one-to-one and rng p1 = rng p2. Then dom p1 = dom p2 and there exists a permutation P of dom p1 such ...