• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.56-68
• /
• 2006

For tracing tag locations, the trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that a tag stays in a reader is missing from the trajectory represented only as a point, it is impossible to find the tag that remains in a reader. To solve this problem we propose the data model in which trajectories are defined as time-parameterized intervals and new index scheme called the Time Parameterized Interval R-tree. We also propose new insert and split algorithms that reduce the area of nodes to enable efficient query processing. We evaluate the performance of the proposed index scheme and compare it with previous indexes on various datasets.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.665-676
• /
• 2001

The most expensive spatial operation in patial database in a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisgying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved the response time is not tolerable because of not meeting the requiremetns of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. in spatial database the fixed grids which consist of the regularly partitioned cells can be employed the previous works on the spatial joins have not studied the parallel processing of spatial joins using fixed grids. This paper has presented an analytical cost model that estimates the comparative performance of a parallel spatial join algorithm based on the fixed grids in terms of the number of MBR comparisons. disk accesses, and message passing, Several experiments on the synthetic and real datasets show that the proposed analytical model is very accurate. This most model is also expected to used for implementing a very important DBMS component, Called the query processing optimizer.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.595-612
• /
• 2009

The early test can greatly reduce the cost of error correction for system development. It is still important in SOA based service system. However, the existing methods of test case generation for SOA have limitations which are restricted to only web service using XML. Therefore, this paper proposes a method of test case generation using BPMN-based model reduction for service system. For minimizing test effort, an existing BPM is transformed into S-BPM which is composed of basic elements of workflow. The process of test case generation starts with making S-BPM concerning the target service system, and transforms the target service system into directed graph. And then, we generate several service scenarios applying scenario searching algorithm and extract message moving information. Applying this method, we can obtain effective test cases which are even unlimited to web service. This result is the generation of test case which is reflected in the business-driven property of SOA.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.91-104
• /
• 2007

Ontology matching technique is one of the most important techniques in the Semantic Web as well as in other areas. Ontology matching algorithm takes two ontologies as input, and finds out the matching relations between the two ontologies by using some parameters in the matching process. Ontology matching is very useful in various areas such as the integration of large-scale ontologies, the implementation of intelligent unified search, and the share of domain knowledge for various applications. In general cases, the performance of ontology matching is estimated by measuring the matching results such as precision and recall regardless of the requirements that came from the matching environment. Therefore, most research focuses on controlling parameters for the optimization of precision and recall separately. In this paper, we focused on the harmony of precision and recall rather than independent performance of each. The purpose of this paper is to propose a methodology that determines parameters for the desired ratio of precision and recall that is appropriate for the requirements of the matching environment.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.12
• /
• pp.477-484
• /
• 2018

Due to the advancement of computer and information technologies, numerous papers have been published. As new research fields continue to be created, users have a lot of trouble finding and categorizing their interesting papers. In order to alleviate users' this difficulty, this paper presents a method of grouping similar papers and clustering them. The presented method extracts primary keywords from the abstracts of each paper by using TF-IDF. Based on TF-IDF values extracted using K-means clustering algorithm, our method clusters papers to the ones that have similar contents. To demonstrate the practicality of the proposed method, we use paper data in FGCS journal as actual data. Based on these data, we derive the number of clusters using Elbow scheme and show clustering performance using Silhouette scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.7
• /
• pp.764-770
• /
• 2019

In this research, text mining techniques were used to analyze the papers related to the "4th Industry". In order to analyze the papers, total of 685 papers were collected by searching with the keyword "4th industry" in Korea Journal Index(KCI) from 2016 to 2019. We used Python-based web scraping program to collect papers and use topic modeling techniques based on LDA algorithm implemented in R language for data analysis. As a result of perplexity analysis on the collected papers, nine topics were determined optimally and nine representative topics of the collected papers were extracted using the Gibbs sampling method. As a result, it was confirmed that artificial intelligence, big data, Internet of things(IoT), digital, network and so on have emerged as the major technologies, and it was confirmed that research has been conducted on the changes due to the major technologies in various fields related to the 4th industry such as industry, government, education field, and job.

• Korean Journal of Heritage: History & Science
• /
• v.50 no.2
• /
• pp.80-93
• /
• 2017

This study proposes a new scientific measurement method for damaged epigraph. In this new method, the Chinese characters are converted and coordinates are created for this measurement. This method is then used to decipher partially damaged characters from the parts of the coordinated characters that are damaged and intact. The Chinese characters are divided into 9 square parts by the position of their Chinese Radicals. The unknown characters are then compared and deciphered dependent upon the character shape in 9 square parts that have been created. This method is more scientific, accurate, and makes it easier to find related characters than deciphering through contexts, which is current method. When creating a new software based on this algorithm, it will be especially useful in deciphering an old manuscript or a epigraph that made ancient Chinese characters which are not currently in use. This study will also be helpful in deciphering semi-cursive styled or cursive styled epigraph, as well as semi-cursive styled or cursive styled damaged characters during follow-up research.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.11
• /
• pp.1343-1350
• /
• 2019

Converting boundary images to time-series makes it feasible to perform boundary matching even on a very large image database, which is very important for interactive and fast matching. In recent research, there has been an attempt to perform fast matching considering partial denoising by converting the boundary image into time series. In this paper, to improve performance, we propose an index-building method considering all possible arbitrary denoising parameters for removing arbitrary partial noises. This is a challenging problem since the partial denoising boundary matching must be considered for all possible denoising parameters. We propose an efficient single index-building algorithm by constructing a minimum bounding rectangle(MBR) according to all possible denoising parameters. The results of extensive experiments conducted show that our index-based matching method improves the search performance up to 46.6 ~ 4023.6 times.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.3
• /
• pp.215-222
• /
• 2021

As the importance of human-computer interaction (Human Computer Interface) technology grows and research on HCI is progressing, it is inferred about the research emotion inference or the computer reaction according to the user's intention, not the computer reaction by the standard input of the user. Stress is an unavoidable result of modern human civilization, and it is a complex phenomenon, and depending on whether or not there is control, human activity ability can be seriously changed. In this paper, we propose an intelligent emotional recommendation system using music as a way to relieve stress after measuring heart rate variability (HRV) and acceleration photoplethymogram (APG) increased through stress as part of human-computer interaction. The differential evolution algorithm was used to extract reliable data by acquiring and recognizing the user's biometric information, that is, the stress index, and emotional inference was made through the semantic web based on the obtained stress index step by step. In addition, by searching and recommending a music list that matches the stress index and changes in emotion, an emotional recommendation system suitable for the user's biometric information was implemented as an application.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.1
• /
• pp.85-91
• /
• 2011

The technique, which is able to detect and recognize characters in videos such as a movie or TV drama, can be used for applications which are database management of a general user's facial images for the suppliers of PVR(personal video recorder), mobile phones, and multimedia, etc. In this paper, we propose a face detection algorithm. It searches the character through cast indexing when the scene is changed in video. It is consisted of three stages. The first step is the detection-step of the scene change after producing a paused image. The second step is the face detection-step using color information. The final step is the detection-step which detects its features by the facial boundary. According to the experimental result, it has detected faces in different conditions successfully and more advanced than the existing other one that are using only color information.