磁通门探测器的数值分析与仿真

给出了磁通门探测器的数学模型及其数值分析和计算机仿真的方法,并通过实例计算和模拟探测器内部各种物理量的波形、量值和相互关系,解决了电压源激励和非正弦波激励在传统分析计算中存在的难题,最后针对第Ⅱ类磁芯进行了分析.     

非线性自适应统计滤波器在声测量信号处理中的应用

从α-stable分布特征出发,阐述了处理非高斯噪声的LMP、顺序统计、群组等非线性统计滤波器自适应算法;实例验算表明了在α-stable分布下,非线性统计自适应器性能优于传统的线性自适应滤波器,且收敛速度更快.     

流过泰氟隆烧蚀表面的化学非平衡粘性激波层数值研究

本文对有泰氟隆烧蚀的化学非平衡粘性激波层流场进行了数值模拟。应用空间推进与总体迭代相结合的求解方法，采用１９组元、２９种反应的空气—泰氟隆化学反应系统，对化学非平衡粘性激波层流场与泰氟隆壁面烧蚀传热过程进行耦合求解，研究了平衡催化壁和非催化壁条件对粘性激波层烧蚀流场的影响。     

通信时延对无人作战飞机NWL轰炸精度影响研究

无人作战飞机具有飞行器与指挥平台"空地分离"的技术特征,源自飞行员的战术决策指令须通过战术数据链传输给飞机,该特性在空地轰炸模式下将对系统作战效能产生一定的影响。建立了面向无人作战飞机的空地一体化机翼非水平(NWL,Non-Wing-Level)轰炸仿真模型,通过Monte-Carlo仿真表明脱靶量与数据链时延之间存在线性关系,采用Kalman滤波可以克服时延对脱靶量的影响,并提高命中精度。     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

Optimally scheduling interfering and non‐interfering cranes

This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail‐mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium‐sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.     

三维化学非平衡粘性激波层流场数值模拟

本文通过引进主流贴体坐标 ,将粘性激波层概念推广到三维流场 ,得到了三维粘性激波层方程 ;应用空间推进与总体迭代相结合的求解方法 ,对三维化学非平衡粘性激波层流场进行了数值模拟     

无信息先验下几种不同Bayes估计的比较

讨论了在二项分布场合关于成功率的不同无信息先验分布下的Bayes估计 ,并从Bayse风险的角度对它们进行了比较     

Mixed rules in multi‐issue allocation situations

Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.     

一种适用于点和区间混合型维度数据集的多维索引

点和区间混合型维度数据集是空间数据库系统和GIS中重要的数据对象.在分析SS树的基础上,提出了一种适用于索引点和区间混合型维度数据集的索引结构--PI树.PI树利用超球划分数据集的多维空间,以提高结点存储利用率,从而降低数据插入时的I/O次数.文章给出了PI树插入、删除和查询算法的形式化描述.理论分析和实验结果表明,所提的PI树性能上总体优于R·树.