A Nonlinear Model of Military Expenditure Convergence: Evidence From Estar Nonlinear Unit Root Test

The paper builds a model to empirically test military expenditure convergence in a nonlinear set up. We assert that country A chooses a military strategy of catching up with the military expenditure of its rivals, subject to public spending constraints on public investments, including health and education, leading to decrease in long-term economic welfare. This implies nonlinear convergence path: only when the military expenditure gap between countries reaches the threshold level, will it provide incentives to catch up with rival’s military expenditures. We test this nonlinear catching up hypothesis for 37 countries spanning from 1988 to 2012. Results from individual nonlinear cross-sectionally augmented Dickey–Fuller (NCADF) regression indicate that 53% of countries converge to world’s average military expenditure: where 39% of countries converge to Germany; 33% of countries converge to China; 22% of countries converge to the USA, and 11% of countries converge to Russia. Interestingly, USA does not exhibit nonlinear military expenditure convergence toward world’s average level. For panel NCADF regression, the result suggests that on average, there is evidence for countries converging to USA’s military expenditure at 10% significance level. For the convergence to the world’s average, the statistical significance is at the 1% significance level.     

GNSS双接收机抗欺骗技术

欺骗干扰能使目标接收机得出错误的位置、时间结果,是GNSS应用安全性的一个严重威胁。提出一种利用两个接收机伪距测量值单差的抗欺骗方法,利用方差分析技术推导基于伪距单差的欺骗信号最优检测量,并分析检测量的统计特性。经分析,接收机噪声、接收机基线长度和卫星个数等参数对检测性能的影响较大;在接收机噪声和卫星个数未知的情况下,可以通过增大接收机基线长度来提高检测性能。仿真结果表明,当接收机间的基线长度为10 m时,0.01虚警概率下,欺骗信号的检测概率可达98%。     

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     

Timing of information acquisition in a competitive environment

This article investigates the impact of timing on sellers' information acquisition strategies in a duopoly setting. Market uncertainty is captured by a representative consumer who has a private taste for the product's horizontal attribute, and both sellers can acquire this information either before (ex‐ante acquisition) or after (ex‐post acquisition) observing their own product qualities. We identify several conflicting effects of information acquisition that vary significantly in its timing and market characteristics. In the monopoly scenario, information acquisition is unambiguously beneficial and ex‐ante acquisition is the dominant option, because it helps a seller not only design the proper product but also craft better pricing strategy. By contrast, when there is competition, information acquisition eliminates the buffer role of market uncertainty and leads to the fiercest production or pricing competition, which makes the subsequent effects of acquisition detrimental, and a seller's payoff is nonmonotonic in terms of its acquisition cost. Moreover, compared with the ex‐ante information acquisition, ex‐post information acquisition normally generates higher sellers' equilibrium payoffs by postponing the timing of acquisition and maintaining product differentiation. Nonetheless, ex‐post information acquisition also provides the seller with greater acquisition incentive and occasionally makes him worse off than that in the ex‐ante scenario. Thus, in a competitive environment, having the option of information acquisition and flexibility in its timing can be both detrimental and irresistible. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 3–22, 2016     

Nonlinear pricing with consumer satiation

In various scenarios, consumers may become satiated with products, and the degree of satiation is directly associated with their prior experiences. Confronted with consumer satiation, the seller is unable to either identify consumers who have a higher likelihood of being satiated ex ante or distinguish satiated from non‐satiated consumers ex post. Therefore, the seller should address dynamic selling, valuation uncertainty, and quantity decisions, all of which are important operational issues. We consider a two‐period problem in which consumer types are influenced by their prior consumption experiences. Faced with these consumers, the seller intends to optimize quantities and adjust the prices of the products in each period to maximize revenue. We find that the seller may reduce ex ante production quantity as some consumers become satiated. Moreover, the ex ante quantity is first decreasing and then increasing with regard to the satiation rate. Furthermore, two‐period information asymmetries may provide a rationale for upward distortion in quantity when consumer preferences are highly sensitive to first‐period consumption. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 386–400, 2016     

高校教育信息化建设问题及对策

高校信息化建设是高校建设的一项重要任务,我国高校信息化经过十几年基础设施建设后,现阶段仍然存在一些问题。总结分析现阶段教育信息化建设中存在的问题及解决策略,有助于高校教育信息化建设健康、有序发展。     

战场物资运输指挥控制的对偶分析

在战场的供求双方之间实施快速物资运输的指挥控制是作战指挥控制的一个重要组成部分,根据供求双方的物资供应量和需求量、运输路径的长度和运输工具的能力等参数,制订一个使物资总运载量以及耗费时间为最小的运输指挥控制计划是战场指挥员必须解决的关键问题.一种基于线性规划及对偶分析的战场物资运输的指挥控制方法为解决此类问题提供了一种可行途径.     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于博弈均衡分析的联合作战远程火力战法

用定量分析的方法开发远程火力战法是联合作战规划中必须解决的重要问题,借助仿真和博弈分析的混合方法,在对博弈效用函数计算的基础上,构建基于识别真目标、假目标以及火力命中目标概率的二人非零和(TPNZS)非合作博弈模型来开发远程火力战法,对一个典型的联合作战远程火力打击系统的初步研究表明:敌我双方的战法分别为π*=(0,π2*,1-π2*)=(0.000 0,0.674 1,0.325 9)和Δ*=(0.000 0,0.000 0,Δ3*)=(0.000 0,0.000 0,1.000 0)。     

捷联惯导初始对准中H_∞滤波器参数优化研究

对H∞滤波在捷联导航系统初始对准中的应用进行了研究。通过仿真和实验验证了滤波器在初始对准中的性能,并对如何设置参数进行了研究。结果表明,H∞滤波在参数选取合适的情况下方位角收敛速度比卡尔曼滤波快。当参数选取不合适的时候,H∞滤波会发散。虽然H∞滤波可能提高方位角收敛速度,但它自身的鲁棒性可能被削弱。因此,在实际系统中,必须选取合适的参数以保证滤波器的稳定性和初始对准的速度。实际使用过程中,先把参数设置为一个很小的值,再逐步调大以寻找临界值来获得最优的性能。