• 정보보호학회논문지
• /
• 제12권3호
• /
• pp.77-85
• /
• 2002

선형 쉬프트 레지스터를 이용한 이진 난수 발생기의 연구는 1970년대부터 연구되어져 왔으며, 이러한 이진 난수열 발생기는 스트림 암호 기법에 이용되어졌다. 일반적으로, 이진 난수열 발생기는 최대 주기의 선형 쉬프트 레지스터와 선형 복잡도가 높은 난수를 발생시키기 위하여 비선형 여과함수 또는 비선형 결합함수로 구성된다. 그러므로, 높은 선형 복잡도 뿐만 아니라, 긴 주기를 갖는 이진 난수열의 생성은 스트림 암호 기법의 안전성을 평가하는데 중요한 요소가 된다. 일반적으로 L개의 레지스터와 1개의 궤환 함수 또는 특성 다항식으로 구성된 선형 쉬프트 레지스터의 최대 주기는 $2^L$-1을 넘을 수 없다. 본 논문에서는 L개의 레지스터와 2개의 부분 특성 다항식으로 구성된 새로운 이진 난수열 발생기를 제안한다. 제안된 이진 난수열 발생기는 초기 상태 값에 따라 기존의 선형 쉬프트 레지스터에서 생성한 수열의 주기와 같거나 긴 주기를 갖는 이진 난수열을 생성하며, 생성 수열의 선형복잡도 역시 증가된다.

• Journal of Microbiology and Biotechnology
• /
• 제11권4호
• /
• pp.693-699
• /
• 2001

An intracellular levansucrase gene, lscR from Rahnella aquatilis ATCC 15552, was cloned and its nucleotide sequence was determined. Nucleotide sequence analysis of this gene revealed a 1,238 bp open reading frame coding for a protein of 415 amino acids. The levansucrase was expressed by using a T7 promoter in Escherichia coli BL21 (DE3) and the enzyme activity was detected in the cytoplasmic fraction. The optimum pH and temperature of this enzyme for levan formation was pH 6 and $30^{\circ}C$, respectively. The deduced amino acid sequence of the lscR gene showed a high sequence similarity (59-89%) with Gram-negative levansucrses, while the level of similarity with Gram-positive enzymes was less than 42%. Multiple alignments of levansucrase sequences reported from Gram-negative and Gram-positive bacteria revealed seven conserved regions. A comparison of the catalytic properties and deduced amino acid sequence of lscR with those of other bacterial levansucrases strongly suggest that Gram-negative and Gram-positive levansucrases have an overall different structure, but they have a similar structure at the active site.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.569-579
• /
• 2006

Recently, the amount of genome sequence is increasing rapidly due to advanced computational techniques and experimental tools in the biological area. Sequence comparisons are very useful operations to predict the functions of the genes or proteins. However, it takes too much time to compare long sequence data and there are many research results for fast sequence comparisons. In this paper, we propose a hybrid grid system to improve the performance of the sequence comparisons based on the LanLinux system. Compared with conventional approaches, hybrid grid is easy to construct, maintain, and manage because there is no need to install SWs for every node. As a real experiment, we constructed an orthologous database for 89 prokaryotes just in a week under hybrid grid; note that it requires 33 weeks on a single computer.

• 한국통신학회논문지
• /
• 제39A권8호
• /
• pp.445-452
• /
• 2014

본 연구에서는 짝수 주기와 균형성을 갖는 4진 수열에 대하여 이상적인 자기상관특성을 정의하고, 이것이 이상적인 자기상관특성이 됨을 증명하였다. 또한, 주기가 $2^n-1$인 이상적인 자기 상관 특성을 갖는 이진 수열과 Gray 사상을 이용하여 주기가 $2{\times}(2^n-1)$인 이상적인 자기 상관 특성을 갖는 4진 수열의 생성법을 제안한다. 또한 새로 제안된 4진 수열의 자기상관 분포도 유도하였다.

• International journal of advanced smart convergence
• /
• 제5권3호
• /
• pp.8-15
• /
• 2016

In recent years, one of deep learning models called Deep Belief Network (DBN) which formed by stacking restricted Boltzman machine in a greedy fashion has beed widely used for classification and recognition. With an ability to extracting features of high-level abstraction and deal with higher dimensional data structure, this model has ouperformed outstanding result on image and speech recognition. In this research, we assess the applicability of deep learning in dna classification level. Since the training phase of DBN is costly expensive, specially if deals with DNA sequence with thousand of variables, we introduce a new encoding method, using decimal-binary vector to represent the sequence as input to the model, thereafter compare with one-hot-vector encoding in two datasets. We evaluated our proposed model with different contrastive algorithms which achieved significant improvement for the training speed with comparable classification result. This result has shown a potential of using decimal-binary vector on DBN for DNA sequence to solve other sequence problem in bioinformatics.

• Journal of Information Science Theory and Practice
• /
• 제1권2호
• /
• pp.6-15
• /
• 2013

Dr. Ranganathan's "Principles for Helpful Sequence" among the set of normative principles play an exclusive role in the arrangement of subject isolates. Each subject in the universe of subjects is regulated by a guiding principle of its own which analogously determines the sequence of Arrays in ordering the subject surrogates or isolates. For example, the "Principle of Later-in-Evolution" is applied for sequencing isolates of Animal and Plant Species; this concept can be applied to one of the tools of KOS viz. Taxonomies. The application of Principles for Helpful Sequence is summarily presented and in the process the paper highlights the inherent elements of knowledge organization in each one of these principles in a manner that might map the future course of research in this area with the potentiality to bring about a relation between principles for helpful sequence and KOS.

• 대한수학회보
• /
• 제43권4호
• /
• pp.831-839
• /
• 2006

By relaxing the requirements for a sequence of functions to be a delta sequence, a space of Boehmians on the torus ${\beta}(T^d)$ is constructed and studied. The space ${\beta}(T^d)$ contains the space of distributions as well as the space of hyperfunctions on the torus. The Fourier transform is a continuous mapping from ${\beta}(T^d)$ onto a subspace of Schwartz distributions. The range of the Fourier transform is characterized. A necessary and sufficient condition for a sequence of Boehmians to converge is that the corresponding sequence of Fourier transforms converges in $D'({\mathbb{R}}^d)$.

• 한국정보처리학회논문지
• /
• 제7권5호
• /
• pp.1474-1481
• /
• 2000

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.

• 산업경영시스템학회지
• /
• 제43권3호
• /
• pp.10-20
• /
• 2020

This paper presents a method to measure the similarity of assigned jobs in the gravure printing operation based on the chromaticity and color sequence, and order the jobs accordingly. The proposed dispatching rule can be used to fulfill diverse manufacturing site requirements because the parameters can be adjusted to prioritize chromaticity and color sequence. In general, dispatching rules either ignore the job-changing time or require that the time be clearly defined. However, in the gravure printing operation targeted in this study, it is difficult to apply the general dispatching rule because of the difficulties in quantifying the job-changing time. Therefore, we propose a method for generalizing assignment rules of the job planner, allocating relative similarity among assigned jobs, and determining the sequence of jobs accordingly. Chromaticity priority is determined by the arrangement of the color assignments in the printing operation; color sequence priority is determined by the addition, deletion, or change in a specific color sequence. Finally, the job similarity is determined by the dot product of the chromaticity and color sequence priorities. Implementation of the proposed dispatching rule at an actual manufacturing site showed the planner present the same job order as that obtained using the proposed rule. Therefore, this rule is expected to be useful in industrial sites where clear quantification of the job-changing time is not possible.

• 문화기술의 융합
• /
• 제5권3호
• /
• pp.339-344
• /
• 2019

서열 정렬에 있어서 전체를 비교하여 두 서열 사이의 최대의 유사성 또는 상동성을 찾는 전역 정렬은 넓은 범위를 선호하게 되는 편향성을 갖게 된다. 비일치 부분을 과감히 제거하고 높은 일치도를 갖는 부분 영역을 정렬하게 되면 정렬점수를 높이는 효과를 갖게 된다. 여러 개의 부분 지역 정렬을 탐색하게 하는 다중 지역정렬 방법을 적용하여 다수의 지역정렬을 수행하는 알고리즘을 구현하고 결과를 분석해 본다. 지역 정렬에 일반적으로 사용되는 Smith-Waterman 알고리즘의 제한점 중 하나인 서열이 길어지는 것을 방지하고, sub-optimal sequence를 찾기 위한 방법을 응용하여 다중지역 정렬을 수행한다.