栅栏覆盖最大化生存周期调度算法

栅栏覆盖是近年来无线传感器网络的研究热点之一,如何延长生存周期是无线传感器网络研究的一个重要问题。针对无线传感器网络的栅栏覆盖应用,设计了两种最大化网络生存周期的调度算法:集中式的Greedy调度算法和分布式的DBCS调度算法。仿真实验表明:两种算法显著地延长了网络的生存周期;在较稀疏的网络中,DBCS算法与Greedy算法性能接近,分布式的DBCS算法适合应用于大规模传感器网络。     

机器人三维路径规划问题的一种改进蚁群算法

本文研究移动机器人三维空间路径规划问题,针对三维空间的复杂地形特点,提出了一种基于改进蚁群算法的路径规划算法。文中首先描述了一种简单有效的环境建模方法,然后给出了算法在信息素呈现、路径点选取、信息素更新以及启发式函数设计等方面的改进方法。仿真结果证明了算法的可行性和可靠性。     

信息融合技术在变压器油气识别故障诊断中的研究

变压器故障分为放电性故障和过热性故障两大类别,它们均会在变压器油中有所反映。本文通过对变压器油中主要气体的分析,判断变压器的故障类型。具体方法是:利用改进算法的BP网络和信息融合技术,以变压器油中五种主要特征气体作为神经网络的输入,以六种变压器状态作为相应的输出,通过加入动量因子,可以提高学习率系数,充分发挥改进算法的BP网络具有自适应学习能力的优势。仿真测试结果表明,本方法能够在较大范围内准确有效地进行变压器的故障诊断。     

图像处理中模糊算法问题的分析

图像处理是计算机常用技术之一,模糊算法的运用有助于提高图像处理的效果。传统图像处理存在诸多弊端,影响了用户获取信息的便捷性。本文分析了图像处理的基本操作内容,并阐述了模糊算法在图像处理流程中的运用,以进一步提升原始图像处理的效果。     

未知环境下基于约束点的移动机器人路径规划

针对未知环境中障碍物种类多样性和位置不确定性的特点,提出了基于约束点的路径规划方法。首先对机器人在未知环境中检测到的局部障碍物信息进行分类和几何特征属性描述,得其约束点信息,然后引入改进后的A*算法,将其搜索范围局限于约束点上,计算约束点的评价函数值后得到子目标点,机器人到达子目标点后,若陷入死区,则采取回溯路径策略,重新选择子目标点,否则根据该点所属的障碍物种类采取跨越或绕行避障策略,最后移动机器人在未知环境中顺利到达目标点。仿真研究说明本文提出的路径规划方法具有可行性和有效性。     

Parallel depth first search. Part II. Analysis

This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work-distribution scheme and the target architecture. We introduce the concept of isoefficiency function to characterize the effectiveness of different architectures and work-distribution schemes. Many researchers considered the ring architecture to be quite suitable for parallel depth-first search. Our analytical and experimental results show that hypercube and shared-memory architectures are significantly better. The analysis of previously known work-distribution schemes motivated the design of substantially improved schemes for ring and shared-memory architectures. In particular, we present a work-distribution algorithm that guarantees close to optimal performance on a shared-memory/-network-with-message-combining architecture (e.g. RP3). Much of the analysis presented in this paper is applicable to other parallel algorithms in which work is dynamically shared between different processors (e.g., parallel divide-and-conquer algorithms). The concept of isoefficiency is useful in characterizing the scalability of a variety of parallel algorithms.This work was supported by Army Research Office Grant No. DAAG29-84-K-0060 to the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the Computer Science Department at the University of Texas at Austin.     

基于信息元的教学资源组织系统设计与实现 *

以文本类型教学资源为研究对象,在领域知识可拓信息网模型和CELTS-3的基础上,阐述了基于信息元的教学资源组织系统设计与实现过程,包括信息特征元数据描述框架、特征词获取、信息元距离度量、信息元匹配规则以及匹配算法等.该系统通过有限的信息元描述无限的资源,实现了教学资源的高效组织,支持学习过程中资源自动重组.     

基于演化算法的奇偶校验器自动设计*

基于演化算法技术,提出一种新的设计思想,实现奇偶校验器的电路自动设计.实验证明,多目标演化算法具有较少的运算量和较高的效率,能自动设计出使用逻辑门数更少、延时更小的奇偶校验器.     

辊底式退火炉的炉体改造

分析了辊底式退火炉存在的问题，提出改进措施及改造后节能效果。     

An accelerated algorithm for full band electron–phonon scattering rate computation

Computing scattering rates of electrons and phonons stands at the core of studies of electron transport properties. In the high field regime, the interactions between all electron bands with all phonon bands need to be considered. This full band interaction implies a huge computational burden in calculating scattering rates. In this study, a new accelerated algorithm is presented for this task, which speeds up the computation by two orders of magnitude (100 times) and dramatically simplifies the coding. At the same time, it visually demonstrates the physical process of scattering more clearly.