Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalization”

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 217 records · Page 12

Generalized parton distributions from lattice QCD with asymmetric momentum transfer: Unpolarized quarks at nonzero skewness

We extend the formalism of asymmetric frames of reference for generalized parton distributions (GPDs) to the case of nonzero skewness, i.e., including longitudinal momentum transfer. The framework, based on Lorentz-invariant amplitudes and previously developed and numerically implemented for unpolarized, helicity and transversity GPDs at zero skewness, gives efficient access to a broad range of kinematics, making full mapping of GPDs from the lattice realistic. The general-skewness formalism is tested using lattice data with both transverse and longitudinal or only longitudinal momentum transfer, the latter being a special case with a reduced number of independent amplitudes. We extract the amplitudes in coordinate space and express the GPDs 𝐻 and 𝐸 in terms of these amplitudes. This is followed by reconstruction of quasidistributions and their matching to the light cone. We further identify and discuss the principal challenges for nonzero skewness GPDs.

Lattice QCD↗

Generalized definition of the isothermal compressibility in (2+1)-flavor QCD

We introduce a generalized definition of the isothermal compressibility ($𝜅_{𝑇,𝜎{^2_𝑄}}$) calculable by keeping net conserved charge fluctuations rather than total number densities constant. We present lattice QCD results for this isothermal compressibility, expressed in terms of fluctuations of conserved charges that are related to baryon (𝐵), electric charge (𝑄), and strangeness (𝑆) quantum numbers. This generalized isothermal compressibility is compared with hadron resonance gas model calculations as well as with heavy-ion collision data obtained at RHIC and the LHC. We find $𝜅_{𝑇,𝜎{^2_𝑄}}$ = 13.8⁢(1.3) fm 3 /GeV at $𝑇_{\textrm{pc},0}$ =156.5⁢(1.5) MeV and $\hat{𝜇}_𝐵$ = 0. This finding is consistent with the rescaled result of the ALICE Collaboration, where we replaced the number of charged hadrons (𝑁 ch ) by the total number of hadrons (𝑁 tot ) at freeze-out. Normalizing this result with the QCD pressure (𝑃) we find that the isothermal compressibility on the pseudocritical line stays close to that of an ideal gas, i.e., $𝑃⁢𝜅_{𝑇,𝜎{^2_𝑄}} ≃$ 1.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Tula: Optimizing Time, Cost, and Generalization in Distributed Large-Batch Training

Distributed training increases the number of batches processed per iteration either by scaling-out (adding more nodes) or scaling-up (increasing the batch-size). However, the largest configuration does not necessarily yield the best performance. Horizontal scaling introduces additional communication overhead, while vertical scaling is constrained by computation cost and device memory limits. Thus, simply increasing the batch-size leads to diminishing returns: training time and cost decrease initially but eventually plateaus, creating a knee-point in the time/cost vs. batch-size pareto curve. The optimal batch-size therefore depends on the underlying model, data and available compute resources. Large batches also suffer from worse model quality due to the well-known “generalization gap”. In this paper, we present Tula, an online service that automatically optimizes time, cost, and convergence quality for large-batch training of convolutional models. It combines parallel-systems modeling with statistical performance prediction to identify the optimal batchsize. Tula predicts training time and cost within 7.5−14% error across multiple models, and achieves up to 20× overall speedup and improves test accuracy by ≈9% on average over standard large-batch training on various vision tasks, thus successfully mitigating the generalization gap and accelerating training at the same time.

Tyagi, Sahil [ORNL] (ORCID:0009000783144745)↗

Ground Vehicle Generalized Forces and Moment Governor Design Via Noncertainty-Equivalent Adaptive Prescribed Performance Control

Torque-vectoring technology demonstrates great potential in improving the safety and performance of ground vehicles. In this paper, a novel generalized forces and moment governor for torque vectoring is suggested. The proposed solution strategically combines prescribed performance control, noncertainty equivalent adaptive control design, and a smooth projection operator. The main advantage of the proposed control strategy lies in its capability to guarantee both the transient performance and prompt recovery of the desired deterministic behavior of the closed-loop adaptive system, even in the presence of parametric uncertainties. ASM simulation results are presented to validate the efficacy of the proposed generalized forces and moment governor and to demonstrate its superiority over a baseline solution.

Zhou, Xingyu↗

Linear Solvers for Collector Systems of Generalized Large-scale Inverter-Based Resources

Collector systems for inverter-based resources (IBRs) are typically represented by equivalent circuits for electromagnetic transient (EMT) simulations. Recent studies have revealed that modeling a detailed collector system is essential to accurately represent the behavior of IBRs, especially when dealing with partial tripping during external disturbances. However, there are several challenges in simulating a detailed EMT model of a collector system due to the time required to simulate such systems. Thus, this paper investigates the modeling of a detailed collector system, taking into account its configuration and components as defined in IEEE standard 2800. The configurations include the collector systems of generalized large-scale IBR plants. The components include the main IBR transformer, collector bus, and feeders with lines and/or cables. The EMT model of the collector system is represented by differential algebraic equations (DAEs) that are discretized to form linear equations that are solved using linear solvers. In this paper, linear solvers are proposed based on the Schur complement method, which are utilized for simulation of the EMT model of collector systems of generalized large-scale IBRs to accelerate simulation speed while maintaining the accuracy of the results. The proposed solvers are verified by comparing the performance to that of linear solvers provided in MATLAB.

Choi, Jongchan↗

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗

Generalized Theory and Realization of Continuously Loss-Programmable Bandpass Filtering Attenuators

With the increased demand for modern wireless systems in various applications, the need for adjustable radio frequency (RF) systems has dramatically increased. These modern systems rely on operating in the microwave frequency spectrum (1 GHz to 1 THz) without interference from other devices while also retaining the ability to detect very low and very high power signals simultaneously. There is also an ever-increasing demand for reducing the cost, size, weight, and power (C-SWaP) of these modern RF systems, driving the demand for more agile filters in the microwave frequency spectrum. In this paper, a generalized theory of bandpass filtering attenuators (filtenuators) is proposed. A filtenuator is a device that combines the frequency- selective characteristics of a filter and the loss-programmable characteristics of an attenuator into a single component. The loss- programmable aspect of the filtenuator is based on the tuning of a π-network of resistances, which are implemented using PIN diodes to control the individual resistance values electronically. A loss-programmable, third-order Chebyshev bandpass filtenuator is designed, fabricated, and measured to verify the generalized theory. The filtenuator is designed to operate at 1 GHz and have a tunable attenuation range of 2-10 dB. This proposed filtenuator demonstrates the feasibility of a tunable, low C-SWaP solution to increase RF system dynamic range and a design process that allows for future development of filtenuators.

42 ENGINEERING↗

Generalized Theory and Realization of Reconfigurable Bandpass Filtering Equalizers

Here, in this article, a generalized theory of bandpass filtering equalizers is proposed. A filtering equalizer is a device that combines the frequency-selective properties of a filter with the controllable slope of an equalizer into a single component. The equations used to design the function for a desired slope are provided, and the design methodology to determine the necessary filtering polynomials is also shown. The controllable slope of the dual-function component is realized using variable capacitors, which are used to tune both a transmission zero and a matching network to achieve the desired slope. A third-order bandpass filtering equalizer is designed, fabricated, and measured to verify the generalized theory. The component is designed to operate at 1 GHz with a slope that can be reconfigured from 1 to 3 dB along the passband. This proposed filtering equalizer demonstrates the feasibility of a tunable, low-cost, size, weight, and power (C-SWaP) solution to enable increased flatness in the overall system response and thereby decrease the error vector magnitude (EVM) of future radio frequency (RF) systems and a design process that allows for future development of filtering equalizers.

Filter↗

General Correlations for Laminar Flow Friction Loss and Heat Transfer in Plain Rectangular Plate-Fin Cores

In this paper, new generalized correlations for predicting the average fanning friction factor f and average Nusselt number Nu for laminar flow in plain plate-fin compact cores of rectangular cross section are presented. These are based on extended experimental data, as well as three-dimensional computational simulations, obtained for a broad range of fin density and geometrical attributes. The results indicate that while the fully developed forced convection scales only with the interfin channel cross-sectional ratio α (fin spacing by fin height), the entrance region hydrodynamic and thermal performance is additionally a function of the fin-core length L, flow Reynolds number Re, and fluid Prandtl number Pr. The developing flow and convection is further shown to scale as: (fRe)~(L/d h Re) 1/2 , and Nu ~(L/d h Re) 1/2 Pr 1/3 Φ(α), where f, Re, and Nu are all based on the hydraulic diameter dh of the interfin flow channel. Generalized correlations for both (fRe) and Nu are developed by the corresponding scaling of the forced convection behavior and asymptotic matching of the entrance or developing flow (short fin-core flow length) and the fully developed flow (large fin-core flow length) region performance. Finally, the predictions from these correlations are found to be within ±15% of all available experimental data for air, water, and glycol (0.71 ≤ Pr ≤ 10), and fin cores with 0 < α ≤ 1.

36 MATERIALS SCIENCE↗

An Approach to Realize Generalized Optimal Motion Primitives Using Physics Informed Neural Networks

Autonomous manipulation is a challenging problem in field robotics due to uncertainty in object properties, constraints, and coupling phenomenon with robot control systems. Humans learn motion primitives over time to effectively interact with the environment. We postulate that autonomous manipulation can be enabled by basic sets of motion primitives as well, but do not necessitate mimicking human motion primitives. Here, this work presents an approach to generalized optimal motion primitives using physics-informed neural networks. Our simulated and experimental results demonstrate that optimality is notionally maintained where the mean maximum observed final position percent error was 0.564% and the average mean error for all the trajectories was 1.53%. These results indicate that notional generalization is attained using a physics-informed neural network approach that enables near optimal real-time adaptation of primitive motion profiles.

97 MATHEMATICS AND COMPUTING↗

Spent Nuclear Fuel Mechanical Loads in the General Package Drop Scenario

The US Department of Energy Spent Fuel and Waste Science and Technology program is performing research to determine the mechanical loading conditions applied to spent nuclear fuel (SNF) during normal conditions of transportation to inform mechanical tests of SNF and close an important knowledge gap related to the practical disposition of SNF in the US. A recent multi-national collaborative test campaign measured SNF assembly impact response to the 30 cm horizontal package drop scenario, which is a common regulatory basis test of SNF package design. Researchers at Pacific Northwest National Laboratory (PNNL) are using the test data to validate explicit finite element models to calculate the mechanical loads and structural response of spent nuclear fuel assemblies in the as-tested 30 cm horizontal package drop scenario. Once the as-tested package drop model is validated, the next step is to apply the model to the general 30 cm drop scenario, which includes all impact angles, all fuel assembly types, and all burnup conditions. PNNL is developing a damage model that will incorporate the results of finite element parametric studies to establish trends in SNF mechanical loading to various input parameters, like impact orientation and burnup. The damage model will have the capability to estimate mechanical loads for any single set of input parameters, but it will first be used to describe the upper bounds of potential SNF loading in the 30 cm drop scenario. This paper describes PNNL’s progress toward developing the general solution to the problem of spent nuclear fuel mechanical loads in the 30 cm package drop scenario and it describes the next steps in closing the knowledge gap.

Klymyshyn, Nicholas A.↗

Generalizing multiple memories from a single drive: The hysteron latch

Far-from-equilibrium systems can form memories of previous deformations or driving. In systems from sheared glassy materials to buckling beams to crumpled sheets, this behavior is dominated by return-point memory, in which revisiting a past extremum of driving restores the system to a previous state. Cyclic driving with both positive and negative strains forms multiple nested memories, as in a single-dial combination lock, while asymmetric driving (only positive strain) cannot. We study this case in a general model of hysteresis that considers discrete elements called hysterons. We show how two hysterons with a frustrated interaction can violate return-point memory, realizing multiple memories of asymmetric driving. This reveals a general principle for designing systems that store sequences of cyclic driving, whether symmetric or asymmetric. In disordered systems, asymmetric driving is a sensitive tool for the direct measurement of frustration.

Science & Technology - Other Topics↗

A general framework for gravitational charges and holographic renormalization

We develop a general framework for constructing charges associated with diffeomorphisms in gravitational theories using covariant phase space techniques. This framework encompasses both localized charges associated with space–time subregions, as well as global conserved charges of the full space–time. Expressions for the charges include contributions from the boundary and corner terms in the subregion action, and are rendered unambiguous by appealing to the variational principle for the subregion, which selects a preferred form of the symplectic flux through the boundaries. The Poisson brackets of the charges on the subregion phase space are shown to reproduce the bracket of Barnich and Troessaert for open subsystems, thereby giving a novel derivation of this bracket from first principles. In the context of asymptotic boundaries, we show that the procedure of holographic renormalization can be always applied to obtain finite charges and fluxes once suitable counterterms have been found to ensure a finite action. This enables the study of larger asymptotic symmetry groups by loosening the boundary conditions imposed at infinity. We further present an algorithm for explicitly computing the counterterms that renormalize the action and symplectic potential, and, as an application of our framework, demonstrate that it reproduces known expressions for the charges of the generalized Bondi–Metzner–Sachs algebra.

Physics↗

Deadlock prediction via generalized dependency

Deadlocks are notorious bugs in multithreaded programs, causing serious reliability issues. However, they are difficult to be fully expunged before deployment, as their appearances typically depend on specific inputs and thread schedules, which require the assistance of dynamic tools. However, existing deadlock detection tools mainly focus on locks, but cannot detect deadlocks related to condition variables. This paper presents a novel approach to fill this gap. It extends the classic lock dependency to generalized dependency by abstracting the signal for the condition variable as a special resource so that communication deadlocks can be modeled as hold-and-wait cycles as well. It further designs multiple practical mechanisms to record and analyze generalized dependencies. In the end, this paper presents the implementation of the tool, called UnHang. Experimental results on real applications show that UnHang is able to find all known deadlocks and uncover two new deadlocks. Overall, UnHang only imposes around 3% performance overhead and 8% memory overhead, making it a practical tool for the deployment environment.

Zhou, Jinpeng↗

Generalized Lapse Rate Formulas for Use in Entraining CAPE Calculations

Abstract Common assumptions in temperature lapse rate formulas for lifted air parcels include neglecting mixing, hydrostatic balance, the removal of all condensate once it forms (pseudoadiabatic), and/or the retention of all condensate within the parcel (adiabatic). These formulas are commonly derived from the conservation of entropy, which leads to errors when nonequilibrium mixed-phase condensate is present. To evaluate these assumptions, a new general lapse rate formula is derived from an expression for energy conservation, rather than entropy conservation. This new formula incorporates mixing of the parcel with its surroundings, relaxes the hydrostatic assumption, allows for nonequilibrium mixed-phase condensate, and can be formulated for pseudoadiabatic or adiabatic ascent. The new formula is shown to exactly conserve entropy for reversible ascent. Predictions by the new formula are compared to that of older and less general formulas. The errors in previous formulas arise from the assumption of hydrostatic balance, which results in considerable warm biases due to the neglect of the energy sink from buoyancy. Predictions of ascent with entrainment using the new formula are then compared to parcel properties along trajectories in large eddy simulations. Simulated parcel properties are better predicted by the formula using a diluted analogy to adiabatic ascent, wherein condensate is diluted at the same rate as other parcel properties, than by the diluted analogy to pseudoadiabatic ascent, wherein all condensate is removed. These results suggest that CAPE should be computed with adiabatic, rather than pseudoadiabatic, parcel ascent.

54 ENVIRONMENTAL SCIENCES↗

Evaluating uncertainty-based active learning for accelerating the generalization of molecular property prediction

Deep learning models have proven to be a powerful tool for the prediction of molecular properties for applications including drug design and the development of energy storage materials. However, in order to learn accurate and robust structure–property mappings, these models require large amounts of data which can be a challenge to collect given the time and resource-intensive nature of experimental material characterization efforts. Additionally, such models fail to generalize to new types of molecular structures that were not included in the model training data. The acceleration of material development through uncertainty-guided experimental design has the promise to significantly reduce the data requirements and enable faster generalization to new types of materials. To evaluate the potential of such approaches for electrolyte design applications, we perform comprehensive evaluation of existing uncertainty quantification methods on the prediction of two relevant molecular properties - aqueous solubility and redox potential. We develop novel evaluation methods to probe the utility of the uncertainty estimates for both in-domain and out-of-domain data sets. Finally, we leverage selected uncertainty estimation methods for active learning to evaluate their capacity to support experimental design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards a more general understanding of the algorithmic utility of recurrent connections

Lateral and recurrent connections are ubiquitous in biological neural circuits. Yet while the strong computational abilities of feedforward networks have been extensively studied, our understanding of the role and advantages of recurrent computations that might explain their prevalence remains an important open challenge. Foundational studies by Minsky and Roelfsema argued that computations that require propagation of global information for local computation to take place would particularly benefit from the sequential, parallel nature of processing in recurrent networks. Such “tag propagation” algorithms perform repeated, local propagation of information and were originally introduced in the context of detecting connectedness, a task that is challenging for feedforward networks. Here, we advance the understanding of the utility of lateral and recurrent computation by first performing a large-scale empirical study of neural architectures for the computation of connectedness to explore feedforward solutions more fully and establish robustly the importance of recurrent architectures. In addition, we highlight a tradeoff between computation time and performance and construct hybrid feedforward/recurrent models that perform well even in the presence of varying computational time limitations. We then generalize tag propagation architectures to propagating multiple interacting tags and demonstrate that these are efficient computational substrates for more general computations of connectedness by introducing and solving an abstracted biologically inspired decision-making task. Our work thus clarifies and expands the set of computational tasks that can be solved efficiently by recurrent computation, yielding hypotheses for structure in population activity that may be present in such tasks.

59 BASIC BIOLOGICAL SCIENCES↗

The role of stiffness in training and generalization of ResNets

Neural ordinary differential equations (NODEs) have recently regained popularity as large-depth limits of a large class of neural networks. In particular, residual neural networks (ResNets) are equivalent to an explicit Euler discretization of an underlying NODE, where the transition from one layer to the next is one time step of the discretization. The relationship between continuous and discrete neural networks has been of particular interest. Notably, analysis from the ordinary differential equation viewpoint can potentially lead to new insights for understanding the behavior of neural networks in general. In this work, we take inspiration from differential equations to define the concept of stiffness for a ResNet via the interpretation of a ResNet as the discretization of a NODE. Here, we then examine the effects of stiffness on the ability of a ResNet to generalize, via computational studies on example problems coming from climate and chemistry models. We find that penalizing stiffness does have a unique regularizing effect, but we see no benefit to penalizing stiffness over L 2 regularization (penalization of network parameter norms) in terms of predictive performance.

97 MATHEMATICS AND COMPUTING↗