• Korean Journal of Computational Design and Engineering
• /
• v.16 no.1
• /
• pp.21-30
• /
• 2011

Similarity assessment of a CAD model is one of important issues from the aspect of model re-using. In real practice, many new mechanical parts are designed by modifying existing ones. The reuse of part enables to save design time and efforts for the designers. Design time would be further reduced if there were an efficient way to search for existing similar designs. This paper proposes an efficient algorithm of similarity assessment for mechanical part model with design history embedded within the CAD model. Since it is possible to retrieve the design history and detailed-feature information using CAD API, we can obtain an accurate and reliable assessment result. For our purpose, our assessment algorithm can be divided by two: (1) we select suitable parts by comparing MSG (Model Signature Graph) extracted from a base feature of the required model; (2) detailed-features' similarities are assessed with their own attributes and reference structures. In addition, we also propose a indexing method for managing a model database in the last part of this article.

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.220-230
• /
• 2013

In recent years, progress in hardware technology has resulted in the possibility of monitoring many events in real time. The volume of incoming data may be so large, that monitoring all individual data might be intractable. Revisiting any particular record can also be impossible in this environment. Therefore, many database schemes, such as aggregation, join, frequent pattern mining, and indexing, become more challenging in this context. This paper surveys the previous efforts to resolve these issues in processing data streams. The emphasis is on specifying and processing sliding window queries, which are supported in many stream processing engines. We also review the related work on stream query processing, including synopsis structures, plan sharing, operator scheduling, load shedding, and disorder control.

• International Journal of Contents
• /
• v.11 no.1
• /
• pp.69-72
• /
• 2015

Generally, existing parallel main-memory spatial index structures to avoid the trade-off between query freshness and CPU cost uses light-weight locking techniques. However, still, the lock based methods have some limits such as thrashing which is a well-known problem in lock based methods. In this paper, we propose a distributed index structure for moving objects exploiting the parallelism in multiple machines. The proposed index is a lock free multi-version concurrency technique based on the D-Stream model of Spark Stream. The proposed method exploits the multiversion nature of D-Stream of Spark Streaming.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.134-136
• /
• 2000

본 논문에서는 고차원의 특징 벡터 공간에서의 객체에 대한 효율적인 검색을 지원하는 셀기반 시그니쳐 트리 색인 구조(CS-트리, CI-트리)를 제안한다. 특징 벡터 공간을 셀로써 분할하고 특징 벡터는 셀의 시그니쳐로 표현되며 트리에 저장된다. 특징 벡터 대신 시그니쳐를 사용하여 트리의 깊이가 낮아짐으로서 검색을 효율적으로 수행할 수 있다. 또한 셀에 적합한 새로운 가지치기 거리를 이용한 유사성 검색 알고리즘으로 수행할 수 있다. 또한 셀에 적합한 새로운 가지치기 거리를 유사성 검색 알고리즘을 제시한다. 마지막으로 우수한 고차원 색인 기법으로 알려져 있는 X-트리와 성능 비교를 수행하여, 성능비교 결과 본 논문에서 제안하는 CS-트리와 CI-트리가 검색 시간 측면에서 최대 30%의 검색 성능이 개선됨을 보인다.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.641-649
• /
• 2004

The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.51-54
• /
• 2005

This paper proposes an index structure which is used to process X-Path on S-XML data. There are many previous index structures based on tree structure for X-Path processing. Because of general tree index's top-down query fashion, the unnecessary node traversal makes heavy access and decreases the query processing performance. And both of the two query types for X-Path called single-path query and branching query need to be supported in proposed index structure. This method uses a combination of path summary and the node indexing. First, it manages hashing on hierarchy elements which are presented in tag in S-XML. Second, array blocks named path summary array is created in each node of hashing to store the path information. The X-Path processing finds the tag element using hashing and checks array blocks in each node to determine the path of query's result. Based on this structure, it supports both single-path query and branching path query and improves the X-Path processing performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.49-51
• /
• 2006

센서태그(Sensor Tag)는 기존의 RFID 태그의 특징을 그대로 유지하면서 사물의 온도 습도와 같은 정보를 추가로 획득하여 냉장 제품 등의 관리에 유용하게 사용 할 수 있는 태그이다. 이러한 센서태그에 의해 획득된 정보, 즉 센싱 데이터는 리더의 인식 영역 안에서만 획득할 수 있으며 센싱 데이터가 변화할 때마다 보고하거나 또는 주기적으로 보고를 하는 특징이 있다. 기존의 RFID 환경에서는 센싱 데이터를 단순히 속성 정보로 관리하므로 영역질의 등 센서태그 객체에 대한 질의를 처리하기 위해서 많은 연산이 필요하며 복합 질의 시 시스템 성능이 급격하게 저하된다. 본 논문에서는 센서태그 객체의 특성을 고려한 통합 데이터 모델을 제시하고 질의를 효율적으로 처리하기 위한 색인 기법을 제안한다. 그리고 동일 리더 인식영역 내의 센싱 데이터가 특정 값으로 집중되는 특성을 고려하여 데이터 삽입 시 강제 합병 기법을 이용하여 노드의 중첩으로 인해 검색 성능을 떨어뜨리는 문제를 해결한다.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.31-37
• /
• 2015

Symmetry is easily found in animals and plants as well as in artificial structures. It is useful not only for human cognitive process but also for image understanding by computer. Application areas include face detection and recognition, indexing of image database, image segmentation and detection, and analysis of medical images. The method used in this paper extracts edges, and the perpendicular bisector of any pair of selected edge points is considered to be a candidate axis of symmetry. The coefficients of the perpendicular bisectors are accumulated in the coefficient space. Axis of symmetry is determined to be the line for which the histogram has maximum value. This method shows good results, but the usefulness of the method is restricted because the amount of computation increases proportional to the square of the number of edges. In this paper, an acceleration method is proposed which performs $2^{2n}$ times faster than the original one. Experiment on 20 test images shows that the proposed method using level-3 image segmentation performs 63.9 times faster than the original method.

• Journal of Advanced Marine Engineering and Technology
• /
• v.31 no.4
• /
• pp.377-384
• /
• 2007

A backscatter Kikuchi diffraction attachment to an SEM enables the convenient investigation of grain orientations on bulk or micro surface. Their relation to micro structural features gives insight into many aspects of anisotropic materials properties. In micro area such as Micro Electro Mechanical Systems(MEMS) devices is required in order to improve understanding of how they may be expected to perform upon the micro scale. Electro Back Scatter Diffraction (EBSD) helps us to find uniform area as MEMS material. The ${\gamma}-TiAl$ has two different lamellar structures ${\gamma}/{\alpha}2-Ti_3Al$ phase which have shows $\{111\}{\gamma}//\{0001\}{\alpha}2$ plane indexing. The micro size testing specimen was successfully made by this structural relation. Interlamellar structure specimen averagely show $20{\sim}25%$ lower fracture toughness value compare with translamellar specimens Moreover micro fracture surface and micro crack progress were observed.