Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed method”

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 325 records · Page 18

Investigating Gluonic Operators in Coordinate Space

In this dissertation, a method of extracting gluon momentum distributions inside hadrons, and particularly nucleons, is developed. In general, the utility and application of performing calculations in coordinate space at the operator level is discussed, and its application to the method of pseudodistributions in the lattice extraction of parton distributions. An introduction to the background field method and other techniques used in the calculation of corrections to gluon operators are provided. Then, an outline of the calculation of the uncontracted gluon bilocal operator at one-loop is given, and the result thereof. Using the result for the gluon bilocal operator restricted to spacelike separations, z = (0, 0, 0, z3), various projections and contractions are discussed for the spin averaged case, and for the polarization dependent case in a forward nucleon matrix element. Finally, matching relations between pseudodistributions and lightcone distributions are given for the unpolarized gluon distribution and for the polarized gluon distribution. Application of the results in recent actual lattice extractions of gluon PDFs is discussed, and future applications are outlined.

Morris, Wayne↗

Multiarea Distribution System State Estimation via Distributed Tensor Completion

Here, this paper proposes a model-free distribution system state estimation method based on tensor completion using canonical polyadic decomposition. In particular, we consider a setting where the network is divided into multiple areas. The measured physical quantities at buses located in the same area are processed by an area controller. A three-way tensor is constructed to collect these measured quantities. The measurements are analyzed locally to recover the full state information of the network. A distributed closed-form iterative algorithm based on the alternating direction method of multipliers is developed to obtain the low-rank factors of the whole network state tensor where information exchange happens only between neighboring areas. The convergence properties of the distributed algorithm and the sufficient conditions on the number of samples for each smaller network that guarantee the identifiability of the factors of the state tensor are presented. To demonstrate the efficacy of the proposed algorithm and to check the identifiability conditions, numerical simulations are carried out using the IEEE 123-bus system and a large-scale real utility feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Genetic-algorithm retrieval of the molecular alignment distribution with high-order harmonics generated from transiently aligned CO 2 molecules

Using genetic algorithm, we propose a method to retrieve the alignment distribution of transiently aligned CO 2 molecules from the high-order harmonic generation (HHG) spectra. The retrieval method is based on the quantitative rescattering (QRS) model where averaged photorecombination transition dipole can be factored out from the parallel (or perpendicular) harmonic spectra after the propagation of the harmonic fields in the gas medium. We examine how the retrieved alignment distributions are affected by uncertainty in alignment dependent ionization probability and on multiple orbital contribution to the HHG. We further confirm that alignment distribution is more accurately retrieved by using the minima in the HHG spectra driven by a long-wavelength laser. In addition, we show that earlier experimental data on the ratios between the perpendicular and the parallel HHG components of aligned CO 2 molecules are in better agreement with the QRS model if the macroscopic propagation and multiple orbital interference are included in the theoretical calculation.

74 ATOMIC AND MOLECULAR PHYSICS↗

Case Study: Applying the INL Resilience Framework to Iowa Lakes Electric Cooperative Distributed Wind Systems

Traditional metrics and evaluation methods for resiliency are not sufficient to evaluate the effect that distributed wind systems will have, particularly in light of the challenges described above. While the concept of resiliency is not new, its application to the electric grid is neither standardized nor well-defined, and there is little to no guidance on how to evaluate resilience specifically for distributed wind systems. To fill this gap, the Idaho National Laboratory (INL), as part of the multi-laboratory Microgrids, Infrastructure Resilience, and Advanced Controls Launchpad (MIRACL) project, has developed a resilience framework for electric energy delivery systems (EEDS). The framework provides detailed steps for evaluating resiliency in the planning, operational, and future stages, and encompasses five core functions of resilience. It allows users to evaluate the resilience of distributed wind, taking into consideration the resilience of the wind systems themselves, as well as the effect they have on the resiliency of any systems they are connected to. In this study, we evaluate the resilience of the distributed wind systems at Iowa Lakes Electric Cooperative to cybersecurity hazards. We show that the wind resource can benefit the overall system resilience during some hazards. We show that the practices in place make the wind subsystems resilient against some cybersecurity hazards but that there are still significant risks associated with other cybersecurity hazards

17 WIND ENERGY↗

A Robust Parallel Distributed State Estimation for Large Scale Distribution Systems

The growing need and interest in real-time monitoring of large distribution networks motivated by the rapid population of renewable sources, EVs and etc. demand a computationally efficient state estimation framework. Furthermore, this paper presents an improved computational framework for implementing a robust state estimator using a multi-core processor. The main contribution of the paper is the proposed computational framework along with two partitioning strategies which enable fast and robust state estimation for large scale radial and/or meshed distribution systems. Formulation of the proposed method and its implementation are described in detail. Performance of the estimator is tested by simulations first using a small 84-bus radial distribution system. Then the method’s scalability is demonstrated by simulations on two very large scale distribution networks one configured radially and the other meshed each containing over 12,500 buses.

42 ENGINEERING↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Equity-driven Planning of Distributed Solar PV using Optimal Transport

Typically, distribution system planning processes do not explicitly incorporate energy equity considerations, such as identifying consumers most affected by energy costs and determining how investments in the distribution system can address existing energy burden imbalances. This paper proposes a novel optimal transport (OT)-based method to improve the energy burden distribution of consumers. The approach involves the strategic siting and sizing of solar PV in order to assist customers with high energy burden and improve the overall energy burden distribution of the community. The desired energy burden distribution is defined using the equal distribution equivalent (EDE) concept. The OT-based method is then used to estimate the distributed solar PV capacity to be installed at various locations and the tariffs to be adjusted, all while improving the energy burden distribution and providing valuable insights into distributed generation (DG) planning. The results on IEEE 37 bus test system demonstrate how DG planning, considering EDE and OT, can help reduce the energy burden of low-income consumers. Additionally, the approach also reveals optimal tariff adjustments needed to ensure revenue neutrality for distribution utilities.

Optimal transport, equal distribution equivalent, ↗

Meta-uncertainty for particle image velocimetry

Uncertainty quantification for Particle Image Velocimetry (PIV) is critical for comparing experimentally measured flow fields with Computational Fluid Dynamics (CFD) results, and model design and validation. However, PIV features a complex measurement chain with coupled, non-linear error sources, and quantifying the uncertainty is challenging. Multiple assessments show that none of the current methods can reliably measure the actual uncertainty across a wide range of experiments, and estimates can vary. Because the current methods differ in assumptions regarding the measurement process and calculation procedures, it is not clear which method is best to use for an experiment where the error distribution is unknown. To address this issue, we propose a method to estimate an uncertainty method's sensitivity and reliability, termed the Meta-Uncertainty. The novel approach is automated, local, and instantaneous, and based on perturbation of the recorded particle images. We developed an image perturbation scheme based on adding random unmatched particles to the interrogation window pair considering the signal-to-noise (SNR) of the correlation plane. Each uncertainty scheme's response to several trials of random particle addition is used to estimate a reliability metric, defined as the rate of change of the inter-quartile range (IQR) of the uncertainties with increasing levels of particle addition. We also propose applying the meta-uncertainty as a weighting metric to combine uncertainty estimates from individual schemes, based on ideas from the consensus forecasting literature. We use planar and stereo PIV measurements across a range of canonical flows to assess the performance of the uncertainty schemes. Further, a novel method is introduced to assess an uncertainty scheme's performance based on a quantile comparison of the error and uncertainty distributions, generalizing the current method of comparing the RMS of the two distributions. Here, the results show that the combined uncertainty method outperforms the individual methods, and this work establishes the meta-uncertainty as a useful reliability assessment tool for PIV uncertainty quantification.

47 OTHER INSTRUMENTATION↗

Dynamic Boundary Microgrids Under Privatization Considerations

Microgrids have physical, electrical, and logical (data, network, and ownership) boundaries. To power unserved customer loads during an outage, microgrids can extend the traditional operational boundaries. This can become complex when considering microgrid-to-microgrid (M2M) interactions where sensitive information such as competitive microgrid operational data is not shared. This work proposes an optimization method coordinated between microgrid controllers and distribution management systems that limits data sharing. The method involves a competitive bidding strategy that maximizes unserved load coverage while minimizing resource utilization and sensitive operational data sharing among entities. The work is validated on a two-microgrid system with photovoltaic and energy storage systems and curves of load derived from real world residential buildings datasets. Results show that the proposed method, when applied for three distinct use cases of energy storage sufficiency to cover the predefined boundary and/or the expanded boundary, can successfully select and bid the available load coverage.

Starke, Michael [ORNL] (ORCID:0000000221211195)↗

Probabilistic Methods for Cyclical and Coupled Systems with Changing Failure Rates

Advancements in nuclear system designs with automated control features provide many benefits, but can lead to complex coupled systems and dynamic failure scenarios. This is especially true for microreactor designs where components are not expected to be replaced during the reactor’s lifetime. Hence, the life of the system, in addition to the safety, needs to be evaluated. Modeling these sequences of time-dependent events requires addressing cyclical processes and changing failure rates in ways that represent the actual system dynamics in contrast to a single sampling for a component’s time to failure. This research presents two distinct analytical methods for several failure distributions that evaluate a final time to failure used for different scenarios where the time to failure must be sampled multiple times. The first method is used when evaluating a component whose failure rate increases due to an outside event after the initial sampling but before the initially sampled time to failure. The second method is used when evaluating multiple identical components or a component that has been replaced with a new identical version before the second sampling. The two methods were implemented in a few representative case studies developed in the dynamic probabilistic risk assessment tool Event Modeling Risk Assessment using Linked Diagrams. Overall, this paper provides guidelines on how these approaches give a more realistic and accurate dynamic probabilistic risk assessment of complex systems.

97 MATHEMATICS AND COMPUTING↗

Energy-peak based method to measure top quark mass via B -hadron decay lengths

We develop a method for the determination of the top quark mass using the distribution of the decay length of the B -hadrons originating from its decay. This technique is based on our earlier observation regarding the location of the peak of the b quark energy distribution. Such “energy-peak” methods enjoy a greater degree of model-independence with respect to the kinematics of top quark production compared to earlier proposals. The CMS experiment has implemented the energy-peak method using associated b -jet energy as an approximation for b quark energy. The new method uses B -hadron decay lengths, which are related to b quark energies by convolution. The advantage of the new decay length method is that it can be applied in a way that evades jet-energy scale (JES) uncertainties. Indeed, CMS has measured the top quark mass using B -hadron decay lengths, but they did not incorporate the energy-peak method. Therefore, mismodeling of top quark transverse momentum remains a large uncertainty in their result. We demonstrate that, using energy-peak methods, this systematic uncertainty can become negligible. We show that with the current LHC data set, a sub-GeV statistical uncertainty on the top quark mass can be attained with this method. To achieve a comparable systematic uncertainty as is true for many methods based on exclusive or semi-inclusive observables using hadrons, we find that the quark-hadron transition needs to be described significantly better than is the case with current fragmentation functions and hadronization models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Scalable Gaussian Process Approach to Shear Mapping with MuyGPs

Analysis of cosmic shear is an integral part of understanding structure growth across cosmic time, which in turn provides us with information about the nature of dark energy. Conventional methods generate shear maps from which we can infer the matter distribution in the universe. Current methods (e.g., Kaiser–Squires inversion) for generating these maps, however, are tricky to implement and can introduce bias. Recent alternatives construct a spatial process prior for the lensing potential, which allows for inference of the convergence and shear parameters given lensing shear measurements. Realizing these spatial processes, however, scales cubically in the number of observations—an unacceptable expense as near-term surveys expect billions of correlated measurements. Therefore, we present a linearly scaling shear map construction alternative using a scalable Gaussian process prior called MuyGPs. MuyGPs avoids cubic scaling by conditioning interpolation on only nearest neighbors and fits hyperparameters using batched leave-one-out cross-validation. This work is the first step toward a full, scalable mass mapping method. We work in a simplified regime where we validate our method by interpolating and analyzing maps given noisy point-estimate data from all three shear fields, taken from a suite of N -body ray-tracing simulations. We also show that we can perform these operations at the scale of billions of galaxies on high-performance computing platforms.

79 ASTRONOMY AND ASTROPHYSICS↗

Understanding protein-complex assembly through grand canonical maximum entropy modeling

Inside a cell, heterotypic proteins assemble in inhomogeneous, crowded systems where the abundance of these proteins vary with cell types. While some protein complexes form putative structures that can be visualized with imaging, there are far more protein complexes that are yet to be solved because of their dynamic associations with one another. Nevertheless, it is possible to infer these protein complexes through a physical model. However, it is often not clear to physicists what kind of data from biology is necessary for such a modeling endeavor. Here, we aim to model these clusters of coarse-grained protein assemblies from multiple subunits through the constraints of interactions among the subunits and the chemical potential of each subunit. We obtained the constraints on the interactions among subunits from the known protein structures. We inferred the chemical potential that dictates the particle number distribution of each protein subunit from the knowledge of protein abundance from experimental data. Guided by the maximum entropy principle, we formulated an inverse statistical mechanical method to infer the distribution of particle numbers from the data of protein abundance as chemical potentials for a grand canonical multicomponent mixture. Using grand canonical Monte Carlo simulations, we captured a distribution of high-order clusters in a protein complex of succinate dehydrogenase with four known subunits. The complexity of hierarchical clusters varies with the relative protein abundance of each subunit in distinctive cell types such as lung, heart, and brain. When the crowding content increases, we observed that crowding stabilizes emergent clusters that do not exist in dilute conditions. We, therefore, proposed a testable hypothesis that the hierarchical complexity of protein clusters on a molecular scale is a plausible biomarker of predicting the phenotypes of a cell.

59 BASIC BIOLOGICAL SCIENCES↗

Initial position optimization in molecular dynamics simulations for a Coulomb system

A new algorithm for molecular dynamics (MD) simulations is developed to optimize plasma particle distributions at given initial temperatures. By combining velocity scaling and reassignment, the method effectively eliminates the initial rise and oscillation in temperatures observed with randomly distributed positions. These rises and oscillations are undesired numerical artifacts observed in conventional plasma MD simulations, arising from unoptimized particle positions. The algorithm demonstrates temperature relaxation without initial rises or oscillations, as well as precise flow velocity relaxation, enabling accurate measurement of relaxation times. The code is accelerated using graphics processing units for parallel processing, enhancing the study of plasma dynamics. The proposed method for distributing physically valid particles in MD simulations enables accurate studies of intrinsic collision processes in plasmas, including the dynamics of strongly coupled plasmas, plasma–wave interactions, and transport phenomena in magnetized plasmas. The paper concludes with a discussion of potential applications and future enhancements to the algorithm.

Jo, Jawon (ORCID:0009000924193285)↗

Probabilistic evolution of stochastic dynamical systems: A meso-scale perspective

Stochastic dynamical systems arise naturally across nearly all areas of science and engineering. Typically, a dynamical system model is based on some prior knowledge about the underlying dynamics of interest in which probabilistic features are used to quantify and propagate uncertainties associated with the initial conditions, external excitations, etc. From a probabilistic modeling standing point, two broad classes of methods exist, i.e. macro-scale methods and micro-scale methods. Classically, macro-scale methods such as statistical moments-based strategies are usually too coarse to capture the multi-mode shape or tails of a non-Gaussian distribution. Micro-scale methods such as random samples-based approaches, on the other hand, become computationally very challenging in dealing with high-dimensional stochastic systems. In view of these potential limitations, a meso-scale scheme is proposed here that utilizes a meso-scale statistical structure to describe the dynamical evolution from a probabilistic perspective. The significance of this statistical structure is twofold. First, it can be tailored to any arbitrary random space. Second, it not only maintains the probability evolution around sample trajectories but also requires fewer meso-scale components than the micro-scale samples. To demonstrate the efficacy of the proposed meso-scale scheme, a set of examples of increasing complexity are provided. Connections to the benchmark stochastic models as conservative and Markov models along with practical implementation guidelines are presented.

97 MATHEMATICS AND COMPUTING↗

Ultrathin film lasing

Technologies are described for methods to fabricate lasers to amplify light. The methods may comprise depositing nanoparticles on a substrate. The length, width, and height of the nanoparticles may be less than 100 nm. The methods may further comprise distributing the nanoparticles on the substrate to produce a film. The nanoparticles in the film may be coupled nanoparticles. The coupled nanoparticles may be in disordered contact with each other within the film. The distribution may be performed such that constructive interference of the light occurs by multiple scattering at the boundaries of the coupled nanoparticles within the film. The methods may comprise exposing the film to a power source.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed reinforcement learning and consensus control of energy systems

Disclosed herein are methods, systems, and devices for utilizing distributed reinforcement learning and consensus control to most effectively generate and utilize energy. In some embodiments, individual turbines within a wind farm may communicate to reach a consensus as to the desired yaw angle based on the wind conditions.

King, Jennifer Rose Rose↗

Optimizing the shape of photometric redshift distributions with clustering cross-correlations

We present an optimization method for the assignment of photometric galaxies to a chosen set of redshift bins. This is achieved by combining simulated annealing, an optimization algorithm inspired by solid-state physics, with an unsupervised machine learning method, a self-organizing map (SOM) of the observed colours of galaxies. Starting with a sample of galaxies that is divided into redshift bins based on a photometric redshift point estimate, the simulated annealing algorithm repeatedly reassigns SOM-selected subsamples of galaxies, which are close in colour, to alternative redshift bins. We optimize the clustering cross-correlation signal between photometric galaxies and a reference sample of galaxies with well-calibrated redshifts. Depending on the effect on the clustering signal, the reassignment is either accepted or rejected. By dynamically increasing the resolution of the SOM, the algorithm eventually converges to a solution that minimizes the number of mismatched galaxies in each tomographic redshift bin and thus improves the compactness of their corresponding redshift distribution. This method is demonstrated on the synthetic Legacy Survey of Space and Time cosmoDC2 catalogue. We find a significant decrease in the fraction of catastrophic outliers in the redshift distribution in all tomographic bins, most notably in the highest redshift bin with a decrease in the outlier fraction from 57 percent to 16 percent.

79 ASTRONOMY AND ASTROPHYSICS↗