检索结果-内蒙古大学图书馆

Fast bidirectional shortest path on GPU

IEICE ELECTRONICS EXPRESS 2016年第6期13卷 20160036-20160036页

作者： Tangjittaweechai, Lalinthip Ekpanyapong, Mongkol Watewai, Thaisiri Athikulwongse, Krit Lim, Sung Kyu Tavares, Adriano Asian Inst Technol Microelect & Embedded Syst Bangkok Thailand Chulalongkorn Univ Chulalongkorn Business Sch Bangkok 10330 Thailand Natl Elect & Comp Technol Ctr Bangkok Thailand Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Univ Minho Ctr Algoritmi Dept Ind Elect P-4719 Braga Portugal

The bidirectional shortest path problem has important applications in VLSI floor planning and other areas. We introduce a new algorithm to solve bidirectional shortest path problems using parallel architectures provided by general purpose computing on graphics processing units. The algorithm performs parallel searches from the source and sink using Dijkstra's classic approach modified with pruning and early termination. We achieve substantial speedup over a parallel method that performs a single parallel search on the GPGPU from the source to all other nodes but early terminates when the shortest path to the specified target node is found. Experimental results demonstrate a speedup of nearly 2x over the parallel method that performs a parallel search from the source with early termination on the GPGPU.

关键词： shortest path algorithm single pair GPGPU parallel bidirectional search

来源：评论

学校读者我要写书评

暂无评论

A Load-balanced Adaptive Routing and Wavelength Assignment algorithm Based on Cost Updating 16

A Load-balanced Adaptive Routing and Wavelength Assignment A...

引用

16th International Conference on Optical Communications and Networks (ICOCN)

作者： Zhang, Zhengxian Liu, Siming Zhang, Junyue Tian, Huiping Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China

ISBN: (纸本)9781538632734

In this paper, an adaptive routing and wavelength assignment algorithm based on cost updating (CU-RWA) has been proposed to optimize route selection in optical networks. The classical shortest path algorithms, such as the Dijkstra algorithm, always cause high blocking probability and unbalanced load when making a routing decision. Consequently, the algorithm which is able to train the network and constantly update the link cost depending on the load status of link is designed to solve the problem in this paper. Simulation results obtained indicate that the proposed algorithm outperforms Dijkstra algorithm in load balancing and blocking probability.

关键词： Optical networks Routing and Wavelength Assignment Cost updating shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallel Voronoi Computation for Physics-Based Simulations

引用

COMPUTING IN SCIENCE & ENGINEERING 2016年第3期18卷 88-94页

作者： Toss, Julio Comba, Joao Raffin, Bruno Univ Fed Rio Grande do Sul BR-90046900 Porto Alegre RS Brazil Univ Grenoble Alpes INRIA Grenoble France

Voronoi diagrams are fundamental data structures in computational geometry, with applications in areas such as physics-based simulations. For non-Euclidean distances, the Voronoi diagram must be performed over a grid-graph, where the edges encode the required distance information. The major bottleneck in this case is a shortest path algorithm that must be computed multiple times during the simulation. The authors present a GPU algorithm for solving the shortest path problem from multiple sources using a generalized distance function. Their algorithm was designed to leverage the grid-based nature of the underlying graph that represents the deformable objects. Experimental results report speed-ups up to 65x over a current reference sequential method.

关键词： computational geometry data structures digital simulation graph theory graphics processing units parallel processing physics GPU algorithm Voronoi diagrams computational geometry data structures generalized distance function grid-based nature grid-graph nonEuclidean distances parallel Voronoi computation physics-based simulations shortest path algorithm algorithm design and analysis Computational modeling Graphics processing units Interpolation Three-dimensional displays Topology Physics scientific computing simulation

来源：评论

学校读者我要写书评

暂无评论

Graph Theory Modeling Approach for Optimal Operation of Water Distribution Systems

引用

JOURNAL OF HYDRAULIC ENGINEERING 2016年第3期142卷 4015061-1-4015061-15页

作者： Price, Eyal Ostfeld, Avi Technion Israel Inst Technol Fac Civil & Environm Engn IL-32000 Haifa Israel

A graph theory-based algorithm is demonstrated for optimal pump scheduling of two example application water networks. The hydraulic part of the problem is solved using a dedicated and efficient hydraulic solver. The pump scheduling part of the problem is solved using a skeletonized operational graph, representing only the basic logic operational relations existing in the network required for pump selection: the pumping units (with nominal operating costs), water tanks and clustered demand nodes. The hydraulic solver advances one time step at a time. After each time step advance, the nodes of the model are checked to see if satisfy minimum service pressure and minimum water tank level. For nodes not satisfying the service constraints, the Dijkstra's shortest path algorithm is applied to the skeletonized graph to determine the optimal pumping unit to be activated and then updating the pumps operation pattern in the model. The hydraulic solver is then reinitialized to resolve and recheck the time steps one by one. The algorithm ends when the solver reaches the last time step with all nodes meeting service constraints. The algorithm returns an optimal minimal cost pump-scheduling pattern under greater-than constraints over the examined time period, such as (1)minimal consumer service pressure, and (2)water balance closure at the water tanks. The algorithm returns discrete pump operation scheduling with minimal pump switching and minimal water age in the tanks, demonstrating short solution times (28s to schedule 11 pumps over a 168-hour period). The algorithm may be applicable for real-time pump scheduling. Future research may include water quality constraints and variable frequency drive pump scheduling. Pump selection is based on the assumption that the optimal pump operation order is not affected by changes in the network's hydraulic conditions, such as water tank levels and location along the pump efficiency curve (assuming constant efficiency). If hydraulic conditio

关键词： Graph theory shortest path algorithm Water distribution network optimal operation Water distribution Optimization

来源：评论

学校读者我要写书评

暂无评论

Designing Skid-Trail Networks to Reduce Skidding Cost and Soil Disturbance for Ground-Based Timber Harvesting Operations

引用

FOREST SCIENCE 2016年第1期62卷 48-58页

作者： Contreras, Marco A. Parrott, David L. Chung, Woodam Univ Kentucky Dept Forestry Lexington KY 40546 USA Univ Kentucky Lexington KY 40506 USA Oregon State Univ Corvallis OR 97331 USA

Skid-trail locations directly influence the economics and environmental impacts of harvesting operations. Typically, field managers design skid-trail networks manually based on field observations of vegetation and terrain conditions. We designed a model to automatically design skid-trail networks to reduce skidding costs and soil disturbances. The model simulates tree-bunch locations, creates a feasible skid-trail network across the harvest unit, estimates skidding cost and soil recovery cost for each feasible skid-trail segment, and finds the network design that connects each tree bunch to landings while reducing skidding and soil recovery costs. The model was applied to a 24-ha hypothetical harvest unit to test its ability to design optimal networks under different scenarios representing conditions commonly found in timber harvesting operations (e.g., skidding pattern, uneven volume distribution, skidding obstacles, and different weights given to skidding and soil recovery costs). It was also applied to an actual 124-ha harvest unit to evaluate its ability to design skid-trail networks considering more realistic conditions with multiple design factors. The model successfully created optimized skid-trail networks for all scenarios considered, and results suggest that it provides a useful tool to help forest engineers and field managers design economically efficient and environmentally sound ground-based timber harvesting operations.

关键词： forest operations planning shortest path algorithm forest optimization network programming

来源：评论

学校读者我要写书评

暂无评论

Identifying novel protein phenotype annotations by hybridizing protein-protein interactions and protein sequence similarities

引用

MOLECULAR GENETICS AND GENOMICS 2016年第2期291卷 913-934页

作者： Chen, Lei Zhang, Yu-Hang Huang, Tao Cai, Yu-Dong Shanghai Univ Sch Life Sci Shanghai 200444 Peoples R China Shanghai Maritime Univ Coll Informat Engn Shanghai 201306 Peoples R China Chinese Acad Sci Shanghai Inst Biol Sci Inst Hlth Sci Shanghai 200031 Peoples R China

Studies of protein phenotypes represent a central challenge of modern genetics in the post-genome era because effective and accurate investigation of protein phenotypes is one of the most critical procedures to identify functional biological processes in microscale, which involves the analysis of multifactorial traits and has greatly contributed to the development of modern biology in the post genome era. Therefore, we have developed a novel computational method that identifies novel proteins associated with certain phenotypes in yeast based on the protein-protein interaction network. Unlike some existing network-based computational methods that identify the phenotype of a query protein based on its direct neighbors in the local network, the proposed method identifies novel candidate proteins for a certain phenotype by considering all annotated proteins with this phenotype on the global network using a shortest path (SP) algorithm. The identified proteins are further filtered using both a permutation test and their interactions and sequence similarities to annotated proteins. We compared our method with another widely used method called random walk with restart (RWR). The biological functions of proteins for each phenotype identified by our SP method and the RWR method were analyzed and compared. The results confirmed a large proportion of our novel protein phenotype annotation, and the RWR method showed a higher false positive rate than the SP method. Our method is equally effective for the prediction of proteins involving in all the eleven clustered yeast phenotypes with a quite low false positive rate. Considering the universality and generalizability of our supporting materials and computing strategies, our method can further be applied to study other organisms and the new functions we predicted can provide pertinent instructions for the further experimental verifications.

关键词： Phenotype Protein-protein interaction Protein sequence similarity shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of hyperpath strategy and driving experience to risk-averse navigation

引用

IET INTELLIGENT TRANSPORT SYSTEMS 2016年第5期10卷 338-346页

作者： Zeng, Weiliang Miwa, Tomio Morikawa, Takayuki Nagoya Univ Dept Civil Engn Furo Cho Nagoya Aichi Japan Nagoya Univ EcoTopia Sci Inst Furo Cho Nagoya Aichi Japan Nagoya Univ Inst Innovat Future Soc Furo Cho Nagoya Aichi Japan

This study aims to find an experientially reliable path considering travel time uncertainty and driving experience of local probe vehicle drivers. Accordingly, a two-stage route-finding procedure is proposed. First, a set of candidate paths is built by using the hyperpath algorithm, where the choice probability is assigned to each link with uncertain travel time. Second, the shortest path algorithm is applied to find the experientially reliable path on the graph of hyperpath where the modified link cost is penalised based on the link choice probability derived from hyperpath algorithm and the driving experience of local drivers. Four kinds of optimal path in a real-world network are compared with the observed one. It is found that the proposed path has the most similarity with the observed path and it has a higher degree of familiarity and reasonable time and distance.

关键词： vehicle routing navigation probability network theory (graphs) driving experience risk-averse navigation travel time uncertainty local probe vehicle drivers two-stage route-finding procedure shortest path algorithm penalised modified link cost link choice probability hyperpath algorithm real-world network

来源：评论

学校读者我要写书评

暂无评论

Smell Detection Agent Based Optimization algorithm

引用

Journal of The Institution of Engineers (India): Series B 2016年第3期97卷 431-436页

作者： Vinod Chandra, S.S. Computer Centre University of Kerala Senate House Campus Palayam ThiruvananthapuramKerala695034 India

In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems. © 2015, The Institution of Engineers (India).

关键词： Nature-inspired computing SDA shortest path algorithm Smell spots

来源：评论

学校读者我要写书评

暂无评论

An algorithm Based on Two-layer Graph Model for E-Commerce Recommendation

An Algorithm Based on Two-layer Graph Model for E-Commerce R...

引用

International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

作者： Pan, Li Xu, Xiaosha Tan, Zhimeng Peng, Xin Hunan Inst Sci & Technol Sch Informat & Commun Engn Yueyang 414006 Peoples R China

ISBN: (纸本)9781509059522

Recommender systems have been applied by E-commerce or other application sites to recommend their produces that customers might be interested in. This paper refines a bipartite graph to a two-layer graph model by adding the similarity information between consumers and products, the related metric is presented to measure the relationship among them, and the shortest path algorithm is introduced to obtain suitable recommendations.

关键词： Two-layer graph shortest path algorithm recommender system E-commerce

来源：评论

学校读者我要写书评

暂无评论

Model of Optimal Maneuver used in Tactical Decision Support System 21

Model of Optimal Maneuver used in Tactical Decision Support ...

引用

21st International Conference on Methods and Models in Automation and Robotics (MMAR)

作者： Stodola, Petr Nohel, Jan Mazal, Jan Univ Def Dept Tact Brno Czech Republic 53rd Reconnaissance & Elect Warface Regiment Opava Czech Republic

ISBN: (纸本)9781509018666

This paper deals with the model of optimal maneuver of units and its implementation in the Tactical Decision Support System (TDSS). The model is designed to be used for planning the optimal movement of units (soldiers, vehicles, unmanned robots) on the battlefield. The paper is separated into three main parts. Firstly, the model of maneuver is discussed;it is divided into five independent layers: topographic layer, elevation data layer, weather layer, hostile units layer, and friendly units layer. Impact of each layer on the model is then analyzed. Secondly, experiments used for verification of the model are presented. Finally, the implementation of the model in the TDSS is shown. TDSS is used to support commanders in their decision-making processes.

关键词： model optimal maneuver decision support system decision-making process shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：