延迟容忍无线传感器网络动态数据传输

分析现有经典延迟容忍移动无线传感器网络DTMSN(Delay Tolerant Mobile Sensor Networks)数据收集算法.提出了一种基于选择复制的动态数据传输策略ASRAD(Advanced Selective Replication based Adaptive Data Delivery Scheme).其基本思想是把数据消息动态的复制给更有可能与汇聚点通信的传感器节点以达到尽量增大传输成功率和降低传输能耗的目的.ASRAD由数据传输和队列管理两个主要部分组成.     

AFM探针针尖曲率半径显微测量方法

探针针尖曲率半径是影响原子力显微镜分析与观测精度的关键要素之一,微小光学零件采用的精密测量技术不适于分析非透明探针针尖曲率半径。以高分辨率扫描电子显微镜图像为分析对象,采用灰质化、滤波降噪等图像预处理和Canny边缘检测技术获取针尖轮廓,对轮廓坐标采样后利用非线性高阶多项式函数拟合轮廓曲线,根据扫描电镜图像的度量标尺换算得到针尖实际曲率半径。结果表明：该方法对AFM探针针尖曲率半径的测量偏差不超过15％,具有较高测试精度和广泛应用前景。     

WDM—PONs系统中AMOOFDM信号的多信道传输研究

为了提高波分复用无源光网络信道的传输能力,提出了自适应调制光正交频分复用的多信道传输方法．首先,在单模光纤连接上采用直接调制激光器和直接检测技术,给出了传输系统的模型;其次,给出了波分复用信道比特位加载算法;最后,用实例分析了40（或80）km直接调制与检测单模光纤连接系统及传统单一调制系统的传输性能．结果表明：自适应调制信号传输能力得到提高,同时最佳动态光发射功率范围和削峰比范围分别提高5dB和3dB．     

低成本微小型无人机航姿测量系统设计

根据微小型无人机航姿测量需求,利用MEMS传感器设计了一种低成本的航姿测量系统．针对低成本MEMS陀螺仪本身漂移较大、容易发散、无法完成较长时间较高精度测量的特点,提出一种实时性强、计算量小的信息融合方法．利用地球重力场、地磁场2个参考向量,采用互补滤波对不同传感器的数据进行融合,实现提高该航姿测量系统测量精度的目的．实验结果表明,该航姿测量系统的更新速率达到450Hz,姿态角测量误差〈1°,航向角测量误差〈2°,能够满足微小型无人机航向和姿态测量需求．     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Balancing perfectly periodic service schedules: An application from recycling and waste management

A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck‐hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP‐hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real‐world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160–171, 2012     

Determining crane areas for balancing workload among interfering and noninterfering cranes

This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un‐)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross‐over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

采用故障树的数据链系统故障模式

根据数据链系统的故障检测困难的特点,采用故障树分析法,建立了数据链系统的故障树;在详细分析数据链系统故障特点的基础上,提出了端口功能检测法、调制解调器替代法和电性能参数检测法3种故障定位方法。设计了端口功能检测法中数据测试仪、终端设备模拟器和自环测试监测仪的系统连接方法,设计了调制解调器替代法的系统连接方法和电性能参数检测法的常见电性能参数。综合使用故障检测定位方法,可快速定位数据链系统常见故障。     

改进的组网雷达目标跟踪数据关联算法

基于高逼真多假目标干扰在组网雷达进行数据处理时可能会极大地增加中心站的计算量,降低数据关联正确率,提出一种改进的双门限快速数据关联算法,利用无源侦察设备所测的目标属性参数与空间状态参数的联合统计距离,对有源雷达与无源侦察装备协同的数据关联进行改良。通过仿真比较得出改进算法不仅可以对目标成功地进行跟踪,降低目标位置均方根误差,而且运算时间要比传统的JPDA大为缩短,验证了算法的有效性。     

基于候选聚类的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算法在高维度数据集的处理上更具优势。