Deductive tools of an algebraic programming system

A mathematical environment is a system of tools supporting interactive manipulation of knowledge represented in the form of (formalized) mathematical texts. A theoretical substantiation of a project proposed is the theory of interaction of agents and environments. At the present time, this theory is realized on the basis of a simulator of an action language developed in an algebraic programming system called APS. Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 17–34, January–February, 2000.     

Parallel inference search in logical calculus based on the algebraic programming system

Software for parallel inference search in propositional calculus is described and used to obtain experimental results. The software is based on the APS algebraic programming system and SCIT-1 cluster complex.     

有向几何编程在数控系统中的实现

在数控加工中,G代码描述的零件加工过程不够直观.为了解决这个问题,提出采用有向几何编程语言GPL(geometric programming language)来辅助G代码进行编程,使得编程变得简单直观.设计了GPL语法规则,并依据GPL语法规则设计实现了GPL解释器,提出一种计算检测码的方法对GPL语法进行检查,创建关键字的属性值表以支持检测码的计算.该方法使GPL语法规则容易扩展,便于解释器的二次开发.采用位运算方法进行参数的冲突检测,增强语法分析器的可扩展性,提高分析速度和效率.     

Optimizing compiler for the procedural subset of the algebraic programming language of the APS system

Conclusion An L2B-L2C optimizing compiler has been developed for compiling the procedural subset of the interpreted untyped language APLAN of the algebraic programming system APS into C. Controlled automatic compiling of procedures is regarded as a technological step toward efficient solution of problems in an algebraic programming environment. A distinctive feature of the compiler is that optimization is initiated by the user and relies on hierarchical algebraic specifications. If no specifications are present, the system guarantees compilation consistent with common APLAN semantics. The compiler is formally described on two levels. On the architectural level, we describe the general structure of the compiling process. The main data structures used for optimization are dictionaires of algebraic program components and expression type arrays. The semantic level of multialternative compiling of language constructs is represented in the language of relationships with selection of an appropriate translation alternative. The implementation of the proposed compiler requires a flexible support environment, which allows nonhomogeneous processing of an extended source language, in particular construction of static and dynamic information environments, compilation of the procedural part, and also analysis of the compiling environment, definition of the set of translations of procedural constructs, and selection of the best translation alternative for each particular case. An implementation of the proposed compiler is described in [13]. Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 3–16, November–December, 1995.     

Polynomial algorithms for linear programming over the algebraic numbers

We derive a bound on the computational complexity of linear programs whose coefficients are real algebraic numbers. Key to this result is a notion of problem size that is analogous in function to the binary size of a rational-number problem. We also view the coefficients of a linear program as members of a finite algebraic extension of the rational numbers. The degree of this extension is an upper bound on the degree of any algebraic number that can occur during the course of the algorithm, and in this sense can be viewed as a supplementary measure of problem dimension. Working under an arithmetic model of computation, and making use of a tool for obtaining upper and lower bounds on polynomial functions of algebraic numbers, we derive an algorithm based on the ellipsoid method that runs in time bounded by a polynomial in the dimension, degree, and size of the linear program. Similar results hold under a rational number model of computation, given a suitable binary encoding of the problem input.This research was founded by the National Science Foundation under Grant DMS88-10192.     

New improved algorithm for the iterative solution of a system of linear algebraic equations

The Coulomb functions f(?,l;?) and g(?,l;?) are required for applications of quantum defect theory; ? is the Z-scaled energy, l the angular momentum quantum number and ? the Z-scaled radial coordinate. The functions f and g are analytic in ?. Power-series expansions are used to compute f and g and their derivatives with respect to ?. The computed value of the Wronskian gives an indication of the accuracy achieved.     

Chord改进算法在文件共享系统的实现

Chord是一种比较有效的P2P路由算法,它能够快速地查找到该资源的位置。但Chord算法对网络中传送的消息利用率过低,路由表存在严重的信息冗余,网络维护量大。为此,提出了一种Chord的改进算法,解决了Chord算法中存在的一些问题,提高了网络查询效率,增强了网络的容错能力。将改进的Chord算法用于一个文件共享系统的设计,实践表明该Chord改进算法是有效的。     

An efficient algorithm for the discrete-time algebraic Riccatiequation

The authors develop an algorithm to solve the standard discrete-time algebraic Riccati equation by using a skew-Hamiltonian transformation and the square-root method. The algorithm is structure-preserving and efficient because the Hamiltonian structure is fully exploited and only orthogonal transformations are used. The efficiency and stability of the algorithm are analyzed, numerical examples are included     

基于改进PSRS的并行0-1规划算法

结合0-1整数规划的隐式枚举法对目标排序法进行分析.引入PSRS(并行正则采样排序)算法对目标排序法的核心运算进行并行化,并改进PSRS算法的数据收集策略以适应0-1整数规划的并行隐式枚举.最后给出了基于改进的PSRS的并行0-1整数规划的求解算法,并对算法的时间复杂度进行了分析.     

多目标0-1规划的混沌优化算法

多目标问题在现实中有广泛应用,如何获得更多非劣解具有重要意义。通过利用混沌运动的遍历性、随机性、规律性等特点,设计了一种求解多目标0-1规划问题的混沌优化算法,并在计算机上予以实现。该混沌优化算法计算时间复杂度较小,在计算效率上有一定优势。计算结果表明,与已有算法相比,该算法能求得较多非劣解,能够有效求解多目标0-1规划问题。     

非线性0-1规划问题的人工鱼群算法*

对于非线性 0-1规划问题,给出一种新的智能寻优方法——人工鱼群算法。利用罚函数将约束问题转换为相应的无约束问题,给出了人工鱼群算法的具体步骤,并用MATLAB软件实现编程。通过对多个非线性0-1规划问题的算例进行测试,并将测试结果与其他算法进行比较,结果表明,人工鱼群算法具有较快的收敛速度和较好的全局寻优能力,可以作为求解非线性 0-1规划问题的一种实用方法。     

基因选择的0-1规划模型和算法

基因选择是基因表达数据分析中的重点问题.然而现有的方法没有综合考虑样本不平衡和基因间的相互作用。借鉴聚类的验证技术提出了基因选择的0-1规划模型,同时考虑了样本不平衡和基因间的相互作用。进一步根据0-1规划模型的特点,给出了基于贪心思想的启发式算法来求解所提出的优化问题。在3个真实的基因表达数据上对提出的方法进行测试并与两个对照的方法比较,结果表明所提出模型和算法是有效的且稳健的。     

0-1非线性规划问题的改进差分进化算法

针对0-1非线性规划问题的特点,提出了一种适合于求解0-1非线性规划问题的改进差分进化算法。这个算法把差分进化算法和罚函数方法有机结合起来,在变异操作中加入0-1取整运算,在交叉操作中使用了指数递增交叉概率因子以提高算法的全局搜索能力和收敛速率。用8个例子进行了实验研究,结果表明这个改进的差分进化算法在收敛性、精度、鲁棒性强方面都比较好。