高维热传导方程的高精度分支显格式

A high-order accuracy explicit difference scheme for solving 4-dimensional heatconduction equation is constructed.The stability condition is r = △t/△x2 = △t/△y2 = △t/△]z2 = △t/△w2＜3/8,and the truncation error is O(△t2 △x4).     

解抛物型方程的分支稳定的高精度显式差分格式

用待定参数法构造了解一维抛物型方程的分支稳定的高精度显式差分格式,截断误差为O（△t^4△x^4),稳定性条件为r=a△t/△x^2＜1/2。     

高阶抛物型方程的一族高精度恒稳差分格式

A family of three-layer implicit difference Schemes of high accuracy with two parameters for solving high order parabolic equationδu/δt=(-1)^m 1δ^2mu/δx^2m(where m is positive integers) are constructed. In the special case α=1/2, β=0, We obtain a two-layer difference scheme. These schemes are proved to be absolutely stable for arbiratily chosen non-negative parameters, And the order of the truncation error is O((△t)^2 (△x)^6). They are shown by numerical examples to be effective, and practice consistant with theoretical analysis.     

OSCILLATION CRITERIA FOR SECOND ORDER NONLINEAR DYNAMIC EQUATIONS WITH p-LAPLACIAN AND DAMPING

This paper concerns the oscillation of solutions of the second order nonlinear dynamic equation with p-Laplacian and damping（r（t）φ（x^△（t））^△＋p（t）φα（x^△α（t）＋q（t）f（xδ（t））=0on a time scale T which is unbounded above. Sign changes are allowed for the coefficient functions r, p and q. Several examples are given to illustrate the main results.     

Low Regularity Solution of the Initial-Boundary-Value Problem for the ＂Good＂ Boussinesq Equation on the Half Line

we study an initial-boundary-value problem for the ＂good＂ Boussinesq equation on the half line
{δt^2u-δx^2u＋δx^4u＋δx^2u^2=0,t〉0,x〉0.
u（0,t）=h1（t）,δx^2u（0,t） =δth2（t）,
u（x,0）=f（x）,δtu（x,0）=δxh（x）.
The existence and uniqueness of low reguality solution to the initial-boundary-value problem is proved when the initial-boundary data （f, h, h1, h2） belong to the product space
H^5（R^＋）×H^s-1（R^＋）×H^s/2＋1/4（R^＋）×H^s/2＋1/4（R^＋）
1 The analyticity of the solution mapping between the initial-boundary-data and the with 0 ≤ s 〈 1/2. solution space is also considered.     

The Asymptotics of the Two-Dimensional Wave Equation for a General Multi-Connected Vibrating Membrane with Piecewise Smooth Robin Boundary Conditions

The asymptotic expansion for small |t| of the trace of the wave kernel ∧↑μ(t) =∑v=1^∞exp(-it μv^1/2), where i= √-1 and {μv}v=1^∞ are the eigenvalues of the negative Laplacian -△=-∑β=1^2(δ/δx^β)^2 in the (x^1, x^2)-plane, is studied for a multi-connected vibrating membrane Ω in R^2 surrounded by simply connected bounded domains Ωj with smooth boundaries δΩj(j=1,...,n), where a finite number of piecewise smooth Robin boundary conditions on the piecewise smooth components Гi(i=1 κj-1,...,κj) of the boundaries δΩj are considered, such that δΩj=∪i=1 κj-1^κj Гi and κ0=0. The basic problem is to extract information on the geometry of Ω using the wave equation approach. Some geometric quantities of Ω (e.g. the area of Ω, the total lengths of its boundary, the curvature of its boundary, the number of the holes of Ω, etc.) are determined from the asymptotic expansion of the trace of the wave kernel ∧↑μ(t) for small |t|.     

The 3D Inverse Problem of the Wave Equation for a General Multi-connected Vibrating Membrane with a Finite Number of Piecewise Smooth Boundary Conditions

The trace of the wave kernel μ（t） =∑ω=1^∞ exp（-itEω^1/2）, where {Eω}ω^∞=1 are the eigenvalues of the negative Laplacian -△↓2 = -∑k^3=1 （δ/δxk）^2 in the （x^1, x^2, x^3）-space, is studied for a variety of bounded domains, where -∞ 〈 t 〈 ∞ and i= √-1. The dependence of μ （t） on the connectivity of bounded domains and the Dirichlet, Neumann and Robin boundary conditions are analyzed. Particular attention is given for a multi-connected vibrating membrane Ω in Ra surrounded by simply connected bounded domains Ω j with smooth bounding surfaces S j （j = 1,……, n）, where a finite number of piecewise smooth Dirichlet, Neumann and Robin boundary conditions on the piecewise smooth components Si^＊ （i = 1 ＋ kj-1,……, kj） of the bounding surfaces S j are considered, such that S j = Ui-1＋kj-1^kj Si^＊, where k0=0. The basic problem is to extract information on the geometry Ω by using the wave equation approach from a complete knowledge of its eigenvalues. Some geometrical quantities of Ω （e.g. the volume, the surface area, the mean curvuture and the Gaussian curvature） are determined from the asymptotic expansion ofexpansion of μ（t） for small │t│.     

Asymptotic Behavior of Solution to Some Models Involving Two Species All with Chemotaxis

This paper is concerned with the asymptotic behavior of solution to the following model involving two species all with chemotaxis：{αp/αt=Dp△（p△lnp/w）,αp/αt=Dq△（q△lnq/w）,αw/αt=βp-δw,p△ln（p/w）.^-n=q△ln（q/w）.^-n=0.We prove that the solution exists globally asβ ≥ 0. Asβ 〈 0, whether the solution exists globally or not depends on the initial data. By function transformation and compari- son, the asymptotical behavior of the solution is studied.     

Local and Global Existence of Solutions to Initial Value Problems of Nonlinear Kaup-Kupershmidt Equations

This paper is devoted to studying the initial value problems of the nonlinear Kaup Kupershmidt equations δu/δt ＋ α1 uδ^2u/δx^2 ＋ βδ^3u/δx^3 ＋ γδ^5u/δx^5 = 0, （x,t）∈ E R^2, and δu/δt ＋ α2 δu/δx δ^2u/δx^2 ＋ βδ^3u/δx^3 ＋ γδ^5u/δx^5 = 0, （x, t） ∈R^2. Several important Strichartz type estimates for the fundamental solution of the corresponding linear problem are established. Then we apply such estimates to prove the local and global existence of solutions for the initial value problems of the nonlinear Kaup- Kupershmidt equations. The results show that a local solution exists if the initial function u0（x） ∈ H^s（R）, and s ≥ 5/4 for the first equation and s≥301/108 for the second equation.     

Existence Results for a Class of Semilinear Elliptic Systems

In this paper, we study the existence of nontrivial solutions for the problem
{-△u=f（x,u,v）＋h1（x）in Ω
-△v=g（x,u,v）＋h2（x）inΩ
u=v=0 onδΩ
where Ω is bounded domain in R^N and h1,h2 ∈ L^2 （Ω）. The existence result is obtained by using the Leray-Schauder degree under the following condition on the nonlinearities f and g：
{lim s,｜t｜→＋∞f（x,s,t）/s=lim ｜s｜,t→＋∞g（x,s,t）/t=λ＋1 uniformly on Ω,
lim -s,｜t｜→＋∞f（x,s,t）/s=lim ｜s｜,-t→＋∞g（x,s,t）/t=λ-,uniformly on Ω,
where λ＋,λ-∈（0）∪σ（-△）,σ（-△）denote the spectrum of -△. The cases （i） where λ＋ = λ_ and （ii） where λ＋≠λ_ such that the closed interval with endpoints λ＋,λ_ contains at most one simple eigenvatue of -△ are considered.     

A refinement of a compression-oriented addressing scheme

Chang and Wu have proposed a letter-oriented perfect hashing scheme based on sparse matrix compression. We present a method which is a refinement of the Chang-Wu scheme. By experimental evaluation, we show that the hashing of our refinement has more efficient storage utilization than Chang-Wu's method. Our refinement is valuable in practical implementations of hashing for large sets of keys.     

Constructing a binary tree from its traversals

This paper shows that a binary tree can be constructed from its preorder and inorder traversals in linear time and space.     

On the dynamization of data structures

In this paper we present a simple dynamization method that preserves the query and storage costs of a static data structure and ensures reasonable update costs. In this method, the majority of data elements are maintained in a single data structure, and the updates are handled using smaller auxiliary data structures. We analyze the query, storage, and amortized update costs for the dynamic version of a static data structure in terms of a functionf, such thatf(n)<n, that bounds the sizes of the auxiliary data structures (wheren is the number of elements in the data structure). The conditions onf for minimal (with respect to asymptotic upper bounds) amortized update costs are then obtained. The proposed method is shown to be particularly suited for the cases where the merging of two data structures is more efficient than building the resultant data structure from scratch. Its effectiveness is illustrated by applying it to a class of data structures that have linear merging cost; this class consists of data structures such as Voronoi diagrams, K-d trees, quadtrees, multiple attribute trees, etc.     

Efficient algorithms for tree reconstruction

In this note, we show thatO(n logn) operations are sufficient to reconstruct an ordered binary tree given its inorder traversal and either its preorder or postorder traversal. An alternative linear representation allows reconstruction usingO(n) operations.     

Page usage in a quadtree index

This paper provides a characterization of the storage needs of a quadtree when used as an index to access large volumes of 2-dimensional data. It is shown that the page occupancy for data in random order approaches 33%. A precise mathematical analysis that involves a modicum of hypergeometric functions and dilogarithms, together with some computer algebra is presented.A brief survey of the analysis of storage usage in tree structures is included. The 33% ratio for quadtrees is to be compared to the figures for binary search trees (50%), tries (69%), and quadtries (46%).The research of this author was done while visiting INRIA, Rocquencourt, France under support from the Ministry of Education of Japanese Government.Work of this author was supported in part by the Basic Research Action of the E.C. under contract No. 3075 (Project ALCOM).     

Algebraic radicals and incidence algebras

In this note we prove the uniqueness of U in a group G with a spherical split-BN-pair of rank ,i.e., if G has such a BN-pair with a nilpotent normal subgroup of B, and , then and is a normal subgroup of G. Here is the corresponding group of Lie-type and the subgroup of generated by all root-subgroups corresponding to positive roots. Received: 19 May 2003     

SECOND-ORDER BOOLEAN ALGEBRAS

Opgedra aan Prof. Hennie Schutte by geleentheid van sy sestigste verjaarsdag.

Abstract

A Boolean algebra is the algebraic version of a field of sets. The complex algebra C(B) of a Boolean algebra B is defined over the power set of B; it is a field of sets with extra operations. The notion of a second-order Boolean algebra is intended to be the algebraic version of the complex algebra of a Boolean algebra. To this end a representation theorem is proved.