• 한국정보과학회논문지:시스템및이론
• /
• 제26권8호
• /
• pp.949-956
• /
• 1999

이 논문에서는 ATM (Asynchronous Transfer Mode) 방식의 초고속망의 장애 발생 시 이용자 연결의 QoS (Quality of Service)를 고려하여 복구할 수 있게 하는 보호 망 설계 방안을 제시한다. 제시한 설계 방안에 기초한 비용과 복구 특성을 분석과 모의 실험을 통해 알아본다. 제안하는 망에서의 복구는 분리 VP 그룹 (Disjoint Virtual Path Group, DVPG) 을 사용하는 상태 독립적 (State- independent) 방식으로 복구된다. ATM 망의 운용 및 보호 VP 할당과 용량 배정 문제를 정의하고 이를 바탕으로 최소의 비용을 갖는 VP 망을 설계한다. 망의 고장 시 기존 노드간의 VP 연결은 미리 할당된 링크 또는 노드 분리 보호 VP 경로를 따라 간단한 복구 알고리즘에 의해 빠르게 복구된다. QoS의 고려는 추가 비용을 필요로 하지만 정확한 이용자 연결의 복구를 실현하며, 분리 VP 그룹의 적용은 비용을 상승시키지만, 빠른 복구와 복수의 고장에 대처할 수 있는 방안이 된다.Abstract A cost evaluation of protection scheme for VP-based ATM network is presented here and its related characteristics are evaluated. The proposed and evaluated scheme is a state-independent restoration scheme using a disjoint path group. For fast and simple restoration of failed connections, link disjoint or node disjoint VP groups (DVPG) were utilized in this paper. A VP assignment and capacity planning problem is formulated. When failure occurs, the failed working VPs are switched to the protection VPs of disjoint path groups with a simple restoration scheme. And, cost evaluation and restoration characteristics are presented. The consideration of multiple QoS (Quality of Service) levels and disjoint path group protection scheme require additional network cost but acquire fit and fast restoration.

• 제어로봇시스템학회논문지
• /
• 제15권12호
• /
• pp.1232-1239
• /
• 2009

This paper proposes an exploration strategy to efficiently find a specific place in large unknown environments with wall-following based path planning. Many exploration methods proposed so far showed good performance but they focused only on efficient planning for modeling unknown environments. Therefore, to successfully accomplish the room finding task, two additional requirements should be considered. First, suitable path-planning is needed to recognize the room number. Most conventional exploration schemes used the gradient method to extract the optimal path. In these schemes, the paths are extracted in the middle of the free space which is usually far from the wall. If the robot follows such a path, it is not likely to recognize the room number written on the wall because room numbers are usually too small to be recognized by camera image from a distance. Second, the behavior which re-explores the explored area is needed. Even though the robot completes exploration, it is possible that some rooms are not registered in the constructed map for some reasons such as poor recognition performance, occlusion by a human and so on. With this scheme, the robot does not have to visit and model the whole environment. This proposed method is very simple but it guarantees that the robot can find a specific room in most cases. The proposed exploration strategy was verified by various experiments.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제34권5호
• /
• pp.389-396
• /
• 2007

서로 다른 종에서의 대사 경로를 비교하는 것은 아직 밝혀지지 않은 유전자를 찾는 문제에 있어 매우 중요하다. 많은 대사 경로 시각화가 제시되었지만 생물학자들은 대사 경로를 단순히 보는 것뿐만 아니라 비교하는 시각화를 필요로 한다. K-Viz는 KEGG 기반의 대사 경로를 위한 시각화 툴이다. 다른 종의 대사 경로를 비교하기 위해 KEGG의 PathComp와 같은 경로를 서로 다른 색으로 표현하는 방법과 각 종에서의 경로를 테이블로 보여준다. K-Viz는 생물학자들이 서로 다른 종에서의 대사 경로 비교를 이해하는데 도움을 준다.

• 한국컴퓨터정보학회논문지
• /
• 제19권5호
• /
• pp.89-98
• /
• 2014

본 논문은 NP-난제 문제로 알려진 단일모델 단방향 조립라인 균형문제에 대해 휴리스틱 알고리즘을 제안하였다. 조립라인 균형문제는 주로 메타휴리스틱 방법들을 적용하고 있는 추세이다. 제안된 알고리즘은 최종제품이 생산될 때까지 가장 많은 공정으로 조립되는 경로를 주경로로 설정하고, 주경로를 따라가면서 각 작업자에게 순환시간 조건을 만족하는 작업량을 배정하는 군집화 알고리즘을 제안하였다. 제안된 알고리즘은 최소의 작업자수를 결정하고, 순환시간도 단축시키는 결과를 얻었다. 9개의 다양한 실험 데이터에 제안된 주경로 군집화 휴리스틱 알고리즘을 적용한 결과 메타휴리스틱 방법들에 비해 보다 좋은 성능을 갖고 있음을 보였다.

• 한국의류산업학회지
• /
• 제23권5호
• /
• pp.586-597
• /
• 2021

Personalized product recommendation service is receiving attention as a new marketing strategy while supporting consumer information search and purchasing decisions. This study attempted to verify the effect of self-reference on service use behavior through the dual path of cognitive attitude and emotional attachment. Using convenience sampling, an online survey was conducted with 324 women who were in their 20s and 30s. After collecting and compiling the survey data, the reliability and validity of variables constituting the conceptual research model were verified through confirmatory factor analysis using AMOS 22.0. Next, the significance of sequentially mediated pathways was verified using Process 3.5 Model 80. The results showed that self-referencing not only significantly affects service use intention by simply mediating cognitive attitudes but also sequentially mediates cognitive attitudes and additional information search. Furthermore, self-referencing was significant as an indirect path to service use intention by mediating additional information search. However, in the path mediated by emotional attachment, self-referencing was considered as a simple mediated path leading to service usage intention. These results indicate a dual path in the psychological mechanism, through cognitive and emotional evaluation, that prompts consumer behavioral responses to the personalized product information provided in the shopping process.

• 한국산업정보학회논문지
• /
• 제14권4호
• /
• pp.49-56
• /
• 2009

최근 멀티미디어 스트리밍 분야에서 멀티미디어 콘텐츠를 효율적으로 전송하기 위한 연구가 활발히 이루어지고 있다. 응용층에서 구현할 수 있는 오버레이 멀티캐스트는 멀티미디어 콘텐츠를 효율적으로 전송하기 위한 방법이다. 오버레이 멀티캐스트는 물리 층의 변경 없이 멀티캐스트 전송을 구현 할 수 있고 알고리즘에 따라 적용방식을 다양하게 할 수 있는 특징이 있다. 본 연구에서는 멀티미디어 콘텐츠의 안정된 전송을 위한 오버레이 멀티캐스트의 복원경로 구성 방법을 제안하였다. 제안된 방법은 오버레이 멀티캐스트에서 QoS를 보장하기 위하여 최소한의 검색방법으로 복원경로를 구성함으로써 빠르고 간단한 복원경로를 구성할 수 있다.

• Journal of applied mathematics & informatics
• /
• 제41권3호
• /
• pp.511-524
• /
• 2023

An L(p₁, p₂, p₃, . . . , p_m)-labeling of a graph G is an assignment of non-negative integers, called as labels, to the vertices such that the vertices at distance i should have at least pi as their label difference. If p₁ = 4, p₂ = 3, p₃ = 2, p₄ = 1, then it is called a L(4, 3, 2, 1)-labeling which is widely studied in the literature. A L(4, 3, 2, 1)-path coloring of graphs, is a labeling g : V (G) → Z⁺ such that there exists at least one path P between every pair of vertices in which the labeling restricted to this path is a L(4, 3, 2, 1)-labeling. This concept was defined and results for some simple graphs were obtained by the same authors in an earlier article. In this article, we study the concept of L(4, 3, 2, 1)-path coloring for complete bipartite graphs, 2-edge connected split graph, Cartesian product and join of two graphs and prove an existence theorem for the same.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.880-885
• /
• 1995

This paper deals with the efficient planning of robot motions in the Cartesian space while avoiding the collision with obstacles. The motion planning problem is to find a path from the specified starting robot configuration that avoids collision with a known set of stationary obstacles. A simple and efficient algorithm was developed using "Backward" approach to solve this problem. The computational result was satisfactory enough to real problems. problems.

• 소성∙가공
• /
• 제15권6호
• /
• pp.467-472
• /
• 2006

The forming limit diagram of tube is required for the part design and the formability analysis of tube hydroforming. The finite element analyses of simple bulge test were done to obtain the various strain combinations on FLC. The finite element analysis results were shown that the bursting at various strain combinations could be induced by simple bulge test. The experiment oi tube bulge test was carried out according to the test condition that obtained from finite element analysis and the left hand side of forming limit diagram was built.

• 대한수학회보
• /
• 제31권1호
• /
• pp.61-72
• /
• 1994

Every irreducible block-finite orthomodular lattice is simple [9] and every irreducible orthomodular alttice such that no proper p-ideal of L contains infinitely many commutators is simple [5]. Every finite (height) OML L which does not belong to the varitety generated by MO2 has one of the OML MO3, 2$^{3}$.2$^{2}$, D$_{16}$ OMLHOUSE as the homomorpyhic image of a subalgebra of L [3]. In this paper, we extend these results.s.