Time domain wave separation using multiple microphones

Methods of measuring the acoustic behavior of tubular systems can be broadly characterized as steady state measurements, where the measured signals are analyzed in terms of infinite duration sinusoids, and reflectometry measurements which exploit causality to separate the forward and backward going waves in a duct. This paper sets out a multiple microphone reflectometry technique which performs wave separation by using time domain convolution to track the forward and backward going waves in a cylindrical source tube. The current work uses two calibration runs (one for forward going waves and one for backward going waves) to measure the time domain transfer functions for each pair of microphones. These time domain transfer functions encode the time delay, frequency dependent losses and microphone gain ratios for travel between microphones. This approach is applied to the measurement of wave separation, bore profile and input impedance. The work differs from existing frequency domain methods in that it combines the information of multiple microphones within a time domain algorithm, and differs from existing time domain methods in its inclusion of the effect of losses and gain ratios in intermicrophone transfer functions.

The level sets of the resolvent norm and convexity properties of Banach spaces

We construct a bounded linear operator on a separable, reflexive and strictly convex Banach space whose resolvent norm is constant in a neighbourhood of zero.

A comparative analysis of multidimensional features of objects resembling sets of graphs

In the present paper, we introduce a notion of a style representing abstract, complex objects having characteristics that can be represented as structured objects. Furthermore, we provide some mathematical properties of such styles. As a main result, we present a novel approach to perform a meaningful comparative analysis of such styles by defining and using graph-theoretic measures. We compare two styles by comparing the underlying feature sets representing sets of graph structurally. To determine the structural similarity between the underlying graphs, we use graph similarity measures that are computationally efficient. More precisely, in order to compare styles, we map each feature set to a so-called median graph and compare the resulting median graphs. As an application, we perform an experimental study to compare special styles representing sets of undirected graphs and present numerical results thereof. (C) 2007 Elsevier Inc. All rights reserved.