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

12th IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Hu, Zhichuan Cheng, Yan Zhu, Xiding Cheng, Hong Chen, Zhiyong Chen, Yuanjie Wuhan Univ Sci & Technol Coll Informat Sci & Engn Wuhan Hubei Peoples R China

ISBN: (纸本)9781509061617

In view of the need of emergency inspection and temporary inspection for the transmission and distribution lines, the inspectors are required to quickly reach all inspection points. This paper combines Baidu map open platform with Android system, using the improved prim algorithm to propose an intelligent inspection scheme for transmission and distribution lines, which can achieve multi-point patrol path planning of power inspection on Android platform. This scheme overcomes the defects that the mainstream map applications can not scientifically carry on the multi-point path planning, combined with the need of power inspection, making the inspection program more intelligent, handling the multi-point path planning conveniently, and improving the emergency response capability of power inspection departments.

关键词： Power inspection Android prim algorithm Baidu map open platform Path Planning

来源：评论

学校读者我要写书评

暂无评论

Optimization of Highway Construction based on prim algorithm

引用

International Conference on Frontiers of Manufacturing and Design Science (ICFMD2010)

作者： Zhao, Hong Qin, Shaochong Zhu, Song Shenyang Univ Technol Sch Management Shenyang Peoples R China Northeast Elect Power Res Inst Co Ltd Shenyang Peoples R China

ISBN: (纸本)9783037850046

In this paper, prim algorithm is used to solve the problem of optimizing inter-city highway paving in highway construction project. In the paper circles are used to indicate the cities, the inter-city highway with the line between circles, and the line weights on the behalf of the relative costs of highway construction. prim minimum spanning tree algorithm is constructed on the n inter-city highway, and finally make the project cost cut down from 53 to 20 in highway construction project and obtain a better eco-efficiency and social benefits under cutting down of the project cost.

关键词： prim algorithm Cost control Minimum spanning tree Project management Optimization

来源：评论

学校读者我要写书评

暂无评论

A Novel Graph Partitioning Criterion Based Short Text Clustering Method

A Novel Graph Partitioning Criterion Based Short Text Cluste...

引用

12th International Conference on Intelligent Computing (ICIC)

作者： Li, XiaoHong He, TingNian Ran, HongYan Lu, XiaoYong Northwest Normal Univ Coll Comp Sci & Engn Lanzhou 730070 Peoples R China

ISBN: (纸本)9783319422978;9783319422961

A novel clustering method based on spectral clustering theory and spectral cut standard is proposed via analyzing the characteristics of short text and the defects of the existing clustering algorithms. First of all, a weighted undirected graph is created according to spectral clustering theory, similarity between node and node is calculated on graph, and a symmetrical documents similarity matrix is constructed, which provides all information for the clustering algorithm. Inspired by Greedy strategy, we utilize prim to develop primMAE algorithm for the purpose of partitioning graph into two parts, in which RMcut is termination condition of partitioning process, and then it is fed into CASC algorithm to cut the documents set iteratively. Ultimately, high quality clustering results demonstrate the effectiveness of the new clustering algorithm.

关键词： Short text Similarity matrix RMcut criterion prim algorithm Clustering algorithm

来源：评论

学校读者我要写书评

暂无评论

Reconfiguração de sistemas de distribuição de energia elétrica utilizando uma metodologia multipartida

Reconfiguração de sistemas de distribuição de energia el...

引用

作者： Cardona, Natalia Patiño Universidade Estadual Paulista

Este trabalho apresenta uma proposta baseada na metodologia multipartida para a resolução do Problema de Reconfiguração de Sistemas de Distribuição de Energia Elétrica, de natureza combinatória e modelado como um problema de Programação Não Linear Inteiro Misto. O objetivo principal deste trabalho é encontrar a topologia radial ótima para minimizar as perdas ativas dos sistemas de distribuição, e para isso é preciso, primeiramente, a resolução de um problema de fluxo de potência para sistemas fracamente malhados onde é calculada a potência aparente do sistema, a qual vai ser utilizada pelo algoritmo de prim como o peso para a geração das soluções iniciais radiais de boa qualidade. Para implementar a metodologia proposta deve-se desenvolver também um algoritmo de fluxo de potência radial, utilizado para calcular tanto as perdas ativas do sistema (função objetivo do problema), como para verificar a factibilidade das propostas de solução. Nesta primeira etapa é feita uma variação aleatória dos pesos dos ramos, e são resolvidos tantos problemas de fluxo de potência radial quanto soluções aleatórias obtidas, para encontrar soluções de boa qualidade próximas ao ótimo. Finalmente, é feita uma busca local através da troca de ramos como tentativa para encontrar a solução ótima. As soluções obtidas pela metodologia proposta são obtidas através da programação de algoritmos implementados em linguagem C++. Os resultados obtidos mostram a eficiência da aplicação da metodologia, estes resultados foram comparados com os existentes na literatura e os obtidos pela resolução de um modelo de otimização resolvido com o solver comercial *** work presents a proposal based on multi-start methodology for the solution of the distribution network reconfiguration problem, of combinatorial nature and modeled as a mixed-integer nonlinear programming problem. The main objective of this work is to find the optimal radial topology to minimize active power losses in distribution systems. This

关键词： Multipartida Algoritmo de prim Reconfiguração de sistemas de distribuição de energia elétrica Fluxo de potência radial Busca local Multi-start method prim algorithm Distribution network reconfiguration problem Radial power flow Local search Diss

来源：评论

学校读者我要写书评

暂无评论

An algorithm for the Minimum Spanning Tree Problem with Uncertain Structures

引用

IEEE LATIN AMERICA TRANSACTIONS 2015年第12期13卷 3885-3889页

作者： Hernandes, F. Lourenco, M. H. R. S. Univ Estadual Ctr Oeste UNICENTRO Guarapuava PR Brazil Univ Estadual Ctr Oeste UNICENTRO Ciencia Comp Guarapuava PR Brazil

The minimum spanning tree problem consists to find the smallest weight among all possible trees in a network. It is one of the main problems of graphs theory, since it has a wide range of applications in Engineering and Computation areas, such as: electricity distribution networks, information storage, transportation, etc. In this paper is proposed an exact algorithm to the minimum spanning tree problem with uncertain structures. It is based on the mainly papers of the literature and presents a solution ordered set of minimum spanning trees. The uncertainties of the structures are resolved using the fuzzy sets theory. The algorithm was tested on literature instances having the same results. Its complexity is O((v-a)(v(2))), where v is the node sets and a is the arcs sets.

关键词： Graphs Theory Spanning Tree Problem prim algorithm Fuzzy Sets Theory

来源：评论

学校读者我要写书评

暂无评论

Lot Release Strategy Semiconductor Assembly and Testing Based on The Degree of Constraint of The Minimum Spanning Tree

Lot Release Strategy Semiconductor Assembly and Testing Base...

引用

26th Chinese Control and Decision Conference (CCDC)

作者： Zhang Guohui Liu Chang Yao Lili Shi Haibo Chinese Acad Sci R&D Ctr Internet Things Beijing 100864 Peoples R China Jiangsu R&D Ctr Jiangsu Peoples R China Wuxi CAS Ubiquitious Informat Technol R&D Ctr Co Wuxi Peoples R China Chinese Acad Sci Shenyang Inst Automat Beijing 100864 Peoples R China

ISBN: (纸本)9781479937066

The production of semiconductor assembly and testing is wide variety, and the cost of produce time of switch between different products is not the same, which could lead to its utilization is lower, production cycle longer. Thus lot release control plays an important role for improving utilization and shorter production cycle for semiconductor assembly and testing system. in this paper, we modeled as a graph theory for solving constrained minimum spanning tree problem Using mainstream prim algorithm, we solve it to give each product sequence and specific lot release time. it have solved the extra time problem that caused by blinding lot release, and finally, through applied research we verified the effectiveness and superiority of it. The proposed strategy can reduce the change machine costs, shorten production cycle and improve production efficiency.

关键词： semiconductor assembly and testing graph theory minimum spanning tree prim algorithm

来源：评论

学校读者我要写书评

暂无评论

Fractal-Based Planning of Urban Water Distribution System in China 16

Fractal-Based Planning of Urban Water Distribution System in...

引用

16th International Conference on Water Distribution System Analysis (WDSA)

作者： Qi, S. Ye, J. Gao, J. Wu, W. Wang, J. Zhang, Z. Chen, L. Shi, T. Zhou, L. Harbin Inst Technol 73 Huanghe Rd Harbin 150090 Peoples R China Staffordshire Univ Stafford ST18 0AD Staffs England Guangdong Holding Ltd Shenzhen 518021 Peoples R China Dalian Water Co Zhujiang Rd Dalian 116021 Peoples R China

In the research, fractal theory was adopted in water supply network. K-means algorithm was adopted to make the nodes multistage cluster zoning, and prioritize nodes was determined according to the actual situation of each zone level division. In each zone, prim algorithm completed each sub-region of water supply pipe network based on the use of fractal growth of self-organization. The established water supply network could be operated and managed according to the form of partition. The fractal self-growth model was applied to the water distribution system planning of one north city in China, the results clearly show the economic effectiveness. (C) 2014 The Authors. Published by Elsevier Ltd.

关键词： Water supply network district planning k-means algorithm level analysis fractal theory prim algorithm

来源：评论

学校读者我要写书评

暂无评论

Realization of the Minimum Cost Spanning Tree’s Storage and Optimization in prim algorithm

Realization of the Minimum Cost Spanning Tree’s Storage and...

引用

2010 The 3rd International Conference on Computational Intelligence and Industrial Application (PACIIA2010)

作者： Pan Da-zhi1,2 and Liu Zhi-bin2 1 College of mathematic and information China west normal university nanchong 637009,china Chen You-jun1 and Ding Xian-feng2 2 school of sciences Southwest petroleum university Chengdu 610050,china

This paper designs a special data structure for vertices in the network. the storage of edges in minimum cost spanning tree(for short, MCST) has been realized by the vertex array ,which is created by the special data structure. Through the vertex array, the vertices in V-U set constitute a static bi- directional circular linked list, so prim algorithm realizes truly operation selecting the shortest side though the V-U set, by which the prim algorithm is optimized to improve the efficiency of the operation. For the same vertex lying in U and V-U at the different moments, the special data structure makes storage space to be fully used and improves space utilization..

关键词： network prim algorithm minimum cost spanning tree bi-directional circular linked list static linked list.

来源：评论

学校读者我要写书评

暂无评论

Lot Release Strategy Semiconductor Assembly and Testing Based on The Degree of Constraint of The Minimum Spanning Tree

Lot Release Strategy Semiconductor Assembly and Testing Base...

引用

第26届中国控制与决策会议

作者： Zhang Guohui Liu Chang Yao Lili Shi Haibo SHENYANG INSTITUTE OF AUTOMATION CHINESE ACADEMY OF SCIENCES

The production of semiconductor assembly and testing is wide variety,and the cost of produce time of switch between different products is not the same,which could lead to its utilization is lower,production cycle *** lot release control plays an important role for improving utilization and shorter production cycle for semiconductor assembly and testing *** this paper,we modeled as a graph theory for solving constrained minimum spanning tree *** mainstream prim algorithm,we solve it to give each product sequence and specific lot release *** have solved the extra time problem that caused by blinding lot release,and finally,through applied research we verified the effectiveness and superiority of *** proposed strategy can reduce the change machine costs,shorten production cycle and improve production efficiency.

关键词： semiconductor assembly and testing graph theory minimum spanning tree prim algorithm

来源：评论

学校读者我要写书评

暂无评论

IMPROVED METHOD OF GA'S INITIATION POPULATION BASED ON LOCAL-EFFECTIVE-INFORMATION FOR SOLVING TSP

IMPROVED METHOD OF GA'S INITIATION POPULATION BASED ON LOCAL...

引用

2009中国宁波国际计算机科学与技术学术大会

作者： Yi Fan Jingbo Wang Haipeng Jia Liying Zheng Logistics Management Office Lanzhou Jiaotong University College of Electronic & Information Engineering Lanzhou Jiaotong University Air Defense Forces Command College of PLA

Genetic algorithm(GA) is restricted by actual system computing *** of the limited number of population and iteration,the choice of initiation Population is a vital of fact,which directly influents the result of algorithm and the ***'s Initiation Population is created by the path of well-proportioned choosing seed or stochastic choosing seed generally,but both of them have a vice of inefficient *** paper,combining with interrelated theories in graph theory,brings forward two kinds of Optimization algorithms of Initiation Population based on Minimize Spanning Tree Local Effective Information Theory towards the limitations of them,and we successes it to TSP by example analysis.

关键词： Genetic algorithm Initiation Population Minimize Spanning Tree prim algorithm Even-Odd Point Graphic Operation Method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：