Minimum-order stable recursive filter design via the genetic algorithm approach

In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.

A computational analysis of substrate binding strength by phosphorylase kinase and protein kinase A

Protein kinases exhibit various degrees of substrate specificity. The large number of different protein kinases in the eukaryotic proteomes makes it impractical to determine the specificity of each enzyme experimentally. To test if it were possible to discriminate potential substrates from non-substrates by simple computational techniques, we analysed the binding enthalpies of modelled enzyme-substrate complexes and attempted to correlate it with experimental enzyme kinetics measurements. The crystal structures of phosphorylase kinase and cAMP-dependent protein kinase were used to generate models of the enzyme with a series of known peptide substrates and non-substrates, and the approximate enthalpy of binding assessed following energy minimization. We show that the computed enthalpies do not correlate closely with kinetic measurements, but the method can distinguish good substrates from weak substrates and non-substrates. Copyright (C) 2002 John Wiley Sons, Ltd.

Computational immunology: The coming of age

The explosive growth in biotechnology combined with major advancesin information technology has the potential to radically transformimmunology in the postgenomics era. Not only do we now have readyaccess to vast quantities of existing data, but new data with relevanceto immunology are being accumulated at an exponential rate. Resourcesfor computational immunology include biological databases and methodsfor data extraction, comparison, analysis and interpretation. Publiclyaccessible biological databases of relevance to immunologists numberin the hundreds and are growing daily. The ability to efficientlyextract and analyse information from these databases is vital forefficient immunology research. Most importantly, a new generationof computational immunology tools enables modelling of peptide transportby the transporter associated with antigen processing (TAP), modellingof antibody binding sites, identification of allergenic motifs andmodelling of T-cell receptor serial triggering.

Prediction of promiscuous peptides that bind HLA class I molecules

Promiscuous T-cell epitopes make ideal targets for vaccine development. We report here a computational system, multipred, for the prediction of peptide binding to the HLA-A2 supertype. It combines a novel representation of peptide/MHC interactions with a hidden Markov model as the prediction algorithm. multipred is both sensitive and specific, and demonstrates high accuracy of peptide-binding predictions for HLA-A*0201, *0204, and *0205 alleles, good accuracy for *0206 allele, and marginal accuracy for *0203 allele. multipred replaces earlier requirements for individual prediction models for each HLA allelic variant and simplifies computational aspects of peptide-binding prediction. Preliminary testing indicates that multipred can predict peptide binding to HLA-A2 supertype molecules with high accuracy, including those allelic variants for which no experimental binding data are currently available.

Large amplitude folding in finely layered viscoelastic rock structures

We analyze folding phenomena in finely layered viscoelastic rock. Fine is meant in the sense that the thickness of each layer is considerably smaller than characteristic structural dimensions. For this purpose we derive constitutive relations and apply a computational simulation scheme (a finite-element based particle advection scheme; see MORESI et al., 2001) suitable for problems involving very large deformations of layered viscous and viscoelastic rocks. An algorithm for the time integration of the governing equations as well as details of the finite-element implementation is also given. We then consider buckling instabilities in a finite, rectangular domain. Embedded within this domain, parallel to the longer dimension we consider a stiff, layered plate. The domain is compressed along the layer axis by prescribing velocities along the sides. First, for the viscous limit we consider the response to a series of harmonic perturbations of the director orientation. The Fourier spectra of the initial folding velocity are compared for different viscosity ratios. Turning to the nonlinear regime we analyze viscoelastic folding histories up to 40% shortening. The effect of layering manifests itself in that appreciable buckling instabilities are obtained at much lower viscosity ratios (1:10) as is required for the buckling of isotropic plates (1:500). The wavelength induced by the initial harmonic perturbation of the director orientation seems to be persistent. In the section of the parameter space considered here elasticity seems to delay or inhibit the occurrence of a second, larger wavelength. Finally, in a linear instability analysis we undertake a brief excursion into the potential role of couple stresses on the folding process. The linear instability analysis also provides insight into the expected modes of deformation at the onset of instability, and the different regimes of behavior one might expect to observe.

An equivalent algorithm for simulating thermal effects of magma intrusion problems in porous rocks

An equivalent algorithm is proposed to simulate thermal effects of the magma intrusion in geological systems, which are composed of porous rocks. Based on the physical and mathematical equivalence, the original magma solidification problem with a moving boundary between the rock and intruded magma is transformed into a new problem without the moving boundary but with a physically equivalent heat source. From the analysis of an ideal solidification model, the physically equivalent heat source has been determined in this paper. The major advantage in using the proposed equivalent algorithm is that the fixed finite element mesh with a variable integration time step can be employed to simulate the thermal effect of the intruded magma solidification using the conventional finite element method. The related numerical results have demonstrated the correctness and usefulness of the proposed equivalent algorithm for simulating the thermal effect of the intruded magma solidification in geological systems. (C) 2003 Elsevier B.V. All rights reserved.

Computational tools for the study of allergens

Allergy is a major cause of morbidity worldwide. The number of characterized allergens and related information is increasing rapidly creating demands for advanced information storage, retrieval and analysis. Bioinformatics provides useful tools for analysing allergens and these are complementary to traditional laboratory techniques for the study of allergens. Specific applications include structural analysis of allergens, identification of B- and T-cell epitopes, assessment of allergenicity and cross-reactivity, and genome analysis. In this paper, the most important bioinformatic tools and methods with relevance to the study of allergy have been reviewed.

A comparative study of similarity measures for manufacturing cell formation

We introduced a spectral clustering algorithm based on the bipartite graph model for the Manufacturing Cell Formation problem in [Oliveira S, Ribeiro JFF, Seok SC. A spectral clustering algorithm for manufacturing cell formation. Computers and Industrial Engineering. 2007 [submitted for publication]]. It constructs two similarity matrices; one for parts and one for machines. The algorithm executes a spectral clustering algorithm on each separately to find families of parts and cells of machines. The similarity measure in the approach utilized limited information between parts and between machines. This paper reviews several well-known similarity measures which have been used for Group Technology. Computational clustering results are compared by various performance measures. (C) 2008 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.

Modelling the Distribution of Ischaemic Stroke-Specific Survival Time Using an EM-based Mixture Approach with Random Effects Adjustment

A two-component survival mixture model is proposed to analyse a set of ischaemic stroke-specific mortality data. The survival experience of stroke patients after index stroke may be described by a subpopulation of patients in the acute condition and another subpopulation of patients in the chronic phase. To adjust for the inherent correlation of observations due to random hospital effects, a mixture model of two survival functions with random effects is formulated. Assuming a Weibull hazard in both components, an EM algorithm is developed for the estimation of fixed effect parameters and variance components. A simulation study is conducted to assess the performance of the two-component survival mixture model estimators. Simulation results confirm the applicability of the proposed model in a small sample setting. Copyright (C) 2004 John Wiley Sons, Ltd.

Thermal Characteristics of Polybia scutellaris Nests (Hymenoptera: Vespidae) Using Computational Fluid Dynamics: A Possible Adaptation to Tropical Climates

Polybia scutellaris constructs huge nests characterized by numerous spinal projections on the surface. We investigated the thermal characteristics of P scutellaris nests in order to determine whether their nest temperature is homeothermically maintained and whether the spines play a role in the thermoregulation of the nests. In order to examine these hypotheses, we measured the nest temperature in a active nest and in an abandoned nest. The temperature in the active nest was almost stable at 27 degrees C, whereas that of the abandoned nest varied with changes in the ambient temperature, suggesting that nest temperature was maintained by the thermogenesis of colony individuals. In order to predict the thermal properties of the spines, a numerical simulation was employed. To construct a 3D-model of a P scutellaris nest, the nest architecture was simplified into an outer envelope and the surface spines, for both of which the initial temperature was set at 27 degrees C. The physical properties of the simulated nest were regarded to be those of wood since the nest of this species is constructed from plant materials. When the model was exposed to cool air (12 degrees C), the temperature was lower in the models with more spines. On the other hand, when the nest was heated (42 degrees C), the temperature increase was smaller in models with more spines. It is suggested that the spines act as a heat radiator, not as an insulator, against the changes in ambient temperature.

Generation of Naphthoquinone Radical Anions by Electrospray Ionization: Solution, Gas-Phase, and Computational Chemistry Studies

Radical anions are present in several chemical processes, and understanding the reactivity of these species may be described by their thermodynamic properties. Over the last years, the formation of radical ions in the gas phase has been an important issue concerning electrospray ionization mass spectrometry studies. In this work, we report on the generation of radical anions of quinonoid compounds (Q) by electrospray ionization mass spectrometry. The balance between radical anion formation and the deprotonated molecule is also analyzed by influence of the experimental parameters (gas-phase acidity, electron affinity, and reduction potential) and solvent system employed. The gas-phase parameters for formation of radical species and deprotonated species were achieved on the basis of computational thermochemistry. The solution effects on the formation of radical anion (Q(center dot-)) and dianion (Q(2-)) were evaluated on the basis of cyclic voltammetry analysis and the reduction potentials compared with calculated electron affinities. The occurrence of unexpected ions [Q + 15](-) was described as being a reaction between the solvent system and the radical anion, Q(center dot-).The gas-phase chemistry of the electrosprayed radical anions was obtained by collisional-induced dissociation and compared to the relative energy calculations. These results are important for understanding the formation and reactivity of radical anions and to establish their correlation with the reducing properties by electrospray ionization analyses.

A Computational Study of Tetrafluoro-[2.2]Cyclophanes

A computational study of the isomers of tetrafluorinated [2.2]cyclophanes persubstituted in one ring, namely F-4-[2.2]paracyclophane (4), F-4-anti-[2.2]metacyclophane (5a), F-4-syn-[2.2]metacyclophane (5b), and F-4-[2.2]metaparacyclophane (6a and 6b), was carried out. The effects of fluorination on the geometries, relative energies, local and global aromaticity, and strain energies of the bridges and rings were investigated. An analysis of the electron density by B3PW91/6-31+G(d,p), B3LYP/6-31+G(d,p), and MP2/6-31+G(d,p) was carried out using the natural bond orbitals (NBO), natural steric analysis (NSA), and atoms in molecules (AIM) methods. The analysis of frontier molecular orbitals (MOs) was also employed. The results indicated that the molecular structure of [2.2]paracyclophane is the most affected by the fluorination. Isodesmic reactions showed that the fluorinated rings are more strained than the nonfluorinated ones. The NICS, HOMA, and PDI criteria evidenced that the fluorination affects the aromaticity of both the fluorinated and the nonfluorinated rings. The NBO and NSA analyses gave an indication that the fluorination increases not only the number of through-space interactions but also their magnitude. The AIM analysis suggested that the through-space interactions are restricted to the F-4-[2.2]metacyclophanes. In addition, the atomic properties, computed over the atomic basins, shave evidence that not only the substitution, but also the position of the bridges could affect the atomic charges. the first atomic moments, and the atomic volumes.

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.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.