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

breadth-first search algorithm on the finite element simulation of the electrical resistivity of the carbon black elastomeric pressurized sensor

引用

COMPOSITES PART A-APPLIED SCIENCE AND MANUFACTURING 2024年 187卷

作者： Haghgoo, Mojtaba Alidoust, Alireza Ansari, Reza Jamali, Jamaloddin Hassanzadeh-Aghdam, Mohammad Kazem Univ Guilan Fac Mech Engn Rasht Iran Amer Univ Middle East Coll Engn & Technol Kuwait Kuwait Univ Guilan Fac Technol & Engn Dept Engn Sci Rudsar Vajargah Iran

Resistivity and piezoresistive sensitivity of Carbon Black (CB) elastomeric nanocomposites are studied using a finite element method with a conductive network model. CB spheres are placed into Representative Volume Elements (RVEs) in random positions to perform simulations and obtain the strained state and new position of particles. Numerical results are implemented into a breadth-first search algorithm tailored to find percolation pathways from one end of the RVE to another based on the shortest distance between CBs in the strained regime. Percolation pathways are used by the conductive network model to determine the critical distance for resistivity. Resistivity diminishes as the critical distance increases attributed to a greater number of electrons penetrating the barriers. Critical distance at which tunneling can occur expands with an increase in barrier potential. Smaller CBs that can more efficiently occupy the gaps lead to a reduction in the critical distance range necessary for percolation to happen.

关键词： Resistivity Finite Element Method breadth-first search algorithm Carbon Black

来源：评论

学校读者我要写书评

暂无评论

Pathfinding in Procedurally Generated Mazes 6

Pathfinding in Procedurally Generated Mazes

引用

2024 International Conference on Smart Systems and Technologies

作者： Kupresak, Matej Livada, Caslav Galba, Tomislav Baumgartner, Alfonzo Fac Elect Engn Comp Sci & Informat Technol Osijek Osijek Croatia

ISBN: (纸本)9798350386394;9798350386400

This paper presents the development of a simulator for procedural generation of mazes and evaluation of pathfinding algorithms. The implementation includes a Perlin noise-based procedural generation where the generated noise determines the colors of the terrain, increasing the realism of the terrain. The Unity interface allows the user to control and change these properties. Two pathfinding algorithms, namely Dijkstra's algorithm and the breadth-first search algorithm, are used to test and analyze their effectiveness. The algorithms use positional data to identify and display feasible paths between specific points. The integrated user interface provides a straightforward platform to experiment with the algorithms and visualize their results, including the number of nodes in the path and the duration of pathfinding. In addition, a graphical representation allows real-time tracking of the player's movement along the selected path. The results presented provide valuable insights for selecting algorithms for specific scenarios. Overall, this simulator is a valuable tool for researchers and developers involved in maze generation and pathfinding algorithm evaluation.

关键词： breadth-first search algorithm Dijkstra's algorithm Perlin noise procedural generation pathfinding.

来源：评论

学校读者我要写书评

暂无评论

RetroSynX: A retrosynthetic analysis framework using hybrid reaction templates and group contribution-based thermodynamic models

引用

CHEMICAL ENGINEERING SCIENCE 2022年第PartB期248卷 117208-117208页

作者： Wang, Wenlong Liu, Qilei Zhang, Lei Dong, Yachao Du, Jian Dalian Univ Technol Sch Chem Engn Inst Chem Proc Syst Engn Dalian 116024 Peoples R China

Organic synthesis plays an essential role in the pharmaceutical industry. The drug synthesis route design is a critical decision step to convert raw materials to drug products. Traditionally, knowledge-based methods are commonly used for the design of the synthesis route. However, this type of method is expensive and time-consuming, which hinders the high-throughput design of the synthesis route. In this article, a retrosynthetic analysis framework is established based on hybird reaction templates and Group Contribution (GC)-based thermodynamic models. first, a hybrid database consisting of partial atom mapping and full atom-mapping reaction templates is constructed utilizing well-studied organic reactions from literature. Second, numerous virtual reactions are generated from reaction templates with respect to the target molecule, and reaction thermodynamic models based on the GC method are developed to validate the effectiveness of those virtual reactions in a timely fashion. Finally, breadth-first search (BFS) algorithm is employed to search candidate retrosynthesis pathways which are thermodynamically feasible. In this procedure, five evaluation criteria are used to identify the top-ranked retrosynthesis pathways through evaluating and optimizing the candidate retrosynthesis pathways, including Fathead Minnow 96-hr LC50 (LC50FM), flash point (Fp), Natural Product-likeness Score (NPScore), Synthesis Accessibility Score (SAScore), and Synthesis Complexity Score (SCScore). A retrosynthetic analysis tool called "RetroSynX" is developed using the proposed framework. With the help of the developed framework and tool, synthesis routes considering thermodynamic feasibility can be obtained. Three case studies involving Aspirin, Ibuprofen and ZatoSetron are presented to highlight the feasibility and reliability of the proposed framework. (C) 2021 Elsevier Ltd. All rights reserved.

关键词： Retrosynthesis pathway design Reaction template Reaction equilibrium constant Group contribution method breadth-first search algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheme for tour planning of mobile sink in wireless sensor networks

引用

IET COMMUNICATIONS 2020年第3期14卷 430-439页

作者： Anwit, Raj Tomar, Abhinav Jana, Prasanta K. Indian Inst Technol Indian Sch Mines Comp Sci & Engn Dhanbad Bihar India

Exploiting mobile sink (MS) for data gathering in the wireless sensor networks has been extensively studied in the recent researches to address energy-hole issues, thereby facilitating balanced energy consumption among nodes and so prolonging network lifetime. However, such approaches suffer from an extended data collection delay causing buffer overflow problem. In this regard, finding the optimal number of locations (i.e. rendezvous points (RPs) where the MS sojourns for data collection), is not only of utmost importance, but also a challenging task. A novel scheme for trajectory design of MS for data collection is presented in this study. The authors' primary goal is to optimise the number of RPs and their locations to minimise the travelling length of the MS. first, they reduced the problem size by using a combination of breadth-first search and Tarjan's algorithm and then applied spectral clustering to find the optimal set of RPs to plan the tour for the MS. They have performed extensive simulations, and the results are compared with relevant existing schemes. The comparative results confirm the effectiveness of their approach in terms of the number of RPs, path length, the variance of RPs, and energy consumption per round.

关键词： pattern clustering wireless sensor networks telecommunication network planning mobile radio telecommunication network reliability search problems wireless sensor networks energy-hole issues balanced energy consumption network lifetime extended data collection delay RP mobile sink data gathering tour planning scheme MS buffer overflow problem rendezvous point Tarjan's algorithm breadth-first search algorithm spectral clustering

来源：评论

学校读者我要写书评

暂无评论

A dynamic rescue route planning method based on 3D network in mine water inrush hazard

引用

GEOMATICS NATURAL HAZARDS & RISK 2019年第1期10卷 2387-2407页

作者： Zhao, Xiangwei Wang, Qingzhong Xie, Bin Pan, Shun Ji, Min Shandong Univ Sci & Technol Key Lab Geomat & Digital Technol Shandong Prov Qingdao Peoples R China Shandong Elect Power Engn Consulting Inst Co Ltd Jinan Peoples R China Shandong Univ Sci & Technol Shandong Prov 3S Engn Res Ctr Qingdao Peoples R China

Water inrush in mine is one of the most common hazards in the mining industry. To solve the problem of rescue route planning during a mine water inrush hazard, a dynamic rescue route planning method based on a 3D network is proposed. first, the basic elements in the 3D network model of the mine roadway are abstractly described, furthermore, the weights of edges, the topological connectivity of the elements, and the data structure of the network are defined. Then, the Dijkstra algorithm and the breadth-first search algorithm are combined to implement the best rescue search route and return route planning based on the 3D network model. Finally, the dynamic rescue route planning is simulated in 3D virtual spatial scenario of a real mine. The factors such as topological connectivity of the elements, real-time water level, and slope of the mine roadways are considered in the process of rescue route planning, as the rescue route is adjusted dynamically according to the actual situations. This method proposed can provide powerful decision support for mine water inrush hazard rescue.

关键词： Mine water inrush hazard dynamic rescue route planning 3D (three-dimensional) spatial network model of mine roadways Dijkstra algorithm breadth-first search algorithm

来源：评论

学校读者我要写书评

暂无评论

Order consolidation for the last-mile split delivery in online retailing

引用

TRANSPORTATION REsearch PART E-LOGISTICS AND TRANSPORTATION REVIEW 2019年 122卷 309-327页

作者： Zhang, Yuankai Sun, Lijun Hu, Xiangpei Zhao, Chen Dalian Univ Technol Inst Syst Engn 2 Linggong Rd Dalian 116024 Liaoning Peoples R China Zhejiang Univ Sch Management Hangzhou 310058 Zhejiang Peoples R China

This paper addresses the last-mile split delivery problem emerging in online retailing, in which multiple shipments are delivered to the same customer multiple times. We propose an innovative order consolidation approach which consolidates same customers' shipments in the delivery station and delivers them in fewer trips. An integer programming model is formulated to make a cost tradeoff between splitting and consolidating shipments, which is solved by a new three-phase heuristic algorithm. Numerical experiments are conducted to demonstrate the superiority of the order consolidation approach over the first-In-first-Out approach on various parameters and generate managerial insights for applying it in practice.

关键词： Last-mile split delivery Shipment consolidation Online retailing Piecewise-integer structure breadth-first search algorithm

来源：评论

学校读者我要写书评

暂无评论

Development of Road Freight Transportation Distribution Model Based on Vehicle Transportation Inter Zone Requirement

引用

Transportation Research Procedia 2020年 48卷 562-573页

作者： Juang Akbardin Danang Parikesit Bambang Riyanto Agus Taufik Mulyono Department of Civil Engineering Universitas Pendidikan Indonesia Bandung – Indonesia Department of Civil Engineering Universitas Diponegoro Semarang - Indonesia Department of Civil Engineering Universitas Gajah Mada Yogyakarta - Indonesia

The distribution of road transport goods has the characteristics determined from the commodity and supply chain system of the commodity to be transported. Leading export commodities have an important role in regional economic growth and the drivers of national economic stability. Coffee commodity is one of the main export commodities that have significant economic value in international trade. To support the economic value of better coffee commodities, a more efficient distribution system is needed from the distribution system of coffee commodity production and trade in the coffee commodity production zone to the destination zone. The revenues of coffee commodities are estimated to be based on demographic variables, the condition of road infrastructure and transport vehicles. Production zones of coffee commodity crops have characteristics that develop according to the condition of road infrastructure in the zone. Interactions between production zones use gravity modeling with the loading of transport networks based on the goods traffic in accordance with the dominant characteristics used in transporting the commodities. The development of a freight transportation distribution model with the breadth-first search algorithm has the objective to consolidate the interaction of goods transport supply and demand within a zone to determine the efficiency of the traffic load on the road network system. So that the time of coffee commodities distribution will be faster in the destination zone in accordance with the volume of commodity production and the number of available transport vehicles.

关键词： Transportation of Goods Commodity of export coffee commodity breadth-first search algorithm

来源：评论

学校读者我要写书评

暂无评论

Hierarchical control strategy for MVDC distribution network under large disturbance

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2018年第11期12卷 2557-2565页

作者： Ji, Yirun Yuan, Zhichang Zhao, Jianfeng Lu, Chao Wang, Yizhen Zhao, Yuming Li, Yan Han, Yingduo Southeast Univ Dept Elect Engn Nanjing Jiangsu Peoples R China Tsinghua Univ Dept Elect Engn Beijing Peoples R China Tianjin Univ Minist Educ Key Lab Smart Grid Tianjin Peoples R China Shenzhen Power Supply Bur Co Ltd Shenzhen Peoples R China Elect Power Res Inst China Southern Power Grid Dept HVDC & Power Elect Guangzhou Guangdong Peoples R China

The DC distribution technology brings challenges and opportunities to the penetration of large-scale distributed renewable energy sources. In a medium-voltage DC (MVDC) distribution network, operation mode switch occurs owing to some large disturbances. To manage these disturbances and achieve seamless switch of the operation mode, a hierarchical control strategy with two layers, namely local and global layers, is proposed in this work. The novel local layer controller called P-U-I controller is designed to enhance the voltage stability, improve system controllability and suppress overcurrent under large disturbances. This controller only needs local information and does not rely on fast communication. Furthermore, as the scale of the DC distribution network expands continuously, the number of system operation mode increases in geometric progression. Therefore, a global layer controller based on breadth-first search algorithm is proposed. This controller can automatically identify the system topology and adjust the control mode of converters to optimise the system operating characteristics. Thus, this hierarchical control strategy can accurately control the system power in steady state, suppress overcurrent under large disturbances and suit large-scale DC distribution networks. Finally, a three-terminal MVDC distribution network simulation model established on power systems computer-aided design and RT-LAB validates the proposed strategy.

关键词： power distribution control power distribution faults power system stability power convertors tree searching hierarchical systems control system synthesis hierarchical control strategy DC distribution technology large-scale distributed renewable energy source penetration operation mode switch disturbance management global layers local layer controller P-U-I controller design voltage stability enhancement system controllability overcurrent suppression system operation mode geometric progression global layer controller breadth-first search algorithm system topology converters system operating characteristic optimization three-terminal MVDC distribution network simulation model power systems computer-aided design RT-LAB

来源：评论

学校读者我要写书评

暂无评论

A DISTRIBUTED ROUTING algorithm FOR MULTIHOP PACKET RADIO NETWORKS WITH UNIDIRECTIONAL AND BIDIRECTIONAL LINKS

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 1995年第3期44卷 579-585页

作者： POMALAZARAEZ, CA Department of Engineering Purdue University Fort Wayne IN USA

Multihop Packet Radio Networks require routing algorithms which are distributed in nature and which have the ability to timely detect changes in the network topology. These changes are mostly changes in connectivity caused by link or node failures and by the relative motion of the nodes. This paper describes and analyzes an adaptive decentralized routing algorithm for Packet Radio Networks. The network connectivity, as perceived by each node, is translated into a graph representation of the network, The proposed routing mechanism then uses a breadth-first search algorithm along the inbound links of such a graph, Unlike most of the algorithms found in the open literature the one proposed here can be used in networks having both uni- and bi-directional radio links, Examples are shown to illustrate the methodology.

关键词： graph theory network topology packet radio networks radio links telecommunication network routing adaptive decentralized routing algorithm bi-directional links breadth-first search algorithm graph representation inbound links link failures multihop packe Graph representations Packet radio networks Graph theory Network topology telecommunication network routing Routing algorithms Radio links Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：