一种GNSS卫星轨道高精度实时插值方法

针对GNSS导航信号模拟源中多星座轨道计算实时性问题,从计算效率、精度等角度分析和对比了牛顿多项式和埃尔米特多项式插值算法的性能,通过对牛顿插值的加“窗”改进,使得卫星位置、速度的插值精度显著提高.算例结果表明,该方法能够在等间距时间点上多个卫星位置已知、速度未知的条件下,高精度实时地内插出卫星的位置和速度,其中卫星位置插值精度为mm级,速度插值精度小于1e-5 m/s,计算量为广播星历直接计算的1/7,位置和速度的拟合精度均优于三阶埃尔米特插值结果.     

A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities

This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

光学系统的副像及其消除方法的探讨

视准式光学系统瞄准具的成像有主像和副像两种情形,主像是对目标瞄准的必要标志,副像则对目标的瞄准产生不良影响,为消除或减弱光学系统所成的副像对瞄准精度的影响,主要分析了光学系统中中心反射镜的反射和有无平行差时产生副像的原因.提出了消除或减弱副像的多项措施,并针对中心反射镜提出了两种截然相反地改进方法.可有效地消除或减弱副像所引起的不良干扰对飞行人员视觉的影响,有效地提高了观察效果和瞄准精度.     

故障树近似计算中最优权因子的选取

在故障树近似计算时,探讨通过加权提高计算准确度的简便方法。根据底事件发生概率的不同,利用VisualC 语言进行蒙特卡罗仿真计算,得到了在近似计算故障树顶事件发生概率时,在不同底事件发生概率对应区间内的最优权因子。利用该方法得到的最优权因子可以提高故障树近似计算的准确度,尤其是在当底事件发生概率较大时,其效果更为明显,可较好地满足采用故障树对某些特殊设备进行顶事件发生概率计算时提高计算精度的需求。     

Locating a target from directional data

Statistical estimation plays an important role in locating a target in space, a task that has important applications in many areas. However, theoretical measures on the quality of various estimators reported in the literature have been difficult to obtain because of mathematical complications. As a result, choice of estimator in practice has been largely arbitrary. In this paper, we present a systematic study on major target estimators reported in the literature. Focus is on comparisons between the traditional angle method, the line method, and a recently developed line-to-point transformation method. Insights gained from the study directly lead to the development of a novel two-stage angle method that not only produces highly accurate target estimation among all known estimators but is also computationally efficient. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 353–364, 1998     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

网格方程组并行计算预条件迭代若干性质及应用

对网格方程组作区域分裂并行计算 ;分析了预条件迭代谱条件的若干性质及其对算法收敛性的影响 ,为构造预处理提供了理论依据 ,并应用于区域分裂并行计算     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

并行时域自适应算法在电大目标瞬态散射中的应用

基于电磁场时域积分方程(TDIE)数值技术计算复杂目标的瞬态散射特性,其计算量和内存需求大,采用时域自适应算法(TDAIM)降低了TDIE的计算规模。在研究TDAIM并行算法的基础上,开发了基于.NET Remoting的电磁场分布式数值计算方案。数值结果表明,该方案显著提高了TDAIM的计算效率,为解决电大目标瞬态电磁散射问题提供了一条有效途径。