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

Development of a self-organized network to optimize the data transmission in BECMP based on minimum spanning tree algorithm

引用

建筑模拟（英文版） 2019年第3期12卷 535-545页

作者： Hao Yu Jili Zhang Ruobing Liang Infrastructure Engineering Dalian University of Technology Dalian 116024 China

The BECMP (building energy consumption monitoring platform) is a valuable tool that can bring about a remarkable improvement in terms of energy conservation. With the growth in scale and use BECMP, data packet loss is becoming an ever-increasing and more serious problem. Large-scale BECMPs are typically configured using a hierarchical structure, making it susceptible to problems such as congestion and packet loss due to malfunctions in the link layer. These problems lead to a loss in efficiency of maintenance, thus eroding the gains realized by BECMP. In this paper, a decentralized and self-organized network structure is proposed. Rather than a hierarchical structure, a flat topology is implemented to improve robustness and the efficiency of data transmission. A corresponding routing strategy based on the minimum spanning tree algorithm has been developed and validated. Simulation results have shown that the proposed network is able to adapt to interference within the network and achieve a better overall performance.

关键词： BECMP data congestion flat structure self-organized minimum spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of minimum spanning tree algorithm for Network Reduction of Distribution Systems

Application of Minimum Spanning Tree Algorithm for Network R...

引用

North American Power Symposium (NAPS)

作者： Nagarajan, Adarsh Ayyanar, Raja Arizona State Univ Dept Elect Engn Tempe AZ 85287 USA

ISBN: (纸本)9781479959044

This paper demonstrates the application of a graph search algorithm for the network reduction of the distribution feeder. The purpose behind the network-reduction is to develop a reduced distribution system to facilitate the dynamic analysis of the feeders with high penetration of PV generators. Dynamic analysis requires modeling of the distribution feeders in the electromagnetic transient programs for understanding the transients. Performing the transient analysis on large distribution feeders with high PV penetration is time intensive and impracticable. To aid this purpose a network-reduction algorithm for the distribution feeder is proposed in this paper. The objective is to develop a reduced distribution system to support the study of long-term transients of the PV inverters such as - interaction with other control devices (capacitor banks and PV generators), cloud transients, and voltage flicker. This paper proposes a novel network-reduction technique, based on a network-flow procedure, which is referred to as minimum spanning tree (MST) with additional capabilities. The network reduction proposed in this paper selectively retains the laterals and additionally accommodates the reactive power generation from the cable capacitance to the loads. The proposed algorithm will serve as an interface for modeling the feeder from the GIS database to the transient analysis tool.

关键词： EMTP cables (electric) capacitance distribution networks graph theory invertors power system transients reactive power solar cells transient analysis GIS database MST PV generators PV inverters PV penetration cable capacitance cloud transients distribution feeder dynamic analysis electromagnetic transient programs graph search algorithm long-term transients minimum spanning tree algorithm network-flow procedure network-reduction algorithm reactive power generation reduced distribution system transient analysis tool voltage flicker algorithm design and analysis Analytical models Generators Heuristic algorithms Load modeling Power cables Transient analysis distribution feeder Transient analysis Network reduction Voltage flicker Inventors algorithm design and analysis Dynamic analysis power system transients dispensing system Electromagnetic Transients Program cable capacitance Power cables dynamos Load modeling Reactive power

来源：评论

学校读者我要写书评

暂无评论

Musical Note Recognition Using minimum spanning tree algorithm 8

Musical Note Recognition Using Minimum Spanning Tree Algorit...

引用

8th International Conference on Telecommunication Systems Services and Applications (TSSA)

作者： Sazaki, Yoppy Ayuni, Rosda Kom, S. Sriwijaya Univ Fac Comp Sci Palembang Indonesia

ISBN: (纸本)9781479974474

Musical Notes are notes which is placed in staff. This research was developed a musical note recognition software using minimum spanning tree algorithm. This software was developed to help beginner in learning music especially in recognizing musical notes. The input for this software was musical notes image and the output were information of nmsical note which is name of nmsical note and beat's length sound of recognized musical note. There were four preprocessing involved in this research namely Sobel edge detection, binarization, segmentation and scaling then the result from pre-processing was used in training process. Accuracy of musical note recognition using this algorithm reached 97.9 per cent out of 97 trained data and 97.4 per cent out of 40 tested data.

关键词： Musical Note Musical Note Recognition minimum spanning tree algorithm Sound

来源：评论

学校读者我要写书评

暂无评论

MST-HGCN: a minimum spanning tree hyperbolic graph convolutional network

引用

APPLIED INTELLIGENCE 2023年第11期53卷 14515-14526页

作者： Liu, Yanxi Lang, Bo Quan, Fengnan Beihang Univ XueYuan Rd 37 Beijing 100191 Peoples R China

Graph neural networks (GNNs) have achieved outstanding results in research tasks on graph data. Most existing GNN models are defined in Euclidean space. However, when embedding hierarchical and scale-free graphs, models lying in hyperbolic space attain significant improvements over Euclidean graph convolutional networks (GCNs). To further enhance the performance of hyperbolic graph convolution and expand the applicability of related models to different data, we propose a hyperbolic graph convolution model based on the minimum spanning tree (MST-HGCN). Our method utilizes the minimum spanning tree (MST) algorithm to extract and process the topological structure of the input graph, which yields a more hierarchical topological structure and largely eliminates noisy edges. Then, several different topological structures based on the same spanning tree are produced by randomly re-adding the edges deleted by the MST algorithm;subsequently, a consistency loss is introduced to jointly optimize different outputs obtained from these topological structures. Experiments on node classification tasks and link prediction tasks for datasets with different hierarchy extents show that, our method comprehensively outperforms the vanilla hyperbolic GCN model on all the datasets, approaching or even outperforming the representative Euclidean comparison methods, which indicates that our method has better performance and data applicability.

关键词： minimum spanning tree algorithm Hyperbolic representation learning Graph convolutional network

来源：评论

学校读者我要写书评

暂无评论

3D Deployment Optimization of Wireless Sensor Networks for Heterogeneous Functional Nodes

引用

SENSORS 2025年第5期25卷 1366-1366页

作者： Lu, Zean Wang, Chengqun Wang, Peng Xu, Weiqiang Zhejiang Sci Tech Univ Sch Informat Sci & Engn Hangzhou 310018 Peoples R China Zhejiang Sci Tech Univ Key Lab Intelligent Text & Flexible Interconnect Z Hangzhou 310018 Peoples R China

The optimization of wireless sensor network (WSN) deployment is a current research hotspot, particularly significant in industrial applications. While some existing optimization methods focus more on balancing network coverage, connectivity, and deployment costs, aligning them with practical needs compared to single-performance optimization schemes, they still tend to be overly idealized. In practical applications, networks often face monitoring requirements for different data types, and some single-function sensors can be integrated into multifunctional sensors capable of monitoring multiple types of data. When encountering diverse data detection needs in a target area, this integration can be further considered to reduce deployment costs. Therefore, this paper designs a new multi-objective optimization problem aimed at optimizing heterogeneous-function wireless sensor networks, balancing coverage, connectivity, and cost, while introducing an additional cost dimension to meet the monitoring needs of different functional sensors in specific areas. This problem is a typical non-convex, multimodal, NP-hard problem. To address this, an improved Secretary Bird Optimization algorithm (ISBOA) is proposed, incorporating Gaussian Cuckoo Mutation and a smooth exploitation mechanism. The algorithm is compared with the original SBOA, Particle Swarm Optimization (PSO), Whale Optimization algorithm (WOA), and Northern Goshawk Optimization (NGO). Simulation results demonstrate that ISBOA exhibits a faster convergence speed and higher accuracy in both the 23 benchmark functions and the newly designed multi-objective optimization problem, significantly overcoming the shortcomings of the compared algorithms. Finally, for large-scale optimization problems, a minimum spanning tree domain reduction strategy is proposed, which significantly improves solving efficiency with a moderate sacrifice in accuracy.

关键词： deployment optimization of heterogeneous wireless sensor networks K-coverage C-connectivity improved bird optimization algorithm minimum spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

ANN-based structure peciliaties evaluation of polymer composite reinforced with unidirectional carbon fiber

引用

ALEXANDRIA ENGINEERING JOURNAL 2023年 82卷 218-239页

作者： Stepashkin, A. A. Chavhan, Suresh Gromov, S. V. Khanna, Ashish Tcherdyntsev, V. V. Gupta, Deepak Mohammad, H. Medvedeva, E. V. Gupta, Namita Alexandrova, S. S. Natl Univ Sci & Technol MISiS Moscow 119049 Russia Indian Inst Informat Technol Raichur Raichur Karnataka India Maharaja Agarasen Inst Technol Delhi India Moscow Inst Aviat Technol Moscow 125993 Russia

At the moment, there is a growing interest in composite materials with matrices based on thermoplastic polymers;these materials are superior to traditional carbon fiber plastics due to higher fracture toughness and impact strength, low smoke generation during combustion, and high thermal and chemical resistance. The deformation behavior of such composite materials due to the high plastic deformation of the matrix differs from the behavior of traditional composites, which must be considered when performing calculations. In our study, as a model object, the features of the microstructure of single carbon thread impregnated with polysulfone were studied in order to evaluate the distribution of misorientation angles of elementary fibers, the degree of their damage, the thickness of the polymer matrix interlayers between elementary fibers in threads impregnated with more viscous thermoplastic binders. Statistical analysis of a large array of micrographs was carried out using specially developed algorithms for computer processing of electron microscopic images of a composite material. algorithms for processing arrays of images using machine vision algorithms are proposed. Based on the analysis of the data array, the distributions of carbon fibers impregnated with polysulfone were plotted over the misorientation angle of the filaments and over the interfilament distance in the longitudinal and cross sections of the fiber. Using the machine learning method, an algorithm for detecting violations of the filament structure was implemented. The data obtained can be used to refine the calculations of the strength and deformation characteristics of composite materials with thermoplastic matrices.

关键词： Carbon fiber Polysulfone Composite Filaments Statistical processing Computer vision Machine learning Brightness gradient minimum spanning tree algorithm Color model Principal component analysis Computer image analysis

来源：评论

学校读者我要写书评

暂无评论

An Improved Fault Restoration Strategy for Distribution Network Power System 4

An Improved Fault Restoration Strategy for Distribution Netw...

引用

4th Asia Energy and Electrical Engineering Symposium (AEEES)

作者： Liu, Mengyao Zhang, Chao Shandong Univ Sci & Technol Qingdao 266590 Peoples R China

ISBN: (纸本)9781665479141

For problems of distribution network fault restoration, this paper proposes an improved fault restoration strategy based on minimum spanning tree algorithm and heuristic rules. Firstly, the whole distribution network is regarded as a weighted graph, and on the basis of power flow calculation, the Kruskal algorithm is used to solve the minimum spanning tree of the network to find the optimal restoration path that satisfies multiple constraints. Then, the heuristic rules for cooperative recovery of feeder and distributed power supply in the restoration path are established, the residual capacity of feeder and distributed power supply after fault is analyzed, and the problem of line voltage exceeding limit is eliminated by connecting switch. The search space for power supply restoration problems is greatly reduced. Finally, Matlab is used to test node system in IEEE 33 and the improved IEEE 123 to verify the proposed method.

关键词： fault restoration minimum spanning tree algorithm heuristic rules

来源：评论

学校读者我要写书评

暂无评论

A Coordination Optimization Method for Load Shedding Considering Distribution Network Reconfiguration

引用

ENERGIES 2022年第21期15卷

作者： Wang, Kai Kang, Lixia Yang, Songhao Xi An Jiao Tong Univ Dept Chem Engn Xian 710049 Peoples R China Univ Shaanxi Prov Engn Res Ctr New Energy Syst Engn & Equipment Xian 710049 Peoples R China Xi An Jiao Tong Univ Dept Elect Engn Xian 710049 Peoples R China

Load shedding control is an emergency control measure to maintain the frequency stability of the power system. Most of the existing load shedding methods use the extensive form of directly cutting off the outlet of the substation, featuring low control accuracy and high control cost. A network reconfiguration technique can adjust the topology of the distribution network and offers more optimization space for load shedding control. Therefore, this paper proposes a reconfiguration-load shedding coordination optimization scheme to reduce the power loss caused by load shedding control. In the proposed method, a load shedding mathematical optimization model based on distribution network reconfiguration is first established. The tie switches and segment switches in the distribution network are used to perform the reconfiguration of the distribution network, and the load switches are adopted to realize the load shedding. To improve the solving efficiency of the model, a solving strategy that combined a minimum spanning tree algorithm with an improved genetic algorithm is trailed to address the nonlinear and nonconvex terms. The application of the proposed method and model are finally verified via the IEEE 33 bus system, and the advantages in reducing the loss cost and the number of outage users are accordingly proven.

关键词： load shedding network reconfiguration minimum spanning tree algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Identification of spatial defects in semiconductor manufacturing

引用

APPLIED STOCHASTIC MODELS IN BUSINESS AND INDUSTRY 2021年第5期37卷 878-893页

作者： Borgoni, Riccardo Galimberti, Chiara Zappa, Diego Univ Milano Bicocca Dept Econ Management & Stat Piazza Ateneo Nuovo 1 Milan Italy Univ Cattolica Sacro Cuore Dept Stat Sci Milan Italy

In this article, we investigate the occurrence of defects in integrated circuit fabrication and show how spatial analysis can be effective in grasping and representing spatial regularities in defect patterns on the silicon supports, called wafers, used to produce microchips. Defects occurring on the wafer surface are the main cause of yield loss in the semiconductor industry;hence, to promptly detect an excess of defects and identify their spatial structure is crucial to the entire fabrication process. To address this hard-to-solve problem, this article proposes a concatenation of different methods, namely, a control chart, a clustering algorithm, and a graphical tool. First, a control chart based on the p-value of an appropriate test recognizes spatially structured defects on the wafer area. Then a clustering procedure grounded on the minimum spanning tree algorithm is adopted to identify those regions more prone to defect occurrences. Finally, alpha-shapes are employed to display their shape effectively. The suggested procedure proves to be extremely fast and effective, allowing its implementation in-line during the fabrication process. This provides a great advantage in modern microelectronics where items tend to be highly specialized and often produced in small lots. In particular, due to the Monte Carlo nature of the procedure, the control chart proposed hereafter does not require gold standard data to be set. This is particularly advantageous for small lot production, which is typically limited in time and does not permit to collect long time series of the charting statistics.

关键词： alpha‐ shapes integrated circuits fabrication minimum spanning tree algorithm p‐ value control charts

来源：评论

学校读者我要写书评

暂无评论

引用

IET COMMUNICATIONS 2019年第17期13卷 2786-2796页

作者： Li, Yue Wang, Ye Yuan, Peng Zhang, Qinyu Yang, Zhihua Harbin Inst Technol Commun Engn Res Ctr Shenzhen 518055 Guangdong Peoples R China

Space-terrestrial integrated networks consisting of low earth orbit (LEO) satellites and terrestrial users are widely developed for potentially diversified requirements of content distribution. With an obviously time-varying topology, however, designing a distribution strategy faces several explicit challenges, such as prolonged content access latency and significant transmission overheads, due to lack of contact opportunities and limited on-board storage space. In this study, therefore, a novel back-tracing partition directed on-path caching distribution mechanism (BPDM) is proposed for the file distribution in the hybrid LEO constellation and terrestrial network. In the proposed strategy, a group of feasible on-path cache nodes is iteratively selected by utilising a well-designed cross-timeslot graph, as well as a collaborative cached content placement strategy, called as multiple regions cooperative cache algorithm, by carefully considering diversified popularity of target files. As a result, the proposed BPDM could efficiently reduce redundant transmissions of content access for different users by fetching objective file mainly from limited quantities of intermediate caching nodes. Through the simulation results, the proposed method can obviously decrease the holistic overheads and access delay compared with the minimum spanning tree algorithm and Network Central Location (NCL) node selection metric.

关键词： trees (mathematics) cache storage satellite communication cooperative communication telecommunication network topology low deployment cost distribution strategy prolonged content access on-board storage space on-path caching distribution mechanism file distribution hybrid LEO constellation on-path cache nodes collaborative cached content placement strategy intermediate caching nodes cache distribution space-terrestrial integrated networks low earth orbit satellites content distribution time-varying topology transmission overheads popularity-aware back-tracing partition cooperative cache distribution multiple region cooperative cache algorithm LEO satellites prolonged content access latency back-tracing partition directed on-path caching distribution mechanism BPDM cross-timeslot graph objective file fetching minimum spanning tree algorithm NCL node selection metric

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：