复杂线天线的一种矩量法算法

采用矩量法来计算复杂线天线.针对复杂线天线的特点,选择合适的积分方程和基函数的形式,收敛很快;另外对端点和结点的影响也做了处理,提高了计算精确度.     

组合回转壳体动力分析的混合界面法

组合回转壳体在工程结构系统中大量存在,对它们进行动力分析是十分必要的。介绍了混合界面法的主要原理和在组合回转壳体结构系统动力分析中的应用,并用两个例题作了分析和计算,证明是成功的。该方法可推广到其它复杂系统结构的动力分析。     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

基于时频分布的弹道导弹目标识别方法

在弹道导弹目标识别中,微动特征是重要的识别手段。从弹道导弹微动特性时频分析出发,提出一种基于时频分布的弹道导弹目标识别方法。该方法将时频分布图的伪Zeinike不变矩特征作为识别特征。首先对回波信号进行时频变换以获取时频图像;然后为了降低噪声的影响,对其进行图形预处理;最后给出了伪Zernike不变矩提取步骤及识别特征的选取原则。通过仿真实验,分析了不同特征组合对识别率的影响,评估了不同信噪比下识别方法的稳定性。实验结果表明,该方法具有一定稳定性,可用于弹道导弹目标识别。     

数字图像复数不变矩构造及稳定性分析

为系统性地给出数字图像不变矩一般性构造方法及对不变矩稳定性进行分析,通过采用复数矩作为描述数字图像识别特征量的方法,研究了复数不变矩所具有不变性的约束条件及其与几何不变矩间的关系,推导出了复数不变矩构造定理,并以在工程应用中的低阶复数不变矩为例对复数不变矩的稳定性进行了分析。研究结果表明:采用复数不变矩构造数字图像特征量具有很好普适性和稳定性,对于图像目标识别特征的描述有较好的效果。     

航天器转动惯量参数在轨辨识的最优激励

根据矩阵分析理论研究了转动惯量参数的可辨识性问题,从姿态动力学方程导出关于未知参数的线性回归模型,将回归矩阵的条件数作为参数可辨识度的定量指标,以可辨识度最大为目标函数建立最优控制模型;应用解最优控制问题的伪谱法,计算控制力矩陀螺的指令轨线,使得惯量参数的辨识精度和收敛速度显著提高;在仿真中采用双无迹卡尔曼滤波算法进行参数辨识,结果验证了所提出的最优激励设计方法可以改善参数辨识性能,同时该方法对先验信息误差具有鲁棒性。     

Some comparisons of residual life of coherent systems with exchangeable components

Most of the research, on the study of the reliability properties of technical systems, assume that the components of the system operate independently. However, in real life situation, it is more reasonable to assume that there is dependency among the components of the system. In this article, we give sufficient conditions based on the signature and the joint distribution of component lifetimes to obtain stochastic ordering results for coherent and mixed systems with exchangeable components. Some stochastic orders on dynamic (or conditional) signature of coherent systems are also provided. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 549–556, 2014     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

舰船维修器材保障点选址决策模型及算法

传统的最大覆盖选址模型没有考虑对服务半径外的需求点的满足和服务时间的响应,而在舰船维修器材保障中,不论需求点到保障点的距离是否大于服务半径,都应对其进行保障服务,且在保障过程中要满足保障时间控制在不影响舰船正常维修任务时间内。针对此问题,运用广义最大覆盖选址模型和时间满意度函数,构建基于时间满意的广义最大覆盖选址模型,并运用一种混合算法———基于遗传模拟退火算法的BP算法对模型进行求解。最后,运用该算法对实例进行了分析计算,计算结果验证了该算法的有效性。