"We define and investigate a class of positive de nite kernel so called equivalent-kernel. We formulate prove an analogous Paley-Wiener theorem in the context definite kernel. The main ingredient proof is Kolmogorov decomposition. Finally, some applications to stochastic processes are given."

We propose a simple order-theoretic generalization of set-theoretic inductive de nitions. This generalization covers inductive, co-inductive and bi-inductive de nitions and is preserved by abstraction. This allows the structural operational semantics to describe simultaneously the nite/terminating and in nite/diverging behaviors of programs. This is illustrated on the structural bi nitary small...

We propose a simple order-theoretic generalization of set-theoretic inductive de nitions. This generalization covers inductive, co-inductive and bi-inductive de nitions and is preserved by abstraction. This allows the structural operational semantics to describe simultaneously the nite/terminating and in nite/diverging behaviors of programs. This is illustrated on the structural bi nitary small...

Finite element meshes are large, richly structured sets whose internal relationships must be visible to diierent parts of a nite element program. This causes software engineerings problems that increase when adaptive mesh reenement and multilevel preconditioners are applied. Even more problems arise when nite element methods have to be implemented for parallel computers since the meshes have to...

Various aspects of Bayesian inference in selection and size biased sampling problems are presented beginning with discussion of general problems of inference in in nite and nite populations subject to selection sampling Estimation of the size of nite populations and inference about superpopulation distributions when sampling is apparently informative is then developed in two speci c problems Th...

In this note we give a simple proof that Dehn twists have linear growth with respect to the word metric on the mapping class group of an oriented surface of nite type (Theorem 1). This answers a question of Ivanov in 3]. A proof in the case of punctured surfaces was given by Mosher 6] using his techniques for constructing an automatic structure on the mapping class group. This result implies in...

The objective of this paper is to analyze the impact of data mapping strategies on the performance of nite element applications. First, we describe a parallel mesh decomposition algorithm based on recursive spectral bisection used to partition the mesh into element blocks. A simple heuristic algorithm then renumbers the mesh nodes. Large three-dimensional meshes demonstrate the eeciency of thos...

Abstract: If x is a string of nite length over a nite alphabet A, let LZ(x) denote the length of the binary codeword assigned to x by the 1978 version of the Lempel-Ziv data compression algorithm, let t(x) be the number of phrases in the Lempel-Ziv parsing of x, and let (x) be the probability assigned to x by a memoryless source model. Using a very simple technique, we prove the pointwise redun...

We present properties of multihead two-way probabilistic nite automata that parallel those of their deterministic and nondeterministic counterparts. We deene multihead proba-bilistic nite automata with log-space constructible transition probabilities, and we describe a simple technique to simulate these automata by standard log-space probabilistic Turing machines. Next, we represent log-space p...

Simulating ow in porous media requires the solution of elliptic or parabolic partial diierential equations. When the computational domain is irregularly shaped, applying nite element methods with triangular elements ooers great exibility. The mixed nite element method has proven useful for solving ow equations. The diiculty with mixed methods in general is in solving the linear algebraic system...