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

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

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

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

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.     

Coordinated scheduling of customer orders for quick response

The scheduling problem addressed in this paper concerns a manufacturer who produces a variety of product types and operates in a make‐to‐order environment. Each customer order consists of known quantities of the different product types, and must be delivered as a single shipment. Periodically the manufacturer schedules the accumulated and unscheduled customer orders. Instances of this problem occur across industries in manufacturing as well as in service environments. In this paper we show that the problem of minimizing the weighted sum of customer order delivery times is unary NP‐hard. We characterize the optimal schedule, solve several special cases of the problem, derive tight lower bounds, and propose several heuristic solutions. We report the results of a set of computational experiments to evaluate the lower bounding procedures and the heuristics, and to determine optimal solutions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

改进BP网络的舰船装备保障资源保障能力评估

针对单独运用BP网络评估舰船装备保障资源保障能力时存在的不足,提出了一种基于改进BP网络的舰船装备保障资源保障能力评估模型。首先构建了保障能力评估的指标体系,在此基础上,采用主成分分析法对原始输入变量进行预处理,选择输入变量的主成分作为神经网络输入,一方面减少了输入变量的维数,消除了各输入变量的相关性;另一方面提高了网络的收敛性和稳定性,同时也简化了网络的结构。然后将遗传优化算法与BP网络结合,利用GA的全局搜索能力优化BP网络的结构参数。最后进行实例计算,结果表明该方法有效克服了纯BP算法局部收敛、泛化能力弱等问题,新模型采用的算法具有收敛速度快,结果精度高的优点,适用于对保障资源保障能力的分析和评估。     

系统可靠性分配的研究进展

系统可靠性分配是可靠性设计的重要任务之一,其主要作用是为可靠性设计提供辅助决策。给出了可靠性分配流程,研究了可靠性分配模型的发展状况,重点介绍了可靠性分配问题的求解算法,指出了各类算法在分配中的应用及其需进一步解决的问题,同时分析了国内外典型的分配软件,总结了各软件中可靠性分配的主要功能,最后对可靠性分配提出了进一步的研究展望。     

A mathematical programming approach for improving the robustness of least sum of absolute deviations regression

This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

捷联惯导位置更新中的多子样算法

以地理坐标系作为导航坐标系,推导了捷联惯导位置更新中的位置增量算法;提出了基于曲线拟合的多子样(二、三、四子样)涡卷补偿算法和位置旋转补偿算法.仿真结果表明,二、三、四子样涡卷补偿算法和位置旋转补偿算法都能有效地计算出涡卷补偿和位置旋转补偿值,并且二、三、四子样涡卷补偿算法和位置旋转补偿算法的精度依次提高.     

基于PMC模型的神经网络

在计算机系统中有许多诊断算法,其中针对PMC模型有0-1规划的诊断算法,这个诊断算法是NP完全的,是在多项式时间内不可解的。然而利用神经网络的高度并行性这个特点,就可以在很短的时间内解出结果。主要分析了系统诊断模型PMC的症候特征,得到其充要条件,提出了新的算法,该算法具有高度的并行性,神经网络的发展为此提供了用模拟电路来实现算法的可能性,并进行了模拟验证。