潜艇对机动目标跟踪和攻击若干问题的探讨

在现代作战条件下,潜艇所要跟踪和攻击的目标多数情况下应认为是机动目标。限于潜艇所载目标探测传感器和武器特点,以及潜艇自身隐蔽性、机动性方面的约束,潜艇跟踪和攻击机动目标存在许多困难和值得研究的问题。对这些问题进行了较为系统地梳理,并对其中的若干问题进行了探讨,包括目标机动的原因、机动目标可判断性问题、机动判断手段、机动判断后目标参数的处理、机动目标攻击的基本原则和方法等,还对潜艇指控系统强化机动目标跟踪和攻击功能提出了一些建议。     

对军队国有企业产权界定的思考

军队选择部分企业进行现代企业制度试点,将国有企业改组为多元投资主体的“公司制”企业,必须进行产权界定,公平、合理地确定军队注入企业的资本金。应依据《国有资产产权界定和产权纠纷处理暂行办法》进行产权界定,对资产进行认定和价值重估,对债权债务进行清查和重新认定,以认定和价值重估后的实际资产扣除债务后的净资产或净权益,确定国家资本金数量,作为军队投资主体在“公司制”企业中的投资份额。     

目前军人保险制度存在的主要问题及原因

目前军人保险制度存在着目标定位模糊、制度形态异化、军地衔接不畅和发展后劲不足等诸多问题。导致上述问题的主要原因在于,对军人职业风险界定不清、相关主体职能缺位、互助共济机制缺失,以及在具体技术设计上有偏差。     

搞好重要经济目标防护应注重把握的几个问题

重要经济目标作为对国计民生和战争潜力具有重大影响的经济单元,在社会生活和国防动员中占有举足轻重的地位。随着现代战争对国民经济依赖程度的加深,运用多种手段打击敌国的重要经济目标,从而削弱其支持战争的能力和潜力,已经成为信息化条件下局部战争的一种重要样式。因此,搞好重要经济目标防护,保持国民经济动员潜力,就成为一个十分重要的问题。一、科学选定重要经济目标选定重要经济目标,就是在国防工程防护部署时,对敌人可能重点打击的目标做出判断和选择,为制定防护目标和部署人防力量提供依据。这种判断和选择源自于对外部与内部诸因…     

基于量子遗传算法的火力分配

在使用遗传算法求解多目标的防空火力问题中,遗传算法的参数选择直接影响分配结果好坏,且分配结果差异性大。针对这种问题,根据防空火力和空中目标的特点建立相应的数学模型,结合量子遗传算法来解决多目标火力分配难题。数据仿真结果表明,量子遗传算法在解决多目标火力分配问题中有较强的可行性和有效性,火力分配结果与遗传算法相比在最优解与稳定性上均有所提升。     

防空目标分配中雷达遮蔽区问题研究

目标分配是防空指挥控制的主要任务,而目标相对于防空导弹火力单元的遮蔽判断是目标分配必须考虑的重要因素。分析了目标遮蔽区的判断条件,推导出目标在遮蔽区飞行时间的计算方法,提出了一种快速表示遮蔽区域图的离散处理方法,并研究了考虑目标遮蔽区影响的目标分配问题。通过实例计算,验证了目标遮蔽计算判断和分配方法的合理性,研究结果对实时指挥控制有应用价值。     

目标选择优化模型及算法

提出了可用于大威力武器火力分配的目标选择优化模型及算法。内容包括：问题的数学描述、问题的等价变换与分解、问题求解的动态规划算法和不同算法的计算次数比较。     

用改革的观念认识新事物

非公有制经济的发展会不会削弱公有制经济的主体地位?现实社会中存在的收入差距悬殊会不会导致两极分化?经济生活中存在的剥削现象会不会影响我们走社会主义道路?这些问题涉及的领域一是生产资料所有制问题,一是分配的收入问题。这两方面的问题,都是过去我们常说的经典社会主义含义的两项核心的内容。列宁不是说,社会主义等于公有制加按劳分配吗?为什么在关于什么是社会主义的两个核心内容上产生认识问题呢?主要原因是,在我国改革开放的过程中,在建设有中国特色的社会主义过程     

火灾现场询问笔录系统的开发

火灾现场询问是火灾调查工作中认定起火原因的重要手段和方法,火灾现场询问笔录的质量对起火原因认定的准确性及工作效率有很大影响.介绍了火灾现场询问笔录系统的设计实现及主要功能.应用该系统,能够帮助火灾调查人员根据不同类型的火灾、询问对象等提出适当的问题,保证询问的及时性、准确性以及针对性,有效地提高火灾现场询问的工作效率.     

理顺分配关系 防止收入悬殊

改革开放20多年来,我国居民收入分配的格局发生了根本变化,传统体制下平均主义的分配模式已基本破除。通过不断完善按劳分配为主体、多种分配方式并存的分配制度,实现了一部分人先富起来,同时人民群众的整体收入水平也在持续提高,并且社会对个人收入的再分配功能不断增强。与此同时,随着我国居民收入分配格局的变化,居民收入中的差距也在不断扩大,收入悬殊已成为社会普遍关注的热点问题之一。对此,十六大报告明确提出,要“理     

基于D-S证据理论的机载雷达模糊识别方法

针对机载雷达信号的复杂性和模糊性等特点,提出一种D-S(登普斯特-谢弗)证据理论和模糊理论组合应用的方法用于对机载雷达的识别。通过对信号的积累和对信任度(模糊隶属度)的重新分配,有效地解决了机载雷达信号的不确定性问题以及如何利用信号在时间上的冗余信息问题,提高了信号的正确识别率。仿真实验和正确识别率的统计结果验证了这种方法十分有效。     

基于行为复合机制的结构化图形动画技术的研究与实践

在各类计算机动画中 ,角色动画可满足实时性及交互性的需要 ,其核心技术在于角色的建模技术。该文主要介绍了作者所研制的角色动画制作系统———“网动王 98” (简称Net_Anim系统 )中所采用的角色建模机制及其相关技术 ,内容包括 :角色的对象模型及其运行机制 ;角色复合行为的实现算法及相关的关键问题 ;应用示例 :Net_Anim系统的特色和有待进一步研究和解决的相关问题。     

刑事行为纵横论

具有自然人、人文、社会和人格意义的行为是行为人人格的主观现实化和个体的客观社会化存在。在主体行为的基本概念之上 ,刑事意义上的行为作排列组合的联络 :即规范行为、危害行为和责任行为 ;构成要件符合性、违法性和有责性 ;程序事实、犯罪事实和刑事处罚。从而形成行为本体到规范论定到价值评价的刑事本体渐进和事、罪、责的刑事具体落实。在三纵三横的格局里 ,刑事行为一体化终至成立。     

航母舰载机对空防御作战出航保障指挥决策建模

基于Agent的航母舰载机对空防御作战出航保障指挥决策系统,由数据部分和Agent组织部分组成.前者又含数据库、模型库、知识库、相关管理系统和MIS.后者包括五大决策Agent,通过界面Agent与用户进行交互,而与数据部分的交互则由DB监理Agent统一完成.对于系统内决策Agent的设计,可首先针对五大决策Agent的模板进行设计,再对其功能层进行实例化.     

Strategic investment to reduce setup times in the economic lot scheduling problem

This article considers the Economic Lot Scheduling Problem where setup times and costs can be reduced by an initial investment that is amortized over time. The objective is to determine a multiple-item single facility cyclic schedule to minimize the long run average holding and setup costs plus the amortized investment. We develop a lower bound on the long run average inventory carrying and setup costs as a function of the setup times, and show that this lower bound is increasing concave on the setup times when the out-of-pocket setup costs are zero or proportional to the setup times. We then develop a model that may be helpful in deciding the magnitude and the distribution of a one-time investment in reducing the setup times when the investment is amortized over time. Numerical results based on randomly generated problems, and on Bomberger's ten item problem indicate that significant overall savings are possible for highly utilized facilities. Most of the savings are due to a significant reduction in the long run average holding cost. © 1995 John Wiley & Sons, Inc.     

基于模糊匈牙利算法的炮兵火力单位分配问题

发挥诸火力单位的整体协调优势,寻求在给定约束条件下总的射击效果最好的分配方案,是火力单位最优分配的基本任务.匈牙利算法是求解传统的指派问题的一种较好的方法,运用模糊匈牙利算法在决策过程中将主观因素与客观因素有机地结合起来,解决火力单位分配方案决策中多指标指派问题,从而可以有效地解决炮兵火力单位分配最优化问题.     

A penalty for concave minimization derived from the tuy cutting plane

A wide variety of optimization problems have been approached with branch-and-bound methodology, most notably integer programming and continuous nonconvex programming. Penalty calculations provide a means to reduce the number of subproblems solved during the branch-and-bound search. We develop a new penalty based on the Tuy cutting plane for the nonconvex problem of globally minimizing a concave function over linear constraints and continuous variables. Computational testing with a branch-and-bound algorithm for concave minimization indicates that, for the problems solved, the penalty reduces solution time by a factor ranging from 1.2 to 7.2. © 1994 John Wiley & Sons, Inc.     

Rendezvous search when marks are left at the starting points

Leaving marks at the starting points in a rendezvous search problem may provide the players with important information. Many of the standard rendezvous search problems are investigated under this new framework which we call markstart rendezvous search. Somewhat surprisingly, the relative difficulties of analysing problems in the two scenarios differ from problem to problem. Symmetric rendezvous on the line seems to be more tractable in the new setting whereas asymmetric rendezvous on the line when the initial distance is chosen by means of a convex distribution appears easier to analyse in the original setting. Results are also obtained for markstart rendezvous on complete graphs and on the line when the players' initial distance is given by an unknown probability distribution. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 722–731, 2001     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Local search techniques for the generalized resource constrained project scheduling problem

In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110-problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non-continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley & Sons, Inc.