一种新型NoC互连算法及连线冗余的修正

片上网络(Noc)是一种新兴的以包交换为通信方式的芯片互连结构。NoC的互连问题可以抽象为在有障碍曼哈顿平面生成最小森林的图论问题,本文提出了一种新型的NoC互连算法,该算法通过对连线边长权重进行更改后再调用最小生成树算法,并针对连线冗余进行修正。实验表明,该算法使得片上网络的全局连线长度最小,从而解决传统片上总线结构中连线延时长、信号完整性差等缺点。     

军用飞机改进改型研制费用的参数估算法

首先分析并建立了军用飞机改进改型研制的费用分解结构,阐明了与新研飞机在各分项费用上的差别。基于当量工程的概念提出了用减缩系数来估算改进改型研制的费用修正和各分项费用的减缩系数的估计方法,结合现有成熟的参数估算模型建立了相应的改进改型研制的费用估算模型。最后,以某型飞机的改型研制费用为例进行了实例分析,结果表明方法与模型具有较好的有效性和实用性。     

导弹武器系统研制费用估算方法

针对导弹武器系统研制费用相关数据样本量少,变量之间存在严重共线性等问题,提出了一种基于偏最小二乘法的研制费用估算模型。引入库克距离对原始数据进行识别,并剔除异常数据,采用灰色关联度分析法选取相关度高的自变量,提高模型准确性和稳定性。利用偏最小二乘法进行数据拟合,估算出导弹武器系统的研制费用。应用算例的计算结果表明,该方法建立的研制费用估算模型拟合度良好,计算误差在8%以内。     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

边界元角点问题的重节点法分析

应用重节点法处理三维弹性力学角节点问题,采用等参变换插值逼近的方法离散边界积分方程,解决了由于角节点表面力不连续带来的方程求解困难问题。算例分析结果表明,该方法具有操作简单,计算方便,求解结果满足计算精度的要求等优点,尤其在角点存在应力集中场合更具优越性。     

UCAV空面多目标攻击三维轨迹规划技术

研究了单架无人作战飞机(UCAV)攻击多个地面目标的三维轨迹规划问题。首先,将问题形式化为一类特殊的旅行商问题(TSP),即带动力学约束的邻域访问TSP问题(DCTSPN)。其次,针对规划空间维度过高、搜索代价过大的问题,提出了一种基于概率路标图(PRM)的方法。该方法借鉴了基于采样的运动规划方法的思想,并结合多种组合优化技术,将原本连续状态空间中的轨迹规划问题转化为离散拓扑图上的路由问题。求解过程分为离线预处理和在线查询两个阶段。离线阶段采用Halton拟随机采样算法及Noon-Bean转换方法,将原问题转化为经典的非对称旅行商问题(ATSP);在线阶段根据战场态势的实时变化,快速更新路标图,然后采用LKH算法在线求解问题的近似最优解。为了保证生成的飞行轨迹满足平台的运动学/动力学约束,算法基于Gauss伪谱法构建了局部轨迹规划器。最后,以攻击时间最短为优化指标对算法进行了仿真实验。结果表明,本文提出的方法能够以较高的精度和在线收敛速度生成真实可行的、较优的多目标攻击轨迹。     

一种舰船目标一维距离像识别的新方法

提出了一种基于傅里叶-梅林变换和二叉树支持向量机相结合的舰船目标一维距离像识别方法。该方法充分利用了傅里叶-梅林变换具有的时移与尺度不变性和支持向量机在小样本分类中的优势,可以改善目标的特征稳定性,提高识别性能。针对多类舰船目标的识别,提出采用聚类分析中的均值距离来生成二叉树,将分类器分布在各个节点上,构成了多类支持向量机,减少了分类器数量和重复训练样本的数量。对4类舰船目标仿真实验的结果表明,该分类方法具有较高的识别性能、较快的识别速度。     

遥测参数数据载荷状态判别集成学习方法

针对载荷单机设备遥测参数维度高、数据量大、存在类别不平衡、无法直观判别单机设备运行情况等问题,考虑到航天任务对可解释性的要求,提出一种基于信息增益参数特征选择和集成学习方法的载荷单机状态快速识别方法。采用统计量性质和信息增益子集搜索方法对遥测数据进行特征筛选降维,通过集成学习模型算法实现载荷单机设备状态的自适应识别分类。所提方法将信息增益的参数分类信息量评价准则和集成学习拟合能力强、类别不平衡下准确率高和抗噪能力强等优点相结合,兼顾模型特征和结果的可解释性,提供了重点参数发现功能。采用科学卫星任务真实载荷遥测参数数据对该方法进行了验证,整体识别准确率高于90%,少数样本亦可准确识别,整体效果可达到在轨任务要求,证明了所提方法的有效性和实用性。     

Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034     

压入法中的接触问题

针对表面工程中测量膜基材料性能或结合强度的压入法,分析了其实验过程中所涉及的重要而又困难的接触问题。在引入适当的假设后,文中首次对二维、三维问题等一般情况,分别给出了控制接触的边界条件方程,并进一步使用半解析的数值方法——线法,针对二维情况使用,球形压头和楔形压头分别进行了数值模拟,并将计算结果和不考虑接触情况下的结果进行了比较结果表明:剪应力差别巨大,这说明接触问题的考虑对于正确地处理实际问题是非常必要的。