• Journal of Information Processing Systems
• /
• 제9권2호
• /
• pp.315-332
• /
• 2013

This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.

• 전자공학회논문지A
• /
• 제33A권5호
• /
• pp.203-211
• /
• 1996

This paper describes CAD tools for the construction of image database in IC chip analysis CAD system. For IC chip analysis by high-resolution microscopy, the image database is essential to manage more than several thousand images. But manual database construction is error-prone and time-consuming. In order to solve this problem, we develop a set of CAD toos that include image grabber to capture chip images, image editor to make the whole chip image database from the grabbed images, and image divider to reconstruct the database that consists of evenly overlapped images for efficient region search. we also develop an interactive pattern matching method for user-friendly image editing, and a heuristic region search method for fast image division. The tools are developed with a high-performance graphic hardware with JPEG image comparession chip to process the huge color image data. The tools are under the field test and experimental resutls show that the database construction time can be redcued in 1/3 compared to manual database construction.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2007년도 동계학술대회
• /
• pp.116-119
• /
• 2007

In a keyword search scheme a user stores encrypted data on an untrusted server and gives a database manager a capability for a keyword which enables a database manager to find encrypted data containing the keyword without revealing the keyword to the database manager. Conjunctive keyword search scheme enables a user to obtain data containing all of several keywords through only one query. One of the security requirements of conjunctive keyword search schemes is that a malicious adversary should not be able to generate new valid capabilities from the observed capabilities. In U:5 paper we show that conjunctive keyword search schemes are not secure. In particular, given two capabilities corresponding two sets of keywords, an adversary is able to generate a new capability corresponding to the dierence set of two keywords sets.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2007년도 정기 학술대회 논문집
• /
• pp.583-588
• /
• 2007

For the purpose of optimum design of RC frame structures. pre-determined section database of column and beam are constructed and arranged in order of the resisting capacity. Then, regression equations representing the relation between section number and resisting capacity are derived. In advance. effective optimization algorithms which search optimized solution quickly using direct search method from these database are proposed. Moreover. the investigation for the applicability and effectiveness of the introduced design procedure is conducted through correlation study for example structures.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권4호
• /
• pp.260-263
• /
• 2008

In this paper we propose Personal Information Management System for Library Database. It manages personal search pattern for the given user and provide specific book list for library book search system. With the proposed system, the conventional overlap searching time will be decreased with personalized information and search history. This system manages the individual data according to personal searching pattern, sequence and usability. Therefore, the user can locate necessary book information more accurately with their distinct interest and search history.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1992년도 하계학술대회 논문집 A
• /
• pp.172-175
• /
• 1992

This paper proposes the methods to construct the tree-structured database and analyze the distribution system network. In order to cope with an extensive amount of data and the frequent breaker switching operations in distribution systems, the database for system configuration is constructed using binary trees. Once the tree-structured database has been built, the system tracing of distribution network can be rapidly performed. This remarkably enhances the efficiency of data search and easily adapts to system changes due to switching operations. The computation method of fast power flow using tree search strategies is presented. The methods in the paper may be available in the field of distribution system operation.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 춘계학술대회 논문집
• /
• pp.670-674
• /
• 1996

In automated search of a design database to support mechanical design, it is necessaryto recognize a shape pattern which represents a design object. This paper introduces the concept of a surface relation graph (SRG) for recognizing shape patterns from a 3D boundary representation scheme of a solid model(a B-rep model). In SRG, the nodes and arcs correspond to the faces and edges shared by two adjacent faces, respectively. An attribute assigned to an arc is given by an integer which discriminates the relationship between two adjacent faces. The + sign of the integer represents the geometric convexity of the solid, and the -sign the concivity at the shared edge. The input shape is recognized by comparison with the predefined features which are subgraphs of the SRG. A hierarchyof the database for upporting the design is presented. A search for the design database is also discussed. The usefulness of this method is illustrated by some application results.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• 한국정보과학회논문지:데이타베이스
• /
• 제41권4호
• /
• pp.199-208
• /
• 2014

본 논문에서는 스캔된 만화의 콘텐츠 특성을 고려한 식별 및 특징 검색 시스템을 제안하였다. 스캔 만화의 특징점을 생성하기 위해서 계층적 대칭 핑거프린팅 방법을 활용하였다. 제안하는 핑거프린트 식별 및 검색 시스템은 웹하드와 같은 온라인 서비스 제공자들이 대량의 스캔만화에 대하여 즉각적인 식별 결과를 얻을 수 있도록 설계되었다. 실험에서는 회전, 이동 등의 이미지 변형에 대해서 핑거프린트의 식별 강인성에 대하여 분석하였다. 또한 특징점 데이터베이스에서의 빠른 매칭을 위한 데이터베이스 구조를 제안하였고, 전역 검색 및 최대중요특징 검색과 같은 기존의 다른 검색방법과 성능을 비교하였다.

• 천문학논총
• /
• 제21권1호
• /
• pp.1-9
• /
• 2006

An archiving system designed to enable documenting database of astronomical images, with functions of search and download, is being developed by Korean Astronomical Data Center(KADC) of Korea Astronomy and Space Science Institute(KASI). The system consists of three PCs for web server, database server, and system management server. The search program for the web environment is operated in the web server. In the management server, several utility program we developed are installed: input program for the database, program for transfer from fits to jpg files, program for data recovery and management, and programs for statistics and connect management. The collected data would be sorted out by the system manager to input into the database. The online input is possible in an observatory where the data is produced. We applied the content management system(CMS) module for the database management. On the basic of CMS module, we set up a management system for the whole life cycle of metadata from creation and collection to storage and deletion of the data. For the search function, we employed a technique to extract indices from the metadata. In addition, MySQL is adopted for DBMS. We currently display about 2,700 and 25,000 photographs for astronomical phenomena and astronomical objects on the data, respectively.