• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.811-814
• /
• 2009

다양한 주소체계를 E.164번호로 통합하는 ENUM(tElephone NUmber Mapping) 기술은 휴대용 기기의 사용이 일반적인 현 시점에서 번호의 복잡성과 입력의 불편함과 같은 문제점을 가지고 있다. ENUM 번호를 키워드를 사용하여 매핑하는 Keyword DNS는 별도의 주소록을 사용하지 않고 ENUM 서비스를 사용할 수 있어 사용자의 편의성을 향상시킬 것이다. 본 논문은 ENUM과 Keyword ENUM을 설명하고 ENUM system과 Keyword ENUM system을 설계한다.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.97-104
• /
• 2017

In semantic information retrieval, we first need to build domain ontology and second, we need to convert the users' search keywords into a standard query such as SPARQL. In this paper, we propose a method that can automatically convert the users' search keywords into the SPARQL queries. Furthermore, our method can ensure effective performance in a specific domain such as law. Our method constructs the keyword history ontology by associating each keyword with a series of information when there are multiple keywords. The constructed ontology will convert keyword history ontology into SPARQL query. The automatic transformation method of SPARQL query proposed in the paper is converted into the query statement that is deemed the most appropriate by the user's intended keywords. Our study is based on the existing legal ontology constructions that supplement and reconstruct schema and use it as experiment. In addition, design and implementation of a semantic search tool based on legal domain and conduct experiments. Based on the method proposed in this paper, the semantic information retrieval based on the keyword is made possible in a legal domain. And, such a method can be applied to the other domains.

• Journal of Fisheries and Marine Sciences Education
• /
• v.28 no.3
• /
• pp.872-880
• /
• 2016

The purpose of this study is to find the research trends relating to flipped learning through keyword network analysis. For investigating this topic, final 100 papers (removed due to overlap in all 205 papers) were selected as subjects from the result of research databases such as RISS, DBPIA, and KISS. After keyword extraction, coding, and data cleaning, we made a 2-mode network with final 202 keywords. In order to find out the research trends, frequency analysis, social network structural property analysis based on co-keyword network modeling, and social network centrality analysis were used. Followings were the results of the research: (a) Achievement, writing, blended learning, teaching and learning model, learner centered education, cooperative leaning, and learning motivation, and self-regulated learning were found to be the most common keywords except flipped learning. (b) Density was .088, and geodesic distance was 3.150 based on keyword network type 2. (c) Teaching and learning model, blended learning, and satisfaction were centrally located and closed related to other keywords. Satisfaction, teaching and learning model blended learning, motivation, writing, communication, and achievement were playing an intermediary role among other keywords.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5671-5693
• /
• 2017

With the rapid development of cloud computing, more and more data owners are motivated to outsource their data to cloud for various benefits. Due to serious privacy concerns, sensitive data should be encrypted before being outsourced to the cloud. However, this results that effective data utilization becomes a very challenging task, such as keyword search over ciphertexts. Although many searchable encryption methods have been proposed, they only support exact keyword search. Thus, misspelled keywords in the query will result in wrong or no matching. Very recently, a few methods extends the search capability to fuzzy keyword search. Some of them may result in inaccurate search results. The other methods need very large indexes which inevitably lead to low search efficiency. Additionally, the above fuzzy keyword search methods do not support access control. In our paper, we propose a searchable encryption method which achieves fuzzy search and access control through algorithm design and Ciphertext-Policy Attribute-based Encryption (CP-ABE). In our method, the index is small and the search results are accurate. We present word pattern which can be used to balance the search efficiency and privacy. Finally, we conduct extensive experiments and analyze the security of the proposed method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.661-663
• /
• 2013

The purpose of the following report is to introduce a model that makes it possible to efficiently search data by using keyword-based concept network for reliable access of information which is rapidly increasing in the mobile cloud. A keyword-based concept network is a method with the application of ontology. However, the proposed model is added by association information between keyword concepts as a method for a user's efficient information retrieval. Furthermore, the proposed concept network consists of the keyword centered concept network, expert-group-recommended field concept network, and process concept network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.504-505
• /
• 2017

Existing morpheme analyzers classify the words used in writing documents. A system for extracting sentences and paragraphs based on a morpheme analyzer is being developed. However, there are very few systems that compress documents and extract important paragraphs. The algorithm proposed in this paper calculates the weights of the keyword written in the document and extracts the paragraphs containing the keyword. Users can reduce the time to understand the document by reading the paragraphs containing the keyword without reading the entire document. In addition, since the number of extracted paragraphs differs according to the number of keyword used in the search, the user can search various patterns compared to the existing system.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.51-56
• /
• 2009

In a language, noun and keyword extraction is a key element in information processing. When it comes to processing Korean language information, however, there are still a lot of problems with noun and keyword extraction. This paper proposes an effective noun extraction method that considers noun emergence features. The proposed method can be effectively used in areas like information retrieval where large volumes of documents and data need to be processed in a fast manner. In this paper, a category-based keyword construction method is also presented that uses an unsupervised learning technique to ensure high volumes of queries are automatically classified. Our experimental results show that the proposed method outperformed both the supervised learning-based X2 method known to excel in keyword extraction and the DF method, in terms o classification precision.

• Korean Journal of Childcare and Education
• /
• v.20 no.1
• /
• pp.91-111
• /
• 2024

Objective: The purpose of this study is to explore trends in institutional evaluation research in early childhood education through keyword network analysis. This aims to understand trends in academic discourse on institutional evaluation and gain implications for follow-up research and related policy directions. Methods: A total of 6,629 keywords were extracted from 572 dissertations and journal articles published from January 2006 to October 2023 for the purpose of analyzing and visualizing the frequency and centrality of keywords, as well as the structural properties of keyword networks. The analysis and visualization were conducted using the TEXTOM, UCINET6, and NetDraw programs. Results: First, the number of institutional evaluation studies increased steadily from 2006 to 2010 and then decreased, with a higher frequency of studies on daycare centers compared to kindergartens. Second, the most frequently occurring keyword in the analysis was 'daycare center,' and the highest connection strength was found in the term 'daycare-center-evaluation.' Third, network analysis revealed that key terms for institutional evaluation research included 'evaluation certification,' 'recognition,' 'evaluation indicators,' 'teacher,' 'daycare center,' and 'kindergarten.' In the ego network analysis for each institution, 'parent' emerged as a highly ranked keyword. Conclusion/Implications: This study confirmed the perspectives of previous studies by revealing the structure of core concepts in early childhood education institution evaluation research, and provided implications for follow-up and direction of institution evaluation

• Journal of Satellite, Information and Communications
• /
• v.7 no.3
• /
• pp.86-93
• /
• 2012

In this paper, we propose keyword search and ranking methods for OWL documents that describe metadata and ontology on the Semantic Web. The proposed keyword search method defines a unit of keyword search result as an information resource and expands a scope of query keyword to names of class and property or literal data. And we reflected derived information by inference in the keyword search by considering the elements of OWL documents such as hierarchical relationship of classes or properties and equal relationship of classes. In addition, our method can search a large number of information resources that are relevant to query keywords because of information resources indirectly associated with query keywords through semantic relationship. Our ranking method can improve user's search satisfaction because of involving a variety of factors in the ranking by considering the characteristics of OWL. The proposed methods can be used to retrieve digital contents, such as broadcast programs.