A Galerkin finite element scheme for time–space fractional diffusion equation

In this paper, a Galerkin finite element scheme to approximate the time–space fractional diffusion equation is studied. Firstly, the fractional diffusion equation is transformed into a fractional Volterra integro-differential equation. And a second-order fractional trapezoidal formula is used to approach the time fractional integral. Then a Galerkin finite element method is introduced in space direction, where the semi-discretization scheme and fully discrete scheme are given separately. The stability analysis of semi-discretization scheme is discussed in detail. Furthermore, convergence analysis of semi-discretization scheme and fully discrete scheme are given in details. Finally, two numerical examples are displayed to demonstrate the effectiveness of the proposed method.     

A characterization of span program size and improved lower bounds for monotone span programs

We give a characterization of span program size by a combinatorial-algebraic measure. The measure we consider is a generalization of a measure on covers which has been used to prove lower bounds on formula size and has also been studied with respect to communication complexity.?In the monotone case our new methods yield lower bounds for the monotone span program complexity of explicit Boolean functions in n variables over arbitrary fields, improving the previous lower bounds on monotone span program size. Our characterization of span program size implies that any matrix with superpolynomial separation between its rank and cover number can be used to obtain superpolynomial lower bounds on monotone span program size. We also identify a property of bipartite graphs that is suficient for constructing Boolean functions with large monotone span program complexity. Received: September 30, 2000.     

误差最小的计算机插补原理

从包括的思想出发,解决了对单调光滑函数曲线构造一个带域,在此带域中所确定的绘图路径是误差最小的。另外,文中应用带域提出了一种误差最小插补法,得到递推公式,每次要计算的是进给步数,跟过去一贯采用的每走一步都要计算判别函数的传统方法比较,具有较强的优越性,最后给出计算实例。     

Some quadrature formulas for functions partially holomorphic with respect to each variable in a Jordan polydomain in C 2 and a complex double integral formula

In this paper, quadrature formulas with remaining term in integral form for functions partially holomorphic with respect to each variable in a Jordan polydomain in C ² and a complex double integral formula are given. For this, we used the Cauchy Integral formula for Jordan polydomain in C ².     

Robust projection method for Fredholm integral equation of the second kind

The projection method based on the Schauder basis expansion for solving the Fredholm integral equation of the second kind is investigated. (1) It is shown that any given finite linearly independent function set in L ^p [0, 1] can be extended as a Schauder basis. The truncation of the dual Schauder bases is then used to form the projection in approximating the kernel. (2) With the finite rank approximation, the use of the Sherman–Morrison–Woodbury formula achieves efficient implementation. The computation is successive when dimension of projection space increases. Numerical experiments demonstrate the robustness of the Schauder basis expansion.     

The numerov alternating group explicit (numage) method:

In this paper, more accurate solutions are obtained by applying the Numerov formula to the Alternating Group Explicit (AGE) method in the solution of linear and non-linear two point boundary value problems.     

Presentation数学公式到Content转换关键问题研究

数学公式在计算机中的存储和表示格式多种多样,数学公式搜索中需要将各种格式的数学公式相互转换,从而为用户提供更为丰富搜索结果。从数学公式的用途和目的来看,计算机中的数学公式格式可分为Presentation型和Content型。主要研究和总结Presentation型数学公式到Content型数学公式的关键问题,提出基于类型系统的数学公式歧义推测方法,能够有效解决转换中的公式歧义问题。     

钢丝铅淬火在炉加热时间的控制

对影响钢丝加热时间的因素进行了分析,根据作者总结出的对钢丝在炉加热时间计算的经验公式,对现有的热处理工艺进行调整,实践验证,能满足生产要求,提高了热处理钢丝产量.     

On the Logical Foundations of Compound Predicate Formulae for Legal Knowledge Representation

In order to represent legal knowledge adequately, it is vital to create a formal device that can freely construct an individual concept directly from a predicate expression. For this purpose, a Compound Predicate Formula (CPF) is formulated for use in legal expert systems. In this paper, we willattempt to explain the nature of CPFs by rigorous logical foundation, i.e., establishing their syntax and semantics precisely through the use of appropriate examples. We note the advantages of our system over other such systems and discuss the significance of CPFs with regard to the formalization of legal reasonings using examples from the United Nations Convention for the International Sale of Goods.