基于蕴涵算子θp模糊推理的三I与反向三I算法的约束度分析

研究基于蕴涵算子θp模糊推理的三I算法与反向三I算法的约束度理论, 分析约束度的性质,得到α-三I算法的FMP(FMT)上(下)确界计算公式与α-反向三I算法的FMP(FMT)下(上)确界的计算公式.     

参数Kleene系统的三Ⅰ算法与反向三Ⅰ支持算法

提出基于参数蕴涵算子θp模糊推理的思想,给出了在模糊推理的每一步都使用蕴涵运算pθ的三I算法与反向三I支持算法理论,得到了三I上确界算法、模糊取式算法(FM P)与模糊拒取式算法(FM T)的计算公式,这将有助于提高模糊推理结果的可靠性。     

模糊推理α-反向三I支持算法的一般表示

讨论模糊推理α-反向三I支持算法的表示问题,基于正则蕴涵算子建立α-反向三I支持算法的一般表示。如此,现有的α-反向三I支持算法的统一表示被推广到一种新的形式。     

基于蕴涵算子族L-λ-G的模糊推理三I支持算法

提出了基于蕴涵算子族L -λ-G的模糊推理的思想,这将有助于提高推理结果的效果.针对蕴涵算子族L-λ-G 给出了模糊推理的FMP模型及FMT模型的三I支持算法、α-三I支持算法.     

模糊推理反向三I的$R_L$型约束度分析

研究了基于蕴涵算子RL的模糊推理反向三Ⅰ方法的约束度理论,分析了约束度的性质,得到了一般化的α-反向三Ⅰ模糊取式下确界计算公式与α-反向三Ⅰ模糊拒取式上确界计算公式.     

θp型三I算法与反向三I算法支持度分析

研究了基于蕴涵算子以θp模糊推理的三Ⅰ算法与反向三Ⅰ算法的支持度理论，分析了支持度的性质，得到了α-三Ⅰ算法的FMP（FMT）计算公式与α-反向三Ⅰ算法的FMP（FMT）计算公式。     

基于完备BR_0-代数的全蕴涵三I算法

研究了基础BR0-代数的性质和基于完备基础BR0-代数的全蕴涵三I算法,对—般蕴涵算子给出了三I算法解存在的—个充分条件,并将结果应用于R0-单位区间W,不但极大的简化了R0-单位区间W的R0-型α-三I算法结果的证明,而且使其证明过程与相应的模糊命题演算系统结合起来,说明了R0-型三I算法是与B(?)*系统相匹配的模糊推理方法．     

模糊推理的α-三I算法

三I算法是针对模糊推理的FMP与FMT模型的一种新的推理方法。本文借助蕴涵算子的性质，针对满足一定条件的较一般蕴涵算子，建立了FMP与FMT模型的α-三I算法，并讨论了算法的还原性。     

基于蕴涵算子族L-λ-G的模糊推理三Ⅰ约束算法

提出了基于蕴涵算子族L-λ-G的模糊推理的思想,这将有助于提高模糊推理结果的效果. 针对蕴涵算子族L-λ-G给出了模糊推理的FMP模型及FMT模型的三I约束算法、α-三I约束算法.     

扰动值模糊推理的三I算法

以D2上的三角模及其伴随为基础,给出了扰动值模糊推理的三I算法,为模糊信息处理的方法和应用提供了新的理论基础。     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Towards Excellence in Science Chinese Academy of Sciences

<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

Boundedness of commutators related to Marcinkiewicz integrals on hardy type spaces

In this paper, the authors study the boundedness of the operator [μΩ, b], the commutator generated by a function b ∈ Lipβ(Rn)(0 ＜β≤ 1) and the Marcinkiewicz integrals μΩ, on the classical Hardy spaces and the Herz-type Hardy spaces in the case Ω∈ Lipα(Sn-1)(0 ＜α≤ 1).     

Jacobi polynomials used to invert the laplace transform

Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find an approximation to f(t) by the use of the classical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series expansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.     

Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.