• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.449-455
• /
• 2016

Times have changed and using smart phones is common to everyone, regardless of men and women of all ages. Especially, making educational applications is on a rising trend. This report aims to build a program, which makes young children easily meet and learn Hangul anytime, anywhere, to keep pace with the change and trend. As everyone knows, young children's Hangul learning process is changing with smart phone generalization. Young children usually learned Hangul based on paper books but now times have changed, instead, smart phones can be used to learn Hangul anytime, anywhere, and this trend is seen everywhere easily. This report explains how to build smart phone applications to make it easier to learn and understand educational Hangul plays.

• Journal of Platform Technology
• /
• v.8 no.4
• /
• pp.38-46
• /
• 2020

This study describes how to build a security control system using an open source big data solution so that private companies can build an overall security control infrastructure. In particular, the infrastructure was built using the Elastic Stack, one of the free open source big data analysis solutions, as a way to shorten the cost and development time when building a security control system. A comparative experiment was conducted. In addition, as a result of comparing and analyzing the functions, convenience, service and technical support of the two solution, it was found that the Elastic Stack has advantages in the security control of Big Data in terms of community and open solution. Using the Elastic Stack, security logs were collected, analyzed, and visualized step by step to create a dashboard, input large logs, and measure the search speed. Through this, we discovered the possibility of the Elastic Stack as a big data analysis solution that could replace Splunk.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.129-143
• /
• 2012

Recently, the rapid progress of a number of standardized web technologies and the proliferation of web users in the world bring an explosive increase of producing and consuming information documents on the web. In addition, most companies have produced, shared, and managed a huge number of information documents that are needed to perform their businesses. They also have discretionally raked, stored and managed a number of web documents published on the web for their business. Along with this increase of information documents that should be managed in the companies, the need of a solution to locate information documents more accurately among a huge number of information sources have increased. In order to satisfy the need of accurate search, the market size of search engine solution market is becoming increasingly expended. The most important functionality among much functionality provided by search engine is to locate accurate information documents from a huge information sources. The major metric to evaluate the accuracy of search engine is relevance that consists of two measures, precision and recall. Precision is thought of as a measure of exactness, that is, what percentage of information considered as true answer are actually such, whereas recall is a measure of completeness, that is, what percentage of true answer are retrieved as such. These two measures can be used differently according to the applied domain. If we need to exhaustively search information such as patent documents and research papers, it is better to increase the recall. On the other hand, when the amount of information is small scale, it is better to increase precision. Most of existing web search engines typically uses a keyword search method that returns web documents including keywords which correspond to search words entered by a user. This method has a virtue of locating all web documents quickly, even though many search words are inputted. However, this method has a fundamental imitation of not considering search intention of a user, thereby retrieving irrelevant results as well as relevant ones. Thus, it takes additional time and effort to set relevant ones out from all results returned by a search engine. That is, keyword search method can increase recall, while it is difficult to locate web documents which a user actually want to find because it does not provide a means of understanding the intention of a user and reflecting it to a progress of searching information. Thus, this research suggests a new method of combining ontology-based search solution with core search functionalities provided by existing search engine solutions. The method enables a search engine to provide optimal search results by inferenceing the search intention of a user. To that end, we build an ontology which contains concepts and relationships among them in a specific domain. The ontology is used to inference synonyms of a set of search keywords inputted by a user, thereby making the search intention of the user reflected into the progress of searching information more actively compared to existing search engines. Based on the proposed method we implement a prototype search system and test the system in the patent domain where we experiment on searching relevant documents associated with a patent. The experiment shows that our system increases the both recall and precision in accuracy and augments the search productivity by using improved user interface that enables a user to interact with our search system effectively. In the future research, we will study a means of validating the better performance of our prototype system by comparing other search engine solution and will extend the applied domain into other domains for searching information such as portal.

• Journal of KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.214-221
• /
• 2010

The search-results clustering problem is defined as the automatic and on-line grouping of similar documents in search results returned from a search engine. In this paper, we propose a new search-results clustering algorithm specialized for a paper search service. Our system consists of two algorithmic phases: Category Hierarchy Generation System (CHGS) and Paper Clustering System (PCS). In CHGS, we first build up the category hierarchy, called the Field Thesaurus, for each research field using an existing research category hierarchy (KOSEF's research category hierarchy) and the keyword expansion of the field thesaurus by a word clustering method using the K-means algorithm. Then, in PCS, the proposed algorithm determines the category of each paper using top-down and bottom-up methods. The proposed system can be used in the application areas for retrieval services in a specialized field such as a paper search service.

• Information Systems Review
• /
• v.12 no.1
• /
• pp.1-22
• /
• 2010

Demands onenterprise applications are changing drastically in terms of service and value. Currently enterprises have started to view these applications as service systems, as they combine technology with organizational networks designed to deliver services that satisfy the needs of customers and marketing operations. Social networking is playing a crucial role in this direction and provides organizations with the critical data that enable to build strong relationships with their customers and partners. Enterprises have started using this concept, by integrating social networking services with their enterprise applications such as CRM. In this paper, we combine an open source social networking engine with a CRM (Customer Relationship Management) application to constitute a social CRM system. This can bring the customers closer to the enterprise and facilitate better communication with them. Social Networking Analysis constructs were used to analyze the effectiveness of service system. In the current competitive and economically challenging conditions, salespeople needs to quickly and effectively establish meaningful communication with customers. Our approach can address this issue, by handling the changing customer demands in minimal time, and increases service quality and business value.

• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.1062-1072
• /
• 2006

Recently, new intelligent service frameworks, such as ubiquitous computing are proposed. So, the necessity of adaptive agent system has been increased. In this paper, we propose an intelligent service agent to help that ubiquitous computing system offer user suitable service in ubiquitous computing environment. In order to offer user suitable uT-service, an intelligent service agent mediates the gap between the context information in uT-service system, and user preference is reflected in it. Therefore, we focus on following three components; the first is suitable multi agent framework-agent communication analysis and applicable method of inference engine, the second is uT-ontologies to describe various context information-context information sharing between agents and context information understanding between agents, the third is learning method of user profile to apply in uT-service system. This approach enables us to build adaptive uT-service system to offer suitable service according to user preference.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.485-492
• /
• 2001

Recently, character agents are used as a user-friendly interface. In this paper, we have studied a generic framework for emotional character agents which are designed to infer emotions from diverse personalities, situations, user behaviors and to express them. The method of emotion inference is based on blackboard systems which are used to solve the problems in AI. Because it keeps independence between knowledge sources which are rules of emotions, a blackboard-based inference engine is easy to manage knowledge sources, Blackboard-based systems gave the system flexibility. So we can adapt the engine to various application systems. Each emotional agent monitors user behavior, learns user profile and infers user behavior. And it generates characters emotions according to the user profile. So, in case of same situations, the agent can generate different emotions according to users. We have studied to build an personalized emotional character agent which according to situations and user modeling.

• International Journal of Contents
• /
• v.8 no.3
• /
• pp.83-93
• /
• 2012

In this paper, we propose a novel method that automatically generates real character images to familiarize existing OCR systems with new fonts. At first, we generate synthetic character images using a simple degradation model. The synthetic data is used to train an OCR engine, and the trained OCR is used to recognize and label real character images that are segmented from ideal document images. Since the OCR engine is unable to recognize accurately all real character images, a substring matching method is employed to fix wrongly labeled characters by comparing two strings; one is the string grouped by recognized characters in an ideal document image, and the other is the ordered string of characters which we are considering to train and recognize. Based on our method, we build a system that automatically generates 2350 most common Korean and 117 alphanumeric characters from new fonts. The ideal document images used in the system are postal envelope images with characters printed in ascending order of their codes. The proposed system achieved a labeling accuracy of 99%. Therefore, we believe that our system is effective in facilitating the generation of numerous character samples to enhance the recognition rate of existing OCR systems for fonts that have never been trained.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2003.05a
• /
• pp.183-188
• /
• 2003

The present work was conducted to build a propulsion system for an airship. For this purpose, free shaft gas-turbine was modified to produce electrical power. he experiments were carried out to analyze the driving rotor condition at various power shaft loads. From this analysis, an appropriate damping device was required, and the changeable inertial moment from the fly-wheel was applied. Without the appropriate damping device, instability was found, and it was resulted as power loss. Also the amount of inertial moment was certified by the performance of dynamic transient effects from the engine test results. Knowledge gained from this research could benefit the propulsion and power conversion community by increasing the better understanding of shaft loads and inertial effects.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.17 no.2
• /
• pp.105-117
• /
• 2004

In each industry field, many engineers have tried to develop integrated environments using information technology. The core technology in building integrated environments is the database based on standardized information. To meet the requirements, this study builds a database with detailed design information as a part of integrating digital information generated from every work of steel bridges. The data model used to build the database was developed based on the international standard, namely ISO/STEP. The data model is classified into geometric and non-geometric parts to represent the design information of steel bridges. The geometric parts are represented by a three dimensional solid model so that they may be able to reuse existing information. Also, the non-geometric parts represent information requirements that are analyzed by the development method of standard data model. To verify the data model, this study validates the syntax of the model on EXPRESS Engine and verifies the validation of the model by applying the design data of Hannam bridge to the database.