SOUND PROPAGATION AND SCATTERING IN BUBBLY LIQUIDS

In the ocean, natural and artificial processes generate clouds of bubbles which scatter and attenuate sound. Measurements have shown that at the individual bubble resonance frequency, sound propagation in this medium is highly attenuated and dispersive. Theory to explain this behavior exists in the literature, and is adequate away from resonance. However, due to excessive attenuation near resonance, little experimental data exists for comparison. An impedance tube was developed specifically for exploring this regime. Using the instrument, unique phase speed and attenuation measurements were made for void fractions ranging from 6.2 × 10^−5 to 2.7 × 10^−3 and bubble sizes centered around 0.62 mm in radius. Improved measurement speed, accuracy and precision is possible with the new instrument, and both instantaneous and time-averaged measurements were obtained. Behavior at resonance was observed to be sensitive to the bubble population statistics and agreed with existing theory, within the uncertainty of the bubble population parameters. Scattering from acoustically compact bubble clouds can be predicted from classical scattering theory by using an effective medium description of the bubbly fluid interior. Experimental verification was previously obtained up to the lowest resonance frequency. A novel bubble production technique has been employed to obtain unique scattering measurements with a bubbly-liquid-filled latex tube in a large indoor tank. The effective scattering model described these measurements up to three times the lowest resonance frequency of the structure.

Nearest-neighbor Queries in Probabilistic Graphs

Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the "proximity" or the "distance" between any two nodes in the graph. To that end, we propose various novel distance functions that extend well known notions of classical graph theory, such as shortest paths and random walks. We argue that many meaningful distance functions are computationally intractable to compute exactly. Thus, in order to process nearest-neighbor queries, we resort to Monte Carlo sampling and exploit novel graph-transformation ideas and pruning opportunities. In our extensive experimental analysis, we explore the trade-offs of our approximation algorithms and demonstrate that they scale well on real-world probabilistic graphs with tens of millions of edges.