Velocity measurements in liquid sodium by means of ultrasound Doppler velocimetry

A successful application of ultrasound Doppler velocimetry in liquid sodium flows is described. To obtain sufficient Doppler signals, different problems had to be solved: the transmission of the ultrasonic beam through the channel wall made of stainless steel, the acoustic coupling between the transducer and the channel wall, and the wetting of the inner surface of the wall by the liquid metal, respectively. A sodium flow in a square duct exposed to a transverse magnetic field is investigated. In accordance with the existing knowledge about MHD channel flows, we found that the velocity profiles modified to a M-shape owing to the effect of an inhomogeneous magnetic field. Received: 12 June 2001/Accepted: 27 October 2001     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

On iteration semigroups of mean-type mappings and invariant means

Summary. Iteration semigroups of weighted quasi-arithmetic mean-type mappings are considered. Existence and uniqueness of a mean which is invariant with respect to a continuous semigroup of mean-type mapping is proved.     

Interplay between four conjectures on certain zero-sum problems

In this paper, we explore the interplay of four different conjectures on certain zero-sum problems in Z_p Z_p. This study of the inter-relations between these conjectures leads to the conclusion that determining the structure of minimal zero sequences (see below for the precise definition) is crucial. Also, we study the analogous situation in Z_n.     

Kalman filtering of a space-time Markov random field

In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model.     

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002