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

Hybrid adaptive routing in network-on-chips using KLSA with dijkstra algorithm

Research Journal of Applied Sciences, Engineering and Technology 2014年第21期8卷 2211-2219页

作者： Muthulakshmi, M. James Albert, A. Karpagam University Coimbatore Tamil Nadu India

The aim of this study is to analyse dynamic programming in large scale, complex networks is more important in the fields of scientific and engineering. Recent applications needs the analysis of scale-free networks with many millions of nodes and edges;presenting a huge computational challenge. Employing distributed networks on-chip infrastructure presents a unique opportunity of delivering power efficient and massive parallel accelerations. Dynamic Programming (DP) network is a massive parallel and high throughput network architecture, which provides real-time computation for shortest path problems. This network combines with the NoC to enable optimal traffic control based on the online network status and, provides optimal path planning and dynamic routing with proposed novel routing mechanics heuristic K-Step Look Ahead (KLSA) in deadlock free architecture. K-step look ahead routing algorithm based calculating the Manhattan distance has some disadvantages and it affects the overall performance of the routing algorithm. In order to overcome aforementioned disadvantages of manhattan distance and improving the efficiency of K-step looks ahead algorithm proposing a dijkstra algorithm for calculating the distance between two nodes. Here in implementation, the results are compared with existing routing schemas or algorithms like XY, DyAD, odd-even, odd-even routing with an NoP selection scheme. The DP network presents a simple, reliable and efficient methodology to enable adaptive routing in NoCs. © Maxwell Scientific Organization, 2014.

关键词： dijkstra algorithm Dynamic programming K-step look ahead Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Network-based dijkstra algorithm for Fault Location with Traveling Wave

Network-based Dijkstra Algorithm for Fault Location with Tra...

引用

China International Conference on Electricity Distribution (CICED)

作者： Zhou, Huifeng Tian, Ling Zeng, Xiangjun Yuan, Jun Changsha Univ Sci & Technol Hunan Prov Key Lab Smart Grids Operat & Control Changsha 410114 Hunan Peoples R China

ISBN: (纸本)9781467360654;9781467360630

In order to solve the problem caused by any fault in locating equipment, start-up failure and time record error of location failure on the traditional both-terminal traveling waves location on power line fault, the information fusion and Floyd algorithm have been proposed. But these algorithms have some shortages which include long time complexity and need undo network and the weight matrix cannot automatically generate etc. On the basis, this paper proposed a novel algorithm network-based dijkstra algorithm for fault location with traveling wave. The established PDR matrix can be used as basis of information fusion processing and the different matching combination of the traveling wave positioning device of each observation point, to find out the practical fault point. Simulation results show that the algorithm has a high precision and robustness for locating the power transmission line faults and the location error is less than 100m and has a good fault-tolerance.

关键词： fault location dijkstra algorithm shortest route power grid

来源：评论

学校读者我要写书评

暂无评论

The Application of the dijkstra algorithm in the Tourist Route Planning 5

The Application of the Dijkstra Algorithm in the Tourist Rou...

引用

5th International Conference on Fuzzy Systems and Data Mining (FSDM)

作者： Xu, Yonglin Zhang, Na Pu-Hua, Qiancan Northwest MinZu Univ Sch Math & Comp Sci Lanzhou Peoples R China

Taking Qinghai province as an example, dijkstra algorithm and Lingo software are used to design a tourist route with the most scenic spots and the shortest distance for tourists, to provide the theoretical basis for t... 详细信息

ISBN: (纸本)9781643680194;9781643680187

关键词： The shortest path dijkstra algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

dijkstra algorithm Implementing Services Composing Way Selection

Dijkstra Algorithm Implementing Services Composing Way Selec...

引用

Workshop on Intelligent Systems and Applications

作者： Yuqiang Li Qianxing Xiong School of Computer Science and Technology Wuhan University of Technology

ISBN: (纸本)9781424458721;9781424458745

Web services composing technique presents the wonderful outlook of flexibly and agilely constructing the enterprise applications for us. In this paper, we analyze the Web services composing model and propose a new method of computing the service's QoS value solving the problem that the QoS properties have different trend. At the same time, we try to use the dijkstra algorithm to implement the optimal services composing path selecting and provide the formal description of the algorithm implementing the optimal path selecting process.

关键词： Web services composing QoS dijkstra algorithm The optimal path

来源：评论

学校读者我要写书评

暂无评论

Application of dijkstra algorithm to Proposed Tramway of a Potential World Class University

引用

Applied Mathematics 2016年第6期7卷 496-503页

作者： M. C. Agarana N. C. Omoregbe M. O. Ogunpeju Department of Mathematics Covenant University Ota Nigeria Department of Computer and Information Science Covenant University Ota Nigeria

Nowadays, the development of “smart cities” with a high level of quality of life is becoming a prior challenge to be addressed. In this paper, promoting the model shift in railway transportation using tram network towards more reliable, greener and in general more sustainable transportation modes in a potential world class university is proposed. “Smart mobility” in a smart city will significantly contribute to achieving the goal of a university becoming a world class university. In order to have a regular and reliable rail system on campus, we optimize the route among major stations on campus, using shortest path problem dijkstra algorithm in conjunction with a computer software called LINDO to arrive at the optimal route. In particular, it is observed that the shortest path from the main entrance gate (Canaan land entrance gate) to the Electrical Engineering Department is of distance 0.805 km.

关键词： Potential World Class University Optimization dijkstra algorithm Shortest Path Tramway

来源：评论

学校读者我要写书评

暂无评论

Surface Optimal Path Planning Using an Extended dijkstra algorithm

引用

IEEE ACCESS 2020年 8卷 147827-147838页

作者： Luo, Min Hou, Xiaorong Yang, Jing Univ Elect Sci & Technol China Sch Automat Engn Chengdu 611731 Peoples R China Southwest Petr Univ Sch Elect Engn & Informat Chengdu 610500 Peoples R China

Extensive studies have been conducted on the dijkstra algorithm owing to its bright prospect. However, few of them have studied the surface path planning of mobile robots. Currently, some application fields (e.g., wild ground, planet ground, and game scene) need to solve the optimal surface path. This paper proposes an extended dijkstra algorithm. We utilize the Delaunay triangulation to model the surface environment. Based on keeping the triangle side length unchanged, the triangle mesh on the surface is equivalently converted into a triangle on the two-dimensional plane. Through this transformation, we set up the two-dimensional developable passable channel of the surface and solve the optimal route on this channel. Traversing all the two-dimensional developable and passable paths of the surface, we can get the shortest route among all the optimal paths. Then the inverse transformation from the two-dimensional plane coordinates to the corresponding surface coordinates obtains the surface optimal path. The simulation results show that, compared with the traditional dijkstra algorithm, this method improves the accuracy of the surface optimization path in single-robot single-target and multi-robot multi-target path planning tasks.

关键词： Path planning Euclidean distance Planning Transportation Task analysis Mobile robots Routing dijkstra algorithm path planning surface Delaunay triangulation mobile robots optimization methods

来源：评论

学校读者我要写书评

暂无评论

Crack path analysis of spent nuclear fuel cladding using the strain energy-based dijkstra algorithm

引用

NUCLEAR ENGINEERING AND DESIGN 2024年 429卷

作者： Baik, Jee A. Kim, Jung Jin Keimyung Univ Dept Mech Engn 1095 Dalgubeol Daero Daegu 42601 South Korea

The integrity of spent fuel cladding is crucial for preventing the release of radioactive materials, which pose significant risks to public safety and the environment. However, accurately predicting cracks in cladding tubes remains a challenge. This study proposes a novel method for predicting crack paths in spent nuclear fuel cladding tubes using the dijkstra algorithm, based on strain energy. In this method, cladding images are segmented into cladding and hydride pixels, followed by a finite element analysis to calculate the strain energy. The dijkstra algorithm utilizes this strain energy data from hydrides to predict crack paths in areas with low resistance to loading. The predicted path exhibited an accuracy of 92.78 % with respect to the initiation point of the actual crack path and was located within 200 mu m of the actual crack path. The proposed method demonstrates a higher similarity to the actual crack path than conventional image-based methods. These results suggest that the safety assessment of spent nuclear fuel can be enhanced, enabling the development of effective management strategies for spent nuclear fuel.

关键词： Crack path dijkstra algorithm Finite element analysis Spent nuclear fuel Strain energy

来源：评论

学校读者我要写书评

暂无评论

Evacuation route optimization under real-time toxic gas dispersion through CFD simulation and dijkstra algorithm

引用

JOURNAL OF LOSS PREVENTION IN THE PROCESS INDUSTRIES 2022年 76卷 104733-104733页

作者： Wang, Jiyun Yu, Xiaoyang Zong, Ruowen Lu, Shouxiang Univ Sci & Technol China State Key Lab Fire Sci Hefei 230026 Anhui Peoples R China Univ Sci & Technol China Suzhou Inst Adv Res Suzhou Key Lab Urban Publ Safety Suzhou 215123 Jiangsu Peoples R China

Evacuation route optimization plays an important role in safe evacuation for toxic leakage accidents. We propose an approach for route optimization under real-time toxic gas dispersion by combining computational fluid dynamics (CFD) code and the dijkstra algorithm. CFD code is used to simulate the toxic gas dispersion to predict the spatial-temporal distribution of concentrations, which is related to the calculation of the inhaled dose. Taking the dose as the weights of arcs, the concentrations predicted by CFD are embedded into the modified dijkstra algorithm to calculate the optimal route with minimal total inhaled dose. The results show that the time before evacuation affects the evacuation route optimization, and the death probability exhibits an "S"-shaped growth as time increases. The optimal route may vary with wind direction dominating the direction of toxic gas dispersion because of the change of weights of arcs. Workers wearing protective equipment are allowed to pass through areas with high-concentration toxic gas, and the length of the optimal evacuation route decreases with the level of safety protection. The proposed methodology with appropriate modification is suitable for evacuation route optimization in fires.

关键词： Route optimization Toxic gas dispersion CFD simulation dijkstra algorithm Inhaled dose

来源：评论

学校读者我要写书评

暂无评论

Transmission Line-Planning Method Based on Adaptive Resolution Grid and Improved dijkstra algorithm

引用

SENSORS 2023年第13期23卷 6214-6214页

作者： Nan, Guojun Liu, Zhuo Du, Haibo Zhu, Wenwu Xu, Shuiqing Hefei Univ Technol Sch Elect Engn & Automation Hefei 230000 Peoples R China

An improved dijkstra algorithm based on adaptive resolution grid (ARG) is proposed to assist manual transmission line planning, shorten the construction period and achieve lower cost and higher efficiency of line selection. Firstly, the semantic segmentation network is used to change the remote sensing image into a ground object-identification image and the grayscale image of the ground object-identification image is rasterized. The ARG map model is introduced to greatly reduce the number of redundant grids, which can effectively reduce the time required to traverse the grids. Then, the dijkstra algorithm is combined with the ARG and the neighborhood structure of the grid is a multi-center neighborhood. An improved method of bidirectional search mechanism based on ARG and inflection point-correction is adopted to greatly increase the running speed. The inflection point-correction reduces the number of inflection points and reduces the cost. Finally, according to the results of the search, the lowest-cost transmission line is determined. The experimental results show that this method aids manual planning by providing a route for reference, improving planning efficiency while shortening the duration, and reducing the time spent on algorithm debugging. Compared with the comparison algorithm, this method is faster in running speed and better in cost saving and has a broader application prospect.

关键词： dijkstra algorithm ground object-identification image adaptive resolution grid bidirectional search inflection point-correction

来源：评论

学校读者我要写书评

暂无评论

Exploring a New Adaptive Routing Based on the dijkstra algorithm in Optical Networks-on-Chip

引用

MICROMACHINES 2021年第1期12卷 54-54页

作者： Zheng, Yan-Li Song, Ting-Ting Chai, Jun-Xiong Yang, Xiao-Ping Yu, Meng-Meng Zhu, Yun-Chao Liu, Yong Xie, Yi-Yuan Southwest Univ Sch Elect & Informat Engn Chongqing 400715 Peoples R China Univ Elect Sci & Technol China Sch Optoelect Informat Chengdu 611731 Peoples R China

The photoelectric hybrid network has been proposed to achieve the ultrahigh bandwidth, lower delay, and less power consumption for chip multiprocessor (CMP) systems. However, a large number of optical elements used in optical networks-on-chip (ONoCs) generate high transmission loss which will influence network performance severely and increase power consumption. In this paper, the dijkstra algorithm is adopted to realize adaptive routing with minimum transmission loss of link and reduce the output power of the link transmitter in mesh-based ONoCs. The numerical simulation results demonstrate that the transmission loss of a link in optimized power control based on the dijkstra algorithm could be maximally reduced compared with traditional power control based on the dimensional routing algorithm. Additionally, it has a greater advantage in saving the average output power of optical transmitter compared to the adaptive power control in previous studies, while the network size expands. With the aid of simulation software OPNET, the network performance simulations in an optimized network revealed that the end-to-end (ETE) latency and throughput are not vastly reduced in regard to a traditional network. Hence, the optimized power control proposed in this paper can greatly reduce the power consumption of s network without having a big impact on network performance.

关键词： optical networks-on-chip dijkstra algorithm transmission loss optimized power control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：