• International Journal of Quality Innovation
• /
• v.2 no.2
• /
• pp.93-100
• /
• 2001

This paper illustrates a prototyping framework of the documentation-standards retrieval system via the data mining approach for enhancing software development quality. We first present an approach for designing a retrieval algorithm based on data mining, with the three basic technologies of machine learning, statistics and database management, applied to this system to speed up the searching time and increase the fitness. This approach derives from the observation that data mining can discover unsuspected relationships among elements in large databases. This observation suggests that data mining can be used to elicit new knowledge about the design of a subject system and that it can be applied to large legacy systems for efficiency. Finally, software development quality will be improved at the same time when the project managers retrieving for the documentation standards.

• Journal of Welding and Joining
• /
• v.12 no.3
• /
• pp.71-81
• /
• 1994

Laser cutting is experiencing a rising worldwide acceptance in the industry. Expert systems are necessary for the systematic arrangement and searching of experimental data existing in journal papers, job handbooks, etc.. This paper proposes an expert system for the selection of the appropriate laser cutting variables from the available database. Optimum cutting conditions according to the given cutting velocity were searched and qualitative comments which are difficult to be used as database variables were shown at each velocity using the binary and fuzzy inference. These comments could be informative to unskilled operators of the laser cutting process. Typical cutting conditions of the mild steel and stainless steel were included and the working range and quality variations were displayed graphically. The proposed algorithm was implemented in an IBM compatible personal computer as an expert system for CO$_{2}$ laser cutting to derive the optimum cutting conditions by using the turbo prolog.

• The Journal of Korean Medical History
• /
• v.25 no.1
• /
• pp.5-10
• /
• 2012

The aim of this study is to create a catalogue of amnesia synonyms in Traditional Korean Medicine for database utilization. A two-staged literature search was carried out. First, two databases(China National Knowledge Infrastructure:CNKI, Oriental Medicine Advanced Searching Integrated System:OASIS) were searched for eligible articles, and a set of candidate words was identified from the articles. Second, the candidate words were searched in 30 medical classics to check the frequency of use. As a result, 9 candidate words including 喜忘(huimang), 善忘(seonmang), 多忘(damang), 好忘(homang), 健忘(geonmang), 遂忘(sumang), 遺忘(yumang), 忘事(mangsa), and 易忘(imang) were identified from the 10 eligible articles. Among the 9 candidate words, 健忘(geonmang) was a descriptor and 7 other words including 喜忘(huimang), 善忘(seonmang), 多忘(damang), 好忘(homang), 遂忘(sumang), 遺忘(yumang), 忘事(mangsa) were non-descriptors. 易忘(imang) was not an adequate synonym for amnesia.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.32-45
• /
• 1998

A partitioned signature file is an enhancement of the signature file that divides all the signatures into blocks in such a way that each block contains the signatures with the same key. Its directory storesall the keys as meta information for avoiding unnecessary block accesses by examming them first before the acture searching of the blocks.. Efficient directory management is very important in large databasse environments since ist size gets larger proportionally to that of the database. In this paper, we first point out the problems in the directory management methods of the previous partitioned signature files, and then present a new one solving them. OUr method offers good features in the followint three aspects: (1) suitability for large database environments, (2) adaptability to dynamic situations, and (3) storage overhead for the directory. Moreover, we can seamlessly integrate it as a subcomponent into previously-developed general-purpose storage engines. These features show that our method is applicableto signature-based access structures for the content-based retrieval in various multimedia applications such as hypermedia systems, digital library systems, multimedia document systems, multimedia mailing systems, and so on.

• Proceedings of the Korea Database Society Conference
• /
• 1998.09a
• /
• pp.383-394
• /
• 1998

This article is an overview of the digital library project, indicating what roles Korea's diverse digital collections may play. Our digital library prototype has simple architecture, consisting of digital repositories, filters, indexing and searching, and clients. Digital repositories include various types of materials and databases. The role of filters is to recognize a format of a document collection and mark the structural components of each of its documents, We are using a database management system (ORACLE and ConText) supporting user-defined functions and access methods that allows us to easily incorporate new object analysis, structuring, and indexing technology into a repository.

• Genomics & Informatics
• /
• v.20 no.3
• /
• pp.36.1-36.6
• /
• 2022

BLAST, a basic bioinformatics tool for searching local sequence similarity, has been one of the most widely used bioinformatics programs since its introduction in 1990. Users generally use the web-based NCBI-BLAST program for BLAST analysis. However, users with large sequence data are often faced with a problem of upload size limitation while using the web-based BLAST program. This proves inconvenient as scientists often want to run BLAST on their own data, such as transcriptome or whole genome sequences. To overcome this issue, we developed NBLAST, a graphical user interface-based BLAST program that employs a two-way system, allowing the use of input sequences either as "query" or "target" in the BLAST analysis. NBLAST is also equipped with a dot plot viewer, thus allowing researchers to create custom database for BLAST and run a dot plot similarity analysis within a single program. It is available to access to the NBLAST with http://nbitglobal.com/nblast.

• Journal of Preventive Medicine and Public Health
• /
• v.36 no.1
• /
• pp.39-46
• /
• 2003

Objectives : To investigate the availability and demand for overall cancer-related information, and to establish a basic plan for the construction of a cancer database and information system based on the research results from Korea. Methods : Postal and telephone surveys were carried out, between August 2001 and November 2001, of 323 affiliated faculty professors from medical universities and colleges in Korea. The data were analyzed with descriptive statistical methods, with regard to the present status and demand for health and cancer-related information. Results : Most (over 80%) subjects studied utilized the health-related information provided on Internet website from foreign countries, such as Medline, but similar comprehensive information system lacked in Korea. The construction of a cancer-related database of domestic research results was revealed to be in a great demand. Information on registration and statistics (52.8%), study results (48.5%) and study resources (37.4%) were the major ingredients required in the database. In constructing a database of the cancer-related research results, a full-text service, continuous updating of data, and the development of standardized user-friendly searching tool were regarded as the necessary components. The formulation of an information sharing system, regarding cancer-related clinical trials, was investigated as being quite feasible. Conclusion : This study demonstrated the great importance of cancer information systems, and much demand for an available cancer-related database based on Korean research results.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.1 no.1
• /
• pp.52-69
• /
• 1998

Using GIS, this study constructs and evaluates a bank marketing system. The study collects a marketing GIS database case from the Daegu Bank, which is one of the leading local banks in Korea. The database includes spatial data such as digital road map, internal and external attribute data which are combined for the construction of bank marketing database. Based on these data, the study developed an interface which enables searching and analysing functions of bank GIS marketing system. For the development of the interface, this study examined the basic concepts of area marketing and its development and utilized Map/Info as a basic GIS software package and Delphi as computer language. Finally, the study makes a comprehensive evaluation of various problems of spatial and attribute data which occurred in the process of constructing the bank marketing database.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.371-381
• /
• 2011

Recently, there are some social issues that personal sensitive data in database were let out. The best method to protect these personal sensitive data is used by the database encryption method. But the encrypting database makes the query difficult. So, there are a lot of study to protect the database and increase the query efficiency as well. In this paper, we analysed recent research trend to protect the sensitive data and propose the combined method using buckets and the bloom filter for the medical database with range property. Compared to bucket index model, the proposed method can increase bucket index value and protect data distribution exposure. We can estimate that this proposed method can improve searching time and efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1328-1342
• /
• 2013

Searchable encryption is a cryptographic protocol for searching a document in encrypted databases. A simple searchable encryption protocol, which is capable of using only one keyword at one time, is very limited and cannot satisfy demands of various applications. Thus, designing a searchable encryption with useful additional functions, for example, conjunctive keyword search, is one of the most important goals. There have been many attempts to construct a searchable encryption with conjunctive keyword search. However, most of the previously proposed protocols are based on public-key cryptosystems which require a large amount of computational cost. Moreover, the amount of computation in search procedure depends on the number of documents stored in the database. These previously proposed protocols are not suitable for extremely large data sets. In this paper, we propose a new searchable encryption protocol with a conjunctive keyword search based on a linked tree structure instead of public-key based techniques. The protocol requires a remarkably small computational cost, particularly when applied to extremely large databases. Actually, the amount of computation in search procedure depends on the number of documents matched to the query, instead of the size of the entire database.