直瞄武器综合修正量测试技术

目前我军采用的通过多发实弹射击弹着点确定综合修正量的方法存在浪费弹药、校正过程烦琐等缺点。针对该问题,探讨采用陀螺仪测量火炮跳角从而确定综合修正量的方法。上述方案的实施,将很大程度上节约弹药,提高校炮效率,加快装备形成战斗力速度。     

A componentwise index of service measurement in multi‐component systems

In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

面向射频指纹识别的高效IQ卷积网络结构

现有应用于射频指纹识别的卷积网络对时序同相正交(in-phase and quadrature-phase,IQ)信号的处理都是将其简单视为图像进行的,存在识别准确率低和计算量大的问题。针对以上问题,提出了一种基于IQ相关特征的卷积神经网络结构。该网络分步提取了IQ相关特征及时域特征,通过自适应平均池化获得了各通道特征均值,并用单个全连接层进行分类。实验结果表明,较传统卷积网络结构,所提网络在多种场景下的识别准确率更高,并且计算量更小。     

复杂背景条件下的红外图像末制导技术

通过结合目标红外特征,研究了空-空弹在复杂背景条件下的目标红外成像末制导的技术原理和实施途径。对复杂地背景的辐射特征和主要空中攻击目标军用喷气战机的目标红外辐射源类型作了分析,研究了红外目标特征的提取方法和算法。     

基于"姿态矩阵"量测的机载导弹传递对准技术

"速度+姿态"量测匹配方案是目前比较理想的机载导弹传递对准技术.采用"姿态"量测时存在矩阵计算量大等缺点,在具体工程应用时更会受到计算机速度的限制,尤其是需要快速进行卡尔曼滤波计算时.引入了一种与"姿态"量测具有相同特点的"姿态矩阵"量测方案,设计了快速对准卡尔曼滤波器,并进行了仿真分析.结果表明是一种具有工程意义的实用快速传递对准技术.     

The continuous‐time single‐sourcing problem with capacity expansion opportunities

This paper develops a new model for allocating demand from retailers (or customers) to a set of production/storage facilities. A producer manufactures a product in multiple production facilities, and faces demand from a set of retailers. The objective is to decide which of the production facilities should satisfy each retailer's demand, in order minimize total production, inventory holding, and assignment costs (where the latter may include, for instance, variable production costs and transportation costs). Demand occurs continuously in time at a deterministic rate at each retailer, while each production facility faces fixed‐charge production costs and linear holding costs. We first consider an uncapacitated model, which we generalize to allow for production or storage capacities. We then explore situations with capacity expansion opportunities. Our solution approach employs a column generation procedure, as well as greedy and local improvement heuristic approaches. A broad class of randomly generated test problems demonstrates that these heuristics find high quality solutions for this large‐scale cross‐facility planning problem using a modest amount of computation time. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Analysis and optimal design of discrete order picking technologies along a line

Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dominating sets for rectilinear center location problems with polyhedral barriers

In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016