• Journal of Korea Game Society
• /
• v.6 no.3
• /
• pp.3-12
• /
• 2006

Path-finding, one of the traditional Game A.I. problems, becomes an important issue to make games more realistic. Due to the limited resources in the computer system, path-finding systems sometimes produce a simplified and unrealistic path. The most relent researches have been focused on the path-finding avoiding only static obstacles. Various moving obstacles are however deployed in real games, a method avoiding those obstacles and producing a smooth path is necessary. In this paper, navigation mesh is used to represent 3D space and its topological characteristics are used for path-finding. Intellectual repulser and attractor are also used to avoid moving obstacles and to find an optimal path. We have evaluated the path produced by the method proposed in this paper and verified its usability in real game.

• Annual Conference on Human and Language Technology
• /
• 1993.10a
• /
• pp.35-44
• /
• 1993

본 논문에서는 의존문법을 이용해 한국어와 같이 비교적 어순이 자유롭고, 지배성분 후위의 특성을 갖는 언어를 효율적으로 분석할 수 있는 오른쪽 우선 분석 방법을 제안한다. 지배가능경로를 이용하면 생성되는 의존 트리의 수를 줄일 수 있음을 보이며, 의존 관계의 검사를 위해서는 지배가능경로 상의 문장 성분만을 조사하면 됨을 보인다. 한국어에 적용한 실험 결과를 보이며, 각 방식에 따른 비교 기준은 생성되는 외존 트리의 갯수와 분석 수행 시간으로 한다. 이때 한국어 문장성분간의 의존관계는 품사 분류에 의한 기본적인 의존 관계만을 이용하며, 격돌이나 의미 속성 등 추가적인 제약 사항은 이용하지 않는다. 오른쪽 우선 구문 분석은 지배가능경로를 이용함으로써 의존 관계의 빠른 검색을 할 수 있었으며, 문장 지배 성찰을 포함하지 않는 부분 의존 트리를 생성하지 않음으로써 생성되는 의존 트리의 수를 줄일 수 있었다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.36 no.2
• /
• pp.302-308
• /
• 2012

Self-configuration network model is to overcome the limits of data communications at sea. As a research for enhancing the connectivity and scalability of data networks at sea using the diversity and heterogeneity of the data networks on land, in this paper, a routing scheme (NLTCR) based on not conventional hop counts but distances to destination ships is introduced. The NLTCR seeks an optimal route by normalized distances to a destination, and transmission characteristics of applications and carriers. Performance is evaluated and compared with those of the max-win (MWR) and the normalized transmission characteristics (NTCR) based schemes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.587-590
• /
• 2020

스마트폰, GPS 장비, 위치 기반 소셜네트워크의 발달로 방대한 이동 경로 데이터 수집이 가능하게 됐다. 이를 통해 다양한 분야에서 GPS 데이터를 가지고 사람의 이동성을 분석하고 POI를 예측하는 기회가 많아졌다. 실생활에서 사람의 이동성은 다양한 상황에 영향을 받지만, 실제 GPS 데이터는 위치, 시간 정보의 수준이다. 따라서 다양한 상황을 내재하는 정보가 사람의 이동성 분석과 POI 예측에 필요하다. 본 논문에서는 POI의 순위, 사용자의 POI 활동, 카테고리 선호도 같은 맥락적 특징을 이용하여 이에 관련된 상황에 맞는 POI 시퀀스를 예측하는 Contextual LSTM 기반 딥러닝 기법을 제안한다. Contextual LSTM은 사람의 이동성에 영향을 주는 시퀀스의 맥락적 특징을 모델에 통합하기 위해 LSTM을 확장한다. 제안된 기법은 HITS 알고리즘과 여러 제약조건 기반으로 추출한 맥락적 특징별로 딥 러닝 모델에 통합하여 각각 POI 시퀀스를 검출했으며, 다양한 맥락적 특징에 대해서 공공 데이터와 수집한 데이터로 평가하였다.

• Journal of Life Science
• /
• v.32 no.3
• /
• pp.249-255
• /
• 2022

Metabolism is essential for survival and reproduction, and there is a metabolic pathways entry in the clusters of orthologous groups of proteins (COGs) database, updated in 2020. In this study, the metabolic pathways of 1309 prokaryotes were analyzed using COGs. There were 822 COGs associated with 63 metabolic pathways, and the mean for each taxon was between 200.50 (mollicutes) and 527.07 (cyanobacteria) COGs. The metabolic pathway composition ratio (MPCR) was defined as the number of COGs present in one genome in relation to the total number of COGs constituting each metabolic pathway, and the number of pathways with 100% MPCR ranged from 0 to 26 in each prokaryote. Among 1309 species, the 100% MPCR pathways included murein biosynthesis associated with cell wall synthesis (922 species); glycine cleavage (918); and ribosomal 30S subunit synthesis (903). The metabolic pathways with 0% MPCR were those involving photosystem I (1263 species); archaea/vacuolar-type ATP synthase (1028); and Na⁺-translocation NADH dehydrogenase (976). Depending on the prokaryote, three to 49 metabolic pathways could not be performed at all. The sequence of most highly conserved metabolic pathways was ribosome 30S subunit synthesis (96.1% of 1309 species); murein biosynthesis (86.8%); arginine biosynthesis (80.4%); serine biosynthesis (80.3%); and aminoacyl-tRNA synthesis (82.2%). Protein and cell wall synthesis have been shown to be important metabolic pathways in prokaryotes, and the results of this study of COGs related to such pathways can be utilized in, for example, the development of antibiotics and artificial cells.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.71-82
• /
• 2003

The shortest path problems(SPP) are critical issues in the military logistics such as the simulation of the War-Game. However, the existing SPP has two major drawbacks, one is its accuracy of solution and the other is for only one solution with focused on just link cost in the military transportation planning models. In addition, very few previous studies have been examined for the multi-shortest path problems without considering link capacity reflecting the military characteristics. In order to overcome these drawbacks, it is necessary to apply the multi-shortest paths algorithm reflecting un-expected military incidents. This study examines the multi-shortest paths in the real networks using Shier algorithm. The network contains both military link capacity and time-based cost. Also, the modes are defined as a platoon(group) rather than unit which is used in most of previous studies in the military logistics. To verify the algorithm applied in this study. the comparative analysis was performed with various sizes and routes of network which compares with Dijkstra algorithm. The major findings of this study are as follows ; 1) Regarding the unique characteristics of the military transportation plan, Shier algorithm, which is applied to this study, is more realistic than Dijkstra algorithm. Also, the time based concept is more applicable than the distance based model in the military logistics. 2) Based on the results from the various simulations of this study the capacity-constraint sections appeared in each scenarios. As a consequence, the alternatives are necessary such as measures for vulnerable area, improvement of vehicle(mode), and reflection of separated-marching column in the military manuals. Finally. the limits and future research directions are discussed : 1) It is very hard to compare the results found in this study. which is used in the real network and the previous studies which is used in arbitrary network. 2) In order to reflect the real military situations such as heavy tanks and heavy equipment vehicles. the other constraints such as the safety load of bridges and/or the height of tunnels should be considered for the future studies.

• Journal of the Korea Society for Simulation
• /
• v.17 no.1
• /
• pp.9-16
• /
• 2008

The sink mobility can request frequent routing change in sensor networks. By active mobility a sink can gather needed information easily so that the network availability will be higher. However, instead static sink system, the connection between sensor nodes and a mobile sink can be changed continuously. That is, the rerouting should be implemented caused by the routing alteration. It is two connection setups for the mobile sink system: the connection from sink to sensor nodes and the connection from sensor nodes to sink. However, sensor nodes actually have many functional limitations. Hence, the low cost scheme will be needed for the connection setup from sensor nodes to the mobile sink. In this paper, we propose an agent scheme to the connection setup from sensor nodes to the mobile sink. The agent scheme provides the reliable setup scheme to the connection by using an agent sector.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.371-374
• /
• 2019

PDA나 휴대폰 단말로 여러 속성의 데이터를 이용하여 사용자에게 필요한 정보를 제공하는 위치기반 서비스는 물류/운송 정보 서비스, 버스/지하철 노선 안내 서비스 등에 사용된다. 여기에서 제공하는 데이터들을 최적 경로를 구하는 외판원 순회문제 (Traveling Salesman Problem)에 사용한다면 더 정확한 경로 서비스 제공이 가능하다. 하지만 데이터의 수가 많아질수록 비교 횟수가 기하급수적으로 늘어나는 외판원 순회 알고리즘의 특성상 일반 단말기에서 활용하기에는 배터리의 제약이 따른다. 본 논문에서는 이와 같은 단점을 해결하기 위해서 최적 경로의 후보군을 줄일 수 있는 스카이라인 질의를 이용하여 n차원 속성에 대한 최적 경로 알고리즘을 제안한다. 실험에서 정확도와 오차율을 통해 제안한 방식의 유용성을 보였으며 기존방식과 연산시간 차이를 비교하여 다차원방식의 효율성을 나타내었다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.23-29
• /
• 2011

In some applications of wireless sensor networks, requirements such as energy efficiency, real-time, and reliable delivery need to be considered. In this paper, we propose a novel routing algorithm for wireless sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In the proposed algorithm, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that the proposed algorithm is suitable for providing energy efficient, real-time, reliable communications.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.1-3
• /
• 2006

최근 정보통신 기술의 발전은 유비쿼터스 컴퓨팅이라는 새로운 정보통신 혁명을 야기하게 되었고, 그로 인해 무선 센서 네트워크의 필요성이 제기되고 있다. 빛, 온도, 습도와 같은 물리적인 정보 수집을 목적으로 가지는 센서 네트워크에서의 라우팅 프로토콜은 기존의 라우팅 프로토콜과는 다른 제약 사항 및 요구 사항을 갖는다. 본 논문에서는 무선 센서 네트워크 환경을 고려한 새로운 라우팅 프로토콜로 Energy-aware Surge 라우팅 프로토콜을 제안 및 구현하였다. Energy-aware Surge 프로토콜은 배터리 리소스에 제약을 갖는 센서 네트워크의 환경을 고려하여, 기존 라우팅 프로토콜과 다르게 센서 노드의 잔여 에너지를 기반으로 계층적인 경로를 설정하게 된다. 성능 검증을 위해 기존 Surge 라우팅 프로토콜을 수정하여 Energy-aware Surge 프로토콜을 구현하였으며, 상용 센서 플랫폼인 MICAz를 이용하여 성능실험을 수행하였다. 성능 실험 및 시뮬레이션 결과를 통해, 제안하는 Energy-aware Surge 라우팅 프로토콜이 무선 센서 노드의 잔여 에너지를 고려하여 패킷의 전달 경로를 적절하게 선택하며, 이를 통해 무선 센서 네트워크의 전체 라이프타임을 효과적으로 증가시키는 것을 확인할 수 있었다.