• Journal of the Korean Statistical Society
• /
• 제10권
• /
• pp.97-104
• /
• 1981

It is shown that a lattice distribution defined on a set of n lattice points $L(n,\delta) = {\delta,\delta+1,...,\delta+n-1}$ is a distribution induced from the distribution of convolution of independently and identically distributed (i.i.d.) uniform [0,1] random variables. Also the m-th moment of the lattice distribution is obtained in a quite different approach from Park and Chung (1978). It is verified that the distribution of the sum of n i.i.d. uniform [0,1] random variables is completely determined by the lattice distribution on $L(n,\delta)$ and the uniform distribution on [0,1]. The factorial mement generating function, factorial moments, and moments are also obtained.

• 대한수학회지
• /
• 제15권1호
• /
• pp.59-61
• /
• 1978

Let $X_1$, $X_2$, ${\cdots}$, $X_n$ be i.i.d. uniform (0,1) random variables. Let $f_n(x)$ denote the probability density function (p.d.f.) of $T_n={\sum}^n_{i=1}X_i$. Consider a set S(x ; ${\delta}$) of lattice points defined by S(x ; ${\delta}$) = $x{\mid}x={\delta}+j$, j=0, 1, ${\cdots}$, n-1, $0{\leq}{\delta}{\leq}1$} The lattice distribution induced by the p.d.f. of $T_n$ is defined as follow: (1) $f_n^{(\delta)}(x)=\{f_n(x)\;if\;x{\in}S(x;{\delta})\\0\;otherwise.$. In this paper we show that $f_n{^{(\delta)}}(x)$ is a probability function thus we obtain a family of lattice distributions {$f_n{^{(\delta)}}(x)$ : $0{\leq}{\delta}{\leq}1$}, that the mean and variance of the lattice distributions are independent of ${\delta}$.

• 대한수학회논문집
• /
• 제19권1호
• /
• pp.11-21
• /
• 2004

We discuss the n-fold implicative/fantastic filters in lattice implication algebras, which are extended notions of implicative/fantastic filters. Characterizations of n-fold implicative/fantastic filters are given. Conditions for a filter to be n-fold implicative are provided. Extension property for an n-fold fantastic filter is established.

• 대한수학회보
• /
• 제55권2호
• /
• pp.449-467
• /
• 2018

In this paper we introduce and study the lattice paths for which the horizontal step is allowed at height $h{\geq}0$, $h{\in}{\mathbb{Z}}$. By doing so these paths generalize the heavily studied weighted lattice paths that consist of horizontal steps allowed at height zero only. Six q-series identities of Rogers-Ramanujan type are studied combinatorially using these generalized lattice paths. The results are further extended by using (n + t)-color overpartitions. Finally, we will establish that there are certain equinumerous families of (n + t)-color overpartitions and the generalized lattice paths.

• 정보보호학회논문지
• /
• 제14권1호
• /
• pp.47-57
• /
• 2004

이 논문에서는 Crypto97에 발표된 잘 알려진 lattice 문제에 기반한 Goldreich-Goldwasser-Halevi(GGH)의 전자 서명을 암호 해독한다. GGH의 서명방법에 선택 평문공격을 수행하고 제안하는 공격방법에 취약함을 보인다. 암호 해독한다. GGH의 서명방법에 선택 평문공격을 수행하고 제안하는 공격방법에 취약함을 보인다. 암호해독 방법에서는 서로 선형 독립적인 n개의 lattice점을 모아서 원래 lattice의 sub-lattice를 생성하는 새로운 basis를 생성한다. 이 sub-lattice가 유효한 서명을 생성하는데 사용될 수 있음을 보인다. 이 공격방법의 유효성을 실험을 통해서 보이고, 마지막으로 비밀키를 생성하는데 사용되는 cube-like parameter가 안정성에 좋지 않은 영향을 미침을 보인다.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.153-163
• /
• 2003

The fuzzification of a positive implicative filter is considered, and some of properties are investigated. The relation among fussy filter, fuzzy n-fold implicative filter, and fuzzy n-fold positive implication filter is discussed.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제20권2호
• /
• pp.107-121
• /
• 2016

We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.

• 한국세라믹학회지
• /
• 제28권4호
• /
• pp.269-278
• /
• 1991

Fine AlN powder was synthesized by carbothermal reduction and nitridation of alumimun hydroxide prepared from Al-isopropoxide. AlN ceramics with Y2O3 and CaO were prepared by hot-pressing under the pressure of 30 MPa at 180$0^{\circ}C$ for 1 h in N2 atmosphere. Grain boundary behavior and purification mechanism of AlN lattice were examined by heat treatment of AlN ceramics at 185$0^{\circ}C$ for 1-6 h in N2 atmosphere. AlN ceramics without sintering additives showed poor sinterability. However, Y2O3-doped and CaO-doped AlN ceramics were fully densified nearly to theoretical density. As the heat treatment time increased, c-axis lattice parameter increased. This is attributed to the removal of Al2O3 in AlN lattice. This purification effect of AlN attice depended upon the quantity of secondary oxide phase in the inintial stage of heat treatment and the heat treatment time.

• Journal of the Korean Physical Society
• /
• 제73권12호
• /
• pp.1808-1813
• /
• 2018

I develop a transfer matrix algorithm for computing the geometric quantities of a square lattice polymer with nearest-neighbor interactions. The radius of gyration, the end-to-end distance, and the monomer-to-end distance were computed as functions of the temperature. The computation time scales as ${\lesssim}1.8^N$ with a chain length N, in contrast to the explicit enumeration where the scaling is ${\sim}2.7^N$. Various techniques for reducing memory requirements are implemented.

• 한국수학사학회지
• /
• 제23권2호
• /
• pp.101-121
• /
• 2010

본 연구는 격자평면에서의 Pick의 정리에 대한 의의와 증명소개, Pick의 정리를 확장한 3차원 격자다면체에서의 Reeve의 정리 및 n차원 격자다면체로 일반화시킨 Ehrhart 다항식에 대한 소개와 역사적 고찰을 바탕으로 이를 고등학교 교육과정에서 다루고 있는 수열단원에 응용하기위해, Reeve의 정리를 이용하여 3차원 격자다면체의 격자점의 개수와 부피와의 관계를 제시하고, 나아가 Pick의 정리와 Ehrhart 다항식을 적용하여 수열의 합을 구하는 공식들을 새로운 증명법으로 도출하고자 한다.