遥感数据用户需求融合处理技术

遥感数据是国家的基础性和战略性资源，在经济建设、国防建设、抢险救灾、生态环境保护等方面得到了广泛的应用，发挥着越来越重要的作用，各行各业对遥感数据的需求也越来越多。因此，如何提高对地观测资源的利用率，提高服务响应速度成为迫切需要解决的问题。采用自然语言处理技术，提出了一种用户需求融合处理方法，该方法可以有效地融合归并相同或者相似的用户需求，实现一图多用，引入需求预测和需求融合技术以提高需求融合效率，从而提高对地观测资源的利用率，达到事半功倍的效果。     

邻域灰度差加权的模糊C均值聚类图像分割算法

模糊C均值(FCM)算法用于灰度图像分割是一种非监督模糊聚类后再标定的过程,适合灰度图像中存在着模糊和不确定性的特点.但是这种算法没有考虑到样本空间中不同的样本点对分类的贡献不同,因此分割效果不理想.提出了邻域灰度差加权的模糊C均值聚类算法,实验结果表明,该算法不仅取得了很好的分割效果,而且加快了算法的收敛速度,从而满足了图像分割的有效性、实时性的要求.     

一种面向混合数据集可视化的高效数据转换技术

应用领域中存在大量多数据类型属性的混合数据集,但是,很多有效多变元可视化方法的适用范围都只局限于单一类型,对于混合数据集可视化效果不甚理想。针对包含数值及分类型属性的多元混合数据集,提出一种面向混合数据集可视化的数据转换技术,首先对每一数值型属性使用聚类技术进行分类化,然后应用对应分析算法量化所有分类型属性,最后将转换后的混合数据集使用经典的数值型可视化方法——星形坐标法进行展现,并且针对变元数量较多或分类型变元势较高的混合数据集,在数据转换过程中提出一套降势策略,减少参与计算的变元数量,提高计算效率。实验表明,该方法对混合数据集的可视化结果不仅易于理解,而且有利于用户发现其中的隐性知识,降势策略在提高内存及时间效率方面作用显著。     

基于蚁群算法的被动目标定位算法

通过对蚁群算法的研究,用蚁群算法成功解决了无源测向定位中消除虚假点,对真实交点进行正确聚类的难题.并通过Matlab 仿真实验证明了该算法的有效性.同时该算法具有目标关联确率高、计算速度快、鲁棒性强等优点.     

基于候选聚类的K调和均值算法(KHM-CC)

聚类分析是常见的数据分析技术。基于KHM的聚类分析是当前研究的热点。提出了基于候选聚类的KHM算法(KHM-CC),详细阐述了算法的设计过程。采用UCI的小样本(iris)数据集和大样本(Bag of Words)数据集对比了KHM-CC算法和禁忌搜索KHM算法(KHM-TS)和变邻域搜索KHM算法(KHM-VNS)的性能。实验结果表明,KHM-CC算法在处理iris数据集小样本数据集时,其性能和KHM-VNS算法基本接近,而优于KHM-TS算法。但是在处理Bag of Words大样本数据集时,性能优于KHM-VNS和KHM-TS算法,其聚类计算耗时明显缩短,证实KHM-CC算法在高维度数据集的处理上更具优势。     

Optimal job splitting on a multi‐slot machine with applications in the printing industry

In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

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个区域类别,分析其特点,提出动员建议。