Surface determination of the air-earth electrical current density using co-located sensors of different geometry

A vertical conduction current flows in the atmosphere as a result of the global atmospheric electric circuit. The current at the surface consists of the conduction current and a locally generated displacement current, which are often approximately equal in magnitude. A method of separating the two currents using two collectors of different geometry is investigated. The picoammeters connected to the collectors have a RC time constant of approximately 3 s, permitting the investigation of higher frequency air-earth current changes than previously achieved. The displacement current component of the air-earth current derived from the instrument agrees with calculations using simultaneous data from a co-located fast response electric field mill. The mean value of the nondisplacement current measured over 9 h was 1.76 +/- 0.002 pA m(-2). (c) 2006 American Institute of Physics.

The expected imprint of flux rope geometry on suprathermal electrons in magnetic clouds

Magnetic clouds are a subset of interplanetary coronal mass ejections characterized by a smooth rotation in the magnetic field direction, which is interpreted as a signature of a magnetic flux rope. Suprathermal electron observations indicate that one or both ends of a magnetic cloud typically remain connected to the Sun as it moves out through the heliosphere. With distance from the axis of the flux rope, out toward its edge, the magnetic field winds more tightly about the axis and electrons must traverse longer magnetic field lines to reach the same heliocentric distance. This increased time of flight allows greater pitch-angle scattering to occur, meaning suprathermal electron pitch-angle distributions should be systematically broader at the edges of the flux rope than at the axis. We model this effect with an analytical magnetic flux rope model and a numerical scheme for suprathermal electron pitch-angle scattering and find that the signature of a magnetic flux rope should be observable with the typical pitch-angle resolution of suprathermal electron data provided ACE's SWEPAM instrument. Evidence of this signature in the observations, however, is weak, possibly because reconnection of magnetic fields within the flux rope acts to intermix flux tubes.

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.

Influence of adsorption geometry in the heterogeneous enantioselective catalytic hydrogenation of a prototypical enone

Asymmetric catalysis is of paramount importance in organic synthesis and, in current practice, is achieved by means of homogeneous catalysts. The ability to catalyze such reactions heterogeneously would have a major impact both in the research laboratory and in the production of fine chemicals and pharmaceuticals, yet heterogeneous asymmetric hydrogenation of C═C bonds remains hardly explored. Very recently, we demonstrated how chiral ligands that anchor robustly to the surface of Pd nanoparticles promote asymmetric catalytic hydrogenation: ligand rigidity and stereochemistry emerged as key factors. Here, we address a complementary question: how does the enone reactant adsorb on the metal surface, and what implications does this have for the enantiodifferentiating interaction with the surface-tethered chiral modifiers? A reaction model is proposed, which correctly predicts the identity of the enantiomer experimentally observed in excess.

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.

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.