• 한국멀티미디어학회논문지
• /
• 제18권9호
• /
• pp.1083-1090
• /
• 2015

A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to transmit maximum number of packets from a source node to a destination node simultaneously along paths on this network, where the i^th packet traverses along the i^th path. In order for all packets to arrive at the destination node securely, the i^th path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n x n) matrices, we present O(n²) parallel routing algorithm on generalized recursive circulant networks.

• 경영과학
• /
• 제25권2호
• /
• pp.81-88
• /
• 2008

This paper presents a new algorithm for the K shortest paths problem in a network. After a shortest path is produced with Dijkstra algorithm. detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set. this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated until the $K^{th}-1$ path of the set is obtained. The computational results for networks with about 1,000,000 nodes and 2,700,000 arcs show that this algorithm can be applied to a problem of generating the detouring paths in the metropolitan traffic networks.

• 전기전자학회논문지
• /
• 제24권2호
• /
• pp.661-664
• /
• 2020

본 논문에서 우리는 선박의 이동 경로를 예측하기 위하여, 해상 영역을 분할하고, 분할된 영역을 기반으로 선박의 목적지를 예측하는 방법을 제안한다. 해상 영역을 분할하기 위하여 과거 이동 경로를 토대로 생성된 목적지 후보들을 군집화한다. 그리고, 선박이 이동할 목적지 영역을 예측하기 위해서 현재 위치에서 주어진 경로의 선형 여부와 향후 예측 시간에 따른 불확실성에 따라 다른 예측 방법을 적용한다. 예측에 사용하는 방법에는 선형 영역에서는 등속 운동을 가정한 선형 예측 방법, 불확실성이 높은 비선형 영역에서는 과거 경로 중 유사한 경로와 비슷한 움직임을 보일 것이라고 가정한 유사 경로 이용 예측 방법을 사용한다. 실험 결과에서 해당 방법이 선형 예측, 유사 경로 이용 예측 방법을 단독으로 적용하는 것에 비해 더 우수함을 보인다.

• 대한교통학회지
• /
• 제20권2호
• /
• pp.71-79
• /
• 2002

도시 내 교통혼잡이 증가됨에 따라 최단경로 탐색방법뿐만이 아니라 동일 목적지까지의 여러 가지 경로(준 최단경로)를 제시해 줌으로써 교통량을 효과적으로 분산시킬 수 있는 대체경로 탐색기법에 대한 관심이 고조되고 있다. 본 논문에서는 대체 경로의 유효성을 평가하는 성능지표를 제안하고, 복수개의 우수해 탐색에 유리한 진화 프로그램에 기초한 효과적인 대체경로 탐색기법을 제시한다. 기존 방법(k-th 최단경로 방법)의 문제점이었던 대체 경로들간의 유사성이 제안된 방법에서는 해결된다. 가상 도로망을 통한 컴퓨터 시뮬레이션의 결과로서 제안된 방법이 기존 방법보다 교통량 분산(경로들간의 상이성)측면에서 훨씬 더 우수함을 확인하였다.

• 한국태양에너지학회:학술대회논문집
• /
• 한국태양에너지학회 2009년도 춘계학술발표대회 논문집
• /
• pp.49-54
• /
• 2009

This study focus on verification of the thermal efficiency of volumetric receiver with $5kW_{th}$ Dish-type solar thermal system. Spiral flow path shaped on receiver and working fluid(steam) flow along the this flow path. Porous material for radiation-thermal conversion used in former researches are substituted with the stainless steel wall installed along the spiral shaped flow path. Numerical analysis for the flow path and temperature distributions are carried out. Numerical results are compared with experimental data. Using the numerical model, the heat transfer characteristics of spiral type receiver for dish-type solar thermal systems are known and the thermal performance of the receiver can be estimated.

• 한국멀티미디어학회논문지
• /
• 제16권7호
• /
• pp.897-904
• /
• 2013

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• 대한가정학회지
• /
• 제47권10호
• /
• pp.29-37
• /
• 2009

The purpose of this study was to investigate the mediating role of self-worth in the relationship between social support and depressive symptoms. Seven hundred and thirty-eight 5th and 6th graders in Seoul completed questionnaires. Path analysis demonstrated that social support had a significant direct effect on depressive symptoms. This analysis also revealed that social support influenced depressive symptoms through self-worth. These findings suggest that the relationship between perceived social support and depressive symptoms in children is partially mediated through a personal variable like self-worth.

• International Journal of Internet, Broadcasting and Communication
• /
• 제12권1호
• /
• pp.116-121
• /
• 2020

With the recent development of the 4th Industrial Revolution, efforts have been made to carry out communication in a smart factory, farm, etc. at low cost and reliably. Methods for utilizing empty frequencies using TVWS(TV White Space) have been studied which can be used locally within 30 km. However, there have not been many studies on Path-Loss model considering Korean environment. In this paper, the Path-Loss model is divided into LOS (Line Of Sight) and NLOS (None LOS). In case of LOS model, we checked the difference between Free space model, Friis model, 2-ray model and Hata model with measured data. In the case of NLOS model, we checked the difference between Lee Model, ITU-R526-3 Model with measured data. In order to overcome the difference in Korean environment, we derived a model that can be applied in LOS and NLOS and prove its usefulness through performance evaluation through simulation.

• 아동학회지
• /
• 제27권6호
• /
• pp.149-165
• /
• 2006

This study examined the relationships of parental behavior control recognized by children and its effect on children's emotional intelligence and conflict resolution strategies in their peer friendships. Subjects were 521 $5^{th}$, $6^{th}$ grade elementary school Children in seoul. Data were analyzed by Pearson's correlation, multiple regression and path analysis. Result showed that parents' control of children's behavior affected children's conflict resolution strategies in peer friendships and affected their emotional intelligence. Path analysis showed that control by parents, demand for maturity and clarity of communication directly affected compromising-integrating strategies. Parental control was affected directly by dominating strategies. Controlling behavior by demand of maturity, clarity of communication and nurture influenced compromising-integrating, avoidance and concession strategies of children's emotional intelligence.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권12호
• /
• pp.577-582
• /
• 2002

The objective of this paper is to produce a weighted graph map for path-planning of an autonomous mobile robot(AMR) based on the measurements from a single ultrasonic sensor, which are acquired when the autonomous mobile robot explores unknown indoor circumstance. The AMR navigates in th unknown space by following the wall and gathers the range data using the ultrasonic sensor, from which the occupancy grid map is constructed by associating the range data with occupancy certainties. Then, the occupancy grid map is converted to a weighted graph map suing morphological image processing and thinning algorithms. the path- planning for autonomous navigation of a mobile robot can be carried out based on the occupancy grid map. These procedures are implemented and tested using an AMR, and primary results are presented in this paper.