• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.111-117
• /
• 2007

We present an efficient decoding scheme for Huffman codes in which we use a properties of canonical prefix tree. After Huffman tree is converted to canonical Huffman tree, we represent Huffman tree with minimum information using rules associated with values of nodes in canonical tree. The proposed scheme can reduce memory to store Huffman tree information while maintains the same Processing time. The memory size in order to represent tree information is 2h + 2klogn which is less than those of previous methods. But the number of search is similar to previously proposed techniques.

• Journal of Fashion Business
• /
• v.8 no.6
• /
• pp.123-136
• /
• 2004

The purpose of this the end of 20th century fashion about various phenomenon of distopia. This study have the analysis and consideration through the elements and peculiarity of distopia. This study give us the various figures of distopia st fashion as well as the common features of distopia. The study method refers to sundry records, thesis, fashion magazine, publication, the collection works and internet. It is as follows. 'Distopia' prefix to dis of Utopia and means unknown future. Distopia trends towards future negatively. The end of 20th century, it is well brought out various cultures. Movie, novel and pop culture have effect on end of the 20th fashion with a view of distopia. It is the fear and uncertainty of the future. The characters of distopia through the works are divided into formative characteristics and aesthetics meaning. The future fashion of distopia expression mixed and various cultural life, also the mixed of utopia and distopia fashion. Distopia stimulates the designers to the new expression and expose their new areas.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.25 no.2
• /
• pp.20-30
• /
• 1997

This study compared Korean names of 449 herbaceous landscape plants with Chinese and Japanese names to identify the origin of their Korean names. The results were as follow ; 1. Korean herbaceous plants named after Chinese names were 71 species. They could be classified into 4 typical groups of their origin : plants named from slight or partial changes of Chinese names, plants with a prefix or suffix attached to Chinese names, plants having names translated from Chinese names, and plants with the same names as Chinese. 2. Korean herbaceous plants derived from Japanese names were 378 species. They also could be classified into 4 typical groups of their origin; plants with new names in partial combination of Japaneses and Korean names, plant having names directly translated from Japaneses names, plants with the same names as Japanese, and plants having names erroneously translated from Japaneses names.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.645-648
• /
• 2006

생물학적 데이터 서열에는 크게 DNA 서열과 단백질 서열이 있다. 이들 서열 데이터들은 여러 데이터베이스에 걸쳐 매우 방대한 양을 가지고 있으며, 각각의 서열은 수백 또는 수천 개의 항목들을 가지고 있어 길이가 매우 길다. 일반적으로 유전적인 변형, 또는 변이로부터 보존된 영역이나 특정 패턴들을 서열 안에 포함하고 있는데 생물학적 서열 데이터에서 보존된 영역이나 패턴들은 계통발생학적 근거로 활용 될 수도 있으며 기능과 밀접한 관계를 가지기도 한다. 따라서 서열들로부터 빈번하게 발생하는 패턴을 발견하고자 하는 알고리즘 개발이 요구되고 있다. 초창기 Apriori 알고리즘을 변형하여 빈발 패턴을 발견하고자 하는 노력들로부터 근래에는 PrefixSpan 트리를 이용하여 효과적으로 성능을 개선하고 있지만 아직까지는 여러 번의 데이터베이스 접근이 요구되고 있어 성능저하가 발생한다. 이에 본 논문에서는 접미사 트리를 변형하여 데이터베이스 접근을 획기적으로 줄이고 많은 서열들로부터 빈번하게 발생하는 연속적인 서열을 효과적으로 발견하는 방법을 제안한다.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.521-536
• /
• 2010

Spatio-temporal patterns extracted from historical trajectories of moving objects reveal important knowledge about movement behavior for high quality LBS services. Existing approaches transform trajectories into sequences of location symbols and derive frequent subsequences by applying conventional sequential pattern mining algorithms. However, spatio-temporal correlations may be lost due to the inappropriate approximations of spatial and temporal properties. In this paper, we address the problem of mining spatio-temporal patterns from trajectory data. The inefficient description of temporal information decreases the mining efficiency and the interpretability of the patterns. We provide a formal statement of efficient representation of spatio-temporal movements and propose a new approach to discover spatio-temporal patterns in trajectory data. The proposed method first finds meaningful spatio-temporal regions and extracts frequent spatio-temporal patterns based on a prefix-projection approach from the sequences of these regions. We experimentally analyze that the proposed method improves mining performance and derives more intuitive patterns.

• Journal of Korea Technology Innovation Society
• /
• v.7 no.3
• /
• pp.555-580
• /
• 2004

We analyzed the effect of 6-month lagged number portability policy and introduction of common number among carriers on Korean mobile market. Our result shows that the policy change contributed to both the increase in number of mobile subscribers and decrease in dominant carrier's market share. We found that unified prefix among mobile operators is more effective than the lagged number portability policy. The carriers' profit, however, decreased a lot due to excessive marketing expenditure. We also estimated market shares of carriers up to year 2005 when full number portability policy is adopted. The results show that dominant carrier's monopolistic power will be recovered by the end of 2005 implying government's number policy itself cannot guarantee the effective competition in Korean mobile market.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.214-216
• /
• 2004

순차패턴 마이닝은 데이터들 속에서 어떤 순차 관계가 들어 있는 패턴을 찾는 것이다. 순차 패턴은 다양한 분야에서 중요하게 쓰인다. 예를 들어, 소비자가 구입한 물품들 간의 순차적인 관계성은 다음에 구입할 물건을 예측하는데 쓰일 수 있다. 또한 방문 웹 페이지의 순차 패턴은 사용자가 방문하고자 하는 다음 페이지를 예측하는데 중요할 수 있다. 본 논문에서는 다차원 순차패턴을 마이닝하는 새로운 효율적인 알고리즘의 구현에 대해 설명한다 다차원 순차 패턴 마이닝은 속성-값(attribute-value) 기술을 포함하는 순차 패턴의 연관 규칙을 찾는 것이다. 다음의 두 가지의 현존하는 효율적 알고리즘을 융합하였다. 순차패턴 마이닝을 위한 PrefixSpan 알고리즘과 비 순차패턴 마이닝을 위한 StarCubing 알고리즘. 새로운 알고리즘은 다차원 데이터를 마이닝 하는 StarCubing알고리즘의 효율성을 이용하므로 다차원 순차 데이터를 마이닝 하는데 효율적일 것이다. 실험결과는 제안한 알고리즘이 특히 작은 최소지지도와 작은 cardinality에서 Seq-Dim과 Dim-Seq 같은 현존하는 알고리즘보다 나은 성능임을 보여준다.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1466-1470
• /
• 2016

As individuals create many contents anytime and anywhere together with the widespread dissemination of smart devices as well as various social networking services (SNS), content centric networking (CCN) has regarded as a new networking technology. However, CCN is exposed to malicious attacks on the mobility management of mobile content sources during handover and high volume of control messages. Therefore, this paper presents a secure duplicate name detection (SecureDND) mechanism without additional control messages by signed information and secure token. It is shown from the performance evaluation that the proposed scheme can provide low control overhead, which results in the network scalability.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.816-827
• /
• 2008

In this paper, two-stage pipelined floating-point arithmetic unit (FP-AU) is designed. The FP-AU processor supports seventeen operations to apply 3D graphics processor and has area-efficient and low-latency architecture that makes use of modified dual-path computation scheme, new normalization circuit, and modified compound adder based on flagged prefix adder. The FP-AU has about 4-ns delay time at logic synthesis condition using $0.18{\mu}m$ CMOS standard cell library and consists of about 5,930 gates. Because it has 250 MFLOPS execution rate and supports saturated arithmetic including a number of graphics-oriented operations, it is applicable to mobile 3D graphics accelerator efficiently.

• Journal of Scientific & Technological Knowledge Infrastructure
• /
• s.7
• /
• pp.141-148
• /
• 2001

This paper describes a mechanisms for IPv6 multihomming with loadsharing broker, focusing on the interdomain scalability and load sharing with redundancy on IPv6 networks. Unlike currently-practiced IPv4 multihoming, this model does not impact the worldwide routing table size, also it provides inbound load sharing at site level based on router renumbering, and multiple-prefix assigning techniques of IPv6. The proposed model has four modules such as building interfaces MIB module, priority list maintaining module, load detection module, and RRP configuration module.