• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.166-174
• /
• 1994

This paper presents the algorithm of an on-line cursive Hangeul recognition by means of the DP matching with structural information. In the proposed method, the penalty represents the similarity between input character and reference character. The penalty is dynamically computed with types of strokes, directions of strokes, and the length rations of fragment during the process that searchs for an optimal path using 3$\times$3 matrix. As the result, this method can be exactly matched for even greatly deformed characters. The computer simulation shows that the proposed algorithm can be utilized in recognizing cursive Hangeul as well as correct Hangeul.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.2 s.150
• /
• pp.286-295
• /
• 2006

The purpose of this study was to identify the determinants of purchasing non-deceptive counterfeit luxury brands. As determinants, this study exmained subject-related variables(consumer ethnoncetrism and attitude toward counterfeit), product-related variable(similarity with originals), and social influence(social recognition by others). Data were gathered by surveying university students living in Seoul metropolitan area using convenient sampling, and 323 questionnaires were used in the statistical analysis. In analyzing data, confirmatory factor analysis and path analysis were conducted using structural equation modeling. Results showed that consumers' attitudes toward counterfeits significantly influenced their attitudes toward purchasing counterfeit luxury brands which directly influence purchasing frequency of counterfeit luxury brands. Consumers who evaluated the counterfeit more similar to the originals had more positive attitudes toward purchasing counterfeit luxury brands. The results show why consumers have increasing demands for counterfeits and the implications for anti-counterfeit business are suggested.

• Journal of the Korean Society of Tobacco Science
• /
• v.21 no.2
• /
• pp.152-159
• /
• 1999

A CAB cDNA clone(pKGCAB) encoding the light harvesting chlorophyll a/b binding protein of the semi-shade plant, Korean ginseng(Panax ginseng C. A. Meyer) was isolated by the one-way path random sequencing of ginseng cDNA library clones and transgenic tobacco plants(Nicotiana tabacum NC82) were produced by the transformation of this ginseng CAB gene in use of Agrobacterium tumefaciens LBA4404. The CAB gene showed type 1 structure of LHCP-II, 84% similarity in nucleotide sequence and 92% in amino acid sequence to that of Nicotiana tabacum CAB40, respectively. Seed germination and initial growth of the transgenic tobacco plants transformed with the cDNA fragment were accelerated under low light intensity compared with those of normal tobacco plant, that may result from the higher light sensitivity of the transgenic plants than that of the normal.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1515-1518
• /
• 2003

XML의 대표적인 특징은 기존의 다른 컨텐츠와는 달리 문서의 구조를 기술할 수 있다는 것이다. 구조적 정보는 활용 방법에 파라 XML문서의 다양한 처리에 있어 성능을 향상시키는 핵심적인 요소가 될 수 있다. 그러나 XML 태그의 자기 서술적인 특성에서 비롯되는 구조적 표현의 차이는 오히려 문서의 식별을 어렵게 하는 원인이 된다. 본 논문에서는 기존의 비트맵 인덱스(Bitmap Index)를 이용한 XML 문서 검색 시스템이 다양한 구조적 유사성을 판별할 수 없는 단점을 보완 가능하도록 경로 중심의 유사 문서 인식 기법을 제안한다. 이 기법은 '경로 구성 유사도'와 '유사 경로 테이블'을 통해 기존의 비트맵 인덱스가 갖는 유사 경로를 인식하지 못하는 단점을 해결하고 검색의 유연성을 부여함으로써 보다 양질의 검색 결과를 도출할 수 있다. 또 이것은 기존 시스템의 Bit-wise 연산에 완전히 이식됨으로써 비트맵 인덱스의 장점인 빠른 성능을 그대로 유지할 수 있게 된다.

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

최근 DTD (Document Type Descriptor)를 포함하고 있지 않은 XML 문서의 사용이 증가하고 있다. 따라서 서로 다른 구조를 갖는 많은 양의 XML 문서를 관계형 DBMS에 저장하거나, 인덱스를 이용하여 매핑하는 등 보다 효율적으로 관리하기 위한 다양한 인덱싱 기법에 대한 연구가 진행되고 있다. 이러한 연구들 중 경로 비트맵 인덱싱 기법은 경로 구성 유사도를 기반으로 3차원 비트맵 클러스터를 생성하고, 클러스터 단위의 검색을 수행함으로서 빠른 검색 속도를 보여주었다. 그러나 이 기법은 비교하려는 두 경로 중 항상 짧은 경로가 기준 경로가 되는 한계점과, 같은 노드 구성을 가지는 두 경로에서도 노드의 위치에 따라 그 유사도가 크게 변하는 등의 여러 문제점을 가지고 있었다. 이러한 문제점을 해결하고, 정확한 클러스터링을 수행하기 위해서는 합리적인 경로 유사도 계산식이 필요하게 되었다. 본 논문에서는 기존 방법의 문제점을 해결하고, 보다 정확한 클러스터링을 수행할 수 있는 새로운 경로 유사도 계산식을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.689-692
• /
• 2004

XML은 의미적으로는 동일하거나 혹은 유사하지만 서로 다른 구조의 XML 문서들을 허용하므로 XML 문서들을 대상으로 하는 검색, 클러스터링 등의 응용에서는 XML 문서들간의 유사도 계산이 선행되어져야 한다. XML 문서간 유사도를 계산하기 위해서는 문서의 구조 정보인 엘리먼트들과 이들 엘리먼트들의 계층적 구조가 고려되어져야 한다. 본 연구에서는 두 XML 문서가 얼마나 유사한 경로들을 공통으로 가지냐를 두 문서간의 유사도로 보고, 경로 유사도 계산식과, 이를 기반으로 하는 문서 거리 및 문서 유사도 계산식을 정의하여, 유사도 계산 기법을 제안한다. 제안된 기법과 기존 유사도 계산 기법들을 예제 문서들을 통해 계산결과를 비교한다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.700-705
• /
• 2008

In this paper, we propose object classification algorithm for real-time surveillance system. We have approached this problem using silhouette-based template matching. The silhouette of the object is extracted, and then it is compared with representative template models. Template models are previously stored in the database. Our algorithm is similar to previous pixel-based template matching scheme like Hausdorff Distance, but we use 1D image array rather than 2D regions inspired by Hilbert Path. Transformation of images could reduce computational burden to compute similarity between the detected image and the template images. Experimental results show robustness and real-time performance in object classification, even in low resolution images.

• Journal of The Korean Astronomical Society
• /
• v.36 no.3
• /
• pp.89-95
• /
• 2003

Observations of dark matter dominated dwarf and low surface brightness disk galaxies favor density profiles with a flat-density core, while cold dark matter (CDM) N-body simulations form halos with central cusps, instead. This apparent discrepancy has motivated a re-examination of the microscopic nature of the dark matter in order to explain the observed halo profiles, including the suggestion that CDM has a non-gravitational self-interaction. We study the formation and evolution of self-interacting dark matter (SIDM) halos. We find analytical, fully cosmological similarity solutions for their dynamics, which take proper account of the collisional interaction of SIDM particles, based on a fluid approximation derived from the Boltzmann equation. The SIDM particles scatter each other elastically, which results in an effective thermal conductivity that heats the halo core and flattens its density profile. These similarity solutions are relevant to galactic and cluster halo formation in the CDM model. We assume that the local density maximum which serves as the progenitor of the halo has an initial mass profile ${\delta}M / M {\propto} M^{-{\epsilon}$, as in the familiar secondary infall model. If $\epsilon$ = 1/6, SIDM halos will evolve self-similarly, with a cold, supersonic infall which is terminated by a strong accretion shock. Different solutions arise for different values of the dimensionless collisionality parameter, $Q {\equiv}{\sigma}p_br_s$, where $\sigma$ is the SIDM particle scattering cross section per unit mass, $p_b$ is the cosmic mean density, and $r_s$ is the shock radius. For all these solutions, a flat-density, isothermal core is present which grows in size as a fixed fraction of $r_s$. We find two different regimes for these solutions: 1) for $Q < Q_{th}({\simeq} 7.35{\times} 10^{-4}$), the core density decreases and core size increases as Q increases; 2) for $Q > Q_{th}$, the core density increases and core size decreases as Q increases. Our similarity solutions are in good agreement with previous results of N-body simulation of SIDM halos, which correspond to the low-Q regime, for which SIDM halo profiles match the observed galactic rotation curves if $Q {\~} [8.4 {\times}10^{-4} - 4.9 {\times} 10^{-2}]Q_{th}$, or ${\sigma}{\~} [0.56 - 5.6] cm^2g{-1}$. These similarity solutions also show that, as $Q {\to}{\infty}$, the central density acquires a singular profile, in agreement with some earlier simulation results which approximated the effects of SIDM collisionality by considering an ordinary fluid without conductivity, i.e. the limit of mean free path ${\lambda}_{mfp}{\to} 0$. The intermediate regime where $Q {\~} [18.6 - 231]Q_{th}$ or ${\sigma}{\~} [1.2{\times}10^4 - 2.7{\times}10^4] cm^2g{-1}$, for which we find flat-density cores comparable to those of the low-Q solutions preferred to make SIDM halos match halo observations, has not previously been identified. Further study of this regime is warranted.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.317-326
• /
• 2009

Recently, there have been many research efforts proposed on trajectory information. Most of them mainly focus their attention on those objects moving in Euclidean space. Many real-world applications such as telematics, however, deal with objects that move only over road networks, which are highly restricted for movement. Thus, the existing methods targeting Euclidean space cannot be directly applied to the road network space. This paper proposes a new clustering scheme for a large volume of trajectory information of objects moving over road networks. To the end, we first define a trajectory on a road network as a sequence of road segments a moving object has passed by. Next, we propose a similarity measurement scheme that judges the degree of similarity by considering the total length of matched road segments. Based on such similarity measurement, we propose a new clustering algorithm for trajectories by modifying and adjusting the FastMap and hierarchical clustering schemes. To evaluate the performance of the proposed clustering scheme, we also develop a trajectory generator considering the observation that most objects tend to move from the starting point to the destination point along their shortest path, and perform a variety of experiments using the trajectories thus generated. The performance result shows that our scheme has the accuracy of over 95% in comparison with that judged by human beings.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.727-740
• /
• 2006

Schema matching is important as a prerequisite to the transformation of XML documents. This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: preliminary matching relationships between leaf nodes in the two XML schemas are computed based on proposed ontology and leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method is superior to previous works, resulting in a precision of 97% and a recall of 83 % on the average. Furthermore, the dynamic ontology increased by 9 percent overall.