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

An Approach for Estimating Disturbance Arrival Time Based on Structural Frame Model

IEEE TRANSACTIONS ON POWER SYSTEMS 2017年第3期32卷 1741-1750页

作者： Bi, Tianshu Qin, Junda Yan, Yuehao Liu, Hao Martin, Kenneth E. North China Elect Power Univ State Key Lab Alternate Elect Power Syst Renewabl Beijing 102206 Peoples R China State Grid Zhengzhou Power Supply Co Zhengzhou 450006 Peoples R China Elect Power Grp Pasadena CA 91101 USA

With the development of power grid interconnection, disturbance propagation phenomena are more and more apparent in the form of electromechanical waves. Once a disturbance occurs, its propagation might cause cascading events and even large blackouts. With the help of advanced communications networks in smart grids, new event-based protection systems can be devised by the reveal of disturbance propagation mechanisms. In this paper, a widely used measurement-based protection system is analyzed and the idea of event-based protection is proposed. By introducing the inverse process of lumped mass method, the impact scope of generator inertia is proposed. Then, the structural frame model of power networks for disturbance propagation is built, which is sectionalized homogeneously. The spatial heterogeneity of propagation velocity of the electromechanical waves is depicted. According to the constant velocity characteristic of the segments in the structural frame model, a weighted undirected graph is formulated. Then, the dijkstra algorithm based shortest path searching method for arrival time of electromechanical wave is proposed. The simulations are carried out to demonstrate the effectiveness of the proposed electromechanical wave propagation model and disturbance arrival time estimation algorithm. The research work is one of the essential steps for realizing event-based protection strategies.

关键词： dijkstra algorithm discrete inertia model disturbance propagation event based protection power grids structural frame

来源：评论

学校读者我要写书评

暂无评论

Incremental Updates Based on Graph Theory for Consumer Electronic Devices

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2015年第1期61卷 128-136页

作者： Ni, Guiqiang Chen, Zhilong Jiang, Jinsong Luo, Jianxin Ma, Yao PLA Univ Sci & Technol Sch Command Informat Syst Nanjing 210007 Jiangsu Peoples R China Mil Command Coll Nanjing 210045 Jiangsu Peoples R China

This paper presents a method for incremental updating on consumer electronic devices, called differential compression based on dijkstra algorithm (DDIFF). It describes the similarities between the old and new versions as a directed weighted graph. In the graph, the shortest path between the start and end vertices corresponds to the minimal delta. As a result, the delta-encoding problem is reduced to the single-source shortest path problem. Experiments show that the proposed method is feasible, and average data transmission saving is as high as 69.3%. In comparison with the existing methods, DDIFF constructs the minimal patch, and the patch costs less time to apply(1).

关键词： incremental updates differential compression graph theory dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Fuzzy clustering in Intelligent Scissors

引用

COMPUTERIZED MEDICAL IMAGING AND GRAPHICS 2012年第5期36卷 396-409页

作者： Wieclawek, W. Pietka, E. Silesian Tech Univ PL-44100 Gliwice Poland

In this study a modified Live-Wire approach is presented. A Fuzzy C-Means (FCM) clustering procedure has been implemented before the wavelet transform cost map function is defined. This shrinks the area to be searched resulting in a significant reduction of the computational complexity. The method has been employed to computed tomography (CT) and magnetic resonance (MR) studies. The 2D segmentation of lungs, abdominal structures and knee joint has been performed in order to evaluate the method. Significant numerical complexity reduction of the Live-Wire algorithm as well as improvement of the object delineation with a decreased number of user interactions have been obtained. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Image segmentation Live-Wire Intelligent Scissors Cost map Edge Boundary Graph search dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Minimum collective dose based optimal evacuation path-planning method under nuclear accidents

引用

ANNALS OF NUCLEAR ENERGY 2020年 147卷 107644-107644页

作者： Pei, Qiu-Yan Hao, Li-Juan Chen, Chun-Hua Zheng, Xiao-Lei He, Tao Chinese Acad Sci Inst Nucl Energy Safety Technol Key Lab Neutron & Radiat Safety Hefei 230031 Anhui Peoples R China Univ Sci & Technol China Hefei 230027 Anhui Peoples R China

The effectiveness of the path plan is the main factor of the evacuation affecting the amount of exposure to personnel, however, the effect of the radiation field distribution has not been fully considered in current studies. In this paper, a Minimizing Collective dose based Path-Planning method (MCPP) was proposed. Among which, the accumulative dose based dijkstra algorithm was proposed to find the optimal evacuation routes, and then the equilibrium model considering road resistance was used to formulate the optimal evacuation path plan under nuclear accidents, in which the obtained routes were reasonably arranged to evacuate all people with minimize collective dose. This paper used the Daya Bay Nuclear Power Station as an application scenario for evacuation simulation to verify the effectiveness of the method. The results showed that the path plan formulated by MCPP method could reasonably reduce personnel radiation exposure during the evacuation process. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Nuclear emergency Evacuated path-planning Collective dose dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of rough graph in relationship mining

引用

Journal of Systems Engineering and Electronics 2008年第4期19卷 742-747页

作者： He Tong Xue Peijun Shi Kaiquan School of Mathematics and System Sciences Shandong Univ. Jinan 250100 P. R. China

Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relations... 详细信息

关键词： rough graph weighted rough graph class shortest path dijkstra algorithm relationship mining

来源：评论

学校读者我要写书评

暂无评论

Graph theory based topology design and energy routing control of the energy internet

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2018年第20期12卷 4507-4514页

作者： Guo, Hui Wang, Fei James, Geoff Zhang, Lijun Luo, Jian Shanghai Univ Sch Mechatron Engn & Automat Shanghai Key Lab Power Stn Automat Technol Shanghai 200072 Peoples R China Univ Technol Sydney Inst Sustainable Futures POB 123 Ultimo NSW 2007 Australia

As a core of energy internet, the energy router (ER) controlled by information flows can better realise the large scale utilisation of renewable energy. In order to build a cost-effective energy internet, a modified minimum spanning tree algorithm is proposed to optimise the cable layout among ERs, i.e. topology design. Considering the real-time and the asynchrony of power transmission in the above topology determined energy internet, an energy routing control method based on dijkstra algorithm is put forward for source-and-load pairs to find a no-congestion minimum loss path. Besides, the loss allocation and congestion managements are realised at the same time. Finally, the simulation results prove the feasibility and effectiveness of proposed optimisation algorithms.

关键词： telecommunication network topology Internet trees (mathematics) optimisation telecommunication network routing graph theory modified minimum spanning tree algorithm ER topology determined energy internet energy routing control method no-congestion minimum loss path graph theory based topology design energy router renewable energy cost-effective energy internet dijkstra algorithm source-and-load pairs loss allocation congestion managements optimisation algorithms

来源：评论

学校读者我要写书评

暂无评论

Secure Overlay Routing for Large Scale Networks

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2019年第3期6卷 501-511页

作者： Gharib, Mohammed Yousefi'zadeh, Homayoun Movaghar, Ali Inst Res Fundamental Sci IPM Sch Comp Sci Tehran Iran Univ Calif Irvine Ctr Pervas Commun & Comp Irvine CA 92697 USA Sharif Univ Technol Dept Comp Engn Tehran Iran

Probabilistic key pre-distribution schemes have recently emerged as major tools of addressing secure routing challenge in wireless networks. In our previous work, we propose an algorithm capable of finding optimal secure paths in overlay wireless networks. An important concern related to that algorithm is the scalability of the solution for large scale networks containing thousands of nodes. In this paper, we propose two alternative solutions for the previously formulated problem of secure overlay routing that can effectively scale to thousands of nodes. The first one is a deterministic dijkstra-based algorithm analytically proven to find the optimal path with a time complexity much lower than that of the original algorithm. The second alternative is an approximation method capable of finding a near optimal path with an accuracy of 99 percent compared to the optimal path. At the cost of a space complexity in the order O(n log(3)n), this algorithm can find the near optimal path with a linear time complexity compared to quadratic or multiplicative time complexity associated with the first algorithm proposed in this paper. Experimental results using a number of different key pre-distribution schemes confirm our analytical findings.

关键词： Optimal secure routing large scale networks probabilistic key pre-distribution dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Least-cost paths in mountainous terrain

引用

COMPUTERS & GEOSCIENCES 2004年第3期30卷 203-209页

作者： Rees, WG Univ Cambridge Scott Polar Res Inst Cambridge CB2 1ER England

Footpaths in a mountainous area of Wales are modelled as least-cost paths between the start and end points. The cost function is defined on the basis of topography alone, and is defined in such a way that the cost penalty for excessively steep slopes is an adjustable parameter of the model. Least-cost paths are calculated by applying dijkstra's algorithm to a Digital Elevation Model. Comparison of these calculated least-cost paths with existing footpaths suggests that the latter do not usually follow the least-time route, but instead optimise the metabolic cost for human locomotion. The method developed here is proposed as a means of exploring possible routes for new footpaths in mountainous areas. (C) 2004 Elsevier Ltd. All rights reserved.

关键词： digital elevation model least-cost path dijkstra algorithm mountain paths physiology

来源：评论

学校读者我要写书评

暂无评论

Graph Theory-Based Approach to Accomplish Complete Coverage Path Planning Tasks for Reconfigurable Robots

引用

IEEE ACCESS 2019年 7卷 94642-94657页

作者： Cheng, Ku Ping Elara, Mohan Rajesh Nguyen Huu Khanh Nhan Anh Vu Le Singapore Univ Technol & Design Engn Prod Dev Pillar ROAR Lab Singapore Singapore Ton Duc Thang Univ Fac Elect & Elect Engn Optoelect Res Grp Ho Chi Minh City 700000 Vietnam

Extensive studies regarding complete coverage problems have been conducted, but a few tackle scenarios where the mobile robot is equipped with reconfigurable modules. The reconfigurability of these robots creates opportunities to develop new navigation strategies with higher dexterity;however, it also simultaneously adds in constraints to the direction of movements. This paper aims to develop a valid navigation strategy that allows tetromino-based self-reconfigurable robots to perform complete coverage tasks. To this end, a novel graph theory-based model to simulate the workspace coverage and make use of dynamic programming technique for optimal path searching and adaptive robot morphology shifting algorithms is proposed. Moreover, the influence of algorithms starting variables on workspace coverage outcome is analyzed thoughtfully in this paper. The simulation results showed that the proposed method is capable of generating navigation paths throughout the workspace, which ensures complete workspace coverage while minimizing the total number of actions performed by the robot.

关键词： Complete coverage path planning self-reconfigurable robots graph theory dynamic programming dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An automatic route design algorithm for intelligent ships based on a novel environment modeling method

引用

OCEAN ENGINEERING 2021年 237卷 109603-109603页

作者： Pan, Wei Xie, Xin-lian He, Ping Bao, Tian-tian Li, Meng Dalian Maritime Univ Integrated Transport Inst Dalian 116026 Peoples R China Shanghai Jiao Tong Univ Sch Naval Architecture Ocean & Civil Engn Shanghai 200240 Peoples R China Ningbo Univ Fac Maritime & Transportat Ningbo 315211 Peoples R China

An automatic route design algorithm for intelligent ships considering environmental factors impact and navigation safety is proposed. The Delaunay Triangulation Method is used to model chart data. Safe water depth of ship navigation calculation model is proposed, whose result is used to search the forbidden navigation areas in Delaunay Chart Model. The navigation network is created by the Tangent Based Method based on the Delaunay Chart Model. The speed of ship under environmental factors impact is recalculated which is used to modify path weight of the navigable network. The route design scheme is obtained by solving the modified network with the dijkstra algorithm. The experimental results show that the algorithm can provide the adaptive route scheme via ship size and tide height. Moreover, the environmental factors are used as variables to prove that the algorithm can consider the environmental factors and provide an economical navigation scheme.

关键词： Intelligent ships Hydrodynamics Delaunay triangulation method Tangent based method dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：