• 한국통신학회논문지
• /
• 제33권11C호
• /
• pp.874-879
• /
• 2008

[1]에서 LCZ 수열군의 2배 확장을 제안하였다. 본 논문에서는 [1]에서의 2배 확장방법을 일반화하는 새로운 확장방법을 제안한다. 이 생성방법을 사용하면 인수가 (N,M,L,${\epsilon}$)인 q진 LCZ 수열군은 인수가 (pN,pM,p[(L+1)/p]-1,p${\epsilon}$)인 q진 LCZ 수열군이 된다. 이 때, p는 소수이고 p는 q의 약수다. 특히 L${\equiv}$p-1modp일 때, 확장된 q진 LCZ 수열군의 인수는 (pN,pM,L,p${\epsilon}$)이 된다.

• 충청수학회지
• /
• 제11권1호
• /
• pp.45-51
• /
• 1998

In this paper, we shall define the usual fuzzy distance between two real fuzzy points, using the usual distance between two points in $\mathbb{R}$. We introduce the fuzzy sequence in the fuzzy real line and the notion of limit of fuzzy sequence in $F_p(\mathbb{R})$, and obtain the fuzzy increasing(decreasing) sequence and fuzzy Cauchy sequence of real fuzzy points.

• 정보화연구
• /
• 제9권1호
• /
• pp.11-19
• /
• 2012

Generally, a suffix tree is an efficient data structure since it reveals the detailed internal structures of given sequences within linear time. However, it is difficult to implement a suffix tree for a large number of sequences because of memory size constraints. Therefore, in order to compare multi-mega base genomic sequence sets using suffix trees, there is a need to re-construct the suffix tree algorithms. We introduce a new method for constructing a suffix tree on secondary storage of a large number of sequences. Our algorithm divides three files, in a designated sequence, into parts, storing references to the locations of edges in hash tables. To execute experiments, we used 1,300,000 sequences around 300Mbyte in EST to generate a suffix tree on disk.

• Communications for Statistical Applications and Methods
• /
• 제3권2호
• /
• pp.175-185
• /
• 1996

For the Change-point problem in a sequence of binomial variables we consider the maximum likelihood estimator (MLE) of unknown change-point. Its asymptotic distribution is quite limited in the case of binomial variables with different numver of trials at each time point. Hinkley and Hinkley (1970) gives an asymptotic distribution of the MLE for a sequence of Bernoulli random variables. To find the asymptotic distribution a numerical method such as bootstrap can be used. Another concern of our interest in the inference on the change-point and we derive confidence sets based on the liklihood ratio test(LRT). We find approximate confidence sets from the bootstrap distribution and compare the two results through an example.

• 한국통신학회논문지
• /
• 제32권3C호
• /
• pp.226-233
• /
• 2007

이 논문에서는 파라미터 $(2^{n+1}-2,M,L,2)$를 갖는 새로운 낮은 상관 구역 수열을 생성한다. 이 방식에서는 자유롭게 낮은 상관 구간의 길이 L을 선택할 수 있으며, 이에 따라서 집합의 크기 M이 결정이 된다. 그리고 이 생성방식을 사용하게 되면 선택된 낮은 상관 구간의 길이 L과 집합의 크기 M이 Tang, Fan, 그리고 Matsufuji 한계를 기준으로 최적에 가까운 집합을 생성할 수가 있다.

• 충청수학회지
• /
• 제16권1호
• /
• pp.15-23
• /
• 2003

In order to compute the Nielsen number N(f) of a self-map $f:X{\rightarrow}X$, some Reidemeister classes in the fundamental group ${\pi}_1(X)$ need to be distinguished. D. Ferrario has some algebraic results which allow distinguishing Reidemeister classes. In this paper we generalize these results to the Reidemeister sets of iterates.

• 한국지구과학회지
• /
• 제26권8호
• /
• pp.809-820
• /
• 2005

The fluvial sequence developed along the channel margin of meander bends in the midstream of the Yeongsan River consists of channel deposits at the bottom and overbank deposits at the top, and shows a fining-upward trend. The fluvial deposits consist of 7 sedimentary facies, and facies association forms 7 architectural elements. The channel deposits formed as channel bar or point bar. The channel bar deposits consisted of architectural element of gravel bedform were formed by channel lag deposits within the channel; whereas, the channel bar deposits consisted of architectural elements of downcurrent-dipping inclined strata sets, cross-stratified and horizontally stratified sets, and horizontally stratified sets were formed by downstream migration of sand wave or downstream transport of sand by traction current in the upper flow regime conditions within the channel. The point bar deposits consist of architectural elements of down current-dipping inclined strata sets, horizontally stratified sets, cross-stratified and horizontally stratified sets, and laterally inclined and horizontally stratified sets. These architectural elements are thought to have been formed by the combined effects of the migration of sand dunes and the formation of horizontal lamination in the upper flow regime plane bed conditions. The overbank deposits consist of the architectural elements of overbank fine and sand sheet and lens. The overbank fines were formed by settling of mud from slackwater during flooding over floodplain whereas the sand sheet and lens were formed by traction of sands introduced episodically fiom channel to the overbank during flooding.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제9권2호
• /
• pp.147-153
• /
• 2009

In this paper, we introduce several concepts of tightness for a sequence of random variables taking values in the space of normal and upper-semicontinuous fuzzy sets with compact support in $R^p$ and give some characterizations of their concepts. Also, counter-examples for the relationships between the concepts of tightness are given.

• 한국정보과학회논문지:데이타베이스
• /
• 제28권4호
• /
• pp.655-664
• /
• 2001

비디오 스트림이나 음성 아날로그 신호와 같은 연속된 데이타는 특징 공간(feature space)에서 다차원 데이타 시퀀스(multidimensional data sequence)로 모델링될 수 있다. 본 논문에서는 이러한 다차원 데 이타 시퀀스의 효과적인 클러스터링 기법에 대하여 연구한다. 각 시퀀스는 차후의 저장 및 유사성 검색 (similarity search)을 효율적으로 실행하기 위하여 소수 개의 하이퍼 사각형 (hyper-rectangle) 형태의 클러스터로 표현된다. 본 논문에서는 사전에 정의된 수준의 클러스터링 품질을 보장하는 선형 복잡도를 갖는 클러스터링 알고리즘을 제시하고, 다양한 비디오 데이타에 관한 실험을 통하여 알고리즘의 적합성을 보여준다.

• Genomics & Informatics
• /
• 제17권4호
• /
• pp.39.1-39.20
• /
• 2019

Analyzing patterns in data points embedded in linear and non-linear feature spaces is considered as one of the common research problems among different research areas, for example: data mining, machine learning, pattern recognition, and multivariate analysis. In this paper, data points are heterogeneous sets of biosequences (composite data points). A composite data point is a set of ordinary data points (e.g., set of feature vectors). We theoretically extend the derivation of the largest generalized eigenvalue-based distance metric D_ij(γ₁) in any linear and non-linear feature spaces. We prove that D_ij(γ₁) is a metric under any linear and non-linear feature transformation function. We show the sufficiency and efficiency of using the decision rule $\bar{{\delta}}_{{\Xi}i}$(i.e., mean of D_ij(γ₁)) in classification of heterogeneous sets of biosequences compared with the decision rules min_𝚵iand median_𝚵i. We analyze the impact of linear and non-linear transformation functions on classifying/clustering collections of heterogeneous sets of biosequences. The impact of the length of a sequence in a heterogeneous sequence-set generated by simulation on the classification and clustering results in linear and non-linear feature spaces is empirically shown in this paper. We propose a new concept: the limiting dispersion map of the existing clusters in heterogeneous sets of biosequences embedded in linear and nonlinear feature spaces, which is based on the limiting distribution of nucleotide compositions estimated from real data sets. Finally, the empirical conclusions and the scientific evidences are deduced from the experiments to support the theoretical side stated in this paper.