• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1013-1014
• /
• 2008

In this paper, we propose a new method of generating 3D face by using single frontal face image and 3D generic face model. By using active appearance model (AAM), the control points among facial feature points were localized in the 2D input face image. Then, the transform parameters of 3D generic face model were found to minimize the error between the 2D control points and the corresponding 2D points projected from 3D facial model. Finally, by using the obtained model parameters, 3D face was generated. We applied this 3D face to 3D game framework and found that the proposed method could make a realistic 3D face of game user.

• Journal of Engineering Education Research
• /
• v.24 no.4
• /
• pp.41-51
• /
• 2021

This paper is to study whether cooperative learning applying group games becomes a teaching method that can increase interest and participation in class in calculus and the effect of the number of students. To increase interest and participation in class, the researcher conducted cooperative learning by applying smartphones and various game tools to group games. The consequences of the study confirmed that students' interest and participation in the class increased regardless of their mathematics basics. Therefore, it is expected that the calculus which is difficult for students to understand will be more easily approached by cooperative learning applying group games in the future.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.2
• /
• pp.296-303
• /
• 2011

This paper describes a game called the "robot hopscotch game" which uses mobile robots. In this game, a mobile robot moves on a board which consists of a number of square cells. This is similar to the usual hopscotch game in which a human player hops through a course on the ground. In the robot hopscotch game, each cell has a visual light communication unit. The unit sends identification signal and the robot which moves over the cell receives the signal for location recognition. In the game, a human player or a human operator competes with a robot or other human player on how accurately and fast they move to a goal location passing through the given way point cells. People played the game at the RoboWorld 2008 which was held at COEX Seoul, on 16th to 20th of October 2008. The replies to the questionnaire to the users show that users have interests on the game and expect further expansion of robot use though they are not in favor of the robot's outlook and they feel inconvenience on manipulation of the robot.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.4
• /
• pp.463-474
• /
• 2004

Game theory is a method of mathematical analysis developed to study the decision making process. In 1928, Von Neumann mathematically proved that every two-person, zero-sum game with many pure finite strategies for each player is deterministic. In the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) as introduced by Maynard Smith in 1982. Keeping pace with these game theoretical studies, the first computer simulation of coevolution was tried out by Hillis. Moreover, Kauffman proposed the NK model to analyze coevolutionary dynamics between different species. He showed how coevolutionary phenomenon reaches static states and that these states are either Nash equilibrium or ESS in game theory. Since studies concerning coevolutionary phenomenon were initiated, there have been numerous other researchers who have developed coevolutionary algorithms. In this paper we propose a new coevolutionary algorithm named Game theory based Coevolutionary Algorithm (GCEA) and we confirm that this algorithm can be a solution of evolutionary problems by searching the ESS. To evaluate this newly designed approach, we solve several test Multiobjective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by the coevolutionary algorithm and analyze the optimization performance of our algorithm by comparing the performance of our algorithm with that of other evolutionary optimization algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1379-1397
• /
• 2013

We consider a system where a licensed radio spectrum is shared by multiple primary users(PUs) and secondary users(SUs). As the spectrum of interest is licensed to primary network, power and channel allocation must be carried out within the cognitive radio network so that no excessive interference is caused to PUs. For this system, we study the joint beamforming and power allocation problem via game theory in this paper. The problem is formulated as a non-cooperative beamforming and power allocation game, subject to the interference constraints of PUs as well as the peak transmission power constraints of SUs. We design a joint beamforming and power allocation algorithm for maximizing the total throughput of SUs, which is implemented by alternating iteration of minimum mean square error based decision feedback beamforming and a best response based iterative power allocation algorithm. Simulation results show that the algorithm has better performance than an existing algorithm and can converge to a locally optimal sum utility.

• Journal of Korea Game Society
• /
• v.3 no.1
• /
• pp.18-23
• /
• 2003

Internal organs are in a game paduk[go] to play on a printing, and a poker, Korean playing cards having cards we. And I am with all kinds of electronic amusements to do a computer with a partner and baseball, soccer, golf, tennis, several hundred to enjoy in a stadium. Most games except a computer game are local, and a case to receive a courtship is in a game during this because I need time, personnel (the other party)? and a game tool. But a computer game is single, and a game is possible, and a number for the merit that can easily play a game by an offer of all tools is, and for this reason a lot of games to enjoy in a computer please be, and it has been transplanted. I do I in order to announce that interface of a game studied a problem and an improvement plan to have let there be a few I (to game interface) if a game is ported with a computer in this study by this.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.2
• /
• pp.247-255
• /
• 2004

The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjective Optimization Problems (MOPs). Though this approach was further developed leading to numerous applications, these applications are based on Pareto ranking and employ the use of the fitness sharing function to maintain diversity. Another scheme for solving MOPs has been presented by J. Nash to solve MOPs originated from Game Theory and Economics. Sefrioui introduced the Nash Genetic Algorithm in 1998. This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm. First, we will investigate the validity of our co-evolutionary approach to solve MOPs. That is, we will demonstrate how the evolutionary game can be embodied using co-evolutionary algorithms and also confirm whether it can reach the optimal equilibrium point of a MOP. Second, we will evaluate the effectiveness of our approach, comparing it with other methods through rigorous experiments on several MOPs.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.66-68
• /
• 2017

본 논문에서는 한화 109조 원을 돌파하는 전 세계 게임 시장에서 매출의 중요성에 대해 제시한다. 게임을 홍보할 수 있는 수단인 인터넷 방송과 게임 구매를 결합시킨 ESD 방식에 대한 조사 내용 및 분석한 결과도 제시한다. 이전에 존재하지 않았던 구매방식으로 사용자가 더욱 편리한 방법으로 게임을 구매하여 게임의 판매 수익을 증대시키고 인터넷 방송과 스트리머의 효율성을 높여 게임 개발사, 유통사, 스트리머, 사용자 모두 상부상조하여 부가가치까지 얻을 수 있는 방법도 함께 제시한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.36-47
• /
• 2009

There exists RFID reader-to reader frequency which can not recognize tag in dense reader nude because the interference causes low SIR. To solve this frequency, the many algorithms based on TDM have been proposed. But the most of existing algorithms not obtain the optimal time allocation but propose heuristic scheduling algorithm. In this paper, we apply game theory which deals with interest between players of game to RFID reader-to reader interference and analyze the time allocation problem of reader based on TDM in terms of cooperative game which the players bind agreements using Nash Bargaining Solution(NBS) and non-cooperative game which the players do not bind agreements using Nash Equilibrium(NE). The applied results show that in dense reader mode, NBS of cooperative game is superior to NE of non-cooperative game and present optimal time allocation in dense reader mode.

• Journal of Korea Game Society
• /
• v.21 no.3
• /
• pp.53-66
• /
• 2021

This study explored how the network structure in terms of social interactions among users via a mobile game has changed longitudinally. The main findings are summarized as follows. First, in-game events are likely to increase the social interactions of users. Second, some power users played key roles in the game users' network and tend to make a large sub-group for interacting among users. Third, it is suggested that the analysis of network structure among users can be a useful tool for monitoring which in-game events are effective and how they are mutually interconnected for collaboration.