Lack of release of bound anthocyanins and phenolic acids from carrot plant cell walls and model composites during simulated gastric and small intestinal digestion

Separately, polyphenols and plant cell walls (PCW) are important contributors to the health benefits associated with fruits and vegetables. However, interactions with PCW which occur either during food preparation or mastication may affect bioaccessibility and hence bioavailability of polyphenols. Binding interactions between anthocyanins, phenolic acids (PAs) and PCW components, were evaluated using both a bacterial cellulose-pectin model system and a black carrot puree system. The majority of available polyphenols bound to PCW material with 60-70% of available anthocyanins and PAs respectively binding to black carrot puree PCW matter. Once bound, release of polyphenols using acidified methanol is low with only similar to 20% of total anthocyanins to similar to 30% of PAs being released. Less than 2% of bound polyphenol was released after in vitro gastric and small intestinal (S.I.) digestion for both the model system and the black carrot puree PCW matter. Confocal laser scanning microscopy shows localised binding of anthocyanins to PCW. Very similar patterns of binding for anthocyanins and PAs suggest that PAs form complexes with anthocyanins and polysaccharides. Time dependent changes in extractability with acidified methanol but not the total bound fraction suggests that initial nonspecific deposition on cellulose surfaces is followed by rearrangement of the bound molecules. Minimal release of anthocyanins and PAs after simulated gastric and S.I. digestion indicates that polyphenols in fruits and vegetables which bind to the PCW will be transported to the colon where they would be expected to be released by the action of cell wall degrading bacteria.

Design and flight testing of a bio-inspired plume tracking algorithm for unmanned serial vehicles

There is an increased interest on the use of UAVs for environmental research such as tracking bush fires, volcanic eruptions, chemical accidents or pollution sources. The aim of this paper is to describe the theory and results of a bio-inspired plume tracking algorithm. A method for generating sparse plumes in a virtual environment was also developed. Results indicated the ability of the algorithms to track plumes in 2D and 3D. The system has been tested with hardware in the loop (HIL) simulations and in flight using a CO2 gas sensor mounted to a multi-rotor UAV. The UAV is controlled by the plume tracking algorithm running on the ground control station (GCS).

First report of Vialaea minutella in Australia, its association with mango branch dieback and systematic placement of Vialaea in the Xylariales

Vialaea minutella was consistently isolated from infected mango trees showing branch dieback symptoms in northern Queensland. The fungus was identified by morphology and confirmed with molecular sequence data. This is the first report of V. minutella in Australia. The systematic position of Vialaea was confirmed to be in the Xylariales based on reconstructed LSU sequence data.

An algebraic algorithm for the design and analysis of linear dynamical systems

In an earlier paper [1], it has been shown that velocity ratio, defined with reference to the analogous circuit, is a basic parameter in the complete analysis of a linear one-dimensional dynamical system. In this paper it is shown that the terms constituting velocity ratio can be readily determined by means of an algebraic algorithm developed from a heuristic study of the process of transfer matrix multiplication. The algorithm permits the set of most significant terms at a particular frequency of interest to be identified from a knowledge of the relative magnitudes of the impedances of the constituent elements of a proposed configuration. This feature makes the algorithm a potential tool in a first approach to a rational design of a complex dynamical filter. This algorithm is particularly suited for the desk analysis of a medium size system with lumped as well as distributed elements.

Computational Techniques for Haplotype Inference and for Local Alignment Significance

This thesis which consists of an introduction and four peer-reviewed original publications studies the problems of haplotype inference (haplotyping) and local alignment significance. The problems studied here belong to the broad area of bioinformatics and computational biology. The presented solutions are computationally fast and accurate, which makes them practical in high-throughput sequence data analysis. Haplotype inference is a computational problem where the goal is to estimate haplotypes from a sample of genotypes as accurately as possible. This problem is important as the direct measurement of haplotypes is difficult, whereas the genotypes are easier to quantify. Haplotypes are the key-players when studying for example the genetic causes of diseases. In this thesis, three methods are presented for the haplotype inference problem referred to as HaploParser, HIT, and BACH. HaploParser is based on a combinatorial mosaic model and hierarchical parsing that together mimic recombinations and point-mutations in a biologically plausible way. In this mosaic model, the current population is assumed to be evolved from a small founder population. Thus, the haplotypes of the current population are recombinations of the (implicit) founder haplotypes with some point--mutations. HIT (Haplotype Inference Technique) uses a hidden Markov model for haplotypes and efficient algorithms are presented to learn this model from genotype data. The model structure of HIT is analogous to the mosaic model of HaploParser with founder haplotypes. Therefore, it can be seen as a probabilistic model of recombinations and point-mutations. BACH (Bayesian Context-based Haplotyping) utilizes a context tree weighting algorithm to efficiently sum over all variable-length Markov chains to evaluate the posterior probability of a haplotype configuration. Algorithms are presented that find haplotype configurations with high posterior probability. BACH is the most accurate method presented in this thesis and has comparable performance to the best available software for haplotype inference. Local alignment significance is a computational problem where one is interested in whether the local similarities in two sequences are due to the fact that the sequences are related or just by chance. Similarity of sequences is measured by their best local alignment score and from that, a p-value is computed. This p-value is the probability of picking two sequences from the null model that have as good or better best local alignment score. Local alignment significance is used routinely for example in homology searches. In this thesis, a general framework is sketched that allows one to compute a tight upper bound for the p-value of a local pairwise alignment score. Unlike the previous methods, the presented framework is not affeced by so-called edge-effects and can handle gaps (deletions and insertions) without troublesome sampling and curve fitting.

Soft gluon k(t)-resummation and the Froissart bound

We study soft gluon k(t)-resurnmation and the relevance of InfraRed (IR) gluons for the energy dependence of total hadronic cross-sections. In our model, consistency with the Froissart bound is directly related to the ansatz that the IR behaviour of the QCD coupling constant follows an inverse power law.

A real-time algorithm for simulation of flexible objects and hyper-redundant manipulators

Flexible objects such as a rope or snake move in a way such that their axial length remains almost constant. To simulate the motion of such an object, one strategy is to discretize the object into large number of small rigid links connected by joints. However, the resulting discretised system is highly redundant and the joint rotations for a desired Cartesian motion of any point on the object cannot be solved uniquely. In this paper, we revisit an algorithm, based on the classical tractrix curve, to resolve the redundancy in such hyper-redundant systems. For a desired motion of the `head' of a link, the `tail' is moved along a tractrix, and recursively all links of the discretised objects are moved along different tractrix curves. The algorithm is illustrated by simulations of a moving snake, tying of knots with a rope and a solution of the inverse kinematics of a planar hyper-redundant manipulator. The simulations show that the tractrix based algorithm leads to a more `natural' motion since the motion is distributed uniformly along the entire object with the displacements diminishing from the `head' to the `tail'.

A lower bound to the survival probability and an approximate first passage time distribution for Markovian and non-Markovian dynamics in phase space

We derive a very general expression of the survival probability and the first passage time distribution for a particle executing Brownian motion in full phase space with an absorbing boundary condition at a point in the position space, which is valid irrespective of the statistical nature of the dynamics. The expression, together with the Jensen's inequality, naturally leads to a lower bound to the actual survival probability and an approximate first passage time distribution. These are expressed in terms of the position-position, velocity-velocity, and position-velocity variances. Knowledge of these variances enables one to compute a lower bound to the survival probability and consequently the first passage distribution function. As examples, we compute these for a Gaussian Markovian process and, in the case of non-Markovian process, with an exponentially decaying friction kernel and also with a power law friction kernel. Our analysis shows that the survival probability decays exponentially at the long time irrespective of the nature of the dynamics with an exponent equal to the transition state rate constant.

Two-level k-means clustering algorithm for k-tau relationship establishment and linear-time classification

Partitional clustering algorithms, which partition the dataset into a pre-defined number of clusters, can be broadly classified into two types: algorithms which explicitly take the number of clusters as input and algorithms that take the expected size of a cluster as input. In this paper, we propose a variant of the k-means algorithm and prove that it is more efficient than standard k-means algorithms. An important contribution of this paper is the establishment of a relation between the number of clusters and the size of the clusters in a dataset through the analysis of our algorithm. We also demonstrate that the integration of this algorithm as a pre-processing step in classification algorithms reduces their running-time complexity.

Free and ATP-bound structures of Ap(4)A hydrolase from Aquifex aeolicus V5

Asymmetric diadenosine tetraphosphate (Ap(4)A) hydrolases degrade the metabolite Ap(4)A back into ATP and AMP. The three-dimensional crystal structure of Ap(4)A hydrolase (16 kDa) from Aquifex aeolicus has been determined in free and ATP-bound forms at 1.8 and 1.95 angstrom resolution, respectively. The overall three-dimensional crystal structure of the enzyme shows an alpha beta alpha-sandwich architecture with a characteristic loop adjacent to the catalytic site of the protein molecule. The ATP molecule is bound in the primary active site and the adenine moiety of the nucleotide binds in a ring-stacking arrangement equivalent to that observed in the X-ray structure of Ap(4)A hydrolase from Caenorhabditis elegans. Binding of ATP in the active site induces local conformational changes which may have important implications in the mechanism of substrate recognition in this class of enzymes. Furthermore, two invariant water molecules have been identified and their possible structural and/or functional roles are discussed. In addition, modelling of the substrate molecule at the primary active site of the enzyme suggests a possible path for entry and/or exit of the substrate and/or product molecule.

Convergence analysis of the Newton algorithm and a pseudo-time marching scheme for diffuse correlation tomography

We propose a self-regularized pseudo-time marching scheme to solve the ill-posed, nonlinear inverse problem associated with diffuse propagation of coherent light in a tissuelike object. In particular, in the context of diffuse correlation tomography (DCT), we consider the recovery of mechanical property distributions from partial and noisy boundary measurements of light intensity autocorrelation. We prove the existence of a minimizer for the Newton algorithm after establishing the existence of weak solutions for the forward equation of light amplitude autocorrelation and its Frechet derivative and adjoint. The asymptotic stability of the solution of the ordinary differential equation obtained through the introduction of the pseudo-time is also analyzed. We show that the asymptotic solution obtained through the pseudo-time marching converges to that optimal solution provided the Hessian of the forward equation is positive definite in the neighborhood of optimal solution. The superior noise tolerance and regularization-insensitive nature of pseudo-dynamic strategy are proved through numerical simulations in the context of both DCT and diffuse optical tomography. (C) 2010 Optical Society of America.

An efficient algorithm for scheduling in bluetooth piconets and scatternets

Bluetooth is a short-range radio technology operating in the unlicensed industrial-scientific-medical (ISM) band at 2.45 GHz. A piconet is basically a collection of slaves controlled by a master. A scatternet, on the other hand, is established by linking several piconets together in an ad hoc fashion to yield a global wireless ad hoc network. This paper proposes a scheduling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in bluetooth piconets and scatternets. We propose a novel algorithm for scheduling slots to slaves for both piconets and scatternets using multi-layered parameterized policies. Our scheduling scheme works with real data and obtains an optimal feedback policy within prescribed parameterized classes of these by using an efficient two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm. We show the convergence of our algorithm to an optimal multi-layered policy. We also propose novel polling schemes for intra- and inter-piconet scheduling that are seen to perform well. We present an extensive set of simulation results and performance comparisons with existing scheduling algorithms. Our results indicate that our proposed scheduling algorithm performs better overall on a wide range of experiments over the existing algorithms for both piconets (Das et al. in INFOCOM, pp. 591–600, 2001; Lapeyrie and Turletti in INFOCOM conference proceedings, San Francisco, US, 2003; Shreedhar and Varghese in SIGCOMM, pp. 231–242, 1995) and scatternets (Har-Shai et al. in OPNETWORK, 2002; Saha and Matsumot in AICT/ICIW, 2006; Tan and Guttag in The 27th annual IEEE conference on local computer networks(LCN). Tampa, 2002). Our studies also confirm that our proposed scheme achieves a high throughput and low packet delays with reasonable fairness among all the connections.

An efficient and optimized bluetooth scheduling algorithm for piconets

Bluetooth is an emerging standard in short range, low cost and low power wireless networks. MAC is a generic polling based protocol, where a central Bluetooth unit (master) determines channel access to all other nodes (slaves) in the network (piconet). An important problem in Bluetooth is the design of efficient scheduling protocols. This paper proposes a polling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in a Bluetooth Piconet. We present an extensive set of simulation results and performance comparisons with two important existing algorithms. Our results indicate that our proposed scheduling algorithm outperforms the Round Robin scheduling algorithm by more than 40% in all cases tried. Our study also confirms that our proposed policy achieves higher throughput and lower packet delays with reasonable fairness among all the connections.

Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

Spin and relativistic motion of bound states

The wave functions of moving bound states may be expected to contract in the direction of motion, in analogy to a rigid rod in classical special relativity, when the constituents are at equal (ordinary) time. Indeed, the Lorentz contraction of wave functions is often appealed to in qualitative discussions. However, only few field theory studies exist of equal-time wave functions in motion. In this thesis I use the Bethe-Salpeter formalism to study the wave function of a weakly bound state such as a hydrogen atom or positronium in a general frame. The wave function of the e^-e^+ component of positronium indeed turns out to Lorentz contract both in 1+1 and in 3+1 dimensional quantum electrodynamics, whereas the next-to-leading e^-e^+\gamma Fock component of the 3+1 dimensional theory deviates from classical contraction. The second topic of this thesis concerns single spin asymmetries measured in scattering on polarized bound states. Such spin asymmetries have so far mainly been analyzed using the twist expansion of perturbative QCD. I note that QCD vacuum effects may give rise to a helicity flip in the soft rescattering of the struck quark, and that this would cause a nonvanishing spin asymmetry in \ell p^\uparrow -> \ell' + \pi + X in the Bjorken limit. An analogous asymmetry may arise in p p^\uparrow -> \pi + X from Pomeron-Odderon interference, if the Odderon has a helicity-flip coupling. Finally, I study the possibility that the large single spin asymmetry observed in p p^\uparrow -> \pi(x_F,k_\perp) + X when the pion carries a high momentum fraction x_F of the polarized proton momentum arises from coherent effects involving the entire polarized bound state.