一类构造性几何不等式的机器证明

阐述了一个基于胞腔分解的不等式证明算法．据此算法编制的Maple通用程序能有效地处理含有根式的不等式型定理,对于Bottema等所著《几何不等式》一书中的大部分不等式定理的验证尤其高效．     

一个有效的公开可验证的秘密共享方案

文献[1]首次提出的公开可验证的秘密共享方案在安全多方计算协议的设计中有重要作用,然而[1]提出的两个具体的方案在公开验证参与者收到共享的有效性时,需要进行大量的计算,因而是不实用的.本文提出一个共享给定公开值的秘密方幂的PVSS(SP-PVSS),该方案大大减少了共享有效性验证的计算量,具有更好的实用性.     

一种求解混合约束问题的快速完备算法

布尔与数值变量相混合的约束问题有着广泛的应用,但是当约束中的数值变量间存在非线性关系时该问题求解起来十分困难.目前的许多求解方法都是不完备的,即这些方法不能完全肯定某些包含非线性数值表达式的约束是否能够成立.针对这种问题,提出了数值与区间分析相结合进行数值约束求解的方法.已经实现了一个基于此方法的原型工具.实验结果表明,该方法能够有效、快速、完备地求解非线性混合约束问题.     

一个用于指针程序验证的自动定理证明器的设计与实现

对高可信软件需求的增加使得指针程序的验证成为近期的研究热点.指针逻辑作为Hoare逻辑的扩展,可以对指针程序进行精确的分析.介绍一个针对指针逻辑的自动定理证明器的设计和实现,描述了一些算法.实验结果表明,该定理证明器可以完全自动的证明用类C语言编写的关于单链表,双链表和二叉树的指针程序的验证条件,并生成机器可检查的证明.     

求解非线性区间数规划的微免疫优化算法研究

基于区间分析和免疫学原理,探讨非线性区间数规划问题解的概念和性质,以及求解的免疫优化方法和算法的理论基础.首先,基于该问题的最优值区间,给予最优解概念;研究区间值优化问题有效解的性质,探讨区间自然扩张规划与区间数规划的解之间联系,获得有效解是最优解的充分条件以及寻优的有效途径.其次,基于免疫应答的简化机制,设计具有群体规模小、可调参数少、结构简单等特点的非主从结构微免疫优化算法,并获证该算法具有收敛性和低计算复杂度.通过扩展标准测试函数和应用事例,比较性的数值实验结果显示,此算法执行效率高、搜索效果好,对低、偏高维非线性区间数规划具有较好应用潜力.     

常用基本不等式的机器证明

不等式机器证明问题是智能系统领域的难点和热点问题.借助不等式证明软件BOTTEMA,对若干常用的基本不等式成功地实现了机器证明,包括算术、几何与调和平均不等式、排序不等式、Chebyshev不等式、Bernoulli不等式、三角形不等式及Jensen不等式等.所论不等式含有的变元个数是一个不确定的变量,属于Tarski模型外的不等式类型.机器证明得出的结论有时可能是已知结果的推广,其方法本身对同类不等式有示范性,更多的例子表明了该算法和软件的有效性.     

面向对象编程与定量证明相结合实现问题自动求解

本文针对一类智能决策支持系统中，基于模型行为仿真以实现解题过程自动化的需要，提出对模型对象行为的一阶词演算型表达和面向对象型模型处理过程的形式化体系。将问题自动求解过程转化为逻辑运算问题，通过归结反演求取问题的解。文中给出一个应用实例。     

非线性方程求解的泛灰数学方法

在概述泛灰数的概念及其运算规则的基础上,介绍了泛灰数与区间数的转化,利用泛灰数的可扩展性对区间进行分析.根据对求解区间的泛灰函数性质(如果在区间上有解,则0∈F(X))进行判定是否有解,剔除无解区间,细化有解区间,从而求解非线性方程的全部解.泛灰数不仅具有区间分析功能,且能解决区间分析所不能解决的问题.基于泛灰数的性质提出了求解非线性方程的一种新方法.算例证明了算法的有效性,该方法已成功地用于求解机构学问题.     

执行器硬件冗余度求解算法

针对一类线性系统,根据已有的保性能状态反馈控制器的存在条件,设计完成状态反馈控制器.针对由状态反馈控制器构成的闭环系统,分析执行器各通道增益误差与保性能指标之间的关系.考虑执行器的增益误差模型,提出执行器增益误差的容忍区间,容忍因子和硬件冗余度的概念.进而,利用线性矩阵不等式(LMI)的优化理论,给出确定容忍区间、容忍...     

区间非线性路径约束的动态优化问题求解

本文研究路径约束中含有区间参数形式的动态优化问题,提出了一种新的非线性路径约束的确定化描述形式,和采用惩罚函数法的求解算法。对于转化后的极大极小优化命题,论文提出采用Lagrangian多项式加权和的方法得到有限维的确定性优化求解形式。该算法可有效地描述和求解不确定参数动态优化问题。     

Solution to the Generalized Champagne Problem on simultaneous stabilization of linear systems

The well-known Generalized Champagne Problem on simultaneous stabilization of linear systems is solved by using complex analysis and Blondel’s technique. We give a complete answer to the open problem proposed by Patel et al., which auto-matically includes the solution to the original Champagne Problem. Based on the recent development in automated inequality-type theorem proving, a new stabiliz-ing controller design method is established. Our numerical examples significantly improve the relevant results in the literature.     

开放式两级车辆路径问题建模与多起始点变邻域下降法求解

针对城市物流中普遍存在的物资开放式两级配送情形,构建了开放式两级车辆路径问题的数学模型,它要求物资必须先由远程的中心仓库配送至转运中心(第一级),再由转运中心配送至客户点(第二级),两级车辆在完成各自的配送任务后,均不必返回出发点,若要返回,则必须按照原路返回。为有效求解该NP难问题,设计了一种多起始点变邻域下降算法。扩展算例的测试结果表明,所设计的算法注重求解质量与求解效率的平衡,可有效求解提出的开放式两级车辆路径问题。     

Accuracy of Approximation of a Solution to an Abstract Cauchy Problem

A constructive image of the solution to a homogeneous Cauchy problem in a Banach space with a densely specified linear closed logarithmically-sector operator is investigated. The uniform accuracy of estimation of an approximate solution in t ≥ 0 is proved. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 145–152, May–June 2005.     

A Novel Solution to the P4P Problem for an Uncalibrated Camera

We present a novel solution for the absolute camera pose and the camera calibration (effective focal length and aspect ratio) based on perspective four point (P4P) problem. By converting perspective transformation to affine transformation and using invariance to 3D affine transformation, we explore the relationship between the dual image of the absolute conic (DIAC) and the world coordinate of camera optical center and show how the coplanar and noncoplanar cases are cast into the problems of solving a quadratic polynomial equation and an eighth degree polynomial equation in a single variable respectively using only linear algebra. In particular, geometric configurations for infinite solutions of the coplanar case are explored. We also confirm the conclusion that the upper bound of eight real solutions for noncoplanar case is attainable by an example. The performance and usefulness of our novel solution are demonstrated by thorough testing on both synthetic and real data.     

Onk-positive satisfiability problem

An algorithm for solving the satisfiability problem is presented. It is proved that this algorithm solves 2-SAT and Horn-SAT in linear time andk-positive SAT (in which every clause contains at mostk positive literals) in timeO(|F|·ξ _n ^k ), where |F| is the length of inputF, n is the number of atoms occurring inF, and ξ _k is the greatest real number satisfying the equation . Compared with previous results, this nontrivial upper bound on time complexity could only be obtained fork-SAT, which is a subproblem ofk-positive SAT. Research partially supported by NSFC grant 221-4-1439. HUANG Xiong received his B.S. and M.S. degrees in computer science from Peking University in 1992 and 1995 respectively. Now he is a Ph.D. candidate in Beijing University of Aeronautics and Astronautics. His major research interests are design and analysis of algorithms, computational complexity, and satisfiability problem. LI Wei received his B.S. degree in mathematics from Peking University in 1966 and his Ph.D. degree in computer science from The University of Edinburgh in 1983. Since 1986, he has been a Professor in computer science at Beijing University of Aeronautics and Astronautics. He has published over 100 papers in the areas of concurrent programming languages, operational semantics, type theory, and logical foundation of artificial intelligence.     

A Generalized Solution of an Interactive Goal-Programming Problem

Interactive goal programming is considered as an interactive algorithm of finding generalized solutions of multicriterion problems.     

姚氏百万富翁问题的高效解决方案

姚氏百万富翁问题是安全多方计算的典型问题,但已有解决方案多数存在效率低的问题。通过采用０编码与１编码,将百万富翁问题转换为集合交集问题,提出一种基于可交换加密函数的百万富翁问题高效解决方案,并进行了安全性证明。该方案无需复杂的模指数运算,加解密运算为O(n),通信轮数为4,整体性能优于其他方案。