重构X射线脉冲星信号的纯数值模拟新算法

基于X射线脉冲星的导航技术,无论技术研究还是实验验证,都是以X射线脉冲星信号为基础。但是实际的观测数据无法确定其精确值,不便于进行导航算法的分析验证。因此,通过模拟算法重构X射线脉冲星信号十分必要。基于泊松分布建立X射线脉冲星信号模型,介绍脉冲轮廓的构建方法;介绍了两种纯数值的脉冲星信号模拟算法。针对这两种算法因近似导致信号模拟不精确的问题,提出一种基于精确光子流量函数的纯数值X射线脉冲星信号的模拟算法,该算法采用分段线性函数拟合的脉冲轮廓函数,基于分布函数及其反函数导出。模拟算法重构PSR B0531+21脉冲星的信号,并利用χ2拟合优度检验验证模拟算法生成的光子到达时间服从泊松分布。将提出的算法与两种已有的算法进行比较,仿真结果表明从光子数目和脉冲轮廓误差来看,提出的算法都优于其他两种算法,更接近实际信号。由新算法重构的脉冲星信号进行历元折叠得到观测脉冲轮廓,并将其与标准脉冲轮廓比较,发现随着观测时间的增长,观测脉冲轮廓趋近于标准脉冲轮廓,验证了模拟算法是有效可行的。     

A finite descent theory for linear programming,piecewise linear convex minimization,and the linear complementarity problem

A descent algorithm simultaneously capable of solving linear programming, piecewise linear convex minimization, and the linear complementarity problem is developed. Conditions are given under which a solution can be found in a finite number of iterations using the geometry of the problem. A computer algorithm is developed and test problems are solved by both this method and Lemke's algorithm. Current results indicate a decrease in the number of cells visited but an increase in the total number of pivots needed to solve the problem.     

矩不变量在目标形状识别中的应用研究

本文提出了图像分割的一种新的算法，简单实用。实验表明，它优于经典的最大方差准则门限法和最大熵分割法。本文利用中心矩构成仿射不变量，作为目标的特征。本文提出了利用上述各特征的一种数据融合算法。实验表明，利用该算法进行识别时正确率高，且所用时间短，效果好。本文所提供的方法在对１８类目标１３８幅图像进行识别时总识别正确率高于８５％。     

分段函数在分界点求导的一种简单的方法

介绍了用多项式根的性质与导数极限定理求分段函数在分界点的导数的简单方法。从而拓广了用导数定义求分界点导数的传统方法     

Annealing adaptive search,cross‐entropy,and stochastic approximation in global optimization

The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A note on equity across groups in facility location

An equity model between groups of demand points is proposed. The set of demand points is divided into two or more groups. For example, rich and poor neighborhoods and urban and rural neighborhoods. We wish to provide equal service to the different groups by minimizing the deviation from equality among groups. The distance to the closest facility is a measure of the quality of service. Once the facilities are located, each demand point has a service distance. The objective function, to be minimized, is the sum of squares of differences between all pairs of service distances between demand points in different groups. The problem is analyzed and solution techniques are proposed for the location of a single facility in the plane. Computational experiments for problems with up to 10,000 demand points and rectilinear, Euclidean, or general ?_p distances illustrate the efficiency of the proposed algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

平面 NURBS 曲线的椭圆弧自适应逼近

给出了用椭圆弧及双椭圆弧自适应逼近平面NURBS曲线的算法。算法所得到的椭圆样条能够G1连续 ,双椭圆样条还能够保形。与现行的圆弧逼近算法相比 ,本算法不需要求解非线性方程组 ,而是由给定的插补误差自动计算参数增量 ,得到椭圆曲线的特征点 ,还可以将误差控制在预期的范围之内 ;与现行的直线插补方法相比 ,不需要额外的时间和空间 ,也适用于CNC环境。本算法在腔体加工、二维轮廓加工等方面有特别的实用价值。     

Accuracy assessment of detection performance for sidescan sonars

Sidescan sonars are used in detecting hostile targets on the seabed. An accurate representation of the sensor performance is required to carefully plan and execute searches. We studied several confidence interval methods for assessing the accuracy of detection performance as a function of range from hostile targets. Using simulation, we determined that the best approach for modeling sensor data was piecewise logistic regression with cubic B‐splines at carefully selected knots. This method was demonstrated on real data collected from the CITADEL sea trial. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

轮式移动机器人有限时间镇定控制器设计

主要研究了单链链式系统的有限时间镇定问题。通过探讨n维链式系统的潜在线性结构,将其分解成一个标量子系统和一个n-1维线性时变子系统,并证明了该时变子系统在具有时变函数系统矩阵时的能控性。在此基础上,采用分段控制策略,基于终端滑模控制理论设计了不连续反馈镇定控制律,实现了系统的有限时间镇定。最后将该结论应用到非完整轮式移动机器人,仿真结果验证了方法的正确性。     

基于实际飞行数据插值的INS/GNSS组合导航仿真轨迹发生器

针对INS/GNSS组合导航仿真中,捷联惯导系统陀螺、加速度计信号高精度模拟问题,提出了基于实际飞行数据插值的动态轨迹解析生成仿真算法。对转换到地心惯性坐标系中的载体姿态、位置和重力场数据进行关于时间的样条函数插值,得到载体坐标系下陀螺角速率、角增量以及加速度计比力积分增量的高精度分段解析表达式。使生成的陀螺、加速度计信号符合载体运动学和动力学特性,反映杆臂效应影响,同时与经事后处理的实测GNSS伪距、伪距率等数据特征保持一致。提出了四元数约束插值算法,可满足四元数解析插值时范数为1的约束限制条件。基于某实际无人机飞行数据,验证了所提出算法的有效性,完全满足组合导航动态仿真精度要求。该算法也适用于其他高精度高动态导航系统和刚体运动控制仿真中的角运动、线运动传感器信号模拟。     

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

Transportation type problems with quantity discounts

It is known to be real that the per unit transportation cost from a specific supply source to a given demand sink is dependent on the quantity shipped, so that there exist finite intervals for quantities where price breaks are offered to customers. Thus, such a quantity discount results in a nonconvex, piecewise linear functional. In this paper, an algorithm is provided to solve this problem. This algorithm, with minor modifications, is shown to encompass the “incremental” quantity discount and the “fixed charge” transportation problems as well. It is based upon a branch-and-bound solution procedure. The branches lead to ordinary transportation problems, the results of which are obtained by utilizing the “cost operator” for one branch and “rim operator” for another branch. Suitable illustrations and extensions are also provided.     

基于仿射近似的摄像机标定

针对直接基于透视投影模型的标定算法计算量大、结果不稳定的事实,提出一种基于仿射投影矩阵的标定算法。算法首先线性解算仿射投影矩阵,然后分解出部分参数。在假定主点坐标等于图像中心的前提下,解算出其余参数,再以重投影图像点残差和为目标函数,对所有参数进行优化,获得精确的摄像机模型参数,达到精确、快速、稳定的标定目的。大量的仿真和真实图像实验证明算法比传统算法更稳定。     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A lagrangean relaxation algorithm for the constrained matrix problem

We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems.     

基于改进EMD的信号降噪方法

经验模态分解(Empirical Mode Decomposition,EMD)算法作为新型时频分析方法受到广泛关注,它基于信号的极值特性处理信号,具有自适应强、无需预先确定基函数的优点。但EMD算法本身仍存在模态混叠及EMD强制降噪法易导致信号失真等一系列问题。针对EMD算法的缺陷,提出基于自相关函数的集合经验模态分解方法(Ensemble Empirical Mode Decomposition,EEMD)与小波阈值降噪相结合的改进算法。首先利用自相关函数对高频固有模态函数(Intrinsic Mode Function,IMF)进行选择,然后利用小波阈值降噪法为EEMD设定阈值,最后将改进算法用于信号降噪,并与快速傅里叶变换(FFT)算法、小波阈值算法以及EMD强制降噪算法进行比较。该方法的优点是克服了EMD算法的不足,避免了模态混叠现象,有效地保留了高频信号中分量,降噪效果更好。     

线性规划优化分析的元模型方法及其比较

线性规划优化分析在经济管理等领域有着广泛的应用。当线性规划约束条件的右端向量在一定范围内变化时,目标函数的最优值是右端向量的一个复杂的分片线性函数,但通常难以给出分析表达式。应用多项式回归、径向基函数、Kriging法及多项式回归 Kriging法这四种元模型方法,能快速预测最优值函数。通过仿真实验,对这四种形式的元模型作较全面的比较分析。数值实验的结果表明,用次数较少的实验设计,后三种方法都具有较高的拟合精度;特别地,多项式回归 Kriging法不仅拟合精度高,而且还能用一个二阶多项式给出最优值函数的一个简明的近似描述。结果表明,元模型方法是研究线性规划优化分析问题的有效途径。     

Quadratic bottleneck problems

We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables

A branch and bound algorithm is developed for a class of allocation problems in which some constraint coefficients depend on the values of certain of the decision variables. Were it not for these dependencies, the problems could be solved by linear programming. The algorithm is developed in terms of a strategic deployment problem in which it is desired to find a least-cost transportation fleet, subject to constraints on men/materiel requirements in the event of certain hypothesized contingencies. Among the transportation vehicles available for selection are aircraft which exhibit the characteristic that the amount of goods deliverable by an aircraft on a particular route in a given time period (called aircraft productivity and measured in kilotons/aircraft/month) depends on the ratio of type 1 to type 2 aircraft used on that particular route. A model is formulated in which these relationships are first approximated by piecewise linear functions. A branch and bound algorithm for solving the resultant nonlinear problem is then presented; the algorithm solves a sequence of linear programming problems. The algorithm is illustrated by a sample problem and comments concerning its practicality are made.