自航式鱼雷发射装置发射管长度优化研究

基于某型鱼雷自航发射的内弹道数学模型,选择自航管的总长度作为优化目标,讨论了约束函数的取值,确定了优化问题的数学表达.采用惩罚函数法进行寻优计算,针对约束函数具有不可微和非线性的特点,采用模式搜索算法进行了无约束优化的求解,给出了优化结果并进行了比较.     

基于多信息的柴油机缸套磨损故障诊断研究

采用了模糊神经网络模型,对柴油机缸套磨损故障以及缸套破坏性磨损故障进行了诊断研究.通过缸套磨损故障的模拟实验,获取柴油机机身振动和铁谱分析等多源多维故障信息,并对融合故障信息进行预处理,解决了模糊神经网络输入矢量的模糊特性化、输出矢量的隶属函数及网络的学习训练问题,对缸套不同磨损故障进行了诊断.研究表明,这种基于多信息的诊断方法减小了故障诊断的不确定性,提高了诊断精度.     

基于满意决策的多UAV协同目标分配方法

目标分配是UAV自主控制的重要问题。提出了基于满意决策的多UAV协同的目标分配技术,为解决多UAV协同的目标分配问题和多机场起飞的UAV编队配置问题提供了一种新颖而有效的方法。重点对其中的满意集计算、联合满意度、拒绝度和选择度的建立和计算等关键问题进行了讨论。以压制敌防空火力任务为背景对该方法进行了仿真,并将本文提出的方法和其他方法做了比较,仿真结果表明基于满意决策的多UAV协同的目标分配方法在效率上有明显优势。     

电子对抗系统中雷达情报综合技术研究

雷达情报综合是电子对抗系统数据处理中的重要环节,它可以有效地消除虚假和重复雷达。结合雷达信号出现的规律和雷达参数分布特点,讨论了雷达信号合批技术,给出了一种合批方法。该方法可以快速高效地对各类辐射源型号识别、定位的结果进行综合处理,实际应用结果表明该方法是有效的。     

态势生成中一种非线性运动模型的建立

探讨了在信息融合仿真试验床的态势生成部分,建立飞行实体运动模型的方法;通过保留运动学方程,简化动力学方程的方法,给出了一种常见的机动飞行方式(俯冲爬升类运动)的运动模型的计算公式;并对这种运动模型的非线性和机动性进行了分析和讨论;通过仿真,比较了几种机动目标跟踪算法对该运动模型的跟踪效果,验证了该方法的有效性。     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

论唯物史观的价值内涵

马克思的唯物史观作为一种理解与把握社会历史本质、社会历史现象的根本方法,既包含着对社会历史发展的客观必然性的理解,具有科学性的特征,也包含着人类社会自身的价值取向,贯穿着一定的价值理想与价值追求。     

非局部薄板动力学特性分析的广义有限积分变换方法

基于应力梯度非局部薄板理论模型,推导了非局部薄板动力学特性求解的广义有限积分变换方法.通过选取适应边界条件的积分核函数并构建广义积分变换对,应用积分变换将非局部薄板的高阶偏微分方程变换成线性方程组,直接求解得到固有频率.将广义有限积分变换方法的计算结果和有限元法及已有文献的结果进行对比,验证了本文方法的正确性.在此基础...     

“趣”的美学内涵特征及内在网络系统

“趣”是我国古代文论的一个核心范畴,其美学内涵可概括为是在人的心理上产生强烈趋向性的,必然伴随心理愉悦的,对人的自身本质力量审美观照的一类具有非实体性特征的系统性美质;“趣”的审美特征主要包括主客观统一性、生命的自由与灵慧性、虚实相生性及强烈的心理趋向性;“趣”作为古文论范畴,涵纳了一百多种以“趣”的基本语义为立足点的审美语汇,构建出了一个庞大的内在网络系统。