基于蚁群算法的图像边缘检测研究

将蚁群算法应用于图像分割领域,提出了一种新的基于蚁群算法的图像边缘检测方法。详细阐述了蚁群算法与该方法的基本原理和具体实现过程。为了提高算法效率,进行两处改进,第一将蚂蚁初始位置由随机放置修改为放置在图像边缘附近,可取一图像灰度梯度阈值来实现,第二将信息激素强度和启发式引导函数值均定义为像素点灰度梯度值的函数。大量实验结果证明了该算法能有效地检测出图像边缘,而且具有适应性强、效率高等特点。     

采用PageRank和节点聚类系数的标签传播重叠社区发现算法

基于标签传播的社区发现算法可以检测出复杂网络的重叠社区结构,因此提出了一种基于PageRank和节点聚类系数的重叠社区发现算法。该算法使用PageRank算法对节点的影响力进行排序,可以稳定社区发现结果,节点的聚类系数是一个与节点相关的值,使用节点聚类系数修改算法的参数并限制每个节点拥有最多标签的数量值,可以提高社区挖掘的质量。在人工网络和真实世界的网络上测试,实验验证了该算法能够有效地检测出重叠社区,并具有可接受的时间效率和算法复杂度。     

备件保障效能动态评估方法

针对目前效能评估方法多重视效能指标的静态观测值,对时序状态数据所蕴含的趋势信息关注较少的缺点,提出基于灰色聚类-粗糙集和集对分析的备件保障效能动态评估方法。针对主客观赋权方法各自的优缺点,引入依赖度和重要度的概念,建立灰色聚类-粗糙集组合赋权模型;将指标权重引入集对理论,提出集对同势、均势和反势的定义,描述备件保障效能的变化规律,构建基于马尔可夫链的集对分析动态模型。实例分析结果表明,该方法可以有效反映备件保障效能的动态变化特征,为决策者制定备件保障长期计划提供科学依据。     

一种新的高分辨率SAR图像目标自动鉴别方法

目标鉴别是SAR图像目标识别系统的关键环节,用以消除预筛选阶段因异常检测产生的大量虚假的感兴趣区域切片。针对目标鉴别问题,提出了一种新的目标自动鉴别方法,首先对CFAR检测的结果做基于面积特征的预鉴别处理,而后对获得的ROI目标切片提取鉴别特征,并在特征分析的基础上设定特征判决阈值,实现序贯鉴别处理。利用X波段SAR图像数据检验了上述方法,给出了鉴别输出的ROI切片。     

LRE试车数据挖掘中基于最大散度差的模糊聚类分析方法

在对液体火箭发动机试车数据进行聚类分析时,为解决故障数据样本与正常样本类间差异不大的问题,引入最大散度差准则,提出基于最大散度差的聚类算法MSD-CA.该算法以散度度量样本间的相似性,使样本的类内散度最小化和类间散度最大化同时进行.在此基础上,应用模糊理论对最大散度差准则进行模糊化,提出基于最大散度差的模糊聚类算法MS...     

Efficient algorithms for flexible job shop scheduling with parallel machines

Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 .     

Complexity and workload considerations in product mix decisions under the theory of constraints

The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015     

区域物资动员潜力的多元统计分析

为分析不同区域物资动员潜力差异,并对其进行分类,从总体实力和产值结构两方面出发,建立了区域物资动员潜力指标体系。以我国行政区域为研究样本,通过SPSS18软件,结合年度统计数据进行分析。采用主成分分析法对方案层指标进行简化,将形成的综合得分标准化并分析主成分上的载荷,然后采用层次分析法得到总体实力得分。再将研究对象按照总体实力与产值结构进行ward聚类分析,得到6个区域类别,分析其特点,提出动员建议。     

基于雷达网拓扑特征的雷达目标编群算法

为有效评估战场电磁态势和实施雷达网对抗,研究雷达目标编群算法十分必要。提出了一种基于拓扑特征分析的雷达目标编群算法,在分析雷达网拓扑结构及其特征基础上,利用拓扑特征实现雷达目标群的建立和更新,完成雷达目标编群。仿真实例表明算法具有可行性和有效性,为电磁态势评估和雷达网对抗奠定了基础。     

基于网格的聚类挖掘算法

为了提高海量数据挖掘效率,研究了一种基于网格环境下的分布式聚类（Prejudge-Based Distributed Clus-tering,PBDC）算法,并引入距离、模和内积的概念,在聚类之前进行预判断,减少了不必要的计算开销。在此基础上提出了一种分布式并行化聚类（Distributed Parallel Clustering,DPC）算法,将其嵌入到Weka4ws中,以开源数据挖掘类库Weka为底层支持环境,构建网格环境下的分布式数据挖掘体系,同时进行仿真实验。实验结果表明：该算法对于网格环境下海量数据的分布式聚类具有良好的效果。