Optical trapping of a cube

The successful development and optimisation of optically-driven micromachines will be greatly enhanced by the ability to computationally model the optical forces and torques applied to such devices. In principle, this can be done by calculating the light-scattering properties of such devices. However, while fast methods exist for scattering calculations for spheres and axisymmetric particles, optically-driven micromachines will almost always be more geometrically complex. Fortunately, such micromachines will typically possess a high degree of symmetry, typically discrete rotational symmetry. Many current designs for optically-driven micromachines are also mirror-symmetric about a plane. We show how such symmetries can be used to reduce the computational time required by orders of magnitude. Similar improvements are also possible for other highly-symmetric objects such as crystals. We demonstrate the efficacy of such methods by modelling the optical trapping of a cube, and show that even simple shapes can function as optically-driven micromachines.

A family of perfect hashing methods

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.

Surface diffusion of hydrocarbons in activated carbon: Comparison between constant molar flow, differential permeation and differential adsorption bed methods

This paper presents the comparison of surface diffusivities of hydrocarbons in activated carbon. The surface diffusivities are obtained from the analysis of kinetic data collected using three different kinetics methods- the constant molar flow, the differential adsorption bed and the differential permeation methods. In general the values of surface diffusivity obtained by these methods agree with each other, and it is found that the surface diffusivity increases very fast with loading. Such a fast increase can not be accounted for by a thermodynamic Darken factor, and the surface heterogeneity only partially accounts for the fast rise of surface diffusivity versus loading. Surface diffusivities of methane, ethane, propane, n-butane, n-hexane, benzene and ethanol on activated carbon are reported in this paper.

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.

Fast accumulation of few polyhedra mutants during passage of a Spodoptera frugiperda multicapsid nucleopolyhedrovirus (Baculoviridae) in Sf9 cell cultures

Baculoviruses are a group of viruses that infect invertebrates and that have been used worldwide as a biopesticide against several insect pests of the Order Lepidoptera. In Brazil, the baculovirus Spodoptera frugiperda multicapsid nucleopolyhedrovirus (SfMNPV, Baculoviridae) has been used experimentally to control S. frugiperda (Lepidoptera: Noctuidae), an important insect pest of corn (maize) fields and other crops. Baculoviruses can be produced either in insect larvae or in cell culture bioreactors. A major limitation to the in vitro production of baculoviruses is the rapid generation of mutants when the virus undergoes passages in cell culture. In order to evaluate the potential of in vitro methods of producing SfMNPV on a large-scale, we have multiplied a Brazilian isolate of this virus in cell culture. Extensive formation of few polyhedra mutants was observed after only two passages in Sf9 cells.

Fast stereo matching by iterated dynamic programming and quadtree subregioning

The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a few seconds of computation. In this paper, we present our iterated dynamic programming algorithm along with a quadtree subregioning process for fast stereo matching.

Assessing the competitiveness of loss allocation methods in a deregulated electricity market

This paper critically assesses several loss allocation methods based on the type of competition each method promotes. This understanding assists in determining which method will promote more efficient network operations when implemented in deregulated electricity industries. The methods addressed in this paper include the pro rata [1], proportional sharing [2], loss formula [3], incremental [4], and a new method proposed by the authors of this paper, which is loop-based [5]. These methods are tested on a modified Nordic 32-bus network, where different case studies of different operating points are investigated. The varying results obtained for each allocation method at different operating points make it possible to distinguish methods that promote unhealthy competition from those that encourage better system operation.

Calculation of line integrals in boundary integral methods

We propose quadrature rules for the approximation of line integrals possessing logarithmic singularities and show their convergence. In some instances a superconvergence rate is demonstrated.

Sampling phylogenetic tree space with the generalized Gibbs sampler

The generalized Gibbs sampler (GGS) is a recently developed Markov chain Monte Carlo (MCMC) technique that enables Gibbs-like sampling of state spaces that lack a convenient representation in terms of a fixed coordinate system. This paper describes a new sampler, called the tree sampler, which uses the GGS to sample from a state space consisting of phylogenetic trees. The tree sampler is useful for a wide range of phylogenetic applications, including Bayesian, maximum likelihood, and maximum parsimony methods. A fast new algorithm to search for a maximum parsimony phylogeny is presented, using the tree sampler in the context of simulated annealing. The mathematics underlying the algorithm is explained and its time complexity is analyzed. The method is tested on two large data sets consisting of 123 sequences and 500 sequences, respectively. The new algorithm is shown to compare very favorably in terms of speed and accuracy to the program DNAPARS from the PHYLIP package.

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.