光纤位移传感器在喷油器针阀升程测量中的应用

传统的柴油机喷油器针阀升程测量方式多为接触式.文中提出运用光纤位移传感器进行喷油器针阀升程的测量,重点介绍了光纤位移传感器的原理、测量系统的组成、检测电路的特点等.实践表明,光纤位移传感器在喷油器针阀升程测量中的运用,实现了非接触测量,测量精度大大提高.     

差动式电涡流位移传感器

设计了差动式精密电涡流位移传感器.通过对参数的合理选择与优化,测量电路尽量采用线性集成元件,较好地解决了一般载频调幅式电涡流位移传感器线性范围小、线性度差、时漂和温漂大的缺点,能够满足在10kHz的动态范围内,对高速转轴在复杂环境温度条件下,进行长期精确的位移和振动监测的需要.     

遥感数据处理任务调度的Petri网模型及求解算法

为了对多源遥感数据的处理任务进行有效的调度和管理,提高处理资源的利用率,根据遥感数据处理任务调度问题的特点,采用Petri网对该问题进行形式化描述,建立了遥感数据处理任务调度的数学模型,根据该问题的多目标特性,采用蚁群算法进行求解.给出仿真实例,将蚁群算法的求解结果与启发式算法和模拟退火算法的求解结果进行比较,验证算法...     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

科学工作流技术研究综述

科学工作流管理系统(Scientific Workflow Management Systems,SWfMS)为科学家提供一个管理大规模复杂科学计算的有效平台,通过管理复杂应用程序对海量科学数据进行管理、分析、仿真和可视化以帮助科学家进行科学发现.本文首先对科学工作流(Scientific Workflow,SWF)...     

基于非合作博弈的栅栏信息覆盖虚拟节点组合算法

邻近节点通过协作感知和信息融合组成虚拟节点,能够增加信息覆盖栅栏长度.基于非合作博弈模型,设计了一种完全分布式的虚拟节点组合算法DVSF算法.DVSF算法面向栅栏信息覆盖应用,以尽量增加整个网络的信息覆盖栅栏长度为目标,将合适的邻近节点组合成虚拟节点,提升了整个网络的栅栏信息覆盖性能.仿真实验验证了DVSF算法的有效性...     

三种实时误差配准算法性能分析与比较

对雷达组网中现有的三种实时误差配准算法即扩维扩展卡尔曼滤波算法(Augmented State Extended Kalman Filter)、解耦卡尔曼滤波算法(decoupled Kalman Filter)和准确算法(Exact method)进行了介绍与分析,并通过蒙特卡罗仿真试验从算法估计的均方根误差、估计的...     

基于逆向分层的工作流时间-费用优化方法

针对效用网格下基于优先级因子的工作流时间-费用优化问题,基于工作流的同步完成特征对任务进行分层并提出三种实时调度算法:基于逆向分层的sufferage(BLSuff)、基于逆向分层的min-min(BLMin)及基于逆向分层的min-max(BLMax)。算法设计基于优先级因子的衡量标准对时间与费用同时进行优化,并为任务设置期望完成时间以达到充分利用费用优化空间进行费用优化的目标。实验结果表明这三种算法在各种优先级因子下都能对工作流的执行时间与执行费用进行较好的优化。     

基于ADAMS的某重机枪复杂载荷施加方法研究

以某重机枪虚拟样机动力学模型的枪膛合力与气室压力的施加为例,设置一个与位移相关的传感器(Sensor)来实现通过位移控制外力施加的时机,并通过一个附加因子成功解决了以复进开始时为初始状态的自动机运动过程中的载荷施加。同时对该机枪三连发和四连发情况进行了仿真与分析,证明该方法可行有效。