Random Numbers

The requirements, design principles, and statistical testing approaches of uniform random number generators for simulation are briefly surveyed. An object-oriented random number package where random number streams can be created at will, and with convenient tools for manipulating the streams, is presented. A version of this package is now implemented in the Arena and AutoMod simulation tools. We also test

PACS. 05.40.-a – Fluctuation phenomena, random processes, noise, and Brownian motion. PACS. 45.70.Cc – Static sandpiles; granular compaction. PACS. 83.80.Fg – Granular solids. Abstract. – We study the stress profile of an ordered two-dimensional packing of beads in response to the application of a vertical overload localized at its top surface. Disorder is introduced through the Coulombic friction between the grains which gives some indeterminacy and allows the choice of one constrained random number per grain in the calculation of the contact forces. The so-called “multi-agent ” technique we use lets us deal with systems as large as 1000×1000 grains. We show that the average response profile has a double-peaked structure. At large depth z, the position of these peaks grows with cz, while their widths scales like Dz. c and D are analogous to “propagation ” and “diffusion ” coefficients. Their values depend on that of the friction coefficient µ. At small µ, we get c0 − c ∝ µ and D ∝ ...

Over the past few years, there has been a renewed interest in the consensus clustering problem. Several new methods have been proposed for finding a consensus partition for a set of n data objects that optimally summarizes an ensemble. In this paper, we propose new consensus clustering algorithms with linear computational complexity in n. We consider clusterings generated with a random number of clusters, which we describe by categorical random variables. We introduce the idea of cumulative voting as a solution for the problem of cluster label alignment, where unlike the common one-to-one voting scheme, a probabilistic mapping is computed. We seek a first summary of the ensemble that minimizes the average squared distance between the mapped partitions and the optimal representation of the ensemble, where the selection criterion of the reference clustering is defined based on maximizing the information content as measured by the entropy. We describe cumulative vote weighting schemes and corresponding algorithms to compute an empirical probability distribution summarizing the ensemble. Given the arbitrary number of clusters of the input partitions, we formulate the problem of extracting the optimal consensus as that of finding a compressed summary of the estimated distribution that preserves the maximum relevant information. An efficient solution is obtained using an agglomerative algorithm that minimizes the average generalized Jensen-Shannon divergence within the cluster. The empirical study demonstrates significant gains in accuracy and superior performance compared to several recent consensus clustering algorithms.

Digital information is any type of data that is stored electronically. These data
need to protect its assets and unauthorized access to it and therefore need measures
to protect digital privacy. This process is done in different ways, one of
which is encryption. Encryption provides secure transfer of unauthorized
data over insecure channels. In this paper a method is proposed to create the
keys to the El Gamal PKC algorithm based on chaos theory. The proposed
algorithm uses 3D chaos maps to create keys used in the encryption and
decryption process using an El Gamal algorithm. The time spent encoding
and decoding in milliseconds was calculated and compared with methods
that used 1D and 2D chaotic maps. Also, the results obtained exceeded most
of the statistical and NIST tests. The generated results are tested their reactions
against many types of attacks. Then, the results showed that the proposed method
had an excellent randomness efficiency for creating public and private keys for
El Gamal's algorithm.

This study empirically investigates variations of hill climbing algorithms for training artificial neural networks on the 5-bit parity classification task. The experiments compare the algorithms when they use different combinations of random number distributions, variations in the step size and changes of the neural networks' initial weight distribution. A hill climbing algorithm which uses inline search is proposed. In most

Empirical evidence to the robustness of the analysis of variance (ANOVA) concerning violation of the normality assumption is presented by means of Monte Carlo methods. High-quality samples underlying normally, rectangularly, and exponentially distributed basic populations are created by drawing samples which consist of random numbers from respective generators, checking their goodness of fit, and allowing only the best 10% to

This paper reviews the status of natural resources distance learning programs in both the United States and China and evaluation of the feasibility for American higher education institutions to extend such programs to students in China. Computer-based learning programs were reviewed for a random sample of 300 American colleges and universities. A short fact-finding trip to China was conducted to visit 7 Chinese
to obtain information.

Random numbers are used in a wide variety of applications from simulation and encryption to gambling and clinical trials. A good quality random number generator is an asset for applications like encryption, randomized designs and network and information security. Various mathematical models have been developed in the past to improve the quality of random numbers. It can be construed that in general to obtain random numbers of excellent quality, a complex mathematical model has to be used which can be a performance bottleneck. In this work, we propose a novel technique to implement a True Random Number Generator (TRNG) using sources of uncertainty found within Graphics Processing Units (GPUs) together with histogram equalization to obtain maximum entropy. We evaluate the random numbers generated by our approach using four tests. First, we measure the correlation values between two sequences of random numbers, second, we measure the entropy values, third, we use watermarking, an application used in network security and finally we use Monte Carlo analysis for pi-value calculation. Based on these quality measurements, our method has achieved better results than popular random number generators compared in this work. Furthermore, this approach is a massively scalable solution ideal for high performance computing implementations.

BACKGROUND: A pen device, similar to an insulin pen, has been recently marketed for the administration of follitropin b in cartridges. A randomized controlled trial was performed to compare the efficacy and convenience of this pen device delivering follitropin b with a conventional syringe delivering follitropin a. METHODS: A total of 200 patients needing IVF/ICSI treatment and willing to self-inject

Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (M SRs) are be- low certain thresholds and the missing values in the matrix are replaced with ran- dom numbers. In our previous paper we introduced the dual biclustering method with quadratic optimization to missing data and row inversions. In

Random numbers have been used extensively in many simulation applications like Monte Carlo Integration or computer modeling. But recently security applications have increased the need for strong (secure) random number generation like automatic password generation, encryption algorithms, on-line gambling etc. Thus random number generation has become a challengingand an interesting task. Most classical random number generators, generate sequences that are either linear or predictable hence not suitable for cryptographic and security applications. Others generate sequences that even though they are secure they are not cryptographicallystrong and above all are slow in execution. Also recent advances in random number generation like the construction of Multiple Recursive Generator(MRG) with large orders, Fast Multiple Recursive Gener-ator (FMRG) and DX(system of multiple recursive generators proposed by Deng and Xu (2003)) generators does not generate a strong random number sequences. Th...

Security of information transmitted through the Internet, against passive or active attacks is an international concern. The use of a chaos-based pseudo-random bit sequence to make it unrecognizable by an intruder, is a field of research in full expansion. This mask of useful information by modulation or encryption is a fundamental part of the TLS Internet exchange protocol. In this paper, a new method using discrete chaotic iterations to generate pseudo-random numbers is presented. This pseudo-random number generator has successfully passed the NIST statistical test suite (NIST SP800-22). Security analysis shows its good characteristics. The application for secure image transmission through the Internet is proposed at the end of the paper.

Objective: To evaluate the effectiveness of superoxidized water (MicrocynTM) in diabetic patients with different wounds. Study Design: Single-centre single blinded randomized controlled trial. Place and Duration of Study: Department of General Surgery, ...

Likelihood Ratio medical key parameters calculated on categorical results from diagnostic tests are usually express accompanied with their confidence intervals, computed using the normal distribution approximation of binomial distribution. The approximation creates known anomalies,especially for limit cases. In order to improve the quality of estimation, four new methods (called here RPAC, RPAC0, RPAC1, and RPAC2) were developed and compared with the classical method (called here RPWald), using an exact probability calculation algorithm.Computer implementations of the methods use the PHP language. We defined and implemented the functions of the four new methods and the five criterions of confidence interval assessment. The experiments run for samples sizes which vary in 14 - 34 range, 90 - 100 range (0 < X < m, 0< Y < n), as well as for random numbers for samples sizes (4m, n </= 1000) and binomial variables (1 </= X, Y < m, n). The experiment run shows that the...

Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with providing useful P2P middleware services capable of dealing with resource assignment and management in a large-scale, heterogeneous and unreliable environment. The slicing service, has been proposed to allow for an automatic partitioning of P2P networks into groups (slices) that represent a controllable amount of some resource and that are also ...