An introduction to Wu's method for mechanical theorem proving in geometry

Wu's algebraic method for mechanically proving geometry theorems is presented at a level as elementary as possible with sufficient examples for further understanding the complete method.The work reported here was supported by NSF Grant DCR-8503498.     

Notes on Ginsberg's multivalued logics

The use of multivalued logics for knowledge representation and nonmonotonic reasoning has often been advocated, in particular within the general framework proposed by Ginsberg in his paper "Multivalued logics: a uniform approach to reasoning in artificial intelligence." His system is based on a multivalued logic with an arbitrary number of truth values classified with respect to two partial orders, a truth order and a knowledge order. This classification is very interesting and gives an intuitive appeal to the framework. In this paper the work by Ginsberg is critically reviewed, pointing out some flaws and ways to overcome them. Moreover, we present some ideas on how to modify the original schema in order to obtain a more semantically well-founded framework.
L'utilisation de la Iogique multivalente pour la représentation des connaissances et le raisonnement non monotone a souvent été préconisée, en particulier à l'intérieur du cadre général proposé par Ginsberg dans son article intitulé〘 Multivalued logics: a uniform approach to reasoning in artificial intelligence 〙 Son système est basé sur une logique multivalente comportant un nombre arbitraire de valeurs de vérité classées selon deux ordres partiels: un ordre de vérité et un ordre de connaissances. Cette classification est très intéressante et donne un attrait intuitif au cadre. Dans cet article, l'auteur examine le travail de Ginsberg, y relève des lacunes et propose des moyens de les corriger. De plus, il expose certaines idées en vue de modifier le schéma original et ainsi obtenir un meilleur cadre du point de vue de la sémantique.     

渐变填充的性质和算法

本文着重研究了Jordan数字流形上的渐变填充,设计了紧缩渐变填充算法和分裂渐变填充算法;并证明:如果D是离散网格空间上的Jordan凸集,那么存在O(|D||D|)时间的紧缩算法去做渐变填充.最后,我们对Jordan正方形区域、三角域和圆盘,分别给出了它们各自的O(|D|log_2|D|)时间的分裂渐变填充算法.     

Design of High Speed AWGN Communication Channel Emulator

This paper presents a method for designing a high accuracy white gaussian noise generator suitable for communication channel emulation. The proposed solution is based on the combined use of the Box-Muller method and the central limit theorem. The resulting architecture provides a high accuracy AWGN with a low complexity architecture for a digital implementation in FPGA. The performance is studied by means of MATLAB simulations and various complexity figures are given.     

Existence, uniqueness and stability of the equilibrium points of a SHARON bioreactor model

This paper addresses the dynamics of a SHARON reactor, a promising technology for ammonium removal from concentrated wastewater streams. The contraction mapping theorem is used to determine which operating conditions of a SHARON reactor with pH-control result in a unique equilibrium state. However, this approach only identifies the case of very large dilution rates, in practice corresponding with complete biomass wash-out, i.e. with complete loss of biological activity. Practical operation of a SHARON reactor aims at reaching ammonium conversion to nitrite. To identify such interesting operating points, the equilibrium points are subsequently calculated directly in terms of input variables for a simplified SHARON reactor model. The stability of the obtained equilibrium points is assessed and the corresponding phase portraits are analyzed. The influence of slightly varying parameter and input values is investigated as well.     

Index of critical points in rational l-approximation

This article is concerned with the l²-approximation of a given transfer function f by a rational one whose order is prescribed. We show that the sum of the indices of the critical points of the criterion is generically equal to 1, and in particular does not depend on f.     

最大重迭对称性分子轨道和分子几何参数计算

建立了AMl级别的最大重迭对称性分子轨道计算方案(MOSMO)。采用通常的半经验分子轨道方法AMl级别中完全相同的参数，计算了各种分子的几何参数等。所得计算结果与实验值及HF／6-31G*从头算方法计算结果相符，说明提出的计算方案是可行的。同时，由于提出的计算方案过程简单，更易推广使用到从头算方法难以解决的大分子体系和超分子体系的结构和性质研究。     

Evaluation codes at singular points of algebraic differential equations

We use the special geometry of singular points of algebraic differential equations on the affine plane over finite fields to study the main features and parameters of error correcting codes giving by evaluating functions at sets of singular points. In particular, one gets new methods to construct codes with designed minimum distance. This work was partially supported by MCyT BFM2001-2251.     

Step response classification for model-based autotuning via polygonal curve approximation

A model-based autotuning method consists of an identification and a regulator tuning phase. To achieve satisfactory performance and robustness, it is advisable that both phases be tailored a priori to the characteristics of the observed process dynamics. Such characteristics include, but are not limited to, the model structure. For example, overdamped and underdamped models with the same pole-zero structure are parametrised and controlled in different ways. Step response data, that are typically used for the identification phase in the autotuning context, can also be pre-processed to reveal those characteristics. This paper presents a step response classification method suitable for the above purpose. The method is based on a polygonal curve approximation technique for data pre-processing, followed by a neural network classifier. Only normalised I/O data are employed, so that the neural network can be trained off-line with simulated data. Simulation results are reported to show the effectiveness of the proposed classification method in terms of the achievable tuning results.     

A constructive approach to sequential Nash equilibria

We present a Coq-formalized proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCF-style theorem provers, i.e., it is based on inductive definitions and is computational in nature. The proof (i) uses simple computational means, only, (ii) basically is by construction, and (iii) reaches a constructively stronger conclusion than informal efforts. We believe the development is a first as far as formalized game theory goes.