Electronic warfare in the optical band: Main features,examples and selected measurement data

The paper presents the possibilities of, and methods for, acquiring, analysing and processing optical signals in order to recognise, identify and counteract threats on the contemporary battleground. The main ways electronic warfare is waged in the optical band of the electromagnetic wave spectrum have been formulated, including the acquisition of optical emitter signatures, as well as ultraviolet (UV) and thermal (IR) signatures. The physical parameters and values describing the emission of laser radiation are discussed, including their importance in terms of creating optical signatures. Moreover, it has been shown that in the transformation of optical signals into signatures, only their spectral and temporal parameters can be applied. This was confirmed in experimental part of the paper, which includes our own measurements of spectral and temporal emission characteristics for three types of binocular laser rangefinders. It has been further shown that through simple registration and quick analysis involving comparison of emission time parameters in the case of UV signatures in “solar-blind” band, various events can be identified quickly and faultlessly. The same is true for IR signatures, where the amplitudes of the recorded signal for several wavelengths are compared. This was confirmed experimentally for UV signatures by registering and then analyzing signals from several events during military exercises at a training ground, namely Rocket Propelled Grenade (RPG) launches and explosions after hitting targets, trinitrotoluene (TNT) explosions, firing armour-piercing, fin-stabilised, discarding sabots (APFSDS) or high explosive (HE) projectiles. The final section describes a proposed model database of emitters, created as a result of analysing and transforming the recorded signals into optical signatures.     

自然场景车标数据集的构建及其应用

车标作为车辆身份的关键特征之一,在车辆的监控与辨识中发挥着重要作用。由于自然场景复杂多变,对其中的车标进行准确识别仍具有很大的挑战性。目前公开数据库很少且存在诸多局限,导致研究缺乏可信度和实用性。本文建立了一个面向自然场景的全新数据集,包含多种采集环境下的10 324幅、67类车辆图像。基于此数据集开展应用研究,提出一个目标检测与深度学习相结合的车标识别方法,包括车标区域定位和车标种类预测两大步骤。实验表明,该方法对复杂背景有较强的适应性,在涉及30种车标的分类任务中达到89.0%的总体识别率。     

轮式车辆半主动悬架建模与仿真

通过实际采样获得路面离散高程序列,在频域内对路面高程进行分析,获得了路面功率谱密度曲线,并作为仿真路面输入。对轮式车辆悬架系统进行线性化分析,并建立了车辆二自由度1/4车主动控制模型。采用线性二次型经典最优控制理论(LQR)对模型进行控制,应用M atlab软件进行仿真分析,结果显示了控制策略的有效性及模型的准确性。     

The impact of manufacturer rebates on supply chain profits

Manufacturer rebates are commonly used as price discount tools for attracting end customers. In this study, we consider a two‐stage supply chain with a manufacturer and a retailer, where a single seasonal product faces uncertain and price‐sensitive demand. We characterize the impact of a manufacturer rebate on the expected profits of both the manufacturer and the retailer. We show that unless all of the customers claim the rebate, the rebate always benefits the manufacturer. Our results thus imply that “mail‐in rebates,” where some customers end up not claiming the rebate, particularly when the size of the rebate is relatively small, always benefit the manufacturer. On the other hand, an “instant rebate,” such as the one offered in the automotive industry where every customer redeems the rebate on the spot when he/she purchases a car, does not necessarily benefit the manufacturer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A branch‐and‐price algorithm for a targeting problem

In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于乘波构形的跨大气层飞行器气动布局

利用乘波构形具有升阻比大的特点,将其作为滑翔跳跃式跨大气层飞行器的基准外形进行研究,提出了乘波构形的设计方法,详细分析了各设计参数对乘波构形的影响,研究了不同马赫数、不同优化目标下得到的乘波体的性能,得到了升阻比大、容积效率高的跨大气层飞行器气动布局,所得结论对跨大气层飞行器气动布局和乘波体外形的研究具有一定的参考价值。     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Modeling and analyzing multiple station baggage screening security system performance

In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于LabVIEW的变速箱状态检测系统

采用门限关联度理论进行变速箱状态检测,并构建了以虚拟仪器为核心的变速箱状态采集系统,建立了表征变速箱状态的特征参量和正常故障判定准则,采用LabVIEW开发了检测与故障判定软件系统。