An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

Fault-tolerant quantum computation with cluster states

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.

A scheme for efficient quantum computation wtih linear optics

Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.

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.

Transport, storage and mobilization of nitrogen by trees and shrubs in the wet/dry tropics of northern Australia

Xylem sap from woody species in the wet/dry tropics of northern Australia was analyzed for N compounds. At the peak of the dry season, arginine was the main N compound in sap of most species of woodlands and deciduous monsoon forest. In the wet season, a marked change occurred with amides becoming the main sap N constituents of most species. Species from an evergreen monsoon forest, with a permanent water source, transported amides in the dry season. In the dry season, nitrate accounted for 7 and 12% of total xylem sap N in species of deciduous and evergreen monsoon forests, respectively In the wet season, the proportion of N present as nitrate increased to 22% in deciduous monsoon forest species. These results suggest that N is taken up and assimilated mainly in the wet season and that this newly assimilated N is mostly transported as amide-N (woodland species, monsoon forest species) and nitrate (monsoon forest species). Arginine is the form in which stored N is remobilized and transported by woodland and deciduous monsoon forest species in the dry season. Several proteins, which may represent bark storage proteins, were detected in inner bark tissue from a range of trees in the dry season, indicating that, although N uptake appears to be limited in the dry season, the many tree and shrub species that produce flowers, fruit or leaves in the dry season use stored N to support growth. Nitrogen characteristics of the studied species are discussed in relation to the tropical environment.

Whole-body pre-cooling and heat storage during self-paced cycling performance in warm humid conditions

The aim of this study was to establish the effect that pre-cooling the skin without a concomitant reduction in core temperature has on subsequent self-paced cycling performance under warm humid (31 degrees C and 60% relative humidity) conditions. Seven moderately trained males performed a 30 min self-paced cycling trial on two separate occasions. The conditions were counterbalanced as control or whole-body pre-cooling by water immersion so that resting skin temperature was reduced by approximate to 5-6 degrees C. After pre-cooling, mean skin temperature was lower throughout exercise and rectal temperature was lower (P < 0.05) between 15 and 25 min of exercise. Consequently, heat storage increased (P < 0.003) from 84.0 +/- 8.8 W . m(-2) to 153 +/- 13.1 W . m(-2) (mean +/- s((x) over bar)) after pre-cooling, while total body sweat fell from 1.7 +/- 0.1 1 . h(-1) to 1.2 +/- 0.1 1 . h(-1) (P < 0.05). The distance cycled increased from 14.9 +/- 0.8 to 15.8 +/- 0.7 km (P < 0.05) after pre-cooling. The results indicate that skin pre-cooling in the absence of a reduced rectal temperature is effective in reducing thermal strain and increasing the distance cycled in 30 min under warm humid conditions.

Computation of bifurcation boundaries for power systems: A new Delta-plane method

This paper is devoted to the problems of finding the load flow feasibility, saddle node, and Hopf bifurcation boundaries in the space of power system parameters. The first part contains a review of the existing relevant approaches including not-so-well-known contributions from Russia. The second part presents a new robust method for finding the power system load flow feasibility boundary on the plane defined by any three vectors of dependent variables (nodal voltages), called the Delta plane. The method exploits some quadratic and linear properties of the load now equations and state matrices written in rectangular coordinates. An advantage of the method is that it does not require an iterative solution of nonlinear equations (except the eigenvalue problem). In addition to benefits for visualization, the method is a useful tool for topological studies of power system multiple solution structures and stability domains. Although the power system application is developed, the method can be equally efficient for any quadratic algebraic problem.

Effect of storage time and conditions on the hardness and cooking quality of adzuki (Vigna angularis)

A storage trial of two varieties of adzuki (Vigna angularis), Bloodwood and Erimo, produced in Australia, was conducted to determine the effect of various combinations of temperature, humidity and length of storage on bean quality. The beans were stored for up to 6 mo under the following conditions: temperature (10, 20 and 30degreesC), relative humidity (RH) (40 and 65%). Storage of adzuki at elevated temperature (30degreesC) and low relative humidity (40%) resulted in the greatest loss of bean moisture, increase in hydration times and decrease in bean cooking quality, i.e. increased hardness of cooked beans. The best storage conditions for the preservation of adzuki quality were 10degreesC and 65% RH.

Four cases of equine polysaccharide storage myopathy in the United Kingdom

This paper describes four cases of equine polysaccharide storage myopathy which were confirmed by histological examination of muscle biopsy specimens. The horses were of mixed breeding, with warmblood and thoroughbred dominating. They all had recurrent episodes of rhabdomyolysis, indicated by clinical signs and increased plasma levels of muscle enzymes. They were managed conservatively and have continued athletic careers despite their disease.

Effect of storage of adzuki bean (Vigna angularis) on starch and protein properties

Differential scanning calorimetry was used to evaluate the effect of storage at 10degreesC, 20degreesC and 30degreesC, and 40% and 65% relative humidity (RH) on adzuki bean starch gelatinisation and protein denaturation temperatures. Storage for 6 months at an elevated storage temperature (30degreesC) caused increases in the starch gelatinisation onset temperature (T-o) and gelatinisation peak temperature (T-p) for both Bloodwood and Erimo varieties. Storage at 40% RH resulted in higher T-o and T-p values than storage at 65% RH. The T-o of starch from Bloodwood and Erimo beans stored for up to 1.5 months at 10degreesC and 65% were similar to those of fresh beans. The changes in the salt-soluble protein component were less clear cut than those of the starch. Nonetheless, protein extracted from beans stored at 40% RH exhibited significantly lower T-o and T-p values compared with those stored at 65% RH. This indicates some destabilisation of the protein at the higher RH. These results suggest that detrimental changes occur in starch and, to a lesser extent protein, of adzuki beans stored under unfavourable conditions. On the basis of these results, the best storage conditions to maintain the characteristics of fresh beans are low temperatures (e.g. 10degreesC) and high RH (e.g. 65%). (C) 2003 Swiss Society of Food Science and Technology. Published by Elsevier Science Ltd. All rights reserved.

Stimulating dormancy release and emergence of annual ryegrass (Lolium rigidum) seeds using short-term hydrated storage in darkness

Experiments were performed to determine whether the dormancy release effect of hydrated storage in darkness (dark-stratification) is common amongst annual ryegrass populations and has the potential to occur under field conditions. Dormant seeds from all populations tested (22) became sensitive to light during dark-stratification, enabling them to germinate when subsequently exposed to light. Under controlled temperature (25/15degreesC), light (12-h photoperiod), and hydration (solidified agar-water) conditions, more seeds germinated by 28 days if the first 14 days were in darkness followed by exposure to light for 12 h per day than if they were exposed to light throughout or darkness throughout. Constraint over the conditions imposed during dark-stratification and germination was gradually reduced to investigate whether the dormancy release effect was diminished. Dark-stratification was effective in promoting germination when performed under natural diurnal temperatures, and burial in moist soil provided suitable conditions for dark-stratification to occur. The surface of moist soil, with natural diurnal temperatures and sunlight, was suitable for germination of dark-stratified seeds. Dark-stratification is a quick and effective means to enhance the sensitivity of dormant annual ryegrass seeds to light, enabling the majority of the population to germinate. However, large quantities of light are required to promote germination of dark-stratified seeds, so buried seeds must be moved to the soil surface to allow exposure to adequate light for germination.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.