Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithm”

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,315 records · Page 73

Measuring the X-ray luminosities of DESI groups from eROSITA Final Equatorial-Depth Survey – I. X-ray luminosity–halo mass scaling relation

ABSTRACT We use the eROSITA Final Equatorial-Depth Survey (eFEDS) to measure the rest-frame 0.1–2.4 keV band X-ray luminosities of ∼600 000 DESI groups using two different algorithms in the overlap region of the two observations. These groups span a large redshift range of 0.0 ≤ zg ≤ 1.0 and group mass range of $10^{10.76}\, h^{-1}\, \mathrm{M}_{\odot } \le M_h \le 10^{15.0}\, h^{-1}\, \mathrm{M}_{\odot }$. (1) Using the blind detection pipeline of eFEDS, we find that 10932 X-ray emission peaks can be cross-matched with our groups, ∼38 per cent of which have a signal-to-noise ratio $\rm {S}/\rm {N} \ge 3$ in X-ray detection. Comparing to the numbers reported in previous studies, this matched sample size is a factor of ∼6 larger. (2) By stacking X-ray maps around groups with similar masses and redshifts, we measure the average X-ray luminosity of groups as a function of halo mass in five redshift bins. We find that in a wide halo mass range, the X-ray luminosity, LX, is roughly linearly proportional to Mh and quite independent to the redshift of the groups. (3) We use a Poisson distribution to model the X-ray luminosities obtained using two different algorithms and obtain the best-fit $L_{\rm X}=10^{28.46\pm 0.03}M_{\rm h}^{1.024\pm 0.002}$ and $L_{\rm X}=10^{26.73 \pm 0.04}M_{\rm h}^{1.140 \pm 0.003}$ scaling relations, respectively. The best-fit slopes are flatter than the results previously obtained but closer to a self-similar prediction.

Astronomy & Astrophysics↗

Global Retrieval of Cloud Particle Size and Optical Thickness Using ISCCP Data

The primary thrust of this investigation is to develop an algorithm to retrieve cloud particle sizes using ISCCP data. The research under this grant has been successful in obtaining initial results of global distribution of ice-particle sizes. Further research about possible problems caused by nonsphericity of ice particle sizes is currently underway. An algorithm of retrieving ice-cloud particle sizes using ISCCP CX data has been developed. The first survey of ice-particle size in a near-global scale has been completed. Comparison with in situ measurements of ice crystal sizes during FIRE I shows good agreement. The initial results show that the global mean size of ice crystals (De) is about 60 micron. This result is consistent with the range of in situ measurements all over the world if definitions of effective particle size are unified (see next section). The survey also shows that there is no distinct difference of ice-particle sizes between continental and maritime ice-clouds. There are many different definitions of effective particle size used in ice-cloud research. Simple comparisons between values of in situ measurement and satellite remote sensing are misleading and may lead to incorrect conclusions. We reviewed different definitions of effective particle sizes used in the literature and compared their relative magnitudes.

Welch, Ronald M.↗

GRB Diversity vs. Utility as Cosmological Probes

Recent detections of apparent gamma-ray burst (GRB) counterparts in optical and radio wavebands strongly favor the cosmological distance scale, at least for some GRBs, opening the possibility of GRBs serving as cosmological probes. But GRBs exhibit great diversity: in total duration; in number, width and pulse configuration; and in pulse and overall spectral evolution. However, it is possible that a portion of this behavior reflects a luminosity distribution, and possible that evolution of with cosmic time introduces dispersion into the average GRB characteristics -- issues analogous to those encountered with quasars. The temporal domain offers a rich avenue to investigate this problem. When corrected for assumed spectral redshift, time dilation of event durations, pulse widths, and intervals between pulses must yield the same time-dilation factor as a function of peak flux, or else a luminosity distribution may be the cause of observed time dilation effects. We describe results of burst analysis using an automated, Bayesian-based algorithm to determine burst temporal characteristics for different peak flux groups, and derived constraints on any physical process that would introduce a luminosity distribution.

Norris, J. P.↗

Efficient reconstruction and validation of heterogeneous microstructures for energy applications

The digital reconstruction of microstructures is necessary for simulations in fields ranging from geology to electrochemistry, but the state-of-the-art digital reconstruction techniques often compromise between resolution and field of view. It is challenging to retain detailed microstructure information in large-scale reconstructions. Here, this study investigates different aspects of the Yeong-Torquato algorithm based on correlation functions to make it more efficient. We achieve this goal by reducing the computational complexity of the chord-length distribution function and the two-point correlation function, applying the random sphere-packing method as the initial condition, and restricting potential voxel swaps to interfaces. In addition, a novel superposition parallel scheme is introduced to aid in searching for potential voxel swaps. The algorithm proposed is validated by comparing the pore-size distributions of reconstructed 3D custom battery electrodes from a sample dataset obtained from transmission X-ray microscopy. From a sample image with 200 x 200 pixels, the code can reconstruct a 300 x 300 x 300 structure in under 22 h and reconstruct a 400 x 400 x 400 structure in 43 h with eight cores.

42 ENGINEERING↗

Augmenting machine learning of energy landscapes with local structural information

We present a machine learning approach for accurately predicting formation energies of binary compounds in the context of crystal structure predictions. The success of any machine learning model depends significantly on the choice of representation used to encode the relevant physical information into machine-learnable data. We test different representation schemes based on partial radial and angular distribution functions (RDF+ADF) on Al–Ni and Cd–Te structures generated using our genetic algorithm for structure prediction. We observe a remarkable improvement in predictive accuracy upon transitioning from global to atom-centered representations, resulting in a threefold decrease in prediction errors. We show that a support vector regression model using a combination of atomic radial and angular distribution functions performs best at the formation energy prediction task, providing small root mean squared errors of 3.9 meV/atom and 10.9 meV/atom for Al–Ni and Cd–Te, respectively. We test the performance of our models against common traditional descriptors and find that RDF- and ADF-based representations significantly outperform many of those in the prediction of formation energies. The high accuracy of predictions makes our machine learning models great candidates for the exploration of energy landscapes.

Honrao, Shreyas J. (ORCID:0000000166155257)↗

TrustDER: Trusted, Private and Scalable Coordination of Distributed Energy Resources

In this project, the Stanford and SLAC Teams have developed a Trusted, Private and Scalable platform for coordinating Coordination of Distributed Energy Resources (TrustDER). This is a layered system that ensures private, trusted and scalable coordination and monitoring of DERs. It accommodates a variety of resources, such as solar generation, gensets and loads, with a particular focus on battery systems-based resources, as they are a transformational technology experiencing fast growth in adoption by large critical facilities. The platform can be used as standalone or added to existing aggregation systems to enable trust, privacy and resilience. TrustDER consists of layers that address each of the shortcomings of the existing state of the art. Each layer in the platform can operate independently but provides information to the layers above it to enable a novel form of overall coordination architecture. The project consists of several tasks, with each task dedicated to the design of each layer. Task 2 Resource Virtualization defined a software abstraction layer for distributed energy resources (DERs). The goal of this abstraction was to simplify the implementation of algorithms utilizing cooperation of DERs resources in a variety of use cases. Task 3 is on Secure ID for Asset Authentication. Identity Management Systems (IDMS) are a foundational infrastructure for interactions between entities (organizations, users, devices, and services). Secure ID is blockchain-based a distributed identity management system allowing (1) identity provisioning, (2) authentication, (3) authorization, and (4) identity data sharing for IoT-enabled assets on the electricity grid. In this project, the SLAC team focused on designing and testing Keymaker, a protocol for authenticating device identity managed by Secure ID. Task 5 Private and Safe Integration is focused on the design and evaluation of a DER cooperation scheme which allows for the aggregation of DERs without impacting network reliability. The approach is designed based on realistic assumptions regarding data availability, communication infrastructure limitations, and privacy. Task 6 Scalable Distributed Privacy for Information explored how virtualized batteries could be managed privately. Specifically, it examined the case in which a principal provides a partitioned battery to multiple clients. Task 7 Use Cases was to ensure that this technology was applied in relevant situations and scenarios. Primarily, this means that virtualization needed to be employed in a manner that either improved flexibility, bolstered security or privacy, or decreased costs.

25 ENERGY STORAGE↗

A reliable multicast for XTP

Multicast services needed for current distributed applications on LAN's fall generally into one of three categories: datagram, semi-reliable, and reliable. Transport layer multicast datagrams represent unreliable service in which the transmitting context 'fires and forgets'. XTP executes these semantics when the MULTI and NOERR mode bits are both set. Distributing sensor data and other applications in which application-level error recovery strategies are appropriate benefit from the efficiency in multidestination delivery offered by datagram service. Semi-reliable service refers to multicasting in which the control algorithms of the transport layer--error, flow, and rate control--are used in transferring the multicast distribution to the set of receiving contexts, the multicast group. The multicast defined in XTP provides semi-reliable service. Since, under a semi-reliable service, joining a multicast group means listening on the group address and entails no coordination with other members, a semi-reliable facility can be used for communication between a client and a server group as well as true peer-to-peer group communication. Resource location in a LAN is an important application domain. The term 'semi-reliable' refers to the fact that group membership changes go undetected. No attempt is made to assess the current membership of the group at any time--before, during, or after--the data transfer.

Dempsey, Bert J.↗

An Online Joint Optimization–Estimation Architecture for Distribution Networks

Here in this article, we propose an optimal joint optimization-estimation architecture for distribution networks, which jointly solves the optimal power flow (OPF) problem and static state estimation (SE) problem through an online gradient-based feedback algorithm. The main objective is to enable a fast and timely interaction between the OPF decisions and state estimators with limited sensor measurements. First, convergence and optimality of the proposed algorithm are analytically established. Then, the proposed gradient-based algorithm is modified by introducing statistical information of the inherent estimation and linearization errors for an improved and robust performance of the online OPF decisions. Overall, the proposed method eliminates the traditional separation of operation and monitoring, where optimization and estimation usually operate at distinct layers and different time scales. Hence, it enables a computationally affordable, efficient, and robust online operational framework for distribution networks under time-varying settings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Projected Future Changes in Tropical Cyclones Using the CMIP6 HighResMIP Multimodel Ensemble

Future changes in tropical cyclone properties are an important component of climate change impacts and risk for many tropical and midlatitude countries. In this study we assess the performance of a multimodel ensemble of climate models, at resolutions ranging from 250 to 25 km. We use a common experimental design including both atmosphere-only and coupled simulations run over the period 1950–2050, with two tracking algorithms applied uniformly across the models. There are overall improvements in tropical cyclone frequency, spatial distribution, and intensity in models at 25 km resolution, with several of them able to represent very intense storms. Projected tropical cyclone activity by 2050 generally declines in the South Indian Ocean, while changes in other ocean basins are more uncertain and sensitive to both tracking algorithm and imposed forcings. Coupled models with smaller biases suggest a slight increase in average TC 10 m wind speeds by 2050.

54 ENVIRONMENTAL SCIENCES↗

Evaluation of on-line pulse control for vibration suppression in flexible spacecraft

A numerical simulation was performed, by means of a large-scale finite element code capable of handling large deformations and/or nonlinear behavior, to investigate the suitability of the nonlinear pulse-control algorithm to suppress the vibrations induced in the Spacecraft Control Laboratory Experiment (SCOLE) components under realistic maneuvers. Among the topics investigated were the effects of various control parameters on the efficiency and robustness of the vibration control algorithm. Advanced nonlinear control techniques were applied to an idealized model of some of the SCOLE components to develop an efficient algorithm to determine the optimal locations of point actuators, considering the hardware on the SCOLE project as distributed in nature. The control was obtained from a quadratic optimization criterion, given in terms of the state variables of the distributed system. An experimental investigation was performed on a model flexible structure resembling the essential features of the SCOLE components, and electrodynamic and electrohydraulic actuators were used to investigate the applicability of the control algorithm with such devices in addition to mass-ejection pulse generators using compressed air.

Masri, Sami F.↗

Distributional Deep Reinforcement Learning-Based Emergency Frequency Control

Emergency frequency control is one of the most critical approaches to maintain power system stability after major disturbances. With the increasing number of grid-connected renewable energy sources, existing model-based methods of frequency control are facing up with challenges of computational speed and scalability for large-scale systems. In this paper, the emergency frequency control problem is formulated as a Markov Decision Process (MDP) and solved through a novel Distributional Deep Reinforcement Learning (DDRL) method, namely the distributional soft actor critic (DSAC) method. Compared with other RL methods that only estimate the mean value, the proposed DSAC model estimates the distribution of value function over returns. This advancement can lead to more insights and knowledge for the agent, with the benefit of a much faster and more stable learning process, and the improved frequency control performance. Here, the simulation results on IEEE 39-bus and IEEE 118-bus systems demonstrate the effectiveness and robustness of proposed models, as well as the advantage compared to other state-of-the-art DRL algorithms.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Intercomparison of Various Algorithms in Determining Convective and Stratiform Precipitation

The paper presents the intercomparison of various algorithms in determining the convective and stratiform precipitation in tropical convection. The latent heat released from precipitation is the driving mechanism for the general circulation of the atmosphere and exhibits different vertical profile in convective and stratiform regimes of the tropical convection. The primary goal of this paper is to evaluate the performance of the operational convective/stratiform algorithm that is employed by the NASA Tropical Rainfall Measuring Mission (TRMM) ground validation program. The operational algorithm is based on the texture of radar reflectivity field at constant altitude. The TRMM ground validation program continuously monitors the tropical convection through ground based radar and rain gauge network at selected sites around the tropics and generates the rainfall products including the convective/stratiform rainfall map that can readily be used by the TRMM satellite program. An evaluation and improvement of these rainfall products requires additional measurements that can be available through field campaigns. The data used in this study was collected during the second phase of the Texas Florida Underflights (TEFLUN-B) field campaign in East Central Florida, a primary site of the TRMM ground validation program. The TEFLUN-B field campaign was conducted in August and September 1998 in support of the NASA Tropical Rainfall Measuring Mission (TRMM) satellite observations. An objective of the TEFLUN-B field campaign was to obtain the ground based precipitation measurements of Florida convection at different temporal and spatial scales. The field campaign had various components of precipitation measurements including dual wavelength precipitation profiler, various types of disdrometers and rain gauges, collocated about 40 km southwest of Melbourne NEXRAD radar. In this study, we examine the profiler based reflectivity and Doppler velocity and the disdrometer based drop size distribution observations to evaluate the operational scanning radar (i.e. NEXRAD) based convective/stratiform algorithm.

Tokay, Ali↗

Model Formulations: Integrating Distributed Energy Resources (DER) using Advanced Unit Commitment Models and DER Aggregation Methodologies

A distribution energy resource aggregator (DERA) constitutes a group of distribution energy resources with small generation capacities which meet the threshold to participate in the electricity wholesale market. This document provides the proposed DERA model formulation that will be implemented in the SCUC simulation’s architecture for the SCUC-DER project. Different economical assessment methodologies have been developed to incorporated bids for individual distributed resources, which include solar cost dispatch and cost model, BESS opportunity cost offer algorithm, and price sensitive demand response model. Detailed methods are proposed to aggregate individual cost offers to a DERA cost curve to bid in SCUC market while three methods are proposed to simulate DER actual dispatch. Based on the DERA models in this document, the SCUC-DER project will be able to assess the impacts of DERA on the distribution system’s operation and reliability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗

The Application of New Software Technology to the Architecture of the National Cycle Program

As part of the Numerical Propulsion System Simulation (NPSS) effort of NASA Lewis in conjunction with the United States aeropropulsion industry, a new system simulation framework, the National Cycle Program (NCP), capable of combining existing empirical engine models with new detailed component-based computational models is being developed. The software architecture of the NCP program involves a generalized object- oriented framework and a base-set of engine component models along with supporting tool kits which will support engine simulation in a distributed environment. As the models are extended to contain two and three dimensions the computing load increases rapidly and it is intended that this load be distributed across multiple work stations executing concurrently in order to get acceptably fast results. The research carried out was directed toward performance analysis of the distributed object system. More specifically, the performance of the actor-based distributed object design I created earlier was desired. To this end, the research was directed toward the design and implementation of suitable performance-analysis techniques and software to demonstrate those techniques. There were three specific results which are reported in two separate reports submitted separately as NASA Technical Memoranda. The results are: (1) Design, implementation, and testing of a performance analysis program for a set of active objects (actor based objects) which allowed the individual actors to be assigned to arbitrary processes on an arbitrary set of machines. (2) The global-balance-equation approach has the fundamental limitation that the number of equations increases exponentially with the number of actors. Hence, unlike many approximate approaches to this problem, the nearest-neighbor approach allows checking of the solution and an estimate of the error. The technique was demonstrated in a prototype analysis program as part of this research. The results of the program were checked against the global-balance solution discussed above. Late during the grant, a much better approximation was developed and this is discussed in result below. As a consequence, a proposal was submitted to continue the research by developing the new approximation including development of a complete program from the prototype. (3) The source of approximation in the nearest-neighbor algorithm is the requirement for estimating some joint probabilities from some marginal distributions. A completely ad hoc estimate was used in the prototype.

Schoeffler, James D.↗

Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors

Two parallel algorithms for standard cell placement using simulated annealing are developed to run on distributed-memory message-passing hypercube multiprocessors. The cells can be mapped in a two-dimensional area of a chip onto processors in an n-dimensional hypercube in two ways, such that both small and large cell exchange and displacement moves can be applied. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support the parallel cost evaluation. A novel tree broadcasting strategy is used extensively for updating cell locations in the parallel environment. A dynamic parallel annealing schedule estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control.

Banerjee, Prithviraj↗

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. Furthermore, we observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

97 MATHEMATICS AND COMPUTING↗

Accounting for the Effects of Surface BRDF on Satellite Cloud and Trace-Gas Retrievals: A New Approach Based on Geometry-Dependent Lambertian-Equivalent Reflectivity Applied to OMI Algorithms

Most satellite nadir ultraviolet and visible cloud, aerosol, and trace-gas algorithms make use of climatological surface reflectivity databases. For example, cloud and NO2 retrievals for the Ozone Monitoring Instrument (OMI) use monthly gridded surface reflectivity climatologies that do not depend upon the observation geometry. In reality, reflection of incoming direct and diffuse solar light from land or ocean surfaces is sensitive to the sun-sensor geometry. This dependence is described by the bidirectional reflectance distribution function (BRDF). To account for the BRDF, we propose to use a new concept of geometry-dependent Lambertian equivalent reflectivity (LER). Implementation within the existing OMI cloud and NO2 retrieval infrastructure requires changes only to the input surface reflectivity database. The geometry-dependent LER is calculated using a vector radiative transfer model with high spatial resolution BRDF information from the Moderate Resolution Imaging Spectroradiometer (MODIS) over land and the Cox-Munk slope distribution over ocean with a contribution from water-leaving radiance. We compare the geometry-dependent and climatological LERs for two wavelengths, 354 and 466 nm, that are used in OMI cloud algorithms to derive cloud fractions. A detailed comparison of the cloud fractions and pressures derived with climatological and geometry-dependent LERs is carried out. Geometry-dependent LER and corresponding retrieved cloud products are then used as inputs to our OMI NO2 algorithm. We find that replacing the climatological OMI-based LERs with geometry-dependent LERs can increase NO2 vertical columns by up to 50% in highly polluted areas; the differences include both BRDF effects and biases between the MODIS and OMI-based surface reflectance data sets. Only minor changes to NO2 columns (within 5 %) are found over unpolluted and overcast areas.

Lambert-equivalent reflectivity↗