A new blind equalization algorithm based on convex combination

The convex combination is a mathematic approach to keep the advantages of its component algorithms for better performance. In this paper, we employ convex combination in the blind equalization to achieve better blind equalization. By combining the blind constant modulus algorithm (CMA) and decision directed algorithm, the combinative blind equalization (CBE) algorithm can retain the advantages from both. Furthermore, the convergence speed of the CBE algorithm is faster than both of its component equalizers. Simulation results are also given to verify the proposed algorithm.

A fast identification algorithm for Box-Cox transformation based radial basis function neural network

In this letter, a Box-Cox transformation-based radial basis function (RBF) neural network is introduced using the RBF neural network to represent the transformed system output. Initially a fixed and moderate sized RBF model base is derived based on a rank revealing orthogonal matrix triangularization (QR decomposition). Then a new fast identification algorithm is introduced using Gauss-Newton algorithm to derive the required Box-Cox transformation, based on a maximum likelihood estimator. The main contribution of this letter is to explore the special structure of the proposed RBF neural network for computational efficiency by utilizing the inverse of matrix block decomposition lemma. Finally, the Box-Cox transformation-based RBF neural network, with good generalization and sparsity, is identified based on the derived optimal Box-Cox transformation and a D-optimality-based orthogonal forward regression algorithm. The proposed algorithm and its efficacy are demonstrated with an illustrative example in comparison with support vector machine regression.

Synapsing variable length crossover: An algorithm for crossing and comparing variable length genomes

The Synapsing Variable Length Crossover (SVLC) algorithm provides a biologically inspired method for performing meaningful crossover between variable length genomes. In addition to providing a rationale for variable length crossover it also provides a genotypic similarity metric for variable length genomes enabling standard niche formation techniques to be used with variable length genomes. Unlike other variable length crossover techniques which consider genomes to be rigid inflexible arrays and where some or all of the crossover points are randomly selected, the SVLC algorithm considers genomes to be flexible and chooses non-random crossover points based on the common parental sequence similarity. The SVLC Algorithm recurrently "glues" or synapses homogenous genetic sub-sequences together. This is done in such a way that common parental sequences are automatically preserved in the offspring with only the genetic differences being exchanged or removed, independent of the length of such differences. In a variable length test problem the SVLC algorithm is shown to outperform current variable length crossover techniques. The SVLC algorithm is also shown to work in a more realistic robot neural network controller evolution application.

Linear algorithm and hexagonal search based two-pass algorithm for motion estimation

This paper presents a novel two-pass algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for block base motion compensation. On the basis of research from previous algorithms, especially an on-the-edge motion estimation algorithm called hexagonal search (HEXBS), we propose the LHMEA and the Two-Pass Algorithm (TPA). We introduced hashtable into video compression. In this paper we employ LHMEA for the first-pass search in all the Macroblocks (MB) in the picture. Motion Vectors (MV) are then generated from the first-pass and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of MBs. The evaluation of the algorithm considers the three important metrics being time, compression rate and PSNR. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms, Experimental results show that the proposed algorithm can offer the same compression rate as the Full Search. LHMEA with TPA has significant improvement on HEXBS and shows a direction for improving other fast motion estimation algorithms, for example Diamond Search.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

Givens rotation based fast backward elimination algorithm for RBF neural network pruning

A fast backward elimination algorithm is introduced based on a QR decomposition and Givens transformations to prune radial-basis-function networks. Nodes are sequentially removed using an increment of error variance criterion. The procedure is terminated by using a prediction risk criterion so as to obtain a model structure with good generalisation properties. The algorithm can be used to postprocess radial basis centres selected using a k-means routine and, in this mode, it provides a hybrid supervised centre selection approach.

Blind equalization of nonminimum phase channels: higher order cumulant based algorithm

Higher order cumulant analysis is applied to the blind equalization of linear time-invariant (LTI) nonminimum-phase channels. The channel model is moving-average based. To identify the moving average parameters of channels, a higher-order cumulant fitting approach is adopted in which a novel relay algorithm is proposed to obtain the global solution. In addition, the technique incorporates model order determination. The transmitted data are considered as independently identically distributed random variables over some discrete finite set (e.g., set {±1, ±3}). A transformation scheme is suggested so that third-order cumulant analysis can be applied to this type of data. Simulation examples verify the feasibility and potential of the algorithm. Performance is compared with that of the noncumulant-based Sato scheme in terms of the steady state MSE and convergence rate.

B-spline neural network based digital baseband predistorter solution using the inverse of De Boor algorithm

In this paper a new nonlinear digital baseband predistorter design is introduced based on direct learning, together with a new Wiener system modeling approach for the high power amplifiers (HPA) based on the B-spline neural network. The contribution is twofold. Firstly, by assuming that the nonlinearity in the HPA is mainly dependent on the input signal amplitude the complex valued nonlinear static function is represented by two real valued B-spline neural networks, one for the amplitude distortion and another for the phase shift. The Gauss-Newton algorithm is applied for the parameter estimation, in which the De Boor recursion is employed to calculate both the B-spline curve and the first order derivatives. Secondly, we derive the predistorter algorithm calculating the inverse of the complex valued nonlinear static function according to B-spline neural network based Wiener models. The inverse of the amplitude and phase shift distortion are then computed and compensated using the identified phase shift model. Numerical examples have been employed to demonstrate the efficacy of the proposed approaches.

An improvement in clear-air turbulence forecasting based on spontaneous imbalance theory: the ULTURB algorithm

Recent research has shown that Lighthill–Ford spontaneous gravity wave generation theory, when applied to numerical model data, can help predict areas of clear-air turbulence. It is hypothesized that this is the case because spontaneously generated atmospheric gravity waves may initiate turbulence by locally modifying the stability and wind shear. As an improvement on the original research, this paper describes the creation of an ‘operational’ algorithm (ULTURB) with three modifications to the original method: (1) extending the altitude range for which the method is effective downward to the top of the boundary layer, (2) adding turbulent kinetic energy production from the environment to the locally produced turbulent kinetic energy production, and, (3) transforming turbulent kinetic energy dissipation to eddy dissipation rate, the turbulence metric becoming the worldwide ‘standard’. In a comparison of ULTURB with the original method and with the Graphical Turbulence Guidance second version (GTG2) automated procedure for forecasting mid- and upper-level aircraft turbulence ULTURB performed better for all turbulence intensities. Since ULTURB, unlike GTG2, is founded on a self-consistent dynamical theory, it may offer forecasters better insight into the causes of the clear-air turbulence and may ultimately enhance its predictability.

A SNP-based consensus genetic map for synteny-based trait targeting in faba bean (Vicia faba L.)

Faba bean (Vicia faba L.) is a globally important nitrogen-fixing legume, which is widely grown in a diverse range of environments. In this work, we mine and validate a set of 845 SNPs from the aligned transcriptomes of two contrasting inbred lines. Each V. faba SNP is assigned by BLAST analysis to a single Medicago orthologue. This set of syntenically anchored polymorphisms were then validated as individual KASP assays, classified according to their informativeness and performance on a panel of 37 inbred lines, and the best performing 757 markers used to genotype six mapping populations. The six resulting linkage maps were merged into a single consensus map on which 687 SNPs were placed on six linkage groups, each presumed to correspond to one of the six V. faba chromosomes. This sequence-based consensus map was used to explore synteny with the most closely-related crop species, lentil, and the most closely related fully sequenced genome, Medicago. Large tracts of uninterrupted colinearity were found between faba bean and Medicago, making it relatively straightforward to predict gene content and order in mapped genetic interval. As a demonstration of this, we mapped a flower colour gene to a 2 cM interval of Vf chromosome 2 which was highly collinear with Mt3. The obvious candidate gene from 77 gene models in the collinear Medicago chromosome segment was the previously characterized MtWD40-1 gene (Mt3g092830, Mt3g092840) controlling anthocyanin production in Medicago and re-sequencing of the Vf orthologue showed a putative causative deletion of the entire 5’ end of the gene.

Changes in physical activity following a genetic-based internet-delivered personalized intervention: randomized controlled trial (Food4Me)

Background: There is evidence that physical activity (PA) can attenuate the influence of the fat mass- and obesity-associated (FTO) genotype on the risk to develop obesity. However, whether providing personalized information on FTO genotype leads to changes in PA is unknown. Objective: The purpose of this study was to determine if disclosing FTO risk had an impact on change in PA following a 6-month intervention. Methods: The single nucleotide polymorphism (SNP) rs9939609 in the FTO gene was genotyped in 1279 participants of the Food4Me study, a four-arm, Web-based randomized controlled trial (RCT) in 7 European countries on the effects of personalized advice on nutrition and PA. PA was measured objectively using a TracmorD accelerometer and was self-reported using the Baecke questionnaire at baseline and 6 months. Differences in baseline PA variables between risk (AA and AT genotypes) and nonrisk (TT genotype) carriers were tested using multiple linear regression. Impact of FTO risk disclosure on PA change at 6 months was assessed among participants with inadequate PA, by including an interaction term in the model: disclosure (yes/no) × FTO risk (yes/no). Results: At baseline, data on PA were available for 874 and 405 participants with the risk and nonrisk FTO genotypes, respectively. There were no significant differences in objectively measured or self-reported baseline PA between risk and nonrisk carriers. A total of 807 (72.05%) of the participants out of 1120 in the personalized groups were encouraged to increase PA at baseline. Knowledge of FTO risk had no impact on PA in either risk or nonrisk carriers after the 6-month intervention. Attrition was higher in nonrisk participants for whom genotype was disclosed (P=.01) compared with their at-risk counterparts. Conclusions: No association between baseline PA and FTO risk genotype was observed. There was no added benefit of disclosing FTO risk on changes in PA in this personalized intervention. Further RCT studies are warranted to confirm whether disclosure of nonrisk genetic test results has adverse effects on engagement in behavior change.

Comparative Genetic Diversity of Wild and Captive Populations of the Bare-Faced Curassow (Crax fasciolata) Based on Cross-Species Microsatellite Markers: Implications for Conservation and Management

The bare-faced curassow (Crax fasciolata) is a large Neotropical bird that suffers anthropogenic pressure across much of its range. A captive population is maintained for conservation management, although there has been no genetic screening of stocks. Based on the six microsatellite markers developed for Crax globulosa, the genetic variability of C. fasciolata and possible differences between a wild and a captive population were investigated. Only three loci were polymorphic, with a total of 27 alleles. More than half of these alleles were private to the wild (n = 8) or captive (n = 7) populations. Significant deviations from Hardy-Weinberg equilibrium were restricted to the captive population. Despite the number of private alleles, genetic drift has probably promoted differentiation between populations. Our results indicate that wild C. fasciolata populations are genetically impoverished and structured, but species-specific microsatellite markers will be necessary for a more reliable assessment of the species` genetic diversity.