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

SPIE Biomedical Applications in Molecular, Structural and Functional Imaging Conference

作者： Leblond, Antoine Kauffmann, Claude Ctr Hosp Univ Montreal Ctr Rech Montreal PQ Canada

ISBN: (纸本)9781510600232

Even with recent hardware improvements, superpixel segmentation of large 3D medical images at interactive speed (<500 ms) remains a challenge. We will describe methods to achieve such performances using a GPU based hybrid framework implementing wavefront propagation and cellular automata resolution. Tasks will be scheduled in blocks (work units) using a wavefront propagation strategy, therefore allowing sparse scheduling. Because work units has been designed as spatially cohesive, the fast Thread Group Shared Memory can be used and reused through a Gauss-Seidel like acceleration. The work unit partitioning scheme will however vary on odd- and even-numbered iterations to reduce convergence barriers. Synchronization will be ensured by an 8-step 3D variant of the traditional Red Black Ordering scheme. An attack model and early termination will also be described and implemented as additional acceleration techniques. Using our hybrid framework and typical operating parameters, we were able to compute the superpixels of a high-resolution 512x512x512 aortic angioCT scan in 283 ms using a AMD R9 290X GPU. We achieved a 22.3X speed-up factor compared to the published reference GPU implementation.

关键词： Superpixel segmentation Cell Automata bellman-ford algorithm Wavefront propagation GPU Interactive speeds Medical datasets 3D volumes

来源：评论

学校读者我要写书评

暂无评论

Looped Network Oriented Distributed Power Routing Method with the Operation of Phase Shifters

Looped Network Oriented Distributed Power Routing Method wit...

引用

IEEE-Power-and-Energy-Society General Meeting (PESGM)

作者： Tai, Xue Sun, Hongbin Guo, Qinglai Li, Zihao Tsinghua Univ Dept Elect Engn State Key Lab Power Syst Beijing 10084 Peoples R China

ISBN: (纸本)9781538677032

The deregulation of power industry enables large power users and power producers to trade power directly between different regional markets, making it important for market participants to conduct research on the method to find out the best route for power trading. Besides, as the coordinator between the regional markets have limited access to the information of every market, the power routing problem should be solved in a decentralized way. In this paper, we propose a looped network oriented distributed power routing method with the operation of phase shifters (PSs), which extends our previous work on the power routing method in loop-free networks. We transforms the optimization model for the lowest transaction cost to a minimal path problem and applies bellman-ford algorithm to solve it. To control the power flow of tie lines, we utilize phase shifters (PSs) and develop a method to determine their reasonable set points in a distributed way. A six-market case with two loops were used to illustrate the efficiency of the method.

关键词： Energy Router Electricity Transaction bellman-ford algorithm Phase Shifter

来源：评论

学校读者我要写书评

暂无评论

Approach to Find Shortest Path Using Ant Colony algorithm 2nd

Approach to Find Shortest Path Using Ant Colony Algorithm

引用

2nd International Conference on Intelligent Communication, Control and Devices (ICICCD)

作者： Basha, Mudasar Kumar, M. Siva Pranav, Vemulapalli Sai Rehman, B. Khaleelu BVRIT N Dept ECE Hyderabad Telangana India KL Univ Dept ECE Vijayawada AP India Univ Petr & Energy Studies Dept Elect Instrumentat & Control Engn Dehra Dun Uttarakhand India

ISBN: (纸本)9789811059032;9789811059025

This paper deals with Ant Colony Optimization (ACO). Our approach is to compare the run-time and accuracy of existing techniques using Ant Colony Optimization to find the shortest path. Here, we are going to study how to locate the shortest path using-Dijkstra's, bellman-ford andKruskal's algorithms, and comparisons will be done among all the algorithms. Ant lays pheromone on the path it travelled to identify the shortest path from its nest to the food source. We will also be studying what are the uses of implementing ACO algorithm on a XILINX ZYNQ-7000 PSoC (Programmable SystemonChip) instead of implementing it onArduino orRaspberry Pi.

关键词： Ant Colony Optimization (ACO) Dijkstra's algorithm bellman-ford algorithm Kruskal's algorithm Pheromone Xilinx ZYNQ-7000 PSoC

来源：评论

学校读者我要写书评

暂无评论

A Simple Deterministic Distributed MST algorithm, with Near-Optimal Time and Message Complexities 17

A Simple Deterministic Distributed MST Algorithm, with Near-...

引用

36th ACM Symposium on Principles of Distributed Computing (PODC)

作者： Elkin, Michael Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel

ISBN: (纸本)9781450349925

Distributed minimum spanning tree (MST) problem is one of the most central and fundamental problems in distributed graph algorithms. Kutten and Peleg [KP98] devised an algorithm with running time O(D + root n . log*n), where D is the hop-diameter of the input n-vertexm-edge graph, and with message complexity O(m + n(3/2)). Peleg and Rubinovich [PR99] showed that the running time of the algorithm of [KP98] is essentially tight, and asked if one can achieve near-optimal running time together with near-optimal message complexity. In a recent breakthrough, Pandurangan et al. [PRS16] answered this question in the affirmative, and devised a randomized algorithm with time (O) over tilde (D + root n) and message complexity (O) over tilde (m). They asked if such a simultaneous time- and message-optimality can be achieved by a deterministic algorithm. In this paper, building upon the work of [PRS16], we answer this question in the affirmative, and devise a deterministic algorithm that computes MST in time O((D + root n) . logn), using O(m . logn + n logn . log*n) messages. The polylogarithmic factors in the time and message complexities of our algorithm are significantly smaller than the respective factors in the result of [PRS16]. Also, our algorithm and its analysis are very simple and self-contained, as opposed to rather complicated previous sublinear-time algorithms [GKP98, KP98, Elk04b, PRS16].

关键词： distributed shortest paths bellman-ford algorithm

来源：评论

学校读者我要写书评

暂无评论

Modelling of Reconfigurable Antenna using Graph Techniques 13

Modelling of Reconfigurable Antenna using Graph Techniques

引用

13th International Conference on Electronics, Computer and Computation (ICECCO)

作者： Galadima, Ahmadu A. Ugweje, Okechukwu C. Koyunlu, Gokhan Adeshina, Steve Nile Univ Nigeria Dept Elect & Elect Engn Abuja Nigeria

ISBN: (纸本)9781538625019

The analysis of reconfigurable antennas using graph techniques is presented in this paper. Since reconfigurable antennas can be viewed as group of self-organized components, graph theory rules were used to establish the relationships between the possible topologies and some corresponding electromagnetic property of the antenna such as frequency of operation, polarization and impedance. Reconfigurable antennas were classified into groups based on mechanism that alter their configurations. Optimization algorithms such as Dijkstras and bellman-ford were applied to determine the solution for the shortest path problem. The two algorithms were compared and results show that bellman-ford algorithm performed better for graph with less than 100 vertices.

关键词： bellman-ford algorithm Dijkstras algorithm graph modelling graph theory Reconfigurable antenna

来源：评论

学校读者我要写书评

暂无评论

Finding All Hops k-shortest Paths

Finding All Hops k-shortest Paths

引用

IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)

作者： Cheng, G Ansari, N New Jersey Inst Technol Adv Networking Lab Dept Elect & Comp Engn Newark NJ 07102 USA

ISBN: (纸本)0780379780

In this paper, we introduce and investigate a new problem referred to as the All Hops k-shortest Paths (AHKP) problem. An efficient solution, the AD Hops k-shortest Paths Extended bellman-ford (AHKPEB) algorithm, is proposed. Especially, when k = 1, AHKPEB is an optimal comparison-based solution to the All Hops Optimal Path (AHOP) problem in terms of the worst-case computational complexity, i.e., it is impossible to find another comparison-based solution to Add-AHOP having the worst-case computational complexity lower than that of AHKPEB.

关键词： quality of service (QoS) bellman-ford algorithm all hops k-shortest paths problem (AHKP).

来源：评论

学校读者我要写书评

暂无评论

Energy Optimized Adaptive Cruise Control for Battery Electric Vehicles

Energy Optimized Adaptive Cruise Control for Battery Electri...

引用

作者： HANNES BOLMSTEDT Chalmers University of Technology

学位级别：硕士

In recent years, a global trend towards more sustainable and autonomous trans- portation has been changing the car industry. Electrification is on the rise, and Volvo Cars has set out to be a leader with the bold goal of having half of the ve- hicles sold to be fully electrical by 2025. With more electric vehicles and better autonomous functionality than ever before, it is a natural step to look into energy optimization of the autonomous driving behavior. The adaptive cruise control (ACC) is responsible for a large portion of driven kilome- ters in new vehicles. Therefore, this thesis aims to examine the potential of energy optimizing the ACC behavior. To limit the scope, only deceleration scenarios were considered where the vehicle with ACC closes in on a vehicle with constant velocity in front. Two different initial velocities of the vehicle with ACC were tested, while the vehicle in front had the same velocity in both cases. Different time constraints and initial relative distances were tested. All tests were performed in a simulation environment based on Matlab and Simulink, where the power of the electric motors could be measured. The optimization problem was solved using dynamic programming implemented in Matlab. The solutions derived from the dynamic programming were in the form of vehicle trajectories which were then tested on an electric vehicle model in Simulink. The measured power on the motors could then be compared to that of a traditional ACC. The results show that given the exact same initial and final position and velocity, as well as the same time to travel between the two, an energy optimized solution can decrease the energy usage up to 2.1 % compared to a traditional ACC. Given longer time to reach the goal, while not allowed to react earlier, the energy can be decreased by up to 5.5 %. If instead, the ACC is allowed to react earlier and the trajectory is energy optimized, the energy can be decreased by up to 39.1 %. Note that reacting earlier doe

关键词： Adaptive cruise control dynamic programming bellman-ford algorithm directed graph shortest path algorithm optimization control problem energy usage battery electric vehicles simulation environment

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of bellman-ford and Dijkstra's algorithms for optimal evacuation route planning in multi-floor buildings

引用

COGENT ENGINEERING 2024年第1期11卷

作者： Bhat, Ritesh Rao, P. Krishnanda Kamath, C. Raghavendra Tandon, Vipin Vizzapu, Prashant Rajalakshmi Engn Coll Dept Mechatron Engn Thandalam India Manipal Acad Higher Educ Manipal Inst Technol Dept Mech & Ind Engn Manipal India Manipal Acad Higher Educ Manipal Sch Architecture & Planning Ctr Sustainable Built Environm Manipal India Tredence Inc Denver CO USA

This study introduces a groundbreaking application of the bellman-ford algorithm for optimizing evacuation routes in multi-floor academic buildings, extending its traditional use in single-source shortest-path problems to address complex multiple- source multiple-exit (MSME) problems. A comprehensive computational model was developed, reflecting real-world evacuation scenarios and incorporating key constraints and assumptions. The model was rigorously benchmarked against a Dijkstra's algorithm-based model, revealing a 3.5% improvement in the number of evacuees evacuated after the initial 9 seconds. Detailed simulation results and extended data analysis further substantiate these findings. While the current model assumes perfect evacuee compliance and overlooks human behavior, future research could address these limitations to enhance the model's realism. This study significantly advances the field of emergency evacuation planning, offering valuable insights for emergency response practitioners, facility managers, and policymakers.

关键词： bellman-ford algorithm evacuation planning buildings multiple-source multiple-exit (MSME) problems Emergency management optimal route selection

来源：评论

学校读者我要写书评

暂无评论

Využití distribuovaných a stochastických algoritmů v síti

Využití distribuovaných a stochastických algoritmů v s...

引用

作者： Yarmolskyy, Oleksandr Brno University of Technology

Tato diplomová práce se zabývá problematikou distribuovaných a stochastických algoritmů včetně testování jejich konvergence v sítích. V teoretické části jso... 详细信息

Tato diplomová práce se zabývá problematikou distribuovaných a stochastických algoritmů včetně testování jejich konvergence v sítích. V teoretické části jsou výše uvedené algoritmy stručně popsané, včetně jejich dělení, problémů, výhod a nevýhod. Dále jsou vybrané dva distribuované algoritmy a dva stochastické algoritmy a následně jsou stručně popsané. V praktické části je provedeno jejich porovnání podle rychlosti konvergence na odlišných topologiích sítí v prostředí MATLAB.

关键词： distribuované algoritmy stochastické algoritmy konvergence MATLAB bellmanův-fordův algoritmus Dijkstrův algoritmus A* algoritmus Push-sum algoritmus distributed algorithms stochastic algorithms convergence MATLAB bellman-ford algorithm dijkst

来源：评论

学校读者我要写书评

暂无评论

Demonstrace grafových algoritmů

Demonstrace grafových algoritmů

引用

作者： Varadinek, Jakub Brno University of Technology

Tato bakalářská práce se zabývá vývojem aplikace pro demonstraci a vizualizaci některých grafových algoritmů. Aplikace uživateli umožňuje vytvořit graf, ohodnotit hrany nebo pojmenovat a rozmístit vrcholy. Nad takto vytvořeným grafem je možné nechat provádět jednotlivé algoritmy a vizuálně sledovat, jak algoritmus pracuje. K dispozici je taktéž možnost krokování algoritmu a interaktivní režim, kdy postup volí uživatel a aplikace provádí kontrolu správnosti zvolených kroků.

关键词： grafy grafové algoritmy DFS BFS bellmanův-fordův algoritmus Dijkstrův algoritmus algoritmus topologického uspořádání JGraphX Graphs Graph algorithms DFS BFS bellman-ford algorithm Dijkstra’s algorithm Topological sort JGraphX Text

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：