An Integrated Evolutionary Algorithm for Expensive Global Optimization

We propose an integrated algorithm named low dimensional simplex evolution extension (LDSEE) for expensive global optimization in which only a very limited number of function evaluations is allowed. The new algorithm accelerates an existing global optimization, low dimensional simplex evolution (LDSE), by using radial basis function (RBF) interpolation and tabu search. Different from other expensive global optimization methods, LDSEE integrates the RBF interpolation and tabu search with the LDSE algorithm rather than just calling existing global optimization algorithms as subroutines. As a result, it can keep a good balance between the model approximation and the global search. Meanwhile it is self-contained. It does not rely on other GO algorithms and is very easy to use. Numerical results show that it is a competitive alternative for expensive global optimization.

Compact universal logic gates realized using quantization of current in nanodevices

This paper proposes novel universal logic gates using the current quantization characteristics of nanodevices. In nanodevices like the electron waveguide (EW) and single-electron (SE) turnstile, the channel current is a staircase quantized function of its control voltage. We use this unique characteristic to compactly realize Boolean functions. First we present the concept of the periodic-threshold threshold logic gate (PTTG), and we build a compact PTTG using EW and SE turnstiles. We show that an arbitrary three-input Boolean function can be realized with a single PTTG, and an arbitrary four-input Boolean function can be realized by using two PTTGs. We then use one PTTG to build a universal programmable two-input logic gate which can be used to realize all two-input Boolean functions. We also build a programmable three-input logic gate by using one PTTG. Compared with linear threshold logic gates, with the PTTG one can build digital circuits more compactly. The proposed PTTGs are promising for future smart nanoscale digital system use.

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

基于进化计算的无人飞行器多航迹规划

针对飞行器多航迹规划问题展开研究.在分析多峰值函数优化问题的基础上,提出了一种基于进化计算的飞行器多航迹规划方法.该方法通过使用特定的染色体表示方法和进化算子,可以有效利用各种环境信息,处理各种航迹约束.同时,通过引入聚类算法,将种群中的个体按其空间分布进行聚类,生成若干个不同子种群.在进化过程中,所有个体只在各自的子种群内部进化.当进化结束时,每个子种群将分别生成一条各自的最优航迹,从而为飞行器生成多条不同的可选航迹.仿真结果表明了该方法的有效性.

一种基于进化计算的空间飞行器编队重构轨道规划方法

基于进化算法提出了一种两层结构的空间飞行器编队重构的轨道规划算法,高层算法通过优化构型映射来优化编队的总燃耗,实现全局规划并确保飞行器之间保持一定的安全距离以避免相互碰撞;低层规划算法采用Chebyshev多项式逼近控制变量空间,为每颗飞行器规划满足约束条件的最优轨道。该方法充分利用了编队的分布式结构,由各飞行器并行实现各自的轨道规划,能有效解决大型编队的轨道规划问题。仿真结果表明了该方法的有效性。

Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques

In this paper, as an extension of minimum unsatisfied linear relations problem (MIN ULR), the minimum unsatisfied relations (MIN UR) problem is investigated. A triangle evolution algorithm with archiving and niche techniques is proposed for MIN UR problem. Different with algorithms in literature, it solves MIN problem directly, rather than transforming it into many sub-problems. The proposed algorithm is also applicable for the special case of MIN UR, in which it involves some mandatory relations. Numerical results show that the algorithm is effective for MIN UR problem and it outperforms Sadegh's algorithm in sense of the resulted minimum inconsistency number, even though the test problems are linear.

寻找布尔函数的零化子

通过解方程组来研究密码系统,是代数攻击的研究内容代.对方程组降次是降低求解复杂度的一种重要方法.为了达到这个目的,引入了布尔函数零化子的概念.然而迄今为止,尚未有求解零化子的有效算法.这篇文章提出了一种计算给定布尔函数的零化子集的算法.由前两个算法,可以得到给定布尔函数的零化子集的一组基;从第三个算法,可以得到最低次数的零化子.算法的复杂度与函数的单项式个数相关.对流密码来说,在很多情况下,相比以前的算法而言,这种算法的复杂度大为降低.最后,我们将给出一个实例,说明算法是如何工作的.

ALGORITHM FOR COMPUTER PERCEPTION OF TOPOLOGICAL SYMMETRY

For the exhaustive and irredundant generation of candidate structures in ESESOC (Expert System for the Elucidation of the Structures of Organic Compounds), a new algorithm for computer perception of topological equivalence classes of the nodes (non-hydrog

on quadratic bent functions in polynomial forms

In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work. Moreover, we solve a problem left by Yu and Gong in 2006.