• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.363-370
• /
• 2007

The ubiquitous computing environment could provide better service to users by adapting to changing contexts. In this paper, we developed a context adaptation system, which enables an ubiquitous program to adapt to different contexts, following its adaptation rules. Using this system, programmers can develop ubiquitous programs suitable for changing contexts, by describing the context adaptation policy. The context adaptation engine of this system fits the ubiquitous program to the current context based on the context adaptation rules. This system was implemented using JCAF, context-aware programing framework based on java. A simulator is also provided to simulate ubiquitous programs by changing contexts.

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

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.617-628
• /
• 2005

The services for ubiquitous computing environments have to provide automatically user-specific adaptive services in dynamically changed environments with many informations provided by both a user and his/her environment. Workflows used in business and distributed computing environments support service automation by connecting many tasks with rules or orderings of tasks. Therefore we must specify context information on transition condition to support context-aware services by adapting a workflow to ubiquitous computing environments. In this paper, we present a structural context model to specify context information on transition constraints of the workflow. And we propose an uWDL Ubiquitous Workflow Description Language) based on web services, which provides web service interfaces which are standardized and independent on heterogeneous and various platforms, protocols, and languages. The uWDL tan be interpreted and executed by a workflow engine, and provide users autonomic services based on context-awareness.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.169-177
• /
• 2008

Grid resources are composed of various communication networks and operation systems. When a grid system searches and selects grid resources, which meet requirements of a grid user, existing grid resource selection systems are limited due to their storage methods for resource information. In order to select grid resources suitable for requirements of a grid user and characteristics of data, this paper constructs an ontology for grid resources and proposes an ontology-based grid resource selection system. This system provides an inference engine based on rules defined by SWRL to create a resource list. Experimental results comparing the proposed system with existing grid resource selection systems, such as the Condor-G and the Nimrod-G, verify the effectiveness of the ontology-based grid resource selection system with improved job throughput and resource utilization and reduced job loss and job processing time.

• Journal of Digital Convergence
• /
• v.11 no.7
• /
• pp.193-199
• /
• 2013

In this paper, a user search history based potential query recommendation system is proposed to enable the user of information search system to represent one's potential desire for information in terms of query and to facilitate the desired information to be searched. The proposed system has analyzed the association with the existing users's search histories based on the users' search query, and it has extracted the users's potential desire for information. The extracted potential desire for information is represented in terms of recommended query and thereby made recommendations to users. In order to analyze the effectiveness of the system proposed in this paper, we conducted behavioral experiments by using search histories of 27656. As a result of behavioral experiments, the experiment subjects were found to show a statistically significant higher level of satisfaction when using the proposed system as compared to using general search engines.

• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.191-205
• /
• 2005

This paper presents a novel product recommender system as a tool fur differentiated marketing service of online shopping malls. Ihe proposed model uses genetic algorithnt one of popular global optimization techniques, to construct a personalized product recommender systen The genetic algorinun may be useful to recommendation engine in product recommender system because it produces optimal or near-optimal recommendation rules using the customer profile and transaction data. In this study, we develop a prototype of WeLbased personalized product recommender system using the recommendation rules fi:om the genetic algorithnL In addition, this study evaluates usefulness of the proposed model through the test fur user satisfaction in real world.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.2
• /
• pp.65-72
• /
• 2012

In the 21st century of information systems, the amount of information resources are ever increasing and the role of information searching system is becoming criticalto easily acquire required information from the web. Generally, it requires the user to have enough pre-knowledge and superior capabilities to identify keywords of information to effectively search the web. However, most of the users undertake searching of the information without holding enough pre-knowledge and spend a lot of time associating key words which are related to their required information. Furthermore, many search engines support the keywords searching system but this only provides collection of similar words, and do not provide the user with exact relational search information with the keywords. Therefore this research report proposes a method of offering expanded user relationship search keywords by analyzing user query patterns to provide the user a system, which conveniently support their searching of the information.

• The KIPS Transactions:PartD
• /
• v.12D no.7 s.103
• /
• pp.1007-1016
• /
• 2005

A key issue for process language design is balancing the need for semantic richness with the need for ease of use. Most process modeling languages fail to satisfy above two conflicting aspects, which is an impediment to the widespread adoption of process modeling languages in the software industry despite of a variety of software process language studies. This paper describes a process modeling language RAiSE attempting to resolve such problem and presents the result of applying RAiSE to a well-known benchmark process, ISPW-6 software process example. RAiSE provides rigorous, yet clear semantics through combing essential features in various modeling paradigms and defining them in a well-structured graphical notation. Process models represented in RAiSE are interpreted and enacted by process engine implemented using CLiPS, a rule based expert system tool.

• Journal of KIISE:Software and Applications
• /
• v.37 no.6
• /
• pp.455-463
• /
• 2010

In this paper, we present an approach to sentence boundary detection for web documents that builds on statistical-based methods and uses rule-based correction. The proposed system uses the classification model learned offline using a training set of human-labeled web documents. The web documents have many word-spacing errors and frequently no punctuation mark that indicates the end of sentence boundary. As sentence boundary candidates, the proposed method considers every Ending Eomis as well as punctuation marks. We optimize engine performance by selecting the best feature, the best training data, and the best classification algorithm. For evaluation, we made two test sets; Set1 consisting of articles and blog documents and Set2 of web community documents. We use F-measure to compare results on a large variety of tasks, Detecting only periods as sentence boundary, our basis engine showed 96.5% in Set1 and 56.7% in Set2. We improved our basis engine by adapting features and the boundary search algorithm. For the final evaluation, we compared our adaptation engine with our basis engine in Set2. As a result, the adaptation engine obtained improvements over the basis engine by 39.6%. We proved the effectiveness of the proposed method in sentence boundary detection.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.17-23
• /
• 2016

In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.