Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 937 records · Page 52

Tailor : Altering Skip Connections for Resource-Efficient Inference

Deep neural networks use skip connections to improve training convergence. However, these skip connections are costly in hardware, requiring extra buffers and increasing on- and off-chip memory utilization and bandwidth requirements. In this article, we show that skip connections can be optimized for hardware when tackled with a hardware-software codesign approach. We argue that while a network’s skip connections are needed for the network to learn, they can later be removed or shortened to provide a more hardware-efficient implementation with minimal to no accuracy loss. We introduceTailor, a codesign tool whose hardware-aware training algorithm gradually removes or shortens a fully trained network’s skip connections to lower the hardware cost.Tailorimproves resource utilization by up to 34% for block random access memories (BRAMs), 13% for flip-flops (FFs), and 16% for look-up tables (LUTs) for on-chip, dataflow-style architectures.Tailorincreases performance by 30% and reduces memory bandwidth by 45% for a two-dimensional processing element array architecture.

Computer Science↗

A Monte Carlo method for the simulation of coagulation and nucleation based on weighted particles and the concepts of stochastic resolution and merging

Monte Carlo simulations based on weighted simulation particles can solve a variety of population balance problems and allow thus to formulate a solution-framework for many chemical engineering processes. This study presents a novel concept for the calculation of coagulation rates of weighted Monte Carlo particles by introducing a family of transformations to non-weighted Monte Carlo particles. The tuning of the accuracy (named ‘stochastic resolution’ in this paper) of those transformations allows the construction of a constant-number coagulation scheme. Furthermore, a parallel algorithm for the inclusion of newly formed Monte Carlo particles due to nucleation is presented in the scope of a constant-number scheme: the low-weight merging. This technique is found to create significantly less statistical simulation noise than the conventional technique (named ‘random removal’ in this paper). Both concepts are combined into a single GPU-based simulation method which is validated by comparison with the discrete-sectional simulation technique. Two test models describing a constant-rate nucleation coupled to a simultaneous coagulation in 1) the free-molecular regime or 2) the continuum regime are simulated for this purpose.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the adaptivity and complexity embedded into differential evolution

This research deals with the comparison of the two modern approaches for evolutionary algorithms, which are the adaptivity and complex chaotic dynamics. This paper aims on the investigations on the chaos-driven Differential Evolution (DE) concept. This paper is aimed at the embedding of discrete dissipative chaotic systems in the form of chaotic pseudo random number generators for the DE and comparing the influence to the performance with the state of the art adaptive representative jDE. This research is focused mainly on the possible disadvantages and advantages of both compared approaches. Repeated simulations for Lozi map driving chaotic systems were performed on the simple benchmark functions set, which are more close to the real optimization problems. Obtained results are compared with the canonical not-chaotic and not adaptive DE. Results show that with used simple test functions, the performance of ChaosDE is better in the most cases than jDE and Canonical DE, furthermore due to the unique sequencing in CPRNG given by the hidden chaotic dynamics, thus better and faster selection of unique individuals from population, ChaosDE is faster.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New perspectives on superparameterization for geophysical turbulence

This is a research expository paper regarding superparameterization, a class of multi-scale numerical methods designed to cope with the intermittent multi-scale effects of inhomogeneous geophysical turbulence where energy often inverse-cascades from the unresolved scales to the large scales through the effects of waves, jets, vortices, and latent heat release from moist processes. Original as well as sparse space–time superparameterization algorithms are discussed for the important case of moist atmospheric convection including the role of multi-scale asymptotic methods in providing self-consistent constraints on superparameterization algorithms and related deterministic and stochastic multi-cloud parameterizations. Test models for the statistical numerical analysis of superparameterization algorithms are discussed both to elucidate the performance of the basic algorithms and to test their potential role in efficient multi-scale data assimilation. The very recent development of grid-free seamless stochastic superparameterization methods for geophysical turbulence appropriate for “eddy-permitting” mesoscale ocean turbulence is presented here including a general formulation and illustrative applications to two-layer quasigeostrophic turbulence, and another difficult test case involving one-dimensional models of dispersive wave turbulence. This last test case has randomly generated solitons as coherent structures which collapse and radiate wave energy back to the larger scales, resulting in strong direct and inverse turbulent energy cascades.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Spectral Approach for the Design of Experiments: Design, Analysis and Algorithms

This paper proposes a new approach to construct high quality space-filling sample designs. First, we propose a novel technique to quantify the space-filling property and optimally trade-off uniformity and randomness in sample designs in arbitrary dimensions. Second, we connect the proposed metric (defined in the spatial domain) to the quality metric of the design performance (defined in the spectral domain). This connection serves as an analytic framework for evaluating the qualitative properties of space-filling designs in general. Using the theoretical insights provided by this spatial-spectral analysis, we derive the notion of optimal space-filling designs, which we refer to as space-filling spectral designs. Third, we propose an efficient estimator to evaluate the space-filling properties of sample designs in arbitrary dimensions and use it to develop an optimization framework for generating high quality space-filling designs. Finally, we carry out a detailed performance comparison on two different applications in varying dimensions: a) image reconstruction and b) surrogate modeling for several benchmark optimization functions and a physics simulation code for inertial confinement fusion (ICF). Our results clearly evidence the superiority of the proposed space-filling designs over existing approaches, particularly in high dimensions.

97 MATHEMATICS AND COMPUTING↗

Comparison of quantum advantage experiments using random circuit sampling

Random circuit sampling, the task of sampling bit strings from a random unitary operator, has been implemented to demonstrate quantum advantage on the Sycamore quantum processor with 53 qubits and on the Zuchongzhi quantum processor with 56 and 61 qubits. Recently, it was claimed that classical computers using tensor network simulation could catch on to current noisy quantum processors for random circuit sampling. While the linear cross-entropy benchmark fidelity was used to certify all these claims, it may not capture statistical properties of outputs in detail. Here, we compare the bit strings sampled from classical computers using tensor network simulation by Pan et al. [F. Pan, K. Chen, and P. Zhang, Phys. Rev. Lett. 129, 090502 (2022)] and by Kalachev et al. [G. Kalachev, P. Panteleev, P. Zhou, and M.-H. Yung, arXiv:2112.15083] with the bit strings from the Sycamore quantum processor. It is shown that all of Kalachev et al.'s samples passed the NIST random number tests. The heat maps of bit strings show that Pan et al.'s and Kalachev et al.'s samples are quite different from the Sycamore or Zuchongzhi samples. The analysis with the Marchenko-Pastur distribution and the Wasssertein distances demonstrates that Kalachev et al.'s samples are statistically closer to the Sycamore samples than Pan et al.'s while the three datasets have similar values for the linear cross-entropy fidelity. In conclusion, our finding implies that further study is needed to certify or beat the claims of quantum advantage using random circuit sampling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data Driven Temperature Control of Heat Exchangers

The following poster presents a couple of approaches for temperature control at heat exchanger’s exit. One of the approaches is based on using n-step ahead neural network while the other approach utilizes a combination of control + learning module for temperature control. Designing robust controllers for typical heat exchangers is very challenging primarily because of complexities associated with the synthesis of dynamics of industrial heat exchangers. Even if a dynamics model is synthesized, the accuracy of it would be called into question as there can be lot of unmodeled system dynamics and random noise in input parameters. In many situations, the degree of uncertainty in the model of system being controlled limits the utility of optimal control design. Controller can be manually tuned on the field but it is very difficult to determine manual adjustments that result in overall improvement. These practical challenges call for learning based approaches for temperature control that would result in optimal heat exchanger performance. We utilize the existing mathematical model for air-water system synthesized by Underwood and Crawford for testing our algorithms. Underwood and Crawford developed a model of heating coil by fitting a second-order non-linear equations to measurements of air and water temperature and flow rates obtained from the actual coil. The uncertainties in the model include air and water inlet temperatures and air-flow rate. These uncertainties are modeled as random variables that are sampled from a uniform distribution. The control variable is the water flow rate which is controlled for regulating the air-outlet temperature. Neural networks are frequently used in various literatures for learning time-series. We propose a modified version of neural networks known as n-step ahead neural network that take the state variables and output at time t as input to successfully predict output at time t+n. The variable n is a hyper-parameter which can be optimized based on performance constraints. The n-step ahead neural network was then trained on training data generated from experimental model to high training accuracies. This trained model performed appreciably in its objective to regulate outlet temperature of a heat exchanger. The second approach uses a combination of control and learning module for temperature regulation. The control module used is a proportional controller while the learning module used is steady state neural network. The steady state neural network is used to learn the controller output as a function of random variables and temperature set-point. The proportional controller is then used to compensate for transient behavior of linearized system around various operating points. The algorithm works effectively for temperature regulation as neural network captures the non-linear input-output behavior of closed loop system leaving proportional controller to compensate for steady state errors of a linearized plant. The proposed algorithm’s performances were evaluated against the performance of a PI controller. Further, the robustness of the algorithms were also studied in great detail under small perturbations around tuned parameters of the proposed algorithms.

Sundar, Sreenath↗

Modeling Wavelength Dependent Mid-infrared (5.5–25 μm) Optical Constants of Silicate Glasses: A Genetic Algorithm Approach

Wavelength-dependent mid-infrared (400–1,800 cm -1 ; 5.56–25 μm) optical constants (real and imaginary indices of refraction; n and k) are determined using reflectance spectra at a spectral sampling of 4 cm -1 for several silicate glasses of varying SiO 2 wt% which include (a) basaltic volcanic glass from Kilauea, Hawaii, (b) synthetic andesite, (c) two synthetic dacites, (d) obsidian volcanic glass from Mount Lassen, California, (e) synthetic rhyodacite, and (f) rhyolitic volcanic glass from Mexico. Because glasses are optically isotropic, no specific orientation was required for spectral measurements, and polished glass samples were measured at random orientations using micro-FTIR spectrometer. Lorentz-Lorenz dispersion theory and Fresnel reflectance model for high symmetry materials were used to model the optical constants by optimizing oscillator parameters in modeled spectra to match laboratory spectra. A genetic algorithm (GA) approach automatically finds the natural oscillators and their parameters for each spectrum, and then uses these parameters in a non-linear least squares optimization routine. The study compared spectral parameters such as Christiansen feature, reststrahlen bands (RBs), and the peaks centered around 860–1,100 (peak 1) and 400–480 cm -1 (peak 2) of n and k to their respective SiO 2 wt% of the glasses. CF, RBs, peak 1 of n and k, and peak 2 of n shift to higher wavenumbers with increased SiO 2 wt%, whereas peak 2 of k shifts to lower wavenumbers with increased SiO 2 wt%. Derived optical constants of these glasses will improve quantitative abundance mapping of volcanic materials on the surfaces of silicate targets in the Solar System.

58 GEOSCIENCES↗

A generalized polynomial chaos based ensemble Kalman filter with high accuracy

As one of the most adopted sequential data assimilation methods in many areas, especially those involving complex nonlinear dynamics, the ensemble Kalman filter (EnKF) has been under extensive investigation regarding its properties and efficiency. Compared to other variants of the Kalman filter (KF), EnKF is straightforward to implement, as it employs random ensembles to represent solution states. This, however, introduces sampling errors that affect the accuracy of EnKF in a negative manner. Though sampling errors can be easily reduced by using a large number of samples, in practice this is undesirable as each ensemble member is a solution of the system of state equations and can be time consuming to compute for large-scale problems. In this paper we present an efficient EnKF implementation via generalized polynomial chaos (gPC) expansion. The key ingredients of the proposed approach involve (1) solving the system of stochastic state equations via the gPC methodology to gain efficiency; and (2) sampling the gPC approximation of the stochastic solution with an arbitrarily large number of samples, at virtually no additional computational cost, to drastically reduce the sampling errors. The resulting algorithm thus achieves a high accuracy at reduced computational cost, compared to the classical implementations of EnKF. Numerical examples are provided to verify the convergence property and accuracy improvement of the new algorithm. We also prove that for linear systems with Gaussian noise, the first-order gPC Kalman filter method is equivalent to the exact Kalman filter.

97 MATHEMATICS AND COMPUTING↗

ENHANCED LENSING RATE BY CLUSTERING OF MASSIVE GALAXIES: NEWLY DISCOVERED SYSTEMS IN THE SLACS FIELDS

Galaxy-scale strong gravitational lens systems are useful for a variety of astrophysical applications. However, their use is limited by the relatively small samples of lenses known to date. It is thus important to develop efficient ways to discover new systems both in present and forthcoming data sets. For future large high-resolution imaging surveys we anticipate an ever-growing need for efficiency and for independence from spectroscopic data. In this paper, we exploit the clustering of massive galaxies to perform a high-efficiency imaging search for gravitational lenses. Our data set comprises 44 fields imaged by the Hubble Space Telescope (HST) Advanced Camera for Surveys (ACS), each of which is centered on a lens discovered by the Strong Lens ACS Survey (SLACS). We compare four different search methods: (1) automated detection with the HST Archive Galaxy-scale Gravitational Lens Survey (HAGGLeS) robot, (2) examining cutout images of bright galaxies (BGs) after subtraction of a smooth galaxy light distribution, (3) examining the unsubtracted BG cutouts, and (4) performing a full-frame visual inspection of the ACS images. We compute purity and completeness and consider investigator time for the four algorithms, using the main SLACS lenses as a testbed. The first and second algorithms perform the best. We present the four new lens systems discovered during this comprehensive search, as well as one other likely candidate. For each new lens we use the fundamental plane to estimate the lens velocity dispersion and predict, from the resulting lens geometry, the redshifts of the lensed sources. Two of these new systems are found in galaxy clusters, which include the SLACS lenses in the two respective fields. Overall we find that the enhanced lens abundance (30{sup +24} {sub -8} lenses deg{sup -2}) is higher than expected for random fields (12{sup +4} {sub -2} lenses deg{sup -2} for the COSMOS survey). Additionally, we find that the gravitational lenses we detect are qualitatively different from those in the parent SLACS sample: this imaging survey is largely probing higher redshift, and lower mass, early-type galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

VERIFICATION & VALIDATION OF A SEMANTIC IMAGE TAGGING FRAMEWORK VIA GENERATION OF GEOSPATIAL IMAGERY GROUND TRUTH

As a result of increasing geospatial image libraries, many algorithms are being developed to automatically extract and classify regions of interest from these images. However, limited work has been done to compare, validate and verify these algorithms due to the lack of datasets with high accuracy ground truth annotations. In this paper, we present an approach to generate a large number of synthetic images accompanied by perfect ground truth annotation via learning scene statistics from few training images through Maximum Entropy (ME) modeling. The ME model [1,2] embeds a Stochastic Context Free Grammar (SCFG) to model object attribute variations with Markov Random Fields (MRF) with the final goal of modeling contextual relations between objects. Using this model, 3D scenes are generated by configuring a 3D object model to obey the learned scene statistics. Finally, these plausible 3D scenes are captured by ray tracing software to produce synthetic images with the corresponding ground truth annotations that are useful for evaluating the performance of a variety of image analysis algorithms.

Markov Random Field (MRF)↗

Learning molecular energies using localized graph kernels

We report that recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab initio calculations) and at speeds suitable for molecular dynamics simulation. Best performance is achieved when the known physical constraints are encoded in the machine learning models. For example, the atomic energy is invariant under global translations and rotations; it is also invariant to permutations of same-species atoms. Although simple to state, these symmetries are complicated to encode into machine learning algorithms. In this paper, we present a machine learning approach based on graph theory that naturally incorporates translation, rotation, and permutation symmetries. Specifically, we use a random walk graph kernel to measure the similarity of two adjacency matrices, each of which represents a local atomic environment. This Graph Approximated Energy (GRAPE) approach is flexible and admits many possible extensions. Finally, we benchmark a simple version of GRAPE by predicting atomization energies on a standard dataset of organic molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Water Security Toolkit User Manual Version 1.2.

The Water Security Toolkit (WST) is a suite of open source software tools that can be used by water utilities to create response strategies to reduce the impact of contamination in a water distribution network . WST includes hydraulic and water quality modeling software , optimizati on methodologies , and visualization tools to identify: (1) sensor locations to detect contamination, (2) locations in the network in which the contamination was introduced, (3) hydrants to remove contaminated water from the distribution system, (4) locations in the network to inject decontamination agents to inactivate, remove, or destroy contaminants, (5) locations in the network to take grab sample s to help identify the source of contamination and (6) valves to close in order to isolate contaminate d areas of the network. This user manual describes the different components of WST , along w ith examples and case studies. License Notice The Water Security Toolkit (WST) v.1.2 Copyright c 2012 Sandia Corporation. Under the terms of Contract DE-AC04-94AL85000, there is a non-exclusive license for use of this work by or on behalf of the U.S. government. This software is distributed under the Revised BSD License (see below). In addition, WST leverages a variety of third-party software packages, which have separate licensing policies: Acro Revised BSD License argparse Python Software Foundation License Boost Boost Software License Coopr Revised BSD License Coverage BSD License Distribute Python Software Foundation License / Zope Public License EPANET Public Domain EPANET-ERD Revised BSD License EPANET-MSX GNU Lesser General Public License (LGPL) v.3 gcovr Revised BSD License GRASP AT&T Commercial License for noncommercial use; includes randomsample and sideconstraints executable files LZMA SDK Public Domain nose GNU Lesser General Public License (LGPL) v.2.1 ordereddict MIT License pip MIT License PLY BSD License PyEPANET Revised BSD License Pyro MIT License PyUtilib Revised BSD License PyYAML MIT License runpy2 Python Software Foundation License setuptools Python Software Foundation License / Zope Public License six MIT License TinyXML zlib License unittest2 BSD License Utilib Revised BSD License virtualenv MIT License Vol Common Public License vpykit Revised BSD License Additionally, some precompiled WST binary distributions might bundle other third-party executables files: Coliny Revised BSD License (part of Acro project) Dakota GNU Lesser General Public License (LGPL) v.2.1 PICO Revised BSD License (part of Acro project) i Revised BSD License Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Sandia National Laboratories nor Sandia Corporation nor the names of its con- tributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IM- PLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUD- ING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ii Acknowledgements This work was supported by the U.S. Environmental Protection Agency through its Office of Research and Development (Interagency Agreement # DW8992192801). The material in this document has been subject to technical and policy review by the U.S. EPA, and approved for publication. The views expressed by individual authors, however, are their own, and do not necessarily reflect those of the U.S. Environmental Protection Agency. Mention of trade names, products, or services does not convey official U.S. EPA approval, endorsement, or recommendation. The Water Security Toolkit is an extension of the Threat Ensemble Vulnerability Assessment-Sensor Place- ment Optimization Tool (TEVA-SPOT), which was also developed with funding from the U.S. Environ- mental Protection Agency through its Office of Research and Development (Interagency Agreement # DW8992192801). The authors acknowledge the following individuals for their contributions to the devel- opment of TEVA-SPOT: Jonathan Berry (Sandia National Laboratories), Erik Boman (Sandia National Laboratories), Lee Ann Riesen (Sandia National Laboratories), James Uber (University of Cincinnati), and Jean-Paul Watson (Sandia National Laboratories). iii Acronyms ATUS American Time-Use Survey BLAS Basic linear algebra sub-routines CFU Colony-forming unit CVAR Conditional value at risk CWS Contamination warning system EA Evolutionary algorithm EDS Event detection system EPA U.S. Environmental Protection Agency EC Extent of Contamination ERD EPANET results database file GLPK GNU Linear Programming Kit GRASP Greedy randomized adaptive sampling process HEX Hexadecimal HTML HyperText markup language INP EPANET input file LP Linear program MC Mass consumed MILP Mixed integer linear program MIP Mixed integer program MSX Multi-species extension for EPANET NFD Number of failed detections NS Number of sensors NZD Non-zero demand PD Population dosed PE Population exposed PK Population killed TAI Threat assessment input file TCE Tailed-conditioned expectation TD Time to detection TEC Timed extent of contamination TEVA Threat ensemble vulnerability assessment TSB Tryptic soy broth TSG Threat scenario generation file TSI Threat simulation input file VAR Value at risk VC Volume consumed WST Water Security Toolkit YML YAML configuration file format for WST iv Symbols Notation Definition Example { , } set brackets { 1,2,3 } means a set containing the values 1,2, and 3. [?] is an element of s [?] S means that s is an element of the set S . [?] for all s = 1 [?] s [?] S means that the statement s = 1 is true for all s in set S . P summation P n i =1 s i means s 1 + s 2 + * * * + s n . \ set minus S \ T means the set that contains all those elements of S that are not in set T . %7C given %7C is used to define conditional probability. P ( s %7C t ) means the prob- ability of s occurring given that t occurs. %7C ... %7C cardinality Cardinality of a set is the number of elements of the set. If set S = { 2,4,6 } , then %7C S %7C = 3. v

Klise, Katherine A.↗

Is the Multigrid Method Fault Tolerant? The Two-Grid Case

The predicted reduced resiliency of next-generation high performance computers means that it will become necessary to take into account the effects of randomly occurring faults on numerical methods. Further, in the event of a hard fault occurring, a decision has to be made as to what remedial action should be taken in order to resume the execution of the algorithm. The action that is chosen can have a dramatic effect on the performance and characteristics of the scheme. Ideally, the resulting algorithm should be subjected to the same kind of mathematical analysis that was applied to the original, deterministic variant. The purpose of this work is to provide an analysis of the behaviour of the multigrid algorithm in the presence of faults. Multigrid is arguably the method of choice for the solution of large-scale linear algebra problems arising from discretization of partial differential equations and it is of considerable importance to anticipate its behaviour on an exascale machine. The analysis of resilience of algorithms is in its infancy and the current work is perhaps the first to provide a mathematical model for faults and analyse the behaviour of a state-of-the-art algorithm under the model. It is shown that the Two Grid Method fails to be resilient to faults. Attention is then turned to identifying the minimal necessary remedial action required to restore the rate of convergence to that enjoyed by the ideal fault-free method.

97 MATHEMATICS AND COMPUTING↗

An adaptive multi-level simulation algorithm for stochastic biological systems

Discrete-state, continuous-time Markov models are widely used in the modeling of biochemical reaction networks. Their complexity often precludes analytic solution, and we rely on stochastic simulation algorithms (SSA) to estimate system statistics. The Gillespie algorithm is exact, but computationally costly as it simulates every single reaction. As such, approximate stochastic simulation algorithms such as the tau-leap algorithm are often used. Potentially computationally more efficient, the system statistics generated suffer from significant bias unless tau is relatively small, in which case the computational time can be comparable to that of the Gillespie algorithm. The multi-level method [Anderson and Higham, “Multi-level Monte Carlo for continuous time Markov chains, with applications in biochemical kinetics,” SIAM Multiscale Model. Simul. 10(1), 146–179 (2012)] tackles this problem. A base estimator is computed using many (cheap) sample paths at low accuracy. The bias inherent in this estimator is then reduced using a number of corrections. Each correction term is estimated using a collection of paired sample paths where one path of each pair is generated at a higher accuracy compared to the other (and so more expensive). By sharing random variables between these paired paths, the variance of each correction estimator can be reduced. This renders the multi-level method very efficient as only a relatively small number of paired paths are required to calculate each correction term. In the original multi-level method, each sample path is simulated using the tau-leap algorithm with a fixed value of τ. This approach can result in poor performance when the reaction activity of a system changes substantially over the timescale of interest. By introducing a novel adaptive time-stepping approach where τ is chosen according to the stochastic behaviour of each sample path, we extend the applicability of the multi-level method to such cases. We demonstrate the efficiency of our method using a number of examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Description of the code ANVIL (ANisotropic Vhf Impulse Location)

In this paper, we have developed a general, three-dimensional method to locate sources of earth-directed radiation which takes into account the flight paths of reflected signals. While time-of-arrival algorithms exist for locating radio sources using line-of-sight propagation paths, radio sources originating above the surface of the earth will not necessarily emit strong power along direct paths to satellites. A combination of direct and ground-reflected pulses or only ground-reflected signals from such sources could be received by satellite-borne sensors. The work presented here applies to satellite detection of sub-ionospheric radio sources in a vacuum environment with ideal reflection off the earth's surface. Because satellites are not static receivers, their configuration with respect to a radio source is not always optimal. Therefore, a statistical study is performed using 1000 randomized configurations of 24 satellites in middle earth orbit. For each configuration, the radio source latitude and longitude is fixed, and its altitude is varied from 1 to 97 km. An analytic direct-path algorithm using the five satellites nearest the radio source provides an initial guess for the radio source latitude and longitude. We find that, using this approximation, the mean error in the calculated nadir location has a maximum value of 134 m for the 97-km source altitude. The coordinates of the initial guess are used to define the origin of a grid within which an all-points search refinement is performed. Finally, using this procedure, the overall maximum mean error in radio source position is found to be on the order of the computational grid size.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗