The variation of solar wind correlation lengths over three solar cycles

We present the results of a study of solar wind velocity and magnetic field correlation lengths over the last 35 years. The correlation length of the magnetic field magnitude λ | B| increases on average by a factor of two at solar maxima compared to solar minima. The correlation lengths of the components of the magnetic field λ_{B_{XYZ}} and of the velocity λ_{V_{YZ}} do not show this change and have similar values, indicating a continual turbulent correlation length of around 1.4×106 km. We conclude that a linear relation between λ | B|, VB 2, and Kp suggests that the former is related to the total magnetic energy in the solar wind and an estimate of the average size of geoeffective structures, which is, in turn, proportional to VB 2. By looking at the distribution of daily correlation lengths we show that the solar minimum values of λ | B| correspond to the turbulent outer scale. A tail of larger λ | B| values is present at solar maximum causing the increase in mean value.

Correlation of magnetic field intensities and solar wind speeds of events observed by ACE

The relationship between the magnetic field intensity and speed of solar wind events is examined using ∼3 years of data from the ACE spacecraft. No preselection of coronal mass ejections (CMEs) or magnetic clouds is carried out. The correlation between the field intensity and maximum speed is shown to increase significantly when |B| > 18 nT for 3 hours or more. Of the 24 events satisfying this criterion, 50% are magnetic clouds, the remaining half having no ordered field structure. A weaker correlation also exists between southward magnetic field and speed. Sixteen of the events are associated with halo CMEs leaving the Sun 2 to 4 days prior to the leading edge of the events arriving at ACE. Events selected by speed thresholds show no significant correlation, suggesting different relations between field intensity and speed for fast solar wind streams and ICMEs.

A parallel genetic algorithm for the Steiner Problem in Networks

This paper presents a parallel genetic algorithm to the Steiner Problem in Networks. Several previous papers have proposed the adoption of GAs and others metaheuristics to solve the SPN demonstrating the validity of their approaches. This work differs from them for two main reasons: the dimension and the characteristics of the networks adopted in the experiments and the aim from which it has been originated. The reason that aimed this work was namely to build a comparison term for validating deterministic and computationally inexpensive algorithms which can be used in practical engineering applications, such as the multicast transmission in the Internet. On the other hand, the large dimensions of our sample networks require the adoption of a parallel implementation of the Steiner GA, which is able to deal with such large problem instances.

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.

The systolic array genetic algorithm, an example of systolic arrays as a reconfigurable design methodology

We advocate the use of systolic design techniques to create custom hardware for Custom Computing Machines. We have developed a hardware genetic algorithm based on systolic arrays to illustrate the feasibility of the approach. The architecture is independent of the lengths of chromosomes used and can be scaled in size to accommodate different population sizes. An FPGA prototype design can process 16 million genes per second.

Time patterns in UK demand for alcohol and tobacco: an application of the EM algorithm

Capturing the pattern of structural change is a relevant task in applied demand analysis, as consumer preferences may vary significantly over time. Filtering and smoothing techniques have recently played an increasingly relevant role. A dynamic Almost Ideal Demand System with random walk parameters is estimated in order to detect modifications in consumer habits and preferences, as well as changes in the behavioural response to prices and income. Systemwise estimation, consistent with the underlying constraints from economic theory, is achieved through the EM algorithm. The proposed model is applied to UK aggregate consumption of alcohol and tobacco, using quarterly data from 1963 to 2003. Increased alcohol consumption is explained by a preference shift, addictive behaviour and a lower price elasticity. The dynamic and time-varying specification is consistent with the theoretical requirements imposed at each sample point. (c) 2005 Elsevier B.V. All rights reserved.

Juvenile-mature wood transition in pine: correlation between wood properties and candidate gene expression profiles

There is a strong desire to exploit transcriptomics data from model species for the genetic improvement of non-model crops. Here, we use gene expression profiles from the commercial model Pinus taeda to identify candidate genes implicated in juvenile-mature wood transition in the non-model relative, P. sylvestris. Re-analysis of 'public domain' SAGE data from xylem tissues of P. taeda revealed 283 mature-abundant and 396 juvenile-abundant tags (P < 0.01), of which 70 and 137, respectively matched to genes with known function. Based on sequence similarity, we then isolated 16 putative homologues of genes that in P. taeda exhibited widest divergence in expression between juvenile and mature samples. Candidate expression levels in P. sylvestris were almost invariably differential between juvenile and mature woody tissue samples among two cohorts of five trees collected from the same seed source and selected for genetic uniformity by genetic distance analysis. However, the direction of differential expression was not always consistent with that described in the original P. taeda SAGE data. Correlation was observed between gene expression and juvenile-mature wood anatomical characteristics by OPLS analysis. Four candidates (alpha-tubulin, porin MIP1, lipid transfer protein and aquaporin like protein) apparently had greatest influence on the wood traits measured. Speculative function of these genes in relation to juvenile-mature wood transition is briefly explored. Thus, we demonstrate the feasibility of exploiting SAGE data from a model species to identify consistently differentially expressed candidates in a related non-model species.

GeneMCL in microarray analysis

Accurately and reliably identifying the actual number of clusters present with a dataset of gene expression profiles, when no additional information on cluster structure is available, is a problem addressed by few algorithms. GeneMCL transforms microarray analysis data into a graph consisting of nodes connected by edges, where the nodes represent genes, and the edges represent the similarity in expression of those genes, as given by a proximity measurement. This measurement is taken to be the Pearson correlation coefficient combined with a local non-linear rescaling step. The resulting graph is input to the Markov Cluster (MCL) algorithm, which is an elegant, deterministic, non-specific and scalable method, which models stochastic flow through the graph. The algorithm is inherently affected by any cluster structure present, and rapidly decomposes a graph into cohesive clusters. The potential of the GeneMCL algorithm is demonstrated with a 5730 gene subset (IGS) of the Van't Veer breast cancer database, for which the clusterings are shown to reflect underlying biological mechanisms. (c) 2005 Elsevier Ltd. All rights reserved.

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.

Linkage disequilibrium assessment via log-linear modeling of SNP haplotype frequencies

Analyses of high-density single-nucleotide polymorphism (SNP) data, such as genetic mapping and linkage disequilibrium (LD) studies, require phase-known haplotypes to allow for the correlation between tightly linked loci. However, current SNP genotyping technology cannot determine phase, which must be inferred statistically. In this paper, we present a new Bayesian Markov chain Monte Carlo (MCMC) algorithm for population haplotype frequency estimation, particulary in the context of LD assessment. The novel feature of the method is the incorporation of a log-linear prior model for population haplotype frequencies. We present simulations to suggest that 1) the log-linear prior model is more appropriate than the standard coalescent process in the presence of recombination (>0.02cM between adjacent loci), and 2) there is substantial inflation in measures of LD obtained by a "two-stage" approach to the analysis by treating the "best" haplotype configuration as correct, without regard to uncertainty in the recombination process. Genet Epidemiol 25:106-114, 2003. (C) 2003 Wiley-Liss, Inc.