Genetic algorithm based distance spectrum technique for performance union bound of space-time trellis coded OFDM

This paper derives the performance union bound of space-time trellis codes in orthogonal frequency division multiplexing system (STTC-OFDM) over quasi-static frequency selective fading channels based on the distance spectrum technique. The distance spectrum is the enumeration of the codeword difference measures and their multiplicities by exhausted searching through all the possible error event paths. Exhaustive search approach can be used for low memory order STTC with small frame size. However with moderate memory order STTC and moderate frame size the computational cost of exhaustive search increases exponentially, and may become impractical for high memory order STTCs. This requires advanced computational techniques such as Genetic Algorithms (GAS). In this paper, a GA with sharing function method is used to locate the multiple solutions of the distance spectrum for high memory order STTCs. Simulation evaluates the performance union bound and the complexity comparison of non-GA aided and GA aided distance spectrum techniques. It shows that the union bound give a close performance measure at high signal-to-noise ratio (SNR). It also shows that GA sharing function method based distance spectrum technique requires much less computational time as compared with exhaustive search approach but with satisfactory accuracy.

Strategies for identifying and predicting islet autoantigen T-cell epitopes in insulin-dependent diabetes mellitus

T cells recognize peptide epitopes bound to major histocompatibility complex molecules. Human T-cell epitopes have diagnostic and therapeutic applications in autoimmune diseases. However, their accurate definition within an autoantigen by T-cell bioassay, usually proliferation, involves many costly peptides and a large amount of blood, We have therefore developed a strategy to predict T-cell epitopes and applied it to tyrosine phosphatase IA-2, an autoantigen in IDDM, and HLA-DR4(*0401). First, the binding of synthetic overlapping peptides encompassing IA-2 was measured directly to purified DR4. Secondly, a large amount of HLA-DR4 binding data were analysed by alignment using a genetic algorithm and were used to train an artificial neural network to predict the affinity of binding. This bioinformatic prediction method was then validated experimentally and used to predict DR4 binding peptides in IA-2. The binding set encompassed 85% of experimentally determined T-cell epitopes. Both the experimental and bioinformatic methods had high negative predictive values, 92% and 95%, indicating that this strategy of combining experimental results with computer modelling should lead to a significant reduction in the amount of blood and the number of peptides required to define T-cell epitopes in humans.

Prediction of MHC class II-binding peptides using an evolutionary algorithm and artificial neural network

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

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 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.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

Substrate-bound carbohydrates stimulate signal transduction and neurite outgrowth in an olfactory neuron cell line

SUBPOPULATIONS of olfactory receptor neurons, which are dispersed throughout the olfactory neuroepithelium, express specific cell surface carbohydrates and project to discrete regions of the olfactory bulb. Cell surface carbohydrates such as N-acetyl-lactosamine have been postulated to mediate sorting and selective fasciculation of discrete axon subpopulations during development of the olfactory pathway. Substrate-bound N-acetyl-lactosamine promotes neurite outgrowth by both clonal olfactory receptor neuron cell lines and olfactory receptor neurons in vitro, indicating that cell surface carbohydrates may be ligands for receptor-mediated stimulation of axon growth in vivo. In the present study, the role of transmembrane signaling in N-acetyl-lactosamine-stimulated neurite outgrowth was examined in the clonal olfactory neuron cell line 4.4.2. Substrate-bound N-acetyl-lactosamine stimulated neurite outgrowth which was specifically inhibited by antagonists to N- and L-type calcium channels and to tyrosine kinase phosphorylation. These results indicate that N-acetyl-lactosamine can evoke transmembrane receptor-mediated responses capable of influencing neurite outgrowth.

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.

Growth regime map for liquid-bound granules: further development and experimental validation

An attempt was made to quantify the boundaries and validate the granule growth regime map for liquid-bound granules recently proposed by Iveson and Litster (AlChE J. 44 (1998) 1510). This regime map postulates that the type of granule growth behaviour is a function of only two dimensionless groups: the amount of granule deformation during collision (characterised by a Stokes deformation number, St(def)) and the maximum granule pore saturation, s(max). The results of experiments performed with a range of materials (glass ballotini, iron ore fines, copper chalcopyrite powder and a sodium sulphate and cellulose mixture) using both drum and high shear mixer granulators were examined. The drum granulation results gave good agreement with the proposed regime map. The boundary between crumb and steady growth occurs at St(def) of order 0.1 and the boundary between steady and induction growth occurs at St(def) of order 0.001. The nucleation only boundary occurs at pore saturations that increase from 70% to 80% with decreasing St(def). However, the high shear mixer results all had St(def) numbers which were too large. This is most likely to be because the chopper tip-speed is an over-estimate of the average impact velocity granules experience and possibly also due to the dynamic yield strength of the materials being significantly greater than the yield strengths measured at low strain rates. Hence, the map is only a useful tool for comparing the granulation behaviour of different materials in the same device. Until we have a better understanding of the flow patterns and impact velocities in granulators, it cannot be used to compare different types of equipment. Theoretical considerations also revealed that several of the regime boundaries are also functions of additional parameters not explicitly contained on the map, such as binder viscosity. (C) 2001 Elsevier Science B.V. All rights reserved.

Crystal structures of free, IMP-, and GMP-bound Escherichia coli hypoxanthine phosphoribosyltransferase

Crystal structures have been determined for free Escherichia coli hypoxanthine phosphoribosyltransferase (HPRT) (2.9 Angstrom resolution) and for the enzyme in complex with the reaction products, inosine 5'-monophosphate (IMP) and guanosine 5-monophosphate (GMP) (2.8 Angstrom resolution). Of the known 6-oxopurine phosphoribosyltransferase (PRTase) structures, E. coli HPRT is most similar in structure to that of Tritrichomonas foetus HGXPRT, with a rmsd for 150 Calpha atoms of 1.0 Angstrom. Comparison of the free and product bound structures shows that the side chain of Phe156 and the polypeptide backbone in this vicinity move to bind IMP or GMP. A nonproline cis peptide bond, also found in some other 6-oxopurine PRTases, is observed between Leu46 and Arg47 in both the free and complexed structures. For catalysis to occur, the 6-oxopurine PRTases have a requirement for divalent metal ion, Usually Mg2+ in vivo. In the free structure, a Mg2+, is coordinated to the side chains of Glu103 and Asp104. This interaction may be important for stabilization of the enzyme before catalysis. E. coli HPRT is unique among the known 6-oxopurine PRTases in that it exhibits a marked preference for hypoxanthine as substrate over both xanthine and guanine. The structures suggest that its substrate specificity is due to the modes of binding of the bases. In E. coli HPRT, the carbonyl oxygen of Asp 163 would likely form a hydrogen bond with the 2-exocyclic nitrogen of guanine (in the HPRT-guanine-PRib-PP-Mg2+ complex). However, hypoxanthine does not have a 2-exocyclic atom and the HPRT-IMP structure suggests that hypoxanthine is likely to occupy a different position in the purine-binding pocket.

The blood volumes of the primary and secondary circulatory system in the Atlantic cod Gadus morhua L., using plasma bound Evans Blue and compartmental analysis

The volume of the primary (PCS) and secondary (SCS) circulatory system in the Atlantic cod Gadus morhua was determined using a modified dye dilution technique. Cod (N=10) were chronically cannulated in the second afferent branchial artery with PE-50 tubing. Evans Blue dye was bound to harvested fish plasma at a concentration of 1 mg dye ml(-1) plasma, and injected at a concentration of 1 mg kg(-1) body mass. Serial sampling from the cannula produced a dye dilution curve, which could be described by a double exponential decay equation. Curve analysis enabled the calculation of the primary circulatory and total distribution volume. The difference between these volumes is assumed to be the volume of the SCS. From the dilution curve, it was also possible to calculate flow rates between and within the systems. The results of these experiments suggest a plasma volume in the PCS of 3.42+/-0.89 ml 100 g(-1) body mass, and in the SCS of 1.68+/-0.35 ml 100 g(-1) body mass (mean +/- S.D.) or approximately 50% that of the PCS. Flow rates to the SCS were calculated as 2.7% of the resting cardiac output. There was an allometric relationship between body mass and blood volumes. Increasing condition factor showed a tendency towards smaller blood volumes of the PCS, expressed as percentage body mass, but this was not evident for the volume of the SCS.