http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Zhenghu (검색결과 5 건)
- 무료
- 기관 내 무료
- 유료
-
Tiexin Liu,Annan Jiang,Zhenghu Zhang,Huaizhong Liu,Jun Zheng 대한토목학회 2023 KSCE Journal of Civil Engineering Vol.27 No.6
The lengths of intact rock core pieces (LIRCP) and the corresponding rock quality designation(RQD) are two essential indexes for grasping rock structure. However, joints are usuallysimplified to be perfect planes. Thus, the influence of joint roughness on the LIRCP and RQDis not fully considered. The joint roughness was described by the Hurst exponent (H) and theroot-mean-square of the point heights on a joint (Rq) in the study. Theoretical formulas werederived and a new practical method of building non-planar joint disc models was proposed toreveal the influence of joint roughness and to estimate the LIRCP and RQD in the field. A 3Dpoint cloud with the texture of a rock slope was acquired by photogrammetry to verify thepracticability of the new method. Results showed that: a) the LIRCP obeyed a normaldistribution, and the distribution form was mainly controlled by Rq rather than H when therewas one equal spacing parallel joint set; b) Rq and H significantly affected the mean length andthe number of intact rock core pieces and the value of RQD when joints were non-parallel; c)following the rise of Rq, the number of intact rock core pieces and the value of RQD trendedto increase but the mean length of intact rock core pieces displayed a downtrend; however,the effect degree of Rq on the trend decreased as the rise of H; d) the new method of buildingnon-planar joint disc models was applicable to estimate the LIRCP and RQD in engineeringpractices.
-
Stationary Distribution for the Mobilities in Catastrophe Rescue Scenario
( Yong Wang ),( Wei Peng ),( Qiang Dou ),( Zhenghu Gong ) 한국인터넷정보학회 2013 KSII Transactions on Internet and Information Syst Vol.7 No.2
Mobility Model has drawn more and more attentions since its critical role in Mobile Wireless Networks performance evaluation. This paper analyzes the mobility patterns in the catastrophe rescue scenario, and proposes the Random Waypoint with Base Point mobility model to model these characteristics. We mathematically analyze the speed and spatial stationary distributions of the nodes and derive explicit expressions for the one dimensional case. In order to keep the stationary distribution through the entire simulation procedure, we provide strategies to initialize the speed, location and destination of the nodes at the beginning of the simulation. The simulation results verify the derivations and the proposed methods in this paper. This work gives a deep understanding of the properties of the Random Waypoint with Base Point mobility model and such understanding is necessary to avoid misinterpretation of the simulation results. The conclusions are of practical value for performance analysis of mobile wireless networks, especially for the catastrophe rescue scenario.
-
Closed Walk Ferry Route Design for Wireless Sensor Networks
( Qiang Dou ),( Yong Wang ),( Wei Peng ),( Zhenghu Gong ) 한국인터넷정보학회 2013 KSII Transactions on Internet and Information Syst Vol.7 No.10
Message ferry is a controllable mobile node with large capacity and rechargeable energy to collect information from the sensors to the sink in wireless sensor networks. In the existing works, route of the message ferry is often designed from the solutions of the Traveling Salesman Problem (TSP) and its variants. In such solutions, the ferry route is often a simple cycle, which starts from the sink, access all the sensors exactly once and moves back to the sink. In this paper, we consider a different case, where the ferry route is a closed walk that contains more than one simple cycle. This problem is defined as the Closed Walk Ferry Route Design (CWFRD) problem in this paper, which is an optimization problem aiming to minimize the average weighted delay. The CWFRD problem is proved to be NP-hard, and the Integer Linear Programming (ILP) formulation is given. Furthermore, a heuristic scheme, namely the Initialization-Split-Optimization (ISO) scheme is proposed to construct closed walk routes for the ferry. The experimental results show that the ISO algorithm proposed in this paper can effectively reduce the average weighted delay compared to the existing simple cycle based scheme.
-
Neighbor Gradient-based Multicast Routing for Service-Oriented Applications
( Hui Wang ),( Jianbiao Mao ),( Tao Li ),( Zhigang Sun ),( Zhenghu Gong ),( Gaofeng Lv ) 한국인터넷정보학회 2012 KSII Transactions on Internet and Information Syst Vol.6 No.9
With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods.
-
Accelerating the Sweep3D for a Graphic Processor Unit
Gong, Chunye,Liu, Jie,Chen, Haitao,Xie, Jing,Gong, Zhenghu Korea Information Processing Society 2011 Journal of information processing systems Vol.7 No.1
As a powerful and flexible processor, the Graphic Processing Unit (GPU) can offer a great faculty in solving many high-performance computing applications. Sweep3D, which simulates a single group time-independent discrete ordinates (Sn) neutron transport deterministically on 3D Cartesian geometry space, represents the key part of a real ASCI application. The wavefront process for parallel computation in Sweep3D limits the concurrent threads on the GPU. In this paper, we present multi-dimensional optimization methods for Sweep3D, which can be efficiently implemented on the finegrained parallel architecture of the GPU. Our results show that the overall performance of Sweep3D on the CPU-GPU hybrid platform can be improved up to 4.38 times as compared to the CPU-based implementation.
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
