• The KIPS Transactions:PartB
• /
• 제12B권7호
• /
• pp.823-828
• /
• 2005

Ant Colony System (ACS) applied to the traveling salesman problem (TSP) has demonstrated a good performance on the small TSP. However, in case of the large TSP. ACS does not yield the optimum solution. In order to overcome the drawback of the An for the large TSP, the present study employs the idea of subpath to give more irormation to ants by computing the distance of subpath with length u. in dealing with the large TSP, the experimental results indicate that the proposed algorithm gives the solution much closer to the optimal solution than does the original ACS. In comparison with the original ACS, the present algorithm has substantially improved the performance. By utilizing the proposed algorithm, the solution performance has been enhanced up to $70\%$ for some graphs and around at $30\%$ for averaging over all graphs.

• Journal of the Korea Society of Computer and Information
• /
• 제20권1호
• /
• pp.85-92
• /
• 2015

As computer game maps get more elaborate, path-finding by using $A^*$ algorithm in grid-based game maps becomes bottlenecks of the overall game performance. It is because the search space becomes large as the number of nodes increases with detailed representation in cells. In this paper we propose an efficient pathfinding method in which the computer game maps in a regular grid is converted into the polygon-based representation of the list of vertices and then the visibility information about vertices of polygons can be utilized. The conversion to the polygon-based map does not give any effect to the real-time query process because it is preprocessed offline. The number of visited nodes during search can be reduced dramatically by designing heuristics using visibility information of vertices that make the accuracy of the estimation enhanced. Through simulations, we show that the proposed methods reduce the search space and the search time effectively while maintaining the advantages of the grid-based method.

• Journal of the Korea Society for Simulation
• /
• 제14권3호
• /
• pp.21-31
• /
• 2005

In state-of-the-art games, characters can move in a goal-directed manner so that they can move to the goal position without colliding obstacles. Many path-finding methods have been proposed and implemented for these characters and most of them use the A* search algorithm. When .the map is represented with a regular grid of squares or a navigation mesh, it often takes a long time for the A* to search the state space because the number of cells used In the grid or the mesh increases for higher resolution. Moreover the A* search on the grid often causes a zigzag effect, which is not optimal and realistic. In this paper we propose to use visibility graphs to improve the search time by reducing the search space and to find the optimal path. We also propose a method of taking into account the size of moving characters in the phase of planning to prevent them from colliding with obstacles as they move. Simulation results show that the proposed method performs better than the grid-based A* algorithm in terms of the search time and space and that the resulting paths are more realistic.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제14권1호
• /
• pp.15-19
• /
• 2004

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 number of visiting times and the distance between visited cities. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

• KIPS Transactions on Software and Data Engineering
• /
• 제7권1호
• /
• pp.1-8
• /
• 2018

Software testing is important to determine the reliability of the system, a task that requires a lot of effort and cost. Model-based testing has been proposed as a way to reduce these costs by automating test designs from models that regularly represent system requirements. For each path of model to generate an input value to perform a test, meta-heuristic technique is used to find the test data. In this paper, we propose an automatic test data generation method using a slicing method and a priority policy, and suppress unnecessary computation by excluding variables not related to target path. And then, experimental results show that the proposed method generates test data more effectively than conventional method.

• Journal of Korean Academy of Nursing
• /
• 제25권2호
• /
• pp.244-258
• /
• 1995

아기의 출생은 부모에게 환경적, 신체적, 정신적 부담을 준다. 이렇게 부모가 된 사람들은 부모역할 수행시 어려움을 겪고 있고, 그 중에서도 어머니가 아버지보다 역할수행시 더 많은 어려 움을 겪고 있다고 한다. 본 연구는 생후 8개월 된 아기 어머니들을 대상으로 역할이 론을 토대로 모성역할 획득에 영향을 주는 요인들로 가설적 모형을 구축하고, 이의 적합성을 검정하므로 써 어머니들의 모성역할 획득을 촉진하기 위하여 필요한 간호 정보를 제공하려고 한다. 본 연구는 문헌고찰을 통하여 모성역할 긴장과 모성역할 획득에 영향을 주는 요인으로 일상생활의 시간적 여유, 아기 기질, 사회적 지지가 포함되었고, 모성역할 긴장이 모성역할 획득에 영향을 주는 것으로 이론적 기틀을 구성하였다. 연구도구로는 모성역할 획득 중 모성 정체감을 측정하기 위해 Osgood(Walker et al., 1986a에서 인용)도구, 모성역할 수행을 측정하기 위해 수정보완 된 Gibaud-Wallston(1977)도구와 어머니가 지각한 모아 상호작용정도 도구를 이용하였고, 모성역할 긴장측정에는 수정 보완된 Hobbs(정, 1985에서 인용)도구를 이용하였다. 아기 기질은 수정 보완한 The degree of thor inventory(Mercer, 1986 에서 인용), 남편의 정신적지지 측정은Taylor(Durrett, 1986에서 인용)의 도구를 이용하였고, 일상생활의 시간적 여유, 남편의 신체적 지지 및 주위의 지지측정은 연구자가 개발한 도구를 사용하였다. 1993년 1월부터 1994년 1월까지 대전시 5개 보건소에 등록된 대상자들에게 우편으로 설문지를 보내어 221명이 회수되어 회수율이 약72%였다. 일반적인 서술적 자료 분석은 SPSS PC+ 를 이용하였고, 가설적 모형은PC-LISREL 7.13 (Joreskkog & Sorbom,1988)프로그램을 이용하여 공변량구조분석을 하였다. 연구결과는 다음과 같다. 모성역할 획득에 모성역할 긴장, 일상생활의 시간적 여유, 아기 기질, 사회적 지지가 영향을 주며, 모성역할 긴장에는 일상생활의 시간적 여유, 아기 기질, 사회적지지가 영향을 준다고 설정된 가설적 모형〈Figure 1〉의 분석 결과 전반적 지수는 자유도 23에 카이자승치 60.17, GFI와 AGFI의 값은 .944, .891였고, NFI와 NNFI의 값은 .8823, .7932 이었다. 그러나 세부적 지수 중 모성역할 긴장에서 모성역할획득으로의 경로, 일상생활의 시간적 여유에서 모성역할 획득으로의 경로, 아기 기질에서 모성역할 획득으로의 경로의 고정지수가 절대치 2에 미치지 못하여, 세 경로계수를 영(0)으로 고정시킬 필요가 있었다. 따라서 더 간명하며 부합도가 좋은 모형을 찾기 위하여 가설적모형에서 고정지수가 낮은 경로 부터 고정시켜 나가 세경로(모성 역할 긴장에서 모성역할 획득, 일상생활의 시간적 여유에서 모성역할 획득, 아기 기질에서 모성역할획득)를 고정시킨 수정 모형 의 PFI (간명도)가 .5986으로서 가설적모형의 PFI(간명도) .5636보다 커 부합도 를 손상하지 않고 더 간명한 모형으로 나타났다. 수정모형 의 고정 지수를 살펴 본 결과 절대 치 2에 미치지 못하는 경로는 나타나지 않았다. 공변량구조분석 결과 나타난 변인간의 관계를 보면 가) 모성역할 긴장은 사회적 지지가 많을수록(Lisrel Estimates=-1.591), 아기 기질이 순하다고 생각할수록(Lisrel Estimates=-.266), 일상생활의 시간적 여유가 많을수록(Lisrel Estimstes=-1.771) 낮았고, 나) 모성역할 획득은 사회적 지지가 많을수록(Lisrel Estimates=1.120) 잘 되었다.

• Journal of Korea Multimedia Society
• /
• 제6권3호
• /
• pp.419-428
• /
• 2003

Several methods have been studied to prune the parasitic branches that cause unfortunately from thinning a shape to get its skeleton. We found that the symmetric path finding method was most efficient because it followed the boundary pixels of the shape just once. In this paper, its extended method is proposed to apply to removing the noise branches that protrude out of the boundary of a segmented or extracted shape in a given image. The proposed method can remove a noise branch with one-pixel width and also remove the noise branch that includes a round shape called a noise blob. The method uses a 4-8-directional boundary-following technique to determine symmetric paths and finds noise branches with noise blobs by detecting quasi-symmetric paths. Its time complexity is a linear function of the number of boundary pixels. Interactively selectable parameters are used to define various types of noise branches flexibly, which are the branch - size parameter and the blob-size parameter. Experimental results for a practical shape and various artificial shapes showed that the proposed method was very useful for simplifying the shapes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제19권6호
• /
• pp.1169-1181
• /
• 1994

The Gamma Network contains the redundant path thereby is provides the ability to tolerate the faults occured. However, in case of identical the source and destination number, only a single path exists, therefore there is no way of connecting for the fault situation. In addition, for the dynamic packet routing strategy, it shoed perform backtracking analysis to find the redundant path. In this paper we proposed a new network, Dual Network, to resolve these drawbacks. The Dual Network uses switching elements about the same network size as the Gamma Network except first and last stage, and it is more efficient than the Gamma Network, for it has reduced the switching stage by one. And since is used a destination tag routing scheme for the control algorithm, it has on advantage of becoming of simpler and faster routing control.

• Journal of Korean Society for Geospatial Information Science
• /
• 제20권2호
• /
• pp.23-29
• /
• 2012

Existing pedestrian and evacuation models generally seek to find locally optimal solutions for the shortest or the least time paths to exits from individual locations considering pedestrian's characteristics (eg. speed, direction, sex, age, weight and size). These models are not designed to produce globally optimal solutions that reduce the total evacuation time of the entire pedestrians in a building when all of them evacuate at the same time. In this study, we suggest a globally optimal model for indoor pedestrian evacuation to minimize the total evacuation time of occupants in a building considering different distributions of them. We used the genetic algorithm, one of meta-heuristic techniques because minimizing the total evacuation time can not be easily solved by polynomial expressions. We found near-optimal evacuation path and time by expressing varying pedestrians distributions using chromosomes and repeatedly filtering solutions. In order to express and experiment our suggested algorithm, we used CA(cellular automata)-based simulator and applied to different indoor distributions and presented the results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제28권1B호
• /
• pp.71-79
• /
• 2003

As the traffic grows rapidly in the Internet, the QoS guarantee of the flows and the traffic engineering problems have become very important issues. MPLS has more advantages to solve the problems than existing IP routing because of its use of multiple paths between the source and destination pairs Particularly, the availability of Constraint-based Shortest Path First(CSPF) algorithm and explicit route in MPLS made the problem referred above to be solved efficiently. However, the CSPF algorithm has the characteristic of selecting the shortest path of all paths which meet the traffics' QoS constraints Therefore, even though there are alternative paths to route traffic, alternate QoS paths may not be found and best-effort traffic will be dropped during congestion period In this paper, we present the network resource optimization method related to the traffic engineering by using load balancing through routing in MPLS network.