Modification of arthropod vector competence via symbiotic bacteria

Some of the world's most devastating diseases are transmitted by arthropod vectors. Attempts to control these arthropods are currently being challenged by the widespread appearance of insecticide resistance. It is therefore desirable to develop alternative strategies to complement existing methods of vector control. In this review, Charles Beard, Scott O'Neill, Robert Tesh, Frank Richards and Serap Aksoy present an approach for introducing foreign genes into insects in order to confer refractoriness to vector populations, ie. the inability to transmit disease-causing agents. This approach aims to express foreign anti-parasitic or anti-viral gene products in symbiotic bacteria harbored by insects. The potential use of naturally occurring symbiont-based mechanisms in the spread of such refractory phenotypes is also discussed.

A framework for electricity price spike analysis with advanced data mining methods

There are many techniques for electricity market price forecasting. However, most of them are designed for expected price analysis rather than price spike forecasting. An effective method of predicting the occurrence of spikes has not yet been observed in the literature so far. In this paper, a data mining based approach is presented to give a reliable forecast of the occurrence of price spikes. Combined with the spike value prediction techniques developed by the same authors, the proposed approach aims at providing a comprehensive tool for price spike forecasting. In this paper, feature selection techniques are firstly described to identify the attributes relevant to the occurrence of spikes. A simple introduction to the classification techniques is given for completeness. Two algorithms: support vector machine and probability classifier are chosen to be the spike occurrence predictors and are discussed in details. Realistic market data are used to test the proposed model with promising results.

Matrix elements of U(2n) generators in a multishell spin-orbit basis. I. The del-operator MEs in a two-shell composite Gelfand-Paldus basis

This is the first in a series of three articles which aimed to derive the matrix elements of the U(2n) generators in a multishell spin-orbit basis. This is a basis appropriate to many-electron systems which have a natural partitioning of the orbital space and where also spin-dependent terms are included in the Hamiltonian. The method is based on a new spin-dependent unitary group approach to the many-electron correlation problem due to Gould and Paldus [M. D. Gould and J. Paldus, J. Chem. Phys. 92, 7394, (1990)]. In this approach, the matrix elements of the U(2n) generators in the U(n) x U(2)-adapted electronic Gelfand basis are determined by the matrix elements of a single Ll(n) adjoint tensor operator called the del-operator, denoted by Delta(j)(i) (1 less than or equal to i, j less than or equal to n). Delta or del is a polynomial of degree two in the U(n) matrix E = [E-j(i)]. The approach of Gould and Paldus is based on the transformation properties of the U(2n) generators as an adjoint tensor operator of U(n) x U(2) and application of the Wigner-Eckart theorem. Hence, to generalize this approach, we need to obtain formulas for the complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. The nonzero shift coefficients are uniquely determined and may he evaluated by the methods of Gould et al. [see the above reference]. In this article, we define zero-shift adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis which are appropriate to the many-electron problem. By definition, these are proportional to the corresponding two-shell del-operator matrix elements, and it is shown that the Racah factorization lemma applies. Formulas for these coefficients are then obtained by application of the Racah factorization lemma. The zero-shift adjoint reduced Wigner coefficients required for this procedure are evaluated first. All these coefficients are needed later for the multishell case, which leads directly to the two-shell del-operator matrix elements. Finally, we discuss an application to charge and spin densities in a two-shell molecular system. (C) 1998 John Wiley & Sons.

Matrix elements of U(2n) generators in a multishell spin-orbit basis. III. General formulas

This is the third and final article in a series directed toward the evaluation of the U(2n) generator matrix elements (MEs) in a multishell spin/orbit basis. Such a basis is required for many-electron systems possessing a partitioned orbital space and where spin-dependence is important. The approach taken is based on the transformation properties of the U(2n) generators as an adjoint tensor operator of U(n) x U(2) and application of the Wigner-Eckart theorem. A complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis (which is appropriate to the many-electron problem) were obtained in the first and second articles of this series. Ln the first article we defined zero-shift coupling coefficients. These are proportional to the corresponding two-shell del-operator matrix elements. See P. J. Burton and and M. D. Gould, J. Chem. Phys., 104, 5112 (1996), for a discussion of the del-operator and its properties. Ln the second article of the series, the nonzero shift coupling coefficients were derived. Having obtained all the necessary coefficients, we now apply the formalism developed above to obtain the U(2n) generator MEs in a multishell spin-orbit basis. The methods used are based on the work of Gould et al. (see the above reference). (C) 1998 John Wiley & Sons, Inc.

Optimising fed-batch production of recombinant proteins using the baculovirus expression vector system

Fed-batch culture can offer significant improvement in recombinant protein production compared to batch culture in the baculovirus expression vector system (BEVS), as shown by Nguyen et al. (1993) and Bedard et al. (1994) among others. However, a thorough analysis of fed-batch culture to determine its limits in improving recombinant protein production over batch culture has yet to be performed. In this work, this issue is addressed by the optimisation of single-addition fed-batch culture. This type of fed-batch culture involves the manual addition of a multi-component nutrient feed to batch culture before infection with the baculovirus. The nutrient feed consists of yeastolate ultrafiltrate, lipids, amino acids, vitamins, trace elements, and glucose, which were added to batch cultures of Spodoptera frugiperda (Sf9) cells before infection with a recombinant Autographa californica nuclear polyhedrosis virus (Ac-NPV) expressing beta-galactosidase (beta-Gal). The fed-batch production of beta-Gal was optimised using response surface methods (RSM). The optimisation was performed in two stages, starting with a screening procedure to determine the most important variables and ending with a central-composite experiment to obtain a response surface model of volumetric beta-Gal production. The predicted optimum volumetric yield of beta-Gal in fed-batch culture was 2.4-fold that of the best yields in batch culture. This result was confirmed by a statistical analysis of the best fed-batch and batch data (with average beta-Gal yields of 1.2 and 0.5 g/L, respectively) obtained from this laboratory. The response surface model generated can be used to design a more economical fed-batch operation, in which nutrient feed volumes are minimised while maintaining acceptable improvements in beta-Gal yield. (C) 1998 John Wiley & Sons, Inc.

Computational chemistry on Fujitsu vector-parallel processors: Development and performance of applications software

In this and a preceding paper, we provide an introduction to the Fujitsu VPP range of vector-parallel supercomputers and to some of the computational chemistry software available for the VPP. Here, we consider the implementation and performance of seven popular chemistry application packages. The codes discussed range from classical molecular dynamics to semiempirical and ab initio quantum chemistry. All have evolved from sequential codes, and have typically been parallelised using a replicated data approach. As such they are well suited to the large-memory/fast-processor architecture of the VPP. For one code, CASTEP, a distributed-memory data-driven parallelisation scheme is presented. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

Methods for prediction of peptide binding to MHC molecules: A comparative study

Background: A variety of methods for prediction of peptide binding to major histocompatibility complex (MHC) have been proposed. These methods are based on binding motifs, binding matrices, hidden Markov models (HMM), or artificial neural networks (ANN). There has been little prior work on the comparative analysis of these methods. Materials and Methods: We performed a comparison of the performance of six methods applied to the prediction of two human MHC class I molecules, including binding matrices and motifs, ANNs, and HMMs. Results: The selection of the optimal prediction method depends on the amount of available data (the number of peptides of known binding affinity to the MHC molecule of interest), the biases in the data set and the intended purpose of the prediction (screening of a single protein versus mass screening). When little or no peptide data are available, binding motifs are the most useful alternative to random guessing or use of a complete overlapping set of peptides for selection of candidate binders. As the number of known peptide binders increases, binding matrices and HMM become more useful predictors. ANN and HMM are the predictive methods of choice for MHC alleles with more than 100 known binding peptides. Conclusion: The ability of bioinformatic methods to reliably predict MHC binding peptides, and thereby potential T-cell epitopes, has major implications for clinical immunology, particularly in the area of vaccine design.

Computational methods for prediction of T-cell epitopes - a framework for modelling, testing, and applications

Computational models complement laboratory experimentation for efficient identification of MHC-binding peptides and T-cell epitopes. Methods for prediction of MHC-binding peptides include binding motifs, quantitative matrices, artificial neural networks, hidden Markov models, and molecular modelling. Models derived by these methods have been successfully used for prediction of T-cell epitopes in cancer, autoimmunity, infectious disease, and allergy. For maximum benefit, the use of computer models must be treated as experiments analogous to standard laboratory procedures and performed according to strict standards. This requires careful selection of data for model building, and adequate testing and validation. A range of web-based databases and MHC-binding prediction programs are available. Although some available prediction programs for particular MHC alleles have reasonable accuracy, there is no guarantee that all models produce good quality predictions. In this article, we present and discuss a framework for modelling, testing, and applications of computational methods used in predictions of T-cell epitopes. (C) 2004 Elsevier Inc. All rights reserved.

Integer matrix diagonalization

We consider algorithms for computing the Smith normal form of integer matrices. A variety of different strategies have been proposed, primarily aimed at avoiding the major obstacle that occurs in such computations-explosive growth in size of intermediate entries. We present a new algorithm with excellent performance. We investigate the complexity of such computations, indicating relationships with NP-complete problems. We also describe new heuristics which perform well in practice. Wie present experimental evidence which shows our algorithm outperforming previous methods. (C) 1997 Academic Press Limited.

Matrix metalloproteinases and their inhibitors in oral lichen planus

Background: Oral lichen planus (OLP) is characterized by a subepithelial lymphocytic infiltrate, basement membrane (BM) disruption, intra-epithelial T-cell migration and apoptosis of basal keratinocytes. BM damage and T-cell migration in OLP may be mediated by matrix metalloproteinases (MMPs). Methods: We examined the distribution, activation and cellular sources of MMPs and their inhibitors (TIMPs) in OLP using immunohistochemistry, ELISA, RT-PCR and zymography. Results: MMP-2 and -3 were present in the epithelium while MMP-9 was associated with the inflammatory infiltrate. MMP-9 and TIMP-1 secretion by OLP lesional T cells was greater than OLP patient (p

Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Development and implementation of the population Fisher information matrix for the evaluation of population pharmacokinetic designs.

In population pharmacokinetic studies, the precision of parameter estimates is dependent on the population design. Methods based on the Fisher information matrix have been developed and extended to population studies to evaluate and optimize designs. In this paper we propose simple programming tools to evaluate population pharmacokinetic designs. This involved the development of an expression for the Fisher information matrix for nonlinear mixed-effects models, including estimation of the variance of the residual error. We implemented this expression as a generic function for two software applications: S-PLUS and MATLAB. The evaluation of population designs based on two pharmacokinetic examples from the literature is shown to illustrate the efficiency and the simplicity of this theoretic approach. Although no optimization method of the design is provided, these functions can be used to select and compare population designs among a large set of possible designs, avoiding a lot of simulations.

Relationship of glycosaminoglycan and matrix changes to vascular smooth cell phenotype modulation in rabbit arteries after acute injury

Purpose: The phenotype of vascular smooth muscle cells (SMCs) is altered in several arterial pathologies, including the neointima formed after acute arterial injury. This study examined the time course of this phenotypic change in relation to changes in the amount and distribution of matrix glycosaminoglycans. Methods: The immunochemical staining of heparan sulphates (HS) and chondroitin sulphates (CS) in the extracellular matrix of the arterial wall was examined at early points after balloon catheter injury of the rabbit carotid artery. SMC phenotype was assessed by means of ultrastructural morphometry of the cytoplasmic volume fraction of myofilaments. The proportions of cell and matrix components in the media were analyzed with similar morphometric techniques. Results: HS and CS were shown in close association with SMCs of the uninjured arterial media as well as being more widespread within the matrix. Within 6 hours after arterial injury, there was loss of the regular pericellular distribution of both HS and CS, which was associated with a significant expansion in the extracellular space. This preceded the change in ultrastructural phenotype of the SMCs. The glycosaminoglycan loss was most exaggerated at 4 days, after which time the HS and CS reappeared around the medial SMCs. SMCs of the recovering media were able to rapidly replace their glycosaminoglycans, whereas SMCs of the developing neointima failed to produce HS as readily as they produced CS. Conclusions: These studies indicate that changes in glycosaminoglycans of the extracellular matrix precede changes in SMC phenotype after acute arterial injury. In the recovering arterial media, SMCs replace their matrix glycosaminoglycans rapidly, whereas the newly established neointima fails to produce similar amounts of heparan sulphates.

Time evolution in the unimolecular master equation at low temperatures: full spectral solution with scalable iterative methods and high precision

A new method is presented to determine an accurate eigendecomposition of difficult low temperature unimolecular master equation problems. Based on a generalisation of the Nesbet method, the new method is capable of achieving complete spectral resolution of the master equation matrix with relative accuracy in the eigenvectors. The method is applied to a test case of the decomposition of ethane at 300 K from a microcanonical initial population with energy transfer modelled by both Ergodic Collision Theory and the exponential-down model. The fact that quadruple precision (16-byte) arithmetic is required irrespective of the eigensolution method used is demonstrated. (C) 2001 Elsevier Science B.V. All rights reserved.

Lanczos subspace filter diagonalization: Homogeneous recursive filtering and a low-storage method for the calculation of matrix elements

We develop a new iterative filter diagonalization (FD) scheme based on Lanczos subspaces and demonstrate its application to the calculation of bound-state and resonance eigenvalues. The new scheme combines the Lanczos three-term vector recursion for the generation of a tridiagonal representation of the Hamiltonian with a three-term scalar recursion to generate filtered states within the Lanczos representation. Eigenstates in the energy windows of interest can then be obtained by solving a small generalized eigenvalue problem in the subspace spanned by the filtered states. The scalar filtering recursion is based on the homogeneous eigenvalue equation of the tridiagonal representation of the Hamiltonian, and is simpler and more efficient than our previous quasi-minimum-residual filter diagonalization (QMRFD) scheme (H. G. Yu and S. C. Smith, Chem. Phys. Lett., 1998, 283, 69), which was based on solving for the action of the Green operator via an inhomogeneous equation. A low-storage method for the construction of Hamiltonian and overlap matrix elements in the filtered-basis representation is devised, in which contributions to the matrix elements are computed simultaneously as the recursion proceeds, allowing coefficients of the filtered states to be discarded once their contribution has been evaluated. Application to the HO2 system shows that the new scheme is highly efficient and can generate eigenvalues with the same numerical accuracy as the basic Lanczos algorithm.