http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A set of One-to-Many Edge-Disjoint and Shortest Paths on Recursive Circulant Networks
Heewook Shin,Ilyong Chung 한국멀티미디어학회 2011 한국멀티미디어학회 국제학술대회 Vol.2011 No.-
The recursive circulant network (RCN) G(N, d) proposed by Park and Chwa [13] can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node having degree m is connected through bidirectional, point-to-point communication channels to different neighbors by jumping d<SUP>i</SUP>, where 0 ≤ i ≤ 「logdN」 - 1. In this paper; we investigate the routing of a message on G(2<SUP>m</SUP>, 4), a special kind of RCN, that is key to the performance of this network. On G(2<SUP>m</SUP>,4) we would like to transmit m packets from a source node to m destination nodes simultaneously along paths on this network, the i<SUP>th</SUP> packet will be transmitted along the ith path (0 ≤ i ≤ m - 1). In order for all packets to arrive at a destination node quickly and securely, we present an O(m<SUP>3</SUP>) routing algorithm on G(2<SUP>m</SUP>, 4) for generating a set of one-to¬many edge-disjoint and shortest paths employing the Hungarian method.
엔진 커넥팅로드 좌굴 평가를 위한 CAE(Computer Aided Engineering) 기법 개발 및 활용
문희욱(Heewook Moon),장훈(Hoon Jang),신성원(Sungwon Shin) 한국자동차공학회 2006 한국자동차공학회 춘 추계 학술대회 논문집 Vol.- No.-
In the buckling analysis of structures, Merchant-Rankine formula is a very powerful method, which predicts critical buckling load, considering both elastic buckling load and plastic material behavior. Unfortunately because of shape gradient, we can't apply this method to connecting rod. In this study, we developed a new buckling estimation method based on Merchant-Rankine formula using CAE. This new method was verified by buckling test and applied several connecting rods. As a result, it is found that critical buckling load of connecting rod is affected by plastic buckling of buckling estimation method.
Shrestha, Raj K.,Moh, Sangman,Chung, IlYong,Shin, Heewook Institute of Embedded Engineering of Korea 2010 대한임베디드공학회논문지 Vol.5 No.4
Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.
Raj K. Shrestha,모상만,정일용,Heewook Shin 대한임베디드공학회 2010 대한임베디드공학회논문지 Vol.5 No.4
Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.