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

HOT-SPOT spanning tree algorithm FOR A BRIDGED LAN/MAN

COMPUTER COMMUNICATIONS 1995年第5期18卷 357-366页

作者： HUANG, NF MA, GK WU, YJ ITRI COMP & COMMUN RES LABSCTR ADV TECHNOLHSINCHU 310TAIWAN

A bridged local area network (BLAN) is an internetwork where a lot of LANs and MANs are interconnected via bridges. The active spanning tree topology of a BLAN is to ensure that one and only one active routing path exists between each pair of end stations to resolve the frame duplication problem. A LAN is a hot-spot LAN if it has a large amount of communicating traffic load compared to other LANs. In this paper, we propose a distributed spanning tree algorithm for a BLAN with hot-spot traffic. The spanning tree constructed by our algorithm is logically rooted at the hot-spot LAN instead of the bridge with the smallest identifier. Such a spanning tree will be more practical and suitable for delivering the inter-LAN frames, and hence will obtain a better performance on end-to-end transmission delay. The effectiveness of the algorithm is evaluated by simulations. From the simulation results, we found that, compared to the standard spanning tree algorithm, the spanning tree constructed by our algorithm obtains a greater improvement in terms of end-to-end transmission delay as the traffic concentration becomes more pronounced.

关键词： BLAN BRIDGES HOT-SPOT spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

A minimal spanning tree algorithm for distribution networks configuration

A minimal spanning tree algorithm for distribution networks ...

引用

IEEE Power and Energy Society General Meeting

作者： Diana P. Montoya Juan M. Ramirez Department of Electrical Power System CINVESTAV-Guadalajara CINVESTAV-Guadalajara. MEXICO

ISBN: (纸本)9781467327275

A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radial configuration. This type of problem becomes a non-differentiable, mixed integer, and highly combinatorial in nature. The Kruskal's algorithm is used to determine the minimum spanning tree, which has the characteristic to run in polynomial time.

关键词： Distribution systems reconfiguration Power loss reduction Minimal spanning tree. spanning tree algorithm power loss Power grids spanning tree Polynomial time configurations Minimal

来源：评论

学校读者我要写书评

暂无评论

An Efficient Minimum spanning tree algorithm

An Efficient Minimum Spanning Tree Algorithm

引用

IEEE Symposium on Computers and Communications

作者： Abdullah-Al Mamun Sanguthevar Rajasekaran Computer Science and Engineering University of Connecticut USA

ISBN: (纸本)9781509006809

Finding minimum spanning trees (MST) in various types of networks is a well-studied problem in theory and practical applications. A number of efficient algorithms have been already developed for this problem. In this paper we present an efficient algorithm, namely Edge Pruned Minimum spanning tree (EPMST) algorithm, which combines ideas from randomized selection, Kruskal's algorithm and Prim's algorithm. The algorithm has a superior performance relative to the best-known algorithms especially when the graph is not very sparse. Specifically, EPMST outperforms a recently devised efficient algorithm on a wide range of input graphs.

关键词： Filtering algorithms Vegetation Partitioning algorithms Image edge detection algorithm design and analysis Computers Timing algorithm design and analysis Filtering algorithms Edge detection Partitioning algorithms Computers vegetation efficient algorithm spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallelism Extraction algorithm from Stream-based Processing Flow applying spanning tree 28

Parallelism Extraction Algorithm from Stream-based Processin...

引用

28th IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)

作者： Wang, Guyue Yamagiwa, Shinichi Wada, Koichi Univ Tsukuba Fac Engn Informat & Syst Dept Comp Sci Tsukuba Ibaraki Japan

ISBN: (纸本)9781479941162

Manycore architecture promotes a massively parallel computing on the accelerators. Especially GPU is one of the main series of the high performance computing, which is also employed by top supercomputers in the world. The programming method on such accelerators includes development of a control program. The accelerator executes it to schedule the invocation timing of the accelerator's kernel program. The kernel program needs to be written based on the stream computing paradigm. Connecting I/Os of the kernel programs, we can develop a large application. When we consider the processing flow as a directed graph, we can implement a GUI-based programming tool for the accelerators. It visualizes a pipeline-based processing flow. However, it is very hard to find the starting point of a complex processing flow. Moreover, although the processing pipeline should include the potential parallelism, it is hard for the programmer to exploit it intuitively. This paper proposes an algorithm applying the spanning tree that mechanically exploits the parallelism and determines an execution order.

关键词： High Performance Computing Stream Computing GPUs Caravela spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study Of Minimal spanning tree algorithms

A Comparative Study Of Minimal Spanning Tree Algorithms

引用

Mathematics, Computer Engineering and Computer Science (ICMCECS), International Conference in

作者： Peace Ayegba Joyce Ayoola Emmanuel Asani Aderemi Okeyinka Department of Computer Science Landmark University Kwara Nigeria

ISBN: (数字)9781728131269

ISBN: (纸本)9781728131276

The minimal spanning tree is a structure used in solving certain types of combinatorial optimization problems. Popular application areas include network design such as roads, telephone, electrical and cable-laying. There are two popular algorithms for acquiring the minimum spanning tree of a graph; These are Kruskal's algorithm and Prim's algorithm. The goal of this study is to implement these algorithms and find out which of them is more efficient. To achieve this, we implement and evaluate the complexity of the algorithms. In this paper both methods have been implemented on the road network of the 36 states in Nigeria and results of the implementation are presented. However, since this work is taken from a research in progress, the computational complexity of the two algorithms will be carried out and reported in another paper in the future.

关键词： Kruskal Prim’s Graph Minimal spanning trees Complexity Line graph algorithms spanning tree algorithm Complexity spanning tree road network Network design Minimal complexity classes

来源：评论

学校读者我要写书评

暂无评论

CENTERING A spanning tree OF A BICONNECTED GRAPH

引用

INFORMATION PROCESSING LETTERS 1989年第5期32卷 247-250页

作者： CHESTON, GA FARLEY, A HEDETNIEMI, ST PROSKUROWSKI, A UNIV OREGON DEPT COMP SCIEUGENEOR 97403 CLEMSON UNIV DEPT COMP SCICLEMSONSC 29631

Given a biconnected graph G = ( V, E ), and an arbitrary vertex v in V , there exists a spanning tree T of G with v in the center of T . We prove this by providing an O(∣ V ∣ · ∣ E ∣) algorithm that construct... 详细信息

关键词： Center spanning tree algorithm biconnected graph

来源：评论

学校读者我要写书评

暂无评论

Solving the information accumulation problem in mesh structured agent system

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2007年第1期22卷 493-495页

作者： Huang, K. Srivastava, S. K. Cartes, D. A. Florida State Univ Ctr Adv Power Syst Tallahassee FL 32310 USA

In this letter, the authors propose a spanning tree-based algorithm for an agent system, which breaks the mesh-structured agent system into a single tree-structured agent system. Then an algorithm for recalculating the information flow among agents without redundant information accumulationis presented. Finally, the proposed methodology is illustrated through a simple mesh structured agent system.

关键词： distributed system multiagent system (MAS) redundant information accumulation (RIA) spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Cost Effective Dynamic Multi-Microgrid Formulation Method Using Deep Reinforcement Learning

Cost Effective Dynamic Multi-Microgrid Formulation Method Us...

引用

IEEE-Power-and-Energy-Society General Meeting (PESGM)

作者： Jung, YoonGun Chang, Minhyeok Kang, Sungwoo Jang, Gilsoo Lee, Hojun Yoon, Minhan Song, Sungyoon Han, Changhee Korea Univ Dept Elect Engn Seoul South Korea Kwangwoon Univ Dept Elect Engn Seoul South Korea Korea Electrotechnol Res Inst Adv Power Grid Div Uiwang South Korea Univ Calif San Diego Qualcomm Inst San Diego CA USA

ISBN: (纸本)9781665464413

This paper proposes an online Dynamic Multi-Microgrid Formulation (DIVIMF) method using Deep Reinforcement Learning. It aims to reconfigure the microgrid into several self-supplied islands and minimize total operation cost at the same time. spanning tree algorithm is used to reduce the total number of microgrid formulation. Proximal -Policy Optimization is implemented to train the agent which determines the status of sectionalizing switches in microgrid in real-time. To show the effectiveness of the proposed DMMF method, a case study was conducted in the modified cigre-14 bus test network. The results demonstrated that the proposed DMMF method reduced the total operation cost compared to the operation cost derive from original Cigre 14 bus formulation.

关键词： Microgrid (MG) Reconfiguration Dynamic Multi-Microgrid Formulation Distributed generation (DG) spanning tree algorithm Deep Reinforcement Learning (DRL)

来源：评论

学校读者我要写书评

暂无评论

Determination of Safe Landing Zones for an Autonomous UAS using Elevation and Population Density Data

Determination of Safe Landing Zones for an Autonomous UAS us...

引用

AIAA Science and Technology (SciTech) Forum and Exposition

作者： Carney, Edward Castano, Lina Xu, Huan Univ Maryland Dept Aerosp Engn College Pk MD 20740 USA Univ Maryland Aerosp Engn College Pk MD 20740 USA Univ Maryland Aerosp Engn Inst Syst Res College Pk MD 20740 USA

ISBN: (数字)9781624105784

ISBN: (纸本)9781624105784

This work determines a safe emergency landing zone for an autonomous UAS by utilizing ground elevation, terrain ruggedness, land coverage, and population density data. The proposed system uses openly available high-fidelity Light Detection and Ranging (LIDAR) datasets and surface reflectance data from the Landsat land remote sensing project to determine potential landing zones based on current UAS position and calculated data provided by these datasets. The elevation data is represented as a set of coordinates and an elevation, with the bounding latitudes and longitudes for the dataset included in the dataset metadata. Threshold values for these data set a minimum required topographic quality for an area to be considered valid for landing. A weighting algorithm is used to determine the optimal landing zone for a given UAV situation and position. A constrained bidirectional rapidly exploring random tree algorithm is used with onetime pruning to generate a path to the chosen landing zone that obeys aircraft heading and motion constraints. We show that the optimal landing zone and corresponding path plan update based on the specified topographic quality threshold values and weighting configuration.

关键词： Dataset flight strip Caste determination Sex Determination Processes cage set Lidar DATA DENSITY setting coordination Coordinates LIght Detection and Ranging Population density calculation data Valid spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

A GRAPH algorithmIC FRAMEWORK FOR THE ASSEMBLY OF SHREDDED DOCUMENTS

A GRAPH ALGORITHMIC FRAMEWORK FOR THE ASSEMBLY OF SHREDDED D...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Richter, Fabian Ries, Christian X. Lienhart, Rainer Univ Augsburg D-8900 Augsburg Germany

ISBN: (纸本)9781612843490

In this paper we propose a framework to address the reassembly of shredded documents. Inspired by the way humans approach this problem we introduce a novel algorithm that iteratively determines groups of fragments that fit together well. We identify such groups by evaluating a set of constraints that takes into account shape- and content-based information of each fragment. Accordingly, we choose the best matching groups of fragments during each iteration and implicitly determine a maximum spanning tree of a graph that represents alignments between the individual fragments. After each iteration we update the graph with respect to additional contextual knowledge. We evaluate the effectiveness of our approach on a dataset of 1 6 fragmented pages with strongly varying content. The robustness of the proposed algorithm is finally shown in situations in which material is lost.

关键词： Document assembly spanning tree algorithm Kruskal

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：