Recommendations for the viability assessment of probiotics as concentrated cultures and in food matrices

Due to the fact that probiotic cells need to be alive when they are consumed, culture-based analysis (plate count) is critical in ascertaining the quality (numbers of viable cells) of probiotic products. Since probiotic cells are typically stressed, due to various factors related to their production, processing and formulation, the standard methodology for total plate counts tends to underestimate the cell numbers of these products. Furthermore, products such as microencapsulated cultures require modifications in the release and sampling procedure in order to correctly estimate viable counts. This review examines the enumeration of probiotic bacteria in the following commercial products: powders, microencapsulated cultures, frozen concentrates, capsules, foods and beverages. The parameters which are specifically examined include: sample preparation (rehydration, thawing), dilutions (homogenization, media) and plating (media, incubation) procedures. Recommendations are provided for each of these analytical steps to improve the accuracy of the analysis. Although the recommendations specifically target the analysis of probiotics, many will apply to the analysis of commercial lactic starter cultures used in food fermentations as well.

Limit operators, collective compactness, and the spectral theory of infinite matrices

In the first half of this memoir we explore the interrelationships between the abstract theory of limit operators (see e.g. the recent monographs of Rabinovich, Roch and Silbermann (2004) and Lindner (2006)) and the concepts and results of the generalised collectively compact operator theory introduced by Chandler-Wilde and Zhang (2002). We build up to results obtained by applying this generalised collectively compact operator theory to the set of limit operators of an operator (its operator spectrum). In the second half of this memoir we study bounded linear operators on the generalised sequence space , where and is some complex Banach space. We make what seems to be a more complete study than hitherto of the connections between Fredholmness, invertibility, invertibility at infinity, and invertibility or injectivity of the set of limit operators, with some emphasis on the case when the operator is a locally compact perturbation of the identity. Especially, we obtain stronger results than previously known for the subtle limiting cases of and . Our tools in this study are the results from the first half of the memoir and an exploitation of the partial duality between and and its implications for bounded linear operators which are also continuous with respect to the weaker topology (the strict topology) introduced in the first half of the memoir. Results in this second half of the memoir include a new proof that injectivity of all limit operators (the classic Favard condition) implies invertibility for a general class of almost periodic operators, and characterisations of invertibility at infinity and Fredholmness for operators in the so-called Wiener algebra. In two final chapters our results are illustrated by and applied to concrete examples. Firstly, we study the spectra and essential spectra of discrete Schrödinger operators (both self-adjoint and non-self-adjoint), including operators with almost periodic and random potentials. In the final chapter we apply our results to integral operators on .

The state estimation of flow demands in gas networks from sparse pressure telemetry

This paper presents novel observer-based techniques for the estimation of flow demands in gas networks, from sparse pressure telemetry. A completely observable model is explored, constructed by incorporating difference equations that assume the flow demands are steady. Since the flow demands usually vary slowly with time, this is a reasonable approximation. Two techniques for constructing robust observers are employed: robust eigenstructure assignment and singular value assignment. These techniques help to reduce the effects of the system approximation. Modelling error may be further reduced by making use of known profiles for the flow demands. The theory is extended to deal successfully with the problem of measurement bias. The pressure measurements available are subject to constant biases which degrade the flow demand estimates, and such biases need to be estimated. This is achieved by constructing a further model variation that incorporates the biases into an augmented state vector, but now includes information about the flow demand profiles in a new form.

Layer-by-layer coating of alginate matrices with chitosan–alginate for the improved survival and targeted delivery of probiotic bacteria after oral administration

The oral administration of probiotic bacteria has shown potential in clinical trials for the alleviation of specific disorders of the gastrointestinal tract. However, cells must be alive in order to exert these benefits. The low pH of the stomach can greatly reduce the number of viable microorganisms that reach the intestine, thereby reducing the efficacy of the administration. Herein, a model probiotic, Bifidobacterium breve, has been encapsulated into an alginate matrix before coating in multilayers of alternating alginate and chitosan. The intention of this formulation was to improve the survival of B. breve during exposure to low pH and to target the delivery of the cells to the intestine. The material properties were first characterized before in vitro testing. Biacore™ experiments allowed for the polymer interactions to be confirmed; additionally, the stability of these multilayers to buffers simulating the pH of the gastrointestinal tract was demonstrated. Texture analysis was used to monitor changes in the gel strength during preparation, showing a weakening of the matrices during coating as a result of calcium ion sequestration. The build-up of multilayers was confirmed by confocal laser-scanning microscopy, which also showed the increase in the thickness of coat over time. During exposure to in vitro gastric conditions, an increase in viability from <3 log(CFU) per mL, seen in free cells, up to a maximum of 8.84 ± 0.17 log(CFU) per mL was noted in a 3-layer coated matrix. Multilayer-coated alginate matrices also showed a targeting of delivery to the intestine, with a gradual release of their loads over 240 min.

CLSM method for the dynamic observation of pH change within polymer matrices for oral delivery

If acid-sensitive drugs or cells are administered orally, there is often a reduction in efficacy associated with gastric passage. Formulation into a polymer matrix is a potential method to improve their stability. The visualization of pH within these materials may help better understand the action of these polymer systems and allow comparison of different formulations. We herein describe the development of a novel confocal laser-scanning microscopy (CLSM) method for visualizing pH changes within polymer matrices and demonstrate its applicability to an enteric formulation based on chitosan-coated alginate gels. The system in question is first shown to protect an acid-sensitive bacterial strain to low pH, before being studied by our technique. Prior to this study, it has been claimed that protection by these materials is a result of buffering, but this has not been demonstrated. The visualization of pH within these matrices during exposure to a pH 2.0 simulated gastric solution showed an encroachment of acid from the periphery of the capsule, and a persistence of pHs above 2.0 within the matrix. This implies that the protective effect of the alginate-chitosan matrices is most likely due to a combination of buffering of acid as it enters the polymer matrix and the slowing of acid penetration.

Sparse shape representation using the Laplace-Beltrami eigenfunctions and its application to modeling subcortical structures

We present a new sparse shape modeling framework on the Laplace-Beltrami (LB) eigenfunctions. Traditionally, the LB-eigenfunctions are used as a basis for intrinsically representing surface shapes by forming a Fourier series expansion. To reduce high frequency noise, only the first few terms are used in the expansion and higher frequency terms are simply thrown away. However, some lower frequency terms may not necessarily contribute significantly in reconstructing the surfaces. Motivated by this idea, we propose to filter out only the significant eigenfunctions by imposing l1-penalty. The new sparse framework can further avoid additional surface-based smoothing often used in the field. The proposed approach is applied in investigating the influence of age (38-79 years) and gender on amygdala and hippocampus shapes in the normal population. In addition, we show how the emotional response is related to the anatomy of the subcortical structures.

Sparse probability density function estimation using the minimum integrated square error

We develop a new sparse kernel density estimator using a forward constrained regression framework, within which the nonnegative and summing-to-unity constraints of the mixing weights can easily be satisfied. Our main contribution is to derive a recursive algorithm to select significant kernels one at time based on the minimum integrated square error (MISE) criterion for both the selection of kernels and the estimation of mixing weights. The proposed approach is simple to implement and the associated computational cost is very low. Specifically, the complexity of our algorithm is in the order of the number of training data N, which is much lower than the order of N2 offered by the best existing sparse kernel density estimators. Numerical examples are employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with comparable accuracy to those of the classical Parzen window estimate and other existing sparse kernel density estimators.

A fast algorithm for sparse probability density function construction

A new sparse kernel density estimator is introduced. Our main contribution is to develop a recursive algorithm for the selection of significant kernels one at time using the minimum integrated square error (MISE) criterion for both kernel selection. The proposed approach is simple to implement and the associated computational cost is very low. Numerical examples are employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with competitive accuracy to existing kernel density estimators.

Sparse model construction using coordinate descent optimization

We propose a new sparse model construction method aimed at maximizing a model’s generalisation capability for a large class of linear-in-the-parameters models. The coordinate descent optimization algorithm is employed with a modified l1- penalized least squares cost function in order to estimate a single parameter and its regularization parameter simultaneously based on the leave one out mean square error (LOOMSE). Our original contribution is to derive a closed form of optimal LOOMSE regularization parameter for a single term model, for which we show that the LOOMSE can be analytically computed without actually splitting the data set leading to a very simple parameter estimation method. We then integrate the new results within the coordinate descent optimization algorithm to update model parameters one at the time for linear-in-the-parameters models. Consequently a fully automated procedure is achieved without resort to any other validation data set for iterative model evaluation. Illustrative examples are included to demonstrate the effectiveness of the new approaches.

Sparse polynomial approximation in positive order Sobolev spaces with bounded mixed derivatives and applications to elliptic problems with random loading

In the present paper we study the approximation of functions with bounded mixed derivatives by sparse tensor product polynomials in positive order tensor product Sobolev spaces. We introduce a new sparse polynomial approximation operator which exhibits optimal convergence properties in L2 and tensorized View the MathML source simultaneously on a standard k-dimensional cube. In the special case k=2 the suggested approximation operator is also optimal in L2 and tensorized H1 (without essential boundary conditions). This allows to construct an optimal sparse p-version FEM with sparse piecewise continuous polynomial splines, reducing the number of unknowns from O(p2), needed for the full tensor product computation, to View the MathML source, required for the suggested sparse technique, preserving the same optimal convergence rate in terms of p. We apply this result to an elliptic differential equation and an elliptic integral equation with random loading and compute the covariances of the solutions with View the MathML source unknowns. Several numerical examples support the theoretical estimates.

Spectra of a class of non-self-adjoint matrices

We consider a new class of non-self-adjoint matrices that arise from an indefinite self- adjoint linear pencil of matrices, and obtain the spectral asymptotics of the spectra as the size of the matrices diverges to infinity. We prove that the spectrum is qualitatively different when a certain parameter c equals 0, and when it is non-zero, and that certain features of the spectrum depend on Diophantine properties of c.

On the spectra and pseudospectra of a class of non-self-adjoint random matrices and operators

In this paper we develop and apply methods for the spectral analysis of non-selfadjoint tridiagonal infinite and finite random matrices, and for the spectral analysis of analogous deterministic matrices which are pseudo-ergodic in the sense of E. B. Davies (Commun. Math. Phys. 216 (2001), 687–704). As a major application to illustrate our methods we focus on the “hopping sign model” introduced by J. Feinberg and A. Zee (Phys. Rev. E 59 (1999), 6433–6443), in which the main objects of study are random tridiagonal matrices which have zeros on the main diagonal and random ±1’s as the other entries. We explore the relationship between spectral sets in the finite and infinite matrix cases, and between the semi-infinite and bi-infinite matrix cases, for example showing that the numerical range and p-norm ε - pseudospectra (ε > 0, p ∈ [1,∞] ) of the random finite matrices converge almost surely to their infinite matrix counterparts, and that the finite matrix spectra are contained in the infinite matrix spectrum Σ. We also propose a sequence of inclusion sets for Σ which we show is convergent to Σ, with the nth element of the sequence computable by calculating smallest singular values of (large numbers of) n×n matrices. We propose similar convergent approximations for the 2-norm ε -pseudospectra of the infinite random matrices, these approximations sandwiching the infinite matrix pseudospectra from above and below.

Sample preparation: a crucial factor for the analytical performance of rationally designed MALDI matrices

Evidence is presented that the performance of the rationally designed MALDI matrix 4-chloro-α-cyanocinnamic acid (ClCCA) in comparison to its well-established predecessor α-cyano-4-hydroxycinnamic acid (CHCA) is significantly dependent on the sample preparation, such as the choice of the target plate. In this context, it becomes clear that any rational designs of MALDI matrices and their successful employment have to consider a larger set of physicochemical parameters, including sample crystallization and morphology/topology, in addition to parameters of basic (solution and/or gas-phase) chemistry.