• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.55-61
• /
• 2020

In this paper, we present a novel approach to efficiently control the location of NPC(Non-playable characters) in the interactive virtual world such as game, virtual reality. To control the NPC's movement path, we first calculate the main trajectory based on the user's path, and then move the NPC based on the weight map. Our method constructs automatically a navigation mesh that provides new paths for NPC by referencing the user trajectories. Our method enables adaptive changes to the virtual world over time and provides user-preferred path weights for smartagent path planning. We have tested the usefulness of our algorithm with several example scenarios from interactive worlds such as video games, virtual reality. In practice, our framework can be applied easily to any type of navigation in an interactive world.

• The Mathematical Education
• /
• v.62 no.3
• /
• pp.417-433
• /
• 2023

In the 2022 revised mathematics curriculum, a new content on 'Movement of a point' was added. Therefore, this study analyzed the contents of the movement of a point presented in Finnish mathematics textbooks as elements of spatial orientation. Analysis was conducted by dividing it into direction, distance, and route. As a result of the study, in Finnish textbooks, directions were expressed in various ways, such as linguistic, visual, and coded expressions. In the case of distance, activities to move as much as the distance or compare the distance were presented using the number of cells, length, steps, coordinate points, ratio, etc. In the case of routes, activities such as moving according to instructions, making routes, finding the route, and modifying the route were presented using unconditional movement and conditional movement. In particular, the movement of a point could be linked not only to various mathematical content areas such as 'number and arithmetic' and 'change and relationship', but also to digital literacy and programming education. Knowing that the movement of a point can be presented in various ways according to the direction, distance, and route, it is expected that it can be used to organize the contents of the 2022 revised mathematics textbook.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.49-56
• /
• 2005

Reuse of software is the process of developing software system which does not develop all modules newly but construct system by using existing software modules. Object oriented concept introduces dynamic binding and polymorphism, which increases number of executable Paths. In this case static analysis of source code is not useful to find executable path. These concepts occur new Problems in retesting. Tradition testing method can not cover complex relations such as inheritance, message Passing and instance of and can not apply on object oriented retesting. we propose the method to reduce the number of methods and classes to be retested in associated class relation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.59-62
• /
• 2005

웹 상에서 XML 로 기술된 데이터가 증가하고, 이를 이용하여 의미 있는 데이터를 검색하는 것의 중요성이 커지고 있다. 웹 상에서 더 좋은 검색 성능을 보이기 위해 XML 질의 결과를 캐쉬하는 방법에 관한 연구들과 캐쉬의 저장 공간과 다양한 질의를 캐쉬에 저장하는 것에 한계가 있기 때문에 캐쉬 교체 기법에 관한 연구들이 있었다. 기존의 XML 캐쉬 교체 정책에는 질의 결과를 교체 단위로 하는 방법과 질의 결과 내의 각 경로들을 교체 단위로 하는 방법이 있는데, 첫번째 방법은 효율이 상대적으로 낮고 두번째 방법은 높은 효율에 비해 교체 연산을 수행하는 부담(overhead)이 크다는 단점이 있었다. 본 논문에서는 위 두 방법의 단점을 해결하기 위해 2 단계로 교체 희생자를 선택하는 방법을 제시한다. 질의 결과들 중에서 교체 희생자를 찾고, 그 희생자 내의 모든 경로들 중에서 다시 교체 희생자를 찾는다. 이는 각 질의 내의 경로가 교체 희생자가 되어 캐쉬 효율을 향상 시키고, 질의 결과에 대해 먼저 교체 대상을 찾으므로 교체 희생자를 찾기 위한 연산을 수행하는 부담을 줄인다. 또한 캐쉬 적중률, 최근 접근 시간, 인출 지연 시간, 객체 크기를 고려하여 교체 희생자를 선택하는 교체 함수를 제시한다. 가상의 시맨틱 데이터에 대한 캐쉬 교체 시스템을 구현하여 본 논문에서 제시한 교체 기법과 교체 함수를 평가한 결과를 기술한다.

• Journal of Korea Game Society
• /
• v.15 no.4
• /
• pp.157-168
• /
• 2015

The difficulty of the game is closely related to the fun of the game. However, it is not easy to determine the appropriate level of difficulty of the game. In most cases, human playtesting is required. But even so, it is still hard to quantitatively evaluate difficulty of the game. Thus, if we perform quantitative evaluation of the difficulty automatically it will be very helpful in game developments. In this paper, we use a path finding algorithm to evaluate difficulty of exploration in a game level. Exploration is a basic attribute in common video games and it represents the overall difficulty of the game level. We also optimize the proposed evaluation algorithm by using previous exploration histories when available area in an game level is dynamically expanded and the new search is required.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.763-773
• /
• 1998

본논문은 TCP/IP를 사용하는 기존의 LAN상에 이동 호스트들이 셀의 형태로 덧붙여진 환경에서 이동 호스트와 고정 호스트간의 지속적인 세션을 지원하는 개선된 IP 체계인 SIMIP을 제안하였다. 이동형 프로토콜 설계시 라우팅 최적화가 매우 중요한 항목이고 이는 이동 호스트의 위치정보 관리방법과 직접적인 관계가 있다. 기존의 아이비엠과 마쓰시다 제안은 이를 집중화하였으며 콜롬비아와 소니제안은 이를 분산화하였다. MH 위치정보를 집중화하면 트라이앵글 문제로 인해 최적의 라우팅 경로를 지원할 수 없으며 집중화된 라우터의 실패 발생시는 위험도가 매우 크다. 반면에 분산화하면 위의 문제들은 해결되지만 캡슐화되는 주소를 찾기위해 CACH 또는 AMT와 같은 복잡한 기법이 요구된다. SIMIP은 MH위치정보를 DMR에 집중화하였으나 DMR 실패 발생시는 복수의 GMR중에서 하나가 자동적으로 DMR로 대체되어 위험도를 최소화시켰고, 'DMR 경로변경'에 의해 최적의 라우팅 경로를 지원하였다는 점에서 다른 제안들과 차이가 있다. 이동에 따른 주소변경을 해결하기 위해 가상네트워크 기법을 적용하였고, 이동 호스트로의 데이터 송신시 디폴트 라우팅 개념을 이용하였고, 이동라우터간 터널링에 IPIP 캡슐화를 사용하였다. SIMIP은 다른 제안에 비해 실용성있고, 신뢰성이 강하며, 구현이 용이하므로 산업계에서 활용가치가 있으리라본다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.4
• /
• pp.687-699
• /
• 2021

When a vulnerability occurs in a program, it is documented and published through CVE. However, some vulnerabilities do not disclose the details of the vulnerability and in many cases the source code is not published. In the absence of such information, in order to find a vulnerability, you must find the vulnerability at the binary level. This paper aims to find out-of-bounds read vulnerability that occur very frequently among vulnerability. In this paper, we design a memory area using memory access information appearing in binary code. Out-of-bounds Read vulnerability is detected through the designed memory structure. The proposed tool showed better in code coverage and detection efficiency than the existing tools.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.663-672
• /
• 2005

This Paper Proposes an approach that removes the redundancy of Path information and uses an inverted index, as an efficient way to store a large volume of XML documents and to retrieve wanted information from there. An XML document is decomposed into nodes based on its tree structure, and stored in relational tables according to the node type, with path information from the root to each node. The existing methods using path information store data for all element paths, which cause retrieval performance to be decreased with increased data volume. Our approach stores only data for leaf element path excluding internal element paths. As the inverted index is made by the leaf element path only, the number of posting lists by key words become smaller than those of the existing methods. For the storage and retrieval of U data, our approach doesn't require the XML schema information of XML documents and any extension of relational database. We demonstrate the better performance of on approach than the existing approaches within the scope of our experiment.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.443-448
• /
• 2013

Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the total frequency of visits of the currently selected node in the previous iteration. I used the ACS algoritm using subpath for search. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.2D
• /
• pp.147-154
• /
• 2008

A variety of activity happens around the sidewalk in the city. Particularly, a large variety of activity happens in shopping area, but it causes an obstruction of economical revitalization since the pedestrians require time and cost to find what they want. So, this study will develop the path searching method to minimize the economical loss of shoppers by providing the significant path and supporting the walking movement. Firstly, consider existing network expression techniques and approach three points which are physical and environmental factor, the recognition of the pedestrians' space when changing the direction, and the recognition of restriction of vision and accessibility. Try to design the network DB and simulate the algorithm. As a result, it is now possible to do the path searching that considers variety of recognition factors and show the method how to make the path-searching algorithm for pedestrian.