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

Optimization of Transmission-Line Route Based on Lightning Incidence Reported by the Lightning Location System

IEEE TRANSACTIONS ON POWER DELIVERY 2013年第3期28卷 1460-1468页

作者： Li, Yongfu Yang, Qing Sima, Wenxia Li, Jiaqi Yuan, Tao Chongqing Univ State Key Lab Power Transmiss Equipment & Syst Se Chongqing 400044 Peoples R China Lightning Protect Ctr Chongqing Chongqing 401147 Peoples R China

Optimal route selection of a transmission line is significantly beneficial to reduce its lightning trip-out rate. This paper proposes a method, considering the minimal annual flash number to transmission lines, to select the optimal route from the initial point to the destination based on the lightning location system. First, the ground flash density and distribution of lightning peak current maps are drawn via the improved grid method. The flash grid and flash node are proposed based on these maps. The objective function is expressed as the summation of the grid distance of the flash node, and solved via the dijkstra algorithm. The conditional minimum transit cost is also provided to find the optimal corridor. Five 500-kV transmission lines are used to validate the effectiveness of the proposed method. The results indicate that the annual expected flash numbers of all lines are markedly reduced.

关键词： dijkstra algorithm ground flash density lightning location system lightning protection optimal design route selection

来源：评论

学校读者我要写书评

暂无评论

Design of suitable permutations for irregular turbo codes

引用

ELECTRONICS LETTERS 2011年第13期47卷 748-U34页

作者： Ben Ismail, D. Kbaier Douillard, C. Kerouedan, S. CNRS UMR 3192 Lab STICC Inst TelecomTechnopole Brestiroise CS 83818 F-29238 Brest 3 France Univ Europeenne Bretagne Bretagne France

Proposed is a method based on the dijkstra's algorithm and an estimation of the distance to search for efficient interleavers, adapted to irregular turbo codes, in order to reduce the flattening effect. Simulation... 详细信息

关键词： dijkstra algorithm distance estimation error floor flattening effect graph theory interleaved codes irregular turbo code permutation design turbo codes

来源：评论

学校读者我要写书评

暂无评论

Computing a hierarchy favored optimal route in a Voronoi-based road network with multiple levels of detail

引用

INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE 2017年第11期31卷 2216-2233页

作者： Hu, Zhenghua Jia, Tao Wang, Guofeng Wang, Jiye Meng, Lingkui Wuhan Univ Sch Remote Sensing & Informat Engn Wuhan Hubei Peoples R China China Highway Engn Consulting Corp Beijing Peoples R China Hong Kong Polytech Univ Dept Land Surveying & Geoinformat Kowloon Hong Kong Peoples R China State Grid Corp China Dept Informat & Commun Beijing Peoples R China NingBo Univ Technol Sch Elect & Informat Engn Ningbo Zhejiang Peoples R China

This paper introduces a robust method for computing the optimal route with hierarchy. We convert a planar road network into its Voronoi-based counterpart with multiple levels of detail (LoDs), which is subsequently assigned travel times that are estimated for different times of day using taxicab trajectory data. On the basis of this network structure, we model the path-finding process in travel, as the optimal route with hierarchy is computed in a 'coarse-to-fine' manner. In other words, the route is iteratively constructed from roads in a low LoD network to roads in a high LoD network. To confirm the efficiency and effectiveness of our method, comparative experiments were conducted using randomly selected pairs of origins/destinations in Wuhan, China. The results indicate that our travel lengths are on average 12% longer than those computed by the dijkstra algorithm and 15% shorter than those computed by the hierarchical algorithm (in ArcGIS). Our travel times are on average 29% longer than those computed by the dijkstra algorithm and 31% shorter than those computed by the hierarchical algorithm(in ArcGIS). Hence, we argue that our method is situated in terms of performance between the dijkstra algorithm and the hierarchical algorithm (in ArcGIS). Moreover, road usage patterns confirm that our algorithm is cognitively equivalent to the hierarchical algorithm (in ArcGIS) by favoring high-class roads and outperforms the dijkstra algorithm by avoiding choosing low-class roads. Computationally, our method outperforms the dijkstra algorithm but is on the same level as the hierarchical algorithm (in ArcGIS) in terms of efficiency. Therefore, it has the potential to be used in real-time routing applications or services.

关键词： GPS trajectory hierarchy favored optimal route dijkstra algorithm hierarchical algorithm (in ArcGIS) 'coarse-to-fine' search

来源：评论

学校读者我要写书评

暂无评论

The Model Design of Mobile Resource Scheduling in Large Scale Activities

引用

MOBILE NETWORKS & APPLICATIONS 2018年第3期23卷 382-394页

作者： Zhou, Cai-Qiu Yang, Yu-Wang Gong, Bei Li, Meng-Kun Li, Jin Wen, Ren-Qiang Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Jiangsu Peoples R China Beijing Univ Technol Beijing 100124 Peoples R China Capital Normal Univ Sch Management Beijing 100048 Peoples R China Fudan Univ Sch & Management Shanghai 200433 Peoples R China Natl Marine Hazard Mitigat Serv Beijing 100194 Peoples R China

Large scale exhibition is a complex crowd system, providing quality service for many tourists is an important issue that managers must pay attention to. Intelligent information management system should adopt scientific and reasonable resource scheduling sche-me to improve the efficiency of the crowd management. Through the domestic and foreign literature research, this paper points out the deficiencies in the previous research, and analyzes the process of crowd service in large-scale exhibition activities. In order to carry out the management of tourist service resources in the large scale exhibition, the concept model of mobile resource scheduling is put forward, and the detailed introduction of each dimension is presented. Multi-resource scheduling model based on dijkstra and multi-ant colony optimization algorithms are established respectively. The advantages and disadvantages of the two algorithms are compared through the numerical examples. dijkstra algorithm is superior to multi-ant colony optimization algorithm in the cost control, but in the running time of the algorithm, multi-ant colony optimization algorithm is better than dijkstra algorithm. The research has practical significance for the development of scientific and effective population service operation plan and service management plan for large scale exhibition activities.

关键词： Large scale exhibition dijkstra algorithm Multi-ant colony optimization algorithm Mobile resource scheduling

来源：评论

学校读者我要写书评

暂无评论

Graph-Theoretical Identification of Dissociation Pathways on Free Energy Landscapes of Biomolecular Interaction

引用

JOURNAL OF COMPUTATIONAL CHEMISTRY 2010年第4期31卷 847-854页

作者： Wang, Ling Stumm, Boris Helms, Volkhard Univ Saarland Ctr Bioinformat D-6600 Saarbrucken Germany Univ Kaiserslautern Dept Comp Sci D-6750 Kaiserslautern Germany

Biomolecular association and dissociation reactions take place on complicated interaction free energy landscapes that are still very hard to characterize computationally. For large enough distances, though, it often suffices to consider the six relative translational and rotational degrees of freedom of the two particles treated as rigid bodies. Here, we computed the six-dimensional free energy surface of a dimer of water-soluble alpha-helices by scanning these six degrees of freedom in about one million grid points. In each point, the relative free energy difference was computed as the sum of the polar and nonpolar solvation free energies of the helix dimer and of the intermolecular coulombic interaction energy. The dijkstra graph algorithm was then applied to search for the lowest cost dissociation pathways based on a weighted, directed graph, where the vertices represent the grid points, the edges connect the grid points and their neighbors, and the weights are the reaction costs between adjacent pairs of grid points. As an example, the configuration of the bound state was chosen as the source node, and the eight corners of the translational cube were chosen as the destination nodes. With the strong electrostatic interaction of the two helices giving rise to a clearly funnel-shaped energy landscape, the eight lowest-energy cost pathways coming front different orientations converge into a well-defined pathway for association. We believe that the methodology presented here will prove useful for identifying low-energy association and dissociation pathways in future studies of complicated free energy landscapes for biomolecular interaction. (C) 2009 Wiley Periodicals, Inc. J Comput Chem 31: 847-854, 2010

关键词： dijkstra algorithm Poisson-Boltzmann equation helix dimer weighted graph association free energy

来源：评论

学校读者我要写书评

暂无评论

A Secure and Efficient Trust Model for Wireless Sensor IoTs Using Blockchain

引用

IEEE ACCESS 2022年 10卷 4568-4579页

作者： Javaid, Nadeem COMSATS Univ Islamabad CUI Dept Comp Sci Islamabad 44000 Pakistan Univ Technol Sydney UTS Sch Comp Sci Ultimo NSW 2007 Australia

Wireless Sensor Internet of Things (WSIoTs) face various challenges such as unreliable data communication, less cost efficiency, security issues and high energy consumption due to their deployment in hostile and unattended environments. Moreover, the node's rapid energy dissipation due to the void holes and imbalanced network deployment has a bad impact on the network performance. To overcome the aforementioned issues, a blockchain based trust model for WSIoTs is proposed in this paper. Moreover, the dijkstra algorithm is used to propose a routing protocol for performing efficient communication between network nodes while simultaneously avoiding void holes between ordinary sensor nodes and a sink node. Furthermore, to provide transparency in the network, all the transactions performed by the nodes are recorded in the blockchain in an immutable manner. Moreover, the Proof of Authority (PoA) consensus algorithm is used to validate and add the transactions in the blocks. Besides, a distributed platform, known as interplanetary file system, is used in WSIoTs for reliable and cost-effective storage. The simulation results show that PoA performs 13% better than proof of work consensus algorithm. The proposed routing protocol and trust model are validated in terms of gas consumption, throughput, nodes' status and energy consumption.

关键词： Blockchains Routing protocols Routing Peer-to-peer computing Security Reliability Wireless sensor networks Blockchain dijkstra algorithm trust model void hole avoidance Wireless Sensor Internet of Things

来源：评论

学校读者我要写书评

暂无评论

An Agent Based Traffic Regulation System for the Roadside Air Quality Control

引用

IEEE ACCESS 2017年 5卷 13192-13201页

作者： El Fazziki, Abdelaziz Benslimane, Djamal Sadiq, Abderrahmane Ouarzazi, Jamal Sadgal, Mohamed Cadi Ayyad Univ Comp Syst Engn Lab Marrakech 40000 Morocco Univ Claude Bernard Lyon 1 LIRIS Lab F-69622 Villeurbanne France Cadi Ayyad Univ URAC 20 Lab Physicochim Mat & Environm Marrakech 40000 Morocco

This paper describes an on-road air quality monitoring and control approach by proposing an agent-based system for modeling the urban road network infrastructure, establishing the real-time and predicted air pollution indexes in different road segments and generating recommendations and regulation proposals for road users. This can help by reducing vehicle emissions in the most polluted road sections, optimizing the pollution levels while maximizing the vehicle flow. For this, we use data sets gathered from a set of air quality monitoring stations, embedded low-cost e-participatory pollution sensors, contextual data, and the road network available data. These data are used in the air quality indexes calculation and then the generation of a dynamic traffic network. This network is represented by a weighted graph in which the edges weights evolve according to the pollution indexes. In this paper, we propose to combine the benefits of agent technology with both machine learning and big data tools. An artificial neural networks model and the dijkstra algorithm are used for air quality prediction and the least polluted path finding in the road network. All data processing tasks are performed over a Hadoop-based framework: HBase and MapReduce.

关键词： Air quality management crowd-sourcing dijkstra algorithm mobile sensors pollution prediction traffic regulation

来源：评论

学校读者我要写书评

暂无评论

Automated delineation of the clinical target volume using anatomically constrained 3D expansion of the gross tumor volume

引用

RADIOTHERAPY AND ONCOLOGY 2020年 146卷 37-43页

作者： Shusharina, Nadya Soderberg, Jonas Edmunds, David Lofman, Fredrik Shih, Helen Bortfeld, Thomas Massachusetts Gen Hosp Div Radiat Biophys Boston MA 02114 USA Harvard Med Sch Boston MA 02115 USA RaySearch Labs Stockholm Sweden Massachusetts Gen Hosp Dept Radiat Oncol Boston MA 02114 USA

Purpose Delineation of the clinical target volume (CTV) is arguably the weakest link in the treatment planning chain. This work aims to support clinicians in this crucial *** and materials While the CTV itself is ambiguous, it is much easier to identify structures that do not belong to the CTV and serve as barriers to the spread of the disease. We segment the known barrier structures using a convolutional neural network (CNN). The CTV is then obtained by starting from the manually delineated gross tumor volume (GTV) and expanding it while taking into account the barrier structures. Mathematically, we define the CTV as an iso-surface in the 3D map of shortest paths of all voxels from the GTV. The shortest paths are found with the dijkstra algorithm. While the method is generally applicable, we test it on 206 glioma and glioblastoma *** The auto-segmented barrier structures for the brain cases include the ventricles, falx cerebri, tentorium cerebelli, brain sinuses, and the outer surface of the brain. Manual and auto-segmented barrier structures agree with surface Dice Similarity Coefficients (DSC) ranging from 0.91 to 0.97 at 2 mm tolerance. Comparison of manual and automatically delineated CTVs shows a median surface DSC of *** Barrier structures for CTV definition can be auto-delineated with outstanding precision using a CNN. An algorithm for automated calculation of the CTV by 3D expansion of the GTV while respecting anatomical barriers has been developed. It shows good agreement with manual CTV definition for brain tumors.

关键词： Clinical target volume Anatomical barriers Machine learning 3D expansion dijkstra algorithm Glioma

来源：评论

学校读者我要写书评

暂无评论

Research on the optimal escape path algorithm in mine water bursting disaster

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2018年第1期18卷 229-246页

作者： Dong, Lili Zhang, Honglei Zhang, Xiang Ye, Na Xian Univ Architecture & Technol Sch Informat & Control Engn Xian Shaanxi Peoples R China

To find the optimal escape path in mine water bursting disaster, present researches have proposed the dijkstra iterative algorithm. The optimal escape route should be chosen according to the extent of the disaster development and its impact scope. However, the traditional algorithm does not have a real-time analysis on the water flow and the escaping process, thus its solution is not or even far from optimal. Based on the traditional algorithm, this paper puts forward an algorithm with real-time analysis of escaping and water bursting processes. It analyzes water bursting range in real time according to the time of passing through each roadway on a path, and then finds an optimal escape path which is most secure and least time-consuming through comparison. The experiments show that the algorithmis able to find the optimal escape path more effectively compared with other algorithms.

关键词： Water bursting disasters dijkstra algorithm shortest path optimal escape path

来源：评论

学校读者我要写书评

暂无评论

Evolution of conformational changes in the dynamics of small biological molecules: a hybrid MD/RRK approach

引用

PHYSICAL CHEMISTRY CHEMICAL PHYSICS 2006年第42期8卷 4915-4923页

作者： Segev, Elad Grumbach, Mikael Gerber, Robert Benny Hebrew Univ Jerusalem Dept Chem Phys IL-91904 Jerusalem Israel Hebrew Univ Jerusalem Fritz Haber Inst IL-91904 Jerusalem Israel Univ Calif Irvine Dept Chem Irvine CA 92697 USA

The dynamics of long timescale evolution of conformational changes in small biological molecules is described by a hybrid molecular dynamics/RRK algorithm. The approach employs classical trajectories for transitions between adjacent structures separated by a low barrier, and the classical statistical RRK approximation when the barrier involved is high. In determining the long-time dynamics from an initial structure to a final structure of interest, an algorithm is introduced for determining the most efficient pathways (sequence of the intermediate conformers). This method uses the dijkstra algorithm for finding optimal paths on networks. Three applications of the method using an AMBER force field are presented: a detailed study of conformational transitions in a blocked valine dipeptide;a multiple reaction path study of the blocked valine tripeptide;and the evolution in time from the beta hairpin to alpha helix structure of a blocked alanine hexapeptide. Advantages and limitations of the method are discussed in light of the results.

关键词： .hairpin dipeptide paths Reaction path timescale RRK dijkstra algorithm small biological molecules blocked valine tripeptide blocked alanine hexapeptide

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：