Sensitivity of night cooling performance to room/system design: surrogate models based on CFD

Night cooling, especially in offices, attracts growing interest. Unfortunately, building designers face considerable problems with the case-specific convective heat transfer by night. The BES programs they use actually need extra input, from either costly experiments or CFD simulations. Alternatively, up-front research on how to engineer best a generic night cooled office – as in this work – can thrust the application of night cooling. A fully automated configuration of data sampling, geometry/grid generation, CFD solving and surrogate modelling, generates several surrogate models. These models relate the convective heat flow in a night cooled landscape office to the ventilation concept, mass distribution, geometry and driving force for convective heat transfer. The results indicate that cases with a thermally massive floor have the highest night cooling performance

Gradient-based quantitative image reconstruction in ultrasound-modulated optical tomography: first harmonic measurement type in a linearised diffusion formulation

Ultrasound-modulated optical tomography is an emerging biomedical imaging modality which uses the spatially localised acoustically-driven modulation of coherent light as a probe of the structure and optical properties of biological tissues. In this work we begin by providing an overview of forward modelling methods, before deriving a linearised diffusion-style model which calculates the first-harmonic modulated flux measured on the boundary of a given domain. We derive and examine the correlation measurement density functions of the model which describe the sensitivity of the modality to perturbations in the optical parameters of interest. Finally, we employ said functions in the development of an adjoint-assisted gradient based image reconstruction method, which ameliorates the computational burden and memory requirements of a traditional Newton-based optimisation approach. We validate our work by performing reconstructions of optical absorption and scattering in two- and three-dimensions using simulated measurements with 1% proportional Gaussian noise, and demonstrate the successful recovery of the parameters to within +/-5% of their true values when the resolution of the ultrasound raster probing the domain is sufficient to delineate perturbing inclusions.Comment: 12 pages, 6 figure

Effect of multinary substitution on electronic and transport properties of TiCoSb based half-Heusler alloys

The electronic structures of TixZrx/2CoPbxTex, TixZrx/2Hfx/2CoPbxTex (x = 0.5), and the parent compound TiCoSb were investigated using the full potential linearized augmented plane wave method. The thermoelectric transport properties of these alloys are calculated on the basis of semi-classical Boltzmann transport theory. From the band structure calculations we show that the substitution of Zr,Hf in the Ti site and Pb and Te in the Sb site lower the band gap value and also change the indirect band (IB) gap of TiCoSb to the direct band (DB) gap. The calculated band gap of TiCoSb, TixZrx/2CoPbxTex, and TixZrx/2Hfx/2CoPbxTex are 1.04 eV (IB), 0.92 eV (DB), and 0.93 eV (DB), respectively. All these alloys follow the empirical rule of 18 valence-electron content which is essential for bringing semiconductivity in half Heusler alloys. It is shown that the substitution of Hf at the Ti site improve the ZT value (~1.05) at room temperature, whereas there is no significant difference in ZT is found at higher temperature. Based on the calculated thermoelectric transport properties, we conclude that the appropriate concentration of Hf substitution can further improve the thermoelectric performance of TixZrx/2Hfx/2CoPbxTex

Effect of curing conditions and harvesting stage of maturity on Ethiopian onion bulb drying properties

The study was conducted to investigate the impact of curing conditions and harvesting stageson the drying quality of onion bulbs. The onion bulbs (Bombay Red cultivar) were harvested at three harvesting stages (early, optimum, and late maturity) and cured at three different temperatures (30, 40 and 50 oC) and relative humidity (30, 50 and 70%). The results revealed that curing temperature, RH, and maturity stage had significant effects on all measuredattributesexcept total soluble solids

Theory and applications of bijective barycentric mappings

Barycentric coordinates provide a convenient way to represent a point inside a triangle as a convex combination of the triangle's vertices, and to linearly interpolate data given at these vertices. Due to their favourable properties, they are commonly applied in geometric modelling, finite element methods, computer graphics, and many other fields. In some of these applications it is desirable to extend the concept of barycentric coordinates from triangles to polygons. Several variants of such generalized barycentric coordinates have been proposed in recent years. An important application of barycentric coordinates consists of barycentric mappings, which allow to naturally warp a source polygon to a corresponding target polygon, or more generally, to create mappings between closed curves or polyhedra. The principal practical application is image warping, which takes as input a control polygon drawn around an image and smoothly warps the image by moving the polygon vertices. A required property of image warping is to avoid fold-overs in the resulting image. The problem of fold-overs is a manifestation of a larger problem related to the lack of bijectivity of the barycentric mapping. Unfortunately, bijectivity of such barycentric mappings can only be guaranteed for the special case of warping between convex polygons or by triangulating the domain and hence renouncing smoothness. In fact, for any barycentric coordinates, it is always possible to construct a pair of polygons such that the barycentric mapping is not bijective. In the first part of this thesis we illustrate three methods to achieve bijective mappings. The first method is based on the intuition that, if two polygons are sufficiently close, then the mapping is close to the identity and hence bijective. This suggests to ``split'' the mapping into several intermediate mappings and to create a composite barycentric mapping which is guaranteed to be bijective between arbitrary polygons, polyhedra, or closed planar curves. We provide theoretical bounds on the bijectivity of the composite mapping related to the norm of the gradient of the coordinates. The fact that the bound depends on the gradient implies that these bounds exist only if the gradient of the coordinates is bounded. We focus on mean value coordinates and analyse the behaviour of their directional derivatives and gradient at the vertices of a polygon. The composition of barycentric mappings for closed planar curves leads to the problem of blending between two planar curves. We suggest to solve it by linearly interpolating the signed curvature and then reconstructing the intermediate curve from the interpolated curvature values. However, when both input curves are closed, this strategy can lead to open intermediate curves. We present a new algorithm for solving this problem, which finds the closed curve whose curvature is closest to the interpolated values. Our method relies on the definition of a suitable metric for measuring the distance between two planar curves and an appropriate discretization of the signed curvature functions. The second method to construct smooth bijective mappings with prescribed behaviour along the domain boundary exploits the properties of harmonic maps. These maps can be approximated in different ways, and we discuss their respective advantages and disadvantages. We further present a simple procedure for reducing their distortion and demonstrate the effectiveness of our approach by providing examples. The last method relies on a reformulation of complex barycentric mappings, which allows us to modify the ``speed'' along the edges to create complex bijective mappings. We provide some initial results and an optimization procedure which creates complex bijective maps. In the second part we provide two main applications of bijective mapping. The first one is in the context of finite elements simulations, where the discretization of the computational domain plays a central role. In the standard discretization, the domain is triangulated with a mesh and its boundary is approximated by a polygon. We present an approach which combines parametric finite elements with smooth bijective mappings, leaving the choice of approximation spaces free. This approach allows to represent arbitrarily complex geometries on coarse meshes with curved edges, regardless of the domain boundary complexity. The main idea is to use a bijective mapping for automatically warping the volume of a simple parametrization domain to the complex computational domain, thus creating a curved mesh of the latter. The second application addresses the meshing problem and the possibility to solve finite element simulations on polygonal meshes. In this context we present several methods to discretize the bijective mapping to create polygonal and piece-wise polynomial meshes