Characterisation of humidity dependence of a metal oxide semiconductor sensor array using partial least squares

Metal oxide semiconductor (MOS) sensors are a class of chemical sensors that have potential for being a practical core sensor module for an electronic nose system in various environmental monitoring applications. However, the responses of these sensors may be affected by changes in humidity and this must be taken into consideration when developing calibration models. This paper characterises the humidity dependence of a sensor array which consists of 12 MOS sensors. The results were used to develop calibration models using partial least squares (PLS). Effects of humidity on the response of the sensor array and predictive ability of partial least squares are discussed. It is shown that partial least squares can provide proper calibration models to compensate for effects caused by changes in humidity. Special Issue: Selected Paper from the 12th International Symposium on Olfaction and Electronic Noses - ISOEN 2007, International Symposium on Olfaction and Electronic Noses.

Invited paper Application of the least mean fourth (LMF) adaptive algorithm to signals associated with gaussian noise

This paper considers the applicability of the least mean fourth (LM F) power gradient adaptation criteria with 'advantage' for signals associated with gaussian noise, the associated noise power estimate not being known. The proposed method, as an adaptive spectral estimator, is found to provide superior performance than the least mean square (LMS) adaptation for the same (or even lower) speed of convergence for signals having sufficiently high signal-to-gaussian noise ratio. The results include comparison of the performance of the LMS-tapped delay line, LMF-tapped delay line, LMS-lattice and LMF-lattice algorithms, with the Burg's block data method as reference. The signals, like sinusoids with noise and stochastic signals like EEG, are considered in this study.

"Polenschutz ist kein Geschenk"; To be Sent to Poland is Not a Privilege Artworks

Digital Image

"Polenschutz ist kein Geschenk"; To be Sent to Poland is Not a Privilege Artworks

Postwar version of F 38341

Exclusive consumers: The discourse of privilege in elite Indian school websites

This chapter undertakes a study of how elite schools in India have a historical, colonial legacy while incorporating global, market oriented, international agenda to fit in with present times. Drawing on Bourdieu’s notion of elite schools and Foucault’s theory of discourse, a qualitative analysis is undertaken of 21 elite schools. The primary argument advanced is that the websites of the schools contain the discourses of privilege and distinction along with the discourses of inclusion and exclusion, market ideology and individual merit with the aim being to promote a local, global elite ascendancy.

Fast FIR Algorithms for the Continuous Wavelet Transform From Constrained Least Squares

New algorithms for the continuous wavelet transform are developed that are easy to apply, each consisting of a single-pass finite impulse response (FIR) filter, and several times faster than the fastest existing algorithms. The single-pass filter, named WT-FIR-1, is made possible by applying constraint equations to least-squares estimation of filter coefficients, which removes the need for separate low-pass and high-pass filters. Non-dyadic two-scale relations are developed and it is shown that filters based on them can work more efficiently than dyadic ones. Example applications to the Mexican hat wavelet are presented.

High-Throughput Prediction of Acacia and Eucalypt Lignin Syringyl/Guaiacyl Content Using FT-Raman Spectroscopy and Partial Least Squares Modeling

High-throughput techniques are necessary to efficiently screen potential lignocellulosic feedstocks for the production of renewable fuels, chemicals, and bio-based materials, thereby reducing experimental time and expense while supplanting tedious, destructive methods. The ratio of lignin syringyl (S) to guaiacyl (G) monomers has been routinely quantified as a way to probe biomass recalcitrance. Mid-infrared and Raman spectroscopy have been demonstrated to produce robust partial least squares models for the prediction of lignin S/G ratios in a diverse group of Acacia and eucalypt trees. The most accurate Raman model has now been used to predict the S/G ratio from 269 unknown Acacia and eucalypt feedstocks. This study demonstrates the application of a partial least squares model composed of Raman spectral data and lignin S/G ratios measured using pyrolysis/molecular beam mass spectrometry (pyMBMS) for the prediction of S/G ratios in an unknown data set. The predicted S/G ratios calculated by the model were averaged according to plant species, and the means were not found to differ from the pyMBMS ratios when evaluating the mean values of each method within the 95 % confidence interval. Pairwise comparisons within each data set were employed to assess statistical differences between each biomass species. While some pairwise appraisals failed to differentiate between species, Acacias, in both data sets, clearly display significant differences in their S/G composition which distinguish them from eucalypts. This research shows the power of using Raman spectroscopy to supplant tedious, destructive methods for the evaluation of the lignin S/G ratio of diverse plant biomass materials.

Pre- and post-copulatory sexual selection in the least killifish, Heterandria formosa

It has been only recently realized that sexual selection does not end at copulation but that post-copulatory processes are often important in determining the fitness of individuals. In this thesis, I experimentally studied both pre- and post-copulatory sexual selection in the least killifish, Heterandria formosa. I found that this species suffers from severe inbreeding depression in male reproductive behaviour, offspring viability and offspring maturation times. Neither sex showed pre-copulatory inbreeding avoidance but when females mated with their brothers, less sperm were retrieved from their reproductive system compared to the situation when females mated with unrelated males. Whether the difference in sperm numbers is due to female or male effect could not be resolved. Based on theory, females should be more eager to avoid inbreeding than males in this species, because females invest more in their offspring than males do. Inbreeding seems to be an important part of this species biology and the severe inbreeding depression has most likely selected for the evolution of the post-copulatory inbreeding avoidance mechanism that I found. In addition, I studied the effects of polyandry on female reproductive success. When females mated with more than one male, they were more likely to get pregnant. However, I also found a cost of polyandry. The offspring of females mated to four males took longer to reach sexual maturity compared to the offspring of monandrous females. This cost may be explained by parent-offspring conflict over maternal resource allocation. In another experiment, in which within-brood relatedness was manipulated, offspring sizes decreased over time when within-brood relatedness was low. This result is partly in accordance with the kinship theory of genomic imprinting. When relatedness decreases, offspring are expected to be less co-operative and demand fewer resources from their mother, which leads to impaired development. In the last chapter of my thesis, I show that H. formosa males do not prefer large females as in other Poeciliidae species. I suggest that males view smaller females as more profitable mates because those are more likely virgin. In conclusion, I found both pre- and post-copulatory sexual selection to be important factors in determining reproductive success in H. formosa.

Mycobacterium tuberculosis FtsZ requires at least one arginine residue at the C-terminal end for polymerization in vitro

We examined whether C-terminal residues of soluble recombinant FtsZ of Mycobacterium tuberculosis (MtFtsZ) have any role in MtFtsZ polymerization in vitro. MtFtsZ-delta C1, which lacks C-terminal extreme Arg residue (underlined in the C-terminal extreme stretch of 13 residues, DDDDVDVPPFMRR), but retaining the penultimate Arg residue (DDDDVDVPPFMR), polymerizes like full-length MtFtsZ in vitro. However, MtFtsZ-delta C2 that lacks both the Arg residues at the C-terminus (DDDDVDVPPFM), neither polymerizes at pH 6.5 nor forms even single- or double-stranded filaments at pH 7.7 in the presence of 10 mM CaCl2. Neither replacement of the penultimate Arg residue, in the C-terminal Arg deletion mutant DDDDVDVPPFMR, with Lys or His or Ala or Asp (DDDDVDVPPFMK/H/A/D) enabled polymerization. Although MtFtsZ-delta C2 showed secondary and tertiary structural changes, which might have affected polymerization, GTPase activity of MtFtsZ-delta C2 was comparable to that of MtFtsZ. These data suggest that MtFtsZ requires an Arg residue as the extreme C-terminal residue for polymerization in vitro. The polypeptide segment containing C-terminal 67 residues, whose coordinates were absent from MtFtsZ crystal structure, was modeled on tubulin and MtFtsZ dimers. Possibilities for the influence of the C-terminal Arg residues on the stability of the dimer and thereby on MtFtsZ polymerization have been discussed.

d-Regular Graphs of Acyclic Chromatic Index at Least d+2

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.

Site characterization model using least-square support vector machine and relevance vector machine based on corrected SPT data (N-c)

Statistical learning algorithms provide a viable framework for geotechnical engineering modeling. This paper describes two statistical learning algorithms applied for site characterization modeling based on standard penetration test (SPT) data. More than 2700 field SPT values (N) have been collected from 766 boreholes spread over an area of 220 sqkm area in Bangalore. To get N corrected value (N,), N values have been corrected (Ne) for different parameters such as overburden stress, size of borehole, type of sampler, length of connecting rod, etc. In three-dimensional site characterization model, the function N-c=N-c (X, Y, Z), where X, Y and Z are the coordinates of a point corresponding to N, value, is to be approximated in which N, value at any half-space point in Bangalore can be determined. The first algorithm uses least-square support vector machine (LSSVM), which is related to aridge regression type of support vector machine. The second algorithm uses relevance vector machine (RVM), which combines the strengths of kernel-based methods and Bayesian theory to establish the relationships between a set of input vectors and a desired output. The paper also presents the comparative study between the developed LSSVM and RVM model for site characterization. Copyright (C) 2009 John Wiley & Sons,Ltd.

A modified least squares algorithm to treat associations in liquid alloys

The associated model for binary systems has been modified to include volume effects and excess entropy arising from preferential interactions between the associate and the free atoms or between the free atoms. Equations for thermodynamic mixing functions have been derived. An optimization procedure using a modified conjugate gradient method has been used to evaluate the enthalpy and entropy interaction energies, the free energy of dissociation of the complex, its temperature dependance and the size of the associate. An expression for the concentration—concentration structure factor [Scc (0)] has been deduced from the modified associated solution model. The analysis has been applied to the thermodynamic mixing functions of liquid Ga-Te alloys at 1120 K, believed to contain Ga2Te3 associates. It is observed that the modified associated solution model incorporating volume effects and terms for the temperature dependance of interaction energies, describes the thermodynamic properties of Ga-Te system satisfactorily.

Parameter estimation in water-distribution systems by least squares

The weighted-least-squares method using sensitivity-analysis technique is proposed for the estimation of parameters in water-distribution systems. The parameters considered are the Hazen-Williams coefficients for the pipes. The objective function used is the sum of the weighted squares of the differences between the computed and the observed values of the variables. The weighted-least-squares method can elegantly handle multiple loading conditions with mixed types of measurements such as heads and consumptions, different sets and number of measurements for each loading condition, and modifications in the network configuration due to inclusion or exclusion of some pipes affected by valve operations in each loading condition. Uncertainty in parameter estimates can also be obtained. The method is applied for the estimation of parameters in a metropolitan urban water-distribution system in India.

Least path criterion (LPC) for unique indexing in a two-dimensional decagonal quasilattice

The least path criterion or least path length in the context of redundant basis vector systems is discussed and a mathematical proof is presented of the uniqueness of indices obtained by applying the least path criterion. Though the method has greater generality, this paper concentrates on the two-dimensional decagonal lattice. The order of redundancy is also discussed; this will help eventually to correlate with other redundant but desirable indexing sets.

An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs

A low complexity, essentially-ML decoding technique for the Golden code and the three antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs)-the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity, and we give a set of sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the three and four antenna Perfect codes, the three antenna Threaded Algebraic Space-Time code and the four antenna rate 2 code of Srinath and Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm have the least decoding complexity and best error performance among all known codes for transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding implementation.