Design of Feedback Shift Register of Against Power Analysis Attack

Stream ciphers based on linear feedback shift register (LFSR) are suitable for constrained environments, such as satellite communications, radio frequency identification devices tag, sensor networks and Internet of Things, due to its simple hardware structures, high speed encryption and lower power consumption. LFSR, as a cryptographic primitive, has been used to generate a maximum period sequence. Because the switching of the status bits is regular, the power consumption of the LFSR is correlated in a linear way. As a result, the power consumption characteristics of stream cipher based on LFSR are vulnerable to leaking initialization vectors under the power attacks. In this paper, a new design of LFSR against power attacks is proposed. The power consumption characteristics of LFSR can be masked by using an additional LFSR and confused by adding a new filter Boolean function and a flip-flop. The design method has been implemented easily by circuits in this new design in comparison with the others.     

磁浸没透镜的宽束曲轴像差分析的微分代数方法研究

微分代数是计算机数值分析领域中的一个非常有效的方法,可以实现任意高阶微分的准确计算.本文根据微分代数方法的基本原理,将其引入到磁浸没透镜的宽束曲轴像差的分析计算中,得到了任意阶曲轴像差的微分代数表达式.文中针对轴上磁场具有某种解析表达式的一个实际的磁浸没透镜系统,利用微分代数的曲轴像差分析方法,计算了它的曲轴像差,并给出了全部二阶和三阶几何像差的分布图形.     

Boole函数的线性可分性(Ⅰ)——n-维超立方体的基本理论

Boole函数的线性可分性是前向人工神经网络理论中的一个比较困难的问题之一。目前仅对变量数n≤7的某些问题给予讨论。当n≥8时,尚无判别Boole函数线性可分的一般准则,更无线性可分Boole函数的计数公式。基于此,本文详细地研究了与Boole函数线性可分性有关的n-维超立方体的基本理论,包括n-维超立方体的基本性质、超立方体中的平行线、子超立方体的计数等,并给出了构造n-维超立方体图的一种新方法。     

二维谐振子与二维氢原子的能量及波函数

借助于ＳＵ(１,１)代数,找出了二维谐振子与二维氢原子的能量及波函数间的关系．     

Revising threshold functions

A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in terms of the resource one is interested in) is polynomial in the syntactic distance between the initial and the target concept, but only polylogarithmic in the number of variables in the universe. We give an efficient revision algorithm in the model of learning with equivalence and membership queries for threshold functions, and some negative results showing, for instance, that threshold functions cannot be revised efficiently from either type of query alone. The algorithms work in a general revision model where both deletion and addition type revision operators are allowed.     

复合布尔函数中含某单乘积项的快速判定算法

引入了布尔函数的基本积、单乘积项等概念，通过实例剖析了复合布尔函数中是否含某一单乘积项的一般判定方法，在该基础上提出了一种快速判定途径，并给出了快速判定算法的具体描述，同时对算法进行了实验，结果表明该算法快速有效。     

Peirce algebras

We present a two-sorted algebra, called aPeirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a set-forming operator on relations (the Peirce product of Boolean modules) and a relation-forming operator on sets (a cylindrification operation). Two applications of Peirce algebras are given. The first points out that Peirce algebras provide a natural algebraic framework for modelling certain programming constructs. The second shows that the so-calledterminological logics arising in knowledge representation have evolved a semantics best described as a calculus of relations interacting with sets.     

The rank one mixed μ problem and ‘kharitonov-type’ analysis

The general mixed μ problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed μ problem. We show that for this case the mixed μ problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so-called ‘affine parameter variation’ problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated ‘Kharitonov-type’ results have been proven.     

基于泛布尔代数的结构振动控制机理

本文介绍了泛布尔代数的数学模型、公理体系和化简方法 ;针对高层建筑的特点 ,舍弃寻求被控制对象的精确数学模型 ,提出了“基于泛布尔代数的结构振动控制” ,分析了其的逻辑机理 ,建立了基于泛布尔代数的MR阻尼器的半主动控制算法。应用本文提出的控制方针对 12层的高层结构受控地震反应的模拟仿真 ,结果表明其控制简单、灵活、方便 ,能满足这种结构的控制要求。