• 충청수학회지
• /
• 제33권1호
• /
• pp.133-146
• /
• 2020

In this paper, we established the complete moment convergence for sequences of m-pairwise negatively quadrant dependent random variables which are weakly upper bounded by a random variable X.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.1295-1299
• /
• 1990

A new method called random sampling method has been proposed for generation of binary random sequences. In this paper, a new concept, called merit factor Fn, is proposed for evaluating the randomness of the binary random sequences generated by the random sampling method. Using this merit factor Fn, some desirable conditions are investigated for uniform random numbers used in the random sampling method.

• Korean Journal of Mathematics
• /
• 제14권1호
• /
• pp.85-93
• /
• 2006

A good arithmetic random number generator should possess full period, uniformity and independence, etc. To obtain the excellent random number generator, many researchers have found good parameters. Also an initial seed is the important factor in random number generator. But, there is no theoretical guideline for using the initial seeds. Therefore, random number generator is usually used with the arbitrary initial seed. Through the empirical tests, we show that the choice of the initial values for the seed is important to generate good random numbers.

• ETRI Journal
• /
• 제42권4호
• /
• pp.518-526
• /
• 2020

This paper presents an efficient hardware random-number generator based on a beta source. The proposed generator counts the values of "0" and "1" and provides a method to distinguish between pseudo-random and true random numbers by comparing them using simple cumulative operations. The random-number generator produces labeled data indicating whether the count value is a pseudo- or true random number according to its bit value based on the generated labeling data. The proposed method is verified using a system based on Verilog RTL coding and LabVIEW for hardware implementation. The generated random numbers were tested according to the NIST SP 800-22 and SP 800-90B standards, and they satisfied the test items specified in the standard. Furthermore, the hardware is efficient and can be used for security, artificial intelligence, and Internet of Things applications in real time.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2001년도 The Seoul International Simulation Conference
• /
• pp.464-467
• /
• 2001

A good arithmetic random number generator should possess full period, uniformity and independence, etc. To obtain the excellent random number generator, many researchers have found good parameters. Also an initial seed is the important factor in random number generator. But, there is no theoretical guideline for using the initial seeds. Therefore, random number generator is usually used with the arbitrary initial seed. Through the empirical tests, we show that the choice of the initial values for the seed is important to generate good random numbers.

• 대한수학회보
• /
• 제47권3호
• /
• pp.467-482
• /
• 2010

For a double array of random elements {$V_{mn};m{\geq}1,\;n{\geq}1$} in a real separable Banach space, some mean convergence theorems and weak laws of large numbers are established. For the mean convergence results, conditions are provided under which $k_{mn}^{-\frac{1}{r}}\sum{{u_m}\atop{i=1}}\sum{{u_n}\atop{i=1}}(V_{ij}-E(V_{ij}|F_{ij})){\rightarrow}0$ in $L_r$ (0 < r < 2). The weak law results provide conditions for $k_{mn}^{-\frac{1}{r}}\sum{{T_m}\atop{i=1}}\sum{{\tau}_n\atop{j=1}}(V_{ij}-E(V_{ij}|F_{ij})){\rightarrow}0$ in probability where {$T_m;m\;{\geq}1$} and {${\tau}_n;n\;{\geq}1$} are sequences of positive integer-valued random variables, {$k_{mn};m{{\geq}}1,\;n{\geq}1$} is an array of positive integers. The sharpness of the results is illustrated by examples.

• 한국컴퓨터정보학회논문지
• /
• 제25권11호
• /
• pp.97-104
• /
• 2020

본 논문에서는 우주라는 특수한 환경에서 권장하는 무선 통신의 채널 코딩으로 암호화된 이미지가 노이즈에 많은 영향으로 손상되는 문제를 개선하기 위해 난수발생기 PP(PingPong256)와 셔플기법을 제안한다. PP는 512비트의 초기값을 입력받아 끊임없이 난수를 생성할 수 있다. 난수는 이미지와 배타적 논리연산을 통해 암호화가 가능하다. 셔플 기법은 이미지 픽셀위치와 난수 배열위치를 동기화하고 난수 배열을 오름차순으로 위치를 이동하면서 이미지 픽셀 위치를 무작위로 재배열한다. 따라서 채널 코딩에 PP와 셔플 기법을 사용하면 모든 픽셀이 미세하게 분산되어 열악한 전송 환경에도 높은 품질의 이미지를 전송할 수 있다.

• ETRI Journal
• /
• 제42권6호
• /
• pp.951-964
• /
• 2020

This paper presents a lightweight true random number generator (TRNG) using beta radiation that is useful for Internet of Things (IoT) security. In general, a random number generator (RNG) is required for all secure communication devices because random numbers are needed to generate encryption keys. Most RNGs are computer algorithms and use physical noise as their seed. However, it is difficult to obtain physical noise in small IoT devices. Since IoT security functions are required in almost all countries, IoT devices must be equipped with security algorithms that can pass the cryptographic module validation programs of each country. In this regard, it is very cumbersome to embed security algorithms, random number generation algorithms, and even physical noise sources in small IoT devices. Therefore, this paper introduces a lightweight TRNG comprising a thin-film beta-radiation source and integrated circuits (ICs). Although the ICs are currently being designed, the IC design was functionally verified at the board level. Our random numbers are output from a verification board and tested according to National Institute of Standards and Technology standards.

• East Asian mathematical journal
• /
• 제34권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.

• 대한수학회논문집
• /
• 제14권4호
• /
• pp.797-804
• /
• 1999

In this paper we derive the almost sure convergence of weighted sums of 2-dimensional arrays of random variables which are either pairwise positive quadrant dependent or associated. Our re-sults imply and extension of Etemadi's(1983) strong laws of large numbers for weighted sums of nonnegative random variables to the 2-dimensional case.