弹丸速度的数字化激光幕测试技术

针对传统弹丸速度测量方法的局限,提出一种新的弹丸速度测试技术——数字化激光幕结合互相关速度测量算法的测试技术,并给出了激光总体测速方案、测速原理以及互相关测速方法,经靶场试验验证测试效果良好。     

一类非线性问题的数值分析

利用Ｌａｐｌａｃｅ方程的基本解,将变系数非齐次Ｈｅｌｍｈｏｌｔｚ偏微分方程的边值问题化为积分方程问题。再用边界无法进行离散,并对区域结点及边界结点的方程耦合求解。文末算例表明本文方法能够达到较高精度。     

系统辨识在建立舰船电力推进动态模型中的应用

舰船电力推进是一个复杂的船—机—电系统。对其动态特性的研究,利用现有的基于理论分析建立机理模型的方法,就会遇到分析过程繁杂、模型适用性差的实际困难。本文则利用系统辨识方法建立舰船电力推进系统的动态模型,通过一个具体的船模实验及辨识计算,确定模型的结构和参数。为了克服相关噪声的影响,参数估计中采用了增广矩阵法。并对模型从拟合程度和收敛性两方面进行了检验,结果表明,上述方法所得到的动态模型是适用的。     

形象记忆在数学学习中的应用

根据高中数学知识特点及学习方法,在数学概念、公式、定理等的教学中利用形象记忆,有助于学生正确理解基本概念,掌握公式和定理,并且可以培养学生的学习兴趣,提高数学学习的能力。在数学教学中利用形象记忆,也要注意使用方法和范围。     

非线性边值问题的一种高精度计算模型

讨论非线性边值问题的一种高精度计算模型 .利用积分值将边值问题转化为形式初值问题 ,构造了一类四阶精度的计算格式 ,证明了收敛性 .通过算例表明该方法收敛速度高 ,计算量小 .     

密切值法用于海军舰船招标工程的评价

根据海军舰船招标工程涉及的各个方面 ,建立舰船招标工程评价指标体系 ,运用密切值法对海军舰船招标工程进行评价 ,为舰船招标工程评价提出新的方法     

舰船推进轴系设计方案的综合评估

探讨了将多目标决策理论应用于舰船推进轴系设计方案综合评估的方法 ,建立了推进轴系设计方案的多层次评估模型 ,讨论了基于层次分析法评估指标权值确定的矢量计算方法 ,给出了运用模糊隶属函数的底层典型定量指标的确定方法 .文中论述的方法对舰船推进轴系设计方案的科学评估决策具有实用价值     

有理真分式积分方法探析

利用配方法,待定系数法等方法求解有理真分式的积极分问题.     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001