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

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

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

建立一种新的基于直线光流场从单目图像序列恢复刚体运动和结构的模型,推导出直线光流场与刚体的运动参数之间的关系,用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.     

应用Henon超混沌系统改进的图像加密

为提高混沌系统图像加密的安全性,提出了一种结合MD5信息摘要的混沌图像加密算法。新算法使明文的信息摘要值参与Henon超混沌系统的初始化,增强了明文的敏感性,也比一般的混沌系统更具复杂性。同时,改进的二进制密码流序列生成算法导致分组长度动态变化,进一步扰乱了混沌系统的原有特性及密码流的分组特征。理论分析和实验说明算法能有效地抵御选择明文攻击、差分攻击和分割攻击。     

基于新的超混沌系统的图像加密方案

提出了一个新的超混沌系统,分析了新系统的混沌吸引子相图、平衡点及其性质、工yapunov指数等非线性动力学特性,并用该超混沌系统对图像进行加密研究。给出了一种新的基于四维超混沌系统的图像加密算法。实验结果及安全性分析表明,该算法具有较强的抵御穷举攻击、统计攻击、已知明文攻击能力,因而具有较高的安全性。     

A connectionist inference model for pattern-directed knowledge representation

In this paper we propose a connectionist model for variable binding. The model is topology dependent on the graph it builds based on the predicates available. The irregular connections between perceptron-like assemblies facilitate forward and backward chaining. The model treats the symbolic data as a sequence and represents the training set as a partially connected network using basic set and graph theory to form the internal representation. Inference is achieved by opportunistic reasoning via the bidirectional connections. Consequently, such activity stabilizes to a multigraph. This multigraph is composed of isomorphic subgraphs which all represent solutions to the query made. Such a model has a number of advantages over other methods in that irrelevant connections are avoided by superimposing positionally dependent sub-structures that are identical, variable binding can be encoded and multiple solutions can be extracted simultaneously. The model also has the ability to adapt its existing architecture when presented with new clauses and therefore add new relationships/rules to the model explicitly; this is done by some partial retraining of the network due to the superimposition properties.     

基于概率速度场的实时船舶检测

为了准确及时获取船舶在船闸中的运动信息,提出了一种基于概率速度场的实时检测船闸中船舶的方法。该方法首先分析了船舶在船闸中运行的各种环境因素;其次为了消除和减弱阴影和光斑的影响,从监测图象灰度直方图中派生出一个高斯概率分布模型,进而获取图象的概率场;最后定义了一个基于光流计算的可实时检测船舶的概率速度场。该方法已成功地测试了大量通过三峡临时船闸和葛洲坝船闸的船舶序列图象。