Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

基于磁流变液的舰载机拦阻过程模糊PID控制

针对舰载机拦阻过程的运动特性分析,建立了舰载机拦阻缓冲过程的力学模型与状态方程,通过对基于磁流变阻尼拦阻缓冲过程的分析,引入了位移和速度矢量作为磁流变缓冲拦阻控制系统的输入,完成基于模糊控制的舰载机拦阻缓冲过程控制。应用模糊PID控制器非线性拟合能力来适应舰载机着舰情况变化,并仿真验证建立的磁流变缓冲拦阻模糊PID算法具有较好的预测精度和应用范围。     

The People’s Liberation Army and China’s Smart Power Quandary in Southeast Asia

Abstract

China has a strong interest in pursuing a smart power strategy towards Southeast Asia and has worked laboriously to engage with regional countries economically, socially, and politically. But China has been only partially successful in achieving its goals in the region. This paper argues that China’s security policy towards Southeast Asia significantly contradicts many other objectives that Beijing wishes to accomplish. Given the deep-seated, narrowly-defined national interests of the Chinese military in the South China Sea disputes, it is likely that the People’s Liberation Army (PLA) will continue to pose the main obstacle to the effective implementation of a Chinese smart strategy in Southeast Asia.     

基于多点空间直线拟合的调炮精度检测方法

针对火炮身管上标记两个点检测调炮精度受制于单个空间点坐标测量精度的问题,提出通过增加身管上标记点的冗余数量来提高调炮精度的检测方法。应用最小二乘原理对多个空间点进行直线拟合,并采用Monte Carlo方法对身管指向的测量精度进行分析。结果表明:标记4个点、5个点、6个点和7个点与标记2个点(传统方法)相比,其身管指向的测量精度分别提高了约6%、18%、19%和21%。该方法适用于对调炮精度检测要求较高的场合,综合考虑工作效率和测量精度这两个因素,推荐标记5个点测量身管指向。     

星载高速无线数据网络协议的设计

星载无线数据网络可以解除航天器内错综复杂的线缆网的束缚,是航天器轻小型化的重要技术储备。旨在替代航天器内现有的点对点三线制的低电压差分信号线缆,提出了一种基于脉冲超宽带(IRUWB)技术的星载高速无线数据网络的设计方案,并重点介绍了高速无线网络协议的设计和实现。网络协议设计参考了美国军用数据总线标准MIL-STD-1553B协议,采用时分制指令响应机制,按物理层、链路层、网络层和应用层进行了详细说明,以适应星载高速率无线数据传输的要求,具有灵活性高、可靠性高、扩展性高的特点。网络协议的IP核经过地面演示系统进行验证,实验测得应用层数据传输的误码率小于10-9。     

基于改进人工免疫算法的火力分配

随着现代武器杀伤力的极大提高,任何来袭目标的突防都可能造成极大的破坏,这对传统的火力分配提出了挑战。提出一种新的火力集中原则,在满足对来袭目标一定杀伤的前提下,适当转移火力,实现火力总的集中,据此建立了火力分配优化模型。通过改进人工免疫算法的抗体群,提高模型的求解速度,缩短方案的寻优时间。通过实例进行仿真,结果表明,基于改进人工免疫算法能较快速实现火力分配,算法具有一定的可行性。     

文献检索课教学改革对策研究

本文提出网络环境下文献检索培养目标,培养学生信息素养,提高信息评价能力。改革教学内容,编写适合本专业本校专业设置的教材,采用适于学校基本教学环境、教师的教学能力、学生的学习能力相对称的教学模式,应用多元化的教学方法,在教学过程中注重培养学生创新思维和综合实践能力,培养大学生的认知技能、批判性思维、创新精神和问题解决能力。     

网络化指挥控制系统同步特性分析

为解决指挥控制系统模型难以进行数值分析的问题,根据指挥控制过程OODA模型的周期循环特性定义了指挥节点动力学振子,应用捕捉复杂网络同步动力过程的Kuramoto模型描述了网络化指挥控制系统的同步行为特性,并分析了耦合强度与系统同步之间的关系.理论与数值分析表明:对于全连通的网络化指挥控制系统,当信息交互耦合强度超过阚值时系统能达到同步.     

连续时间参数滤波问题的非标准方法

本文应用非标准分析中的Ｎｅｌｓｏｎ近初等过程方法,得到了与标准的连续时间参数滤波问题等价的近初等过程的滤波公式,并由此得到了标准的连续时间参数情形地滤波公式．     

Optimal pricing for a short life‐cycle product when customer price‐sensitivity varies over time

Technology products often experience a life‐cycle demand pattern that resembles a diffusion process, with weak demand in the beginning and the end of the life cycle and high demand intensity in between. The customer price‐sensitivity also changes over the life cycle of the product. We study the prespecified pricing decision for a product that exhibits such demand characteristics. In particular, we determine the optimal set of discrete prices and the times to switch from one price to another, when a limited number of price changes are allowed. Our study shows that the optimal prices and switching times show interesting patterns that depend on the product's demand pattern and the change in the customers' price sensitivity over the life cycle of the product. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012