自适应阵对角线加载研究

本文分析了对角线加载对自适应阵性能的影响，提出了加载门限的概念，以及加载门限的计算公式，为加载量的选取提供了方法和依据，并将加载研究的结果加以推广，提出了有效的ＬＳ自适应波束形成算法的非零初始化方法。     

一个基于优化的有限元模型修正方法

本文提供了一个基于一阶搜索优化的有限元模型修正方法。它只需利用结构模态试验的部分固有频率，就能获得较精确的有限元模型。文中附有某无人机上垂尾有限元模型修正的实例。根据上垂尾前二阶试验的固有频率，采用本文方法，对有限元模型进行了修正。修正后有限元模型的前二阶固有频率与试验值的相对误差在2．35％以内，而第三阶固有频率与试验值的相对误差仅为5．81％。它不仅大大地缩小了用修正前有限元模型算得的固有频率与试验值的相对误差，而且还能较精确地预测无试验结果的高阶固有频率值。     

All updateable objects in working memory are updated whenever any of them are modified: Evidence from the memory updating paradigm.

In a series of experiments, participants were required to keep track of 1 or 2 working memory (WM) objects, having to update their values in 80% of the trials. Updating cost, defined as the difference between update and non-update trials, was larger when 2 objects were involved compared with when there was only 1 object was involved. This finding was interpreted as evidence that the updating process encompasses both objects in WM, even though only 1 of them is actually updated. This feature of WM updating is limited to objects defined as "updateable," throughout the trial sequence. The results are explained by the need to reprogram the phonological loop when updating or the need for desynchronization followed by resynchronization of WM contents. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Frames of Reference in Mobile Augmented Reality Displays.

In 3 experiments, the authors investigated spatial updating in augmented reality environments. Participants learned locations of virtual objects on the physical floor. They were turned to appropriate facing directions while blindfolded before making pointing judgments (e.g., "Imagine you are facing X. Point to Y"). Experiments manipulated the angular difference between the learning heading and the imagined heading and between the actual heading and the imagined heading. The effect of actual-imagined on pointing latency was observed for naive users but not for users with brief training or instructions concerning the fact that objects can move with body movements. The results indicated that naive users used an environment-stabilized reference frame to access information arrays, but with experience and instruction the nature of the representation changed from an environment stabilized to a body stabilized reference frame. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

平面联接固定结合部动力学模型的一种建模方法

机械结构结合部精确建模是对含结合部的机械结构进行动态分析和优化设计的关键问题之一。文章主要研究块体结构和平板由螺栓联接后构成的固定结合部的动力学建模问题。将结合部区域的刚度特性用结合部的材料机械特性参数等效表达,提出了虚拟接触材料的结合部刚度表达模型。通过模态实验和模型修正识别出不同结合面工况下虚拟接触材料的弹性模量,建立了含结合部动力特性的有限元模型。该模型可方便用于含结合部结构的有限元计算,经试验验证满足实际工程应用要求。     

基于可变大小模板的改进图像修复算法

Criminisi等人提出的基于模板的图像修复算法是该领域最重要的贡献之一。在保持Criminisi基本算法框架不变的基础上,本文提出了一些改进思想。主要贡献是设计了基于可变大小模板的块匹配程序以使模板搜索更准确灵活。此外,对信度更新方式进行了修正,并结合局部搜索以提高算法的综合性能。实验结果证实了改进的有效性。     

修正型罗德里格斯参数在旋转弹上的应用

光纤陀螺可应用于旋转弹导航上,以提高其精确打击能力。基于光纤陀螺的捷联惯性导航系统是实现这一目的的重要手段之一。其中,姿态更新算法是捷联惯性导航系统的核心。针对旋转弹短时、近程的特点,提出一种基于修正型罗德里格斯参数的全姿态更新算法,并给出适合旋转弹姿态确定的数学模型。仿真结果表明与传统姿态更新算法相比较,新算法可以更有效的抑制不可交换误差,降低跟随时间的累积误差,减少高动态环境下的计算量,提高算法结算的速度和精度。     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

A preliminary study of a diagonal channel-routing model

The layout of two-terminal nets in a VLSI channel is realized in a new diagonal channel-routing model (DCRM), where the tracks are segments respectively displayed at +45 ° and –45 ° on the two layers of the channel. A new definition of channel density is introduced, and a lower bound to the channel width is derived by the application of an algorithm, whose complexity is evaluated as a function of the channel density, and other parameters of the problem.A simple linear-time algorithm is proposed, which produces an optimal layout (i.e., it requires a channel of minimum width) if the length of the longest net equals the lower bound for the channel width. In any case, the number of vias is at most one for each net. Some particular solutions are proposed for problems with long nets.Specific problems are much easier in DCRM than in the classical Manhattan model. For example, any shift-by-i can be realized in DCRM in a channel of widthi.This work has been supported by Consiglio Nazionale delle Ricerche of Italy under a research grant.     

基于小波的实时烟雾检测*

传统的离子式、吸气式、光电式等烟雾检测器在大空间中检测烟雾时,会受到发射信号与接收信号之间的距离、平面角度、精确对准等限制,无法对整个空间的烟雾状况进行描述.新的方法通过监测区域的摄像机拍摄的视频图像序列,进行小波变换,分析图像帧在时域和空域的频率特性,来确定被监测区域是否有火灾烟雾的发生.实验证明该方法不受空间高度、热障、易爆、有毒等环境的限制,并且有灵敏度高、抗干扰力强、适用范围广等特点.