Semi-implicit second order finite volume jet stream computations

Semi-implicit, second order temporal and spatial finite volume computations of the flow in a differentially heated rotating annulus are presented. For the regime considered, three cyclones and anticyclones separated by a relatively fast moving jet of fluid or "jet stream" are predicted. Two second order methods are compared with, first order spatial predictions, and experimental measurements. Velocity vector plots are used to illustrate the predicted flow structure. Computations made using second order central differences are shown to agree best with experimental measurements, and to be stable for integrations over long time periods (> 1000s). No periodic smoothing is required to prevent divergence.

Computations of turbulent lean premixed combustion using conditional moment closure

Conditional Moment Closure (CMC) is a suitable method for predicting scalars such as carbon monoxide with slow chemical time scales in turbulent combustion. Although this method has been successfully applied to non-premixed combustion, its application to lean premixed combustion is rare. In this study the CMC method is used to compute piloted lean premixed combustion in a distributed combustion regime. The conditional scalar dissipation rate of the conditioning scalar, the progress variable, is closed using an algebraic model and turbulence is modelled using the standard k-e{open} model. The conditional mean reaction rate is closed using a first order CMC closure with the GRI-3.0 chemical mechanism to represent the chemical kinetics of methane oxidation. The PDF of the progress variable is obtained using a presumed shape with the Beta function. The computed results are compared with the experimental measurements and earlier computations using the transported PDF approach. The results show reasonable agreement with the experimental measurements and are consistent with the transported PDF computations. When the compounded effects of shear-turbulence and flame are strong, second order closures may be required for the CMC. © 2013 Copyright Taylor and Francis Group, LLC.

Vectorizing Face Images by Interpreting Shape and Texture Computations

The correspondence problem in computer vision is basically a matching task between two or more sets of features. In this paper, we introduce a vectorized image representation, which is a feature-based representation where correspondence has been established with respect to a reference image. This representation has two components: (1) shape, or (x, y) feature locations, and (2) texture, defined as the image grey levels mapped onto the standard reference image. This paper explores an automatic technique for "vectorizing" face images. Our face vectorizer alternates back and forth between computation steps for shape and texture, and a key idea is to structure the two computations so that each one uses the output of the other. A hierarchical coarse-to-fine implementation is discussed, and applications are presented to the problems of facial feature detection and registration of two arbitrary faces.

Coordinate-Independent Computations on Differential Equations

This project investigates the computational representation of differentiable manifolds, with the primary goal of solving partial differential equations using multiple coordinate systems on general n- dimensional spaces. In the process, this abstraction is used to perform accurate integrations of ordinary differential equations using multiple coordinate systems. In the case of linear partial differential equations, however, unexpected difficulties arise even with the simplest equations.

Deterministic Computations Whose History Is Independent of the Order of Asynchronous Updating

Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these transitions (updates) are applied in arbitrary order, one or many at a time. If the state of site x at time t is η(x; t) then let us define the sequence ζ(x; 0); ζ(x; 1), ... by taking the sequence η(x; 0),η(x; 1), ... , and deleting each repetition, i.e. each element equal to the preceding one. The function f is said to have invariant histories if the sequence ζ(x; i), (while it lasts, in case it is finite) depends only on the initial configuration, not on the order of updates. This paper shows that though the invariant history property is typically undecidable, there is a useful simple sufficient condition, called commutativity: For any configuration, for any pair x; y of neighbors, if the updating would change both ξ(x) and ξ(y) then the result of updating first x and then y is the same as the result of doing this in the reverse order. This fact is derivable from known results on the confluence of term-rewriting systems but the self-contained proof given here may be justifiable.

Exact Geosedics and Shortest Paths on Polyhedral Surface

We present two algorithms for computing distances along a non-convex polyhedral surface. The first algorithm computes exact minimal-geodesic distances and the second algorithm combines these distances to compute exact shortest-path distances along the surface. Both algorithms have been extended to compute the exact minimalgeodesic paths and shortest paths. These algorithms have been implemented and validated on surfaces for which the correct solutions are known, in order to verify the accuracy and to measure the run-time performance, which is cubic or less for each algorithm. The exact-distance computations carried out by these algorithms are feasible for large-scale surfaces containing tens of thousands of vertices, and are a necessary component of near-isometric surface flattening methods that accurately transform curved manifolds into flat representations.

Evaluation of a WHO-Validated Serotype-Specific Serological Assay for the Diagnosis of Pneumococcal Etiology in Children with Community-Acquired Pneumonia.

BACKGROUND: The etiologic diagnosis of community-acquired pneumonia (CAP) remains challenging in children because blood cultures have low sensitivity. Novel approaches are needed to confirm the role of Streptococcus pneumoniae. METHODS: In this study, pneumococcal aetiology was determined by serology using a subset of blood samples collected during a prospective multicentre observational study of children <15 years of age hospitalised in Belgium with X-ray-confirmed CAP. Blood samples were collected at admission and 3-4 weeks later. Pneumococcal (P)-CAP was defined in the presence of a positive blood or pleural fluid culture. Serotyping of Streptococcus pneumoniae isolates was done with the Quellung reaction. Serological diagnosis was assessed for nine serotypes using World Health Organization validated IgG and IgA serotype-specific enzyme-linked immunosorbent assays (ELISAs). RESULTS: Paired admission/convalescent sera from 163 children were evaluated by ELISA (35 with proven P-CAP and 128 with non proven P-CAP). ELISA detected pneumococci in 82.8% of patients with proven P-CAP. The serotypes identified were the same as with the Quellung reaction in 82% and 59% of cases by IgG ELISA and IgA ELISA, respectively. Overall, ELISA identified a pneumococcal aetiology in 55% of patients with non-proven P-CAP. Serotypes 1 (51.6%), 7F (19%), and 5 (15.7%) were the most frequent according to IgG ELISA. CONCLUSIONS: In conclusion, the serological assay allows recognition of pneumococcal origin in 55% of CAP patients with negative culture. This assay should improve the diagnosis of P-CAP in children and could be a useful tool for future epidemiological studies on childhood CAP etiology.

Three-phase computations of the continuous casting process

In this paper, the continuous casting process for steel slab production is modelled using a mult-physics approach. For this purpose, a Finite Volume (FV) numerical model was constructed in 3D, with the following characteristics: Time dependent, turbulent fluid flow and heat transfer in the molten steel and flux regions, solidification of the skin layer, under prescribed heat loss boundary conditions, particle tracking simulation of argon bubbles injected with the metal into the mould, full coupling between bubbles and liquid through buoyancy and interfacial forces using a novel gas accumulation technique, and a full transient simulation of flux-metal interface behaviour under the influence of gravity and fluid inertial forces and bubble plume buoyancy. The unstructure mesh FV code PHYSICA developed at Greenwich was used for carry out the simulations with physical process data and properties supplied by IRSID SA.