CCOS边缘效应的小研抛盘修形修正方法

计算机控制光学表面技术(Computer Controlled Optical Surfacing,CCOS)是加工离轴非球面的一项重要技术。小磨头抛光的边缘效应严重制约CCOS技术的加工精度和加工效率。在获得影响边缘效应的关键参数后,结合残余误差等高线的路径规划,对CCOS产生的边缘效应产生的翘边现象进行修正;通过对一块体育场形离轴非球面的加工,获得了全口径光学测量数据,为后续精加工提供面形基础。     

可控电磁引信的设计及其与坦克磁场相互作用的数值分析

以磁引信炸雷探测并攻击坦克等铁磁目标为应用背景,在对坦克磁场特征进行分析的基础上,设计了一种针对目标磁信号强弱可以灵活调控灵敏度的磁引信,分析该引信的可控载流线圈与坦克磁场的相互作用,计算出引信线圈在坦克磁场中所受到的偏转力矩,并对该力矩在三维空间中的分布情况进行了模拟,根据数值计算结果提出了提高探测灵敏度的基本方案,为后续试验研制该类新型磁引信及“磁隐身”坦克提供参考。     

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

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

基于对比度最优的VCO调频非线性误差估计与校正方法

针对VCO调频非线性误差的准确估计与校正问题,提出一种以一维距离像对比度最优为准则的自适应估计与校正方法。本方法建立引入温度变量的VCO频率特性模型,并据此估计出某一温度值对应的调频非线性误差,在对中频回波进行误差补偿和一维脉压后,以一维距离像的对比度最优作为迭代收敛准则,实现调频非线性误差的最优估计与校正。仿真和实测数据结果表明,该方法充分考虑了温度因素对VCO输出频率的影响,能够在不增加硬件复杂度的前提下,通过算法实现对调频非线性误差的估计、跟踪与补偿。与传统基于硬件电路进行估计或校正的方法相比,新方法无需由硬件组成闭环估计通道,且具有实时性强、运算量小、补偿精度高的优点,对于克服实际工程应用中VCO器件的参数漂移问题具有重要指导意义。     

回转对称非球面光学零件磁流变成形抛光的驻留时间算法

介绍了一种基于代数算法的回转对称非球面计算机控制表面成形的驻留时间算法。该算法将驻留时间转化为工件自转的整数圈数,并且将抛光模对工件的材料去除效率体现到材料去除矩阵上进行计算。利用非负最小二乘法求解驻留时间向量。最后,利用该算法在自研的磁流变抛光实验装置上对一回转对称光学零件进行3次迭代加工,使其面形精度从8μm提高到0.5μm以内。     

引信遥控装定方法研究

在现有无线电引信装定技术基础上 ,提出了一种新型引信遥控装定方法 ,并对装定方案的几个主要部分进行了理论分析和研究 .遥控装定技术对提高引信的抗干扰能力和提高弹药的毁伤概率具有重要意义 .     

引入电流变化率的电源分布网络最差噪声分析算法

随着时钟频率的增加以及电源电压的降低,电源完整性问题日益凸显。将电流变化率加入到最差噪声算法的电流约束中,能够在任意电流变化率的情况下分析电源分布网络的最差噪声,从而获得更加真实的最差噪声。另外,利用改进的Knuth-Yao四边形不等式法对基于动态规划的最差噪声算法进行加速,加速后算法的时间复杂度从O(n~2m)降为O(mnlogn)。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

电控喷油器控制柱塞偶件高压变形与泄漏分析

为准确选取柱塞偶件的间隙,简述了喷油器柱塞偶件间隙要求,分析了高压油压泄漏的影响因素,给出了柱塞偶件的受力和泄漏的数学模型,采用ANSYS仿真软件对某柴油机电控喷油器柱塞偶件进行变形分析,对比不同条件下的柱塞的变形量和配合间隙变化,并根据变形量计算出对应的泄漏量。以变形量和泄漏量为衡量指标,给出合理间隙的柱塞偶件方案。     

Contractual agreements for coordination and vendor‐managed delivery under explicit transportation considerations

We consider the coordination problem between a vendor and a buyer operating under generalized replenishment costs that include fixed costs as well as stepwise freight costs. We study the stochastic demand, single‐period setting where the buyer must decide on the order quantity to satisfy random demand for a single item with a short product life cycle. The full order for the cycle is placed before the cycle begins and no additional orders are accepted by the vendor. Due to the nonrecurring nature of the problem, the vendor's replenishment quantity is determined by the buyer's order quantity. Consequently, by using an appropriate pricing schedule to influence the buyer's ordering behavior, there is an opportunity for the vendor to achieve substantial savings from transportation expenses, which are represented in the generalized replenishment cost function. For the problem of interest, we prove that the vendor's expected profit is not increasing in buyer's order quantity. Therefore, unlike the earlier work in the area, it is not necessarily profitable for the vendor to encourage larger order quantities. Using this nontraditional result, we demonstrate that the concept of economies of scale may or may not work by identifying the cases where the vendor can increase his/her profits either by increasing or decreasing the buyer's order quantity. We prove useful properties of the expected profit functions in the centralized and decentralized models of the problem, and we utilize these properties to develop alternative incentive schemes for win–win solutions. Our analysis allows us to quantify the value of coordination and, hence, to identify additional opportunities for the vendor to improve his/her profits by potentially turning a nonprofitable transaction into a profitable one through the use of an appropriate tariff schedule or a vendor‐managed delivery contract. We demonstrate that financial gain associated with these opportunities is truly tangible under a vendor‐managed delivery arrangement that potentially improves the centralized solution. Although we take the viewpoint of supply chain coordination and our goal is to provide insights about the effect of transportation considerations on the channel coordination objective and contractual agreements, the paper also contributes to the literature by analyzing and developing efficient approaches for solving the centralized problem with stepwise freight costs in the single‐period setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006