System for measuring three fluctuating velocity components in a turbulently flowing fluid

A system is described for measuring fluid velocity in a turbulently flowing fluid including a sensing apparatus for dynamically sensing the mainstream and two orthogonal cross velocity components of the fluid. A transducer operative is included to provide three electrical output signals representative of the velocity components in the mainstream, and in the cross directions. Signal processors can be utilized to derive the Reynolds stress wave and the Reynolds stress

From graph theory and geometric probabilities to a representative width for three-dimensional detonation cells

We present a model for predicting a representative width for the three-dimensional cells observed on detonation fronts in reactive gases. Its physical premise is that the dynamics of the transverse waves of irregular cells obeys a stochastic process both stationary and ergodic and produces the same burnt mass per unit of time as the average planar steady ZND process. Graph theory then defines an ideal cell whose grouping is equivalent to the actual 3D cellular front, geometric probabilities determine the mean burned fraction that parameterizes the model, and ZND calculations close the problem with the time-position relationship of a fluid element in the ZND reaction zone. The model is limited to detonation reaction zones whose sole ignition mechanism is adiabatic shock compression, such as those of the mixtures with H2, C3H8 or C2H4 as fuels considered in this work. Indeed, the comparison of their measured and calculated widths shows an agreement better than or within the accepted experimental uncertainties, depending on the quality of the chemical kinetic scheme used for the ZND calculations. However, the comparison for CH4:O2 mixtures shows high overestimates, indirectly confirming that the detonation reaction zones in these mixtures certainly include other ignition mechanisms contributing to the combustion process, such as turbulent diffusion. In these situations, the cell mean width derived from longitudinal soot recordings shows a very large scatter and may thus not be a relevant detonation characteristic length. The model is easily implementable as a post-process of ZND profiles and provides fast estimates of the cell width, length and reaction time.Comment: Extended versio

The Crystallography of Color Superconductivity

We develop the Ginzburg-Landau approach to comparing different possible crystal structures for the crystalline color superconducting phase of QCD, the QCD incarnation of the Larkin-Ovchinnikov-Fulde-Ferrell phase. In this phase, quarks of different flavor with differing Fermi momenta form Cooper pairs with nonzero total momentum, yielding a condensate that varies in space like a sum of plane waves. We work at zero temperature, as is relevant for compact star physics. The Ginzburg-Landau approach predicts a strong first-order phase transition (as a function of the chemical potential difference between quarks) and for this reason is not under quantitative control. Nevertheless, by organizing the comparison between different possible arrangements of plane waves (i.e. different crystal structures) it provides considerable qualitative insight into what makes a crystal structure favorable. Together, the qualitative insights and the quantitative, but not controlled, calculations make a compelling case that the favored pairing pattern yields a condensate which is a sum of eight plane waves forming a face-centered cubic structure. They also predict that the phase is quite robust, with gaps comparable in magnitude to the BCS gap that would form if the Fermi momenta were degenerate. These predictions may be tested in ultracold gases made of fermionic atoms. In a QCD context, our results lay the foundation for a calculation of vortex pinning in a crystalline color superconductor, and thus for the analysis of pulsar glitches that may originate within the core of a compact star.Comment: 41 pages, 13 figures, 1 tabl

Weighted and filtered mutual information: A Metric for the automated creation of panoramas from views of complex scenes

To contribute a novel approach in the field of image registration and panorama creation, this algorithm foregoes any scene knowledge, requiring only modest scene overlap and an acceptable amount of entropy within each overlapping view. The weighted and filtered mutual information (WFMI) algorithm has been developed for multiple stationary, color, surveillance video camera views and relies on color gradients for feature correspondence. This is a novel extension of well-established maximization of mutual information (MMI) algorithms. Where MMI algorithms are typically applied to high altitude photography and medical imaging (scenes with relatively simple shapes and affine relationships between views), the WFMI algorithm has been designed for scenes with occluded objects and significant parallax variation between non-affine related views. Despite these typically non-affine surveillance scenarios, searching in the affine space for a homography is a practical assumption that provides computational efficiency and accurate results, even with complex scene views. The WFMI algorithm can perfectly register affine views, performs exceptionally well with near-affine related views, and in complex scene views (well beyond affine constraints) the WFMI algorithm provides an accurate estimate of the overlap regions between the views. The WFMI algorithm uses simple calculations (vector field color gradient, Laplacian filtering, and feature histograms) to generate the WFMI metric and provide the optimal affine relationship. This algorithm is unique when compared to typical MMI algorithms and modern registration algorithms because it avoids almost all a priori knowledge and calculations, while still providing an accurate or useful estimate for realistic scenes. With mutual information weighting and the Laplacian filtering operation, the WFMI algorithm overcomes the failures of typical MMI algorithms in scenes where complex or occluded shapes do not provide sufficiently large peaks in the mutual information maps to determine the overlap region. This work has currently been applied to individual video frames and it will be shown that future work could easily extend the algorithm into utilizing motion information or temporal frame registrations to enhance scenes with smaller overlap regions, lower entropy, or even more significant parallax and occlusion variations between views

Efficient Algorithms for Large-Scale Image Analysis

This work develops highly efficient algorithms for analyzing large images. Applications include object-based change detection and screening. The algorithms are 10-100 times as fast as existing software, sometimes even outperforming FGPA/GPU hardware, because they are designed to suit the computer architecture. This thesis describes the implementation details and the underlying algorithm engineering methodology, so that both may also be applied to other applications

Texton finding and lattice creation for near-regular texture

A regular texture is formed from a regular congruent tiling of perceptually meaningful texture elements, also known as textons. If the tiling statistically deviates from regularity, either by texton structure, colour, or size, the texture is called near-regular. If we continue to perturb the tiling, the texture becomes stochastic. The set of possible textures that lie between regular and stochastic make up the texture spectrum: regular, near-regular, regular, near-stochastic, and stochastic. In this thesis we provide a solution to the problem of creating, from a near-regular texture, a lattice which defines the placement of textons. We divide the problem into two distinct sub-areas: finding textons within an image, and lattice creation using both an ad-hoc method and a graph-theoretic method. The problem of finding textons within an image is addressed using correlation. A texton selected by the user is correlated with the image and points of high correlation are extracted using non-maximal suppression. To extend this framework to irregular textures, we present early results on the use of feature space during correlation. We also present a method of correcting for a specific type of error in the texton finding result using frequency-space analysis. Given texton locations, we provide two methods of creating a lattice. The ad-hoc method is able to create a lattice in spite of inconsistencies in the texton locating data. However, as texture becomes irregular the ad-hoc lattice construction method fails to correctly connect textons. To overcome this failure we adapt methods of creating proximity graphs, which join two textons whose neighbourhoods satisfy certain criteria, to our problem. The proximity graphs are parameterized for selection of the most appropriate graph choice for a given texture, solving the general lattice construction problem given correct texton locations. In the output of the algorithm, centres of textons will be connected by edges in the lattice following the structure of texton placement within the input image. More precisely, for a texture T, we create a graph G = (V,E) dependent on T, where V is a set of texton centres, and E ={(v_i, v_j)} is a set of edges, where v_i, v_j are in V. Each edge e in E connects texton centre v in V to its most perceptually sensible neighbours

A computational model of space-variant vision based on a self-organised artificial retina tessellation

Abstract available: p.i-iii

Simulation Of Multi-core Systems And Interconnections And Evaluation Of Fat-Mesh Networks

Simulators are very important in computer architecture research as they enable the exploration of new architectures to obtain detailed performance evaluation without building costly physical hardware. Simulation is even more critical to study future many-core architectures as it provides the opportunity to assess currently non-existing computer systems. In this thesis, a multiprocessor simulator is presented based on a cycle accurate architecture simulator called SESC. The shared L2 cache system is extended into a distributed shared cache (DSC) with a directory-based cache coherency protocol. A mesh network module is extended and integrated into SESC to replace the bus for scalable inter-processor communication. While these efforts complete an extended multiprocessor simulation infrastructure, two interconnection enhancements are proposed and evaluated. A novel non-uniform fat-mesh network structure similar to the idea of fat-tree is proposed. This non-uniform mesh network takes advantage of the average traffic pattern, typically all-to-all in DSC, to dedicate additional links for connections with heavy traffic (e.g., near the center) and fewer links for lighter traffic (e.g., near the periphery). Two fat-mesh schemes are implemented based on different routing algorithms. Analytical fat-mesh models are constructed by presenting the expressions for the traffic requirements of personalized all-to-all traffic. Performance improvements over the uniform mesh are demonstrated in the results from the simulator. A hybrid network consisting of one packet switching plane and multiple circuit switching planes is constructed as the second enhancement. The circuit switching planes provide fast paths between neighbors with heavy communication traffic. A compiler technique that abstracts the symbolic expressions of benchmarks' communication patterns can be used to help facilitate the circuit establishment