• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.1
• /
• pp.44-50
• /
• 2010

Wireless sensor network is consist of multiple sensor nodes and performs a shared tasks through the coordination of sensor nodes. Traffic in WSN is categorized as periodical monitoring traffic, event-driven traffic and query-based traffic. Periodic traffic takes significant proportion of the whole traffic processing because multiple sensor nodes generate traffic in a steady interval although the generation frequency of periodic traffic is low. In this paper, we propose a traffic control algorithm of network protocol for periodic traffic in terms of energy efficiency and conduct performance analysis of the algorithm.

• Journal of Digital Contents Society
• /
• v.17 no.5
• /
• pp.383-390
• /
• 2016

is a service providing story synopses that match user's query. This paper presents a classification of character types by clustering of character tendencies found in the user log of . We also present a visualization method of showing genre-action relationships to each character type, and investigate the genre-action relationships of the major character types. We found that a small number of character types can represent more than half of the character tendencies and the character types tend to have a relationship to particular genres and actions. According to this properties, it would be desirable to provide supports for creative writing classified by character types.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2849-2864
• /
• 2021

The emerging of cloud data sharing can create great values, especially in multi-cloud environments. However, "data island" between different cloud service providers (CSPs) has drawn trust problem in data sharing, causing contradictions with the increasing sharing need of cloud data users. And how to ensure the data value for both data owner and data user before sharing, is another challenge limiting massive data sharing in the multi-cloud environments. To solve the problems above, we propose a Uniform Encoding and Parsing Framework (UEPF) with blockchain to support trustworthy and valuable data sharing. We design namespace-based unique identifier pair to support data description corresponding with data in multi-cloud, and build a blockchain-based data encoding protocol to manage the metadata with identifier pair in the blockchain ledger. To share data in multi-cloud, we build a data parsing protocol with smart contract to query and get the sharing cloud data efficiently. We also build identifier updating protocol to satisfy the dynamicity of data, and data check protocol to ensure the validity of data. Theoretical analysis and experiment results show that UEPF is pretty efficient.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.88-90
• /
• 2007

수집 및 가공된 교통자료와 시스템 운영 자료의 체계적인 분석 수단으로 사용될 교통 이력자료 관리 시스템의 요구 기능을 정의하는 것은 매우 중요하다. 시스템 구축을 위한 사용자 요구사항을 구체적으로 정의, 설명함으로써 시스템 완성도와 활용도를 높인다. 본 논문에서는 교통 이력자료 관리시스템의 주요 기능으로 '자료 저장 기능', '자료 분석 기능', '자료 보고 기능' 을 제안한다. 이러한 시스템의 사용자 요구 기능은 Rational Rose tool 을 이용하여 Use Case 다이어그램으로 시각화 되어지며 이후 교통정보 이력자료 통합데이터베이스 구축을 위한 개발자들에게 더욱 쉬운 이해를 제공할 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1519-1533
• /
• 2004

When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. In this paper, we apply the fuzzy retrieval model to solve the high time complexity of the retrieval system by constructing a reduced term set for the term's relatively importance degree. Furthermore, we perform a cluster retrieval to reflect the user's Query exactly through the similarity relation matrix satisfying the characteristics of the fuzzy compatibility relation. We have proven the performance of a proposed re-ranking model based on the similarity union of the fuzzy retrieval model and the document cluster retrieval model.

• Journal of Korean Library and Information Science Society
• /
• v.39 no.1
• /
• pp.265-278
• /
• 2008

This study aims to perform an evaluation of unified search services provided by major Korean search portals, Naver, Daum, Yahoo-Korea, and Empas. These unified search services are evaluated in terms of the relevance of search results. In conducting this study, real queries that real users submitted were used. This study also utilized click logs that consist of documents users clicked and viewed. The results of this study can be implemented to the development and improvement of portal's unified search services. Users can refer to the results of this study in choosing unified search services from search portals.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.569-574
• /
• 2011

In this paper, we introduce the subspace contrasting group identification problem and propose an algorithm to solve the problem. In order to identify contrasting groups, the algorithm first determines two groups of which attribute values are in one of the contrasting ranges specified by the analyst, and searches for the contrasting groups while increasing the dimension of subspaces with an association rule mining strategy. Because the dimension of microarray data is likely to be tens of thousands, it is burdensome to find all contrasting groups over all possible subspaces by query generation. It is very useful in the sense that the proposed method allows to find those contrasting groups without analyst's involvement.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.278-283
• /
• 2008

As the usefulness of internet is kept changing more productively with web 1.0, web 2.0 usage of XML is also increasing very rapidly. In XML environment the most critical function is the ability of effective retrieval of useful information from XML repository. That makes the W3C XQuery more popular XQuery has very complicated structure as a query language due to the semi_structured nature of XML. FLOWOR, which stand for, let. where, order by, return, is the most commonly used expression in XQuery. In this paper we suggest the methods to handle XQuery FLWOR on relational environments. We also analyze and evaluate our approach to prove its correctness.

• International journal of advanced smart convergence
• /
• v.8 no.1
• /
• pp.1-8
• /
• 2019

Coronaviruses are known respiratory pathogens. In the past, most human coronaviruses were thought to cause mild symptoms such as cold. However recently, as seen in the Severe Acute Respiratory Syndrome (SARS) and the Middle East Respiratory Syndrome (MERS), infectious diseases with severe pulmonary disease and respiratory symptoms are caused by coronaviruses, making research on coronaviruses become important. Considering previous studies, we constructed 'HCoV-IMDB (Human Corona Virus Immune Database)' to systematically provide genetic information on human coronavirus and host immune information, which can be used to analyze the interaction between human coronavirus and host immune proteins. The 'HCoV-IMDB' constructed in the study can be used to search for genetic information on human coronavirus and host immune protein and to download data. A BLAST search specific to the human coronavirus, one of the database functions, can be used to infer genetic information and evolutionary relationship about the query sequence.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.2-5
• /
• 2021

With the recent development of the Internet of Things (IoT) technology, various terminals are being connected to the Internet. As a result, the amount of IoT data is also increasing, and an index key that can efficient analyze the large-scale IoT data is proposed. Existing index keys have only time and space information, so if data stored in index tables and instance tables were queried using repetition or join operation, IoT data was embedded in the index key of the proposal to create OLAP-based big tables to minimize the number of repetitions or join times.