无公害发黑处理

无公害发黑处理美国ＢｉｃｈｗｏｏｄＣａｓｅｙ公司开发出一种快速发黑处理工艺（ＰｒｅｓｔｏＢｌａｃｋＰｒｏｃｅｓｓ）。这种工艺能够把一种防护性发黑涂层敷到多种金属零件上而不产生常见的加热氧化技术所发生的危险烟雾和飞溅现象．这种系统不污染环境，因为该系统...     

Intel推出第二代Triton芯片组

Ｉｎｔｅｌ推出第二代Ｔｒｉｔｏｎ芯片组Ｉｎｔｅｌ近日推出两种用于ＰｅｎｔｉｕｍＰＣ的新ＰＣＩ芯片组。该公司官员预计到今年中期这两组芯片将成为企业和消费桌面系统的标准技术。Ｉｎｔｅｌ市场营销经理ＭａｒｋＣａｓｅｙ说，基于双片４３０ＨＸＰＣＩ的系统代号为...     

机场刚性道面无破损试验(NDT)评定中的因次分析

根据因次分析（ｄｉｍｅｎｓｉｏｎａｌ ａｎａｌｙｓｉｓ）法则介绍了一种相容的，理论上严密的刚性道面无破损评定法以及板和基础双层体系（ｔｗｏ－ｌａｇｅｒ ｓｌａｂ－ｏｎ－ｇｒａｄｅｐａｕｅｍｅｎｔ ｓｙｓｔｅｍ）的闭型回归计算（ｃｌｏｓｅｄ－ｆｏｒｍ ｂａｃｋｃａｌｃｕｌａｔｉｏｎ）：推导并评价了荷载与支承的四种基本组合的方程式。为了能在个人计算机上完成这种算法，编制了一个简短的计算机程序（ＩＬＬＩ     

小Knudsen数稀薄气体绕流流场分析

本文从Ｂｏｌｔｚｍａｎｎ方程５矩和１３矩方程出发，应用三层模型分析了滑流国稀薄气体绕流流场的性态，提出了一个计算这种流场的完整模型。理论分析表明，摩阻系数的小Ｋｕｎｄｓｅｎ数效应是高除小量，可忽略不计；但必须考虑热传导系数的小Ｋｎｕｄｓｅｎ数效应。基于奇异摄动法分析，数值求解了绕二维平板流动流场，壁面摩阻系数和热流率的计算结果与现有的实验和理论结果相一致。     

捷联惯导系统初始四元数提取的新算法

给出了捷联惯导系统初始四元数提取的两种新算法。其中算法1的推导是基于方向余弦矩阵和四元数的代数关系式，而算法2则利用了姿态转动的几何特点。与经典的四元数提取算法相比，所给出的算法具有简单、可靠、无奇异的特点，而且所得四元数的归一化程度也优于传统方法。利用数值仿真对所提算法的优越性进行了验证，结果表明，方法是合理的、可行的。     

北冰洋上空“亲密”接触 苏-27撞击“猎户座”

美国侦察卫星在８０年代初期发现了在苏联试飞中心有三种新型军用飞机在进行测试，其中有一种被称之为“拉明”Ｌ（Ｒａｍ—Ｌ）的飞机被判定为大型空中优势战斗机，但是关于这种飞机的细节却是来自挪威空军与它的第一次“亲密”接触中。 １９８７年９月１３日，皇家挪威空军第３３３飞行中队的萨尔文森中尉（ＬｔＳａｌｖｅｓｅｎ）像往常一样早早起床，早饭之后便去领取自己的飞行装具和导航图，同时对地勤中上说：“多给我们准备一些咖啡，我今天要到远处去‘钓鱼’，多一些刺激性饮料对我和我们的渔船都有好处。” 挪威空军日常的任务之…     

燃气轮机燃烧室中贴体网格的生成与应用

运用贴体坐标系统分别对燃气轮机燃烧室的冷态和热态流场进行了数值模拟。燃烧室的曲线壁面边界用Ｔｈｏｍｐｓｏｎ的非正交贴体坐标网格处理，并把ＳＩＭＰＬＥ算法应用到曲线坐标系下求解各守恒方程。采用双方程ｋ－ε模型来描述紊流特性；采用按简单的单步化学反应假设的Ａｒｒｈｅｎｉｕｓ－ＥＢＵ模型表述紊流燃烧；采用热通量法辐射模型来估算辐射通量和壁面温度。另外，还研究了冷态时不同旋流数和紊流强度对气流结构的影响。     

四元数最小均方误差算法及其在波束形成中的应用

 作为多维信号处理的一个重要工具,四元数代数已在各个领域有所应用。对四元数最小均方误差(QMMSE)算法进行了研究,首先推导了四元数实数形式的最小均方误差(QRMMSE)算法,进一步推导了四元数复数形式的最小均方误差(QCMMSE)算法,并且分析了两种算法的区别和计算量。最后将QMMSE算法应用到机载简化矢量传感器阵列的波束形成中,与复数长矢量最小均方误差(LVMMSE)算法相比较,QCMMSE算法的性能有所提高,计算量有所减少。计算机仿真结果验证了所提算法的有效性。     

三维湍流高速进气道内外流场的高效高分辨率解

本文提出一种高效、高分辨率求解三维复杂流场的隐式算法，并成功地用于求解高速进气道内外流场的三维、可压缩、雷诺平均Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程组，获得了三个工况五种流场的三维数值解；与有关实验数据比较，结果令人满意。这种算法由Ｊａｍｅｓｏｎ－Ｔｕｒｋｅｌ的ＬＵ分解法和张涵信ＮＮＤ格式的数值通量耦合而成，湍流采用ＢａｌｄｗｉｎＬｏｍａｘ模型。大量数值计算表明，该算法能捕捉到复杂的激波系，有较好的激波     

解流水车间作业排序问题的一种禁止搜索算法

流水车间的作业排序（Ｆｌｏｗｂｓｈｏｐｓｃｈｅｄｕｌｉｎｇ）问题是生产管理与组合优化领域研究的重要课题。禁止搜索（ＴａｂｕＳｅａｒｃｈ）算法对于这类问题具有较强的寻优能力。本文针对流水车间的作业排序问题设计了一种禁止搜索算法的实现形式，通过大量的算例分析表明，该算法具有良好的寻优性与运算效率。     

基于位势函数的欠定盲源分离识别诊断方法

对观测器数目小于源信号数目的欠定盲源分离进行了研究,提出了一种基于位势函数的稀疏信号欠定盲源分离方法,该方法从能量的观点出发,通过构造位势函数,将寻找混合信号在直线方向上的聚类问题转化为寻找累积位势函数的局部极大值问题,从而准确的估计出源信号数目和混合矩阵,克服了通常的基于k-means聚类的混合矩阵估计法需预先给定源信号数目的缺点.利用仿真信号检验了该方法的有效性.基于信号频域稀疏性假设,将该方法应用于欠定条件下的滚动轴承振动故障信号的盲分离,较好地分离出了故障信号.      

DOA and steering vector estimation using a partially calibratedarray

We consider the problem of estimating directions of arrival (DOAs) using an array of sensors, where some of the sensors are perfectly calibrated, while others are uncalibrated. We identify a cost function whose minimizer is a statistically consistent and efficient estimator of the unknown parameters-the DOAs and the gains and phases of the uncalibrated sensors. Next we present an iterative algorithm for finding the minimum of that cost function The proposed algorithm is guaranteed to converge. The performance of the estimation algorithm is compared with the Cramer Rao bound (CRB). The derivation of the bound is also included. It is shown that DOA accuracy can be improved by adding uncalibrated sensors to a precisely calibrated array. Moreover, the number of sources that can be resolved may be larger than the number that can be resolved by the calibrated portion of the array     

Problems of improper dynamic system analysis and synthesis with regard for transfer zeroes

The notion of a transfer zero as applied to improper dynamic systems is considered. An algorithm that makes it possible to reduce the calculation of improper system zeroes to finding ordinary system zeroes is presented. A method for providing the specified position of a transfer zero set in the improper dynamic system having an equal number of inputs and outputs is proposed.     

Target Track Pulse Scheduling

The problem of scheduling radar tracking pulses in a dense target environment where the position estimation error must be constrained to avoid false return with track correlations is considered. The problem is to schedule n fixed energy pulses such that the rangerate error is minimized at some final time subject to the constraint that the position error will be smaller than some value for the whole time interval. For a fixed time interval, the problem of finding the minimum number of radar measurements required to satisfy the position estimation error constraint is solved. A closed-form solution for the optimum schedule is given in the case where the number of pulses is equal to the minimum number of pulses. For cases where one extra pulse is available, a solution method is described and an algorithm is derived.     

Reduction rules-based search algorithm for opportunistic replacement strategy of multiple life-limited parts

The opportunistic replacement of multiple Life-Limited Parts(LLPs) is a problem widely existing in industry.The replacement strategy of LLPs has a great impact on the total maintenance cost to a lot of equipment.This article focuses on finding a quick and effective algorithm for this problem.To improve the algorithm efficiency, six reduction rules are suggested from the perspectives of solution feasibility, determination of the replacement of LLPs, determination of the maintenance occasion and solution optimality.Based on these six reduction rules, a search algorithm is proposed.This search algorithm can identify one or several optimal solutions.A numerical experiment shows that these six reduction rules are effective, and the time consumed by the algorithm is less than 38 s if the total life of equipment is shorter than 55000 and the number of LLPs is less than11.A specific case shows that the algorithm can obtain optimal solutions which are much better than the result of the traditional method in 10 s, and it can provide support for determining tobe-replaced LLPs when determining the maintenance workscope of an aircraft engine.Therefore,the algorithm is applicable to engineering applications concerning opportunistic replacement of multiple LLPs in aircraft engines.     

Optimizing Murty's ranked assignment method

We describe an implementation of an algorithm due to Murty for determining a ranked set of solutions to assignment problems. The intended use of the algorithm is in the context of multitarget tracking, where it has been shown that real-time multitarget tracking is feasible for some problems, but many other uses of the algorithm are also possible. The following three optimizations are discussed: (1) inheriting dual variables and partial solutions during partitioning, (2) sorting subproblems by lower cost bounds before solving, and (3) partitioning in an optimized order. When used to find the 100 best solutions to random 100/spl times/100 assignment problems, these optimizations produce a speedup of over a factor of 20, finding all 100 solutions in about 0.6 s. For a random cost matrix, the average time complexity for finding k solutions to random N/spl times/N problems appears to be nearly linear in both k and N, for sufficiently large k.     

一种支持分层设计快速线网提取算法

本文介绍一种快速线网提取方法,该算法是采用图论中求无向图连通分量的方法实现的,取得较好的结果。     

基于约束最小冗余线阵与干扰对消的测向方法

针对有源干扰背景下信号源和干扰源的个数超过线阵的自由度而产生线阵饱和现象,提出一种将约束最小冗余线阵与干扰对消技术相结合的测向方法。通过将无源状态和有源状态下线阵输出数据的协方差矩阵进行对消运算去除有源干扰和噪声分量,并对约束最小冗余线阵的波达方向(DOA)估计算法进行改进,构造了新的协方差Toeplitz矩阵,有效抑制了由阵列非均匀性导致的伪峰,提高了阵列的DOA估计性能。仿真结果表明:该算法在低信噪比背景下具有抗有源干扰能力,扩展了阵列孔径,并具有较高的测向精度和鲁棒性。     

用自适应蚁群算法求解集中网站的WEB搜索优化策略

如何提高web信息搜索的效率,改善搜索的性能,是信息检索领域一个重要的研究课题。首先利用自适应蚁群算法求得针对特定类别的最小集中网站集,再通过网页聚类,找到能获得最完全而准确信息的网页序列,从而提高web搜索的速度和准确率。     

可数非扩张映像族公共不动点迭代算法

提出一种计算可数个非扩张映像族公共不动点的新的迭代算法，并证明了算法的强收敛性。本算法由于避免使用形一映像，因而使得算法简洁，计算工作量较小。