基于FPGA的高速二维DCT变换的研究与实现

空间科学实验中图像的分辨率不断提高、数据量越来越大,因此需要对图像数据进行星上压缩处理后再进行传输。FPGA具有低功耗、高性能的特点,已普遍应用在卫星的各种有效载荷上,因此可采用FPGA实现图像压缩。基于FPGA的图像压缩算法的核心是DCT变换,而DCT变换中需消耗大量的乘法资源。为了提高图像压缩的效率,同时减少对专用乘法器的依赖,本文就充分利用FPGA中的BRAM与LUT资源,使用改进型的分布式算法、流水结构和乒乓操作,在避免使用乘法器的同时,实现JPEG压缩算法中的DCT变换,具有良好的可移植性。经验证,该方法用于基于FPGA的JPEG图像压缩系统中,相比传统DCT快速算法运算速度显著提高。     

基于偏微分的图像放大算法研究

在研究图片放大算法中,分析了现有的运用偏微分算法在图像法大中的不足,利用图像放大过程中的边缘信息可预知性,本文提出一种新的基于偏微分方程的图像放大算法,这种算法通过将图像边缘检测、平滑处理,然后采用三次样条插值算法对边缘进行相应倍数的放大,并通过对可能出现的锯齿边缘进行细化处理;将处理过的边缘作为放大图像的边缘,从而可以将源图像的边缘很好的保持下来,避免了偏微分方程放大过程中出现的边缘模糊现象。实验结果显示,该方法是一种能够很好的保存图像的边缘信息的图像放大算法。     

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

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

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

针对未知环境中障碍物种类多样性和位置不确定性的特点,提出了基于约束点的路径规划方法。首先对机器人在未知环境中检测到的局部障碍物信息进行分类和几何特征属性描述,得其约束点信息,然后引入改进后的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.     

应用人工神经网络理论建立热粘塑性材料的本构关系

本文将人工神经网络（ＡＮＮ）用于建立热粘塑性材料的本构关系，意在探索出一种描述材料变形力学行为的新方法。文中给出了应用人工神经网络建立热粘塑性材料本构关系的ＢＰ模型和学习算法过程，并应用于４５号钢在高温和高速变形条件下的流动应力计算。计算结果与实测结果比较表明，二者吻合良好。因此，应用人工神经网络建立热粘塑性材料的本构关系具有重要的工程应用价值。     

Impact of communication time delays on combined LFC and AVR of a multi-area hybrid system with IPFC-RFBs coordinated control strategy

In this paper, the impact of communication time delays (CTDs) on combined load frequency control (LFC) and automatic voltage regulation (AVR) of a multi-area system with hybrid generation units is addressed. Investigation reveals that CTDs have significant effect on system performance. A classical PID controller is employed as a secondary regulator and its parametric gains are optimized with a differential evolution - artificial electric field algorithm (DE-AEFA). The superior performance of the presented algorithm is established by comparing with various optimization algorithms reported in the literature. The investigation is further extended to integration of redox flow batteries (RFBs) and interline power flow controller (IPFC) with tie-lines. Analysis reveals that IPFC and RFBs coordinated control enhances system dynamic performance. Finally, the robustness of the proposed control methodology is validated by sensitivity analysis during wide variations of system parameters and load.     

A Web Server for Designing Molecular Switches Composed of Two Interacting RNAs

The programmability of RNA–RNA interactions through intermolecular base-pairing has been successfully exploited to design a variety of RNA devices that artificially regulate gene expression. An in silico design for interacting structured RNA sequences that satisfies multiple design criteria becomes a complex multi-objective problem. Although multi-objective optimization is a powerful technique that explores a vast solution space without empirical weights between design objectives, to date, no web service for multi-objective design of RNA switches that utilizes RNA–RNA interaction has been proposed. We developed a web server, which is based on a multi-objective design algorithm called MODENA, to design two interacting RNAs that form a complex in silico. By predicting the secondary structures with RactIP during the design process, we can design RNAs that form a joint secondary structure with an external pseudoknot. The energy barrier upon the complex formation is modeled by an interaction seed that is optimized in the design algorithm. We benchmarked the RNA switch design approaches (MODENA+RactIP and MODENA+RNAcofold) for the target structures based on natural RNA-RNA interactions. As a result, MODENA+RactIP showed high design performance for the benchmark datasets.     

Optimization algorithm for ultra-sparse arrays in regional energy focusing

The setting of ultra-sparse arrays is one of key factors for the performance of regional energy focusing.This paper focuses on one of its typical applications:Precision Electronic Warfare by UAV,and proposes an optimization algorithm for ultra-sparse arrays to maximize the performance of regional energy focusing.First,we establish the joint optimization model of the interference waveform and the positions of elements.Second,particle swarm optimization (PSO) is adopted to iterate the positions of elements.Then,the target value of the subproblem is solved for the fitness criterion,as the current array is known in each step of the iteration.Finally,we get the optimal solution of the interference waveform and the ultra-sparse array by this method.Numerical results indicate that the algorithm can optimize the array effectively,and improve the indicators of regional energy focusing obviously.Whether the localization errors of elements exist or not,the algorithm provides a better performance than existing algorithms which only design the interference waveform.     

惩罚函数结合遗传算法的PID参数优化

针对传统优化算法对PID参数优化时,由于目标函数选择不当出现的超调量过大,从而引起系统的反应速度变慢和稳定性变差的问题,提出以传统遗传算法为基础,引入惩罚函数的方法,根据系统中出现的超调量来构造新的目标函数实现对PID的参数优化。实验表明,该方法可以有效减少系统中的超调量,加快优化以及运行速度的同时保证系统的稳定性,实现对PID参数的优化。