• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.476-481
• /
• 2015

We have parallelized the cumulative sum (CUSUM) test of NIST's statistical random number test suite in a CUDA environment. Storing random walks in an array instead of in scalar variables eliminates data dependence. The change in data structure makes it possible to apply parallel scans, scatters, and reductions at each stage of the test. In addition, serial data exchanges between CPU and GPU are removed by migrating CPU's tasks to GPU. Finally we have optimized global memory accesses. The overall speedup is 23 times over the sequential version. Our results contribute to improving security of random numbers for cryptographic keys as well as reducing the time for evaluation of randomness.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.249-251
• /
• 2005

In this paper, an algorithm of path planning and obstacle avoidance for mobile robot is proposed. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors. By processing assigned numbers all regions are covered and then the path from start to destination is selected by these numbers. The RAS has an advantage of fast planning because of simple operations. This implies that new path selection may be possible within a short time and helps a robot to avoid obstacles in any direction. The algorithm can be applied to unknown environments. When moving obstacles appear, a mobile robot avoids obstacles reactively. then new path is selected by RAS.

• Communications of the Korean Mathematical Society
• /
• v.14 no.2
• /
• pp.425-428
• /
• 1999

In this note we have generalization of Feller`s theorem to real separable Banach spaces, from which we obtain easily Chow-Robbins “fair" games problem in the Banach spaces.aces.

• Genomics & Informatics
• /
• v.5 no.4
• /
• pp.168-173
• /
• 2007

In previous nuclear genomic association studies, Random Forests (RF), one of several up-to-date machine learning methods, has been used successfully to generate evidence of association of genetic polymorphisms with diseases or other phenotypes. Compared with traditional statistical analytic methods, such as chi-square tests or logistic regression models, the RF method has advantages in handling large numbers of predictor variables and examining gene-gene interactions without a specific model. Here, we applied the RF method to find the association between mitochondrial single nucleotide polymorphisms (mtSNPs) and diabetes risk. The results from a chi-square test validated the usage of RF for association studies using mtDNA. Indexes of important variables such as the Gini index and mean decrease in accuracy index performed well compared with chi-square tests in favor of finding mtSNPs associated with a real disease example, type 2 diabetes.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.617-626
• /
• 2009

Let {$Y_i$,-$\infty$ < i < $\infty$} be a doubly infinite sequence of i.i.d. random variables with E|$Y_1$| < $\infty$, {$a_{ni}$,-$\infty$ < i < $\infty$ n $\geq$ 1} an array of real numbers. Under some conditions on {$a_{ni}$}, we obtain necessary and sufficient conditions for $\sum\;_{n=1}^{\infty}\frac{1}{n}P(|\sum\;_{i=-\infty}^{\infty}a_{ni}(Y_i-EY_i)|$>$n{\epsilon})$<{\infty}$. We examine whether the result of Spitzer [11] holds for the moving average process, and give a partial solution.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.4
• /
• pp.607-615
• /
• 2002

Let (X, $X_{n}$, n$\geq$1) be a sequence of i.i.d. random variables and { $a_{ni}$ , 1$\leq$i$\leq$n, n$\geq$1} be an array of constants. Let ø($\chi$) be a positive increasing function on (0, $\infty$) satisfying ø($\chi$) ↑ $\infty$ and ø(C$\chi$) = O(ø($\chi$)) for any C > 0. When EX = 0 and E[ø(｜X｜)]〈$\infty$, some conditions on ø and { $a_{ni}$ } are given under which (equation omitted).).

• Honam Mathematical Journal
• /
• v.34 no.2
• /
• pp.241-252
• /
• 2012

Let $\{X_{ni},\;1{\leq}i{\leq}n,\;n{\geq}1\}$ be a sequence of LNQD which are dominated randomly by another random variable X. We obtain the complete convergence and almost sure convergence of weighted sums ${\sum}^n_{i=1}a_{ni}X_{ni}$ for LNQD by using a new exponential inequality, where $\{a_{ni},\;1{\leq}i{\leq}n,\;n{\geq}1\}$ is an array of constants. As corollary, the results of some authors are extended from i.i.d. case to not necessarily identically LNQD case.

• Asian-Australasian Journal of Animal Sciences
• /
• v.16 no.3
• /
• pp.315-319
• /
• 2003

Random amplified polymorphic DNA (RAPD) analysis was done with 19 oligonucleotide primers to study genetic similarities and divergence among different types of Deoni breed of cattle viz., Balankya, Wannera and Waghya. Six random primers produced low to high numbers of polymorphic bands between pooled DNA of different Deoni types. Of the 48 RAPD markers obtained 33 were common to all Deoni types, 3 were individual specific and 12 were polymorphic for different Deoni types. The mean average percentage difference values among Deoni types showed that Balankya and Wannera had less genetic divergence when compared to Waghya.

• Journal of the Korean Statistical Society
• /
• v.31 no.4
• /
• pp.483-490
• /
• 2002

A weak convergence is obtained for a linear process of the form (equation omitted) where {$\varepsilon$$_{t}$ } is a strictly stationary sequence of associated random variables with E$\varepsilon$$_{t}$ = 0 and E$\varepsilon$$^{^2}$$_{t}$ < $\infty$ and {a $_{j}$ } is a sequence of real numbers with (equation omitted). We also apply this idea to the case of linearly positive quadrant dependent sequence.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.837-842
• /
• 2010

In this paper, quantum cryptography systems used in the design process inevitably open bit stream of pseudo-random number that exists multiple open channels between them and the need to share information on the part of the situation exposes a pair of bit stream. In this paper, the base test of pseudo-random number I tested out this process and the merge bit binary column look out for randomness.