Design and Development of Thermoelectric Generator

In this paper we discuss the fabrication, working and characteristics of a thermoelectric generator made up of p and n type semiconductor materials. The device consists of Fe0.2Co3.8Sb11.5Te0.5 (zT = 1.04 at 818 K) as the n-type and Zn4Sb3 (zT= 0.8 at 550 K) as the p-type material synthesized by vacuum hot press method. Carbon paste has been used to join the semiconductor legs to metal (Molybdenum) electrodes to reduce the contact resistance. The multi-couple (4 legs) generator results a maximum output power of 1.083 mW at a temperature difference of 240 K between the hot and cold sides. In this investigation, an I-V characteristic, maximum output power of the thermoelectric module is presented. The efficiency of thermoelectric module is obtained as eta= 0.273 %.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

Influence of Spatial Variability on Pavement Responses Using Latin Hypercube Sampling on Two-Dimensional Random Fields

Although uncertainties in material properties have been addressed in the design of flexible pavements, most current modeling techniques assume that pavement layers are homogeneous. The paper addresses the influence of the spatial variability of the resilient moduli of pavement layers by evaluating the effect of the variance and correlation length on the pavement responses to loading. The integration of the spatially varying log-normal random field with the finite-difference method has been achieved through an exponential autocorrelation function. The variation in the correlation length was found to have a marginal effect on the mean values of the critical strains and a noticeable effect on the standard deviation which decreases with decreases in correlation length. This reduction in the variance arises because of the spatial averaging phenomenon over the softer and stiffer zones generated because of spatial variability. The increase in the mean value of critical strains with decreasing correlation length, although minor, illustrates that pavement performance is adversely affected by the presence of spatially varying layers. The study also confirmed that the higher the variability in the pavement layer moduli, introduced through a higher value of coefficient of variation (COV), the higher the variability in the pavement response. The study concludes that ignoring spatial variability by modeling the pavement layers as homogeneous that have very short correlation lengths can result in the underestimation of the critical strains and thus an inaccurate assessment of the pavement performance. (C) 2014 American Society of Civil Engineers.

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.

VISUAL OBJECT TRACKING VIA RANDOM FERNS BASED CLASSIFICATION

Designing a robust algorithm for visual object tracking has been a challenging task since many years. There are trackers in the literature that are reasonably accurate for many tracking scenarios but most of them are computationally expensive. This narrows down their applicability as many tracking applications demand real time response. In this paper, we present a tracker based on random ferns. Tracking is posed as a classification problem and classification is done using ferns. We used ferns as they rely on binary features and are extremely fast at both training and classification as compared to other classification algorithms. Our experiments show that the proposed tracker performs well on some of the most challenging tracking datasets and executes much faster than one of the state-of-the-art trackers, without much difference in tracking accuracy.

Performance Assessment of a Small Biogas-fuelled Power Generator Prototype

This study reports the development and performance evaluation of prototypes of biogas-fuelled stationary power generators in the range of 1 kW. Strategies to achieve high engine efficiency namely pulsed manifold injection, electronic throttle control and dual spark plugs, have been incorporated in the prototype. A complete closed-loop control of the engine operation to maintain a steady engine speed of 3000 rpm (+/- 5%) across the entire load range while maintaining an optimum fuel-air equivalence ratio is made possible by an electronic control unit (ECU) controlling the injection duration, ignition timing and throttle position. This study specifically focuses on the response of the generator to transient loads, and the overall efficiency obtained. The results obtained from testing the prototype have been found to be satisfactory and show that biogas power generators for low power applications can be made efficient (overall efficiency of 19% at electrical load of 640 W) using the strategies of biogas fuel injection.

A Brushless Wound Rotor Induction Generator for Variable Speed Microhydel Plants Without Ballast Load

A new generator topology for microhydel power plants, capable of unsupervised operation, is proposed. While conventional microhydel plants operate at constant speed with switched ballast loads, the proposed generator, based on the wound rotor induction machine, operates at variable speed and does away with the need for ballast loads. This increases reliability and substantially decreases system costs and setup times. The proposed generator has a simplified decoupled control structure with stator-referenced voltage control similar to a conventional synchronous generator, and rotor-side frequency control that is facilitated by rotating electronics mounted on the rotor. While this paper describes an isolated plant, the topology can also be tailored for distributed generation enabling conversion of the available hydraulic power into useful electrical power when the grid is present, and supplying local loads in the event of grid outage.

Matrix Crack Detection in Composite Plate with Spatially Random Material Properties using Fractal Dimension

Fractal dimension based damage detection method is investigated for a composite plate with random material properties. Composite material shows spatially varying random material properties because of complex manufacturing processes. Matrix cracks are considered as damage in the composite plate. Such cracks are often seen as the initial damage mechanism in composites under fatigue loading and also occur due to low velocity impact. Static deflection of the cantilevered composite plate with uniform loading is calculated using the finite element method. Damage detection is carried out based on sliding window fractal dimension operator using the static deflection. Two dimensional homogeneous Gaussian random field is generated using Karhunen-Loeve (KL) expansion to represent the spatial variation of composite material property. The robustness of fractal dimension based damage detection method is demonstrated considering the composite material properties as a two dimensional random field.

Quantitative estimation of density variation in high-speed flows through inversion of the measured wavefront distortion

A simple method employing an optical probe is presented to measure density variations in a hypersonic flow obstructed by a test model in a typical shock tunnel. The probe has a plane light wave trans-illuminating the flow and casting a shadow of a random dot pattern. Local slopes of the distorted wavefront are obtained from shifts of the dots in the pattern. Local shifts in the dots are accurately measured by cross-correlating local shifted shadows with the corresponding unshifted originals. The measured slopes are suitably unwrapped by using a discrete cosine transform based phase unwrapping procedure and also through iterative procedures. The unwrapped phase information is used in an iterative scheme for a full quantitative recovery of density distribution in the shock around the model through refraction tomographic inversion. Hypersonic flow field parameters around a missile shaped body at a free-stream Mach number of 5.8 measured using this technique are compared with the numerically estimated values. (C) 2014 Society of Photo-Optical Instrumentation Engineers (SPIE)

Matrix crack detection in spatially random composite structures using fractal dimension

Fractal dimension based damage detection method is studied for a composite structure with random material properties. A composite plate with localized matrix crack is considered. Matrix cracks are often seen as the initial damage mechanism in composites. Fractal dimension based method is applied to the static deformation curve of the structure to detect localized damage. Static deflection of a cantilevered composite plate under uniform loading is calculated using the finite element method. Composite material shows spatially varying random material properties because of complex manufacturing processes. Spatial variation of material property is represented as a two dimensional homogeneous Gaussian random field. Karhunen-Loeve (KL) expansion is used to generate a random field. The robustness of fractal dimension based damage detection methods is studied considering the composite plate with spatial variation in material properties.

Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

Lower bounds for testing triangle-freeness in Boolean functions

Given a Boolean function , we say a triple (x, y, x + y) is a triangle in f if . A triangle-free function contains no triangle. If f differs from every triangle-free function on at least points, then f is said to be -far from triangle-free. In this work, we analyze the query complexity of testers that, with constant probability, distinguish triangle-free functions from those -far from triangle-free. Let the canonical tester for triangle-freeness denotes the algorithm that repeatedly picks x and y uniformly and independently at random from , queries f(x), f(y) and f(x + y), and checks whether f(x) = f(y) = f(x + y) = 1. Green showed that the canonical tester rejects functions -far from triangle-free with constant probability if its query complexity is a tower of 2's whose height is polynomial in . Fox later improved the height of the tower in Green's upper bound to . A trivial lower bound of on the query complexity is immediate. In this paper, we give the first non-trivial lower bound for the number of queries needed. We show that, for every small enough , there exists an integer such that for all there exists a function depending on all n variables which is -far from being triangle-free and requires queries for the canonical tester. We also show that the query complexity of any general (possibly adaptive) one-sided tester for triangle-freeness is at least square root of the query complexity of the corresponding canonical tester. Consequently, this means that any one-sided tester for triangle-freeness must make at least queries.

Equilibrium and equivariant triangulations of some small covers with minimum number of vertices

Small covers were introduced by Davis and Januszkiewicz in 1991. We introduce the notion of equilibrium triangulations for small covers. We study equilibrium and vertex minimal 4-equivariant triangulations of 2-dimensional small covers. We discuss vertex minimal equilibrium triangulations of RP3#RP3, S-1 x RP2 and a nontrivial S-1 bundle over RP2. We construct some nice equilibrium triangulations of the real projective space RPn with 2(n) + n 1 vertices. The main tool is the theory of small covers.

Behaviour of turbulent Prandtl/Schmidt number in compressible mixing layer

The behaviour of turbulent Prandtl/Schmidt number is explored through the model-free simulation results. It has been observed that compressibility affects the Reynolds scalar flux vectors. Reduced peak values are also observed for compressible convective Mach number mixing layer as compared with the incompressible convective Mach number counterpart, indicating a reduction in the mixing of enthalpy and species. Pr-t and Sc-t variations also indicate a reduction in mixing. It is observed that unlike the incompressible case, it is difficult to assign a constant value to these numbers due to their continuous variation in space. Modelling of Pr-t and Sc-t would be necessary to cater for this continuous spatial variation. However, the turbulent Lewis number is evaluated to be near unity for the compressible case, making it necessary to model only one of the Pr-t and Sc-t..

An estimate of the number of tropical tree species

The high species richness of tropical forests has long been recognized, yet there remains substantial uncertainty regarding the actual number of tropical tree species. Using a pantropical tree inventory database from closed canopy forests, consisting of 657,630 trees belonging to 11,371 species, we use a fitted value of Fisher's alpha and an approximate pantropical stem total to estimate the minimum number of tropical forest tree species to fall between similar to 40,000 and similar to 53,000, i.e., at the high end of previous estimates. Contrary to common assumption, the Indo-Pacific region was found to be as species-rich as the Neotropics, with both regions having a minimum of similar to 19,000-25,000 tree species. Continental Africa is relatively depauperate with a minimum of similar to 4,500-6,000 tree species. Very few species are shared among the African, American, and the Indo-Pacific regions. We provide a methodological framework for estimating species richness in trees that may help refine species richness estimates of tree-dependent taxa.