• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1047-1054
• /
• 2004

One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.

• Journal of KIISE:Software and Applications
• /
• v.27 no.11
• /
• pp.1106-1114
• /
• 2000

컴퓨터 분야에서 에이전트의 개념은 전자 상거래, 정보 검색과 같은 많은 어플리케이션들에 응용되어 중요 시 되고 있다. 하지만, 아직까지 지능성을 가진 테스트 도구는 없었다. 이 논문에서 제안하는 테스트 에이전트 시스템은 에이전트의 특성을 가지고 테스터를 도와주는 테스트 도구이다. 테스트 에이전트 시스템은 객체지향 테스트 프로세스를 따라 테스터의 일을 대행해 주고, 테스터의 간섭을 최소화 시켜 준다. 이 시스템은 자동 생성된 많은 양의 테스트케이스에서 중복이 없고 일관성 있는 테스트케이스를 지능적으로 선택하여 테스트 시간을 단축시켜 준다. 테스트 에이전트 시스템은 3개의 에이전트 User Interface Agent, Test Case Selection & Testing Agent, Regression Test Agent로 구성된다. 특히 Test Case Selection & Testing Agent은 RE-Rule과 CTS-Rule을 통하여 중복이 없고 일관성 있는 테스트케이스를 지능적으로 선택하며, Regression Test Agent는 RRTIS-Rule을 통해 리그래션 테스트 항목을 지능적으로 선택한다.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.2
• /
• pp.315-332
• /
• 2006

In the 21st knowledge society, libraries should consider OPAC redesign and functional performance improvement by using new web related technology. This paper studied and analyzed case studies of Web 2.0. Library 2.0, domestic and international web portals and libraries. Based on the research, this study implemented Open API and RSS reader and proposes its utilization plan as a next generation OPAC 2.0 service model which can improve OPAC search results and search service.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.451-458
• /
• 2015

Previous multimodal learning methods focus on problem-solving aspects, such as image and video search and tagging, rather than on knowledge acquisition via content modeling. In this paper, we propose the Multimodal Concept Hierarchy (MuCH), which is a content modeling method that uses a cartoon video dataset and a character-based subtitle generation method from the learned model. The MuCH model has a multimodal hypernetwork layer, in which the patterns of the words and image patches are represented, and a concept layer, in which each concept variable is represented by a probability distribution of the words and the image patches. The model can learn the characteristics of the characters as concepts from the video subtitles and scene images by using a Bayesian learning method and can also generate character-based subtitles from the learned model if text queries are provided. As an experiment, the MuCH model learned concepts from 'Pororo' cartoon videos with a total of 268 minutes in length and generated character-based subtitles. Finally, we compare the results with those of other multimodal learning models. The Experimental results indicate that given the same text query, our model generates more accurate and more character-specific subtitles than other models.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.315-318
• /
• 2000

SGML은 구조적 문서를 나타내기 위한 표준으로 이기종간에 호환이 가능하며 다방면에 유연하게 이용 가능한 점이 있다. 전자도서관, 온라인 매뉴얼등의 분야에서 SGML이 활용되면서, 대용량의 SGML 문서를 처리하고 사용자에게 정보를 제공하는 SGML 데이터베이스 시스템이 필요하게 되었다. 또한 웹상에서의 문서교환의 표준으로 XML이 대두되면서 다양한 XML 문서 데이터를 저장, 관리할 수 있는 XML 문서관리시스템도 다수 등장하고 있다. 본 연구에서는 이와 같은 구조적 문서 데이터베이스에 활용될 수 있는 데이터모델로서 , 엘리먼트 구조를 보완하고 문서의 개념을 표현할 수 있는 컴포넌트 기반 모델을 제시하고 기본적인 저장 시스템을 구현하였다. 실험을 통하여 검증한 결과 저장과 검색면에서 성능향상을 얻었다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.69-74
• /
• 2015

In this paper the patterns of information system is reduced so that control rules can guarantee fast response of queries in database. Generally an information system includes many kinds of necessary and unnecessary attribute. In particular, inconsistent information system is less likely to acquire the accuracy of response. Hence we are interested in the simple and understandable rules that can represent useful patterns by means of rough entropy and Bayesian posterior probability. We propose an algorithm which can reduce control rules to a minimum without inadequate patterns such that the implication between condition attributes and decision attributes is measured through the framework of rough entropy. Subsequently the validation of the proposed algorithm is showed through test information system of new employees appointment.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.25 no.3
• /
• pp.101-118
• /
• 2014

Given the context of rapid developing ubiquitous computing environment, it is imperative for users to search and use images based on affective meanings. However, it has been difficult to index affective meanings of image since emotions of image are substantially subjective and highly abstract. In addition, utilizing low level features of image for indexing affective meanings of image has been limited for high level concepts of image. To facilitate the access points of affective meanings of image, this study aims to utilize user-provided responses of images. For a data set, emotional words are collected and cleaned from twenty participants with a set of fifteen images, three images for each of basic emotions, love, sad, fear, anger, and happy. A total of 399 unique emotion words are revealed and 1,093 times appeared in this data set. Through co-word analysis and network analysis of emotional words from users' responses, this study demonstrates expanded word sets for five basic emotions. The expanded word sets are characterized with adjective expression and action/behavior expression.

• Journal of The Korean Association of Information Education
• /
• v.5 no.2
• /
• pp.279-287
• /
• 2001

In this paper, we have defined and designed the structure of standardized XML content for supplying efficient e-Learning contents. We have also implemented the prototype of XML contents generator to create the educational contents easily. In addition, we have suggested the contents searching method using Case Base Reasoning and Bayesian belief network to supply XML contents suitable to learners request. The existing e-Learning system based on HTML could not customize and standardize, but XML contents can be reused and made an intelligent learning by supplying an adaptive content according to learners level. For evaluating the efficiency of designed XML content, we make the standard XML content for learning JAVA program in e-Learning system as well as discussing about the integrity and expanding the educational content. Finally, we have shown the architecture and effectiveness of the knowledge-based XML contents retrieval manager.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.25 no.2
• /
• pp.41-57
• /
• 2014

The objectives of this study is to propose the direction of developing the reading activities of the individuals in the future society, and to develop the "model of Web-based reading strategy", based on the understanding of the information literacy reading strategies, and the characteristic and concept of web 3.0., for adapting to the changes in the media environment. In this study, 6 reading strategy models based on the web platform were developed. These 6 strategy models are Metacognitive Strategy, Information Retrieval Model, Personalization Strategy, Reading Strategy, Writing Strategy and Interpreting Strategy.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.57-64
• /
• 2017

Short message service (SMS) is one of the most important communication methods for people who use mobile phones. However, illegal advertising spam messages exploit people because they can be used without the need for friend registration. Recently, spam message filtering systems that use machine learning have been developed, but they have some disadvantages such as requiring many calculations. In this paper, we implemented a spam message filtering system using the set-based POI search algorithm and sentence similarity without servers. This algorithm can judge whether the input query is a spam message or not using only letter composition without any server computing. Therefore, we can filter the spam message although the input text message has been intentionally modified. We added a specific preprocessing option which aims to enable spam filtering. Based on the experimental results, we observe that our spam message filtering system shows better performance than the original set-based POI search algorithm. We evaluate the proposed system through extensive simulation. According to the simulation results, the proposed system can filter the text message and show high accuracy performance against the text message which cannot be filtered by the 3 major telecom companies.