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

32nd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBC 10)

作者： Verscheure, L. Peyrodie, L. Makni, N. Betrouni, N. Maouche, S. Vermandel, M. Loos CHRU Lille INSERM Res Unit U703 THAISInst Hippocrate 152 Rue Docteur Yersin F-59120 Yersin France Univ Lille 1 Lab Elect Engn & Image Proc LAGIS CNRS F-59650 Villeneuve Dascq France

ISBN: (纸本)9781424441242

This paper describes the methodology and the evaluation of a 3D skeletonization algorithm applied on brain vascular structure. This method is based on the application of the minimum cost-spanning tree using dijkstra's algorithm and seems well appropriate to tubular objects. We briefly describe the different steps, from the segmentation to the skeleton analysis. Besides, we propose an original evaluation scheme of the method based on digital phantom and clinical data. The final aim of this work is to provide a symbolic description framework applied to cerebro-vascular structures.

关键词： 3D skeletonization dijkstra algorithm biomedical MRI blood vessels brain brain vascular tree cerebrovascular structures digital phantom image segmentation image thinning medical image processing minimum cost spanning tree phantoms skeleton analysis trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

dijkstra-algorithm Based Ray-Tracing by Controlling Proximity Node Mapping 31

Dijkstra-Algorithm Based Ray-Tracing by Controlling Proximit...

引用

31st IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Uchida, Kazunori Barolli, Leonard Fukuoka Inst Technol Fukuoka 8110295 Japan

ISBN: (纸本)9781509062317

This paper is concerned with a discrete ray-tracing method by using dijkstra-algorithm (DA) to treat arbitrarily shaped obstacles which cause diffractions and reflections of incident rays. The computational space is divided in terms of regularly arrayed cubics with 8 apex-nodes and links of a node are limited to 26 proximate nodes of adjacent 8 cubics. Firstly, the original DA data provide shortest paths from a primary source node to all nodes except for inner nods of obstacles, and secondly, modifying the DA data by applying path-selection, path-linearization and checking line of sight (LOS) leads to incident and diffraction rays. Reflection rays are obtained by using distributed secondary source nodes. We show numerically how the optical rays are constructed starting from the original DA data. Ray examples reveal that the proposed method is effective to ray-tracing for complicated structures.

关键词： dijkstra algorithm Discrete Ray-Tracing Diffraction Reflection Propagation

来源：评论

学校读者我要写书评

暂无评论

Mobile Application Based on dijkstra's algorithm, to Improve the Inclusion of People with Motor Disabilities Within Urban Areas

Mobile Application Based on Dijkstra's Algorithm, to Improve...

引用

World Conference on Information Systems and Technologies (WorldCIST)

作者： Arellano, Luis Del Castillo, Daniel Guerrero, Graciela Tapia, Freddy Univ Fuerzas Armadas ESPE Ave Gen Ruminahui S-N171-5-231B Sangolqui Ecuador

ISBN: (纸本)9783030161835;9783030161842

The technology trend is to become an inseparable part of the users daily experiences. In this article will be discussed about the implementation of an application that can be a fundamental tool to guide disability people. The application is based on the geolocation of the user and it destination, this generates the optimal path from a database that has the coordinates of the access ramps for the disabled people. For the route development it use the dijkstra algorithm that includes the value or "weight" of each path. The results shows that the application helps to improve the time of mobilization from one point to another. Finally, the developed application accomplishes the objective of reducing time and efforts in the mobility of people with motor disabilities in the center of the city of Quito.

关键词： Disabled people Mobile application dijkstra algorithm Mobility Geolocation

来源：评论

学校读者我要写书评

暂无评论

Floating Car Data Map-Matching Utilizing the dijkstra's algorithm 3rd

Floating Car Data Map-Matching Utilizing the Dijkstra's Algo...

引用

International Conference on Data Management, Analytics and Innovation (ICDMAI)

作者： Ptosek, Vit Rapant, Lukas Martinovic, Jan VSB Tech Univ Ostrava IT4Innovations 17 Listopadu 15-2172 Ostrava 70833 Czech Republic

ISBN: (纸本)9789811393648;9789811393631

Floating car data (FCD) are one of the most important sources of traffic data. However, their processing requires several steps that may seem trivial but have far-reaching consequences. One such step is map-matching, i.e. assignment of the FCD measurement to the correct road segment. While it can be done very simply by assigning the point of measurement to the closest road, this approach may produce a highly undesirable level of error. The second challenge connected with processing of FCD measurements is missing measurements. They are usually caused by the shortcomings of GPS technology (e.g. the satellites can be obscured by buildings or bridges) and may deny us many measurements during longer downtimes. The last problem we will solve is the assignment of measurements to very short segments. FCD measurements are taken in periodic steps for several seconds long. However, some road segments are very short and can be passed by a car in the shorter interval. Such segments are therefore very difficult to monitor. We plan to solve all these problems through a combination of geometric map-matching with the dijkstra's shortest path algorithm.

关键词： Floating car data Map-matching Traffic routing dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Distribution Route Planning based on Collaboration of dijkstra and Sweep algorithm 10

Optimal Distribution Route Planning based on Collaboration o...

引用

10th Annual International Conference on Information Technology and Electrical Engineering (ICITEE)

作者： Zulfiqar, La Ode Mohamad Isnanto, R. Rizal Nurhayati, Oky Dwi Univ Diponegoro Informat Syst Semarang Indonesia Univ Diponegoro Comp Engn Semarang Indonesia

ISBN: (纸本)9781538647394

More than half of company's logistic budget is spent for the transportation matter. Hence, applying the efficient way to distribute things is exactly needed for the transportation system in order to gain better profit. The combination of dijkstra algorithm and Sweep algorithm is a novel method that able to resolve optimal distribution route planning. As we gain from our research that by utilizing this method we achieve the reduction of both distance travel and trip's time. We are gaining better solution for 9.3% in distance travel and successful cutting time travel for 500% from the original trip's time.

关键词： route optimization distribution dijkstra algorithm Sweep algorithm

来源：评论

学校读者我要写书评

暂无评论

Indoor optimal path planning based on dijkstra algorithm

Indoor optimal path planning based on Dijkstra Algorithm

引用

2015 International Conference on Materials Engineering and Information Technology Applications(MEITA 2015)

作者： Yicheng Xu Zhigang Wen Xiaoying Zhang School of Electronic Engineering Beijing University of Posts and Telecommunications Institute of Sensing Technology and Business BUPT

ISBN: (纸本)9781510812055

Providing optimal path information and the personal navigation path is the open issue for the pedestrian guided system. In order to solve the problems existing in the pedestrian guided system nowadays, such as the jagged paths which probable exist in the shortest path, and the lack of the considerations of different users' preferences, this paper firstly proposed a shortest path planning scheme for pedestrian, which is based on dijkstra algorithm. Then some measures have been done which can be used to smooth the jagged paths on the basis of shortest path. At last, considering the users' preferences generated by collecting and analyzing users' behavioral information, we optimize the paths in advance. Above all, this paper mainly comes up with an indoor personalized pedestrian guidance method with path smoothing function.

关键词： pedestrian guidance dijkstra algorithm path smoothing user preferences

来源：评论

学校读者我要写书评

暂无评论

Research on the Improvement of dijkstra algorithm in the Shortest Path Calculation

Research on the Improvement of Dijkstra Algorithm in the Sho...

引用

2017 4th International Conference on Machinery,Materials and Computer(MACMC 2017)

作者： Yong Huang College of Mathematics and Statistics Zhaotong University

ISBN: (纸本)9781510871038

dijkstra algorithm is proposed by Holland computer scientist dijkstra in 1959, and it is a typical shortest path algorithm, which can implement the shortest path planning in directed graphs. However, the traditional dijkstra algorithm can only compute simple shortest path planning problems, but it is not suitable for complex situations. Based on a project, this paper proposed an improved method of dijkstra algorithm. First, this paper interprets the dijkstra algorithm before being improved, and uses it to calculate the mine shortest path to avoid water, and then a method for improvement will be proposed later to introduce the concept of equivalent path and analyze the influence factor and weight of equivalent path. The conversion formula of the equivalent path and actual path will be obtained finally in the paper, where the equivalent path can realize the adaptive improvement to the dijkstra algorithm, and calculate on the best path to avoid water when the water inrush occurs.

关键词： dijkstra algorithm Improvement Water inrush disaster The best water avoidance path Equivalent path

来源：评论

学校读者我要写书评

暂无评论

Development of an image analysis code for hydrided Zircaloy using dijkstra's algorithm and sensitivity analysis of radial hydride continuous path

引用

JOURNAL OF NUCLEAR MATERIALS 2022年 564卷 1页

作者： Kim, Donguk Kim, Dongyeon Woo, Dahyeon Lee, Youho Seoul Natl Univ Dept Nucl Engn 1 Gwanak Ro Seoul 08826 South Korea

PROPHET, a software that conducts an image analysis of hydrided Zircaloy for Radial Hydride Fraction (RHF) and Radial Hydride Continuous Path (RHCP) evaluation using dijkstra's algorithm was developed. Enabling autonomous image quality adjustment capability, and user-defined noise and hydride detection sensitivity control options, PROPHET instrumentally ensures limited sensitivity to potential variation in quality of the Optical Image (OM) and post-characterization of hydrided Zircaloy. Sensitivity analyses were conducted for magnification and resolution of OM, input fracture toughness, and employed algorithms. x200 and 0.8M (i.e., 1024 x 774 ) were recommended for magnification and image resolution, respectively. Fracture toughness ratio of 1:50 for hydride to Zr-matrix was confirmed to be a sound choice and RHCP exhibits limited sensitivity to fracture toughness around fracture toughness ratio input of 1:50. algorithm has a large effect on RHCP. dijkstra's algorithm exhibits unmatched fidelity to identifying the least-resistant path (hence maximum RHCP). RHCP and RHF exhibit notable varations along the angular positions of a homogenously distributed hydrides on the surface of a tubular Zircaloy. The uncertainties of RHCP and RHF due to spatial hydride distributions call for (1) multiple image analysis for a statistically reliable RHCP evaluation or (2) low magnification but ultrahigh resolution OM to capture the significant fraction, if not all, of the entire cladding surface of interest. RHCP successfully correlates strain energy density of hydrided Zircaloy with limited accuracy. Introduction of a kernel function which instrumentally adjusts the importance of one or more factors that affect the mechanical behavior of hydrided Zirclaoy (i.e., hydrogen amount or RHF) may complement the accuracy of prediction.(c) 2022 Elsevier B.V. All rights reserved.

关键词： Radial hydride continuous path Radial hydride fraction Zirconium hydride Hydride embrittlement dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

dijkstra solution algorithm considering fuzzy accessibility degree for patch optimization problem

引用

APPLIED SOFT COMPUTING 2022年 130卷

作者： Nasiboglu, Resmiye Dokuz Eylul Univ Fac Sci Dept Comp Sci Izmir Turkey

One of the most widely used applications for urban public transport passengers, especially for tourists, are route recommendation applications. These applications are generally based on criteria such as the shortest route, the least number of line transfers, and the least travel time. In some recent studies, there are fuzzy models that consider qualitative indicators such as comfort and accessibility in addition to these criteria. In our study, a new model and a new Fuzzydijkstra algorithm based on the dijkstra algorithm are proposed to produce routes with the shortest path, the least transfer criteria, as well as the highest degree of accessibility. In the calculation of the accessibility degrees of the routes, concepts such as fuzzy stop neighborhoods, fuzzy intensity inside the bus, and fuzzy line accessibility were used. In the proposed algorithm, fuzzy penalty values are used to produce higher ranked routes. The validity of the proposed model and algorithm has been tested using Izmir city public transport network data. Optimal routes were generated for 100 source-target bus stop pairs that were handled randomly in the calculation experiments. Although the indicators such as the average distance traveled by the vehicle and the average number of transfers are approximately the same in the routes produced by the algorithms, it is seen that the Fuzzydijkstra algorithm gives better results compared to others with an average of 11.5% higher degree of accessibility and an average of 13.3% less walking distances between the transfer stops. In contrast, the Fuzzydijkstra algorithm used an average of 2.2% more time to solve. It is clear that this time delay, the actual value of which is less than 0.5 s, will not affect the practical use of the algorithm much.(c) 2022 Published by Elsevier B.V.

关键词： Public transport network Optimal path recommendation Fuzzy accessibility dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

dijkstra's algorithm to find the nearest vaccine location

引用

Procedia computer science 2023年 216卷 5-12页

作者： Melvin Siever Alvin Valentino Kristien Margi Suryaningrum Rezki Yunanda Computer Science Department School of Computer Science Bina Nusantara University Jakarta 11480 Indonesia.

Since the start of Covid-19 pandemic has made many people look for vaccine locations. In general, dijkstra algorithm is used to find the shortest path. The shortest path problem concentrates on finding the path with the minimum distance. The dijkstra algorithm was chosen because it has several advantages other than advantageous in terms of running time to find the shortest path. This research focuses on calculation and implementation of dijkstra algorithm that will result the shortest path with visual by Google Maps API. The project is tested with manual calculation first by using graph explanation. The graph is obtained based on route data obtained with the help of google maps then it is tested by implementing the dijkstra algorithm using HTML, JavaScript and also Google Maps API to visualize the nearest vaccine location. From the research founded that there were shortcomings problem where program had to enter each road turn as a vertex and an edge, If not including the entire path that was formed, it would pass through buildings or structures that should not be passed. The results that will be displayed on the website based on the purpose of the research.

关键词： COVID-19 dijkstra algorithm Location Shortest path Vaccination

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：