Determining Initial States for Time-Parallel Simulations

In this paper, we propose a time-parallel simulation method which uses a pre-simulation to identify recurrent states. Also, an approximation technique is suggested for approximate Markovian modeling for queueing networks to extend the class of simulation models which can be simulated efficiently using our time-parallel simulation. A central server system and a virtual circuit of a packet-switched data communication network modeled by closed queueing networks are experimented with the proposed time-parallel simulation. Experiment results suggest that the proposed approach can exploit massive parallelism while yielding accurate results

Simulating chemistry efficiently on fault-tolerant quantum computers

Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf. Comput.}, \textbf{6}:81, 2006]. For a given approximation error $\epsilon$, arbitrary single-qubit gates can be produced fault-tolerantly and using a limited set of gates in time which is $O(\log \epsilon)$ or $O(\log \log \epsilon)$; with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for Lithium hydride.Comment: 33 pages, 18 figure

Helioseismic Holography of an Artificial Submerged Sound Speed Perturbation and Implications for the Detection of Pre-Emergence Signatures of Active Regions

We use a publicly available numerical wave-propagation simulation of Hartlep et al. 2011 to test the ability of helioseismic holography to detect signatures of a compact, fully submerged, 5% sound-speed perturbation placed at a depth of 50 Mm within a solar model. We find that helioseismic holography as employed in a nominal "lateral-vantage" or "deep-focus" geometry employing quadrants of an annular pupil is capable of detecting and characterizing the perturbation. A number of tests of the methodology, including the use of a plane-parallel approximation, the definition of travel-time shifts, the use of different phase-speed filters, and changes to the pupils, are also performed. It is found that travel-time shifts made using Gabor-wavelet fitting are essentially identical to those derived from the phase of the Fourier transform of the cross-covariance functions. The errors in travel-time shifts caused by the plane-parallel approximation can be minimized to less than a second for the depths and fields of view considered here. Based on the measured strength of the mean travel-time signal of the perturbation, no substantial improvement in sensitivity is produced by varying the analysis procedure from the nominal methodology in conformance with expectations. The measured travel-time shifts are essentially unchanged by varying the profile of the phase-speed filter or omitting the filter entirely. The method remains maximally sensitive when applied with pupils that are wide quadrants, as opposed to narrower quadrants or with pupils composed of smaller arcs. We discuss the significance of these results for the recent controversy regarding suspected pre-emergence signatures of active regions

Fuzzy Modeling and Parallel Distributed Compensation for Aircraft Flight Control from Simulated Flight Data

A method is described that combines fuzzy system identification techniques with Parallel Distributed Compensation (PDC) to develop nonlinear control methods for aircraft using minimal a priori knowledge, as part of NASAs Learn-to-Fly initiative. A fuzzy model was generated with simulated flight data, and consisted of a weighted average of multiple linear time invariant state-space cells having parameters estimated using the equation-error approach and a least-squares estimator. A compensator was designed for each subsystem using Linear Matrix Inequalities (LMI) to guarantee closed-loop stability and performance requirements. This approach is demonstrated using simulated flight data to automatically develop a fuzzy model and design control laws for a simplified longitudinal approximation of the F-16 nonlinear flight dynamics simulation. Results include a comparison of flight data with the estimated fuzzy models and simulations that illustrate the feasibility and utility of the combined fuzzy modeling and control approach

Interval uneffectiveness distribution for a k-out-of-n multistate reliability system with repair

This paper deals with a parallel load-sharing reliability system with cold standby redundancy and ample repair facilities. That is, we have n identical parallel units, of which at most k units are operating simultaneously. If less than k units are available, the system operates at a proportionally reduced level. For this system, an approximate method is given for the calculation of the probability distribution of that proportion of the system capacity that cannot be used in a given time period. The method is based on an approximation of the k-out-of-n multistate system by a two-state single component. Validation of the approximation using Monte-Carlo simulation shows satisfactory performance. Also, sensitivity results are given, showing in particular a decreasing sensitivity of the measures of performance to the distributional form of the unit lifetimes and repair times as the size of the system increases. Furthermore, it is found that the effect of the distributional form of the unit lifetimes dominates that of the unit repair time

Global linear stability of the non-parallel Batchelor vortex

International audienceLinear stability of the non-parallel Batchelor vortex is studied using global modes. This family of swirling wakes and jets has been extensively studied under the parallel-flow approximation, and in this paper we extend to more realistic non-parallel base flows. Our base flow is obtained as an exact steady solution of the Navier-Stokes equations by direct numerical simulation (with imposed axisymmetry to damp all instabilities). Global stability modes are computed by numerical simulation of the linearized equations, using the implicitly restarted Arnoldi method, and we discuss fully the numerical and convergence issues encountered. Emphasis is placed on exploring the general structure of the global spectrum, and in particular the correspondence between global modes and local absolute modes which is anticipated by weakly non-parallel asymptotic theory. We believe that our computed global modes for a weakly non-parallel vortex are the first to display this correspondence with local absolute modes. Superpositions of global modes are also studied, allowing an investigation of the amplifier dynamics of this unstable flow. For an illustrative case we find global non-modal transient growth via a convective mechanism. Generally amplifier dynamics, via convective growth, are prevalent over short time intervals, and resonator dynamics, via global mode growth, become prevalent at later times. © 2009 Cambridge University Press

Selecting a Component with Longer Mean Life Time in Bivariate Pareto Models

In any parallel system, selecting a component with longer mean lifetime is of interest to the researchers. Hanagal (1997) [1] discussed selection procedures for a two-component system with bivariate exponential (BVE) models. In this paper, the problem of selecting a better component with reference to its mean life time under bivariate Pareto (BVP) models is considered. Three selection procedures based on sample proportions, sample means and maximum likelihood estimators (MLE) are proposed. The probability of correct selection for the proposed procedures is evaluated through Monte Carlo simulation using normal approximation. The asymptotic relative efficiency (ARE) of the proposed procedures is presented to facilitate the evaluation of the performance of procedures

Investigating the Effects of Trees and Butterfly Barriers on the Performance of Optimistic GVT Algorithm

The final publication is available at www.springerlink.comThere is two approaches for handling timing constraints in a heterogeneous network; conservatives and optimistic algorithms. In optimistic algorithms, time constraints are allowed to be violated with the help of a time wrap algorithm. Global Virtue Time (GVT) is a necessary mechanism for implementing time wrap algorithm. Mattern [2] has introduced an algorithm for GVT based computation using a ring structure. which showed high latency. The performance of this optimistic algorithm is optimal since it gives accurate GVT approximation. However, this accurate GVT approximation comes at the expense of high GVT latency. Since this resultant GVT latency is not only high but may vary, the multiple processors involve in communication remain idle during that period of time. Consequently, the overall throughput of a parallel and distributed simulation system degrades significantly In this paper, we discuss the potential use of trees and (or) butterflies structures instead of the ring structure. We present our analysis to show the effect of these new mechanisms on the latency of the system.http://link.springer.com/chapter/10.1007%2F978-90-481-3660-5_7