A Wiener model for memory high power amplifiers using B-spline function approximation

In this paper we introduce a new Wiener system modeling approach for memory high power amplifiers in communication systems using observational input/output data. By assuming that the nonlinearity in the Wiener model is mainly dependent on the input signal amplitude, the complex valued nonlinear static function is represented by two real valued B-spline curves, one for the amplitude distortion and another for the phase shift, respectively. The Gauss-Newton algorithm is applied for the parameter estimation, which incorporates the De Boor algorithm, including both the B-spline curve and the first order derivatives recursion. An illustrative example is utilized to demonstrate the efficacy of the proposed approach.

Statistical deconvolution of enthalpic energetic contributions to MHC-peptide binding affinity

Background: MHC Class I molecules present antigenic peptides to cytotoxic T cells, which forms an integral part of the adaptive immune response. Peptides are bound within a groove formed by the MHC heavy chain. Previous approaches to MHC Class I-peptide binding prediction have largely concentrated on the peptide anchor residues located at the P2 and C-terminus positions. Results: A large dataset comprising MHC-peptide structural complexes was created by remodelling pre-determined x-ray crystallographic structures. Static energetic analysis, following energy minimisation, was performed on the dataset in order to characterise interactions between bound peptides and the MHC Class I molecule, partitioning the interactions within the groove into van der Waals, electrostatic and total non-bonded energy contributions. Conclusion: The QSAR techniques of Genetic Function Approximation (GFA) and Genetic Partial Least Squares (G/PLS) algorithms were used to identify key interactions between the two molecules by comparing the calculated energy values with experimentally-determined BL50 data. Although the peptide termini binding interactions help ensure the stability of the MHC Class I-peptide complex, the central region of the peptide is also important in defining the specificity of the interaction. As thermodynamic studies indicate that peptide association and dissociation may be driven entropically, it may be necessary to incorporate entropic contributions into future calculations.

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

Bloom filters are a data structure for storing data in a compressed form. They offer excellent space and time efficiency at the cost of some loss of accuracy (so-called lossy compression). This work presents a yes-no Bloom filter, which as a data structure consisting of two parts: the yes-filter which is a standard Bloom filter and the no-filter which is another Bloom filter whose purpose is to represent those objects that were recognised incorrectly by the yes-filter (that is, to recognise the false positives of the yes-filter). By querying the no-filter after an object has been recognised by the yes-filter, we get a chance of rejecting it, which improves the accuracy of data recognition in comparison with the standard Bloom filter of the same total length. A further increase in accuracy is possible if one chooses objects to include in the no-filter so that the no-filter recognises as many as possible false positives but no true positives, thus producing the most accurate yes-no Bloom filter among all yes-no Bloom filters. This paper studies how optimization techniques can be used to maximize the number of false positives recognised by the no-filter, with the constraint being that it should recognise no true positives. To achieve this aim, an Integer Linear Program (ILP) is proposed for the optimal selection of false positives. In practice the problem size is normally large leading to intractable optimal solution. Considering the similarity of the ILP with the Multidimensional Knapsack Problem, an Approximate Dynamic Programming (ADP) model is developed making use of a reduced ILP for the value function approximation. Numerical results show the ADP model works best comparing with a number of heuristics as well as the CPLEX built-in solver (B&B), and this is what can be recommended for use in yes-no Bloom filters. In a wider context of the study of lossy compression algorithms, our researchis an example showing how the arsenal of optimization methods can be applied to improving the accuracy of compressed data.

Genetic, structural, and molecular insights into the function of ras of complex proteins domains

Ras of complex proteins (ROC) domains were identified in 2003 as GTP binding modules in large multidomain proteins from Dictyostelium discoideum. Research into the function of these domains exploded with their identification in a number of proteins linked to human disease, including leucine-rich repeat kinase 2 (LRRK2) and death-associated protein kinase 1 (DAPK1) in Parkinson’s disease and cancer, respectively. This surge in research has resulted in a growing body of data revealing the role that ROC domains play in regulating protein function and signaling pathways. In this review, recent advances in the structural informa- tion available for proteins containing ROC domains, along with insights into enzymatic function and the integration of ROC domains as molecular switches in a cellular and organismal context, are explored.

Making development simple. The genetic deterministic hypothesis for economic development

This paper discusses the dangers inherent in allempting to simplify something as complex as development. It does this by exploring the Lynn and Vanhanen theory of deterministic development which asserts that varying levels of economic development seen between countries can be explained by differences in 'national intelligence' (national IQ). Assuming that intelligence is genetically determined, and as different races have been shown to have different IQ, then they argue that economic development (measured as GDP/capita) is largely a function of race and interventions to address imbalances can only have a limited impact. The paper presents the Lynne and Vanhanen case and critically discusses the data and analyses (linear regression) upon which it is based. It also extends the cause-effect basis of Lynne and Vanhanen's theory for economic development into human development by using the Human Development Index (HDI). It is argued that while there is nothing mathematically incorrect with their calculations, there are concerns over the data they employ. Even more fundamentally it is argued that statistically significant correlations between the various components of the HDI and national IQ can occur via a host of cause-effect pathways, and hence the genetic determinism theory is far from proven. The paper ends by discussing the dangers involved in the use of over-simplistic measures of development as a means of exploring cause-effect relationships. While the creators of development indices such as the HDI have good intentions, simplistic indices can encourage simplistic explanations of under-development. (c) 2005 Elsevier B.V. All rights reserved.

Generic systolic array for genetic algorithms

The authors present a systolic design for a simple GA mechanism which provides high throughput and unidirectional pipelining by exploiting the inherent parallelism in the genetic operators. The design computes in O(N+G) time steps using O(N2) cells where N is the population size and G is the chromosome length. The area of the device is independent of the chromosome length and so can be easily scaled by replicating the arrays or by employing fine-grain migration. The array is generic in the sense that it does not rely on the fitness function and can be used as an accelerator for any GA application using uniform crossover between pairs of chromosomes. The design can also be used in hybrid systems as an add-on to complement existing designs and methods for fitness function acceleration and island-style population management

Synthesis of a systolic array genetic algorithm

The paper presents a design for a hardware genetic algorithm which uses a pipeline of systolic arrays. These arrays have been designed using systolic synthesis techniques which involve expressing the algorithm as a set of uniform recurrence relations. The final design divorces the fitness function evaluation from the hardware and can process chromosomes of different lengths, giving the design a generic quality. The paper demonstrates the design methodology by progressively re-writing a simple genetic algorithm, expressed in C code, into a form from which systolic structures can be deduced. This paper extends previous work by introducing a simplification to a previous systolic design for the genetic algorithm. The simplification results in the removal of 2N 2 + 4N cells and reduces the time complexity by 3N + 1 cycles.

Implementing a generic systolic array for genetic algorithms

We have designed a highly parallel design for a simple genetic algorithm using a pipeline of systolic arrays. The systolic design provides high throughput and unidirectional pipelining by exploiting the implicit parallelism in the genetic operators. The design is significant because, unlike other hardware genetic algorithms, it is independent of both the fitness function and the particular chromosome length used in a problem. We have designed and simulated a version of the mutation array using Xilinix FPGA tools to investigate the feasibility of hardware implementation. A simple 5-chromosome mutation array occupies 195 CLBs and is capable of performing more than one million mutations per second. I. Introduction Genetic algorithms (GAs) are established search and optimization techniques which have been applied to a range of engineering and applied problems with considerable success [1]. They operate by maintaining a population of trial solutions encoded, using a suitable encoding scheme.

Carbon suboxide: the vibrational dependence of the v7 bending potential function

Data on the vibrational energy levels and rotational constants of carbon suboxide for the low-wavenumber bending mode ν7 are reviewed, in the ground-state manifold, and in the ν2-, ν3-, ν4-, and ν2 + ν4-state manifolds. Following the procedure developed by Duckett, Mills, and Robiette [J. Mol. Spectrosc. 63, 249 (1976)] the data have been inverted to give the effective bending potential in ν7 for each of these five states. Values are obtained for various other parameters in the effective vibration-rotation Hamiltonian. The potential and rotational constants in ν2 + ν4 are given to a close approximation by linear extrapolation from the ground state through the ν2 and ν4 states.

Mutational activation of niche-specific genes provides insight into regulatory networks and bacterial function in a complex environment

The genome of the plant-colonizing bacterium Pseudomonas fluorescens SBW25 harbors a subset of genes that are expressed specifically on plant surfaces. The function of these genes is central to the ecological success of SBW25, but their study poses significant challenges because no phenotype is discernable in vitro. Here, we describe a genetic strategy with general utility that combines suppressor analysis with IVET (SPyVET) and provides a means of identifying regulators of niche-specific genes. Central to this strategy are strains carrying operon fusions between plant environment-induced loci (EIL) and promoterless 'dapB. These strains are prototrophic in the plant environment but auxotrophic on laboratory minimal medium. Regulatory elements were identified by transposon mutagenesis and selection for prototrophs on minimal medium. Approximately 106 mutants were screened for each of 27 strains carrying 'dapB fusions to plant EIL and the insertion point for the transposon determined in approximately 2,000 putative regulator mutants. Regulators were functionally characterized and used to provide insight into EIL phenotypes. For one strain carrying a fusion to the cellulose-encoding wss operon, five different regulators were identified including a diguanylate cyclase, the flagella activator, FleQ, and alginate activator, AmrZ (AlgZ). Further rounds of suppressor analysis, possible by virtue of the SPyVET strategy, revealed an additional two regulators including the activator AlgR, and allowed the regulatory connections to be determined.

Mechanisms and function of flower and inflorescence reversion

Flower and inflorescence reversion involve a switch from floral development back to vegetative development, thus rendering flowering a phase in an ongoing growth pattern rather than a terminal act of the meristem. Although it can be considered an unusual event, reversion raises questions about the nature and function of flowering. It is linked to environmental conditions and is most often a response to conditions opposite to those that induce flowering. Research on molecular genetic mechanisms underlying plant development over the last 15 years has pinpointed some of the key genes involved in the transition to flowering and flower development. Such investigations have also uncovered mutations which reduce floral maintenance or alter the balance between vegetative and floral features of the plant. How this information contributes to an understanding of floral reversion is assessed here. One issue that arises is whether floral commitment (defined as the ability to continue flowering when inductive conditions no longer exist) is a developmental switch affecting the whole plant or is a mechanism which assigns autonomy to individual meristems. A related question is whether floral or vegetative development is the underlying default pathway of the plant. This review begins by considering how studies of flowering in Arabidopsis thaliana have aided understanding of mechanisms of floral maintenance. Arabidopsis has not been found to revert to leaf production in any of the conditions or genetic backgrounds analysed to date. A clear-cut reversion to leaf production has, however, been described in Impatiens balsamina. It is proposed that a single gene controls whether Impatiens reverts or can maintain flowering when inductive conditions are removed, and it is inferred that this gene functions to control the synthesis or transport of a leaf-generated signal. But it is also argued that the susceptibility of Impatiens to reversion is a consequence of the meristem-based mechanisms controlling development of the flower in this species. Thus, in Impatiens, a leaf-derived signal is critical for completion of flowering and can be considered to be the basis of a plant-wide floral commitment that is achieved without accompanying meristem autonomy. The evidence, derived from in vitro and other studies, that similar mechanisms operate in other species is assessed. It is concluded that most species (including Arabidopsis) are less prone to reversion because signals from the leaf are less ephemeral, and the pathways driving flower development have a high level of redundancy that generates meristem autonomy even when leaf-derived signals are weak. This gives stability to the flowering process, even where its initiation is dependent on environmental cues. On this interpretation, Impatiens reversion appears as an anomaly resulting from an unusual combination of leaf signalling and meristem regulation. Nevertheless, it is shown that the ability to revert can serve a function in the life history strategy (perenniality) or reproductive habit (pseudovivipary) of many plants. In these instances reversion has been assimilated into regular plant development and plays a crucial role there.

Use of a novel Hill-climbing genetic algorithm in protein folding simulations

We have developed a novel Hill-climbing genetic algorithm (GA) for simulation of protein folding. The program (written in C) builds a set of Cartesian points to represent an unfolded polypeptide's backbone. The dihedral angles determining the chain's configuration are stored in an array of chromosome structures that is copied and then mutated. The fitness of the mutated chain's configuration is determined by its radius of gyration. A four-helix bundle was used to optimise simulation conditions, and the program was compared with other, larger, genetic algorithms on a variety of structures. The program ran 50% faster than other GA programs. Overall, tests on 100 non-redundant structures gave comparable results to other genetic algorithms, with the Hill-climbing program running from between 20 and 50% faster. Examples including crambin, cytochrome c, cytochrome B and hemerythrin gave good secondary structure fits with overall alpha carbon atom rms deviations of between 5 and 5.6 Angstrom with an optimised hydrophobic term in the fitness function. (C) 2003 Elsevier Ltd. All rights reserved.

Calculation of converged rovibrational energies and partition function for methane using vibrational-rotational configuration interaction

The rovibration partition function of CH4 was calculated in the temperature range of 100-1000 K using well-converged energy levels that were calculated by vibrational-rotational configuration interaction using the Watson Hamiltonian for total angular momenta J=0-50 and the MULTIMODE computer program. The configuration state functions are products of ground-state occupied and virtual modals obtained using the vibrational self-consistent field method. The Gilbert and Jordan potential energy surface was used for the calculations. The resulting partition function was used to test the harmonic oscillator approximation and the separable-rotation approximation. The harmonic oscillator, rigid-rotator approximation is in error by a factor of 2.3 at 300 K, but we also propose a separable-rotation approximation that is accurate within 2% from 100 to 1000 K. (C) 2004 American Institute of Physics.

Chromatographic alignment of LC-MS and LC-MS/MS datasets by genetic algorithm feature extraction

Liquid chromatography-mass spectrometry (LC-MS) datasets can be compared or combined following chromatographic alignment. Here we describe a simple solution to the specific problem of aligning one LC-MS dataset and one LC-MS/MS dataset, acquired on separate instruments from an enzymatic digest of a protein mixture, using feature extraction and a genetic algorithm. First, the LC-MS dataset is searched within a few ppm of the calculated theoretical masses of peptides confidently identified by LC-MS/MS. A piecewise linear function is then fitted to these matched peptides using a genetic algorithm with a fitness function that is insensitive to incorrect matches but sufficiently flexible to adapt to the discrete shifts common when comparing LC datasets. We demonstrate the utility of this method by aligning ion trap LC-MS/MS data with accurate LC-MS data from an FTICR mass spectrometer and show how hybrid datasets can improve peptide and protein identification by combining the speed of the ion trap with the mass accuracy of the FTICR, similar to using a hybrid ion trap-FTICR instrument. We also show that the high resolving power of FTICR can improve precision and linear dynamic range in quantitative proteomics. The alignment software, msalign, is freely available as open source.