基于公式真度的公式集约简

基于经典命题逻辑的真度理论,讨论了经典命题逻辑系统当中公式集的约简问题。提出了真度约简及α-真度约简的概念,为公式集的约简提供了一种可行的操作方法。     

Approximation by Chlodowsky-Taylor polynomials

The subject of this paper is to study the problem of the approximation of function of two variables by means of Chlodowsky-Taylor polynomials in a rectangular domain.     

On Controllability And Maximum Principle for Discrete Inclusions ∗ ∗A part of the paper was written while the first author was visiting the laboratory of Prof.S.Suzuki,Department of Mechanical Engineering,Sophia University,Tokyo,Japan$ef:

The paper develops sufficient conditions for controllability and necessary conditions in different forms of the maximum principle for extremal solutions of discrete inclusions. The objective function is assumed to be locally lipschitzian only     

Extensions of algorithmic senstivity calculations nonlinear programming using barrier and penalty functions

We provide a theoretical basis for approximating the sensitivity of a perturbed solution and the local optimalvalue function, using information generated by a sequential unconstrained minimization technique in the normal course of solving a mathematical program. We show that various algorithmic sensitivity results can be obtained without other assumptions than those needed for the corresponding nonalgorithmic results. Our results extend the algorithmic calculation of sensitivity information introduced by Fiacco, utilizing the logarithmic barrier function and quadratic penalty function     

Optimal error estimates for an approximation of degenerate parabolic problems

A fully discrete scheme for a class of multidimensional degenerate parabolic equations is proposed. The discretization is given by $supoesup piecewise linear finite elements in space and backward differences in time (the smoothing procedure is avoided). Numerical integration is used; hence the proposed method is easy to implement. Optimal error estimates in energy norms are proved for the solutions.     

Lexical Scope and Statistical Computing

Abstract

Programming environments such as S and Lisp-Stat have languages for performing computations, data storage mechanisms, and a graphical interface. These languages provide an interactive interface to data analysis that is invaluable. To take full advantage of these programming environments, statisticians must understand the differences between them. Ihaka and Gentleman introduced R, a version of S which uses a different scoping regimen. In some ways this makes R behave more like Lisp-Stat. This article discusses the concept of scoping rules and shows how lexical scope can enhance the functionality of a language.     

基于集值统计的模糊神经网络专家系统及其应用

建立基于集值统计的模糊神经网络专家评审系统,并应用于科研项目评审工作,实际应用表明该系统是可行的。     

临界情况下模糊矩阵对策的性质

讨论临界情况下模糊矩阵对策的性抽,对模型问题各种情况给出了临界值c*的定义,证明了当d(f1,f2)＜ε≤c*时,模糊矩阵对策模型问题关于价值函数f1(x)、f2(x)具有连续依赖性和可调和性。     

Compactness of Iterated Commutators on Weighted Bergman Spaces

Compactness of Iterated Commutators on Weighted Bergman Spaces@刘永民&&