Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “feasibility”

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 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A method for convex black-box integer global optimization

Here we study the problem of minimizing a convex function on a nonempty, finite subset of the integer lattice when the function cannot be evaluated at noninteger points. We propose a new underestimator that does not require access to (sub)gradients of the objective; such information is unavailable when the objective is a blackbox function. Rather, our underestimator uses secant linear functions that interpolate the objective function at previously evaluated points. These linear mappings are shown to underestimate the objective in disconnected portions of the domain. Therefore, the union of these conditional cuts provides a nonconvex underestimator of the objective. We propose an algorithm that alternates between updating the underestimator and evaluating the objective function. We prove that the algorithm converges to a global minimum of the objective function on the feasible set. We present two approaches for representing the underestimator and compare their computational effectiveness. We also compare implementations of our algorithm with existing methods for minimizing functions on a subset of the integer lattice. We discuss the difficulty of this problem class and provide insights into why a computational proof of optimality is challenging even for moderate problem sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Reducing the Susceptibility of Lumped-Element KIDs to Two-Level System Effects

Arrays of lumped-element kinetic inductance detectors (LEKIDs) optically coupled through an antenna-coupled transmission line are a promising candidate for future cosmic microwave background experiments. However, the dielectric materials used for the microstrip architecture are known to degrade the performance of superconducting resonators. In this paper, we investigate the feasibility of microstrip coupling to a LEKID, focusing on a systematic study of the effect of depositing amorphous silicon nitride on a LEKID. The discrete and spatially separated inductive and capacitive regions of the LEKID allow us to vary the degree of dielectric coverage and determine the limitations of the microstrip coupling architecture. We show that by careful removal of dielectric from regions of high electric field in the capacitor, there is minimal degradation in dielectric loss tangent of a partially covered lumped-element resonator. We present the effects on the resonant frequency and noise power spectral density and, using the dark responsivity, provide an estimate for the resulting detector sensitivity.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Imprinting a Three-Dimensional Skyrmion in a Bose–Einstein Condensate Via a Raman Process

We describe an experimental protocol for the creation of a three-dimensional topological defect, a skyrmion, in a pseudo-spin-1/2 Bose–Einstein condensate (BEC) confined in a spin-independent harmonic trap. We show that one can imprint the skyrmion on the BEC within a few tens of microseconds using a Raman process with the structured laser fields. We numerically solved the mean-field Gross– Pitaevskii equation to examine our imprinting scheme and found that all parameters we use are experimentally feasible.

3D Skyrmion↗
DOE OSTI2022

Absolute Energy Measurements with Superconducting Transition-Edge Sensors for Muonic X-ray Spectroscopy at 44 keV

Superconducting transition-edge sensor (TES) microcalorimeters have great utility in X-ray applications owing to their high energy resolution, good collecting efficiency and the feasibility of being multiplexed into large arrays. In this work, we develop hard X-ray TESs to measure the absolute energies of muonic-argon (R-Ar) transition lines around 44 keV and 20 keV. TESs with sidecar absorbers of different heat capacities were fabricated and characterized for their energy resolution and calibration uncertainty. Here, we achieved similar to 1 eV absolute energy measurement accuracy at 44 keV, and < 12 eV energy resolution at 17.5 keV.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

An Efficient Numerical Algorithm for Solving Data Driven Feedback Control Problems

The goal of this paper is to solve a class of stochastic optimal control problems numerically, in which the state process is governed by an Itô type stochastic differential equation with control process entering both in the drift and the diffusion, and is observed partially. The optimal control of feedback form is determined based on the available observational data. In this work, we call this type of control problems the data driven feedback control. The computational framework that we introduce to solve such type of problems aims to find the best estimate for the optimal control as a conditional expectation given the observational information. To make our method feasible in providing timely feedback to the controlled system from data, we develop an efficient stochastic optimization algorithm to implement our computational framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Using Filter Methods to Guide Convergence for ADMM, with Applications to Nonnegative Matrix Factorization Problems

Nonconvex, nonlinear optimization problems arise naturally in parameter fitting and machine learning. While augmented Lagrangian methods have demonstrated robust convergence for classes of these problems, their convergence for block updates has been relatively unexplored outside of the context of the alternating direction method of multipliers (ADMM). ADMM has seen extensive use in these applications, but may exhibit uncertain convergence behavior in many practical nonconvex settings, and struggles with general nonlinear constraints. In contrast, filter methods have proved effective in enforcing convergence for sequential quadratic programming methods and interior point methods with feasibility criteria. We develop an ADMM-filter method for highly nonlinear and nonconvex problems. Here, we show convergence under mild assumptions for several types of coordinate descent schemes, and demonstrate our algorithm on nonnegative matrix factorization and completion problems in imaging and chemical spectrum analysis.

Nonconvex optimization↗
DOE OSTI2020

Side-reaction products identified for photo-nuclear production of 99 Mo

Production of 99 Mo by the 100 Mo (γ, n) 99 Mo reaction through the bremsstrahlung process using an electron accelerator is one of the feasible options currently pursued by several countries. In this work, we report experimental results on identification of side-reaction products after the irradiation of natural and enriched 100 Mo targets. Side-reaction products identified include various Mo, Nb and Zr isotopes. Comparison of experimentally determined reaction production rates with those determined based on theoretical cross-sections will be presented. Moreover, activation products formed due to presence of impurities introduced during the manufacturing of the Mo targets will also be discussed.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2020

Transactinide studies with sulfur macrocyclic extractant using mercury

Mercury extraction has been studied in nitric and hydrochloric acids with hexathia-18-crown-6 dissolved in carbon tetrachloride. Batch study experiments have been performed to determine the best conditions for maximum extraction. In both acids, Hg(II) was best extracted at low molarity while almost no extraction was observed above 2 M. Furthermore, speciation studies were carried out in an attempt to describe the extraction mechanism, but the exact composition of the extracted species was not determined. The extraction kinetics were studied to assess the feasibility of this crown ether for extracting Cn and/or Fl in a future online experiment.

197mHg↗
DOE OSTI2022

Analysis of Glycolate in Radioactive Waste by Ion Chromatography (IC) and Proton Nuclear Magnetic Resonance (H NMR)

Here, in preparation for implementing the Nitric-Glycolic (NG) acid flowsheet for the Savannah River Site (SRS) Liquid Waste System (LWS), analytical methods for determining glycolate at low concentration, below 20 mg/L in radioactive samples, were developed to support system management and safety. To accommodate the wide range of LWS matrix conditions, two alternative methods were developed, refined, and demonstrated for glycolate analysis in radioactive waste samples: ion chromatography (IC) and a proton nuclear magnetic resonance (H NMR). Investigators validated IC and H NMR methods for glycolate analysis, defined the range of applicability, and demonstrated key supporting analytical protocols. The deployed IC method is applicable in low to moderate ionic strength samples and requires sample pretreatment using a Dionex OnGuard II H + cartridge. The deployed H NMR method is more labor intensive but provides options for a broader range of matrices. Based on the results, high quality glycolate analysis of the Defense Waste Processing Facility (DWPF) condensate in Tank 22 is feasible by IC down to approximately 12 mg/L. Using H NMR, glycolate may be determined to 8 mg/L or lower depending on the run time with the potential for broader applicability of the method to higher ionic strength conditions in other tanks of the SRS LWS.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2025

Field deployable trace radioisotope analysis through combined electrochemical and alpha spectroscopy methods

A method for depositing actinides directly onto a 4H-SiC Schottky barrier diode (SBD) detector as a field deployable actinides sensor was developed to enable off-site analysis, shortening the time to obtain critical information such as elements, concentration, and/or isotopic ratio related to the radiological situation. A thin film of Hg was first electrodeposited onto the Pt contact of the SiC diode, followed by chronoamperometric deposition of microgram levels of actinides under conventional control conditions. The 4H-SiC diode maintained consistent functionality through the electrodeposition process and showed resolved alpha-energy spectra that contained accurate isotopic information demonstrating the feasibility of a combined chemical and radiological sensor for field actinide detection and quantification.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2025

Cation exchange separation of radium and actinium using lactic acid DTPA buffer

The separation of actinium ( 228 Ac) from radium ( 223,228 Ra) on cation exchange resin with a diethylenetriaminpentaacetic acid-lactate buffer solution is demonstrated with series of columns. High yield, high radiopurity (~ 100%) separations of Ac from Ra are feasible with small columns in biologically compatible conditions and pHs. As Ac is eluted before Ra on these columns, further studies were performed to determine if this separation system could be applied to Ra/Ac isotope generators, but these were not successful. In conclusion, the separations presented in this work may be relevant for radiopharmaceutical purifications of 225 Ac which is typically obtained from its 225 Ra parent isotope.

and nuclear chemistry↗
DOE OSTI2025

Uncertainty improvement of 22 Na based radioactive tracer dilution for determining total mass of pyroprocessing molten salt systems by 154 Eu removal

To determine the total salt mass of the molten salt systems for pyroprocessing spent nuclear fuels, a 22 Na based radioactive tracer dilution was studied in Idaho National Laboratory in recent years. This 22 Na based RTD technique was deemed feasible, but due to the gamma energy peak of 22 Na coinciding with one of the energy peaks of 154 Eu radioisotope in the molten salt, the uncertainty of the 22 Na radioactivity in the 22 Na-spiked salt samples was quite high. To improve the uncertainty of the 22 Na based RTD technique, we proposed to chemically remove the 154 Eu of the salt samples by DGA resin for gamma spectroscopy. The effectiveness of removing 154 Eu on uncertainty improvement was evaluated. Furthermore, it was found that (1) the 154 Eu fission product effect on the uncertainty and detection limit can be effectively eliminated by chemically removing the 154 Eu during the salt sample preparation and (2) the uncertainty of 22 Na radioactivity in the salt samples for electrorefining was significantly improved from 13% to 2%, showing the potential of practical engineering application of 22 Na based RTD as a safeguards technique for molten salt systems for pyroprocessing spent nuclear fuels.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2026

A Coincident CdTe Detector Array for Enhanced Nuclear Process Monitoring

Nuclear fuel cycle aqueous separation processes desire improved real-time material characterization and process monitoring techniques; gamma coincidence spectroscopy has the potential to meet this need in these high throughput and high radiation environments based on its ability to reduce background noise, thereby enhancing detection limits and improving isotopic identification accuracy. A detector array composed of three CdTe detectors was designed to surround a chemical processing pipe in a reprocessing facility and evaluate the feasibility of passively assaying the nuclear materials flowing though this measurement point. This array uses commercial off the shelf components that are radiation hard and highly efficiency at low energies relevant to actinide photon signatures. Detector efficiency characterizations, coincidence detection, and potential configuration improvements are presented here.

Good, Erin C.↗
DOE OSTI2020

Detecting anomalous packets in network transfers: investigations using PCA, autoencoder and isolation forest in TCP

Large-scale scientific workflows rely heavily on high-performance file transfers. These transfers require strict quality parameters such as guaranteed bandwidth, no packet loss or data duplication. To have successful file transfers, methods such as predetermined thresholds and statistical analysis need to be done to determine abnormal patterns. Network administrators routinely monitor and analyze network data for diagnosing and alleviating these, making decisions based on their experience. However, as networks grow and become complex, monitoring large data files and quickly processing them, makes it improbable to identify errors and rectify these. Abnormal file transfers have been classified by simply setting alert thresholds, via tools such as PerfSonar and TCP statistics (Tstat). This paper investigates the feasibility of unsupervised feature extraction methods for identifying network anomaly patterns with three unsupervised classification methods—principal component analysis, autoencoder and isolation forest. Here, we collect file transfer statistics from two experiment sets—synthetic iPerf generated traffic and 1000 Genome workflow runs, with synthetically introduced anomalies. Our results show that while PCA and a simple autoencoder finds it difficult to detect clusters, the tree-variant isolation forest is able to identify anomalous packets by breaking down TCP traces into tree classes early.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Robust vehicle routing under uncertainty via branch-price-and-cut

Here, this paper contemplates how branch-price-and-cut solvers can be employed along with the robust optimization paradigm to address parametric uncertainty in the context of vehicle routing problems. In this setting, given postulated uncertainty sets for customer demands and vehicle travel times, one aims to identify a set of cost-effective routes for vehicles to traverse, such that the vehicle capacities and customer time window constraints are respected under any anticipated demand and travel time realization, respectively. To tackle such problems, we propose a novel approach that combines cutting-plane techniques with an advanced branch-price-and-cut algorithm. Specifically, we use deterministic pricing procedures to generate "partially robust" vehicle routes and then utilize robust versions of rounded capacity inequalities and infeasible path elimination constraints to guarantee complete robust feasibility of routing designs against demand and travel time uncertainty. In contrast to recent approaches that modify the pricing algorithm, our approach is both modular and versatile. It permits the use of advanced branch-price-and-cut technologies without significant modification, while it can admit a variety of uncertainty sets that are commonly used in robust optimization but could not be previously employed in a branch-price-and-cut setting.

42 ENGINEERING↗
DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Computationally Efficient Multiscale Neural Networks Applied to Fluid Flow in Complex 3D Porous Media

Abstract The permeability of complex porous materials is of interest to many engineering disciplines. This quantity can be obtained via direct flow simulation, which provides the most accurate results, but is very computationally expensive. In particular, the simulation convergence time scales poorly as the simulation domains become less porous or more heterogeneous. Semi-analytical models that rely on averaged structural properties (i.e., porosity and tortuosity) have been proposed, but these features only partly summarize the domain, resulting in limited applicability. On the other hand, data-driven machine learning approaches have shown great promise for building more general models by virtue of accounting for the spatial arrangement of the domains’ solid boundaries. However, prior approaches building on the convolutional neural network (ConvNet) literature concerning 2D image recognition problems do not scale well to the large 3D domains required to obtain a representative elementary volume (REV). As such, most prior work focused on homogeneous samples, where a small REV entails that the global nature of fluid flow could be mostly neglected, and accordingly, the memory bottleneck of addressing 3D domains with ConvNets was side-stepped. Therefore, important geometries such as fractures and vuggy domains could not be modeled properly. In this work, we address this limitation with a general multiscale deep learning model that is able to learn from porous media simulation data. By using a coupled set of neural networks that view the domain on different scales, we enable the evaluation of large ( $$>512^3$$ > 512 3 ) images in approximately one second on a single graphics processing unit. This model architecture opens up the possibility of modeling domain sizes that would not be feasible using traditional direct simulation tools on a desktop computer. We validate our method with a laminar fluid flow case using vuggy samples and fractures. As a result of viewing the entire domain at once, our model is able to perform accurate prediction on domains exhibiting a large degree of heterogeneity. We expect the methodology to be applicable to many other transport problems where complex geometries play a central role.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Formal verification and validation of run-to-completion style state charts using Event-B

State chart notations with ‘run to completion’ semantics are popular with engineers for designing controllers that react to environment events with a sequence of state transitions but lack formal refinement and rigorous verification methods. State chart models are typically used to design complex control systems that respond to environmental triggers with a sequential process. The model is usually constructed at a concrete level and verified and validated using animation techniques relying on human judgement. Event-B, on the other hand, is based on refinement from an initial abstraction and is designed to make formal verification by automatic theorem provers feasible. Abstraction and formal verification provide greater assurance that critical (e.g. safety or security) properties are not violated by the control system. In this paper, we introduce a notion of refinement into a ‘run to completion’ state chart modelling notation and leverage Event-B’s tool support for theorem proving. We describe the difficulties in translating ‘run to completion’ semantics into Event-B refinements and suggest a solution. We illustrate our approach and show how models can be validated at different refinement levels using our scenario checker animation tools. We show how critical invariant properties can be verified by proof despite the reactive nature of the system and how behavioural aspects of the system can be verified by testing the expected reactions using a temporal logic, model checking approach. To verify liveness, we outline a proof that the run to completion is deadlock-free and converges to complete the run.

97 MATHEMATICS AND COMPUTING↗