基于门限偶极子模型的四轮车变速度轨迹跟踪控制

针对利用李亚普诺夫函数控制律设计的轨迹跟踪控制器在跟踪初始误差较大和离散轨迹时,存在速度跳变问题和拐点处误差偏大的问题,设计了一种基于门限偶极子模型和趋向模型的变速度轨迹跟踪控制器。以四轮车的运动学模型为研究对象,在李亚普诺夫函数控制律的基础上,引入门限偶极子模型解决了初始误差较大速度跳变问题,同时引入纵向控制中的趋向模型,解决了不连续轨迹拐点处误差偏大的问题,使得跟踪轨迹更为光滑,进一步提高了跟踪精度。通过仿真结果对比分析,验证了改进控制器的有效性。     

DoDAF视图下的反导作战军事概念建模与仿真系统设计

反导作战概念模型是保证不同地空导弹武器系统之间指控系统可集成、可互操作性、高效一体化的关键。首先,针对传统建模语言在模型可执行验证方面的不足,在DoDAF视图框架下,提出一种基于统一建模语言（UML）的反导作战军事概念建模方法;其次,结合军事概念模型给出反导作战仿真系统设计的方法。规范建模框架并选择可执行性强的UML语言建立军事概念模型,对反导作战研究及指控系统开发具有一定参考价值。     

航天测控通信系统可靠性分析的Krylov子空间投影算法

基于Markov模型对航天测控通信系统进行可靠性分析的过程中,若系统中测控通信设备数量较多,模型中的状态空间随设备数量呈指数增长,将会导致数值计算困难.提出了一种基于Krylov子空间技术的可靠性分析方法,将大规模问题投影至小规模子空间中,求得问题的近似解.实验结果证明,Krylov子空间方法的计算速度及精度优于Ross方法和前向Euler法(forward Euler method,FEM).     

分布式UDDI的数据一致性优化模型

UDDI注册中心本质上是一个存储着Web服务注册信息的数据库,针对分布式存储与检索体系架构中出现的数据不一致性的问题,提出了一种分布式UDDI的数据一致性优化模型。首先分析了分布式UDDI及UDDI的核心数据模型,以及在分布式环境下的异构数据源问题。在此基础上,分析了数据的一致性问题,构建了UDDI节点—数据模型间的可达性矩阵,最后研究了分布式UDDI的一致性数据存储策略。该优化模型能有效减少存储冗余和检索网络带宽的消耗。     

运动目标轨迹分类与识别

运动目标轨迹识别是运动分析中的基本问题,其目的是解释所监视场景中发生的事件,对所监视场景中运动目标轨迹的行为模式进行分析与识别,智能地做出自动分类.对轨迹有效性判断后采用K均值聚类,引入改进的隐马尔可夫模型算法,针对轨迹的复杂程度对各个轨迹模式类建立相应的隐马尔可夫模型,利用训练样本训练模型得到可靠的模型参数,计算测试样本对于各个模型的最大似然概率,选取最大概率值对应的轨迹模式类作为轨迹识别的结果,对两种场景中聚类后的轨迹进行训练与识别,平均识别率较高,实验结果表明该方法是有效的.     

The effects of model parameter deviations on the variance of a linearly filtered time series

We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in the model parameters. The results provide insight into the robustness of many common statistical methods that are based on linear filtering and also yield approximate confidence intervals for the output variance. We discuss applications to time series forecasting, statistical process control, and automatic feedback control of industrial processes. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

机器翻译中语义块汉英变换处理

首先解释了要素句蜕的内涵,同时介绍了HNC理论的句蜕观,并依据HNC句类理论提出了汉英机器翻译中,要素句蜕处理的具体规则,还结合真实语料进行了验证。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

建模仿真主计划及其关键技术

综述了建模仿真主计划 (MSMP)的目的和内容 ,着重阐述该计划中的公共技术框架 ,分析该计划对军事领域内建模仿真活动的影响 ,并对其中某些关键技术问题提出了解决思路或方法     

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