火炮射表数据处理数学模型

本文在分析总结国内外火炮射表数据处理方法的基础上,提出了广义最小二乘逼近准则和建立在这一准则基础上的广义多项式射表逼近模型。文中详细推导了广义二乘逼近公式系、广义正规方程组系数阵、常数阵的计算方法、广义正规方程组的解法及有关问题的扩展等,所有问题均给出了严格的数学描述。理论分析和计算结果表明,本文提出的模型速度快、精度高、适应面广,是一种先进的射表数据处理方法。     

灰色逼近理想解排序法在目标威胁评估中的应用

针对空袭目标的威胁判断问题,分析了空袭目标威胁评判的准则;据此给出了影响目标威胁的主要因素.并给出了主要因素的隶属函数.在此基础上,结合灰色关联度和逼近理想解排序法,用灰色关联度替代逼近理想解排序法中传统的距离,给出了灰色逼近理想解排序法模型;最后,将模型运用于空袭目标威胁排序中,以实例证实此方法的科学性与可行性.     

比例规则后件的T-S模糊模型辨识方法

模糊划分应满足测量准则,这一点常被忽略。采用余弦平方函数作为隶属函数,解决了曲线型隶属函数在模糊化分后满足测量准则问题。T-S模糊模型后件由线性函数构成,以局部线性化方式实现全局非线性,通过分段性逼近辨识曲线,常用于系统辨识中,但其辨识参数多是其主要问题。比例规则后件的T-S模糊系统具有万能逼近特性,且构成参数少,用于非线性系统的辨识中,可以减少辨识参数,提高辨识速度。给出其在系统辨识中应用的方法,并通过仿真实例说明本方法的有效性。     

卫星通信抗干扰的方法与系统设计

本文在分析卫星通信干扰威胁的基础上,讨论了利用扩频信号处理(包括直接序列扩频和跳频)、自适应天线调零以及星上处理等技术,以有效地改善干扰威胁情况下的通信可靠性。最后,提出了抗干扰系统设计最佳化的若干准则,并研究了实现逼近最佳准则的技术途径。     

NORX算法中非线性组件的移位参数选取准则研究

NORX算法是进入凯撒竞赛第三轮的15个认证加密候选算法之一,该算法的唯一非线性组件由异或、与和移位操作组成。从非线性逼近和循环分析两个密码学性质研究移位参数的选取准则,证明了可变移位函数的非线性逼近概率为三值函数,并得到了移位参数取1时具有最佳的非线性逼近性质;给出了可变移位函数的循环概率表达式,并证明了对于任意非零的移位参数其最大循环概率均相同。由上述分析结果可知,NORX算法中非线性组件的移位参数取1时达到了最佳的非线性逼近和循环性质。该结果可应用于NORX算法的安全性分析中,同时也能为设计类似算法提供理论指导。     

火炮射表数据处理中几个有关问题的讨论

本文是文献的继续,主要研究射表数据处理中的几个技术问题。其中包括:自变量、逼近多项式的结构、项数和逼近精度的选择问题,以及广义正规方程组的解法、选项中的异常现象和贼点剔除问题等。它们是正确和有效进行射表数据处理的重要因素,是必须很好解决的问题。     

参数化滤波器逼近问题的全局最优算法

基于Lipschitz下界估值和分枝定界技术,给出了一维参数化小波滤波器逼近问题的全局最优算法。由于充分利用了滤波器逼近问题的特点,本方法将原来的Lipschitz算法的线性收敛速率提高为二次收敛速率。     

移动式C3I机动路线选择多准则决策折衷对话算法

提出非劣路径和满意路径的概念,给出准则网络图满意路径问题的数学模型,利用多准则决策理论和方法,通过构造辅助问题,研究辅助问题和非劣路径的关系,设计出多准则网络图的交互式满意路径算法。     

过椭圆外一定点作其法线的计算机实现

对过椭圆外一定点的法线作图问题给出了一种计算机实现的几何逼近方法。该方法以几何迭代逼近作图原理为基础,建立了新的逼近法线方程,从而避免了手工作图的低精度及实际操作时的繁琐,使过椭圆外一定点的法线作图问题得以在计算机上迅速获得解决,且可达到足够的精度要求。     

面向能力需求的武器装备组合规划模型与算法

针对武器装备组合规划中存在的选择难、规划难问题,在给定能力需求的条件下,从分析装备的组合变更对整体体系的影响出发,考虑了总的经费预算、年度费用分配、装备规划周期等约束,以能力差距和发展风险最小为准则,构建了双目标优化模型,并设计了基于差分进化和非支配排序的遗传算法的求解算法,获得模型的Pareto解。通过逼近理想解排序法方法从所求Pareto解中求得令决策者满意的折中解。通过一个具体示例验证了模型和算法的有效性,能够为武器装备组合规划提供辅助决策。     

Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach

In this paper, we develop an iterative piecewise linear approximation approach with a novel initialization method to solve natural gas pipeline transmission problems with the nonuniform network elevation. Previous approaches, such as energy minimization methods, cannot be applied to solve problems with the nonuniform network elevation because they exclude pressure range constraints, and thus provide solutions far from optimum. We propose a new initialization model that considers pressure range constraints and improves the optimality of the solutions and the computational efficiency. Furthermore, we extend the energy minimization methods and provide the necessary conditions under which the extended methods operate in networks with the nonuniform elevation. We test the performances of the methods with previously reported pipeline networks from the literature, with the open data set GasLib, and with our industrial collaborator. The initialization approach is shown to be more efficient than the method with fixed initial breakpoints. The newly proposed initialization approach generates solutions with a higher accuracy than the extended energy minimization methods, especially in large‐size networks. The proposed method has been applied to natural gas transmission planning by the China National Petroleum Corporation and has brought a direct profit increase of 330 million U.S. dollars in 2015‐2017.     

A branch-and-bound algorithm for solving fixed charge problems

Numerous procedures have been suggested for solving fixed charge problems. Among these are branch-and-bound methods, cutting plane methods, and vertex ranking methods. In all of these previous approaches, the procedure depends heavily on the continuous costs to terminate the search for the optimal solution. In this paper, we present a new branch-and-bound algorithm that calculates bounds separately on the sum of fixed costs and on the continuous objective value. Computational experience is shown for various standard test problems as well as for randomly generated problems. These test results are compared to previous procedures as well as to a mixed integer code. These comparisons appear promising.     

An approximate solution method for the fixed charge problem

In the absence, to date, of an exact method for solving the linear programming problem with fixed charges, two heuristic methods have been proposed and extensively investigated, computationally, for moderate sized problems. The results indicate that the heuristic methods produce optimal solutions in well over 90 percent of the several hundred problems investigated and very close to optimal (a few percent) in the remaining cases. Hence it should be of practical significance to practitioners in the field.     

大型复杂装甲装备首批生产质量规律研究

针对装甲装备在生产中暴露出质量问题的统计数据,运用数理统计方法及MATLAB软件对故障数量、故障类型分别进行了数值分析,探索了大型复杂装甲装备首批生产质量形成规律,验证了缩短装备达到质量稳定期的措施。认为,统计得出的置信区间可以作为评价产品质量的重要标准,同时要采取过程控制等措施确保质量。要在批量生产前期检查产品质量,尽早暴露设计、生产中的问题。     

嵌入式质子交换光波导偏振器的制作及高消光比检测装置的研究

用钛内扩散和质子交换相结合的方法制得了光波导偏振器,这一偏振器由在不连续的扩钛波导中嵌入一段质子交换波导形成。本文讨论了一些资料中报道的检测方法,并对测量集成光波导偏振器提出了一个新方案。该方案测得的偏振器消光比大于52．5dB．     

弹道跟踪数据处理中的几个计算问题

结合弹道跟踪数据建模和数据处理的实践 ,提出了几个有典型应用价值的测量数据模型 ,在应用这些数学模型解决实际问题时 ,涉及统计、优化、函数逼近等几方面的理论和计算问题。这些问题和模型的研究 ,对解决许多相关的实际问题有重要意义。     

铜片腐蚀试验结果评价的数字图像处理方法

传统铜片腐蚀结果评定方法存在着一定的局限性与不足,基于数字图像处理的HIS彩色模型,开发了铜片腐蚀试验结果评价软件。评价结果表明,两种试验结果评价方法有很好的一致性,该方法解决了传统试验结果评价中存在的一些问题。     

舰艇箔条质心干扰对抗多威胁目标方法

摘 要：在未来海战中,水面舰艇将面临多枚导弹攻击的威胁,传统的箔条质心干扰发射决策方法无法有效干扰来袭的多枚导弹;在分析传统箔条质心干扰成功条件的基础上,建立了箔条质心干扰对抗多目标成功判断模型,通过仿真计算,提出了箔条质心干扰对抗多威胁目标方法;可充分发挥现役无源干扰装备的作战潜能,提高海军水面舰艇的生存能力。     

分层教学法在消防院校英语教学中的运用——以昆明消防指挥学校为例

由于生源的特殊性,消防院校学员英语水平差异明显,给英语教学带来了很大挑战.为提升英语教学的有效性及实用性,以适应消防部队建设发展对优秀消防指挥人才的需求,结合学员的实际情况,对英语课程进行了分层教学模式改革.基于英语课程分层教学模式改革的实践经验,对英语分层教学模式的实施,分层教学的有效性及存在的问题进行了探讨.     

Discrete stochastic optimization using variants of the stochastic ruler method

We present two random search methods for solving discrete stochastic optimization problems. Both of these methods are variants of the stochastic ruler algorithm. They differ from our earlier modification of the stochastic ruler algorithm in that they use different approaches for estimating the optimal solution. Our new methods are guaranteed to converge almost surely to the set of global optimal solutions under mild conditions. We discuss under what conditions these new methods are expected to converge faster than the modified stochastic ruler algorithm. We also discuss how these methods can be used for solving discrete optimization problems when the values of the objective function are estimated using either transient or steady‐state simulation. Finally, we present numerical results that compare the performance of our new methods with that of the modified stochastic ruler algorithm when applied to solve buffer allocation problems. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.