The PDE-preserving operators on nuclearly entire functions of bounded type

The PDE-preserving operators O on the space of nuclearly entire functions of bounded type H_Nb(E) on a Banach space E are characterized. An operator is PDE-preserving when it preserves homogenous solutions to homogeneous convolution equations. We establish a one to one correspondence between O and a set Σ of sequences of entire functionals, i.e. exponential type functions. In this way, algebraic structures on Σ, such as ring structures, can be carried over to O and vice versa. In particular, it follows that O is a non-commutative ring (algebra) with unity with respect to composition and the convolution operators form a commutative subring (subalgebra). We discuss range and kernel properties, for the operators in O, and characterize the projectors (onto polynomial spaces) in O by determining the corresponding elements in Σ. This revised version was published online in June 2006 with corrections to the Cover Date.     

Fractional extensions of some boundary value problems in oil strata

In the present paper, we solve three boundary value problems related to the temperature field in oil strata — the fractional extensions of the incomplete lumped formulation and lumped formulation in the linear case and the fractional generalization of the incomplete lumped formulation in the radial case. By using the Caputo differintegral operator and the Laplace transform, the solutions are obtained in integral forms where the integrand is expressed in terms of the convolution of some auxiliary functions of Wright function type. A generalization of the Laplace transform convolution theorem, known as Efros’ theorem is widely used.     

Functional Central Limit Theorems for Triangular Arrays of Function-Indexed Processes under Uniformly Integrable Entropy Conditions

Functional central limit theorems for triangular arrays of rowwise independent stochastic processes are established by a method replacing tail probabilities by expectations throughout. The main tool is a maximal inequality based on a preliminary version proved by P. Gaenssler and Th. Schlumprecht. Its essential refinement used here is achieved by an additional inequality due to M. Ledoux and M. Talagrand. The entropy condition emerging in our theorems was introduced by K. S. Alexander, whose functional central limit theorem for so-calledmeasure-like processeswill be also regained. Applications concern, in particular, so-calledrandom measure processeswhich include function-indexed empirical processes and partial-sum processes (with random or fixed locations). In this context, we obtain generalizations of results due to K. S. Alexander, M. A. Arcones, P. Gaenssler, and K. Ziegler. Further examples include nonparametric regression and intensity estimation for spatial Poisson processes.     

The Choquet-Deny convolution equation μ=μ*σ for probability measures on Abelian semigroups

In this note, we characterize the regular probability measures satisfying the Choquet-Deny convolution equation =* on Abelian topological semigroups for a given probability measure .     

Automorphisms on a Lie group contracting modulo a compact subgroup and applications to semistable convolution semigroups

Let ( _t ) _t0 be a -semistable convolution semigroup of probability measures on a Lie groupG whose idempotent ₀ is the Haar measure on some compact subgroupK. Then all the measures ₁ are supported by theK-contraction groupC _K() of the topological automorphism ofG. We prove here the structure theoremC _K()=C()K, whereC() is the contraction group of . Then it turns out that it is sufficient to study semistable convolution semigroups on simply connected nilpotent Lie groups that have Lie algebras with a positive graduation.     

Fast folding and comparison of RNA secondary structures

Summary Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and base pairing probabilities.An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary structures based on tree editing and alignment.All computer codes are written in ANSI C. They include implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.

---

Schnelle Faltung und Vergleich von Sekundärstrukturen von RNA

Zusammenfassung Die im Vienna RNA package enthaltenen Computer Programme für die Berechnung und den Vergleich von RNA Sekundärstrukturen werden präsentiert. Ihren Kern bilden Algorithmen zur Vorhersage von Strukturen minimaler Energie sowie zur Berechnung von Zustandssumme und Basenpaarungswahrscheinlichkeiten mittels dynamischer Programmierung.Ein effizienter heuristischer Algorithmus für das inverse Faltungsproblem wird vorgestellt. Darüberhinaus präsentieren wir kompakte und effiziente Programme zum Vergleich von RNA Sekundärstrukturen durch Baum-Editierung und Alignierung.Alle Programme sind in ANSI C geschrieben, darunter auch eine Implementation des Faltungs-algorithmus für Parallelrechner mit verteiltem Speicher. Wie Tests auf einem Intel Hypercube zeigen, wird das Parallelrechnen umso effizienter je länger die Sequenzen sind.

     

二维卷积在动力学分析中的应用

本文用计算机模拟和二维卷积研究了稀土与间乙酰基偶氮氯膦的显色反应，选择不同的模型参数可描述这类反应的细节，二维卷积则增强对叠合二维谱的分辨。     

Convolution semigroups and central limit theorem associated with a dual convolution structure

We consider hypergroups associated with Jacobi functions ⁽⁾ (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s ₀]{{) =++1,s ₀=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.