Fast, scalable master equation solution algorithms. IV. Lanczos iteration with diffusion approximation preconditioned iterative inversion

In this paper we propose a second linearly scalable method for solving large master equations arising in the context of gas-phase reactive systems. The new method is based on the well-known shift-invert Lanczos iteration using the GMRES iteration preconditioned using the diffusion approximation to the master equation to provide the inverse of the master equation matrix. In this way we avoid the cubic scaling of traditional master equation solution methods while maintaining the speed of a partial spectral decomposition. The method is tested using a master equation modeling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long-lived isomerizing intermediates. (C) 2003 American Institute of Physics.

Fast, scalable master equation solution algorithms. III. Direct time propagation accelerated by a diffusion approximation preconditioned iterative solver

In this paper we propose a novel fast and linearly scalable method for solving master equations arising in the context of gas-phase reactive systems, based on an existent stiff ordinary differential equation integrator. The required solution of a linear system involving the Jacobian matrix is achieved using the GMRES iteration preconditioned using the diffusion approximation to the master equation. In this way we avoid the cubic scaling of traditional master equation solution methods and maintain the low temperature robustness of numerical integration. The method is tested using a master equation modelling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long lived isomerizing intermediates. (C) 2003 American Institute of Physics.

Real-Time Gene-Expression Extraction with Fast Classification (FC) Networks

Fast Classification (FC) networks were inspired by a biologically plausible mechanism for short term memory where learning occurs instantaneously. Both weights and the topology for an FC network are mapped directly from the training samples by using a prescriptive training scheme. Only two presentations of the training data are required to train an FC network. Compared with iterative learning algorithms such as Back-propagation (which may require many hundreds of presentations of the training data), the training of FC networks is extremely fast and learning convergence is always guaranteed. Thus FC networks may be suitable for applications where real-time classification is needed. In this paper, the FC networks are applied for the real-time extraction of gene expressions for Chlamydia microarray data. Both the classification performance and learning time of the FC networks are compared with the Multi-Layer Proceptron (MLP) networks and support-vector-machines (SVM) in the same classification task. The FC networks are shown to have extremely fast learning time and comparable classification accuracy.

Fast evolution strategies

Evolution strategies are a class of general optimisation algorithms which are applicable to functions that are multimodal, nondifferentiable, or even discontinuous. Although recombination operators have been introduced into evolution strategies, the primary search operator is still mutation. Classical evolution strategies rely on Gaussian mutations. A new mutation operator based on the Cauchy distribution is proposed in this paper. It is shown empirically that the new evolution strategy based on Cauchy mutation outperforms the classical evolution strategy on most of the 23 benchmark problems tested in this paper. The paper also shows empirically that changing the order of mutating the objective variables and mutating the strategy parameters does not alter the previous conclusion significantly, and that Cauchy mutations with different scaling parameters still outperform the Gaussian mutation with self-adaptation. However, the advantage of Cauchy mutations disappears when recombination is used in evolution strategies. It is argued that the search step size plays an important role in determining evolution strategies' performance. The large step size of recombination plays a similar role as Cauchy mutation.

Robust algorithms for solving stochastic partial differential equations

A robust semi-implicit central partial difference algorithm for the numerical solution of coupled stochastic parabolic partial differential equations (PDEs) is described. This can be used for calculating correlation functions of systems of interacting stochastic fields. Such field equations can arise in the description of Hamiltonian and open systems in the physics of nonlinear processes, and may include multiplicative noise sources. The algorithm can be used for studying the properties of nonlinear quantum or classical field theories. The general approach is outlined and applied to a specific example, namely the quantum statistical fluctuations of ultra-short optical pulses in chi((2)) parametric waveguides. This example uses a non-diagonal coherent state representation, and correctly predicts the sub-shot noise level spectral fluctuations observed in homodyne detection measurements. It is expected that the methods used wilt be applicable for higher-order correlation functions and other physical problems as well. A stochastic differencing technique for reducing sampling errors is also introduced. This involves solving nonlinear stochastic parabolic PDEs in combination with a reference process, which uses the Wigner representation in the example presented here. A computer implementation on MIMD parallel architectures is discussed. (C) 1997 Academic Press.

Long-term metabolic and skeletal muscle adaptations to short-sprint training: Implications for sprint training and tapering

The adaptations of muscle to sprint training can be separated into metabolic and morphological changes. Enzyme adaptations represent a major metabolic adaptation to sprint training, with the enzymes of all three energy systems showing signs of adaptation to training and some evidence of a return to baseline levels with detraining. Myokinase and creatine phosphokinase have shown small increases as a result of short-sprint training in some studies and elite sprinters appear better able to rapidly breakdown phosphocreatine (PCr) than the sub-elite. No changes in these enzyme levels have been reported as a result of detraining. Similarly, glycolytic enzyme activity (notably lactate dehydrogenase, phosphofructokinase and glycogen phosphorylase) has been shown to increase after training consisting of either long (> 10-second) or short (< 10-second) sprints. Evidence suggests that these enzymes return to pre-training levels after somewhere between 7 weeks and 6 months of detraining. Mitochondrial enzyme activity also increases after sprint training, particularly when long sprints or short recovery between short sprints are used as the training stimulus. Morphological adaptations to sprint training include changes in muscle fibre type, sarcoplasmic reticulum, and fibre cross-sectional area. An appropriate sprint training programme could be expected to induce a shift toward type Ha muscle, increase muscle cross-sectional area and increase the sarcoplasmic reticulum volume to aid release of Ca2+. Training volume and/or frequency of sprint training in excess of what is optimal for an individual, however, will induce a shift toward slower muscle contractile characteristics. In contrast, detraining appears to shift the contractile characteristics towards type IIb, although muscle atrophy is also likely to occur. Muscle conduction velocity appears to be a potential non-invasive method of monitoring contractile changes in response to sprint training and detraining. In summary, adaptation to sprint training is clearly dependent on the duration of sprinting, recovery between repetitions, total volume and frequency of training bouts. These variables have profound effects on the metabolic, structural and performance adaptations from a sprint-training programme and these changes take a considerable period of time to return to baseline after a period of detraining. However, the complexity of the interaction between the aforementioned variables and training adaptation combined with individual differences is clearly disruptive to the transfer of knowledge and advice from laboratory to coach to athlete.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

A fast cross-entropy method for estimating buffer overflows in queuing networks

In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of buffer overflow probabilities in queueing networks. The method comprises three stages. First, we estimate the minimum cross-entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer level. Finally, the tilting parameter just found is used to estimate the overflow probability of interest. We study various properties of the method in more detail for the M/M/1 queue and conjecture that similar properties also hold for quite general queueing networks. Numerical results support this conjecture and demonstrate the high efficiency of the proposed algorithm.

Fast Structure-Based Assignment of 15N HSQC Spectra of Selectively 15N-Labeled Paramagnetic Proteins

A novel strategy for fast NMR resonance assignment of N-15 HSQC spectra of proteins is presented. It requires the structure coordinates of the protein, a paramagnetic center, and one or more residue-selectively N-15-labeled samples. Comparison of sensitive undecoupled N-15 HSQC spectra recorded of paramagnetic and diamagnetic samples yields data for every cross-peak on pseudocontact shift, paramagnetic relaxation enhancement, cross-correlation between Curie-spin and dipole-dipole relaxation, and residual dipolar coupling. Comparison of these four different paramagnetic quantities with predictions from the three-dimensional structure simultaneously yields the resonance assignment and the anisotropy of the susceptibility tensor of the paramagnetic center. The method is demonstrated with the 30 kDa complex between the N-terminal domain of the epsilon subunit and the theta subunit of Escherichia Coll DNA polymerase III. The program PLATYPUS was developed to perform the assignment, provide a measure of reliability of the assignment, and determine the susceptibility tensor anisotropy.

Comparison of BR and QR Eigenvalue Algorithms for Power System Small Signal Stability Analysis

The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.

Short-term spatial diffusion in sigma o+ o- optical molasses

We have measured the spatial diffusion of atoms in a three-dimensional sigma(+)-sigma(-) optical molasses over twenty milliseconds timescale, starting from the initial interaction of the atoms with the molasses. We find that the diffusion constants agree well with a linear model for these short time scales and also compare favourably to other studies of diffusion made over longer time scales. These measurements enable us to quantify the detection method known as freezing molasses. We discuss this method, for detecting and measuring the momentum distribution of cold atoms, which relies on the slow diffusion of atoms in optical molasses to produce a freeze-frame of the spatial distribution of the atoms. This method enables a longer interrogation interval, providing a greatly increased signal-to-noise ratio. (C) 1998 Elsevier Science B.V.

Protein fold recognition without Boltzmann statistics or explicit physical basis

We present a fast method for finding optimal parameters for a low-resolution (threading) force field intended to distinguish correct from incorrect folds for a given protein sequence. In contrast to other methods, the parameterization uses information from >10(7) misfolded structures as well as a set of native sequence-structure pairs. In addition to testing the resulting force field's performance on the protein sequence threading problem, results are shown that characterize the number of parameters necessary for effective structure recognition.

The effects of prepulse-blink reflex trial repetition and prepulse change on blink reflex modification at short and long lead intervals

Prepulse inhibition and facilitation of the blink reflex are said to reflect different responses elicited by the lead stimulus, transient detection and orienting response respectively. Two experiments investigated the effects of trial repetition and lead stimulus change on blink modification. It was hypothesized that these manipulations will affect orienting and thus blink facilitation to a greater extent than they will affect transient detection and thus blink inhibition. In Experiment 1 (N = 64), subjects were trained with a sequence of 12 lead stimulus and 12 blink stimulus alone presentations, and 24 lead stimulus-blink stimulus pairings. Lead interval was 120 ms for 12 of the trials and 2000 ms for the other 12. For half the subjects this sequence was followed by a change in pitch of the lead stimulus. In Experiment 2 (N = 64), subjects were trained with a sequence of 36 blink alone stimuli and 36 lead stimulus-blink stimulus pairings. The lead interval was 120 ms for half the subjects and 2000 ms for the other half. The pitch of the lead stimulus on prestimulus trials 31-33 was changed for half the subjects in each group. In both experiments, the amount of blink inhibition decreased during training whereas the amount of blink facilitation remained unchanged. Lead stimulus change had no effect on blink modification in either experiment although it resulted in enhanced skin conductance responses and greater heart rate deceleration in Experiment 2. The present results are not consistent with the notion that blink facilitation is linked to orienting whereas blink inhibition reflects a transient detection mechanism. (C) 1998 Elsevier Science B.V.

A study of the stability of subcycling algorithms in structural dynamics

Algorithms for explicit integration of structural dynamics problems with multiple time steps (subcycling) are investigated. Only one such algorithm, due to Smolinski and Sleith has proved to be stable in a classical sense. A simplified version of this algorithm that retains its stability is presented. However, as with the original version, it can be shown to sacrifice accuracy to achieve stability. Another algorithm in use is shown to be only statistically stable, in that a probability of stability can be assigned if appropriate time step limits are observed. This probability improves rapidly with the number of degrees of freedom in a finite element model. The stability problems are shown to be a property of the central difference method itself, which is modified to give the subcycling algorithm. A related problem is shown to arise when a constraint equation in time is introduced into a time-continuous space-time finite element model. (C) 1998 Elsevier Science S.A.