基于单片机的弹药仓库通风系统设计

针对温湿度对弹药储存的影响,介绍了通风降湿的重要性及其原理,并在现有地面仓库结构的基础上,设计了一套根据库内外湿度的变化,以及预定降湿条件自动进行通风降湿的系统,并对系统的结构原理和软件进行了分析设计。     

弹药供应站配置地域选定辅助决策模型

建立了用于评估弹药供应站配置地域的指标体系, 利用层次分析法对各个指标进行了权重分配, 得到了弹药供应站配置方案的择优方法, 并运用模型进行了模拟决策。本模型已经在计算机上编程实现。     

一种用于ESD测试的PLC单轴运动控制台研究

研制了一种以可编程控制器 (PLC) 作为控制单元的单轴控制台。这种单轴控制台有效控制了静电放电(ESD) 模拟器空气放电电极的运动状态, 为ESD测试实验提供了一种新的手段, 并与手持放电方式进行了实验比较。     

红外图像中海天线的提取

针对海空背景红外图像中海天线的提取问题,利用直线检测的思想,提出了Hough变换方法.仿真实验表明,Hough变换具有较好的抗背景干扰的能力,可很好地解决强背景干扰下海天线的提取问题.     

一种基于区域标记的虹膜内边缘定位新算法

提出了一种新颖简单的虹膜内边缘(瞳孔)定位算法.首先,采用Soble边缘检测算子和形态学变换进行边缘检测;然后,利用区域标记法为边缘检测后形成的各连通成分赋予相应的灰度值,并利用直方图的方法分离出瞳孔区域;最后,采用投影的方法进行瞳孔的定位.实验结果表明,文中提出的方法能够准确地进行虹膜内边缘定位.     

偏心桶式磁流变传动装置在未屈服区的特性研究

提出一种新型磁流变传动装置———偏心桶式磁流变传动装置,在一定假设的基础上,建立了这种传动装置在未屈服区的传递力矩理论计算模型,比较其与同心桶式磁流变传动装置的传递力矩,并利用有限元分析软件ANSYS对同心桶式及偏心桶式磁流变传动装置在未屈服区的液流情况进行了仿真分析。     

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

基于测试码并行的同步时序电路故障模拟方法

将组合电路故障模拟的一些加速技术推广到时序电路故障模拟中,提出并实现了一个功能块级的基于测试码并行的同步时序电路故障模拟方法,对部分ISCAS89 Benchmark电路的模拟结果表明,该故障模拟方法有较好的性能.     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.