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

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

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

Supervised classification of remotely sensed images using Bayesian network models and kruskal algorithm 23

Supervised classification of remotely sensed images using Ba...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Minimum spanning tree application in Covid-19 network structure analysis in the countries of the Middle East

引用

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY 2022年第8期25卷 2723-2728页

作者： Mahdi, Baidaa Saleh Al-Bayati, Jalal Hatem Hussein Al-Mahdawi, Amer J. Univ Baghdad Baghdad Iraq

Coronavirus disease (Covid-19) has threatened human life, so it has become necessary to study this disease from many aspects. This study aims to identify the nature of the effect of interdependence between these countries and the impact of each other on each other by designating these countries as heads for the proposed graph and measuring the distance between them using the ultrametric spanning tree. In this paper, a network of countries in the Middle East is described using the tools of graph theory.

关键词： Spanning tree kruskal algorithm MST Pajek program Covid-19

来源：评论

学校读者我要写书评

暂无评论

Fault Recovery Strategy of Distribution Network with Distributed Generation Based on Island Division 4

Fault Recovery Strategy of Distribution Network with Distrib...

引用

4th International Conference on Smart Power and Internet Energy Systems (SPIES)

作者： Wang, Zezhou Chen, Gang Chen, Lun Jia, Dongli Wu, Min Kang, Tianyuan Haiyan Power Supply Co Ltd Zhejiang State Grid Haiyan Peoples R China Haiyan Nanyuan Elect Power Engn Co Ltd Haiyan Peoples R China China Elect Power Res Inst Co Ltd Distribut Technol Ctr Beijing Peoples R China

ISBN: (纸本)9781665489577

In order to improve the utilization and reliability of distributed generation (distributed generation, DG) in active distribution network fault recovery, maximize the power supply of important loads and improve the power quality of the system, a distribution network reconfiguration strategy with DG based on island division is proposed. When the distribution network breaks down, firstly, the improved kruskal algorithm is used to divide the distribution network into islands. Then, the nodes that are not included in the scope of islands and the distributed generation without black start ability are connected with the system. Based on the improved genetic algorithm, the objective function is to maximize the power supply recovery of important loads and minimize the action times of switches, and the node voltage constraint, The distribution network is reconstructed under the constraints of line current constraints and network topology constraints. Finally, the effectiveness of this method is verified by an example of IEEE33 node system.

关键词： distribution network reconfiguration distributed power supply kruskal algorithm island division improved genetic 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

来源：评论

学校读者我要写书评

暂无评论

A Low Cost MST-FSM Obfuscation Method for Hardware IP Protection

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2020年第13期29卷

作者： Zhang, Yuejun Pan, Zhao Wang, Pengjun Zhang, Xiaowei Fudan Univ State Key Lab ASIC & Syst Shanghai 201203 Peoples R China Wenzhou Univ Coll Elect & Elect Engn Wenzhou 325035 Peoples R China Ningbo Univ Inst Circuits & Syst Ningbo 315211 Peoples R China State Key Lab Cryptol POB 5159 Beijing 100878 Peoples R China

Effective resistance to intellectual property (IP) piracy, overproduction and reverse engineering are becoming more and more necessary in the integrated circuit (IC) supply chain. To protect the hardware, the obfuscation methodology hides the original function by adding a large number of redundant states. However, existing hardware obfuscation approaches have hardware overhead and efficiency of obfuscation limitations. This paper proposed a novel methodology for IP security using the minimum spanning tree finite state machine (MST-FSM) obfuscation. In the minimum spanning tree (MST) algorithm, the Hamming distance defines the cost of obfuscated states. The kruskal algorithm optimizes the connection relationship of obfuscated states by computing the Hamming distance of the MST-FSM. The proposed MST-FSM is automatically generated and embedded in the hardware IP with the self-building program. Finally, the MST-FSM is applied on the itc99 benchmark circuits and encryption standard IP cores. Compared with other state-of-the-arts, the obfuscation potency is improved by 3.57%, and the average hardware cost is decreased by about 6.01%.

关键词： Hardware obfuscation MST-FSM kruskal algorithm low cost IP security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：