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

2017 3rd IEEE International Conference on Control science and systems Engineering (ICCssE)

作者： Jing Zhang Jia Yu Xiangju Qu Yu Wu School of Aeronautic Science and Engineering Beihang University College of Aerospace Engineering Chongqing University

ISBN: (纸本)9781538604854

safety and efficiency of carrier flight deck are two important factors that have great effects on the comprehensive performance of carrier. This paper studies on path planning algorithms for carrier aircraft on the deck in consideration of safety and efficiency requirements. Firstly, a kinematic model of the carrier aircraft, obstacle avoidance models and boundary constraints are proposed. subsequently, search zone for path planning is designed based on geometry. Then, the optimal path is computed according to dijkstra’s algorithm and the details are described by steps. Finally, an example is simulation to verify the rationality and the effectiveness of the path planning algorithms.

关键词： carrier aircraft path planning obstacle avoidance geometry dijkstra’s algorithm

来源：评论

学校读者我要写书评

暂无评论

Design of a Modified dijkstra’s algorithm for finding alternate routes for shortest-path problems with huge costs.

Design of a Modified Dijkstra’s Algorithm for finding alter...

引用

Mathematics, Computer Engineering and Computer science (ICMCECs), International Conference in

作者： Omoniyi Ajoke Gbadamosi Dayo Reuben Aremu Department of Mathematical Sciences Ondo State University of Science and Technology (OSUSTECH) Okitipupa Nigeria Department of Computer Science University of Ilorin Ilorin Nigeria

ISBN: (数字)9781728131269

ISBN: (纸本)9781728131276

The classical dijkstra's algorithm has been widely used in shortest path problems. It is indeed one of the most referenced shortest path algorithms. However, it is observed that in certain circumstances finding shortest paths between given nodes may be achieved at a huge cost especially where time and efforts are of significant consideration. such cases are the basic consideration in this study. solution to such situations requires a modified dijkstra's algorithm, which is proposed in this study. The methodology entailed creation of a text file containing the nodes, edges and probabilities of moving between edges. The probabilities were generated using a random number generation scheme. The contents of the text file were read character by character and the proposed dijkstra's algorithm was invoked. The algorithm was tested using a 40-node graph; and the possible routes were generated. The findings revealed the shortest route and implies therefore that the proposed modified dijkstra's algorithm can be used as alternative to the classical dijkstra's strategy whenever the need *** next phase of this ongoing research will compute the complexity of the modified algorithm using both the analytical and numerical computation, in order to establish how it compares with the classical dijkstra's algorithm.

关键词： dijkstra’s algorithm Complexity Graph Cost Matrix shortest path shortest path Text files shortest path problem Line graph algorithms Probability Complexity shortest path algorithms FINDINGs Modified numerical calculation

来源：评论

学校读者我要写书评

暂无评论

Electric scooters and Renewable Energy Integration Associated with Tourist Parks: A dijkstra-Based Model for smart Mobility Optimization 17th

Electric Scooters and Renewable Energy Integration Associate...

引用

17th Workshop of Hybrid Intelligent systems, HIs 2024, 17th Workshop on Intelligent Learning Environments, WILE 2024 and 6th Workshop on New Trends in Computational Intelligence and Applications, CIAPP 2024, held in conjunction with Mexican International Conference on Artificial Intelligence, MICAI 2024

作者： Espadas-Baños, Gilberto Quej-solís, César Flota-Bañuelos, Manuel Ochoa-Zezzatti, Alberto Facultad de Ingeniería Universidad Autónoma de Yucatán Av. Industrias No Contaminantes Por Periférico Norte Apdo. Postal 150 Cordemex Yucatán MéridaC.P. 97310 Mexico Doctorado en Tecnología Universidad Autónoma de Ciudad Juárez Av. Plutarco Elías Calles #1210 Fovissste Chamizal Chihuahua Ciudad JuárezC.P. 32310 Mexico

ISBN: (纸本)9783031838781

This research presents a novel strategy to enhance ecotourism in Yucatán’s national parks by integrating electric scooters with solar energy systems, focusing on Los Petenes National Park, noted for its biodiversity and ecological significance. The study identifies 27 recreational activities within the park and proposes an optimization model aimed at improving tourist mobility, particularly for visitors unaccustomed to the region’s high temperatures. This system not only reduces the risk of heat-related illnesses but also enhances the overall visitor experience through a convenient and sustainable transportation option. Utilizing dijkstra’s algorithm, a graph of the park’s key recreational points was constructed to optimize tourist routes, minimizing waiting times and unnecessary travel. To select the most suitable electric scooter for these optimized routes, the Technique for Order Preference by similarity to Ideal solution (TOPsIs) was applied, evaluating multiple criteria such as performance, user experience, and sustainability. The GoTrax GXL V2 scooter was identified as the optimal choice, aligning with both operational requirements and visitor preferences. The integration of a photovoltaic system ensures that the energy demands of the scooter fleet are met through renewable sources, significantly reducing carbon emissions and operational costs. This renewable energy component directly supports the optimized transportation system, reinforcing the park’s commitment to environmental conservation. The proposed model not only enhances the overall visitor experience by providing a convenient and sustainable transportation option but also contributes to the local economy by fostering economic opportunities in the region. The study offers a scalable and adaptable approach for other parks and tourist destinations seeking to implement eco-friendly technologies and sustainable practices in their operations. © The Author(s), under exclusive license to springer Nature swit

关键词： dijkstra’s algorithm Ecotourism Electric scooters Hybrid Energy systems Renewable Energy sustainable Mobility TOPsIs Tourism Activities Optimization

来源：评论

学校读者我要写书评

暂无评论

Distance driven graph neural network for advanced node classification through feature augmentation

引用

Discover Computing 2025年第1期28卷 1-39页

作者： Khan, Imran Bokhari, Mohammad Ubaidullah Afzal, shahnwaz Alam, shadab Computer Science Aligarh Muslim University Aligarh India Engineering and Computer Science Jazan University Jazan Saudi Arabia

Graph analysis has become much more efficient and expressive due to the Graph Neural Networks (GNNs). However, traditional GNNs often face challenges such as oversmoothing feature sparsity and global structural sensitivity. The Distance-Driven Graph Neural Network (DDGNN) is a new method introduced in this paper that makes the representation of node features better by using marker nodes that are picked at random and in strategic way to find the shortest paths. With these marker nodes, DDGNN effectively stops features from becoming too smooth while keeping their uniqueness across multiple layers. It also encodes the global structural information explicitly. The experimental results indicate that DDGNN keeps its high level of classification accuracy at deeper levels with little performance loss. Compared to standard GNN architectures, DDGNN achieves a performance improvement of 1.5% on CORA and Citeseer and 3% on PubMed. The model’s robustness and ability to generalize have been tested across a number of hyperparameter settings and two dataset splits (public and complete). These findings show that DDGNN has the potential to handle complex graph structures while greatly improving the accuracy of node classification and the expressiveness of models.

关键词： dijkstra’s algorithm Graph augmentation Graph isomorphism Graph mining Graph neural network Network analysis Node classification Node feature augmentation

来源：评论

学校读者我要写书评

暂无评论

An improved Isomap method for manifold learning

引用

International Journal of Intelligent Computing and Cybernetics 2017年第1期10卷 30-40页

作者： Taiguo Qu Zixing Cai College of Computer Science and Technology Hengyang Normal UniversityHengyangChina Hunan Provincial Key Laboratory of Intelligent Information Processing and Application HengyangChina School of Information Science and Engineering Central South UniversityChangshaChina

Purpose-Isometric feature mapping(Isomap)is a very popular manifold learning method and is widely used in dimensionality reduction and data *** most time-consuming step in Isomap is to compute the shortest paths between all pairs of data points based on a neighbourhood *** classical Isomap(C-Isomap)is very slow,due to the use of Floyd’s algorithm to compute the shortest *** purpose of this paper is to speed up ***/methodology/approach-Through theoretical analysis,it is found that the neighbourhood graph in Isomap is *** this case,the dijkstra’s algorithm with Fibonacci heap(Fib-Dij)is faster than Floyd’s *** this paper,an improved Isomap method based on Fib-Dij is *** using Fib-Dij to replace Floyd’s algorithm,an improved Isomap method is presented in this ***-Using the s-curve,the swiss-roll,the Frey face database,the mixed national institute of standards and technology database of handwritten digits and a face image database,the performance of the proposed method is compared with C-Isomap,showing the consistency with C-Isomap and marked improvements in terms of the high *** also demonstrate that Fib-Dij reduces the computation time of the shortest paths from O(N3)to O(N2lgN).Research limitations/implications-Due to the limitations of the computer,the sizes of the data sets in this paper are all smaller than 3,***,researchers are encouraged to test the proposed algorithm on larger data ***/value-The new method based on Fib-Dij can greatly improve the speed of Isomap.

关键词： dijkstra’s algorithm Fibonacci heap Floyd’s algorithm Isomap Manifold learning shortest path Paper type Research paper

来源：评论

学校读者我要写书评

暂无评论

Effect of Adjacent support Condition on Premature Wood Crosstie Failure (May, 10.1007/s40515-021-00168-5, 2021)

引用

TRANsPORTATION INFRAsTRUCTURE GEOTECHNOLOGY 2022年第4期9卷 563-564页

作者： soufiane, Kenza Zarembski, Allan M. Palese, Joseph W. Univ Delaware Dept Civil & Environm Engn Newark DE 19711 USA

Railroad crossties (sleepers) are a key component of the track structure and play an important role in the support of the track structure and the distribution of train loading through the track. The condition of the crossties has been traditionally monitored by visual inspection, which has, in recent years, been supplemented with automated crosstie inspection systems. These provide more accurate information about the condition of each individual crosstie and as such are important in planning and optimizing tie replacement. By using inspection data taken from the same track in different years, it is possible to determine the degradation of ties, and corresponding life of the ties, and to develop improved tie life models that take into account local conditions. The aim of this paper is to provide a method to predict and model tie life based on support condition, as defined by the condition of adjacent crossties. Tie life is modeled using mathematical techniques, such as piecewise reconstruction which allows for the determination of the probability of tie failure as a function of loss of support. The analysis approach, using dijkstra’s algorithm and Markov chains, is based on the use of tie condition data from two different inspections performed over a span of 3 years. The dataset, which consists of approximately 100,000 ties, included tie inspection data for inspections carried out on the same track during the period 2016 to 2019. Ties are grouped based on their support condition, specifically the loss of support associated with the presence of poor or failed ties on either side of the study tie. The results present average tie life as a function of different support conditions and confirm the fact that loss of support contributes measurably to premature tie failure. This reduction in tie life is presented as a function of tie support condition and compared to earlier studies.

关键词： Adjacency condition dijkstra’s algorithm Life reduction factor Loss of support Markov chains Premature tie failure Tie life modeling Wood crossties

来源：评论

学校读者我要写书评

暂无评论

α-Reliable shortest Path Problem in Uncertain Time-Dependent Networks

引用

International Journal of Applied and Computational Mathematics 2022年第4期8卷 1-12页

作者： Biswal, sagarika Ghorai, Ganesh Mohanty, s.P. Department of Mathematics Nimapara Autonomous College Nimapara Puri 752106 India Department of Applied Mathematics With Oceanology and Computer Programming Vidyasagar University West Bengal Midnapore 721102 India Department of Mathematics Siksha ‘O’ Anusandhan University (SOA) Bhubaneswar 751030 India

In a congested road network, it is always desirable to find a reliable shortest path so far as travel time is concerned. Physical distance and travel time are invariably uncertain due to large-scale maintenance work, natural disaster, heavy accident, weather conditions, etc. Many researchers considered travel time to be stochastic where the Bellman’s principle of optimality is not preserved. Also, any sub-path of a shortest path is not necessarily shortest. some researchers find non-dominated paths under different variants as a multi-objective optimization problem. Moreover, in the absence of sample data, probability theory cannot be used. In this work, the travel time is considered to be uncertain variable, where no sample data is required and it is established that Bellman’s principle of optimality is preserved. so, in contrast to the stochastic environment, classical dynamic approach can be used to find the α-reliable shortest path using uncertainty theory. © 2022, The Author(s), under exclusive licence to springer Nature India Private Limited.

关键词： dijkstra’s algorithm Non-dominated path Pre-trip planning Reliable shortest path Travel time Uncertain variable

来源：评论

学校读者我要写书评

暂无评论

script independent text segmentation of document images using graph network based shortest path scheme

引用

International Journal of Information Technology (singapore) 2023年第4期15卷 2247-2261页

作者： sahare, Parul Tembhurne, Jitendra V. Parate, Mayur R. Diwan, Tausif Dhok, sanjay B. Department of Electronics and Communication Engineering Indian Institute of Information Technology Maharashtra Nagpur India Department of Computer Science and Engineering Indian Institute of Information Technology Maharashtra Nagpur India Centre for VLSI and Nanotechnology Visvesvaraya National Institute of Technology Maharashtra Nagpur India

Document image processing is one of the growing research fields in the digital world for applications like data base indexing, text recognition, signature verification, web-searching engines, etc. segmenting intermixed texts (handwritten and machine-printed) from documents is a difficult task. In this paper, script independent text-line and word segmentation techniques are proposed. For text-line segmentation, dijkstra’s algorithm is employed, whereas for segmenting words, wavelet transform is used. Text-line segmentation is modeled as a general image segmentation task. dijkstra’s algorithm is a shortest path planning method, which is utilized for boundary growing process. This forms potential text-line boundary regions. For word segmentation, energy map is calculated first using wavelet transform and further, Gaussian filter is used for text-blocks creation. Proposed techniques are evaluated on different databases contain documents of different scripts. Benchmarking analysis is performed with other approaches where highest segmentation accuracies of 97.6% and 98.1% are obtained by text-line and word segmentation techniques, respectively. © 2023, The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of Computer Applications and Management.

关键词： dijkstra’s algorithm Document image analysis script independent Text processing Text segmentation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimální plánování trasy pro elektromobily

Optimální plánování trasy pro elektromobily

引用

作者： Horák, Filip Brno University of Technology

Tato diplomová práce se zabývá plánováním optimální trasy pro elektromobily. V první, teoretické části této práce probíhá uvedení pr... 详细信息

Tato diplomová práce se zabývá plánováním optimální trasy pro elektromobily. V první, teoretické části této práce probíhá uvedení problematiky a popis několika heuristických metod, které byly pro řešení optimalizačních úloh použity. Praktická část práce se zabývá software implementací popsaných metod. Na závěr je provedeno několik experimentů a porovnání výsledků jednotlivých metod.

关键词： Dijkstrův algoritmus A* dynamické programování celočíselné programování plánování cesty elektromobil plug-in hybrid. dijkstra’s algorithm A* dynamic programming integer programming route planning electric vehicle plug-in hybrid vehicle. Text

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：