正切函数的契比协夫逼近及其系数的加速计算法

本文给出正切函数的有理展开和契比协夫展开式系数的加速计算方法;同时在YH-1机上进行了数值试验,结果表明:用现在的系数来计算正切函数,其精度比原来正切函数的精度可提高30%左右。     

低轨预警自由段弹道估计的多项式逼近算法

低轨单星对自由段弹道的估计是天基预警系统需解决的关键技术之一.建立了低轨预警卫星对自由段弹道的观测模型,针对极大似然估计批处理算法的大运算量问题,给出了一种多项式逼近算法,由观测数据的逼近多项式在一些特定采样点的值形成伪观测数据,以伪观测数据代替原观测数据进行弹道估计.仿真表明,精度与极大似然估计相当,运算量显著降低.     

高炮射弹飞行时间拟合

用插值拟合和最小二乘逼近拟合方法对高炮射弹飞行时间拟合问题进行了研究。通过对插值拟合公式原理及误差规律的分析,提出确定可用区间的"去值检验"方法,说明了插值拟合公式的应用范围。通过对最小二乘拟合公式实际计算结果的分析,得出了"拟合公式阶数取3为最佳"的结论。对其他口径高炮的射弹飞行时间拟合也基本适用。     

On online bin packing with LIB constraints

In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online one‐dimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the condition above. This variant is called online bin packing problem with LIB (larger item in the bottom) constraints. We give an improved analysis of First Fit showing that its competitive ratio is at most , and design a lower bound of 2 on the competitive ratio of any online algorithm. In addition, we study the competitive ratio of First Fit as a function of an upper bound (where d is a positive integer) on the item sizes. Our upper bound on the competitive ratio of First Fit tends to 2 as d grows, whereas the lower bound of two holds for any value of d. Finally, we consider several natural and well known algorithms, namely, Best Fit, Worst Fit, Almost Worst Fit, and Harmonic, and show that none of them has a finite competitive ratio for the problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

带任意泛函约束的多项式再生核的计算

讨论多项式再生核的构造与计算,指出了带任意泛函约束的多项式再生核可由带初值约束的再生核取两次投影余项而得到,并建立了具体的计算方法.     

基于多项式设计法的小推力轨迹设计

形状逼近法是小推力轨迹设计中的一种有效方法,然而现有的方法大都假定运动轨迹为某一特定的形状,而且没有考虑推力加速度的约束限制。针对小推力轨道交会问题,提出一种基于多项式的轨迹设计方法。结合极坐标系,建立基于多项式的三自由度轨迹运动模型,将轨迹设计问题转化为求解多项式的系数问题;根据运动模型推导轨迹的动力学特性,建立约束方程,并以消耗燃料最少作为性能指标,采用序列二次规划的方法对多项式的系数进行寻优计算。该方法不仅能求解多个形状设计参数不确定性问题,而且还能满足推力加速度的约束限制。仿真验证了该方法的正确性和可用性,该方法可为任务设计初步阶段的轨迹设计和燃料消耗预估提供一定的技术参考。     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

高炮射弹飞行时间拟合

用插值拟合和最小二乘逼近拟合方法对高炮射弹飞行时间拟合问题进行了研究.通过对插值拟合公式原理及误差规律的分析,提出确定可用区间的"去值检验"方法,说明了插值拟合公式的应用范围.通过对最小二乘拟合公式实际计算结果的分析,得出了"拟合公式阶数取3为最佳"的结论.对其他口径高炮的射弹飞行时间拟合也基本适用.     

基于小波去噪半参数回归模型的卫星轨道测量数据预处理方法

由于卫星轨道测量数据中含有非线性误差,使用传统的最小二乘多项式拟合方法对其进行预处理必然会降低定轨精度.在半参数回归模型的基础上,应用小波阈值去噪算法估计并消除观测数据中存在的非线性误差,提出了基于小波去噪半参数回归模型的卫星轨道测量数据预处理方法,以提高数据预处理的精度.对某卫星USB跟踪数据应用该方法进行了仿真,仿真结果表明:该方法可以分离出观测数据中的白噪声和非线性误差,从而可以在观测数据中消除非线性误差的影响,提高数据预处理的精度.