• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.523-526
• /
• 2009

시계열 데이터에서 패턴을 분석하는 기법은 많은 발전이 이루어져 오고 있으나 주식시장의 경우 패턴 분석 및 예측에 관련되어 많은 연구가 이루어져 있지 않고 있다. 이는 주가의 등락 자체가 본질적으로 무작위하다고 생각되어지고 있기 때문이다. 본 연구에서는 주가의 등락이 보여주는 무작위성의 정도를 Kolmogorov Complexity로 측정, 그 무작위성의 정도와 본 논문에서 제시한 반전역정렬로 예측하는 주가의 예측 간의 상관관계를 보인다. 이를 위하여 KOSPI 주식 데이터 28년 690개의 데이터를 수집하여 이들 주식 데이터의 등락을 양자화된 문자열로 변환하여 본 논문에서 제시한 방법의 의미를 평가하였다. 그 결과 Kolmogorov Complexity가 높은 경우에는 주가 변동 예측이 어려우며, Kolmogorov Complexity가 낮은 경우에는 주식 변동 예측은 가능하나 등락 예측 율은 단기 예측은 12%이상의 예측율을 보일 수 없으며, 장기 예측의 경우 54%의 예측율로 수렴함을 확인하였다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.1
• /
• pp.8-15
• /
• 1993

A concrete disign of memory circuit is presented aiming at the application of sliding diagonal test patterns. A modification of sliding diagonal test pattern includes the complexity reduction from O(n$^{32}$) to O(n) using parallel test memory concept. The control circuit design was based on delay-element, and verified via logic and circuit simulation. Area overhead was evaluated based on physical layout using a 0.7 micron design rule resulting in about 1% area increase for a typical 16Mbit DRAM.

• Journal of Korean Medical classics
• /
• v.36 no.3
• /
• pp.27-54
• /
• 2023

Objectives : To determine the background against which Zhishi has been applied to treat Pi pattern, through examination of changes in Pi pattern treatments in a historical context. Methods : The properties and nature of Zhishi as written in multiple bencao texts were analyzed. In addition, understanding of the Pi pattern, the changes in its treatment were examined diachronically based on opinions of Zhang Zhongjing, Zhugong, and Li Dongyuan. Examples of Zhishi application in Pi pattern treating formulas were collected and their mechanisms analyzed. Results : Zhishi is strongly effective in relieving accumulation and stagnation, due to its properties of dispersing and lowering. The early view of contrasting Pi with Jiexiong shifted to viewing the Pi pattern as an inner damage, from the perspective of rising and lowering of the Qi mechanism based on the Spleen and Stomach. As a result, Zhishi became a key ingredient in the treatment of the Pi pattern. Conclusions : As the perspective of seeing Pi as one end of the Yin-Yang coupling with Jiexiong from the Shanghanlun shifted to seeing it as a problem of Qi mechanism of the Spleen and Stomach, Zhishi became a key ingredient in the formulas to treat Pi pattern. The complexity of Zhishi's direction made it appropriate to treat the changed Pi pattern.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.616-619
• /
• 2007

Nowadays, urbanized area expands its boundary, and distribution of urbanized area is gradually transformed into more complicated pattern. In Korea, SMA(Seoul Metropolitan Area) has outstanding urbanized area since 1950s. But it is ambiguous whether urban distribution is clustered or dispersed. This study aims to show the way in which expansion of urbanized area impacts on spatial distribution pattern of urbanized area. We use quadrat analysis, nearest-neighbor analysis and fractal analysis to know distribution pattern of urbanized area in time-series urban growth. The quadrat analysis indicates that distribution pattern of urbanized area is clustered but the cohesion is gradually weakened. And the nearest-neighbor analysis shows that point patterns are changed that urbanized area distribution pattern is progressively changed from clustered pattern into dispersed pattern. The fractal dimension analysis shows that 1972's distribution dimension is 1.428 and 2000's dimension is 1.777. Therefore, as time goes by, the complexity of urbanized area is more increased through the years. As a result, we can show that the cohesion of the urbanized area is weakened and complicated.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.188-191
• /
• 2002

To reduce the bit-rate of video sequences by removing temporal redundancy, motion estimation techniques have been developed. However, the high computational complexity of the problem makes such techniques very difficult to be applied to high-resolution applications in a real time environment. For this reason, low computational complexity motion estimation algorithms are viable solutions. If a priori knowledge about the motion of the current block is available before the motion estimation, a better starting point for the search of n optimal motion vector on be selected and also the computational complexity will be reduced. In this paper, we present an adaptive block matching algorithm based on temporal correlations of consecutive image frames that defines the search pattern and the location of initial starting point adaptively to reduce computational complexity. Experiments show that, comparing with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(㏈) better than DS in terms of PSNR and improves as much as 50% in terms of the average number of search points per motion estimation.

• Journal of the Korean Institute of Rural Architecture
• /
• v.10 no.3
• /
• pp.35-42
• /
• 2008

The purpose of this study is to suggest the possibility of complexity use these facilities for elderly welfare facility or public health facility and community center in rural. For this purpose this article researched into elderly welfare facilities, public health facilities and social welfare centers. And we studied of village community center, life pattern in old people in rural. With a rapidly increase in population of older people in rural, there is a great demand for the construction of complexes facilities. Particularly, there was highly demand for the public health facilities and the welfare programme of physiotherapy facilities on village community center in rural. However, there is not a intersection of space composition and specification function between elderly welfare facilities and public healthcare facilities and community welfare centers in this time. Accordingly, in the future plan for community center in rural, it is necessary to consider integration with public health facility. And it is necessary to compose the community center in consideration of the spatial organization of complexity as a possibility of community welfare activities.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.112-127
• /
• 2002

A useful pattern is a pattern that contributes much to learning. For a classification problem those patterns near the class boundary surfaces carry more information to the classifier. For a regression problem the ones near the estimated surface carry more information. In both cases, the usefulness is defined only for those patterns either without error or with negligible error. Using only the useful patterns gives several benefits. First, computational complexity in memory and time for learning is decreased. Second, overfitting is avoided even when the learner is over-sized. Third, learning results in more stable learners. In this paper, we propose a pattern 'utility index' that measures the utility of an individual pattern. The utility index is based on the bias and variance of a pattern trained by a network ensemble. In classification, the pattern with a low bias and a high variance gets a high score. In regression, on the other hand, the one with a low bias and a low variance gets a high score. Based on the distribution of the utility index, the original training set is divided into a high-score group and a low-score group. Only the high-score group is then used for training. The proposed method is tested on synthetic and real-world benchmark datasets. The proposed approach gives a better or at least similar performance.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.339-342
• /
• 2005

We present an efficient block-based motion estimation algorithm with motion analysis. The motion analysis determines a size of search pattern and a maximum repeated count of search pattern. In case of large movement in large image, we reduce search points and the local minimum which caused by low performance. The proposed algorithm employs with searching step of 2. The first step determines an initial search point with neighbor block vector and a size of initial search pattern. The second step determines a size of search pattern and a maximum repeated count with motion analysis. We improve motion prediction accuracy while reducing required computational complexity compared to other fast block-based motion estimation algorithms.

• Journal of Multimedia Information System
• /
• v.5 no.4
• /
• pp.221-228
• /
• 2018

Skin-color information is not sufficient for palmprint segmentation in complex scenes, including mobile environments. Traditional active shape model (ASM) combines gray information and shape information, but its performance is not good in complex scenes. An improved ASM method is developed for palmprint segmentation, in which Perux method normalizes the shape of the palm. Then the shape model of the palm is calculated with principal component analysis. Finally, the color likelihood degree is used to replace the gray information for target fitting. The improved ASM method reduces the complexity, while improves the accuracy and robustness.