• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.5
• /
• pp.222-238
• /
• 2008

In this paper, the random key pre-distribution scheme introduced in ACM CCS'02 by Eschenauer and Gligor is reexamined, and a generalized form of key establishment is introduced. As the communication overhead is one of the most critical constraints of any successful protocol design, we introduce an alternative scheme in which the connectivity is maintained at the same level as in the original work, while the communication overhead is reduced by about 40% of the original overhead, for various carefully chosen parameters. The main modification relies on the use of a two-level key pool design and two round assignment/key establishment phases. Further analysis demonstrates the efficiency of our modification.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.14 no.8
• /
• pp.611-617
• /
• 2001

The non-polar optical phonon scattering in the valence band depends on the masses, ratios, and types of mixtures of constituent atoms. Therefore, the random distribution of atoms in alloy semiconductors should be considered in the analysis of scattering mechanisms. For this purpose, the force equations of n atoms in a unit cell are expressed in a n x n matrix form to obtain the angular frequencies due to the acoustic and non-polar optical phonons. And, n is then assumed to be infinity. When this work is compared with other results published elsewhere, it is concluded that the independence of atomic displacement or amplitude of oscillation as ell as the infinite number of atoms in a unit cell must be taken into account for the random distribution of atoms in alloy semiconductors.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.4
• /
• pp.501-510
• /
• 2008

The distribution of the sum of n independent random variables having exponential distributions with different parameters ${\beta}_i$ ($i=1,2,{\ldots},n$) is given in [2], [3], [4] and [6]. In [1], by using Laplace transform, Jasiulewicz and Kordecki generalized the results obtained by Sen and Balakrishnan in [6] and established a formula for the distribution of this sum without conditions on the parameters ${\beta}_i$. The aim of this note is to present a method to find the distribution of the sum of n independent exponentially distributed random variables with different parameters. Our method can also be used to handle the case when all ${\beta}_i$ are the same.

• The Korean Journal of Zoology
• /
• v.15 no.1
• /
• pp.15-21
• /
• 1972

The chromosome constitutions in two cases of uterine carcinoma were studied in vitro with particular interest to the non-random distribution. The results obtained are as follows: 1. The chromosome numbers of one case were found within a normal diploid range with mode at 46, while those of the other were whithin hypotriploid range with mode at 60. 2. The data from the latter case indicated possible existence of non-random distribution of chromosome.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1419-1443
• /
• 2021

The asymmetric Laplace distribution arises as a limiting distribution of geometric summations of independent and identically distributed random variables with finite second moments. The main purpose of this paper is to study the weak limit theorems for geometric summations of independent (not necessarily identically distributed) random variables together with convergence rates to asymmetric Laplace distributions. Using Trotter-operator method, the orders of approximations of the distributions of geometric summations by the asymmetric Laplace distributions are established in term of the "large-𝒪" and "small-o" approximation estimates. The obtained results are extensions of some known ones.

• Korean journal of applied entomology
• /
• v.32 no.2
• /
• pp.134-138
• /
• 1993

Larval densities and spatial distribution patterns of beet armyWorm, Spodoptera exigua, were studied in the welsh onion field located in Asan from June to November, 1991. During the period, there were two denslty-peaks;mid August and mid~late September. The larvae showed clumped distribution patterns. but the patterns changed into random as larval density decreased in Oct.ober. Each larval instar showed clumped pattern expect 6th instar surveyed on September 25, which distributed in a random pattern. The larval distribution pattern were also influenced by the host plants;clumped pattern on such host. as red pepper and welsh onion, versus random pattern on such hosts as chrysanthemum, peanut and soybean.

• Communications for Statistical Applications and Methods
• /
• v.24 no.5
• /
• pp.457-480
• /
• 2017

We develop a random partition procedure based on a Dirichlet process prior with Laplace distribution. Gibbs sampling of a Laplace mixture of linear mixed regressions with a Dirichlet process is implemented as a random partition model when the number of clusters is unknown. Our approach provides simultaneous partitioning and parameter estimation with the computation of classification probabilities, unlike its counterparts. A full Gibbs-sampling algorithm is developed for an efficient Markov chain Monte Carlo posterior computation. The proposed method is illustrated with simulated data and one real data of the energy efficiency of Tsanas and Xifara (Energy and Buildings, 49, 560-567, 2012).

• Journal of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.1879-1903
• /
• 2017

In this paper we study the closure property and probability tail asymptotics for randomly weighted sums $S^{\Theta}_n={\Theta}_1X_1+{\cdots}+{\Theta}_nX_n$ for long-tailed random variables $X_1,{\ldots},X_n$ and positive bounded random weights ${\Theta}_1,{\ldots},{\Theta}_n$ under similar dependence structure as in [26]. In particular, we study the case where the distribution of random vector ($X_1,{\ldots},X_n$) is generated by an absolutely continuous copula.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.7 no.3
• /
• pp.130-134
• /
• 1982

In computer communication network, it is assumed that blocks are served at a rate of u messages per sec. The message blocks will be stayed in the buffer during the service time. In this case, the probability density distribution of the number of message blocks in the buffer space has been studied. When the average buffer space needed is minimum, the average block size will be specified by the relation between the input data and link infromation length. This relation proves to be perfect. The random number generator for this probability distribution is designed. The test result by making use of the random number generator has shown that is has little difference from the theoretical one.

• The Korean Journal of Applied Statistics
• /
• v.9 no.1
• /
• pp.165-177
• /
• 1996

It is often needed to generate random numbers from truncated t-distributions to carry out Bayesian inferences, especially in Monte Carlo integration for estimation of posterior densities of constrained parameters. However, when the restricted area is an extreme tail area with a small probability most existing random generation methods are not efficient. In this paper, we propose an efficient acceptance-rejection method to generate random numbers from extreme tail areas of a t-distribution. Using some simulation results, we compare the proposed algorithm with other popular methods.