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

International Conference on Materials Science and Information Technology (MSIT 2011)

作者： Tie, Chunhua Shen, Yanchun Beijing Informat Sci & Technol Univ Coll Comp Beijing Peoples R China

ISBN: (纸本)9783037853191

The urban road network is abstracted as a directed graph in this paper, according to the theory of graph theory. It uses depth-first traversal algorithm of graph, and combining with Dijkstra shortest path algorithm, futhermore ,these two algorithms are improved, so that, the model of this regional division are built which on city roads for patrol's police Alarm practical speed and distance as the verification conditions, we propose an efficient program for the city police patrol.

关键词： Graph depth-first algorithm Dijkstra algorithm Pratrol

来源：评论

学校读者我要写书评

暂无评论

Optimization of Gaussian surface calculations and extension to solvent-accessible surface areas

引用

JOURNAL OF COMPUTATIONAL CHEMISTRY 1999年第7期20卷 688-703页

作者： Weiser, J Shenkin, PS Still, WC Columbia Univ Dept Chem New York NY 10027 USA

We explored the use of several breadth-first and depth-first algorithms for the computation of Gaussian atomic and molecular surface areas. Our results for whole-molecule van der Waals surface areas (vdWSAs) were 10 times more accurate in relative error, relative to actual hard-sphere areas, than those reported by earlier workers. We were also able to extend the method to the computation of solvent-accessible surface areas (SASAs). This was made possible by an appropriate combination of algorithms, parameters, and preprocessing steps. For united-atom 30app, a 2366-atom protein, we obtained an average absolute atomic error of 1.16 Angstrom(2). With respect to the hard-sphere atomic SASA results in 7 s of CPU time on an R10000/194 MHz processor. Speed and accuracy were both optimized for SASA by the use of neighbor-list reduction (NLR), buried-atom elimination (BAE), and a depth-first search of the tree of atomic intersections. Accuracy was further optimized by the application of atom type specific parameters to the raw Gaussian results. (C) 1999 John Wiley & Sons, Inc. J Comput Chem 20: 688-703, 1999.

关键词： Gaussian shape van der Waals surface areas (vdWSA) solvent-accessible surface area (SASA) neighbor-list reduction (NLR) buried atom elimination (BAE) breadth-first algorithm depth-first algorithm

来源：评论

学校读者我要写书评

暂无评论

Independent distributions on a multi-branching AND-OR tree of height 2

引用

DISCRETE APPLIED MATHEMATICS 2020年 285卷 274-282页

作者： Shigemizu, Mika Suzuki, Toshio Usami, Koki Tokyo Metropolitan Univ Dept Math Sci Hachioji Tokyo 1920397 Japan Tokyo Reg Taxat Bur Tokyo Japan Komazawa Univ Educ Fdn Tokyo Japan

We investigate an AND-OR tree T and a probability distribution d on the truth assignments to the leaves. Tarsi (1983) inquired into an independent and identical distribution (IID) d such that at each leaf, the probability of having value 0 is neither 0 nor 1. Under a reasonable assumption on the shape of a tree, he showed the existence of an optimal algorithm that is depth-first. We investigate the case where d is an independent distribution (ID) and probability may depend on each leaf. It is known that in this general case, if the height is greater than or equal to 3, Tarsi-type result does not hold. It is also known that for a complete binary tree of height 2, Tarsi-type result certainly holds. In this paper, we ask whether Tarsi-type result holds for an AND-OR tree of height 2. Here, a child node of the root is either an OR-gate or a leaf: The number of child nodes of an internal node is arbitrary, and depends on an internal node. We give an affirmative answer. Our strategy of the proof is to reduce the problem to the case of directional algorithms. We perform induction on the number of leaves, and modify Tarsi's method to suite height 2 trees. We discuss why our proof does not apply to height 3 trees. This research sheds fresh light on the difference of algorithmic nature between shallow trees and deep trees. (C) 2020 Elsevier B.V. All rights reserved.

关键词： depth-first algorithm Independent distribution Multi-branching tree Computational complexity Analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Fire Engine Dispatching Problem Based on Improved Auction algorithm 37

Research on Fire Engine Dispatching Problem Based on Improve...

引用

37th Chinese Control Conference (CCC)

作者： Yang, Ning Ye, Huawen Qiu, Zhifeng Li, Yan Gui, Weihua Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China

ISBN: (纸本)9789881563958

This paper addresses the dispatch problem of fire engines in the event of multiple fires. In *** of the rapid change of fire status with time, the time-varying function is used to describe the change of fire status. Then we can treat the fire dispatch problem as a dynamic task allocation problem. firstly, based on the centralized idea, the depth-first algorithm is used to solve the multi-task assignment problem. Secondly, through this centralized algorithm example simulation, we proposed multi-stage task allocation strategy and designed a new revenue function to improve the auction algorithm. Finally, the effectiveness of the improved auction algorithm is verified by the example simulation.

关键词： Fire engine dispatching depth-first algorithm auction algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal PMU placement method considering bus weight and voltage stability

An optimal PMU placement method considering bus weight and v...

引用

12th International Conference on Environment and Electrical Engineering (EEEIC)

作者： Gao, Xiaolin North China Elect Power Univ Sch Elect & Elect Engn Beijing Peoples R China

ISBN: (纸本)9781467330596;9781467330602

In order to further improve the accuracy and efficiency of PMU optimizing methods, a new method considering both bus weight and voltage stability is presented in this paper. The method calculates every bus's weight value at first, related to the importance of the bus in the network, and then places PMU at the bus with maximum weight value until the system is completely observable. Proposed method is further extended for assuring complete observability considering voltage stability obtained by voltage stability analysis. Simulation results for IEEE14- bus system with proposed method are prepared with those with existing techniques. Results show that the proposed method is not only more efficient and accurate, but also beneficial to improving stability of power monitoring system.

关键词： power system PMU(phasor measurement unit) optimal placement depth-first algorithm network observability

来源：评论

学校读者我要写书评

暂无评论

Description, Analysis, Forecasting, and Evaluation of Opioids' Spread

Description, Analysis, Forecasting, and Evaluation of Opioid...

引用

作者： Wu Fei School of Software and Applied Science and Technology Zhengzhou University

We build a Drug Spread Model to describe the spread path of top-ten popular drugs. firstly, we operate on the data to select the top-ten drugs with the total cases over 5000 between 2010 and 2017. We also collect data about each drugs' use cases in each county. Next we find each county's adjacent regions to construct the adjacency matrix. After that we make the drugs' spread principles which help to determine the each drug's birthplace and which counties are more easily to be affected. Finally we use the depth-first algorithm to find the spread path and obtain possible locations where the ten drugs use might have started in the five states.

关键词： Drug Spread Model depth-first algorithm Gray prediction algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Fire Engine Dispatching Problem Based on Improved Auction algorithm

Research on Fire Engine Dispatching Problem Based on Improve...

引用

第37届中国控制会议

作者： Ning Yang Huawen Ye Zhifeng Qiu Yan Li Weihua Gui School of Information Science and Engineering Central South University

This paper addresses the dispatch problem of fire engines in the event of multiple fires. In view of the rapid change of fire status with time, the time-varying function is used to describe the change of fire status. Then we can treat the fire dispatch problem as a dynamic task allocation problem. firstly, based on the centralized idea, the depth-first algorithm is used to solve the multi-task assignment problem. Secondly, through this centralized algorithm example simulation, we proposed multi-stage task allocation strategy and designed a new revenue function to improve the auction algorithm. Finally, the effectiveness of the improved auction algorithm is verified by the example simulation.

关键词： Fire engine dispatching depth-first algorithm auction algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal PMU placement method considering bus weight and voltage stability

An optimal PMU placement method considering bus weight and v...

引用

International Conference on Environment and Electrical Engineering

作者： Xiaolin Gao School of electrical and electronic engineering North China Electric Power University

ISBN: (纸本)9781467330602

In order to further improve the accuracy and efficiency of PMU optimizing methods, a new method considering both bus weight and voltage stability is presented in this paper. The method calculates every bus's weight value at first, related to the importance of the bus in the network, and then places PMU at the bus with maximum weight value until the system is completely observable. Proposed method is further extended for assuring complete observability considering voltage stability obtained by voltage stability analysis. Simulation results for IEEE14-bus system with proposed method are prepared with those with existing techniques. Results show that the proposed method is not only more efficient and accurate, but also beneficial to improving stability of power monitoring system.

关键词： Power system PMU (phasor measurement unit) Optimal placement depth-first algorithm Network observability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：