Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Findings”

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 37 records · Page 2

Adaptive Stress Testing: Using Reinforcement Learning to Find Failures in Safety-Critical Systems

Emerging applications in artificial intelligence, such as driverless cars and autonomous aircraft promise to be more efficient, cheaper to operate, and always available. However, ensuring the safety of these systems remains a major challenge to their certification and adoption. These autonomous systems are expected to routinely make safety-critical decisions where failures can have serious consequences including loss of life and property. Testing and validation techniques aim to identify and diagnose potential failures before the system is deployed. However, finding failure scenarios in autonomous systems can be very challenging due to high-dimensional and continuous state spaces, interaction with large environments over many time steps, and the rarity of failures. This talk presents Adaptive Stress Testing (AST), a simulation-based testing framework for finding the most likely path to a failure event of a safety-critical system. The key idea of AST is that stress testing can be formulated as a Partially Observable Markov Decision Process (POMDP), which enables reinforcement learning techniques to be used for finding failure events. Reinforcement learning algorithms can efficiently explore the search space and have been shown to scale to very large systems. We present applications of AST to find failures in various safety-critical systems including the aircraft collision avoidance systems, autonomous cars, and small unmanned aerial vehicles.

autonomous vehicles↗

Finding the Pareto front for high-entropy-alloy catalysts

Finding catalysts that have both high activity and high stability presents a long-standing challenge. Since optimizing activity and stability are conflicting objectives, the best one can do is find the Pareto front that yields optimal tradeoffs between these features. On the Pareto front, there is a trade-off where a portion of catalytic activity must be sacrificed to gain further stability and vice versa . Here, we provide a method to optimize the front by designing a multi-objective genetic algorithm that combines machine learning, graph neural network calculations, and density functional calculations. The application considered is the oxygen evolution reaction catalyzed by high-entropy alloys. We find that the Pareto front generally contains alloys with diverse elements, but that enhancing stability inevitably inflicts a toll on activity. We compare the general conclusions of our work to a survey of 545 experiments.

Zhang, Chengyi [Univ. of Auckland (New Zealand)]↗

A Bayesian approach to strong lens finding in the era of wide-area surveys

ABSTRACT The arrival of the Vera C. Rubin Observatory’s Legacy Survey of Space and Time (LSST), Euclid-Wide and Roman wide-area sensitive surveys will herald a new era in strong lens science in which the number of strong lenses known is expected to rise from $\mathcal {O}(10^3)$ to $\mathcal {O}(10^5)$. However, current lens-finding methods still require time-consuming follow-up visual inspection by strong lens experts to remove false positives which is only set to increase with these surveys. In this work, we demonstrate a range of methods to produce calibrated probabilities to help determine the veracity of any given lens candidate. To do this we use the classifications from citizen science and multiple neural networks for galaxies selected from the Hyper Suprime-Cam survey. Our methodology is not restricted to particular classifier types and could be applied to any strong lens classifier which produces quantitative scores. Using these calibrated probabilities, we generate an ensemble classifier, combining citizen science, and neural network lens finders. We find such an ensemble can provide improved classification over the individual classifiers. We find a false-positive rate of 10−3 can be achieved with a completeness of 46 per cent, compared to 34 per cent for the best individual classifier. Given the large number of galaxy–galaxy strong lenses anticipated in LSST, such improvement would still produce significant numbers of false positives, in which case using calibrated probabilities will be essential for population analysis of large populations of lenses and to help prioritize candidates for follow-up.

79 ASTRONOMY AND ASTROPHYSICS↗

Testing the Jump Finding Code for NEXUS Qubit Analysis

We evaluate a new jump finding code to test the efficiency of this code in finding jumps of all sizes and understand how noise is mistaken for jumps and vice versa. We look at two parameters that impact the efficiency of the code. The two parameters, the jump threshold and smoothing, are then optimized to find the most efficient combination with the highest fraction of true positives and true negatives.

Wagner, Grace↗

Replication Package for "Union-Find and Usability: A Case Study and Analysis of Rust Formal Verifier

This replication package is a case study on automated deductive verification for Rust for practical programs. It is a companion artifact to a corresponding usability study on verification titled "Union-Find and Usability: A Case Study and Analysis of Rust Formal Verifiers". It seeks to answer the question "Can Rust developers today use Rust verifiers to verify their code?". To answer this question, the study contrasts the verification experience of two mature Rust verifiers, Creusot and Prusti, by using the tools to develop a verified implementation of union-find in Rust. The union-find implementation is based on real-world code as used in the popular egg E-graph library. The artifact consists of two different verified libraries, one using Creusot and one using Prusti. The libraries have similar Rust interfaces and high-level proofs but differ in their details: Creusot and Prusti have different annotation languages and support different proof styles. Each implementation can be verified with its respective tool and compiles as a traditional Rust development.

Sarracino, John↗

Direction-finding measurements of type III radio bursts out of the ecliptic plane

A series of two-dimensional direction-finding measurements for three type III solar radio bursts is presented which is based on spin-modulation measurements from two satellites (IMP 8 and Hawkeye I) whose spin axes were nearly perpendicular to each other. The two-dimensional direction-finding technique is combined with a model of the solar-wind plasma density in order to provide determinations of type III source locations out of the ecliptic plane as well as information on the three-dimensional structure of the solar magnetic field at radial distances of 0.2 to 1.0 AU from the sun. The direction-finding technique is described in detail, characteristics of the bursts observed by the two satellites are summarized, and the solar-wind model is outlined. The results show that the source locations follow an Archimedean spiral when projected onto the ecliptic plane but usually follow a constant heliocentric latitude perpendicular to that plane. It is also found that measured source sizes are a factor of two larger than the angular sizes of previously reported solar-flare electron emissions, that the spin-modulation factor tends to be largest near the beginning of a type III event, and that the arrival direction of the radiation varies systematically during an event.

Baumback, M. M.↗

Social survey findings on en route noise annoyance issues

Most surveys of residents' reactions to aircraft noise were conducted in the vicinity of airports. The findings in those surveys have supported planning and regulatory actions for the airport noise environment. Now, however, aircraft noise planning and regulations are being considered for a new environment, the en route environment. As policy makers search for bases for public policy in these new noise environments, it is appropriate to ask whether the same scientific evidence which supports airport noise policy can also support en route noise policy. Several aspects of that question are considered. An introduction establishes the scope of the present study and examines alternative study methodologies. Next, the selected study methodology is described and important assumptions are listed. The body of the paper then consists of the findings on en route issues. The final section presents findings on relevant research methods and considers priorities for further research.

Fields, James M.↗

The Lagrangian multiplier method of finding upper and lower limits to critical stresses of clamped plates

The theory of Lagrangian multipliers is applied to the problem of finding both upper and lower limits to the true compressive buckling stress of a clamped rectangular plate. The upper and lower limits thus bracket the true stress, which cannot be exactly found by the differential-equation approach. The procedure for obtaining the upper limit, which is believed to be new, presents certain advantages over the classical Rayleigh-Ritz method of finding upper limits. The theory of the lower-limit procedure has been given by Trefftz, but, in the present application, the method differs from that of Trefftz in a way that makes it inherently more quickly convergent. It is expected that in other buckling problems and in some vibration problems the Lagrangian multiplier method of finding upper and lower limits may be advantageously applied to the calculation of buckling stresses and natural frequencies.

Budiansky, Bernard↗

The Lagrangian Multiplier Method of Finding Upper and Lower Limits to Critical Stresses of Clamped Plates

The theory of Lagrangian multipliers is applied to the problem of finding both upper and lower limits to the true compressive buckling stress of a clamped rectangular plate. The upper and lower limits thus bracket the truss, which cannot be exactly found by the differential-equation approach. The procedure for obtaining the upper limit, which is believed to be new, presents certain advantages over the classical Raleigh-Rite method of finding upper limits. The theory of the lower-limit procedure has been given by Trefftz but, in the present application, the method differs from that of Trefftz in a way that makes it inherently more quickly convergent. It is expected that in other buckling problems and in some vibration problems problems the Lagrangian multiplier method finding upper and lower limits may be advantageously applied to the calculation of buckling stresses and natural frequencies.

Budiansky, Bernard↗

Finding Every Root of a Broad Class of Real, Continuous Functions in a Given Interval

One of the most pervasive needs within the Deep Space Network (DSN) Metric Prediction Generator (MPG) view period event generation is that of finding solutions to given occurrence conditions. While the general form of an equation expresses equivalence between its left-hand and right-hand expressions, the traditional treatment of the subject subtracts the two sides, leaving an expression of the form Integral of(x) = 0. Values of the independent variable x satisfying this condition are roots, or solutions. Generally speaking, there may be no solutions, a unique solution, multiple solutions, or a continuum of solutions to a given equation. In particular, all view period events are modeled as zero crossings of various metrics; for example, the time at which the elevation of a spacecraft reaches its maximum value, as viewed from a Deep Space Station (DSS), is found by locating that point at which the derivative of the elevation function becomes zero. Moreover, each event type may have several occurrences within a given time interval of interest. For example, a spacecraft in a low Moon orbit will experience several possible occultations per day, each of which must be located in time. The MPG is charged with finding all specified event occurrences that take place within a given time interval (or pass ), without any special clues from operators as to when they may occur, for the entire spectrum of missions undertaken by the DSN. For each event type, the event metric function is a known form that can be computed for any instant within the interval. A method has been created for a mathematical root finder to be capable of finding all roots of an arbitrary continuous function, within a given interval, to be subject to very lenient, parameterized assumptions. One assumption is that adjacent roots are separated at least by a given amount, xGuard. Any point whose function value is less than ef in magnitude is considered to be a root, and the function values at distances xGuard away from a root are larger than ef, unless there is another root located in this vicinity. A root is considered found if, during iteration, two root candidates differ by less than a pre-specified ex, and the optimum cubic polynomial matching the function at the end and at two interval points (that is within a relative error fraction L at its midpoint) is reliable in indicating whether the function has extrema within the interval. The robustness of this method depends solely on choosing these four parameters that control the search. The roots of discontinuous functions were also found, but at degraded performance.

Tausworthe, Robert C.↗

Planetary Science Technology Infusion Study: Findings and Recommendations Status

The Planetary Science Division (PSD) within the National Aeronautics and Space Administrations (NASA) Science Mission Directorate (SMD) at NASA Headquarters sought to understand how to better realize a scientific return on spacecraft system technology investments currently being funded. In order to achieve this objective, a team at NASA Glenn Research Center was tasked with surveying the science and mission communities to collect their insight on technology infusion and additionally sought inputs from industry, universities, and other organizations involved with proposing for future PSD missions. This survey was undertaken by issuing a Request for Information (RFI) activity that requested input from the proposing community on present technology infusion efforts. The Technology Infusion Study was initiated in March 2013 with the release of the RFI request. The evaluation team compiled and assessed this input in order to provide PSD with recommendations on how to effectively infuse new spacecraft systems technologies that it develops into future competed missions enabling increased scientific discoveries, lower mission cost, or both. This team is comprised of personnel from the Radioisotope Power Systems (RPS) Program and the In-Space Propulsion Technology (ISPT) Program staff.The RFI survey covered two aspects of technology infusion: 1) General Insight, including: their assessment of barriers to technology infusion as related to infusion approach; technology readiness; information and documentation products; communication; integration considerations; interaction with technology development areas; cost-capped mission areas; risk considerations; system level impacts and implementation; and mission pull. 2) Specific technologies from the most recent PSD Announcements of Opportunities (AOs): The Advanced Stirling Radioisotope Generator (ASRG), aerocapture and aeroshell hardware technologies, the NASA Evolutionary Xenon Thruster (NEXT) ion propulsion system, and the Advanced Materials Bi-propellant Rocket (AMBR) engine.This report will present the teams Findings from the RFI inputs and the recommendations that arose from these findings. Methodologies on the findings and recommendations development are discussed.

technology infusion↗

Direction Finding Using an Antenna with Direction Dependent Impulse Response

Wideband antennas may be designed to have an impulse response that is direction dependent, not only in amplitude but also in waveform shape. This property can be used to perform direction finding using a single fixed antenna, without the need for an array or antenna rotation. In this paper direction finding is demonstrated using a simple candelabra-shaped monopole operating in the 1-3 GHz range. The method requires a known transmitted pulse shape and high signal-to-noise ratio, and is not as accurate or robust as conventional methods. However, it can add direction finding capability to a wideband communication system without the addition of any hardware.

spacecraft/cubesat RF sensing and Communications↗

Testing the Jump Finding Code for NEXUS Qubit Analysis

At Fermilab, the NEXUS dilution refrigerator is repeating the same experiment from Wilen et al. 1 underground to further investigate the effect of ionizing radiation and cosmic ray muons on qubit decoherence. This refrigerator is 100m underground in the MINOS cavern to significantly lower the incident rate of cosmic ray muons, meaning the majority of incidents is due to ionizing radiation. To gain a better understanding of how the rate of ionizing radiation affects the qubits, we use 4 radiation configurations to collect data from the chip. In this work, we examine the efficiency of our jump detection code to find jumps of various sizes. We do so using simulated data with a known number of injected jumps of known sizes. These jumps are charge offsets of the qubit, thought to be due to quasiparticle poisoning. To test this, we run the jump finding code on an array of simulated data in which two main parameters, the smoothing factor and the threshold at which a charge offset is considered a jump, are changed to test an array of these parameters. We then perform a χ2 analysis to find the best combination of these two parameters.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

From natural language to control signals: a conceptual framework for semantic channel finding in complex experimental infrastructure

Modern experimental platforms such as particle accelerators, fusion devices, telescopes, and industrial process control systems expose tens to hundreds of thousands of control and diagnostic channels, accumulated over decades of hardware evolution. Operators and AI systems alike depend on informal expert knowledge, inconsistent naming conventions, and scattered documentation to locate the signals required for monitoring, troubleshooting, and automated control, creating a persistent bottleneck for reliability, scalability, and emerging language-model-driven interfaces. We formalize semantic channel finding, the task of mapping natural-language intent to concrete control-system signals, as a general problem in complex experimental infrastructure, and introduce a four-paradigm conceptual framework to guide architecture selection based on facility-specific data regimes. The paradigms span (i) direct in-context lookup over small, curated channel dictionaries, (ii) constrained hierarchical navigation through structured trees, (iii) interactive agent exploration using iterative reasoning and tool-based database queries, and (iv) ontology-grounded semantic search that decouples channel meaning from facility-specific naming conventions. We demonstrate the practical feasibility of each paradigm through proof-of-concept implementations at four operational facilities spanning two orders of magnitude in scale: from compact free-electron lasers to large synchrotron light sources, operating under diverse control-system architectures ranging from clean hierarchical naming schemes to legacy environments with decades of heterogeneous conventions. Where evaluated against expert-curated operational queries, these instantiations achieve 90%–97% accuracy, validating the framework’s applicability across real-world deployment scenarios. To accelerate adoption across the broader scientific and industrial control-system community, we release open-source, plug-and-play implementations of all three interactive paradigms-direct lookup, hierarchical navigation, and middle-layer exploration-within the Osprey framework, together with tools for channel database generation, interactive testing, and minimal-configuration deployment. This work establishes semantic channel finding as a foundational capability for human-centric and agentic AI interfaces at large-scale facilities, providing both a systematic framework for architecture design and practical resources to enable adoption without building custom infrastructure from scratch.

channel finding↗

Stochastic Optimization to Find Optimum Beginning-of-Life Core Configuration of Stable Salt Reactor with Online Refueling

A stochastic optimization method has been developed to find an optimum equilibrium cycle core configuration of the waste-burning stable salt reactor, which is a fast-spectrum molten salt reactor with frequent online refueling. An optimum core configuration was determined with the goal of minimizing radial power peaking. Because of the vast number of potential candidate core configurations, stochastic optimization was applied based on simulated annealing and an additional acceleration method, which screened out unpromising core configurations. It has been demonstrated that the developed stochastic optimization method successfully finds the optimal core configuration regardless of the initial guess and outperforms the gradient descent approach. In addition, it has been observed that the use of a so-called out-in core configuration as the initial guess speeds up convergence of the iterative solution more than five times. Based on the searched optimum equilibrium cycle core configuration, new beginning-of-life (BOL) core configurations have been developed. In conclusion, the new BOL core configurations will be used in developing optimum refueling strategies.

Moltex static salt reactor↗

A simple data-driven level finding method of many-electron atoms and heavy nuclei based on statistical outlier detection

Here, we report a simple and pure data-driven method to find new energy levels of quantum many-body systems only from observed line wavelengths. In our method, all the possible combinations are computed from known energy levels and wavelengths of unidentified lines. As each excited state exhibits many transition lines to different lower levels, the true levels should be reconstructed coincidentally from many level-line combinations, while the wrong combinations distribute randomly. Such a coincidence can be easily detected statistically. We demonstrate this statistical method by finding new levels for various atomic and nuclear systems from unidentified line lists available online.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PDBspheres: a method for finding 3D similarities in local regions in proteins

Abstract We present a structure-based method for finding and evaluating structural similarities in protein regions relevant to ligand binding. PDBspheres comprises an exhaustive library of protein structure regions (‘spheres’) adjacent to complexed ligands derived from the Protein Data Bank (PDB), along with methods to find and evaluate structural matches between a protein of interest and spheres in the library. PDBspheres uses the LGA (Local–Global Alignment) structure alignment algorithm as the main engine for detecting structural similarities between the protein of interest and template spheres from the library, which currently contains >2 million spheres. To assess confidence in structural matches, an all-atom-based similarity metric takes side chain placement into account. Here, we describe the PDBspheres method, demonstrate its ability to detect and characterize binding sites in protein structures, show how PDBspheres—a strictly structure-based method—performs on a curated dataset of 2528 ligand-bound and ligand-free crystal structures, and use PDBspheres to cluster pockets and assess structural similarities among protein binding sites of 4876 structures in the ‘refined set’ of the PDBbind 2019 dataset.

59 BASIC BIOLOGICAL SCIENCES↗

Finding Your Niche: An Evolutionary Approach to HPC Topologies

Traditional interconnection network design approaches focus on building general network topologies by optimizing the bisection bandwidth or minimizing the network’s diameter to reduce the maximum distance between any two nodes, thus amortizing the overall execution time of the HPC workloads. While such network topologies may accommodate a wide variety of applications in general, this may result in sub-optimal performance for many frequently-executed or dynamic workloads. In this paper, instead of focusing on designing an all-encompassing, general-purpose network topology, we develop a methodology to design customized network interconnects, evolved by “finding” the optimal topologies for a particular target workload given by its communication and contention profiles. To this end, we implement a Genetic Algorithm (GA)-based approach for network topology design tailored to improve the overall execution time of a particular workload of interest. We conducted extensive experiments with well-known motifs in physics-based workloads (Sweep3D and FFT), as well as with a representative graph application (MiniVite), using the well-known Structural Simulation Toolkit (SST) Macroscale Element Library (SST/macro) simulator for network interconnect evaluation. We demonstrate that our genetic algorithm-based approach is robust enough to find the underlying optimal topology of a particular workload.

network interconnects, graph search, meta-heuristi↗