加权Fourier变换及其统计性质

提出了零均值平稳序列的加权Ｆｏｕｒｉｅｒ变换,讨论了其统计性质,给出了其数学期望与方差的收敛速度．     

加工复杂曲面的三阶切触原理

本文把微分几何中曲线与曲面之间的“切触”概念应用于复杂曲面的数控加工,提出用圆柱铣刀或圆锥盘铣刀的外圆在五坐标联动中加工三维自由曲面的最佳切触条件。     

正扰动下一类RN上临界增长的椭圆型方程的正解的存在性

本文讨论了如下方程:并得到了它的正解的存在性,其中g(x,U)为U~(P-1)的低阶扰动。它是文[1]的继续。     

When are observed failures more informative than observed survivals?

A framework involving independent competing risks permits observing failures due to a specific cause and failures due to a competing cause, which constitute survival times from the cause of primary interest. Is observing more failures more informative than observing survivals? Intuitively, due to the definitiveness of failures, the answer seems to be the former. However, it has been shown before that this intuition holds when estimating the mean but not the failure rate of the exponential model with a gamma prior distribution for the failure rate. In this article, we address this question at a more general level. We show that for a certain class of distributions failures can be more informative than survivals for prediction of life length and vice versa for some others. We also show that for a large class of lifetime models, failure is less informative than survival for estimating the proportional hazards parameter with gamma, Jeffreys, and uniform priors. We further show that, for this class of lifetime models, on average, failure is more informative than survival for parameter estimation and for prediction. These results imply that the inferential purpose and properties of the lifetime distribution are germane for conducting life tests. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Multinational counterinsurgency: the Western intervention in the Boxer Rebellion 1900–1901

This article proposes a case study of the multinational counterinsurgency operations that occurred in China during the Boxer Rebellion in 1900–1, to provide a better understanding of the political and military dynamics specific to this type of mission. The study focuses primarily on the nature of the cooperation on the ground, the various national approaches to counterinsurgency, and the asymmetry of strategic approach between the Westerners and the Chinese. A discussion is also proposed, highlighting that combined counterinsurgency is not per se an obstacle to the unity of command, but that politically international coalitions create unique challenges to counterinsurgency operations.     

基于Q-MMSPF的海杂波多重分形互相关分析和目标检测

提出一种研究长程互相关和多重分形的新方法——Q阶混合矩结构分割函数法(Q-MMSPF),并利用Q-MMSPF分析了海杂波时间序列的多重分形互相关特征。通过对实测海杂波数据的计算分析发现,海杂波互相关多重分形特征较弱,目标信号之间的互相关多重分形特征明显,而目标信号与海杂波之间的互相关多重分形程度介于二者之间。据此,本文采用一种新的特征值进行海杂波背景下的目标检测。通过对不同条件下的实测海杂波数据验证,表明使用本文提出的特征值测量方法可以十分有效地检测出海杂波背景下的小弱目标。     

基于凸优化理论的三维微分对策制导规律求解

针对三维微分对策制导律(DGL)求解问题,引入凸优化理论,将DGL求解归结到Hamilton系统的求解,设计了DGL求解算法,通过对代价函数梯度特征的凸分析,推导出对策系统鞍点存在的充要条件和求解方法,解决了以往通过对微分对策模型简化求解导致的模型不能客观反映作战过程的问题.     

Optimal pricing and scheduling control of product shipping

In this article, we seek to understand how a capacity‐constrained seller optimally prices and schedules product shipping to customers who are heterogeneous on willingness to pay (WTP) and willingness to wait (WTW). The capacity‐constrained seller does not observe each customer's WTP and WTW and knows only the aggregate distributions of WTP and WTW. The seller's problem is modeled as an M/M/N_s queueing model with multiclass customers and multidimensional information screening. We contribute to the literature by providing an optimal and efficient algorithm. Furthermore, we numerically find that customers with a larger waiting cost enjoys a higher scheduling priority, but customers with higher valuation do not necessarily get a higher scheduling priority. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 215–227, 2015     

基于凸-改进遗传算法的圆阵列方向图联合优化

针对圆形阵列方向图具有较高旁瓣的问题,提出一种新的基于凸优化和改进遗传算法的优化方法。该方法首先采用遗传算法将阵元位置和阵元权值作为优化变量,以最小化波束方向图峰值旁瓣为目标函数进行联合优化,既增加了变量的自由度,又符合理论意义上的全局寻优;同时,为了避免算法的早熟收敛,对基本遗传算法进行了必要的改进。然后采用凸优化方法对阵元权值进行二次优化可进一步降低旁瓣电平,与传统方法相比能够明显提高优化效果的稳定性。仿真数据证实了该方法的有效性和正确性。     

基于网络组织有序度的指挥体系优化算法

针对信息化条件下指挥体系结构的特点,运用复杂网络理论,提出了指挥体系的优化算法,将组织有序度最大化作为目标函数,以边的关键度作为调节变量,构建了优化模型和算法,并对指挥网络进行了实例分析,对比优化前后指挥体系在平均路径、聚类系数、度分布以及网络的抗毁性等指标上变化,最后得到最优化的指挥网络。该算法对指挥流程的优化具有一定的参考价值和指导意义。