• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.331-338
• /
• 2006

The Paley-type inequalities for the complete convergence and lower and upper bounds in the Baum-Katz law of large numbers for i.i.d. random variables sequence are obtained. The results obtained generalize the result of Pruss [8].

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.201-210
• /
• 2011

In this paper, we obtain the H$\`{a}$jeck-R$\`{e}$nyi type inequality and the strong law of large numbers for asymptotically linear negative quadrant dependent random variables by using this inequality. We also give the strong law of large numbers for the linear process under asymptotically linear negative quadrant dependence assumption.

• Communications of the Korean Mathematical Society
• /
• v.18 no.3
• /
• pp.551-558
• /
• 2003

In this paper we Obtain the Hajeck-Renyi type inequality for the asymptotically almost negatively associated(AANA) random variables and extend some results for negatively associated random variables to the AANA case by applying this inequality.

• Journal of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.37-49
• /
• 1999

We derive the almost sure convergence for weighted sums of random variables which are either pairwise positive quadrant dependent or pairwise positive quadrant dependent or pairwise negative quadrant dependent and then apply this result to obtain the almost sure convergence of weighted averages. e also extend some results on the strong law of large numbers for pairwise independent identically distributed random variables established in Petrov to the weighted sums of pairwise negative quadrant dependent random variables.

• Journal of the Korean Mathematical Society
• /
• v.58 no.2
• /
• pp.327-349
• /
• 2021

In this paper, we main study the strong law of large numbers and complete convergence for weighted sums of asymptotically almost negatively associated (AANA, in short) random variables, by using the Marcinkiewicz-Zygmund type moment inequality and Roenthal type moment inequality for AANA random variables. As an application, the complete consistency for the weighted linear estimator of nonparametric regression models based on AANA errors is obtained. Finally, some numerical simulations are carried out to verify the validity of our theoretical result.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1467-1473
• /
• 2015

In this paper, we implemented a parallel random number generation program on GPU's, which are known for high performance computing, using LCG (Linear Congruential Generator). Random numbers are important in all fields requiring the use of randomness, and LCG is one of the most widely used methods for the generation of pseudo-random numbers. We explained the parallel program using the NVIDIA CUDA model and MPI(Message Passing Interface) and showed uniform distribution and performance results. We also used a Monte Carlo algorithm to calculate pi(${\pi}$) comparing the parallel random number generator with cuRAND, which is a CUDA library function, and showed that our program is much more efficient. Finally we compared performance results using multi-GPU's with those of ideal speedups.

• Journal of the Korean Statistical Society
• /
• v.29 no.3
• /
• pp.261-268
• /
• 2000

Let {Xn,n$\geq$1} be a sequence of pairwise negative quadrant dependent(NQD) random variables and let {an,n$\geq$1} and {bn,n$\geq$1} be sequencesof constants such that an$\neq$0 and 0$\infty$. In this note, for pairwise NQD random varibles, a general weak law of alrge numbers of the form(∑│aj│Xj-$\upsilon$n)/bnlongrightarrow0) is established, where {νn,n$\geq$1} is a suitable sequence. AMS 2000 subject classifications ; 60F05

• Journal of the Korean Statistical Society
• /
• v.24 no.1
• /
• pp.91-109
• /
• 1995

The rate of convergence to a random variable S for an almost certainly convergent series $S_n = \sum^n_{j=1} X_j$ of independent random variables is studied in this paper. More specifically, when $S_n$ converges to S almost certainly, the tail series $T_n = \sum^{\infty}_{j=n} X_j$ is a well-defined sequence of random variable with $T_n \to 0$ a.c. Various sets of conditions are provided so that for a given numerical sequence $0 < b_n = o(1)$, the tail series strong law of large numbers $b^{-1}_n T_n \to 0$ a.c. holds. Moreover, these results are specialized to the case of the weighted i.i.d. random varialbes. Finally, example are provided and an open problem is posed.

• Wind and Structures
• /
• v.3 no.1
• /
• pp.1-10
• /
• 2000

Recently, an efficient and practical method has been developed for the generation of univariate non-Gaussian wind pressure time histories on low building roofs; this methodology requires intermittent exponential random numbers for the simulation. On the other hand, the conventional spectral representation scheme with random phase is found suitable for the generation of univariate Gaussian wind pressure time histories on low building roofs; this simulation scheme requires uniform random numbers. The dependency of these simulation methodologies on the random number generator is one of the items affecting the accuracy of the simultion result; therefore, an attempt has been made to investigate the issue. This note presents the observed sensitivity of random number sets in repetitive simulations of Gaussian and non-Gaussian wind pressures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2468-2483
• /
• 2017

The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.