• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.235-238
• /
• 2000

This article presents an adaptive decision tree algorithm for dynamically reasoning machine failure cause out of real-time, large-scale machine status database. On the basis of experiment using semiconductor etching machine, it has been verified that our model outperforms previously proposed decision tree models.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.338-338
• /
• 2000

This paper proposes a modified TD-PSOLA algorithm for Korean speech synthesis. A WSS (Weighted score search) algorithm is proposed for pitch detection and speech synthesis engine is designed using 46 phones database.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.5
• /
• pp.117-126
• /
• 2016

Recently, increasing utilization of Big Data or Social Network Service involves the increases in demand for NoSQL Database that overcomes the limitations of existing relational database. A forensic examination of Relational Database has steadily researched in terms of Digital Forensics. In contrast, the forensic examination of NoSQL Database is rarely studied. In this paper, We introduce Redis (which is) based on Key-Value Store NoSQL Database, and research the collection and analysis of forensic artifacts then propose recovery method of deleted data. Also we developed a recovery tool, it will be verified our recovery algorithm.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.16 no.1
• /
• pp.52-63
• /
• 2008

The side collision reconstruction algorithm is developed using three dimensional car crash analysis. Medium size passenger car is modeled for finite element analysis. Total 24 side collision configurations, four different speed and six different angle, are set up for making side collision database. Deformation index and degree index are built up for each collision case. Deformation index is a kind of deformation estimate averaging displacement of side door of crashed car from finite element analysis result. Angle index is constructed measuring deformed angle of crashing car. There are two kinds of angle index, one is measured at driver's side and the other is measured at passenger's side. Also a collision analysis information in side of cars is used for giving a basis for scientific and practical reason in a reconstruction of the car accident. The analysis program, LS-DYNA3D is utilized for finite element analysis program for a collision analysis. Those database are used for side collision reconstruction. Side collision reconstruction algorithm is developed, and applied to find the collision conditions before the accident occurs. Three example collision cases are tried to check the effectiveness of the algorithm. Deformation index and angle index is extracted for the case from the analysis result. Deformation index is compared to the established database, and estimated collision speed and angle are introduced by interpolation function. Angle index is used to select a specific collision condition from the several available conditions. The collision condition found by reconstruction algorithm shows good match with original condition within 10% error for speed and angle. As a result, the calculation from the reconstruction of the situation is reproducing the situation well. The performance in this study can be used in many ways for practical field using deformation index and degree index. Other different collision situations may be set up for extending the scope of this study in the future.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.1
• /
• pp.15-28
• /
• 1999

In Multilevel Secure Database Management System(MLS/DBMS), we assume that system has a security clearance level for each user and a classification level for each data item in system and the objective of these systems is to protect secure information from unauthorized user. Many algorithms which have been researched have focus on removing covert channel by modifying conventional lock-based algorithm or timestamp-based algorithm. but there is high-level starvation problem that high level transaction is aborted by low level transaction repeatedly. In order to solve this problem, we propose an algorithm to reduce high-level starvation using dynamic adjustment of serialization order, which is basically using orange lock. Because our algorithm is based on a single version unlike conventional secure algorithms which are performed on multiversion, it can get high degree of concurrency control. we also show that it guarantees the serializability of concurrent execution, and satisfies secure properties of MLS/DBMS.

• The Journal of Korean Medical History
• /
• v.35 no.2
• /
• pp.45-67
• /
• 2022

Currently, there are about 20,000 or so known ancient medical texts from the East Asian medical traditions. Although the most famous texts are widely known, many texts still exist only as original manuscripts. We are interested exploring these texts to uncover the potential benefits of their therapeutic knowledge. This study aims to develop a database program that automatically converts the treatment skills described in the text version into a more structured version. In the previous study, our team analyzed patterns in the way that treatment skills are described and then tried to design a database program algorithm that identified every meaningful keyword used to describe treatment skills and put that word in the right cell of a structured table. This study continues the development of this program. East Asian medical herbal treatment information is broken down into 4 elements: the first one is the name or title of treatment skills, and the second is the symptoms to which the treatment is applied, the third is ingredients used, the fourth is how information is processed and the indications taken. This study presents the algorithm's principles on how to analyze and structure the fourth element, the processing of information and taking of indications, which is described in a form of ancient natural language.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2015.11a
• /
• pp.64-65
• /
• 2015

As construction projects have increased in size and height recently, lifting accounts for increasingly greater portion and tower cranes are used more frequently. At present, the selection and arrangement of tower crane are depend on the experience of experts. However, since the number of experts is fairly limited and a database for tower cranes regarding lifting capacity, operation properties, rent, etc has not been widely employed, tower cranes are often not effectively selected and arranged which can cause cost overruns and delays in the lifting work. To address such issues, this study attempts to perform a basic study for development of automatic arrangement algorithm of tower crane using drawing recognition. If relevant database is established and the algorithm suggested in this study is refined more systematically, even beginning level engineers will be able to plan tower crane arrangement in a way comparable to experienced experts.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.366-373
• /
• 2009

In this paper, we propose a similarity search algorithm for image databases. One of the central problems regarding content-based image retrieval (CBIR) is the semantic gap between the low-level features computed automatically from images and the human interpretation of image content. Many search algorithms used in CBIR have used the Minkowski metric (or $L_p$-norm) to measure similarity between image pairs. However those functions cannot adequately capture the aspects of the characteristics of the human visual system as well as the nonlinear relationships in contextual information. Our new search algorithm tackles this problem by employing new similarity measures and ranking strategies that reflect the nonlinearity of human perception and contextual information. Our search algorithm yields superior experimental results on a real handwritten digit image database and demonstrates its effectiveness.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1323-1334
• /
• 2011

This paper suggests the border based HSFI algorithm to hide sensitive frequent itemsets. Node formation of FP-Tree which is different from the previous one uses the border to minimize the impacts of nonsensitive frequent itemsets in hiding process, including the organization of sensitive and border information, and all transaction as well. As a result of applying HSFI algorithms, it is possible to be the example transaction database, by significantly reducing the lost items, it turns out that HSFI algorithm is more effective than the existing algorithm for maintaining the quality of more improved database.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.51-58
• /
• 2007

The shared-nothing multiprocessor architecture has advantages in scalability, this architecture has been adopted in many multiprocessor database system. But, if the data are not uniformly distributed across the processors, load will be unbalanced. Therefore, the whole system performance will deteriorate. This is the data skew problem, which usually occurs in processing parallel hash join. Balancing the load before performing join will resolve this problem efficiently and the whole system performance can be improved. In this paper, we will present an algorithm using merit of very large memory to reduce disk access overhead in performing load balancing and to efficiently solve the data skew problem. Also, we will present analytical model of our new algorithm and present the result of some performance study we made comparing our algorithm with the other algorithms in handling data skew.