• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.845-854
• /
• 2004

Motif databases are used in the function and structure prediction of proteins. The frequency of use about these databases increases continuously because of protein sequence data growth. Recently, many researches about motif resource integration are proceeding. However, existing motif databases were developed independently, thus these databases have a heterogeneous search result problem. Database intnegration for this problem resolution has a periodic update problem, a complex query process problem, a duplicate database entry handling problem and BML support problem. Therefore, in this paper, we suppose a database resource integration method for these problem resolution, describe periodically integrated database update method and XML transformation. finally, we estimate the implementation of our prototype and a case database.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.131-143
• /
• 2007

The current trends in information technology and intelligent systems use data mining techniques to discover patterns and extract rules from distributed databases. In distributed environment, the extracted rules from data mining techniques can be used in dynamic replications, adaptive load balancing and other schemes. However, transmission of large data through the system can cause errors and unreliable results. This paper proposes the intelligent distributed platform based on dynamic group binding using mobile agents which addresses the use of intelligence in distributed environment. The proposed grouping service implements classification scheme of objects. Data compressor agent and data miner agent extracts rules and compresses data, respectively, from the service node databases. The proposed algorithm performs preprocessing where it merges the less frequent dataset using neuro-fuzzy classifier before sending the data. Object group classification, data mining the service node database, data compression method, and rule extraction were simulated. Result of experiments in efficient data compression and reliable rule extraction shows that the proposed algorithm has better performance compared to other methods.

• Journal of the Society of Cosmetic Scientists of Korea
• /
• v.29 no.2 s.43
• /
• pp.233-250
• /
• 2003

We often use the KCID(Korean Cosmetic Ingredient Dictionary) and ICID(International Cosmetic Ingredient Dictionary) within cosmetics research and within their export and import. so far, we do not have a database of a cosmetics' raw materials. Because of this, we consume a lot of time to find the raw material data that is needed. This study constructs a cosmetics' raw material database and develops the program to retrieve it. We used a Linux machine as the equipment for this study and we used Apache web server, MySQL database server and PHP as the tools of this study. 11,817 kinds of raw materials data were registered as ICID, 866 kinds of raw materials data were registered as KCID and 28,008 kinds of raw materials data with registered trade name into the database. Also, The database was composed of the database of the association form. The database of the online form could ultimately reduce the task time as soon as it did its purpose. The product of this study can become a good basis of data to reconfigure. In the future, it can become a good database in relation with different databases.

• Proceedings of the KIEE Conference
• /
• 2008.11a
• /
• pp.238-240
• /
• 2008

현재의 배전자동화 시스템에서는 빠르게 계통의 변화를 이해하고 변화에 대한 대응을 할 수 있도록 전압 손실계산, 공급예비력 확보, 부하융통 방안수립 등을 주 업무로 하는 회선별 단선도를 가지고 있다. 또한 부하밀집 지역 같은 경우는 다수의 설비 symbol이 매우 근접하게 배치되어 있지만 단선도를 통해 계통을 단순화시켜 계통의 연결 관계를 쉽게 파악하고 운영한다. 하지만 도시가 점점 발전함에 따라 배 전자동화 시스템의 단선도 화면에 symbol이 많아져 계통이 크고 복잡해 졌을때 단선도가 화면을 넘어가는 현상과 선로의 중복 현상이 나타난다. 본 논문에서 제안하는 배 전자동화 시스템의 회선별 단선도 자동 생성 알고리즘은 계통이 크고 복잡해 져도 autodrawing기법을 통해 한 화면에 모두 보여 주고, 중복 현상을 없애기 위한 선로의 구성과 중복 현상 발생 때에도 좌표를 재배치 하는 알고리즘을 제안한다. 알고리즘을 통해 해결하며 또한 제안한 알고리즘을 검증하기 위해 VC++6.0을 기반으로 구현하였고, 이를 배전 자동화 시스템의 데이터베이스를 이용한 단선도와 비교를 통해 검증하였다.

• Journal of the Korean Society for Library and Information Science
• /
• v.31 no.1
• /
• pp.153-184
• /
• 1997

The importance of WWW search services is increasing as Internet information resources explode. An evaluation of current 9 search services was first conducted by comparing descriptively the features concerning indexing, searching, and ranking of search results. Secondly, a couple of search queries were used to evaluate search performance of those services by the measures of retrieval effectiveness. the degree of overlap in searching sites, and the degree of similarity between services. In this experiment, Alta Vista, HotBot and Open Text Index showed better results for the retrieval effectiveness. The level of similarity among the 9 search services was extremely low.

• KIISE Transactions on Computing Practices
• /
• v.23 no.4
• /
• pp.250-255
• /
• 2017

Given the explosion of genomic data and expansion of applications such as precision medicine, the importance of efficient genome-database management continues to grow. Traditional compression techniques may be effective in reducing the size of a database, but a new challenge follows in terms of performing operations such as comparison and searches on the compressed database. Based on that many genome databases typically have numerous duplicated or similar sequences, and that the runtime of genome analyses is normally proportional to the number of sequences in a database, we propose a technique that can compress a genome database by eliminating similar entries from the database. Through our experiments, we show that we can remove approximately 84% of sequences with 1% similarity threshold, accelerating the downstream classification tasks by approximately 10 times. We also confirm that our compression method does not significantly affect the accuracy of taxonomy diversity assessments or classification.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.679-688
• /
• 2003

Motif databases are used in the function and structure prediction of proteins which appear on new and rapid release of raw data from genome sequencing projects. Recently, the frequency of use about these databases increases continuously. However, existing motif databases were developed and extended independently and were integrated mainly by using a web-based cross-reference, thus these databases have a heterogeneous search result problem, a complex query process problem and a duplicate database entry handling problem. Therefore, in this paper, we suppose physical motif resource integration and describe the integrated search method about a family-based protein prediction for solving above these problems. Finally, we estimate our implementation of the motif integration database and prediction system for predicting protein motifs.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.5
• /
• pp.1167-1177
• /
• 2019

In this paper, the improved security operation model based on the vulnerability database is studied. The proposed model consists of information protection equipment, vulnerability database, and a dashboard that visualizes and provides the results of interworking with detected logs. The evaluation of the model is analyzed by setting up a simulated attack scenario in a virtual infrastructure. In contrast to the traditional method, it is possible to respond quickly to threats of attacks specific to the security vulnerabilities that the asset has, and to find redundancy between detection rules with a secure agent, thereby creating an optimal detection rule.

• Journal of Information Management
• /
• v.24 no.3
• /
• pp.57-72
• /
• 1993

The purpose of this study is to investigate the present status of foreign academic journal collection in Korea and to explore the problem. In order to survey the current situation, the data from "Union Catalogue of Foreign Journals:Science & Technology, 1992" database constructed by Korea Institute of Industry and Technology Information has been analyzed. Major problems are poor collections, collection overlap, and lack of resource sharing.