• 한국디지털정책학회:학술대회논문집
• /
• 한국디지털정책학회 2003년도 창립학술대회
• /
• pp.263-273
• /
• 2003

Recognizing the importance of the database query optimization design methods, we implemented mobile database with mobile program (J2ME) which is a useful database procedures. In doing so, we emphasize the logical query optimization which brings mobile database to performance improvement. The research implies that the suggested mobile program (J2ME) would contribute to the realization of the efficient mobile database as the related technology develops in the future.

• 한국CDE학회논문집
• /
• 제3권3호
• /
• pp.177-182
• /
• 1998

The computer related techniques have been developed rapidly in the field of metal removal industry. The electronic catalog for mechanical elements is one of such developments realized in recent years. As the emergence of the electronic catalogs in the 90s, it breaks the restriction of the traditional catalog and becomes a helpful and efficient tool in the field. In this paper, we develop an electronic catalog for the cutting tools of the Korea Tungsten Co. Ltd. The catalog consists of three parts: a preprocessor for tool selection, a database for tool, and a postprocessor for search result. A preprocessor for tool selection is developed under a user-friendly consideration. A database for tool consists of milling, drilling, and reaming tools with a list of cutters, inserts, and components. A postprocessor for search result consists of weight, dimension. drawing, product order number etc. of the tools. It also suggests the optimized cutting condition of the selected tool using a neural network technique which is done by an independent research group.

• Asia pacific journal of information systems
• /
• 제8권1호
• /
• pp.43-64
• /
• 1998

Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention to the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy(KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance, On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, four types of vague queries are discussed, including approximate selection, approximate join, conceptual selection, and conceptual join. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database application systems.

• ETRI Journal
• /
• 제39권1호
• /
• pp.97-107
• /
• 2017

A fast and accurate building-level visual place recognition method built on an image-retrieval scheme using street-view images is proposed. Reference images generated from street-view images usually depict multiple buildings and confusing regions, such as roads, sky, and vehicles, which degrades retrieval accuracy and causes matching ambiguity. The proposed practical database refinement method uses informative reference image and keypoint selection. For database refinement, the method uses a spatial layout of the buildings in the reference image, specifically a building-identification mask image, which is obtained from a prebuilt three-dimensional model of the site. A global-positioning-system-aware retrieval structure is incorporated in it. To evaluate the method, we constructed a dataset over an area of $0.26km^2$. It was comprised of 38,700 reference images and corresponding building-identification mask images. The proposed method removed 25% of the database images using informative reference image selection. It achieved 85.6% recall of the top five candidates in 1.25 s of full processing. The method thus achieved high accuracy at a low computational complexity.

• The Journal of the Acoustical Society of Korea
• /
• 제20권4E호
• /
• pp.31-38
• /
• 2001

A large-scale synthesis database for a unit selection based synthesis method usually retains redundant synthesis unit instances, which are useless to the synthetic speech quality. In this paper, to eliminate those instances from the synthesis database, we proposed a new pruning method called weighted vector quantization (WVQ). The WVQ reflects relative importance of each synthesis unit instance when clustering the similar instances using vector quantization (VQ) technique. The proposed method was compared with two conventional pruning methods through the objective and subjective evaluations of the synthetic speech quality: one to simply limit maximum number of instance, and the other based on normal VQ-based clustering. The proposed method showed the best performance under 50% reduction rates. Over 50% of reduction rates, the synthetic speech quality is not seriously but perceptibly degraded. Using the proposed method, the synthesis database can be efficiently reduced without serious degradation of the synthetic speech quality.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.93-96
• /
• 2000

In this paper, we propose an efficient database system for video retrieval. Using the color spaces, it shows results of user's request. Each color space used following user's selection. We suggest adaptive three color systems for database. Experimental results based on a video database containing 331 shots are included.

• 정보기술과데이타베이스저널
• /
• 제7권2호
• /
• pp.47-59
• /
• 2000

In this paper, we analyze the applicability of a general optimization algorithm to a database optimization problem. The index selection problem Is the problem to choose a set of indexes for a database in a way that the cost to process queries in the given workload is minimized subject to a given storage space restriction for storing indexes. The problem is well known in database research fields, and many optimization and/or heuristic algorithms have been proposed. Our work differs from previous research in that we formalize the problem in the form of non-linear Integer Programming model, and investigate the feasibility and applicability of a general purpose optimization algorithm, called OPBDP, through experiments. We implemented algorithms to generate workload data sets and problem instances for the experiment. The OPBDP algorithm, which is a non-linear 0-1 Integer Programming problem solver based on Davis-Putnam method, worked generally well for our problem formulation. The experiment result showed various performance characteristics depending on the types of decision variables, variable navigation methods and ocher algorithm parameters, and indicates the need of further study on the exploitation of the general purpose optimization techniques for the optimization problems in database area.

• 정보관리학회지
• /
• 제27권3호
• /
• pp.265-281
• /
• 2010

본 연구에서 제안하는 기법은 최대 개념강도 인지기법(Maximal Concept-Strength Recognition Method: MCR)이다. 신규 데이터베이스가 입수되어 자동분류가 필요한 경우에, 기 구축된 여러 데이터 베이스 중에서 최적의 데이터베이스가 어떤 것인지 알 수 없는 상태에서 MCR 기법은 가장 유사한 데이터베이스를 선택할 수 있는 방법을 제공한다. 실험을 위해 서로 다른 4개의 학술 데이터베이스 환경을 구성하고 MCR 기법을 이용하여 최고의 성능값을 측정하였다. 실험 결과, MCR을 이용하여 최적의 데이터베이스를 정확히 선택할 수 있었으며 MCR을 이용한 자동분류 정확률도 최고치에 근접하는 결과를 보여주었다.

• 한국지반공학회논문집
• /
• 제18권6호
• /
• pp.43-59
• /
• 2002

본 연구에서는 국내에서 이용되고 있는 지하구조물 누수에 대한 지수공법과 재료에 대하여 이론적 고찰 및 실험을 실시하고 현장적용 자료의 수집을 통한 통계적인 분석.고찰을 통하여 지하구조물의 누수유형별 지수공법 선정을 위한 시스템을 구축하고자 하였다. 선정시스템의 구성은 데이터베이스 5개의 대구분과 73개 항목의 세분화된 체크리스트를 이용하여 다양한 현장 조건을 고려한 설문조사를 토대로 4개로 대분된 위계성 등급에 따른 26개의 주요 선정인자를 설정하였다. 지수공법 데이터베이스는 국내에 적용실적이 많은 10개의 공법으로 이루어졌다. 설계조건 데이터베이스에서는 10개의 지수공법에 대한 적용범위와 설계조건에 대한 자료를 제공한다. 연구결과에 의한 시스템은 선정인자 데이터베이스와 지수공법 데이터베이스 그리고 설계조건 데이터베이스에 의한 관계형 데이터베이스로 구성되었다. 본 선정시스템의 현장적용 결과, 설계단계에 적용할 경우 지수공법 선정을 위한 시간 단축과 지수공법 선정시의 오류를 감소시킬 수 있었다. 또한 시공단계에 적용할 경우에는 설계단계에서 선정된 지수공법을 현장조건에 따라 재확인함으로써 지수공법의 타당성 분석을 할 수 있고 향후 유지관리에도 활용될 수 있을 것으로 기대된다.

• Korean Journal of Geomatics
• /
• 제1권1호
• /
• pp.95-101
• /
• 2001

In a route plan, the route selection is a complicated problem to consider the spatial distribution and influence through overall related data and objective analysis on the social, economic and technical condition. The developed system in this study was compared and estimated by deciding a practical section for its validity and efficiency. Using Geographic Information System (GIS), the various information required for route selections in database was constructed, the characteristics of subject area by executing three-dimensional terrain analysis was grasped effectively, and the control point through buffering, overlay and location operation was extracted. An optimum route was selected by calculating the sum of alternatives to the sub-criteria weight, and from this result, there is a difference between real route and proposed route according to the prioritization of decision criteria based on the importance. This research could be constructed and applied geospatial information to the reasonable route plan and an optimum route selection efficiently using GIS. Therefore, the applications are presented by applying Analytic Hierarchy Process (AHP) to the decision-making of information needed in route selection.