离子束抛光加工矩形离轴非球面镜

采用一种简单的方法使用线性三轴离子束系统实现了矩形离轴非球面镜的抛光加工.根据离子束材料去除机理,分析了去除函数的法向材料去除特性,并且以去除函数束径、峰值去除速率和体积去除速率为指标,评价了入射角的小扰动鲁棒性.利用相关的分析和实验结果,对矩形离轴镜的抛光加工进行了合理的简化,并在自行研制的离子束抛光机床上进行了修形...     

探月飞行器定点返回轨迹特性分析

对探月飞行器返回到预期着陆点的轨迹特性进行了研究,着重分析了月球定点返回着陆点和再入点位置的变化规律.分析了返回轨迹特征点的相对位置特性,包括月球反垂点、再入点、近地点,得到了再入点速度、纬度具有变化较稳定的规律.在特征点位置特性研究的基础上,给出了着陆点和再入点位置分析近似方法;基于月相原理研究了着陆点光照条件和月球...     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

基于在线动平衡的磁轴承参数辨识

针对磁悬浮刚性转子系统,提出了一种基于在线动平衡的磁轴承参数辨识方法。采用已知大小和相位的不平衡质量作为激振源,根据动平衡仪测得的转子不平衡响应,求得磁轴承位移刚度和电流刚度。利用某型磁悬浮控制力矩陀螺对该方法进行了试验验证,得到了一定转速范围内的磁轴承位移刚度和电流刚度,证明了该方法的正确性和实用性。试验结果表明外转子型磁轴承位移刚度和电流刚度随转速的增加而下降明显。     

改革开放前毛泽东先行探索社会主义的经验教训——纪念毛泽东诞辰120周年

毛泽东早在20世纪50年代,就开始对适合中国国情的社会主义建设道路进行了一系列开创性探索。他基于中国经济文化落后的基本现状,对“什么是社会主义”、“如何建设和发展社会主义”等问题进行了艰苦探索,并提出许多富有创造性的思想。毛泽东探索的过程是极其艰辛的,其中既有成功的经验,也有失败的教训。今天总结这些经验教训,对于我们更好地坚持和发展中国特色社会主义,具有重大的历史意义和现实意义,同时这也是坚持贯彻习近平“两个不能否定”的基本要求。     

空舰导弹火控系统精度分析研究

介绍了一种空舰导弹火控系统动态精度试验的试验方法、误差分析理论和方法.用导弹火控系统的数据测量设备获取火控系统输出射击诸元参数实际值,再测量载机和靶船的位置和运动参数,经真值解算模型解算出射击诸元参数标准值.将实际值与标准值进行比较与分析,即可得知空舰导弹火控系统的动态精度是否满足要求.此方法已成功地应用于导弹火控系统精度飞行试验中.     

压电执行器 NLDDS及神经网络非线性建模与控制

本文采用非线性动态数据系统(NLDDS)建模方法和非线性递推最小二乘算法,对具有迟滞非线性特性的压电陶瓷微进给执行器的动态特征进行了建模、预报与控制,并且用人工神经网络对该类系统的建模与控制进行仿真。结果证明上述方法在一定程度上是可行的和有效的。     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

利用GPS载波相位测量快速确定动态载体姿态及精度分析

本文针对高动态飞行器的姿态测量中，采用 Ｇ Ｐ Ｓ载波相位测量来确定姿态的原理，以及相关关键技术问题作了深入研究，提出了利用空间几何约束原理来实现高动态飞行器等载体的姿态快速测量，从而达到实时定姿的目的。同时本文针对动态仿真数据进行了大量的仿真计算及精度分析。