Replacing continuous demand with discrete demand in a competitive location model

Location models commonly represent demand as discrete points rather than as continuously spread over an area. This modeling technique introduces inaccuracies to the objective function and consequently to the optimal location solution. In this article this inaccuracy is investigated by the study of a particular competitive facility location problem. First, the location problem is formulated over a continuous demand area. The optimal location for a new facility that optimizes the objective function is obtained. This optimal location solution is then compared with the optimal location obtained for a discrete set of demand points. Second, a simple approximation approach to the continuous demand formulation is proposed. The location problem can be solved by using the discrete demand algorithm while significantly reducing the inaccuracies. This way the simplicity of the discrete approach is combined with the approximated accuracy of the continuous-demand location solution. Extensive analysis and computations of the test problem are reported. It is recommended that this approximation approach be considered for implementation in other location models. © 1997 John Wiley & Sons, Inc.     

Discretization of the continuous ambush game

This article further considers the two‐person continuous ambush game introduced by Ruckle. This article extends the work of Ruckle, Baston and Bostock, and Lee by considering the game for a general number of barriers. By supplanting optimal strategies from a discretized version of the game, we show that there always exists a value for the game, which, furthermore, can be found using linear programming techniques. Further to this, we show that the discrete ambush game considered by Garnaev has the same value as a continuous game, allowing many new results to be obtained in both games. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 515–529, 2003     

A general approach to the shape of failure rate and MRL functions

Failure rate and mean residual life are two important characteristics for studying reliability of products. In literature, some work studied the shape of failure rate function based on the knowledge of the associated probability density function; some other work investigated the shape of mean residual life function based on the shape of the associated failure rate function separately for continuous case and discrete case. In this article, a general approach is developed which can be applied to the aforementioned studies. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Relation between continuous and discrete time markovian decision problems

An associated discrete (continuous) time Markovian decision problem for any given continuous (discrete) time Markovian decision model is formulated. A relationship between the continuous and associated discrete time discounted returns is obtained. This result is used to show the existence of a deterministic stationary policy that optimizes both discounted return functions. It is also proved that the same policy optimizes the average expected return for both continuous and the associated discrete time processes. The results obtained in this paper can be used to solve the continuous time Markovian decision problem by using the discrete time algorithms or vice versa.     

经典 f 、g 级数的修正法

文中对开普勒轨道方程中的经典f、g 级数进行修正,使其适用于考虑主要带谐项的摄动情形,克服了f、g 级数仅用于开普勒轨道短弧段的限制。公式的推导借助计算机完成。使用此方法所得结果与使用数值积分方法所得结果比较:该方法速度快、精度高、可直接得到连续的状态。该方法简洁有效,在航天导航和制导领域具有很大实用价值。     

炮兵C3I系统诸弹道模型的建立与分析

各级炮兵C3I系统、火控系统等决定射击诸元所采用的弹道数学模型比较多,每一种模型都有其产生的历史背景、适用的场合、优点和不足.就目前各系统所采用的"射表法"、"射表拟合法"、"弹道诸元解析法"、"弹丸运动微分方程"等数学模型、解算方法进行了分析、对比,给出了各种模型和方法的优点、缺点及其适用场合.对系统设计、快速准确地求解射击诸元和偏差修正具有指导意义.     

区域防空反导火控网的数据融合问题研究

由于组成区域防空反导火控网的各部光电瞄具之间是异步工作的,造成跟踪参数融合上出现较大误差,为此,提出一种解决异步数据融合问题的方法,并进行了计算机仿真,结果证明该方法可以有效完成火控系统参数融合问题。     

What you should know about location modeling

Facility location models have been applied to problems in the public and private sectors for years. In this article, the author first presents a taxonomy of location problems based on the underlying space in which the problem is embedded. The article illustrates problems from each part of the taxonomy with an emphasis on discrete location problems. Selected recent research in the area is also discussed. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

关于舰炮对岸校正诸元计算的研究

首次就舰炮对岸校正诸元的计算进行研究并建立数学模型,按此模型可正确解算舰炮对岸射击诸元,对从事舰炮火控系统研制人员具有参考价值。     

Optimal source placement for point coverage in active multistatic sonar networks

The allocation of underwater sensors for tracking, localization, and surveillance purposes is a fundamental problem in anti-submarine warfare. Inexpensive passive receivers have been heavily utilized in recent years; however, modern submarines are increasingly quiet and difficult to detect with receivers alone. Recently, the idea of deploying noncollocated sources and receivers has emerged as a promising alternative to purely passive sensor fields and to traditional sonar fields composed of collocated sources and receivers. Such a multistatic sonar network carries a number of advantages, but it also brings increased system complexity resulting from its unusual coverage patterns. In this work, we study the problem of optimally positioning active multistatic sonar sources for a point coverage application where all receivers and points of interest are fixed and stationary. Using a definite range sensor model, we formulate exact methods and approximation algorithms for this problem and compare these algorithms via computational experiments. We also examine the performance of these algorithms on a discrete approximation of a continuous area coverage problem and find that they offer a significant improvement over two types of random sensor deployment.     

坦克观瞄系统的坐标体系

目前我国主战坦克的观瞄系统使用的是建立在单一炮塔坐标下的数据处理方式,基于这种数据处理方式的火控系统,在跟踪机动目标时的模型误差成为系统作战的主要误差,已经无法满足现代作战对打击机动目标的要求.对正在发展的目标跟踪式观瞄系统定义了一套新的坐标系统,以及目标运动参数在各坐标系之间转换的变换矩阵,提出了在这种坐标系统基础上对目标运动参数的处理方法,并指出这种数据处理方式将是高速、机动目标建模的基础,在未来的数字火控方式中有极大的使用前景.     

Concave envelopes of monomial functions over rectangles

The construction of convex and concave envelopes of real‐valued functions has been of interest in mathematical programming for over 3 decades. Much of this interest stems from the fact that convex and concave envelopes can play important roles in algorithms for solving various discrete and continuous global optimization problems. In this article, we use a simplicial subdivision tool to present and validate the formula for the concave envelope of a monomial function over a rectangle. Potential algorithmic applications of this formula are briefly indicated. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

一种正交解调超宽带接收系统幅相误差实时校正方法

在分析了影响正交解调结构超宽带接收系统性能的幅相误差来源的基础上 ,针对超宽带系统的特点 ,提出了用 2PFIR滤波器对整个系统幅相误差进行实时校正的方案 ,随后推导出设计复系数 2PFIR滤波器的算法 ,并给出仿真结果     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016     

舰炮一维弹道修正弹射击误差分离和校正研究

由于工作原理不同,传统无控弹射击校正方法不适用于一维弹道修正弹。分析了舰炮使用一维弹道修正弹射击误差构成和射击观测特点,提出一维弹道修正弹射击校正新方法,首先通过修正机构不工作,利用观测弹着点相对预测弹着点偏差平均值校正火控设备预测弹着点误差;然后利用修正弹正常工作时观测弹着点相对目标（或提前点）偏差平均值校正修正机构误差。假设各误差值,通过解弹道方程仿真计算表明,按新方法射击校正能够显著提高射击精度。     

Novell网络环境下分布式文件系统的设计与实现

在局部网络环境下实现分布式文件系统和远程过程调用是实现高层分布式软件的基础。本文在分析Netware层次结构的基础上,给出了一个在网络层上的分布式文件系统和远程过程调用的设计与实现,详细讨论了该系统的功能、用户界面和实现中的技术问题,包括可靠性和并发控制等必须解决的问题。本文的工作是为在Novell网上实现分布式数据库而设计的。     

非标准气象条件弹道自动修正的研究

针对某强击机瞄准具轰炸性能改进装置,介绍非标准气象条件下弹道修正原理工作式的建立、修正电路的设计及其与瞄准具的交联关系     

Optimal lot sizing and inspection policy for an EMQ model with imperfect inspections

An EMQ model with a production process subject to random deterioration is considered. The process can be monitored through inspections, and both the lot size and the inspection schedule are subject to control. The “in-control” periods are assumed to be generally distributed and the inspections are imperfect, i.e., the true state of the process is not necessarily revealed through an inspection. The objective is the joint determination of the lot size and the inspection schedule, minimizing the long-run expected average cost per unit time. Both discrete and continuous cases are examined. A dynamic programming formulation is considered in the case where the inspections can be performed only at discrete times, which is typical for the parts industry. In the continuous case, an optimum inspection schedule is obtained for a given production time and given number of inspections by solving a nonlinear programming problem. A two-dimensional search procedure can be used to find the optimal policy. In the exponential case, the structure of the optimal inspection policy is established using Lagrange's method, and it is shown that the optimal inspection times can be found by solving a nonlinear equation. Numerical studies indicate that the optimal policy performs much better than the optimal policy with periodic inspections considered previously in the literature. The case of perfect inspections is discussed, and an extension of the results obtained previously in the literature is presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 165–186, 1998     

高分辨率UAV SAR的三维运动误差分离与补偿

在基于SAR回波的数据处理中,多普勒调频率具有很高的估计精度且对场景的依赖性很小,可以更广泛地用于自聚焦处理。基于多普勒调频率参数估计,针对回波包络及相位分别提出了误差提取模型,并通过包络误差校正和相位误差补偿两个步骤实现了高精度的运动补偿处理。实测数据表明,本文方法可以在低精度导航信息情况下获取高分辨率雷达图像。     

Continuous-time markov duels: Theory and application

This article extends the previous research on Markov duels (stochastic duels between weapons with Markov-dependent fire) to situations in which the time between rounds fired by each duelist is a continuous random variable that depends on the state of combat. Three starting conditions for the duels are considered: simultaneous detection, surprise by one duelist with continuous time detection by his opponent, and surprise with discrete time detection. The amount of surprise is treated as both a constant and a random variable. An application of these models to an evaluation of armored vehicles is described. The methods used to consider a variety of engagement ranges, tactical situations, and target types (both lethal and nonlethal) are discussed. The procedure for incorporating nonduel attrition into the analysis is described and the exchange rate (the expected number of enemy targets killed per armored vehicle killed) is derived.