• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.1033-1036
• /
• 1988

This paper proposes a new method for generation of uniform random numbers using binary random sequences. These binary sequences are obtained from a de Bruijn sequence by random sampling method. Several statistical tests are carried out for the random numbers generated by the proposed method, and it is shown that the random numbers have good random properties.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.3
• /
• pp.593-610
• /
• 2015

Adaptive Rejection Sampling (ARS) method is a well-known random number generator to acquire a random sample from a probability distribution, and has the advantage of improving the proposal distribution during the sampling procedures, which update it closer to the target distribution. However, the use of ARS is limited since it can be used only for the target distribution in the form of the log-concave function, and thus various methods have been proposed to overcome such a limitation of ARS. In this paper, we attempt to compare five random number generators based on ARS in terms of adequacy and efficiency. Based on empirical analysis using simulations, we discuss their results and make a comparison of five ARS-based methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2317-2337
• /
• 2015

Cryptography provides an effective solution to secure the communication over public networks. The communication over public networks that includes electronic commerce, business and military services, necessitates the requirement of simple and robust encryption techniques. In this paper, a novel image encryption method which employs calligraphy based hybrid scan and random number is presented. The original image is scrambled by pixel position permutation with calligraphy based diagonal and novel calligraphy based scan patterns. The cipher image is obtained by XORing the scrambled image with random numbers. The suggested method resists statistical, differential, entropy, and noise attacks which have been demonstrated with a set of standard images.

• Journal of Internet of Things and Convergence
• /
• v.2 no.1
• /
• pp.23-27
• /
• 2016

There is Generated Moire fringe by fresnel diffraction that explains one of light's physical phenomenon and interference. In this paper, we propose to generate true random numbers by Moire fringe should be used by not pseudo-random number in cryptosystem.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.26 no.2
• /
• pp.194-200
• /
• 2002

A method for simulating flow of extremely low Reynolds number in a vortex-in-cell (VIC) was studied. The viscous diffusion was represented by the random walk method. The validity of this method was proven by applying it to the flows passing over a fence placed vertically at an extremely low Reynolds number. The effects of parameters of the VIC method on the random walk method, such as the number of point vortices, the mesh density and the time increment, were investigated by numerical analysis using a one-dimensional diffusion equation. Changes in the relative error of vorticity depending on those parameters were clarified.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.11
• /
• pp.97-104
• /
• 2020

In this paper, we propose a random number generator PP(PingPong256) and a shuffle technique to improve the problem that the encrypted image is damaged due to a lot of noise by the channel coding of wireless communication recommended in the special environment of space. The PP can constantly generate random numbers by entering an initial value of 512 bits. Random numbers can be encrypted through images and exclusive logical computations. Random numbers can be encrypted through images and exclusive logical computations. The shuffle technique randomly rearranges the image pixel positions while synchronizing the image pixel position and the random number array position and moving the random number arrangement in ascending order. Therefore, the use of PP and shuffle techniques in channel coding allows all pixels to be finely distributed and transmit high-quality images even in poor transmission environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1A
• /
• pp.49-57
• /
• 2011

Random access method for Wibro system is proposed using the Bayesian Technique, which can estimate the number of bandwidth request messages in a frame only based on the number of successful slots. The performance measures such as the maximum average throughput, the mean delay time and the collision ratio are investigated to evaluate the performance of the proposed method. The proposed method shows better performance than the binary exponential backoff algorithm used currently.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.469-476
• /
• 1997

In this paper we present a random number generation method which is one of the rejection methods, To accelerate ratio-of-uniform method we use an efficiency variable γ. After finding the optimal value of γwith respect to interesting distribution with pro-portional density random numbers can be generated in acceleration.

• East Asian mathematical journal
• /
• v.34 no.1
• /
• pp.59-67
• /
• 2018

We present new recurrence formulas for the raw and central moments of a compound binomial random variable. Our approach involves relating two compound binomial random variables that have parameters with a difference of 1 for the number of trials, but which have the same parameters for the success probability for each trial. As a consequence of our recursions, the raw and central moments of a binomial random variable are obtained in a recursive manner without the use of Stirling numbers.

• Honam Mathematical Journal
• /
• v.34 no.2
• /
• pp.209-217
• /
• 2012

Convergence rates in the law of large numbers for i.i.d. random variables have been generalized by Gut[Gut, A., 1978. Marc inkiewicz laws and convergence rates in the law of large numbers for random variables with multidimensional indices, Ann. Probab. 6, 469-482] to random fields with all indices having the same power in the normalization. In this paper we generalize these convergence rates to the identically distributed and negatively associated random fields with different indices having different power in the normalization.