• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.526-531
• /
• 2003

Recently, many BIST(Built-in Self Test) schemes have been researched to reduce test time and hardware. But, most BIST schemes about pattern generation are for deterministic pattern generation. In this paper a new pseudo-random BIST scheme is provided to reduce the existing test hardware and keep a reasonable length of test time. Theoretical study demonstrates the possibility of the reduction of the hardware for pseudo-random test with some explanations and examples. Also the experimental results show that in the proposed test scheme the hardware for the pseudo-random test is much less than in the previous scheme and provide comparison of test time between the proposed scheme and the current one.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1543-1548
• /
• 2009

In this paper, a high speed code synchronization circuit is proposed. for fast code synchronization, matched filler method is used for initial code acquisition with two channel correlators. Particular frequency patterns of the limited number having the information about PN code start time are composed and transmitted repeatedly to increase the probability of accurate initial synchronization. And digital frequency synthesizer is proposed. And it's performance is analyzed theoretically. The analysis show that fast frequency hopping is possible in frequency hopping system that use digital frequency synthesizer.

• Annual Conference of KIPS
• /
• 2001.10a
• /
• pp.421-424
• /
• 2001

본 논문은 설계 패턴의 효율적인 관리와 재사용을 위하여 패싯 방식을 이용한 패턴 분류와 패싯 항목과 패턴간의 관련성을 이용한 패턴 검색 시소러스를 구축하였다. 저장소에 패턴들의 관계성을 정의하고 새로운 패턴을 삽입 시 임의의 패턴과의 관계성을 지정해주면 시스템은 이 패턴에 연관된 패턴들을 보여주고 사용자는 패턴과의 관계성을 지정해 준다. 패턴 검색은 입력한 질의를 추론하여 검색할 수 있도록 부울 질의 형식을 사용하였다. 그리고 기존의 시소러스의 중복성과 복잡한 비교시간을 최소화하기 위하여 "Gamma 확장 + 패싯" 분류방법을 이용하여 패턴들을 분류하였고, 본 연구의 검색 결과가 보다 더 정확한 패턴이 검색될 수 있도록 하였다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.6
• /
• pp.833-839
• /
• 2019

Bus Information System (BIS) collects information related to the operation of buses and provides information to users through predictive algorithms. Method of predicting through recent information in same section reflects the traffic situation of the section, but cannot reflect the characteristics of the target line. The method of predicting the historical data at the same time zone is limited in forecasting peak time with high volatility of traffic flow. Therefore, we developed a pattern recognition bus arrival time prediction algorithm which could be overcome previous limitation. This method recognize the traffic pattern of target flow and select the most similar past traffic pattern. The results of this study were compared with the BIS arrival forecast information history of Seoul. RMSE of travel time between estimated and observed was approximately 35 seconds (40 seconds in BIS) at the off-peak time and 40 seconds (60 seconds in BIS) at the peak time. This means that there is data that can represent the current traffic situation in other time zones except for the same past time zone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.664-670
• /
• 2005

OFDM is a very attractive technique for achieving high-bit-rate data transmission and high spectrum efficiency in fading environment. However, the reliable detection of an OFDM signal in time-varying multipath fading channels is a challenging problem. Accordingly, various channel estimation methods have been proposed for performance improvement. But, conventional pilot patterns for channel estimation in OFDM systems have not robust characteristics relating to various mobile speed. To solve this drawback in conventional patterns, we propose the pilot patterns modified from conventional patterns to have a good error performance in time-varying fading channel. Simulation results show that the performance of the proposed pilot patterns is better than conventional patterns in fast time-varying channel.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.811-814
• /
• 2003

In this paper, we propose a fast block-matching motion estimation method using the cross pattern and the hexagonal pattern. For the block-matching motion estimation method, full search finds the best motion estimation, but it requires huge search time because it has to check every search point within the search window. The proposed method makes use of the fact that most of motion vectors lie near the center of block. The proposed method first uses the cross pattern to search near the center of block, and then uses the hexagonal pattern to search larger motion vectors. Experimental results show that our method is better than recently proposed search algorithms in terms of mean-square error performance and required search time.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.365-380
• /
• 2002

Temporal data mining, the incorporation of temporal semantics to existing data mining techniques, refers to a set of techniques for discovering implicit and useful temporal knowledge from large quantities of temporal data. Temporal knowledge, expressible in the form of rules, is knowledge with temporal semantics and relationships, such as cyclic pattern, calendric pattern, trends, etc. There are many examples of temporal data, including patient histories, purchaser histories, and web log that it can discover useful temporal knowledge from. Many studies on data mining have been pursued and some of them have involved issues of temporal data mining for discovering temporal knowledge from temporal data, such as sequential pattern, similar time sequence, cyclic and temporal association rules, etc. However, all of the works treated data in database at best as data series in chronological order and did not consider temporal semantics and temporal relationships containing data. In order to solve this problem, we propose a theoretical framework for temporal data mining. This paper surveys the work to date and explores the issues involved in temporal data mining. We then define a model for temporal data mining and suggest SQL-like mining language with ability to express the task of temporal mining and show architecture of temporal mining system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.444-447
• /
• 2000

본 논문에서는 종래의 정적인 디지털 패턴 매칭을 행하는 연상메모리와는 달리 아놀로그의 시계열정보를 직접 처리하여 시간축 방향으로 설정하는 것으로 강인성이 뛰어난 연상기억시스템을 제안하였다. 시스템의 기본적인 능력을 조사하기 위하여 기억패턴을 주기계열로 그리고 하중은 전부 고정하는 조건으로 단순화하여 시뮬레이션을 행하여 오류 정정능력을 갖는 것을 확인하였다. 시간축 방향의 하중을 적절하게 설정하면 기억용량의 증대나 상기 오류의 저감 등의 효과가 기대된다.

• The Journal of the Korea Contents Association
• /
• v.15 no.4
• /
• pp.153-167
• /
• 2015

This paper empirically analyzes specific characteristics of VOD users and their practical viewing patterns, using socio-demographic data of the current IPTV subscribers in combination with actual data of genre usage and payment. The findings revealed active viewing patterns of male, the unemployed, high earners and early adopters. In terms of preferences, households with large numbers of women prefer time shift contents, whereas households composed of more men or preschoolers prefer non-time shift contents. Likewise, the households that have more women or higher income had relatively a lot of experiences of purchasing time shift contents on one hand, but the households characterized by the larger numbers of family members or unemployed householder or young householder showed much willingness to pay premium contents on the other hand. Given the utilization of correct database, the findings offer useful information conducive to service promotion and marketing strategies to maximize VOD use in the practical dimension.

• Annual Conference on Human and Language Technology
• /
• 1991.10a
• /
• pp.118-132
• /
• 1991

본 연구에서는 타자행동의 시간적 구조에 미치는 손가락 운동패턴과 타자해야 할 재료의 길이의 영향을 살펴 보았다. 먼저 손가락 운동패턴 결과는, 한 손가락을 반복해서 연속적으로 사용하는 경우가 손가락을 번갈아서 사용하도록 하는 경우보다 타자가 더 효율적이었다. 그러나 동일한 손가락을 사용하지만 위치가 다른 숫자를 연속적으로 타자하게 되는 경우는 손가락의 부담으로 인해 오히려 타자시간이 길게 걸렸다. 손가락을 번갈아 사용하는 경우에도, 집게손가락에서 시작하여 순행방향으로 타자가 이루어지는 경우는 한 손가락을 반복해서 사용하는 것만큼 타자가 용이했다. 아울러 가능한 숫자조합의 갯수에 비례하여 숫자조합의 평균타자시간이 증가함이 관찰되었다. 다음으로 타자할 숫자배열의 길이와 관련해서, 첫번째 타자가 이루어지기까지의 반응지연시간은 숫자의 자리수에 무관하게 약 400msec 정도로 관찰되었다. 첫타자시간 이후의 타자시간은 타자할 숫자가 3, 4, 5자리수인 경우는 고른 타자시간을 보인 반면, 6자리수인 경우는 4번째 숫자에서 급격한 타자 시간의 지연이 관찰되었다. 이 결과가 군집화의 개념과 관련해서 논의되었다. 마지막으로 타자할 자료를 한줄 혹은 두줄씩 제시하는 것은 타자시간에 별 영향을 주지 못했다.