Low-thrust transfer to Backflip orbits

The aim of the work is to design a low-thrust transfer from a Low Earth Orbit to a “useful” periodic orbit in the Earth–Moon Circular Restricted Three Body Model (CR3BP). A useful periodic orbit is here intended as one that moves both in the Earth–Moon plane and out of this plane without any requirements of propellant mass. This is achieved by exploiting a particular class of periodic orbits named Backflip orbits, enabled by the CR3BP. The unique characteristics of this class of periodic solutions allow the design of an almost planar transfer from a geocentric orbit and the use of the Backflip intrinsic characteristics to explore the geospace out of the Earth–Moon plane. The main advantage of this approach is that periodic plane changes can be obtained by performing an almost planar transfer. In order to save propellant mass, so as to increase the scientific payload of the mission, a low-powered transfer is considered. This foresees a thrusting phase to gain energy from a departing circular geocentric orbit and a second thrusting phase to match the state of the target Backflip orbit, separated by an intermediate ballistic phase. This results in a combined application of a low-thrust manoeuvre and of a periodical solution in the CR3BP to realize a new class of missions to explore the Earth–Moon neighbourhoods in a quite inexpensive way. In addition, a low-thrust transit between two different Backflip orbits is analyzed and considered as a possible extension of the proposed mission. Thus, also a Backflip-to-Backflip transfer is addressed where a low-powered probe is able to experience periodic excursions above and below the Earth–Moon plane only performing almost planar and very short transfers.     

风扇机匣的减振优化设计

涡扇发动机风扇叶片的强大尾迹容易激起风扇机匣的高频行波共振.针对某涡扇发动机风扇机匣曾出现的振动过大的现象,分析了引起的原因,研究了减振措施,在此基础上提出了以减小振动为主要目的风扇机匣结构优化设计方法.机匣优化前后的整机试验测试结果表明,该方法是非常有效的.      

地面等待模型中的旅客延误时间成本分析与仿真

针对多机场地面等待问题MAGHP(Multi Airport Ground Holding Problem),深入研究了影响旅客延误时间的因素,并将其应用于数学模型中目标函数的计算。将航班延误时间转化为旅客延误时间,提出了一个在航班取消情况下减少旅客延误的新方法,并与多机场地面等待模型进行了比较,仿真结果表明,可以大幅度减少旅客延误时间。     

严格随机正则(3,s)-SAT模型及其相变现象

研究变元和文字出现次数受限制的规则3-SAT问题,提出了一种严格随机正则（3,s）-SAT问题,并给出了该问题的实例产生模型--SRR模型。结合一阶矩方法和生成函数展开项系数的渐近近似技术,证明了严格随机正则（3,s）-SAT问题相变点的上界,即当变元规模N较大且变元出现次数s>11时,严格随机正则（3,s）-SAT实例是高概率不可满足的。实验结果表明：由SRR模型所生成的随机实例中,当N>60且s>11时,所有的（3,s）-SAT实例均是不可满足的,而当N>150且s<11时,所有的（3,s）-SAT实例均是可满足的,即严格随机正则（3,s）-SAT实例的相变点位于s=11处,且在s=11处（子句变元比为11/3）的严格随机正则（3,s）-SAT实例,比在相变点（子句变元比）4.267处同规模的均匀随机3-SAT实例更难求解,因此,SRR模型可以很方便地在s=11处构造难解的随机3-SAT实例。     

基于解析梯度的经典Lambert问题迭代求解方法

针对现有求解模型复杂、收敛速度慢等问题,在将经典Lambert转移问题转化为超越方程的基础上,提出一种基于解析梯度的Lambert问题迭代求解算法。选择转移轨道的真近点角为迭代变量,导出转移时间关于真近点角的解析梯度,构造一种基于解析梯度的牛顿迭代算法,降低了算法计算复杂度。理论分析表明该算法具有二阶以上的收敛速度。依据偏心率向量与转移轨道形状的关系,通过几何方法分析得到转移轨道在初始位置处的速度约束条件,推导转移轨道真近点角的最大值和最小值的解析表达式,并采用线性插值方法确定迭代初值,进一步提高了迭代算法的收敛速度。数学仿真结果表明在各种转移条件下算法均能快速收敛,采用所给出的初值选取方法初值确定精度高,进而能够加快收敛速度,而与较割线法相比较收敛速度快、计算量小,验证了所提出算法的有效性。     

高声强声场模拟装置设计与声试验1/3倍频程控制技术研究

为了提高混响室声场模拟能力,北京卫星环境工程研究所自研一套高声强声场模拟试验设备。文章介绍了该设备的行波管发声系统设计和消声降噪处理过程——行波终端设计以及声试验控制仪器的原理。经过调试试验验证,测量结果满足声压级165 d B行波声场的要求,行波管试验段性能良好,达到167.9 d B,消声道出口噪声能够满足环境模拟需求。     

一类特殊实对称矩阵的逆特征值问题

讨论如下形式实矩阵的逆特征值问题（1）给定两个互异实数λ,μ和两个n维非零实向量x，y，求矩阵A，使（λ，x）和（μ，y）是A的特征对；（2）给定两个互异实数λ，μ和两个n维非零实向量x，y，求矩阵A和A*，使得（λ，x）和（μ，y）分别是A和A*的特征对．本文给出了问题有解的充要条件，并给出了一些数值例子。     

二维机翼非定常气动力学反命题的变分理论

非定常流动的反命题迄今在世界文献中尚属空白。本文首次对它进行探讨，就二维振荡机翼的非定常气动力学反命的适当提法及其数学模型作了较深的研究，利用变域变分工具成功地建立了相应的变分原理及广义变分原理，为非定常机翼设计及有限元解的应用提供完整周密的理论基础。     

双机平面格斗的一些问题——一种处理“二重角色”的方法

 结合坐标变换和能控区及微分对策方法,本文提出较为细缀的一种处理双机格斗“二重角色”问题的方法。分析了捕捉区、逃避区和危险区,有助于飞行员在空战格斗中采取有利于自己的控制。本文在空战格斗的对策模型中,考虑了双方匀变速运动。     

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles （UAVs） performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so that the constraints of UAVs＇ minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood （DTSPN）. Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants （multi-UAV scenario and multiple groups of targets scenario）. The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.