Erratum: Production of a Z boson and two jets with one heavy-quark tag [Phys. Rev. D 73, 054007 (2006)]
No abstract prepared.
SEARCH · Engineering Papers
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.
No abstract prepared.
First study of η(c)(1S), η(1760) and X(1835) production via η 'π + π - final states in two-photon collisions.
In materials science and many other research areas, models are frequently inferred without considering their generalization to unseen data. Here, we apply statistical learning using cross-validation to obtain an optimally predictive coarse-grained description of a two-dimensional kinetic nearest-neighbor Ising model with Glauber dynamics (GD) based on the stochastic Ginzburg-Landau equation (sGLE). The latter is learned from GD “training” data using a log-likelihood analysis, and its predictive ability for various complexities of the model is tested on GD “test” data independent of the data used to train the model on. Using two different error metrics, we perform a detailed analysis of the error between magnetization time trajectories simulated using the learned sGLE coarse-grained description and those obtained using the GD model. We show that both for equilibrium and out-of-equilibrium GD training trajectories, the standard phenomenological description using a quartic free energy does not always yield the most predictive coarse-grained model. Moreover, increasing the amount of training data can shift the optimal model complexity to higher values. Our results are promising in that they pave the way for the use of statistical learning as a general tool for materials modeling and discovery.
We present the first results for neutral-kaon mixing using (2+1)-flavors of domain-wall fermions. A new approach is used to extrapolate to the physical up and down quark masses from our numerical studies with pion masses in the range 240-420 MeV; only SU(2){sub L}xSU(2){sub R} chiral symmetry is assumed and the kaon is not assumed to be light. Our main result is B{sub K}{sup MS}(2 GeV)=0.524(10)(28) where the first error is statistical and the second incorporates estimates for all systematic errors.
We present results for the nucleon axial charge g{sub A} at a fixed lattice spacing of 1/a=1.73(3) GeV using 2+1 flavors of domain wall fermions on size 16{sup 3}x32 and 24{sup 3}x64 lattices (L=1.8 and 2.7 fm) with length 16 in the fifth dimension. The length of the Monte Carlo trajectory at the lightest m{sub {pi}} is 7360 units, including 900 for thermalization. We find finite volume effects are larger than the pion mass dependence at m{sub {pi}}=330 MeV. We also find a scaling with the single variable m{sub {pi}}L which can also be seen in previous two-flavor domain wall and Wilson fermion calculations. Using this scaling to eliminate the finite-volume effect, we obtain g{sub A}=1.20(6)(4) at the physical pion mass, m{sub {pi}}=135 MeV, where the first and second errors are statistical and systematic. The observed finite-volume scaling also appears in similar quenched simulations, but disappear when V{>=}(2.4 fm){sup 3}. We argue this is a dynamical quark effect.
No abstract prepared.
Much attention has been paid to dynamical simulation and quantum machine learning (QML) independently as applications for quantum advantage, while the possibility of using QML to enhance dynamical simulations has not been thoroughly investigated. Here we develop a framework for using QML methods to simulate quantum dynamics on near-term quantum hardware. We use generalization bounds, which bound the error a machine learning model makes on unseen data, to rigorously analyze the training data requirements of an algorithm within this framework. Our algorithm is thus resource efficient in terms of qubit and data requirements. Furthermore, our preliminary numerics for the XY model exhibit efficient scaling with problem size, and we simulate 20 times longer than Trotterization on IBMQ-Bogota. Published by the American Physical Society 2024
This paper experimentally tests an implementation of a control barrier function (CBF) designed to guarantee a minimum time-gap in car following on an automated vehicle (AV) in live traffic, with a majority occurring on freeways. The CBF supervises a nominal unsafe PID controller on the AV’s velocity. The experimental testing spans two months of driving, of which 1.9 hours of data is collected in which the CBF and nominal controller are active. We find that violations of the guaranteed minimum time-gap are observed, as measured by the vehicle’s on-board radar unit. There are two distinct causes of the violations. First, in multi-lane traffic, Cut-ins from other vehicles represent external disturbances that can immediately violate the minimum guaranteed time gap provided by the CBF. When cut-ins occur, the CBF does eventually return the vehicle to a safe time gap. Second, even when cut-ins do not occur, system model inaccuracies (e.g., sensor error and delay, actuator error and delay) can lead to violations of the minimum time-gap. These violations are small relative to the violations that would have occurred using only the unsafe nominal control law.
Abstract Phenology is a first‐order control on productivity and mediates the biophysical environment by altering albedo, surface roughness length and evapotranspiration. Accurate and transparent modelling of vegetation phenology is therefore key in understanding feedbacks between the biosphere and the climate system. Here, we present the phenor r package and modelling framework. The framework leverages measurements of vegetation phenology from four common phenology observation datasets, the PhenoCam network, the USA National Phenology Network ( USA ‐ NPN ), the Pan European Phenology Project ( PEP 725), MODIS phenology ( MCD 12Q2) combined with (global) retrospective and projected climate data. We show an example analysis, using the phenor modelling framework, which quickly and easily compares 20 included spring phenology models for three plant functional types. An analysis of model skill using the root mean squared ( RMSE ) error shows little or no difference regardless of model structure, corroborating previous studies. We argue that addressing this issue will require novel model development combined with easy data assimilation as facilitated by our framework. In conclusion, we hope the phenor phenology modelling framework in the r language and environment for statistical computing will facilitate reproducibility and community driven phenology model development, in order to increase their overall predictive power, and leverage an ever growing number of phenology data products.
Reflective mirror facets for concentrating solar power (CSP) systems have stringent requirements on the surface slope accuracy in order to provide adequate system performance. This paper presents a tool that can fully characterize facets quickly enough for 100% inspection on a production line. A facet for a CSP system, specifically a dish concentrator has a parabolic design shape. This shape will concentrate near-parallel rays from the sun to a point (or a line for trough systems). Deviations of surface slope from the design shape impact the performance of the system, either losing power that misses the target or increasing peak fluxes to undesirable levels. During development or production, accurate knowledge of facet defects can lead to improvements to lower cost or improve performance. The reported characterization system, SOFAST (Sandia Optical Fringe Analysis Slope Tool), has a computer-connected camera that images the reflective surface, which is positioned so that it reflects an active target, such as an LCD screen, to the camera. A series of fringe patterns are displayed on the screen while images are captured. Using the captured information, the reflected target location of each pixel of mirror viewed can be determined, and thus through a mathematical transformation, a surface normal map can be developed. This is then fitted to the selected model equation, and the errors from design are characterized. While similar approaches have been explored, several key developments are presented here. The combination of the display, capture, and data reduction in one system allows rapid characterization. An “electronic boresight” approach is utilized to accommodate physical equipment positioning deviations, making the system insensitive to setup errors. Up to 1.5×10 6 points are characterized on each facet. Finally, while prior automotive industry commercial systems resolve the data to shape determination, SOFAST concentrates on slope characterization and reporting, which is tailored to solar applications. SOFAST can be used for facet analysis during development. However, the real payoff is in production, where complete analysis is performed in about 10s. With optimized coding, this could be further reduced.
The optical design of the Long Trace Profiler optical system is explored with a commercial raytrace program, Zemax OpticStudio™ (ZOS)1, with the intent of finding and correcting sources of systematic error. ZOS provides both geometric raytracing tools and physical optics Gaussian beam propagation and diffraction image calculation tools, and two design modes, sequential component (SC) and non-sequential component (NSC) that are optimized for different aspects of the design process. The original LTP-II system employs a singlet lens with a 1250 mm focal length. It is optimized to provide minimum distortion over a surface slope angle range of ±5 mrad. Using the ZOS tools, we are able to simulate ghost rays that produce distortion in the beam spot image and can minimize the distortion by deliberate misalignment of the beamsplitter (BS) components. Unfortunately, the reference beam is compromised because of the component tilts. The most recent LTP500 system design simplifies the optical system and makes the reference beam usable again, even with misalignment of the polarizing beamsplitter (PBS). Two lenses are designed for the LTP500 - a cemented doublet that has been fabricated, and a singlet with one aspheric surface. Both have focal distances of 500 mm with an expanded angular measurement range of ±10 mrad. The aspheric singlet provides superior performance. ZOS allows the import of wavefront measurement data produced by commercial interferometer software. We apply the wavefront error measurement from the cemented doublet to the model to show that the 19nm RMS wavefront error needs to be improved by at least a factor of ten in order to reduce the systematic error to a level that will allow the LTP to approach its design limit of a few tens of nanoradians.
No abstract prepared.
No abstract prepared.
Scientists often predict physical outcomes, e.g., experimental results, with the assistance of computer codes that, at their best, only coarsely approximate reality. Coarse predictions are challenging in critical part due to the multitude of seemingly arbitrary yet consequential decisions that must be made such as choice of relevant data, calibration of code parameters, and construction of empirical discrepancy forms. In this paper, we present a case study in the context of inertial confinement fusion (ICF) implosion experiments where extrapolative predictions are needed with quantified uncertainties. The purpose of this case study is to reflect relevant statistical methods, as applied to ICF model fitting and prediction, to document the numerous decisions that must be made in the prediction pipeline, to extend a complex example in extrapolation to the uncertainty quantification (UQ) community, and to reflect on the challenges we encountered supporting extrapolations with imperfect models and thereby recommend several future research directions. We conclude with a discussion about the UQ community's role in less than ideal predictive scenarios like our ICF exercise.
OpenStudio®-MCP is a Model Context Protocol (MCP) server that lets AI assistants perform building energy modeling through natural language. Rather than requiring users to learn the OpenStudio® SDK, EnergyPlus® scripting, or Ruby/Python automation, the server translates conversational requests into sequences of tool calls that create models, design HVAC systems, run simulations, and extract results — all within a single chat session. The server's 124 tools are organized into a skills architecture where each skill encapsulates a domain of building energy modeling (envelope, HVAC, loads, weather, simulation, results) behind typed, LLM-friendly interfaces. High-leverage operations like applying ASHRAE 90.1 baseline systems or generating standards-compliant typical buildings are exposed as single tool calls that internally wire dozens of OpenStudio® objects. Bundled measures from ComStock™ and Openstudio® -common-measures-gem are wrapped with dedicated tools and typed arguments rather than exposed through a generic measure interface, so AI models get consistent, error-resistant recipes without needing to discover measure arguments at runtime. A key design decision is structured results extraction: six SQL-based tools return surgical ~300–1,000 token responses (end-use breakdowns, envelope summaries, HVAC sizing, timeseries data) instead of requiring the AI to parse ~100K-token raw HTML reports, making iterative design exploration practical within context window limits. The codebase is designed as a reference implementation — explicit, well-commented, and modular — so that other simulation engines (EnergyPlus® standalone, TRNSYS, DOE-2) can use it as a template for building their own MCP servers.
Genome-wide prediction of protein subcellular localization is an important type of evidence used for inferring protein function. While a variety of computational tools have been developed for this purpose, errors in the gene models and use of protein sorting signals that are not recognized by the more commonly accepted tools can diminish the accuracy of their output. As part of an effort to manually curate the annotations of 19 strains of Shewanella, numerous insights were gained regarding the use of computational tools and proteomics data to predict protein localization. Identification of the suite of secretion systems present in each strain at the start of the process made it possible to tailor-fit the subsequent localization prediction strategies to each strain for improved accuracy. Comparisons of the computational predictions among orthologous proteins revealed inconsistencies in the computational outputs, which could often be resolved by adjusting the gene models or ortholog group memberships. While proteomic data was useful for verifying start site predictions and post-translational proteolytic cleavage, care was needed to distinguish cellular versus sample processing-mediated cleavage events. Searches for lipoprotein signal peptides revealed that neither TatP nor LipoP are designed for identification of lipoprotein substrates of the twin arginine translocation system and that the +2 rule for lipoprotein sorting does not apply to this Genus. Analysis of the relationships between domain occurrence and protein localization prediction enabled identification of numerous location-informative domains which could then be used to refine or increase confidence in location predictions. This collective knowledge was used to develop a general strategy for predicting protein localization that could be adapted to other organisms.
The use of parameterized reduced order models(PROMs) within the stochastic reduced order model (SROM) framework is a logical progression for both methods. In this report, five different parameterized reduced order models are selected and critiqued against the other models along with truth model for the example of the Brake-Reuss beam. The models are: a Taylor series using finite difference, a proper orthogonal decomposition of the the output, a Craig-Bampton representation of the model, a method that uses Hyper-Dual numbers to determine the sensitivities, and a Meta-Model method that uses the Hyper-Dual results and constructs a polynomial curve to better represent the output data. The methods are compared against a parameter sweep and a distribution propagation where the first four statistical moments are used as a comparison. Each method produces very accurate results with the Craig-Bampton reduction having the least accurate results. The models are also compared based on time requirements for the evaluation of each model where the Meta- Model requires the least amount of time for computation by a significant amount. Each of the five models provided accurate results in a reasonable time frame. The determination of which model to use is dependent on the availability of the high-fidelity model and how many evaluations can be performed. Analysis of the output distribution is examined by using a large Monte-Carlo simulation along with a reduced simulation using Latin Hypercube and the stochastic reduced order model sampling technique. Both techniques produced accurate results. The stochastic reduced order modeling technique produced less error when compared to an exhaustive sampling for the majority of methods.
The purpose of Adaptive Mesh Refinement is to minimize spatial errors over the computational space not to minimize the number of computational elements. The additional result of the technique is that it may reduce the number of computational elements needed to retain a given level of spatial accuracy. Adaptive mesh refinement is a computational technique used to dynamically select, over a region of space, a set of computational elements designed to minimize spatial error in the computational model of a physical process. The fundamental idea is to increase the mesh resolution in regions where the physical variables are represented by a broad spectrum of modes in k-space, hence increasing the effective global spectral coverage of those physical variables. In addition, the selection of the spatially distributed elements is done dynamically by cyclically adjusting the mesh to follow the spectral evolution of the system. Over the years three types of AMR schemes have evolved; block, patch and locally refined AMR. In block and patch AMR logical blocks of various grid sizes are overlaid to span the physical space of interest, whereas in locally refined AMR no logical blocks are employed but locally nested mesh levels are used to span the physical space. The distinction between block and patch AMR is that in block AMR the original blocks refine and coarsen entirely in time, whereas in patch AMR the patches change location and zone size with time. The type of AMR described herein is a locally refi ned AMR. In the algorithm described, at any point in physical space only one zone exists at whatever level of mesh that is appropriate for that physical location. The dynamic creation of a locally refi ned computational mesh is made practical by a judicious selection of mesh rules. With these rules the mesh is evolved via a mesh potential designed to concentrate the nest mesh in regions where the physics is modally dense, and coarsen zones in regions where the physics is modally sparse.