期刊文献+
共找到826篇文章
< 1 2 42 >
每页显示 20 50 100
Brain Functional Network Based on Small-Worldness and Minimum Spanning Tree for Depression Analysis 被引量:1
1
作者 Bingtao Zhang Dan Wei +1 位作者 Yun Su Zhonglin Zhang 《Journal of Beijing Institute of Technology》 EI CAS 2023年第2期198-208,共11页
Since the outbreak and spread of corona virus disease 2019(COVID-19),the prevalence of mental disorders,such as depression,has continued to increase.To explore the abnormal changes of brain functional connections in p... Since the outbreak and spread of corona virus disease 2019(COVID-19),the prevalence of mental disorders,such as depression,has continued to increase.To explore the abnormal changes of brain functional connections in patients with depression,this paper proposes a depression analysis method based on brain function network(BFN).To avoid the volume conductor effect,BFN was constructed based on phase lag index(PLI).Then the indicators closely related to depression were selected from weighted BFN based on small-worldness(SW)characteristics and binarization BFN based on the minimum spanning tree(MST).Differences analysis between groups and correlation analysis between these indicators and diagnostic indicators were performed in turn.The resting state electroencephalogram(EEG)data of 24 patients with depression and 29 healthy controls(HC)was used to verify our proposed method.The results showed that compared with HC,the information processing of BFN in patients with depression decreased,and BFN showed a trend of randomization. 展开更多
关键词 DEPRESSION brain function network(BFN) small-worldness(SW) minimum spanning tree(mst)
下载PDF
SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING 被引量:3
2
作者 LiuXikui LiYan XuJin 《Journal of Electronics(China)》 2005年第2期112-117,共6页
Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a f... Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed. 展开更多
关键词 DNA computing Genetic algorithms minimum spanning tree problem
下载PDF
MINIMUM CONGESTION SPANNING TREES IN BIPARTITE AND RANDOM GRAPHS 被引量:1
3
作者 M.I. Ostrovskii 《Acta Mathematica Scientia》 SCIE CSCD 2011年第2期634-640,共7页
The first problem considered in this article reads: is it possible to find upper estimates for the spanning tree congestion in bipartite graphs, which are better than those for general graphs? It is proved that ther... The first problem considered in this article reads: is it possible to find upper estimates for the spanning tree congestion in bipartite graphs, which are better than those for general graphs? It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n3/2, where n is the number of vertices. The second problem is to estimate spanning tree congestion of random graphs. It is proved that the standard model of random graphs cannot be used to find graphs whose spanning tree congestion has order greater than n3/2. 展开更多
关键词 Bipartite graph random graph minimum congestion spanning tree
下载PDF
High-resolution Remote Sensing Image Segmentation Using Minimum Spanning Tree Tessellation and RHMRF-FCM Algorithm 被引量:10
4
作者 Wenjie LIN Yu LI Quanhua ZHAO 《Journal of Geodesy and Geoinformation Science》 2020年第1期52-63,共12页
It is proposed a high resolution remote sensing image segmentation method which combines static minimum spanning tree(MST)tessellation considering shape information and the RHMRF-FCM algorithm.It solves the problems i... It is proposed a high resolution remote sensing image segmentation method which combines static minimum spanning tree(MST)tessellation considering shape information and the RHMRF-FCM algorithm.It solves the problems in the traditional pixel-based HMRF-FCM algorithm in which poor noise resistance and low precision segmentation in a complex boundary exist.By using the MST model and shape information,the object boundary and geometrical noise can be expressed and reduced respectively.Firstly,the static MST tessellation is employed for dividing the image domain into some sub-regions corresponding to the components of homogeneous regions needed to be segmented.Secondly,based on the tessellation results,the RHMRF model is built,and regulation terms considering the KL information and the information entropy are introduced into the FCM objective function.Finally,the partial differential method and Lagrange function are employed to calculate the parameters of the fuzzy objective function for obtaining the global optimal segmentation results.To verify the robustness and effectiveness of the proposed algorithm,the experiments are carried out with WorldView-3(WV-3)high resolution image.The results from proposed method with different parameters and comparing methods(multi-resolution method and watershed segmentation method in eCognition software)are analyzed qualitatively and quantitatively. 展开更多
关键词 STATIC minimum spanning tree TESSELLATION shape parameter RHMRF FCM algorithm HIGH-RESOLUTION remote sensing image segmentation
下载PDF
Salience adaptive morphological structuring element construction method based on minimum spanning tree
5
作者 YANG Wenting WANG Xiaopeng FANG Chao 《Journal of Measurement Science and Instrumentation》 CAS CSCD 2021年第1期36-43,共8页
Classical mathematical morphology operations use a fixed size and shape structuring element to process the whole image.Due to the diversity of image content and the complexity of target structure,for processed image,i... Classical mathematical morphology operations use a fixed size and shape structuring element to process the whole image.Due to the diversity of image content and the complexity of target structure,for processed image,its shape may be changed and part of the information may be lost.Therefore,we propose a method for constructing salience adaptive morphological structuring elements based on minimum spanning tree(MST).First,the gradient image of the input image is calculated,the edge image is obtained by non-maximum suppression(NMS)of the gradient image,and then chamfer distance transformation is performed on the edge image to obtain a salience map(SM).Second,the radius of structuring element is determined by calculating the maximum and minimum values of SM and then the minimum spanning tree is calculated on the SM.Finally,the radius is used to construct a structuring element whose shape and size adaptively change with the local features of the input image.In addition,the basic morphological operators such as erosion,dilation,opening and closing are redefined using the adaptive structuring elements and then compared with the classical morphological operators.The simulation results show that the proposed method can make full use of the local features of the image and has better processing results in image structure preservation and image filtering. 展开更多
关键词 adaptive structuring element mathematical morphology salience map(SM) minimum spanning tree(mst)
下载PDF
THE DESIGN AND ANALYSIS OF ALGORITHM OF MINIMUM COST SPANNING TREE
6
作者 徐绪松 刘大成 吴丽华 《Acta Mathematica Scientia》 SCIE CSCD 1996年第3期296-301,共6页
This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure ... This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm. This algorithm uses the FDG (formula to divide elements into groups) to sort (the FDG sorts a sequence of n elements in expected tir O(n)) and uses the method of path compression to find and to unite. Therefore. n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)). 展开更多
关键词 minimum cost spanning tree a sort using the FDG path compression set operation of find and unite algorithm analysis
下载PDF
A Novel Binary Firefly Algorithm for the Minimum Labeling Spanning Tree Problem
7
作者 Mugang Lin Fangju Liu +1 位作者 Huihuang Zhao Jianzhen Chen 《Computer Modeling in Engineering & Sciences》 SCIE EI 2020年第10期197-214,共18页
Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatoria... Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatorial optimization problem,which is widely applied in communication networks,multimodal transportation networks,and data compression.Some approximation algorithms and heuristics algorithms have been proposed for the problem.Firefly algorithm is a new meta-heuristic algorithm.Because of its simplicity and easy implementation,it has been successfully applied in various fields.However,the basic firefly algorithm is not suitable for discrete problems.To this end,a novel discrete firefly algorithm for the MLST problem is proposed in this paper.A binary operation method to update firefly positions and a local feasible handling method are introduced,which correct unfeasible solutions,eliminate redundant labels,and make the algorithm more suitable for discrete problems.Computational results show that the algorithm has good performance.The algorithm can be extended to solve other discrete optimization problems. 展开更多
关键词 minimum labeling spanning tree problem binary firefly algorithm META-HEURISTICS discrete optimization
下载PDF
The Design of the Minimum Spanning Tree Algorithms
8
作者 Zhicheng LIU Bo JIANG 《Intelligent Information Management》 2009年第1期56-59,共4页
Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of minimum spanning tree... Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of minimum spanning trees. It designs the corresponding fitness function,operator and few controlling strategies to improve its speed and evolutionary efficiency.Only one solution can be gotten with running traditional al-gorithem atone time.The new algorithm can get a set of the solutions with higher probability in a shorter time.The experiment shows that it has a better performance than traditional methods. 展开更多
关键词 minimum spanning tree GENETIC ALGORITHM PATTERN
下载PDF
On the Minimum Spanning Tree Determined by n Points in the Unit Square
9
作者 叶继昌 徐寅峰 徐成贤 《Chinese Quarterly Journal of Mathematics》 CSCD 1999年第2期76-82, ,共7页
Let P n be a set of n points in the unit square S,l(P n) denoe the length of the minimum spanning tree of P n, andC n= max P nSl(P n), n=2,3,… In this paper,the exact value of C n for n=2,3,4 and the corresponding co... Let P n be a set of n points in the unit square S,l(P n) denoe the length of the minimum spanning tree of P n, andC n= max P nSl(P n), n=2,3,… In this paper,the exact value of C n for n=2,3,4 and the corresponding configurations are given. Additionally,the conjectures of the configuration for n=5,6,7,8,9 are proposed. 展开更多
关键词 minimum spanning tree maximin problem CONFIGURATION
下载PDF
基于MST算法的离散数据解缠方法研究 被引量:2
10
作者 谢酬 李震 +1 位作者 李新武 许骥 《高技术通讯》 CAS CSCD 北大核心 2007年第11期1136-1141,共6页
在对不规则网格中残差计算的性质进行分析的基础上,提出了用于离散数据的相位解缠的MST-FloodFill方法,该方法利用Delaunay三角网连接离散数据,在每个三角形中计算残差值,通过最小跨越树(MST)算法建立正负残差平衡的最小生成树,利用Fl... 在对不规则网格中残差计算的性质进行分析的基础上,提出了用于离散数据的相位解缠的MST-FloodFill方法,该方法利用Delaunay三角网连接离散数据,在每个三角形中计算残差值,通过最小跨越树(MST)算法建立正负残差平衡的最小生成树,利用FloodFill算法绕过枝切线进行积分得到离散数据的解缠相位,从而实现离散数据的相位解缠。利用模拟数据和真实数据进行的实验以及将所得结果与真实结果进行的比对显示,利用这种离散数据解缠方法得出的结果完全正确,而且有较高的解缠效率,从而验证了该方法对于离散数据解缠的正确性和有效性。 展开更多
关键词 离散数据 解缠 mst FLOOD FILL DELAUNAY三角网
下载PDF
基于MST的辽宁省上市公司风格聚集研究 被引量:3
11
作者 黄飞雪 苏敬勤 赵昕 《大连理工大学学报》 EI CAS CSCD 北大核心 2010年第6期1042-1046,共5页
在风格投资分析中,传统的参数分析方法将带来分析结果的多样性,为此提出了采用具有准确拓扑序列的亚超度量空间方法.首先,计算出股票间任意两个股价间的相关系数,并在此基础上计算出超度量空间的欧式距离;其次,利用Kruskal的最小生成树... 在风格投资分析中,传统的参数分析方法将带来分析结果的多样性,为此提出了采用具有准确拓扑序列的亚超度量空间方法.首先,计算出股票间任意两个股价间的相关系数,并在此基础上计算出超度量空间的欧式距离;其次,利用Kruskal的最小生成树算法,构建出证券组合的亚超度量空间;最后,将亚超度量空间映射为指数分层结构.对2005年7月至2007年12月的辽宁省上市公司样本的日数据进行实证研究,结果发现存在行业风格、事件风格、业绩风格及现金流风格,这表明亚超度量空间方法是有效的. 展开更多
关键词 风格聚集 上市公司 最小生成树 亚超度量空间 指数分层结构
下载PDF
结合mean-shift与MST的K-means聚类算法 被引量:5
12
作者 徐沁 罗斌 《计算机工程》 CAS CSCD 2013年第12期204-210,共7页
针对初始点选择不当导致K-means陷入局部最小值问题,提出一种结合自适应mean-shift与最小生成树(MST)的K-means聚类算法。将数据对象投影到主成分分析(PCA)子空间,给出自适应mean-shift算法,并在PCA子空间内将数据向密度大的区域聚集,... 针对初始点选择不当导致K-means陷入局部最小值问题,提出一种结合自适应mean-shift与最小生成树(MST)的K-means聚类算法。将数据对象投影到主成分分析(PCA)子空间,给出自适应mean-shift算法,并在PCA子空间内将数据向密度大的区域聚集,再利用MST与图连通分量算法,找出数据的类别数和类标签,据此计算原始空间的密度峰值,并将其作为K-means聚类的初始中心点。对K-means的目标函数、聚类精度和运行时间进行比较,结果表明,该算法在较短的运行时间内能给出较优的全局解。 展开更多
关键词 聚类分析 K—means算法 初始中心点 Mean—Shift算法 主成分分析 最小生成树
下载PDF
度约束最小生成树(DCMST)的竞争决策算法 被引量:21
13
作者 宁爱兵 马良 《系统工程学报》 CSCD 北大核心 2005年第6期630-634,共5页
度约束最小生成树是网络设计和优化中的一个NP难题,介绍了一种基于竞争造就优化和决策左右结果的新型算法———竞争决策算法,利用竞争决策算法的通用模型,给出了一种基于竞争决策思想求解度约束最小生成树的快速求解方法,经过数据测试... 度约束最小生成树是网络设计和优化中的一个NP难题,介绍了一种基于竞争造就优化和决策左右结果的新型算法———竞争决策算法,利用竞争决策算法的通用模型,给出了一种基于竞争决策思想求解度约束最小生成树的快速求解方法,经过数据测试和验证,并与其它算法的结果进行了比较,得到了较好的结果. 展开更多
关键词 度约束最小生成树 竞争决策算法 竞争力函数 决策函数
下载PDF
银行信贷资产证券化信用风险度量及传染研究——基于修正KMV模型和MST算法的实证 被引量:19
14
作者 谢赤 凌毓秀 《财经理论与实践》 CSSCI 北大核心 2018年第3期2-8,共7页
精准科学地度量和描述信用风险及传染机制有利于银行信贷资产证券化的高效健康发展和货币市场系统性风险的防范。运用修正KMV模型测度银行信贷资产证券化产品在不同时期的信用风险,并采用最小生成树(MST)算法考察银行间信用风险的传染... 精准科学地度量和描述信用风险及传染机制有利于银行信贷资产证券化的高效健康发展和货币市场系统性风险的防范。运用修正KMV模型测度银行信贷资产证券化产品在不同时期的信用风险,并采用最小生成树(MST)算法考察银行间信用风险的传染机制。结果显示:政策性银行和大型商业银行发行的产品在各个时期信用风险均处于较低水平;股份制银行、城商行和农商行发行的产品违约率前期略高于前两类银行,但后期明显下降;后三类银行位于银行股票收益率网络的中心位置,具有传递信息和维系网络稳定的重要作用。 展开更多
关键词 商业银行 信贷资产证券化 信用风险 修正KMV模型 最小生成树(mst)
下载PDF
结合MST划分和RHMRF-FCM算法的高分辨率遥感图像分割 被引量:13
15
作者 林文杰 李玉 赵泉华 《测绘学报》 EI CSCD 北大核心 2019年第1期64-74,共11页
针对基于像素的HMRF-FCM算法抗噪性差以及对地物复杂边界分割精度低的问题,提出一种结合形状信息的静态MST区域划分和RHMRF-FCM算法的高分辨率遥感图像分割方法。该方法定义一种静态MST同质区域划分准则,借助MST能较好表达边界和形状信... 针对基于像素的HMRF-FCM算法抗噪性差以及对地物复杂边界分割精度低的问题,提出一种结合形状信息的静态MST区域划分和RHMRF-FCM算法的高分辨率遥感图像分割方法。该方法定义一种静态MST同质区域划分准则,借助MST能较好表达边界和形状信息、能较好抑制几何噪声的特点,解决地物复杂边界的表达和降低分割结果中几何噪声问题。首先,利用MST静态划分将图像域划分成若干个均质区域,假设每个均质区域内光谱测度服从独立同一的多元高斯分布。然后,在此基础上构建了区域隐马尔可夫随机场模型,以及建立基于信息熵和KL信息正则化项的模糊聚类目标函数。最后,采用偏微分方法对分割模型参数进行求解,从而得到全局最优分割结果。为验证本文方法,对WorldView-3高分遥感图像进行分割试验。定性、定量分析了尺度参数、光谱相似性参数和区域紧致度参数对最优分割结果的影响,并对比分析本文算法和eCognition软件中的多分辨率分割算法、分水岭算法。 展开更多
关键词 静态mst划分 形状参数 区域隐马尔可夫随机场 模糊C均值算法 高分辨遥感图像分割
下载PDF
约束最小支撑树(C-MST)问题:复杂性和上下界估计 被引量:1
16
作者 李帮义 姚恩瑜 《浙江大学学报(理学版)》 CAS CSCD 2000年第3期237-242,共6页
本文首先建立了约束最小支撑树问题的模型 ,利用背包问题的复杂性 ,证明了该问题是 NP-完全的 .然后利用一个广义线性规划的对偶算法 ,对目标函数的上下界作出了估计 。
关键词 约束最小支撑树 估计 复杂性 C-mst 上界 下界
下载PDF
融合K均值分簇MST路由的无线传感网压缩采样技术 被引量:3
17
作者 张美燕 蔡文郁 《传感技术学报》 CAS CSCD 北大核心 2015年第9期1402-1407,共6页
考虑无线传感网中数据采集特点和能量约束性,将分簇路由策略融合到压缩感知采样中,提出了一种融合K均值分簇MST路由的压缩采样算法。算法采用稀疏投影矩阵以减小投影矩阵与稀疏基之间的相关度,利用K均值分簇MST(Minimum Spanning Tree)... 考虑无线传感网中数据采集特点和能量约束性,将分簇路由策略融合到压缩感知采样中,提出了一种融合K均值分簇MST路由的压缩采样算法。算法采用稀疏投影矩阵以减小投影矩阵与稀疏基之间的相关度,利用K均值分簇MST(Minimum Spanning Tree)机制构造数据融合树,在保证数据重构质量的基础上减少网络数据传输量。仿真结果表明,算法可以提高网络能量使用效率,同时可以适应各种规模的无线传感网。 展开更多
关键词 无线传感网 压缩感知 自适应采样 最小生成树 K均值分簇
下载PDF
基于混合遗传算法求解CMST问题 被引量:1
18
作者 曲润涛 韩兵 席裕庚 《通信学报》 EI CSCD 北大核心 1999年第10期31-35,共5页
CMST (Constrained Minim um Spanning Tree)是通信网络拓扑结构设计中经常遇到的问题,一般解决此问题采用启发式方法,本文提出了使用混合遗传算法求解CMST问题的新算法。
关键词 遗传算法 启发式方法 Cmst 通信网
下载PDF
基于MST-改进PSO的电-气-热综合能源系统负荷恢复策略 被引量:2
19
作者 魏乐 张峻松 +1 位作者 房方 于松源 《科学技术与工程》 北大核心 2023年第32期13834-13844,共11页
以往故障恢复的研究大多集中在配电网方面且恢复目标仅为单一的负荷恢复量,未考虑资源成本以及能源消耗的环境保护成本等。对此,提出一种多侧协调优化的多目标负荷恢复策略,该方法不仅实现了网络的重构、较高等级负荷的优先恢复,还实现... 以往故障恢复的研究大多集中在配电网方面且恢复目标仅为单一的负荷恢复量,未考虑资源成本以及能源消耗的环境保护成本等。对此,提出一种多侧协调优化的多目标负荷恢复策略,该方法不仅实现了网络的重构、较高等级负荷的优先恢复,还实现了系统运行成本最优。在系统发生故障后,分两阶段进行恢复:首先,使用最小生成树(minimum spanning tree,MST)对系统结构进行改造,实现系统网络的重构,形成可恢复负荷的最终区域;然后,综合考虑源侧资源购买成本、用户侧切负荷补偿成本以及碳排放环保成本等,构建优化目标函数,使用改进粒子群(particle swarm optimization,PSO)算法对其进行求解,得到最终恢复方案。通过33节点配电网、14节点气网和6节点热网测试系统仿真,验证了该负荷恢复策略的有效性。 展开更多
关键词 电-气-热综合能源系统 最小生成树(mst) 负荷恢复 优化调度 粒子群算法(PSO)
下载PDF
图形轮廓分层路由提取的MST生长算法 被引量:1
20
作者 覃斌 阎春平 刘飞 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2011年第2期256-262,共7页
在以可达路径决策为核心的图形轮廓提取中,为有效地解决路由决策困难及路径特征值精度等问题,提出了图形轮廓分层路由提取的MST生长算法.该算法将图形路由拓扑结构划分为域内路由和域间路由.域内路由对非支配点关联路径进行重组,建立以... 在以可达路径决策为核心的图形轮廓提取中,为有效地解决路由决策困难及路径特征值精度等问题,提出了图形轮廓分层路由提取的MST生长算法.该算法将图形路由拓扑结构划分为域内路由和域间路由.域内路由对非支配点关联路径进行重组,建立以支配点为节点的图形有权无向图;域间路由以无向图最小生成树MST为基础,利用树节点间唯一可达特性构造MST生长算法.最后综合这2个层次实现完整的图形轮廓提取.通过算例及应用证明了文中算法的可行性和有效性. 展开更多
关键词 图形轮廓提取 分层路由 有权无向图 最小生成树 路由算法
下载PDF
上一页 1 2 42 下一页 到第
使用帮助 返回顶部