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

path-finding algorithm as a dispersal assessment method for invasive species with human-vectored long-distance dispersal event

引用

DIVERSITY AND DISTRIBUTIONS 2022年第6期28卷 1214-1226页

作者： Lee, Sung-Joo Cho, Hyojin Choi, Yuyoung Choi, Won Il Chung, Hye In Lim, No Ol Nam, Youngwoo Jeon, Seongwoo Korea Univ Div Environm Sci & Ecol Engn Seoul 02841 South Korea Korea Environm Inst Environm Assessment Grp Sejong South Korea Korea Univ OJEONG Resilience Inst Seoul South Korea Natl Inst Forest Sci Forest Ecol Div Seoul South Korea Natl Inst Forest Sci Div Forest Dis & Insect Pests Seoul South Korea

Aim An assessment method that can precisely represent human-vectored long-distance dispersals (HVLDD) is currently in need for the effective management of invasive species. Here, we focussed on HVLDD happening along roads and proposed a path-finding algorithm as a more precise dispersal assessment tool than the most widely used Euclidean distance method by using pine wilt disease (PWD) as a case study. Location Busan Metropolitan City, Republic of Korea. Methods A path-finding algorithm, which calculates distances by considering the spatial distribution of road networks, was tested for its effectiveness in estimating dispersal distances of HVLDD events. To this end, annual HVLDD cases were classified from entire PWD occurrence data from 2016 to 2019, and their dispersal distances were calculated using the path-finding algorithm and the Euclidean distance method. We constructed potential dispersal ranges based on the occurrence points in 2016, 2017 and 2018 using the respective year's mean dispersal distance for both methods, and their performances in accounting for each subsequent year's HVLDD cases were compared to determine which method calculated more precise distances. The information on which road class contributed more to dispersal occurrences and distances was analysed as well using the proposed algorithm. Results The potential dispersal ranges of the path-finding algorithm accounted for more future anthropogenic infection cases than the ones that used the Euclidean distance method, validating its higher functionality. It also revealed that most HVLDDs started and ended on small roads, and large roads constituted the majority of the total dispersal length. Main conclusions The path-finding algorithm has proven to be a more effective dispersal assessment method for HVLDD events. It can help design effective control strategies. Thus, we encourage using the path-finding algorithm for the dispersal assessment of invasive species that move along road networks, and

关键词： dispersal assessment human-vectored dispersal invasive species long-distance dispersal path-finding algorithm pinewood nematodes

来源：评论

学校读者我要写书评

暂无评论

Shortest path finding in Quantum Networks With Quasi-Linear Complexity

引用

IEEE ACCESS 2023年 11卷 7180-7194页

作者： Santos, Sara Monteiro, Francisco A. Coutinho, Bruno C. Omar, Yasser Inst Telecomunicacoes P-1049001 Lisbon Portugal ISCTE Inst Univ Lisboa P-1649026 Lisbon Portugal Univ Lisbon Inst Super Tecn P-1049001 Lisbon Portugal Ctr Fis & Engn Mat Avancados CeFEMA Phys Informat & Quantum Technol Grp P-1049001 Lisbon Portugal PQI Portuguese Quantum Inst P-1049001 Lisbon Portugal

A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure based on quantum repeaters and with a finite number of pairs of entangled qubits available in each link. The network model considers that link purification is available such that a nested purification protocol can be applied at each link to generate entangled qubits with higher fidelity than the original ones. A low-complexity multi-objective routing algorithm to find the shortest path between any two given nodes is proposed and assessed for random networks, using a fairly general path extension mechanism that can fit a large family of particular technological requirements. Different types of quantum protocols require different levels of fidelity for the entangled qubit pairs. For that reason, the proposed algorithm identifies the shortest path between two nodes that assures an end-to-end fidelity above a specified threshold. The minimum requirements for the end-to-end entanglement fidelity depend on the whole extension of the paths, and cannot be looked at as a local property of each link. Moreover, one needs to keep track not only of the shortest path, but also of longer paths holding more entangled qubits than the shorter paths in order to satisfy the fidelity criterion. Thus, standard single parameter shortest-path algorithms do not necessarily converge to the optimal solution. The problem of finding the best path in a network subject to multiple criteria (known as multi-objective routing) is, in general, an NP-hard problem due to the rapid growth of the number of stored paths. This work proposes a metric that identifies and discards paths that are objectively worse than others. By doing so, the time complexity of the proposed algorithm scales near-to-linearly with res

关键词： quantum repeaters path-finding algorithm end-to-end fidelity multi-objective routing Quantum networks

来源：评论

学校读者我要写书评

暂无评论

Analog Integrated Circuit Routing Techniques: An Extensive Review

引用

IEEE ACCESS 2023年 11卷 35965-35983页

作者： Martins, Ricardo M. F. Lourenco, Nuno C. C. Inst Telecomunicacoes P-1049001 Lisbon Portugal Univ Lisbon Inst Super Tecn P-1049001 Lisbon Portugal

Routing techniques for analog and radio-frequency (A/RF) integrated circuit (IC) design automation have been proposed in the literature for over three decades. On those, an extensive set of geometric constraints have already been covered as surrogates for routing quality, but also, performance-related criteria were progressively included. However, as A/RF design moved into advanced integration technology nodes, the increasing number of design rules/constraints, wire resistance, congestion, and interwire parasitic growth is constantly challenging existing automatic routing techniques and keeping pressure on their improvement. Fortunately, recent developments in modern workstations' capabilities allowed the growth of sophisticated routing processes, including some assisted by the latest machine and deep learning methods, offering unprecedented solutions for the automation of this task. Still, as the correlation between routing-induced parasitic structures and the circuit's functional behavior is far from simple, computational-intensive parasitic-inclusive and layout-aware synthesis techniques have also been proposed, where automatic routing techniques play a decisive role. This paper conducts an extensive review of A/RF IC routing techniques, from the digitally-inspired earliest approaches to state-of-the-art developments, providing a complete and comprehensive guide for circuit designers and design automation developers while defining research lines to facilitate more activities within this field.

关键词： Routing Radio frequency Wires Integrated circuits Generators Python Task analysis Machine learning Analog and radio-frequency automatic routing layout-aware synthesis machine learning parasitic-inclusive synthesis path-finding algorithm physical design

来源：评论

学校读者我要写书评

暂无评论

Pore structure characterization through path-finding and Lattice Boltzmann simulation

引用

ADVANCES IN WATER RESOURCES 2020年 141卷 103609-103609页

作者： Viberti, Dario Peter, Costanzo Borello, Eloisa Salina Panini, Filippo Politecn Torino Dept Environm Land & Infrastruct Engn I-10129 Turin Italy

Characterization of underground porous media parameters at the micro and macro scales is fundamental in geosciences. A thorough comprehension of flow phenomena requires analyses and observations at the micro scale through adoption of micromodels as representative as possible of real geological formations. In this paper we focus on the analysis of 2D binary images of real rock thin sections to characterize pore network geometry and to estimate effective porosity, pore size distribution and tortuosity with the aim of providing suitable information for designing micromodels. To this end, a geometrical analysis of the pore structure, based on the identification and characterization of the set of the shortest geometrical pathways between inlets and outlets pairs, was implemented. The geometrical analysis is based on a path-finding algorithm derived from graph theory. Results provided by geometrical analysis were validated against hydrodynamic numerical simulation via the Lattice Boltzmann Method (LBM). Results show that the path-finding approach provides reasonable and reliable estimates of tortuosity and can be successfully applied for analyzing the distribution of effective pore radius, as well as for estimating the effective porosity.

关键词： Pore structure Tortuosity Lattice Boltzmann method path-finding algorithm Effective porosity

来源：评论

学校读者我要写书评

暂无评论

Application of a* algorithm for Tortuosity and Effective Porosity Estimation of 2D Rock Images 48th

Application of a* Algorithm for Tortuosity and Effective Por...

引用

48th International Conference on Advanced Problems in Mechanics, 2020

作者： Panini, Filippo Salina Borello, Eloisa Peter, Costanzo Viberti, Dario Politecnico Di Torino Turin10129 Italy

ISBN: (纸本)9783030921439

Characterization and understanding of fluid flow phenomena in underground porous media at the micro and macro scales is fundamental in reservoir engineering for the definition of the optimal reservoir exploitation strategy. Laboratory analyses on rock cores provide fundamental macroscale parameters such as porosity, absolute and relative permeability and capillary pressure curves. In turn, macroscale parameters as well as flow behavior, are strongly affected by the micro geometrical features of the rock, such as pore structure, tortuosity and pore size distribution. Therefore, a thorough comprehension of single and multiphase flow phenomena requires analyses, observations and characterization at the micro scale. In this paper we focus on the analysis of a 2D binary image of a real rock thin section to characterize the pore network geometry and to estimate tortuosity, effective porosity and pore size distribution. To this end, a geometrical analysis of the pore structure, based on the identification and characterization of the set of the shortest geometrical pathways between inlets and outlets pairs, is implemented. The geometrical analysis is based on the A* path-finding algorithm derived from graph theory. The results provided by the geometrical analysis are validated against hydrodynamic numerical simulation via the Lattice Boltzmann Method (LBM), which is well suited for simulating fluid flow at the pore-scale in complex geometries. The selected rock for this analysis is Berea sandstone, which is recognized as a standard rock for various applications such as core analysis and flooding experiment. Results show that the path-finding approach provides reasonable and reliable estimates of tortuosity and can be successfully applied for analyzing the distribution of effective pore radius, as well as for estimating the effective porosity. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Effective porosity Lattice Boltzmann Method path-finding algorithm Tortuosity

来源：评论

学校读者我要写书评

暂无评论

Research on a community life route guidance system based on virtual reality technology

Research on a community life route guidance system based on ...

引用

作者： Qianmu Zheng Academy of Architecture Tsinghua University

Virtual reality technology holds significant potential for applications in the field of urban visualization, although it is primarily utilized for showcasing architectural forms or aiding in planning and design processes. To enhance the integration of urban visualization technology into the everyday lives of ordinary residents and expand the user base beyond planners, this paper introduces the ‘Community Life Route Guidance System', leveraging the presentation of ‘economic livelihood' to afford residents interactive experiences within authentic living scenarios. By incorporating and aligning the location and information of Points of Interest(POIs) within the urban model of a single community and its surrounding neighborhoods, it generates, calculates, and filters 'life routes' comprising four categories of commercial nodes. The objective is to serve new residents in the community by providing life guidance or to offer prospective homebuyers a reference point for the convenience of community commercial facilities. The specific technical pathway encompasses: constructing an environmental model, processing and associating POI data, life path identification based on the Dijkstra algorithm, and path visualization with user interaction.

关键词： City visualization Community Information services path-finding algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of A* algorithm for microstructure and transport properties characterization from 3D rock images

引用

ENERGY 2022年第PartC期239卷 122151-122151页

作者： Borello, Eloisa Salina Peter, Costanzo Panini, Filippo Viberti, Dario Politecn Torino Corso Duca degli Abruzzi 24 I-10129 Turin Italy Ctr Sustainable Future Technol Via Livorno 60 I-10144 Turin Italy

Thorough comprehension of flow behavior in underground porous media is fundamental for several applications such as oil and gas production, Underground Gas Storage, CO2 storage, and Enhanced Geothermal Systems. Macroscale petrophysical parameters, as well as hydraulic parameters, are strongly linked to the microstructure of the rock. In this paper, we present a methodology for the geometric analysis and characterization of the pore structure of 3D binary images of rocks. The geometric analysis is based on the A* pathfinding algorithm extended to 3D domains and on the measurement of the pore radius along the identified paths. The analysis is carried out for the main flow directions to obtain a tensorial representation of tortuosity, effective porosity, and representative pore radius, to provide permeability estimation and effective characterization of anisotropy. Moreover, the approach provides the analysis of pore size distribution and constriction. The methodology was applied to synthetic but realistic rock samples, generated through the QSGS algorithm. Two case studies, representative of an isotropic and an anisotropic porous media, are pre-sented. Validation was carried out through comparison with FVM hydrodynamic modeling. Analysis of the results shows that the presented geometric approach can provide thorough and reliable character-ization of the porous media. (c) 2021 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： Reservoir Porous media path-finding algorithm Tortuosity Permeability Anisotropy

来源：评论

学校读者我要写书评

暂无评论

Faster pipe auto-routing using improved jump point search

引用

INTERNATIONAL JOURNAL OF NAVAL ARCHITECTURE AND OCEAN ENGINEERING 2020年 12卷 596-604页

作者： Min, Jwa-Geun Ruy, Won-Sun Park, Chul Su Chungnam Natl Univ Grad Sch Dept Naval Architecture & Ocean Engn Daejeon South Korea Chungnam Natl Univ Dept Naval Architecture & Ocean Engn Daejeon South Korea Sv Plant Engn Seoul South Korea

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution. (C) 2020 Society of Naval Architects of Korea. Production and hosting by Elsevier B.V.

关键词： Pipe routing path-finding algorithm Jump Point Search (JPS) Design automation Optimization

来源：评论

学校读者我要写书评

暂无评论

pathBot: An Intelligent Chatbot for Guiding Visitors and Locating Venues 6

PathBot: An Intelligent Chatbot for Guiding Visitors and Loc...

引用

6th International Conference on Soft Computing and Machine Intelligence (ISCMI)

作者： Mabunda, Katlego Ade-Ibijola, Abejide Univ Johannesburg Sch Consumer Intelligence & Informat Syst Dept Appl Informat Syst Formal Struct Algorithms & Ind Applicat Res Clust Auckland Pk Bunting Rd Campus Johannesburg South Africa

ISBN: (纸本)9781728145778

This article reports the development of an intelligent Chatbot called pathBot. pathBot is used to guide visitors to locate venues on the University of Johannesburg's Bunting Road campus. The conversation of pathBot happens through a Mobile Application client. pathBot processes user's text using the DialogFlow API. We have designed a Finite Automaton that represents a sub-map of the campus. Extracted tokens from the DialogFlow API is sent to this Automaton, and an algorithm is used to generate descriptions of paths from where a user is, to where they want to go. An evaluation of the user's opinion about this tool and its userability was conducted and most users agreed that this Automaton-driven tool is helpful in locating venues on the mapped campus.

关键词： artificial intelligence finite automata Chatbot, natural language processing path-finding algorithm

来源：评论

学校读者我要写书评

暂无评论

A New Approach to path-finding by Possibilities Search 7

A New Approach to Path-finding by Possibilities Search

引用

Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS)

作者： Benoit, Vallade Nakashima, Tomoharu Osaka Prefecture Univ Dept Comp Sci & Intelligent Syst Osaka Japan

ISBN: (纸本)9781479959556

This paper presents a new approach to the pathfinding in video games. path-finding algorithms, are used to find a path between two positions of a map. The standard way consists to search for a specific path. However it appears that in actual games, where the allowed computation time becomes smaller and the game-plays and maps are more complex, it should not be the best way to proceed. Therefore, this new approach to the pathfinding considers the global possibilities of movement instead of searching for a specific path. This paper describes the concept of possibility and details the procedure used to search them. The appreciable experiments results prove the validity and efficiency of this approach.

关键词： path-finding algorithm Dijkstra algorithm A star algorithm Monte Carlo Tree Search algorithm notion of possibility video games map simplification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：