• Journal of Korea Game Society
• /
• v.13 no.6
• /
• pp.27-34
• /
• 2013

This paper analyzes the behaviour of a prey to avoid the pursuit of a predator at predator-prey relationship to be appeared in the collective behavior of animals. One of the methods to avoid the pursuit of a predator is to rotate quickly when a predator arrives near to it. At that moment, a critical distance and a rotating angular are very important for the prey in order to survive from the pursuit, where the critical distance is the distance between the predator and the prey just before rotation. In order to analyze the critical distance and the rotating angular, this paper introduces the energy for a predator which it has at starting point of the chase and consumes during the chase. Through simulations, we can know that the rotating angle for a prey to survive from the pursuit is increased when the critical distance is shorter and when the ratio of predator's mass and prey's mass is also decreased. The results of simulations are the similar phenomenon in nature and therefore it means that the method to analyze in this paper is correct.

• Journal of Korea Game Society
• /
• v.18 no.1
• /
• pp.125-134
• /
• 2018

This paper presents a practical method to efficiently extract the rotational part of a $3{\times}3$ matrix that changes continuously in time. This is the key technique in the corotational FEM and the shape matching deformation popular in physics-based dynamic deformation. Recently, in contrast to the traditional polar decomposition methods independent of time, an iterative method was proposed that formulates the rotation extraction in a physics-based way and exploits an incremental representation of rotation. We develop an optimization method that reduces the number of iterations under the assumption that the maximum magnitude of the incremental rotation vector is limited within ${\pi}/2$. Realistic simulation of dynamic deformation employs a sufficiently small time step, and thus this assumption is not problematic in practice. We demonstrate the efficiency and practicality of our method in various experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.11
• /
• pp.652-659
• /
• 2014

In this paper, we propose an access point selection method for mobile users in LTE-femtocell system. In wireless communication system, users want to receive good data service. In LTE-femtocell system, if users move a little, users can experience different data service. The proposed access point selection method help that if users move a little, users obtain the high capacity and that user selects access point that other user have not selected much and so obtains higher data service. We simulated in order to prove performance of the proposed access point selection metod. Simulation results show that in a situation that users are concentrated in order to obtain better data service users are seen scattered look. As a result, we confirm that the proposed access point selection method provides good data service to users.

• Journal of Korea Game Society
• /
• v.7 no.2
• /
• pp.21-32
• /
• 2007

It is significant to simulate scattering of light within media for realistic image synthesis; however, this requires costly computation. This paper introduces a practical image-space approximation technique for interactive subsurface scattering. We use a general two-pass approach, which creates transmitted irradiance samples onto shadow maps and computes illumination using the shadow maps. We estimate single scattering efficiently using a method similar to common shadow mapping with adaptive deterministic sampling. A hierarchical technique is applied to evaluate multiple scattering, based on a diffusion theory. We further accelerate rendering speed by tabulating complex functions and utilizing level of detail. We demonstrate that our technique produces high-quality images of animated scenes with blurred shadow at hundreds frames per second on graphics hardware. It can be integrated into existing interactive systems easily.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.53-62
• /
• 2007

Although radiosity can represent diffuse reflections of the object surfaces by modeling energy exchange in 3D space, there are some restrictions for real-time applications because of its computation loads. Therefore, GPU(Graphics Processing Unit) based radiosity algorithms have been presented actively to improve its rendering performance. We implement the progressive refinement radiosity on GPU by G. Coombe in 3D scene that is constructed with HDR(High Dynamic Range) radiance map. This radiosity method can generate a photo-realistic rendering image in 3D space, where the synthetic objects were illuminated by the environmental light sources. In the simulation results, the rendering performance is analyzed according to the resolution of the texel in the environmental map and mipmaping. In addition, we compare the rendering results by our method with those by the incremental radiosity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4661-4680
• /
• 2016

Cognitive radio (CR) technology is an effective solution to the spectrum scarcity issue. Collaborative spectrum sensing is known as a promising technique to improve the performance of spectrum sensing in cognitive radio networks (CRNs). However, collaborative spectrum sensing is vulnerable to spectrum data falsification (SSDF) attack, where malicious users (MUs) may send false sensing data to mislead other secondary users (SUs) to make an incorrect decision about primary user (PUs) activity, which is one of the key adversaries to the performance of CRNs. In this paper, we propose a coalition based malicious users detection (CMD) algorithm to detect the malicious user in CRNs. The proposed CMD algorithm can efficiently detect MUs base on the Geary'C theory and be modeled as a coalition formation game. Specifically, SSDF attack is one of the key issues to affect the resource allocation process. Focusing on the security issues, in this paper, we analyze the power allocation problem with MUs, and propose MUs detection based power allocation (MPA) algorithm. The MPA algorithm is divided into two steps: the MUs detection step and the optimal power allocation step. Firstly, in the MUs detection step, by the CMD algorithm we can obtain the MUs detection probability and the energy consumption of MUs detection. Secondly, in the optimal power allocation step, we use the Lagrange dual decomposition method to obtain the optimal transmission power of each SU and achieve the maximum utility of the whole CRN. Numerical simulation results show that the proposed CMD and MPA scheme can achieve a considerable performance improvement in MUs detection and power allocation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1363-1369
• /
• 2008

As game and character animation industries are growing, techniques for reproducing realistic character behaviors have been required in various fields. Therefore, intensive researches have been performed in order to find various methods for realistic character animation. The most common approaches to character animation involves tedious user input method, simulation with physical laws based on dynamics, and measurement of actors' behaviors with input devices such as motion capture system. These approaches have their own advantages, but they all have common disadvantage in character control. In order to provide users with convenient control, the realistic animation must be generated with high-level parameters, and the modification should also be made with high-level parameters. In this paper we propose techniques for developing an automated character animation tool which operates with high-level parameters, and introduce techniques for developing actual games by utilizing this tool.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.405-408
• /
• 2016

Games like Go, Chess, Janggi have helped to brain development of the people. These games are developed by computer program. And many algorithms have been developed to allow myself to play. The person winning chess program was developed in the 1990s. But game of go is too large number of cases. So it was considered impossible to win professional go player. However, with the use of MCTS(Monte Carlo Tree Search) and CNN(Convolutional Neural Network), the performance of the go algorithm is greatly improved. In this paper, using CNN and MCTS were proceeding development of go algorithm. Using the manual of go learning CNN look for the best position, MCTS calculates the win probability in the game to proceed with simulation. In addition, extract pattern information of go using existing manual of go, plans to improve speed and performance by using it. This method is showed a better performance than general go algorithm. Also if it is receiving sufficient computing power, it seems to be even more improved performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.99-106
• /
• 2023

In this paper, we propose subregion-based area of interest management techniques for MMORPG(massively multiplayer online role playing games) integrating P2P(peer-to-peer) networking and cloud computing. For the crowded region, the proposed techniques partition it into several subregions and assign a player to manage each subregion as a coordinator. These techniques include a load balancing mechanism which regulates communication and computation overhead of such player below the specified threshold. We also provide a mechanism for satisfying the criterion, where subregions overlapped with each player's view must be switched quickly and seamlessly as the view moves around in the game world. In the proposed techniques where an efficient provisioning of resources is realized, they relieve a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the players effectively. Simulation results show that the MMORPG based on cloud and P2P architecture can reduce the considerable bandwidth at the server compared to the client server architecture as the available resources grow with the number of players in crowding or hotspots.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.1-9
• /
• 2009

In virtual environments, such as computer game and animation, we need to enhance naturalness of crowd simulation. So, we propose a method to generate dynamically moving crowd patterns by applying emotional factors to the individual characters of a crowd in the determination of their behavior. The proposed method mimics human behavior and controls each character in a group to decide its own path according to its individual status. And it is able to generate various moving patterns as a result of letting the individuals go to another group depending upon their conditions. In this paper, some temperament and feeling factors are defined and determination rules for calculating the emotional status are also proposed. Moreover we use a fuzzy theory for accurate representation of the ambiguous expressions such as feeling bad, feeling good and so on. Our experiments show that the suggested method can simulate virtual crowd in more natural and diverse ways.