Simultaneous stabilization for a set of Boolean control networks

This paper investigates simultaneous stabilization of a collection of Boolean control networks (BCNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of the BCNs is obtained by the semi-tensor product, based on which some necessary and sufficient conditions are presented to solve the simultaneous stabilization problem by a free control sequence, a state-feedback control, and an output-feedback control, respectively. Second, using the column stacking form of matrices, a new procedure is established to design both state-feedback and output-feedback controllers for the simultaneous stabilization problem. The study of two illustrative examples shows that the new results obtained in this paper are very effective in solving simultaneous stabilization of a collection of BCNs.     

Output feedback stabilization control design for Boolean control networks

This paper investigates the output feedback stabilization of Boolean control networks (BCNs) by using the semi-tensor product method and presents a number of new results. First, based on the algebraic expression of BCNs, a necessary and sufficient condition is presented for the existence of output feedback stabilizers. Second, a constructive procedure is proposed to design output feedback stabilization controllers for BCNs. The study of an illustrative example shows that the new results obtained in this paper are very effective in designing output feedback stabilizers for BCNs.     

半Bent函数和多输出布尔函数的构造

半bent函数是一类非线性度几乎最优且平衡的布尔函数,它弥补了bent函数的一些不足,如变元个数可以是奇数,具有平衡性.半bent函数可用于对称密码系统的设计和CDMA系统中的正交可变扩频码的构造.本文利用不相交线性码构造了一类新的半bent函数,设输入维度为n,当n=2k+1时,将F2^n划分为2^k+1个[n,k]线性码和1个[n,k+1]线性码,通过从该码集中选取合适线性码作支撑集来构造新的半bent函数.另一方面,多输出布尔函数(向量值函数)在应用中的效率更高,因此其使用场景更为广泛.本文同时利用不相交线性码构造了(n,n-k)平衡的多输出布尔函数,其中n/3相似文献   

Weak Schur numbers and the search for G.W. Walker’s lost partitions

A set A of integers is weakly sum-free if it contains no three distinct elements x,y,z such that x+y=z. Given k≥1, let WS(k) denote the largest integer n for which {1,…,n} admits a partition into k weakly sum-free subsets. In 1952, G.W. Walker claimed the value WS(5)=196, without proof. Here we show WS(5)≥196, by constructing a partition of {1,…,196} of the required type. It remains as an open problem to prove the equality. With an analogous construction for k=6, we obtain WS(6)≥572. Our approach involves translating the construction problem into a Boolean satisfiability problem, which can then be handled by a SAT solver.     

Free binary decision diagrams for the computation of EAR n

Free binary decision diagrams (FBDDs) are graph-based data structures representing Boolean functions with the constraint (additional to binary decision diagram) that each variable is tested at most once during the computation. The function EAR_n is the following Boolean function defined for n × n Boolean matrices: EAR_n(M) = 1 iff the matrix M contains two equal adjacent rows. We prove that each FBDD computing EAR_n has size at least and we present a construction of such diagrams of size approximately .     

基于布尔剪枝的多值广义量词Tableau推理规则简化方法

Tableau作为自动推理的有效方法之一在许多领域中有重要的应用．该文作者在已提出的布尔剪枝方法基础上,对含广义量词（交和并）规则的简化方法进行研究,建立了一套含广义量词的一阶多值逻辑公式的简化Tableau推理方法．通过实例分析,对简化前后结果对比表明,改进后的Tableau方法,在推理效率上有很大的提高．     

UnitWalk: A new SAT solver that uses local search guided by unit clause elimination

In this paper we present a new randomized algorithm for SAT, i.e., the satisfiability problem for Boolean formulas in conjunctive normal form. Despite its simplicity, this algorithm performs well on many common benchmarks ranging from graph coloring problems to microprocessor verification. Our algorithm is inspired by two randomized algorithms having the best current worst-case upper bounds ([27,28] and [30,31]). We combine the main ideas of these algorithms in one algorithm. The two approaches we use are local search (which is used in many SAT algorithms, e.g., in GSAT [34] and WalkSAT [33]) and unit clause elimination (which is rarely used in local search algorithms). In this paper we do not prove any theoretical bounds. However, we present encouraging results of computational experiments comparing several implementations of our algorithm with other SAT solvers. We also prove that our algorithm is probabilistically approximately complete (PAC).     

面向图像局部重建的梯度分析

在基于场方向导数的图像局部区域重建过程中,梯度计算对图像边缘的重建效果有很大影响。分析选择单向计算梯度分量的必要性,提出梯度计算的就近原则,对参与梯度分量单向计算的相邻点设置优先级,将缺损点与已知点之间的边缘特征反映在已知点的梯度中,进而影响重建过程,从而实现对图像中边缘特征的重建。实验结果表明,采用该梯度计算模式能有效改善对图像边缘特征的重建效果。     

Boolean network representation of a continuous-time system and finite-horizon optimal control: application to the single-gene regulatory system for the lac operon

In this paper, the single-gene regulatory system for the lac operon is considered and a method to build a Boolean network able to represent its dynamics is given. A procedure, based on techniques borrowed from algebraic geometry, to compute an optimal control policy minimising a cost function is given for such a Boolean network. A tool to apply such an optimal control policy to the continuous-time system is reported. The proposed control method is tested in two simulative examples.