基于北斗短报文的远海实时精密单点定位

针对远海精密导航与定位费用高昂的问题,提出利用北斗短报文传输多模全球导航卫星系统的实时服务数据,实现远海实时精密单点定位。为了降低通信成本和硬件成本,本研究对实时服务数据进行简化,弥补了北斗短报文带宽的不足;为了克服北斗短报文频率低的缺点,采取了实时精密星历预报的方法,来获取分钟间隔以外时刻的卫星轨道位置和钟差改正。对基于北斗短报文的远海实时精密单点定位的数据处理过程进行了仿真模拟。后期处理实测海洋观测数据,对定位性能进行测试,可实现水平方向厘米级定位,竖直方向精度为10~20 cm。该方法为低成本的远海实时定位提供了技术参考。     

A method to determine the shell layout scheme for equipment battlefield damage tests under artillery fire

In this paper,a new method for determining the shell layout scheme is proposed,which can make the equipment damage data by the battlefield damage test resemble as close as possible the actual combat data.This method is based on the analysis of the impact point distribution and effective damage area of equipment.In order to obtain the position of the impact points,an impact point distribution model under artillery fire was established.Similarly,in order to obtain the effective damage area of equipment,the concepts of generalized damage area and task-based equipment functional damage probability were demonstrated,and the corresponding calculation model was established.Through case analysis,the shell layout scheme was effectively obtained,verifying the correctness of the proposed method.     

Essentially Non-Oscillatory插值的分析与方法

在科学研究与工程计算中对插值的分析与方法理论已有很重要的应用,而对于ENO插值的方法与理论在大多教科书中却很少涉及,本文介绍ENO插值的应用及算法,为大学生们学习数值分析中的插值计算提供参考。     

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.     

On parallel machine replacement problems with general replacement cost functions and stochastic deterioration

The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Optimal power control in a wireless network using a model with stochastic link coefficients

This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

论唯物史观的价值内涵

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

信息不完备群组决策问题的ANP方法

群组决策是一类重要的决策问题,信息不完备的群组决策问题,因为判断矩阵有缺损,传统的AHP不能求解.文中将评价图引入信息不完备的群组决策问题,在此基础上提出用二次规划问题解决在这种情况下的权重确定问题,最后通过ANP的超矩阵得到总排序结果.经过实例检验,证明了ANP方法的正确性与可行性.     

基于理想点的指挥自动化系统不确定多属性效能评估

针对防空旅(团)指挥自动化系统效能评估中,其属性权重完全未知或只知大致范围的特点,给出2种基于理想点的不确定多属性效能评估模型,通过对模型的求解,可获得属性权重,进而对这种不确定性系统效能进行评估.该模型符合防空指挥自动化系统效能复杂性和人们思维的模糊性,为解决此类问题提供了新的途径和方法.实例证明,该模型简单有效.     

一类m-点边值问题的正解

研究一类二阶m-点边值问题u″ f(t,u,u)′=0,00,i=1,…,m-2,ζi满足0=ζ0<ζ1<ζ2<…<ζm-2<ζm-1=1和i∑=1aiζi<1。应用推广的Krasnosel-skii′s不动点定理,给出了上述边值问题至少存在一个正解的充分条件。