改进的精密三点法——在线测量直线度方法的再探讨

在原精密三点法的基础上,对插值方法进行了改进,对随机误差采用了相应的数据处理方法,使得分离结果更加接近真实值,并有效地去除了随机误差的影响,得到了采样值加密的曲线,文中给出了改进的精密三点法的算法和流程图。从仿真和实验结果来看,该方法是具有可行性和可靠性的。     

对通用数据链干扰效能评估及仿真

首先介绍了通用数据链(CDL)的技术特点,对CDL的干扰策略进行了讨论,分析了几种干扰样式的可行性。研究了脉冲干扰对CDL前向链路的BPSK扩频调制的干扰效能,对脉冲干扰下BPSK扩频调制的误码率及同步字差错率进行了计算。研究了宽带噪声干扰对CDL返向链路的OQPSK调制的干扰效能,对宽带噪声干扰下OQPSK调制的误码率进行了计算,最后分别进行了仿真分析。仿真结果显示,所研究的干扰样式在一定条件下对CDL通信链路能产生有效的干扰。     

New results on a stochastic duel game with each force consisting of heterogeneous units

Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force—knowing which units are still alive in real time—decides dynamically how to assign its fire, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two‐person zero‐sum game, but computing the optimal strategy remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

用紧支径向基函数传递固体域耦合数据的方法

针对热-电场耦合仿真计算中非匹配网格之间的数据插值问题,提出了一种基于紧支径向基函数点插值的数据传递方法。推导了数据传递矩阵,根据所提出的数据传递方法编制了非匹配网格之间数据传递计算程序,以若干组非匹配网格之间的温度插值为例进行了验证,并分析了不同参数对计算时间及精度的影响,结果表明,算法效率较高,计算误差较小,适用于以热-电场耦合为代表的固体域耦合非匹配网格间的数据传递计算。     

基于视景模拟的无人机导弹发射仿真

无人机单侧导弹发射后,无人机重量特性、重心位置、气动特性发生变化并同时产生附加的干扰力矩,无人机需要在控制系统作用下尽快恢复稳态飞行。通过在Matlab/Simulink中建立无人机六自由度非线性力学模型、控制系统模型、发动机模型、重力模型、标准大气模型、flight gear软件接口等,模拟仿真无人机单侧导弹发射过程,同时将仿真结果进行可视化视景输出,确保无人机系统平台在导弹发射过程中无人机能够很快恢复稳定姿态并按照预定轨迹飞行。视景模拟仿真结果表明：该无人机平台能够顺利完成导弹的安全发射。     

指挥信息系统安全防护系统视图

作为指挥信息系统安全可控运行的重要保障,网络安全防护体系目前存在着整体轮廓不清、顶层设计力度不够等问题。研究网络安全防护体系结构,可以增强安全体系综合集成,提高组件间的互操作性,有效解决网络安全防护的顶层设计问题。通过分析军事信息系统体系结构框架中系统视图模型的内容和相互逻辑关系,描述了支持网络防御作战的系统、系统功能及其相互关系,建立了系统视图的几种典型模型,为体系化建设网络安全防护体系提供了理论依据。     

基础阻抗对隔振效果的影响

经典隔振理论评价隔振效果常假定基础为绝对刚性,这在隔振效果评价和测量上带来了很大的问题,导致计算结果偏差很大.针对这一问题推导了柔性基础上的传递率计算公式,讨论了基础阻抗对隔振效果的影响.理论分析表明,柔性基础的基频和质量是影响隔振效果的最重要因素.     

基于最少谓词思想的可达路径选择

对于结构测试中的不可达路径问题,仅仅使用传统的不可达路径排除方法存在很大的限制性,应用效果一般.积极选择可达路径的思想可有效减少不可达路径的产生.目前,基于最少谓词思想的路径生成方法得到广泛的认可.了解可达路径选择思想后,主要介绍一种基于数据流信息的,具体应用基本程序切片技术来生成可达路径的方法,该方法可生成几乎有最少谓词的路径,有较好效果.     

A sequential dynamic pricing model and its applications

Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.