نتایج جستجو برای: rng kepsilon model

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

Journal: :Formalized Mathematics 2011
Hiroyuki Okazaki Noboru Endou Yasunari Shidama

For simplicity, we adopt the following rules: n denotes an element of N, X, X1 denote sets, r, p denote real numbers, s, x0, x1, x2 denote real numbers, S, T denote real normed spaces, f , f1, f2 denote partial functions from R to the carrier of S, s1 denotes a sequence of real numbers, and Y denotes a subset of R. The following propositions are true: (1) Let s2 be a sequence of real numbers an...

Journal: :Arquivos de neuro-psiquiatria 2004
Amer C Hamdan Juberty A de Souza Orlando F A Bueno

OBJECTIVE To evaluate the performance of adult young subjects in a Random Number Generation (RNG) task by controlling the response speed (RS). METHOD Sixty-nine university students of both sexes took part in the experiment (25.05 +/- 6.71 year-old). Participants were alloted into 3 groups which differed in RS rates to generate numbers: 1, 2 and 4 seconds to generate each number. A digital met...

Journal: :Neuropsychologia 2009
Tobias Loetscher Peter Brugger

Based on interactions between number and space apparent from healthy subjects' randomization attempts we expected random number generation (RNG) to be sensitive for the monitoring of unilateral spatial deficits. Specifically, we predicted patients with left-sided hemineglect to evidence "neglect in number space", i.e. to produce a deficiency in the generation of small, "left-sided" numbers. In ...

2003
M. SMITH

1. Objective The objective is to understand and extend a recent theory of turbulence based on dynamic renormalization group (RNG) techniques. The application of RNG methods to hydrodynamic turbulence has been explored most extensively by Yakhot and Orszag (1986). They calculate an eddy viscosity consistent with the Kolmogorov inertial range by systematic elimination of the small scales in the f...

2008
Yvonne S. H. Chang T. Ganesan K. K. Lau

The objective of this research is to compare the use of empirical correlation with Computational Fluid Dynamics (CFD) simulation in determining the pressure gradient in two-phase flow pipelines at the same inlet condition. In this work, the empirical model of Beggs and Brill model had been used whereas the turbulent model applied in the CFD simulation was the Renormalization Group (RNG) k-ε mod...

Journal: :Journal of Applied Fluid Mechanics 2021

Predicting hemolysis is a mandatory task when designing blood flow related mechanisms. For decades, researchers have tried to estimate trauma in red cell (RBC) for applying assist mechanisms development, but the specificity and absence of more physical details limited models this purpose into ranges applications. This work aims present new method modelling considering stress threshold that RBC ...

2009
Ricardo de Vasconcelos Elie Luis Martinez

A Large-Eddy Simulation (LES) of a single-phase turbulent flow in model cyclone geometry was performed. The computational code utilized is a dedicated type of code which incorporates the finite volume method using SIMPLE algorithm on unstructured three-dimensional computational grid. The standard Smagorinsky sub-grid scale model, including Van Driest wall damping function, and Yakhot’s RNG sub-...

2004
Y. Ji M. J. Cook G. R. Hunt

Using computational fluid dynamics (CFD) techniques to model buoyancy-driven airflows has always proved challenging. This work investigates CFD modelling of buoyancy-driven natural ventilation flows in a single-storey space connected to an atrium. The atrium is taller than the ventilated space and when warmed by internal heat gains producing a column of warm air in the atrium and connect space ...

Journal: :IACR Cryptology ePrint Archive 2006
Daniel R. L. Brown

An elliptic curve random number generator (ECRNG) has been proposed in ANSI and NIST draft standards. This paper proves that, if three conjectures are true, then the ECRNG is secure. The three conjectures are hardness of the elliptic curve decisional Diffie-Hellman problem and the hardness of two newer problems, the x-logarithm problem and the truncated point problem.

Journal: :CoRR 2012
George B. Purdy

We discuss a procedure, which should be called Lenstra's fix, for producing secure RSA moduli even when the random number generation is very poor. RSA is uniquely vulnerable to low entropy random number generation. If n = pq and n' = pq' are two (public) moduli, then the computation gcd(n,n') = p factors both moduli and totally compromises the security of both systems. Following a suggestion of...

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

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