• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.533-536
• /
• 2001

지상파 DTV 전송 시스템은 "training sequence"를 이용한 결정 궤환 등화기(DFE)를 사용한다. 이 등화기는 정적 다중경로 환경에서는 심볼 간의 간섭을 적절히 제거하는 반면, 동적 다중경로 환경에서는 "training sequence" 의 주기가 채널 효율 문제로 충분히 짧지 않기 때문에 충분히 제거하지 못하는 것으로 보고되고 있다. 이 논문에서는 이 문제점을 해결하기 위해서 "training sequence" 를 이용한 DFE와 선형 등화기, 블라인드 DFE와 선형 등화기 및 혼합형 DFE를 구현하여 정적 채널과 동적 채널에 대한 성능을 분석하였다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.158-168
• /
• 2001

We present a tabu search (TS) algorithm to minimize maximum lateness on a single machine in the presence of sequence dependent setup times and dynamic job arrivals. The TS algorithm starts with a feasible schedule generated by a modified ATCS (Apparent Tardiness Cost with Setups) rule, then through a series of search steps it improves the initial schedule. Results of extensive computational experiments show that the TS algorithm significantly outperforms a well-known RHP heuristic by Ovacik and Uzsoy, both on the solutions quality and the computation time. The performance advantage is particularly pronounced when there is high competition among jobs for machine capacity.

• The KIPS Transactions:PartB
• /
• v.15B no.3
• /
• pp.179-188
• /
• 2008

In this paper, knowledge based text to facial sequence image system for interaction of lecturer and learner in cyber universities is studied. The system is defined by the synthesis of facial sequence image which is synchronized the lip according to the text information based on grammatical characteristic of hangul. For the implementation of the system, the transformation method that the text information is transformed into the phoneme code, the deformation rules of mouse shape which can be changed according to the code of phonemes, and the synthesis method of facial sequence image by using deformation rules of mouse shape are proposed. In the proposed method, all syllables of hangul are represented 10 principal mouse shape and 78 compound mouse shape according to the pronunciation characteristics of the basic consonants and vowels, and the characteristics of the articulation rules, respectively. To synthesize the real time facial sequence image able to realize the PC, the 88 mouth shape stored data base are used without the synthesis of mouse shape in each frame. To verify the validity of the proposed method the various synthesis of facial sequence image transformed from the text information is accomplished, and the system that can be applied the PC is implemented using the proposed method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.93-101
• /
• 2010

In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.1
• /
• pp.25-30
• /
• 2004

In this Paper, a beat recognition method from a sequence of images of conducting person was proposed. Hand position was detected using color discrimination, and symbolized by quantization. Then a motion of the conductor was represented as a sequence of symbols. HMM (Hidden Markov Model), which is excellent for recognition of sequence pattern with some level of variation, was used to recognize the sequence of symbols to be a motion for a beat.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.11
• /
• pp.2507-2513
• /
• 2010

In this paper, we show that the shrinking generator with two LFSR whose characteristic polynomials are primitive is an interleaving generator and analyze phase shifts in shrunken sequence. Also for a given intercepted sequence of shrunken sequence, we propose. the method of reconstructing some deterministic bits of the shrunken sequence using phase shifts.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.693-698
• /
• 2000

Aspects of classical information theory, such as rate distortion theory, investigate how to encode and decode information from an independently identically distributed source so that the asymptotic distortion rate between the source and its quantized representation is minimized. However, in most natural dynamics, the source state is highly corrupted by disturbances, and the measurement contains the noise. In recent coder-estimator sequence is developed for state estimation problem based on observations transmitted with finite communication capacity constraints. Unlike classical estimation problems where the observation is a continuous process corrupted by additive noises, the condition is that the observations must be coded and transmitted over a digital communication channel with finite capacity. However, coder-estimator sequence does not provide such a quantitative analysis as a variance for estimation error. In this paper, under the assumption that the estimation error is Gaussian distribution, a variance for coder-estimation sequence is proposed and its fitness is evaluated through simulations with a simple example.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.5 no.3
• /
• pp.159-163
• /
• 2000

The genome sequencing project has generated and will contitute to generate enormous amounts of sequence data. Since the first complete genome sequence of bacterium Haemophilus in fluenzae was published in 1995, the complete genome sequences of 2 eukaryotic and about 22 prokaryotic organisms have detemined. Given this everincreasing amounts of sequence information, new strategies are necessary to efficiently pursue the phase of the geome project- the elucidation of gene expression patterns and gene product function on a whole genome scale. In order to assign functional information to the genome sequence, DNA chip technology was developed to efficienfly identify the differential expression pattern of indepondent biogical samples. DNA chip provides a new tool for genome expreesion analysis that may revolutionize revolutionize many aspects of human kife including mew surg discovery and human disease diagnostics.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.440-440
• /
• 2000

In general, camera calibration is consisted of Indoor and Outdoor system. In case of Indoor system, it was optimized experimental condition. However, Outdoor system is different camera parameters for each image that is compared to equaled position. That is, it imply that camera parameters are varied by an environment with light or impulse noise, etc. So we make use of Image sequence because that they provide the more information for each image. In addition to, we use Corresponding line because it has less error than Corresponding point. Corresponding line has also the more information. In this paper, we suggest on-line camera calibration method using the time-varying Image sequence and Corresponding line. So we calculate camera parameters with intrinsic and extrinsic parameters in On-line system.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.321-327
• /
• 2006

Recently there has been enormous growth in the amount of commercial and scientific data. Such datasets consist of sequence data that have an inherent sequential nature. However, only a few of the existing clustering algorithms consider sequentiality. This study presents a similarity measure and a method for clustering such sequence datasets. Especially, we present an extended concept of the measure of similarity, which considers various conditions. Using a splice dataset, we show that the quality of clusters generated by our proposed clustering algorithm is better than that of clusters produced by traditional clustering algorithms.