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

Conference on Image and Signal Processing for Remote Sensing XXIII

作者： Kheddam, Radja Boudissa, Youcef Belhadj-Aissa, Aichouche USTHB Fac Elect & Comp Sci Image Proc & Radiat Lab BP 32 Algiers 16111 Algeria

ISBN: (数字)9781510613195

ISBN: (纸本)9781510613195;9781510613188

The aim of this work is to evaluate the performances of three Bayesian networks widely used for supervised image classification. The developed structures are constructed due to kruskal algorithm which allows the determination of the maximum weight spanning tree by using the mutual information between the attributes. We started by the Bayesian naive classifier (BNC), which assumes that there is no dependency, between the attributes to classify. In order to relax this strong assumption, we tested the tree augmented naive Bayes classifier (TANC) where each feature has at most one variable as parent, and the forest augmented naive Bayes classifier (FANC) where each attribute forms an arbitrary graph rather than just a tree. These classifiers are evaluated using a multispectral image and hyperspectral image in order to analyze the structure classifier complexity according to the number of attributes (04 and 10 spectral bands for the two images respectively). Obtained results are compared with state-of-the art competitor, namely, the SVM classifier. Classified images by TANC and FANC achieved higher accuracies than other classifiers including SVM. It is concluded that the choice of attributes dependencies significantly contributes to the discrimination of subjects on the ground. Thus, Bayesian networks appear as powerful tool for multispectral and hyperspectral image classification.

关键词： Multispectral image supervised classification Bayesian networks kruskal algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization of Routes for Covered Walkways at University Campus by kruskal algorithm 9th

Optimization of Routes for Covered Walkways at University Ca...

引用

9th Workshop on Engineering Applications (WEA)

作者： Manuel Zambrano-Restrepo, Juan Javier Tovar-Perilla, Nelson Adriana Sanchez-Echeverri, Luz Patricia Carranza-Murillo, Laura Dept Nacl Planeac Ibague Colombia Univ Ibague Fac Ciencias Nat & Matemat Ibague Colombia Univ Nacl Abierta & Dist CEAD Ibague Escuela Ciencia Basica Tecnol & Ingn Ibague Colombia

ISBN: (纸本)9783031206108;9783031206115

The adverse weather conditions affect the mobility in the open spaces at university campus due the difficulty to walk in sunny or runny days. This paper describes the process to define the routes to be covered at university campus, the selection of the routes is based on the necessity of those could connect all the dependencies with minimum total distance. kruskal algorithm was used to obtain the routes that ensure minimum total distance to be covered and the intercommunication directly or indirectly between the 22 nodes around the campus which represents all campus dependencies. Finally, a mathematical model of binary integer linear programming was formulated basis on the solution obtained by kruskal algorithm. The solution shows as result 271.38 m of walkways to be covered that was obtained after 12 interactions of kruskal algorithm.

关键词： kruskal algorithm Minimum spanning tree Covered routes

来源：评论

学校读者我要写书评

暂无评论

The Application of Union-find Sets in kruskal algorithm

The Application of Union-find Sets in Kruskal Algorithm

引用

International Conference on Artificial Intelligence and Computational Intelligence

作者： Pan, Da-Zhi Liu, Zhi-Bin Ding, Xian-Feng Zheng, Qin SW Petr Univ Coll Math & Phys Chengdu Peoples R China

ISBN: (纸本)9780769538167

It is the key of Krusal algorithm to select edges and judge loop. Though realized path-compression in operation of searching tree of Union-Find Sets Data Structure, and optimized merging-operation which the shallower tree has been merged into the deeper tree, the operation of selecting edges and judging loop in Krusal algorithm is optimized and the time complexity of algorithm is reduced. Compared with the common way, the programming operation time of the new way has been reduced to some 1/10.

关键词： kruskal algorithm union-find sets path-compression minimum cost spanning tree

来源：评论

学校读者我要写书评

暂无评论

Optimizing Public Space in High-Rise Residences: A Whole Life Cycle Perspective with kruskal algorithm-A Case Study of a Shanghai High-Rise Residential Project

引用

BUILDINGS 2024年第6期14卷 1769页

作者： Li, Jingwen Han, Yaodong Li, Qinyi Tang, Daizhong Tongji Univ Sch Econ & Management Shanghai 200092 Peoples R China

In response to the intensification of urbanization, characterized by increasingly dense land use, the proliferation of high-rise residences has emerged as a predominant housing solution, particularly evident in developed cities like those in China. With a primary aim of enhancing the residential living environment within high-rise structures, this study advocates for a comprehensive whole life cycle perspective. By employing digital technology and conducting experiments centered on a representative case study, this paper focuses on optimizing the functional layout of public activity spaces within high-rise residential projects. Specifically, this article aims to address challenges such as the inadequate configuration and articulation of various public spaces, along with the underutilization of peripheral activity areas. Central to the optimization efforts is the utilization of the kruskal algorithm, which enables the analysis of flow lines and functions, ultimately leading to the derivation of optimal solutions. Through a detailed analysis of our case study, this paper provides actionable insights into enhancing the feasibility and effectiveness of public spaces within high-rise residential projects. Recognizing the pivotal role of public space layout in shaping residents' living experiences, the importance of addressing this issue early in the design phase was emphasized. By integrating scientifically driven digital technology solutions, smart, inclusive, and convenient communities that cater to the diverse needs of their inhabitants are aspired to be created.

关键词： high-rise residence public space kruskal algorithm whole life cycle theory

来源：评论

学校读者我要写书评

暂无评论

The analysis and application of Prim algorithm,kruskal algorithm,Boruvka algorithm

The analysis and application of Prim algorithm,Kruskal algor...

引用

作者： Jiayu Chen Beijing Normal University-Hong Kong Baptist University United International College

Minimum spanning tree has many applications in real *** example,the government needs to build roads between many ***,it is necessary to find the plan with the shortest path to save the *** problem is essentially generating a minimal spanning tree,and it require a suitable algorithm to find the minimum spanning *** this paper,the author analyzes the structure and time complexity of the Prim algorithm,the kruskal algorithm and the Boruvka *** this research,the author finds Prim algorithm is suitable for dense *** kruskal algorithm can generate the minimum spanning tree in sparse *** the Boruvka algorithm is suitable for graphs that have some special *** on the above conclusions,the author gives some suggestions for urban highway network planning.

关键词： minimum spanning tree Prim algorithm kruskal algorithm Boruvka algorithm graph

来源：评论

学校读者我要写书评

暂无评论

algorithm for distribution network reconfiguration and reactive power compensation with battery energy storage systems

引用

ELECTRIC POWER SYSTEMS RESEARCH 2025年 244卷

作者： Rajic, Tomislav Stojanovic, Branko Univ Belgrade Sch Elect Engn Bulevar Kralja Aleksandra 73 Belgrade 11000 Serbia

The paper deals with distribution network reconfiguration and reactive power compensation, taking into account the existence of distributed energy sources, Distributed Generation and Battery Energy Storage Systems. A large number of constraints are included in order to present the problem as realistically as possible. The limitations are the satisfaction of the input power factor, non-overcompensation with reactive power, the minimum and maximum value of the voltage in the nodes, the maximum allowed effective value of the network branch currents and the number of commutations per switching element within 24 h. Contributions are realistic representation of hourly changes in consumption and production from renewable energy sources and BESS, alongside reconfiguration (with commutaton constraint), what is rarity in modern works. The idea of the paper is to present the method that combines the kruskal algorithm for reconfiguration and the Simulated Annealing (SA) for compensation. The optimization method determines the position of the capacitor banks and the network configuration that minimizes active power losses and cost on an hourly basis. Detailed analyses show how BESS affect technically optimal solution and what is the final cost. The addressed problem is of Mixed Intiger Nonlinear Programming optimization class.

关键词： Reconfiguration kruskal algorithm Simulation annealing Battery energy storage systems

来源：评论

学校读者我要写书评

暂无评论

Comparison of Prim and kruskal on Shanghai and Shenzhen 300 Index hierarchical structure tree

Comparison of Prim and Kruskal on Shanghai and Shenzhen 300 ...

引用

International Conference on Web Information Systems and Mining

作者： Huang, Feixue Gao, Pengfei Wang, Yu Dalian Univ Technol Dept Econ Dalian 116024 Liaoning Prov Peoples R China Dalian Univ Technol Sch Software Dalian 116024 Liaoning Prov Peoples R China

ISBN: (纸本)9780769538174

This study's objective is to assess the performance of the common Prim and the kruskal of the minimum spanning tree in building up super metric space. We proposed the use of complexity analysis and experimental methods to assess these two methods. After the analysis of the sample data of Shanghai and Shenzhen 300 index daily from the second half of 2005 to the second half of 2007, The results showed that when the number of shares is less than 100, judging from the space complexity, kruskal algorithm is relatively superior to Prim algorithm;however, when the number of shares is greater than 100, from the time complexity's aspect, Prim algorithm is more superior. This study's conclusion indicates that matrix of Shanghai and Shenzhen 300 stock the inter-continental distance formed by the edge map more, so Prim better than kruskal.

关键词： Super metric Spaces Hierarchical structure tree index Minimum spanning tree(MST) Prim algorithm kruskal algorithm

来源：评论

学校读者我要写书评

暂无评论

A Combination of kruskal and K-means algorithms for Network Lifetime Extension in Wireless Sensor Networks 17

A Combination of Kruskal and K-means Algorithms for Network ...

引用

17th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC)

作者： Jlassi, Wadii Haddad, Rim Bouallegue, Ridha Shubair, Raed Univ Tunis El Manar Innov COM Lab Sup Com Natl Engn Sch Tunis Tunis Tunisia Laval Univ Quebec City PQ Canada Univ Carthage Innov COM Lab Sup Com Tunis Tunisia New York Univ Abu Dhabi U Arab Emirates

ISBN: (纸本)9781728186160

Recently, the deployment of Wireless Sensor Networks (WSNs) increases in various applications. These networks are dispersed in an inaccessible area and have to operate on small batteries. Energy is one of the most critical resources since sensor nodes sense, collect, process and send data to its base station. Many researches have demonstrated the importance of clustering to extend the lifetime of wireless sensor networks. Clustering algorithms consider several parameters like the density, the residual energy, and the distance separating the base station and the nodes to select the appropriate cluster heads. In this paper, K-means algorithm is first used to select a set of Cluster Heads (CHs) from all the nodes. Then we propose the kruskal algorithm to define the optimal path between CHs and BS. Simulation results show that the proposed combination allows improved lifetime extension compared with existing algorithms.

关键词： Wireless Sensor Networks Clustering K-means kruskal algorithm

来源：评论

学校读者我要写书评

暂无评论

algorithms for computing the Folk rule in minimum cost spanning tree problems with groups

引用

DISCRETE APPLIED MATHEMATICS 2023年第1期338卷 113-124页

作者： Lorenzo-Freire, S. Gonzalez-Maestro, A. Alonso-Meijide, J. M. Univ A Coruna Fac Comp Sci Dept Math MODES Res Grp Campus Elvina La Coruna 15071 Spain Univ A Coruna CITIC Campus Elvina La Coruna 15071 Spain Univ Santiago de Compostela Dept Stat Math Anal & Optimizat MODESTYA Res Grp Fac Sci Lugo 27002 Spain CITMAga Santiago De Compostela 15782 Spain

This paper focuses on the computation of a rule in minimum cost spanning tree problems with groups, which coincides with the Owen value of the cooperative game for the irreducible cost matrix. To this aim, two polynomial-time algorithms are provided. The first of them is based on the steps of kruskal algorithm whereas the other is based on a painting procedure.& COPY;2023 Published by Elsevier B.V.

关键词： Minimum cost spanning tree problems kruskal algorithm Cooperative game theory Shapley value Owen value

来源：评论

学校读者我要写书评

暂无评论

Stochastic maximum weight forest problem

引用

NETWORKS 2015年第4期65卷 289-305页

作者： Adasme, Pablo Andrade, Rafael Letournel, Marc Lisser, Abdel Univ Santiago Chile Dept Ingn Elect Santiago Chile Univ Fed Ceara Dept Estat & Matemat Aplicada BR-60440900 Fortaleza Ceara Brazil Univ Paris 11 Rech Informat Lab F-91405 Orsay France

In this article, we investigate the stochastic maximum weight forest problem. We present two mathematical formulations for the problem: a polynomial sized one based on the characterization of forests in graphs and a formulation with an exponential number of constraints. We give a proof of the correctness of the new formulation and present a polynomial reduction from the set cover problem to give some insight about the complexity of this problem. We introduce an L-shaped decomposition approach for the polynomial formulation, thus allowing the optimal solution of large scale instances with up to 90 nodes. Finally, we propose a kruskal based variable neighborhood search (VNS) metaheuristic to compute near optimal solutions with significantly less computational effort. Our numerical results show that the VNS approach provides tight near optimal solutions with a gap less than 1% for most of the instances. (c) 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 65(4), 289-305 2015

关键词： stochastic maximum weight forest problem set cover reduction polynomial formulation L-shaped decomposition variable neighborhood search kruskal algorithm stochastic programming cycle elimination constraints

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：