A dual graph-norm refinement indicator for finite volume approximations of the Euler equations

Summary. We generalise and apply a refinement indicator of the type originally designed by Mackenzie, Süli and Warnecke in [15] and [16] for linear Friedrichs systems to the Euler equations of inviscid, compressible fluid flow. The Euler equations are symmetrized by means of entropy variables and locally linearized about a constant state to obtain a symmetric hyperbolic system to which an a posteriori error analysis of the type introduced in [15] can be applied. We discuss the details of the implementation of the refinement indicator into the DLR--Code which is based on a finite volume method of box type on an unstructured grid and present numerical results. Received May 15, 1995 / Revised version received April 17, 1996     

Indirect Methods For Determination of The Protective Effects of Coating Films on The Surface of Crystals

The extents of the protective effects of coating films on the surface of crystals were determined. Three different samples were made with different quantities of coating fluid (Sepifilm LP 010 in 10% aqueous solution). Since the atomizing rate was constant, the coating time increased in parallel with the volume of coating fluid applied. The direct measurement of film thickness and smoothness is very difficult, and therefore indirect methods were used. Dimenhydrinate was chosen as model drug; this is a heat-sensitive antihistamine with a low melting point. This temperature can be reached during the tableting process. The behaviour of samples on exposure to heat was examined by differential scanning calorimetry. The water uptakes of the samples were determined with an Enslin apparatus. Plasticity was studied with an instrumented tablet machine. These indirect methods (thermal conductivity, water uptake and plasticity measurements) revealed connections between the results of the various experiments. An overlong coating time decreased the protective effect of the coating film. This revised version was published online in August 2006 with corrections to the Cover Date.     

Tribute to Endre Csáki and Pál Révész

Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks.     

On the Curvature of the Indicatrix Surface in Three-Dimensional Minkowski Spaces

Periodica Mathematica Hungarica - As it is well-known a Minkowski space is a finite dimensional real vector space equipped with a Minkowski functional F. If the square of the Minkowski functional...     

Open Problems

Periodica Mathematica Hungarica -     

Analysis of cardiac tissue by gold cluster ion bombardment

Specific molecules in cardiac tissue of spontaneously hypertensive rats are studied by using time-of-flight secondary ion mass spectrometry (TOF-SIMS). The investigation determines phospholipids, cholesterol, fatty acids and their fragments in the cardiac tissue, with special focus on cardiolipin. Cardiolipin is a unique phospholipid typical for cardiomyocyte mitochondrial membrane and its decrease is involved in pathologic conditions. In the positive polarity, the fragments of phosphatydilcholine are observed in the mass region of 700-850 u. Peaks over mass 1400 u correspond to intact and cationized molecules of cardiolipin. In animal tissue, cardiolipin contains of almost exclusively 18 carbon fatty acids, mostly linoleic acid. Linoleic acid at 279 u, other fatty acids, and phosphatidylglycerol fragments, as precursors of cardiolipin synthesis, are identified in the negative polarity. These data demonstrate that SIMS technique along with Au₃⁺ cluster primary ion beam is a good tool for detection of higher mass biomolecules providing approximately 10 times higher yield in comparison with Au⁺.     

Fourier Analysis of Semistable Distributions

We consider the generalized convolution powers G _α ^*u (x) of an arbitrary semistable distribution function G _α (x) of exponent α∈(0,2), and prove that for all j, k∈{0,1,2,…} and u>0 the derivatives G _α ^(k,j)(x;u)=∂ ^k+j G _α ^*u (x)/∂ x ^k ∂ u ^j , x∈ℝ, are of bounded variation on the whole real line ℝ. The proof, along with an integral recursion in j, is new even in the special case of stable laws, and the result provides a framework for possible asymptotic expansions in merge theorems from the domain of geometric partial attraction of semistable laws. An erratum to this article can be found at     

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s₁ and s₂ to, respectively, a given vertex t₁, and each vertex of a given subset of vertices T₂.