• 한국컴퓨터그래픽스학회논문지
• /
• 제2권2호
• /
• pp.61-68
• /
• 1996

본 논문에서는 대용량의 DNA 염기 배열의 정성 정보를 특징짓기 위한 새로운 가시화 방법을 제안한다. DNA 배열은 배열 자체가 방대한 양의 정보를 포함하고 있기 때문에 분석에 많은 어려움이 있다. 우리는 DNA 염기 배열들사이의 상사성 비교를 위해 DNA 염기 배열을 하나의 이미지 도메인으로 변환한다. 프로그램은 random walk plot으로 DNA 염기 배열을 가시화한 후에 k-convex hull로 단순화 시킨다. Random Walk plot은 염기배열을 평면상에 하나의 커브로 표현한다. k-convex hull은 walk plot으로부터 무의미한 부분을 제거함으로서 walk plot을 단순화한다. 이러한 방법은 유전공학자들에게 쉽게 DNA 배열의 특징을 인식하고 분류할 수 있는 직관을 제공한다. 실제 게놈 데이터로 실험한 결과는 논문에서 제안하는 방법이 긴 DNA 염기배열들 사이의 유사성 분석을 위해 좋은 가시화 도구임을 보여준다.

• Journal of information and communication convergence engineering
• /
• 제16권3호
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

• 대한수학회지
• /
• 제42권1호
• /
• pp.171-189
• /
• 2005

In this paper, we first establish some characterization of tightness for a sequence of random elements taking values in the space of normal and upper-semicontinuous fuzzy sets with compact support in $R^P$. As a result, we give some sufficient conditions for a sequence of fuzzy random sets to converge in distribution.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.979-983
• /
• 1989

This paper proposes a new concept, called merit factor Fr, for evaluating the randomness of binary random sequences. The merit factor Fr is obtained from the expected values of the autocorrelation function of the binary random sequence. Using this merit factor Fr, randomness of the binary random sequences generated by the random sampling method is evaluated.

• 대한수학회보
• /
• 제48권5호
• /
• pp.923-938
• /
• 2011

Some properties for negatively orthant dependent sequence are discussed. Some strong limit results for the weighted sums are obtained, which generalize the corresponding results for independent sequence and negatively associated sequence. At last, exponential inequalities for negatively orthant dependent sequence are presented.

• 대한교통학회지
• /
• 제20권5호
• /
• pp.67-79
• /
• 2002

교통량, 교통밀도, 교통류 속도 등, 교통류 변수에 대한 현재까지의 불확실한 정의와 연속적 파동방정식의 거시적 교통류 해석상의 문제점을 지적하고 이를 개선하기 위해 교통류 변수들에 대한 새로운 확률적 정의를 제시하고 이들의 성격을 규명하였다. 이러한 새로운 교통류 변수들에 대한 새로운 정의를 바탕으로 미시적 운전자 행동을 세밀하게 수용할 수 있고 많은 교통환경에서 연속적 파동 방정식을 대체하여 교통류 변수들과 통행시간을 예측할 수 있는 미분방정식 체계를 확률 미분방적식을 이용하여 도출하였다. 도출된 미분 방정식을 단일 차량의 시공 괘적에 적용해 보았다.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1554-1574
• /
• 2017

This paper introduces a new type of determining factor for Pseudo Random Strings (PRS). This classification depends upon a mathematical property called Finite Induction (FI). FI is similar to a Markov Model in that it presents a model of the sequence under consideration and determines the generating rules for this sequence. If these rules obey certain criteria, then we call the sequence generating these rules FI a PRS. We also consider the relationship of these kinds of PRS's to Good/deBruijn graphs and Linear Feedback Shift Registers (LFSR). We show that binary sequences from these special graphs have the FI property. We also show how such FI PRS's can be generated without consideration of the Hamiltonian cycles of the Good/deBruijn graphs. The FI PRS's also have maximum Shannon entropy, while sequences from LFSR's do not, nor are such sequences FI random.

• Journal of the Korean Statistical Society
• /
• 제24권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.

• East Asian mathematical journal
• /
• 제24권3호
• /
• pp.251-261
• /
• 2008

Let {${\xi}_j;j\;{\geq}\;1$} be a centered strictly stationary random sequence defined by $S_0\;=\;0$, $S_n\;=\;\Sigma^n_{j=1}\;{\xi}_j$ and $\sigma(n)\;=\;33\sqrt {ES^2_n}$ where $\sigma(t),\;t\;>\;0$, is a nondecreasing continuous regularly varying function. Suppose that there exists $n_0\;{\geq}\;1$ such that, for any $n\;{\geq}\;n_0$ and $0\;{\leq}\;{\varepsilon}\;<\;1$, there exist positive constants $c_1$ and $c_2$ such that $c_1e^{-(1+{\varepsilon})x^2/2}\;{\leq}\;P\{\frac{{\mid}S_n{\mid}}{\sigma(n)}\;{\geq}\;x\}\;{\leq}\;c_2e^{-(1-{\varepsilon})x^2/2$, $x\;{\geq}\;1$ Under some additional conditions, we investigate some limsup results for the increments of partial sum processes of the sequence {${\xi}_j;j\;{\geq}\;1$}.

• 대한수학회보
• /
• 제30권2호
• /
• pp.167-170
• /
• 1993

In this paper, X, X$_{1}$, X$_{2}$, .. will denote any sequence of pairwise independent random variables with common distribution, and b$_{1}$, b$_{2}$.. will denote any sequence of constants. Using Chung [2, Theorem 4.2.5] and the same idea as in Chow and Robbins [1, Lemma 1 and 2] we have the following lemma.