• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.375-381
• /
• 2005

Usually genetic algorithms are used to design optimal system. However the performance of the algorithm is determined by the fitness function and the system environment. It is expected that a co-evolutionary algorithm, two populations are constantly interact and co-evolve, is one of the solution to overcome these problems. In this paper we propose three types of co-evolutionary algorithm to solve GA-Hard problem. The first model is a competitive co-evolutionary algorithm that solution and environment are competitively co-evolve. This model can prevent the solution from falling in local optima because the environment are also evolve according to the evolution of the solution. The second algorithm is schema co-evolutionary algorithm that has host population and parasite (schema) population. Schema population supply good schema to host population in this algorithm. The third is game model-based co-evolutionary algorithm that two populations are co-evolve through game. Each algorithm is applied to visual servoing, robot navigation, and multi-objective optimization problem to verify the effectiveness of the proposed algorithms.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.639-642
• /
• 2003

This paper presents a method for evaluating the mixed nash equilibria of the Cournot model for N-Gencos. in wholesale electricity market. In the wholesale electricity market, the strategies of N-Genco. can be applied to the game model under the conditions which the Gencos. determine their stratgies to maximize their benefit. Generally, the Lemke algorithm is evaluated the mixed nash equlibria in the two-player game model. However, the necessary condition for the mixed equlibria of N-player are modified as the necessary condition of N-1 player by analyzing the Lemke algorithms. Although reducing the necessary condition for N-player as the one of N-1 player, it is difficult to and the mixed nash equilibria participated two more players by using the mathmatical approaches since those have the nonlinear characteristics. To overcome the above problem, this paper presents the generalized necessary condition for N-player and proposed the object function to and the mixed nash equlibrium. Also, to evaluate the mixed equilibrium through the nonlinear objective function, the Particle Swarm Optimization (PSO) as one of the heuristic algorithm are proposed in this paper. To present the mixed equlibria for the strategy of N-Gencos. through the proposed necessry condition and the evaluation approach, this paper proposes the mixed equilibrium in the cournot game model for 3-players.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.436-438
• /
• 2019

Air hockey robots are machine vision systems that allow users to play hockey balls through the camera. The position detection of the hockey ball is realized by using the color information of the ball using OpenCV library. It senses the position of the hockey ball, predicts its trajectory, and sends the result to the ARM Cortex-M board. The ARM Cortex-M board controls a 2- Axis Cartesian Coordinate Robot to run an air hockey game. Depending on the strategy of the air hockey robot, it can operate in defensive, offensive, defensive and offensive mode. In this paper, we describe a vision system development and trajectory prediction system and propose a new method to control a biaxial orthogonal robot in an air hockey game.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.463-468
• /
• 2016

The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach.

• Journal of Intelligence and Information Systems
• /
• v.26 no.3
• /
• pp.37-50
• /
• 2020

Information security has become an important issue in the world. Various information and communication technologies, such as the Internet of Things, big data, cloud, and artificial intelligence, are developing, and the need for information security is increasing. Although the necessity of information security is expanding according to the development of information and communication technology, interest in information security investment is insufficient. In general, measuring the effect of information security investment is difficult, so appropriate investment is not being practice, and organizations are decreasing their information security investment. In addition, since the types and specification of information security measures are diverse, it is difficult to compare and evaluate the information security countermeasures objectively, and there is a lack of decision-making methods about information security investment. To develop the organization, policies and decisions related to information security are essential, and measuring the effect of information security investment is necessary. Therefore, this study proposes a method of constructing an investment portfolio for information security measures using game theory and derives an optimal defence probability. Using the two-person game model, the information security manager and the attacker are assumed to be the game players, and the information security countermeasures and information security threats are assumed as the strategy of the players, respectively. A zero-sum game that the sum of the players' payoffs is zero is assumed, and we derive a solution of a mixed strategy game in which a strategy is selected according to probability distribution among strategies. In the real world, there are various types of information security threats exist, so multiple information security measures should be considered to maintain the appropriate information security level of information systems. We assume that the defence ratio of the information security countermeasures is known, and we derive the optimal solution of the mixed strategy game using linear programming. The contributions of this study are as follows. First, we conduct analysis using real performance data of information security measures. Information security managers of organizations can use the methodology suggested in this study to make practical decisions when establishing investment portfolio for information security countermeasures. Second, the investment weight of information security countermeasures is derived. Since we derive the weight of each information security measure, not just whether or not information security measures have been invested, it is easy to construct an information security investment portfolio in a situation where investment decisions need to be made in consideration of a number of information security countermeasures. Finally, it is possible to find the optimal defence probability after constructing an investment portfolio of information security countermeasures. The information security managers of organizations can measure the specific investment effect by drawing out information security countermeasures that fit the organization's information security investment budget. Also, numerical examples are presented and computational results are analyzed. Based on the performance of various information security countermeasures: Firewall, IPS, and Antivirus, data related to information security measures are collected to construct a portfolio of information security countermeasures. The defence ratio of the information security countermeasures is created using a uniform distribution, and a coverage of performance is derived based on the report of each information security countermeasure. According to numerical examples that considered Firewall, IPS, and Antivirus as information security countermeasures, the investment weights of Firewall, IPS, and Antivirus are optimized to 60.74%, 39.26%, and 0%, respectively. The result shows that the defence probability of the organization is maximized to 83.87%. When the methodology and examples of this study are used in practice, information security managers can consider various types of information security measures, and the appropriate investment level of each measure can be reflected in the organization's budget.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.178-180
• /
• 2017

Virtualization was devised as a resource management and optimization technique for mainframes having scaleless computing capabilities. The resource scaling can be done with a variety of virtualization methods such as VM creation, deletion, and migration. In this paper, we designed to achieve the load balancing, several load balancing schemes such as Minimum Execution Time (MET), Min-Min scheduling, Cloud Analyst have been reported in literature in addition to a comprehensive study on First Come First Serve (FCFS) and Round-robin schedulers.

• Journal of Multimedia Information System
• /
• v.6 no.4
• /
• pp.179-184
• /
• 2019

This paper introduces a study for procedurally generating the behavior of objects in a virtual environment at runtime. This study was initiated to enable the behavioral model of objects in virtual reality applications to evolve in response to user behavior at runtime. Our approach is to describe the behavior of an object as a behavior tree, and to make a node of the behavior tree change to another type if a certain condition is satisfied. We defined four types of node changes: "parameterized", "probabilistic", "alternate", and "variant". We experimented with a virtual environment that includes a variety of simple procedural elements to explore the possibilities of our approach. As a result of the implementation, if an optimization algorithm that can select and apply the optimized procedural elements in response to the user's behavior is complemented, it is confirmed that more intelligent objects and agents can be implemented in virtual reality applications.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.4
• /
• pp.396-402
• /
• 2005

In an electricity market with imperfect competition, participants devise bidding plans and transaction strategies to maximize their own profits. The market price and the quantity are concerned with the operation reserve as well as the bidding system and demand curves in an electricity market. This paper presents a market model combined by an energy market and an operating reserve market. The competition of the generation producers in the combined market is formulated as a gaming of selecting bid parameters such as intersections and slopes in bid functions. The Nash Equilibrium (NE) is analyzed by using bi-level optimization; maximization of Social Welfare (SW) and maximization of the producers' profits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.225-230
• /
• 2010

In this paper, we propose a new power control scheme to maximize the network throughput with fairness provisioning. Based on the game model, decisions in the scheme cooperatively and collaborate with each other to satisfy efficiency and fairness requirements. The simulation results demonstrate that proposed scheme has excellent network performance, while other schemes cannot offer such an attractive performance balance.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.349-352
• /
• 2004

In this paper, we propose a newly energy-efficient routing protocol, which is called Maximum Utility Routing(MUR), in mobile ad hoc networks (MANETs) so as to investigate the minimum energy and maximum lifetimes issues together. We present a utility-based framework so as to meet various incompatible constraints simultaneously and fairly. To explore this issue, we use the concepts and mathematics of microeconomics and game theory. Though simulation results, we show that our routing scheme has much better performance especially in terms of network efficiency, network lifetime, and average power consumption.