生物序列搜索算法hmmsearch的加速技术

在FPGA平台实现细粒度并行的hmmsearch加速技术。采用数据预取、滑动窗口和数据传递等策略实现子处理单元的数据重用。在计算矩阵块内部实现流水线计算。加速器性能为3.59 GCUPS,与CPU相比,可获得接近235倍的加速效果。与目前FPGA上同性质最快的加速器相比,单PE可获得34%的性能提升。     

基于奇偶量化的彩色图像盲水印算法

提出一种基于奇偶量化的彩色图像小波域的数字水印算法。首先对水印图像进行置乱处理,然后对图像进行翻转,最后利用混沌系统产生的混沌序列对水印进行加密。水印嵌入时,采用小波变换并利用奇偶量化规则将加密后的水印嵌入到载体图像蓝色分量最深层的四个子带中。水印提取时,不需要原始图像的参与,实现了盲提取。仿真实验和性能分析表明,该算法有很好的不可见性和鲁棒性,可以有效地抵抗JPEG压缩、噪声、剪切等攻击。     

基于几何不变量的直线匹配方法

针对目前直线匹配算法大多基于直线段支持区域的几何特性、灰度特性,但这些特性又极易受外界因素干扰造成匹配失败的情况,提出了基于直线几何不变量的匹配方法,该方法在无任何已知条件的情况下,运用叉积符号、点的线束交比不变量进行直线匹配。对于各个视点图像,采用Hough变换提取直线间交点集,再采用Graham扫描法构造一个最小的凸包,并通过匹配凸包顶点的交比序列来建立点与点的对应关系,选取其中一个对应关系完成直线的匹配。实验结果表明,该方法鲁棒性较好,具有广泛的应用性。     

非参数不确定时滞系统的重复控制

针对非参数不确定时滞系统,给出能够实现跟踪误差本身沿整个周期完全跟踪的重复控制器设计．针对系统不确定特性的界函数已知和未知两种情形,分别分析闭环系统的稳定性与收敛性．控制器中学习部分采用完全饱和形式,使得参数估计囿于一预先给定的范围内．该控制律可保证闭环系统内所有信号有界以及跟踪误差本身趋于零．数值仿真表明算法的有效性．     

基于模式驱动和模糊查询的模式发现方法

在蛋白质序列的比对研究中,拥有相似模式的蛋白质常常具有相似的功能.通过已知的蛋白质序列模式可以很方便地对新蛋白质序列的功能结构进行研究和确认.蛋白质序列的发现已成为一个很有意义的题目.对基于模式驱动Pratt算法进行改进以提高其效率,在原来基础上引入模糊查询方法,能够更为快捷地从互不相关的蛋白质序列集合中找出最具代表性的蛋白质模式.     

一种基于不放回抽样的图像混沌加密算法

针对现有基于混沌序列的图像加密算法的缺陷,提出一种基于不放回抽样的图像混沌加密算法。该算法采用可变模运算和间接地址映射技术,将混沌序列一对一、高度随机地转换为图像像素地址,实现图像的位置置乱和灰度扰乱加密。对混沌序列的分布无严格要求,使混沌序列的参数和初值可以作为密钥被使用。实验结果表明,与现有同类算法相比,该算法性能优越、运算速度快且易于实现。     

基于遗传算法的直线光流刚体运动重建

建立一种新的基于直线光流场从单目图像序列恢复刚体运动和结构的模型,推导出直线光流场与刚体的运动参数之间的关系,用2个二阶线性微分方程表达这种关系,并提出一种求解刚体运动参数的遗传算法,只需要获得图像平面的2条直线光流即可求解刚体的旋转参数,并用合成图像测试了该算法的有效性。     

基于优选准则的混合混沌序列的生成

针对传统的m序列、Gold序列可用作扩频码的数量有限这一问题,提出了用混沌序列代替传统的m序列、Gold序列的方法。针对单个低维混沌映射产生的混沌序列存在抗攻击能力差、密钥空间小、保密性不理想等缺点,依据优选结果将单个低维的改进型Logistic序列与Chebyshev序列组合产生了一种新的混合序列。仿真结果表明,新的混合混沌序列平衡性高、类随机、相关性好,且该混合混沌序列和m序列、Gold序列的抗AWGN干扰和抗单频干扰的能力相近。     

Improving ESL writing using an online formulaic sequence word‐combination checker

Writing correct English sentences can be challenging. Furthermore, writing correct formulaic sequences can be especially difficult because accepted combinations do not follow clear rules governing which words appear together in a sequence. One solution is to provide examples of correct usage accompanied by statistical feedback from web‐based applications for learners to emulate. The goal of the study was to investigate whether such a dedicated web‐based program that provides instant examples of correct word combinations and detailed results of who used these examples, where and when, can improve students' writing. Data were collected from 74 ESL (English as a Second Language) undergraduate students divided into control and experimental groups, who performed formulaic sequence tests, wrote passages in English, followed by interviews with members of the experimental group. The results show that students who used the software outperformed those who did not, on the tests and the overall grades for their writing. Implementing formulaic sequence check programs in writing classes to help students decide which words can appear together, under which circumstances, and in which context is recommended.     

Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid

In this paper the nodes of the hexagonal grid are used as points. There are three types of neighbours on this grid, therefore neighbourhood sequences contain values 1, 2, 3. The grid is coordinatized by three coordinates in a symmetric way. Digital circles are classified based on digital distances using neighbourhood sequences. They can be triangle, hexagon, enneagon and dodecagon. Their corners and side-lengths are computed, such as their perimeters and areas. The radius of a digital disk is usually not well-defined, i.e., the same disk can have various radii according to the neighbourhood sequence used. Therefore the non-compactness ratio is used to measure the quality of approximation of the Euclidean circles. The best approximating neighbourhood sequence is presented. It is shown that the approximation can be improved using two neighbourhood sequences in parallel. Comparisons to other approximations are also shown.