基于倾斜开关曲线的小推力器姿态控制方法分析与准极限环控制方法

研究了利用小推力器进行航天器姿态控制问题。从理论上推导了在给定姿态控制精度、小推力器参数以及倾斜开关曲线参数的前提下,能够形成理想极限环控制效果的充分必要条件。对相关文献中倾斜开关曲线设计方法不能形成理想极限环的情况进行了理论分析,提出了一种新的基于倾斜开关曲线的准极限环控制方法,并推导了其控制精度。研究对于航天器应用小推力器实现高精度姿态控制具有较大的工程应用价值。     

椭圆曲线密码在电子商务现金系统中的应用研究

针对现有电子现金系统的不足,提出了一类基于椭圆曲线密码的离线电子现金方案.方案中自动更新的现金数据库可以删除过期的电子现金,避免了银行现金数据库可能无限增大的问题;在通信会话协议中,同时实现了签名、认证、加密传输和数据恢复,签名与认证的协议过程同时也是加密通信的过程,减化了常规的密码协议过程.与已有的方案相比,方案中协议与算法简洁、高效,在安全强度不变的条件下,降低了软硬件实现的系统开销,可广泛应用于电子商务等网络业务环境.     

用遗传算法实现雷达网目标分配

通过对雷达网目标分配问题的深入研究,建立了数学模型.为了获得发现概率最大的目标分配方案,引入了遗传算法来对模型求解,并给出了实现的步骤和方法.最后经过验证,证明该方法应用在雷达网目标分配问题上切实可行.     

论武警法是独立的部门法

武警法究竞是否独立的部门法,是由来已久且必须回答的重要命题。《中华人民共和国人民武装警察法》的颁布为武警法的独立性提供了实证。武警法与相关法律部门,如军事法、行政法、警察法有本质的区别。武警法是我国法律体系中具有独立地位的部门法。     

基于Theta-D次优控制器设计的相对姿轨耦合控制

针对在轨服务航天器的快速机动和姿轨协同控制的特点,研究了基于姿轨耦合一体化模型的最优控制方法。建立了包括转动和平动的六自由度相对运动耦合非线性模型,连续偏心推力矢量既可以提供位置控制力,也可以输出姿态控制转矩。利用动态模型线性化方法和θ-D构造性优化算法给出相对运动姿轨耦合最优控制问题的数值解法,同时控制服务航天器相对位置和相对姿态,使其直线逼近一个失效慢旋目标。仿真结果证明,由于在动态优化问题中采用了构造性求解,所提方法在保证相对运动稳定和动态性能的前提下计算量小,对未来应用具有一定现实意义。     

针栓喷管技术在固体姿轨控系统中的应用研究

论述了针栓喷管技术在固体姿轨控系统中的应用,研究了针栓喷管的技术途径,防热材料选择,针栓驱动方案选择,针栓结构设计,以及多喷管系统的推力管理方案.并对在不同压强和针栓位置情况下的内流场数值模拟,最后提出针栓喷管在姿轨控系统中应用的关键技术和发展方向.     

多核数字信号处理卷积算法并行优化

针对国防科技大学自主研发的异构多核数字信号处理(digital signal processing, DSP)芯片的特征以及卷积算法自身特点,提出了一种面向多核DSP架构的高性能多核并行卷积实现方案。针对1×1卷积提出了特征图级多核并行方案;针对卷积核大于1的卷积提出了窗口级多核并行优化设计,同时提出了逐元素向量化计算的核内并行优化实现。实验结果表明,所提并行优化方法实现单核计算效率最高能达到64.95%,在带宽受限情况下,多核并行扩展效率可达到48.36%～88.52%,在典型网络ResNet50上的执行性能与E5-2640 CPU相比,获得了5.39倍性能加速。     

重力扰动对SINS水平姿态的影响

为研究动基座下捷联惯导系统(Strapdown Inertial Navigation System, SINS)水平姿态误差角与水平重力扰动间的关系,推导了南北方向、东西方向匀速直线运动时,SINS纯惯性解算的水平姿态误差与水平重力扰动间的传递函数,并分析了传递函数的零极点分布;推导了组合导航模式下,水平姿态误差角与水平重力扰动间的传递函数;通过仿真分析了纯惯性解算和组合导航模式下传递函数的幅频特性。组合导航相对于纯惯性解算模式,截止频率更大,SINS姿态误差角受更多高频重力扰动信号的影响,因此,组合导航模式需要更高分辨率的重力扰动数据来进行重力扰动补偿。此外,在对高精度SINS进行重力扰动补偿时,对于重力扰动分辨率的需求是有限度的,过于精细的重力扰动数据只会带来测量和存储压力,不能提高SINS的姿态精度。     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Approximating nondominated sets in continuous multiobjective optimization problems

Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.