基于双密度双树小波变换的超声图像降噪

针对去除斑点噪声提高超声图像质量的问题,提出双密度双树离散小波变换（DD-DT DWT）结合局部方差估计的双变量收缩阈值函数（BFS）的图像降噪改进算法实现超声图像降噪。首先将原始图像用DD-DT DWT进行多尺度分解,根据噪声模型和小波子父代系数确定的局部边缘方差估计阈值,利用子父代小波系数相关性构成的双变量阈值函数,对图像16个方向的小波系数进行非线性自适应的处理,最后重建降噪后的图像。用仿真和真实数据对此算法进行验证,并与其他小波降噪系统的性能比较,结果分析表明噪声图像经该算法降噪后,图像性能指标均有提高,不仅有效的实现图像降噪,而且较好的保留图像细节。     

一种新的基于混合策略的动态组密钥管理方案

针对大型动态组通信,提出一种基于Iolus LKH SKDC混合策略的组密钥管理方案。该方案中全局组控制器通过密钥树来管理各个子组控制器,每个子组内采用改进的LKH SKDC方案管理子组成员;子组管理器根据成员ID值,利用单向散列函数计算成员所在路径上各节点密钥值。该方案具有分组管理和集中管理的优点以及良好的可伸缩性,它使LKH方案中的单点失效问题限制在子组范围内,不会对全局产生影响。理论分析和数值结果表明,该方案中子组管理器的密钥存储和动态更新开销大大减少,且用户在加入和退出子组时不会随机产生更新密钥,具有较好的综合性能。     

基于粗糙决策模型和蚁群算法的故障诊断

粗糙集理论是一种新型的处理模糊和不确定知识的数学工具,它能在保持信息系统分类能力不变的前提下,有效地进行知识约简;决策树算法可对约简后的决策表进行规则提取,有着直观、能定量分析的优点.提出一种变化趋势关联度来评价条件属性的重要性,建立粗糙决策树故障诊断模型,并在诊断推理中引入一种新的人工智能方法——蚁群算法,来确定决策树的最优检测次序.将其应用于工业精对苯二甲酸(purified terephthalic acid,PTA)生产过程中的对二甲苯氧化反应温度的诊断结果表明了提出方法的有效性.     

MULTIPLE CRITERIA DECISION MAKING： DISCORDANT PREFERENCES AND PROBLEM DESCRIPTION

There are many practical decision problems where decision makers＇ preferences may be inconsistent and contradictory. In this paper, new methods for ordering and classifying multi-attribute objects by discordant collective preferences are suggested. These methods are based on the theory of multiset metric spaces. The proposed techniques are applied to ranking companies and a competitive selection of projects, which are estimated by several experts upon multiple qualitative criteria.     

多状态系统故障树的一种生成方法

介绍一种多状态系统故障树生成方法．首先对传统的可靠性框图方法加以改进,提出一种新的框图分析方法．然后在可靠性框图分析的基础上,依据判定表,自动生成故障树．本方法适合多状态系统可靠性分析     

赋权有向图中最小生成树问题的显式整数规划模型

就具有不对称权重的有向图中的最小生成树问题,本文首次建立了相应的显式整数规划模型,这一模型可以成功地运用整数规划软件包如Ｌｉｎｄｏ等求解。并进一步将这一模型推广到随机最小生成树问题,也即具有随机变量权重的有向图中的最小生成树问题,并设计了相应的求解算法,给出了数值例示。     

一种更优的精度控制故障树解算方法

本文针对安全分析方法中故障树解算问题提出了一种完全依赖于所要求精度的近似算法——精度取舍法。详细给出了近似求解顶事件概率值的两个截断条件。结论表明,它在同时兼顾精度与时间的要求方面优于别的算法。     

复杂网络中连通支配中心性的计算

分析了现实生活中对重要节点的需求背景,对连通的网络模型提出了一种新型中心性评价指标,连通支配中心性。该中心性利用网络连通支配集的"连通"和"支配"两大特性,通过循环构建点导出支配子图的连通支配集,生成一棵支配关系扩展有向树。然后基于各节点在该有向树中的支配层次数,支配数和支配边权值3方面的属性,设计了反映节点支配能力强弱的中心性计算公式。最后以合作关系图为例进行相应实验,发现连通支配中心性比较高的节点不仅构成了网络的骨干网,能较好地维持网络基本形态,而且能桥接几个不同研究分区,起到一定的中介作用,体现了网络中节点的组织控制能力。     

The runt test for multimodality

Single linkage clusters on a set of points are the maximal connected sets in a graph constructed by connecting all points closer than a given threshold distance. The complete set of single linkage clusters is obtained from all the graphs constructed using different threshold distances. The set of clusters forms a hierarchical tree, in which each non-singleton cluster divides into two or more subclusters; the runt size for each single linkage cluster is the number of points in its smallest subcluster. The maximum runt size over all single linkage clusters is our proposed test statistic for assessing multimodality. We give significance levels of the test for two null hypotheses, and consider its power against some bimodal alternatives. Research partially supported by NSF Grant No. DMS-8617919.     

The complexity of reconstructing trees from qualitative characters and subtrees

In taxonomy and other branches of classification it is useful to know when tree-like classifications on overlapping sets of labels can be consistently combined into a parent tree. This paper considers the computation complexity of this problem. Recognizing when a consistent parent tree exists is shown to be intractable (NP-complete) for sets of unrooted trees, even when each tree in the set classifies just four labels. Consequently determining the compatibility of qualitative characters and partial binary characters is, in general, also NP-complete. However for sets of rooted trees an algorithm is described which constructs the “strict consensus tree” of all consistent parent trees (when they exist) in polynomial time. The related question of recognizing when a set of subtrees uniquely defines a parent tree is also considered, and a simple necessary and sufficient condition is described for rooted trees. This work was supproted by the Alexander von Humoldt-Stiftung. I wish to thank Andreas Dress, Hans-Jürgen Bandelt and the referees for their helpful comments.