• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.68-74
• /
• 2010

This paper suggest a new ACS algorithm to solve SMP which was solved by Gale-Shapley algorithm. The stable marriage problem is an extensively-studied combinatorial problem with many practical applications. The classical Gale-Shapley algorithm produces a marriage that greatly favors the men at the expense of the women, or vice versa. In this paper we apply ACS algorithm to SMP to find 4 kinds of solutions such as stable matching with man-optimal, woman-optimal, egalitarian stable matching, sex-fair stable matching. So this ACS is a novel method to solve Stable Marriage Problem. Our simulation results show the effectiveness of the proposed ACS.

• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.31-50
• /
• 2009

As the collected information which is static or dynamic is infinite in ubiquitous computing environments, information overload and invasion of privacy have been pressing issues in the recommendation service. In this study, we propose a recommendation service procedure through P2P, The P2P helps customer to obtain effective and secure product information because of communication among customers who have the similar preference about the products without connection to server. To evaluate the performance of the proposed recommendation service, we utilized real transaction and product data of the Korean mobile company which service character images. We developed a prototype recommender system and demonstrated that the proposed recommendation service makes an effect on recommending product in the ubiquitous environments. We expect that the information overload and invasion of privacy will be solved by the proposed recommendation procedure in ubiquitous environment.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.261-268
• /
• 2008

An author of a paper is represented as his/her personal name in a bibliographic record. However, the use of names to indicate authors may deteriorate recall and precision of paper and/or author search, since the same name can be shared by many different individuals and a person can write his/her name in different forms. To solve this problem, it is required to disambiguate same-name author names into different persons. As features for author resolution, previous studies have exploited bibliographic attributes such as co-authors, titles, publication information, etc. This study attempts to apply email addresses of authors to disambiguate author names. For this, we first handle the extraction of email addresses from full-text papers, and then evaluate and analyze the effect of email addresses on author resolution using a large-scale test set.

• Information Systems Review
• /
• v.4 no.2
• /
• pp.223-236
• /
• 2002

In an agent-based system, each agent has its own decision making capability and competes, cooperates, and communicates each other with an agent interface. Virtual manufacturing has characteristics as a typical application area of agent-based system: complex and time-bound decision making and negotiation. The time-boundness influences the choice of decision making models and design of protocols for internal and external negotiation. In this paper, we provide a case study which suggests a time-bound framework for external and internal negotiation between the agents for virtual manufacturing environment. We illustrate decision making model selection strategy and the system architecture of the agent-based system for the complex and time-bound environment.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1126-1130
• /
• 2010

Research on intelligent robot is in active progress as the next generation IT education area. Since intelligent robots are closely related to the real human world, they should provide human behaviors or judging ability as their functions. For this reason, research is recently done not only on diverse hardware of robot education but also on service component architecture which includes various functions. In this paper we propose a study on learning to creative solve problems using RDS(Robotics Developer Studio). RDS is a software tool to control or program intelligence robot as a software module. Using service component framework which considers standardization of the integrated development of intelligent robot, we expect to provide 3-dimensional visual simulation environment, and save time and costs in education the environment for the intelligence robot experiment.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.164-172
• /
• 2004

For a local search algorithm to find a bettor quality solution it is required to generate and evaluate a sufficiently large number of candidate solutions as neighbors at each iteration, demanding quite an amount of CPU time. This paper presents a method of selectively generating only good-looking candidate neighbors, so that the number of neighbors can be kept low to improve the efficiency of search. In our method, a newly generated candidate solution is probabilistically selected to become a neighbor based on the quality estimation determined heuristically by a very simple evaluation of the generated candidate. Experimental results on the problem of load balancing for production scheduling have shown that our candidate selection method outperforms other random or greedy selection methods in terms of solution quality given the same amount of CPU time.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.2
• /
• pp.63-71
• /
• 2012

Recently, web portals have been offering georeferenced SLI(Street-Level Imagery) services, such as Google Streetview. The SLI has a distinctive strength over aerial images or vector maps because it gives us the same view as we see the real world on the street. Based on the characteristic, applicability of the SLI can be increased substantially through conflation with other spatial datasets. However, spatial inconsistency between different datasets is the main reason to decrease the quality of conflation when conflating them. Therefore, this research aims to remove the spatial inconsistency to conflate an SLI with a widely used 2D vector map. The removal of the spatial inconsistency is conducted through three sub-processes of (1) road intersection matching between the SLI trace and the road layer of the vector map for detecting CPPs(Control Point Pairs), (2) inaccurate CPPs filtering by analyzing the trend of the CPPs, and (3) local alignment using accurate CPPs. In addition, we propose an evaluation method suitable for conflation result including an SLI, and verify the effect of the removal of the spatial inconsistency.

• School Mathematics
• /
• v.17 no.3
• /
• pp.493-513
• /
• 2015

This study is based on the perspective that tasks in local and global contexts are important to raise students' ability to mathematically analyze and solve diverse phenomena and social issues as members of future civil society. Therefore, this study analyzes 880 real world tasks from 13 types of 7th grade textbook based on 2009 revised Curriculum. As a result of analyzing tasks by using 3 types of context category and 9 types of ways as analysis framework and allowing repetitive coding, personal context was most frequent in the context of Younbokhap. In level of Integrated ways of Yungbokhap, sequential model in which other subjects' topics were not directly related to mathematics problem or presented in simple description is most frequent. The result shows that the textbooks are too limited to develop learner's competencies. Through such analysis result, we discuss about the necessity and methods of developing tasks which allow learners to study further in future society and global context and which connect other subjects' knowledge and social issue with mathematics in deeper level.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.6
• /
• pp.491-496
• /
• 2002

Multi-objective Optimization Problems(MOPs) are occur more frequently than generally thought when we try to solve engineering problems. In the real world, the majority cases of optimization problems are the problems composed of several competitive objective functions. In this paper, we introduce the definition of MOPs and several approaches to solve these problems. In the introduction, established optimization algorithms based on the concept of Pareto optimal solution are introduced. And contrary these algorithms, we introduce theoretical backgrounds of Nash Genetic Algorithm(Nash GA) and Evolutionary Stable Strategy(ESS), which is the basis of Co-evolutionary algorithm proposed in this paper. In the next chapter, we introduce the definitions of MOPs and Pareto optimal solution. And the architecture of Nash GA and Co-evolutionary algorithm for solving MOPs are following. Finally from the experimental results we confirm that two algorithms based on Evolutionary Game Theory(EGT) which are Nash GA and Co-evolutionary algorithm can search optimal solutions of MOPs.

• The Journal of Korean Association of Computer Education
• /
• v.20 no.6
• /
• pp.71-81
• /
• 2017

The purpose of this study was to identify affordance usability problems and to improve an interface on the Web-based Diagnosis-Supplement system from learner's perspective in order to promote to be utilized as an user-friendly system. To address those goals, user testings with 6 students from 4th grade of the primary school and 3rd grade of the middle school were conducted and the firstly improved prototypes were suggested. Then, the suggested prototypes were reviewed by experts and finalized. This study has an implication on the methodology of the usability study by evaluating the system through the Hartson's 3 affordance theory. In addition, it contributes to improving pedagogical effects by the fixing serious affordance usability problems related to main tasks of the system such as the test questions and score visualization and matching between system and real world.