Search NASA⌕ Search

SEARCH · Search NASA

Results for “allocation methods”

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 289 records · Page 16

UPC++ v1.0 Programmer’s Guide (Revision 2019.9.0)

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Programmer’s Guide, Revision 2020.10.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ Programmer’s Guide, v1.0-2018.9.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Programmer’s Guide, Revision 2020.3.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

The Role of Integrated Modeling in the Design and Verification of the James Webb Space Telescope

The James Web Space Telescope (JWST) is a large, infrared-optimized space telescope scheduled for launch in 2011. System-level verification of critical optical performance requirements will rely on integrated modeling to a considerable degree. In turn, requirements for accuracy of the models are significant. The size of the lightweight observatory structure, coupled with the need to test at cryogenic temperatures, effectively precludes validation of the models and verification of optical performance with a single test in 1-g. Rather, a complex series of steps are planned by which the components of the end-to-end models are validated at various levels of subassembly, and the ultimate verification of optical performance is by analysis using the assembled models. This paper describes the critical optical performance requirements driving the integrated modeling activity, shows how the error budget is used to allocate and track contributions to total performance, and presents examples of integrated modeling methods and results that support the preliminary observatory design. Finally, the concepts for model validation and the role of integrated modeling in the ultimate verification of observatory are described.

Mosier, Gary E.↗

Finite solid representation of robot manipulation in three-dimensional geometric reasoning

Intelligence robotic system design involves sensor allocation and sensor data fusion. In the field of geometric reasoning, a fast and effective representation method is needed to determine the physical dimensions of the manipulator as well as the motion environment in sufficient detail. Due to the capability of current sensor technology, the integrity of the sensor information is location dependent and point-wise, line-wise and plane-wise in nature. In order to maneuver the robot by reasoning the environment, there is a minimum requirement of prior information for integrating the allocated sensor feedback. Some new theoretical developments of how to associate the number and the locations of the sensors with three-dimensional geometry of the robot and the motion environment is presented. The related collision avoidance problem (CAP) will be addressed as well.

Chen, Alexander Y. K.↗

On Finding Black Holes in Photometric Microlensing Surveys

There are expected to be millions of isolated black holes in the galaxy resulting from the deaths of massive stars. Measuring the abundance and properties of this remnant population would shed light on the end stages of stellar evolution and the evolution paths of black hole systems. Detecting isolated black holes is currently only possible via gravitational microlensing, which has so far yielded one definitive detection. The difficulty in finding microlensing black holes lies in having to choose a small subset of events, based on characteristics of their light curves, to allocate expensive and scarce follow-up resources to confirm the identity of the lens. Current methods either rely on simple cuts in parameter space without using the full distribution information or are only effective on small subsets of events. In this paper, we present a new lens classification method. The classifier takes in posterior constraints on light-curve parameters and combines them with a Galactic simulation to estimate the lens class probability. This method is flexible and can be used with any set of microlensing light-curve parameters, making it applicable to large samples of events. We make this classification framework available via the popclass Python package. We apply the classifier to ~10,000 microlensing events from the Optical Gravitational Lensing Experiment survey and find 23 high-probability black hole candidates. Our classifier also suggests that the only known isolated black hole is an observational outlier, according to current Galactic models, and the allocation of astrometric follow-up on this event was a high-risk strategy.

79 ASTRONOMY AND ASTROPHYSICS↗

Interrelation Between Safety Factors and Reliability

An evaluation was performed to establish relationships between safety factors and reliability relationships. Results obtained show that the use of the safety factor is not contradictory to the employment of the probabilistic methods. In many cases the safety factors can be directly expressed by the required reliability levels. However, there is a major difference that must be emphasized: whereas the safety factors are allocated in an ad hoc manner, the probabilistic approach offers a unified mathematical framework. The establishment of the interrelation between the concepts opens an avenue to specify safety factors based on reliability. In cases where there are several forms of failure, then the allocation of safety factors should he based on having the same reliability associated with each failure mode. This immediately suggests that by the probabilistic methods the existing over-design or under-design can be eliminated. The report includes three parts: Part 1-Random Actual Stress and Deterministic Yield Stress; Part 2-Deterministic Actual Stress and Random Yield Stress; Part 3-Both Actual Stress and Yield Stress Are Random.

Elishakoff, Isaac↗

Proportion of fine roots, but not plant biomass allocation below ground, increases with elevation in arctic tundra

Questions: Roots represent a considerable proportion of biomass, primary production and litter input in arctic tundra, and plant allocation of biomass to above- or below- ground tissue in response to climate change is a key factor in the future C balance of these ecosystems. According to optimality theory plants allocate C to the above- or below-ground structure that captures the most limiting resource. We used an elevational gradient to test this theory and as a space-for-time substitution to inform on tundra carbon allocation patterns under a shifting climate, by exploring if increasing elevation was positively related to the root:shoot ratio, as well as a larger plant allocation to adsorptive over storage roots. Location: Arctic tundra heath dominated by Empetrum hermaphroditum close to Abisko, Sweden. Methods: We measured root:shoot and fine:coarse root ratios of the plant communities along an elevational gradient by sampling above- and below-ground biomass, further separating root biomass into fine (<1 mm) and coarse roots. Results: Plant biomass was higher at the lower elevations, but the root:shoot ratio did not vary with elevation. Resource allocation to fine relative to coarse roots increased with elevation, resulting in a fine:coarse root ratio that more than doubled with in- creasing elevation. Conclusions: Contrary to previous works, the root:shoot ratio along this elevational gradient remained stable. However, communities along our study system were dominated by the same species at each elevation, which suggests that when changes in the root:shoot ratio occur with elevation these changes may be driven by differences in allocation patterns among species and thus turnover in plant community structure. Our results further reveal that the allocation of biomass to fine relative to coarse roots can differ between locations along an elevational gradient, even when overall above- vs below-ground biomass allocation does not. Given the functionally different roles of fine vs coarse roots this could have large implications for below-ground C cycling. Thus. our results highlight the importance of direct effects vs indirect effects (such as changes in plant community composition and nutrient availability) of climate change for future C allocation above and below ground.

59 BASIC BIOLOGICAL SCIENCES↗

Robust Design Under Uncertainty in Quantum Error Mitigation

Error mitigation techniques are crucial to achieving near-term quantum advantage. Classical postprocessing of quantum computation outcomes is a popular approach for error mitigation, which includes methods, such as zero noise extrapolation, virtual distillation, and learning-based error mitigation. However, these techniques have limitations due to the propagation of uncertainty resulting from the finite shot number of a quantum measurement. In this work, we introduce general and unbiased methods for quantifying the uncertainty and error of error-mitigated observables based on the strategic sampling of error mitigation outcomes. We then extend our approach to demonstrate the optimization of performance and robustness of error mitigation under uncertainty. To illustrate our methods, we apply them to zero noise extrapolation and Clifford date regression in the ground state of the XY model simulated using depolarizing and International Business Machines Corporation (IBM) Toronto noise models, respectively. In particular, we optimize the choice of noise levels and the allocation of shots for zero noise extrapolation and the distribution of the training circuits for Clifford data regression. While our methods are readily applicable to any postprocessing-based error mitigation approach, in practice they must not be prohibitively expensive—even though they perform optimizations of the error mitigation hyperparameters requiring sampling of a statistical distribution of error mitigation outcomes. By leveraging surrogate-based optimization, we show that our methods can efficiently perform optimal design for a zero noise extrapolation implementation. We then further demonstrate the transferability of learned zero noise extrapolation hyperparameters to other similar circuits.

97 MATHEMATICS AND COMPUTING↗

A Prospective Quasi-Randomized Comparison of Intraoperatively Built Custom-Linked Seeds Versus Loose Seeds for Prostate Brachytherapy

Purpose: To compare dosimetric parameters, seed migration rates, operation times, and acute toxicities of intraoperatively built custom-linked (IBCL) seeds with those of loose seeds for prostate brachytherapy. Methods and Materials: Participants were 140 patients with low or intermediate prostate cancer prospectively allocated to an IBCL seed group (n=74) or a loose seed group (n=66), using quasirandomization (allocated by week of the month). All patients underwent prostate brachytherapy using an interactive plan technique. Computed tomography and plain radiography were performed the next day and 1 month after brachytherapy. The primary endpoint was detection of a 5% difference in dose to 90% of prostate volume on postimplant computed tomography 1 month after treatment. Seed migration was defined as a seed position >1 cm from the cluster of other seeds on radiography. A seed dropped into the seminal vesicle was also defined as a migrated seed. Results: Dosimetric parameters including the primary endpoint did not differ significantly between groups, but seed migration rate was significantly lower in the IBCL seed group (0%) than in the loose seed group (55%; P<.001). Mean operation time was slightly but significantly longer in the IBCL seed group (57 min) than in the loose seed group (50 min; P<.001). No significant differences in acute toxicities were seen between groups (median follow-up, 9 months). Conclusions: This prospective quasirandomized control trial showed no dosimetric differences between IBCL seed and loose seed groups. However, a strong trend toward decreased postimplant seed migration was shown in the IBCL seed group.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Chemical shifts of small heterogeneous Ar/Xe clusters

Heterogeneous rare-gas clusters produced by a coexpansion of an argon/xenon mixture have been studied using synchrotron-radiation-based photoelectron spectroscopy. Both valence and Xe 4d{sub 5/2} core-level photoelectron spectra were recorded for three different concentrations of the primary argon/xenon mixture and, for those mixtures, spectra were recorded at several different stagnation conditions. The studied size regime of the mixed clusters ranges from large, similar to those studied in an earlier paper [Phys. Rev. A 69, 031210(R) (2004)], to very small--as reflected in the cluster line shapes and chemical shifts. The chemical shifts obtained from a curve fitting procedure similar to that used in our earlier paper are discussed in terms of the mixed cluster structure which can be expected from equilibrium considerations and the Lennard-Jones parameters of the constituent atoms. Molecular dynamics simulations of the vertical polarization shifts allow more specific assignments of ''on-top'' sites and interfacial sites.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient Simulation Budget Allocation for Selecting an Optimal Subset

We consider a class of the subset selection problem in ranking and selection. The objective is to identify the top m out of k designs based on simulated output. Traditional procedures are conservative and inefficient. Using the optimal computing budget allocation framework, we formulate the problem as that of maximizing the probability of correc tly selecting all of the top-m designs subject to a constraint on the total number of samples available. For an approximation of this corre ct selection probability, we derive an asymptotically optimal allocat ion and propose an easy-to-implement heuristic sequential allocation procedure. Numerical experiments indicate that the resulting allocatio ns are superior to other methods in the literature that we tested, and the relative efficiency increases for larger problems. In addition, preliminary numerical results indicate that the proposed new procedur e has the potential to enhance computational efficiency for simulation optimization.

Chen, Chun-Hung↗

Biomass Resource Allocation among Competing End Uses

The Biomass Scenario Model (BSM) is a system dynamics model developed by the U.S. Department of Energy as a tool to better understand the interaction of complex policies and their potential effects on the biofuels industry in the United States. However, it does not currently have the capability to account for allocation of biomass resources among the various end uses, which limits its utilizationin analysis of policies that target biomass uses outside the biofuels industry. This report provides a more holistic understanding of the dynamics surrounding the allocation of biomass among uses that include traditional use, wood pellet exports, bio-based products and bioproducts, biopower, and biofuels by (1) highlighting the methods used in existing models' treatments of competition forbiomass resources; (2) identifying coverage and gaps in industry data regarding the competing end uses; and (3) exploring options for developing models of biomass allocation that could be integrated with the BSM to actively exchange and incorporate relevant information.

09 BIOMASS FUELS↗

Coupling Visualization, Simulation, and Deep Learning for Ensemble Steering of Complex Energy Models

We describe a new framework that allows users to explore and steer ensembles of energy systems simulations by coupling multiple energy models and interactive visualization through a dataflow API. Through the visual interface, users can interactively explore complex parameter spaces populated by hundreds, or thousands, of simulation runs and interactively spawn new simulations to 'fill in' regions of interest in the parameter space. The computational and visualization capabilities reside within a general-purpose dataflow architecture for connecting producers of multidimensional timeseries data, such as energy simulations, with consumers of that data, whether they be visualizations, statistical analyses, or datastores. Fast computation and agile dataflow can enhance the engagement with energy simulations, allowing users to populate the parameter space in real time. However, many energy simulations are far too slow to provide an interactive response. To support interactive feedback, we are creating reduced-form simulations developed through machine learning techniques, which provide statistically sound estimates of the results of the full simulations at a fraction of the computational cost. These reduced-form simulations have response times on the order of seconds, suitable for real-time human-in-the-loop design and analysis. The approximation methods apply to a wide range of computational models, including supply-chain models, electric power grid simulations, and building models. Such reduced-form representations do not replace or re-implement existing simulations, but instead supplement them by enabling rapid scenario design and exploration for large ensembles of simulations. The improved understanding, facilitated by the reduced-form models, dataflow API, and visualization tools, allows researchers to better allocate computational resources to capture informative relationships within the system as well as provide a low-cost method for validating and quality-checking large-scale modeling efforts.

97 MATHEMATICS AND COMPUTING↗

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗

Criteria for site selection and frequency allocation (keynote paper), part 5

Technical aspects of mesosphere-stratosphere-troposphere (MST) Radar on site and frequency selection were discussed. Recommendations on site selections are presented. Tests of interference will be conducted before selecting a site. A small directional antenna may be suitable to simulate sidelobe sensitivity of radars however, sophisticated data-processing methods make system sensitivity extremely good. The use of the complete data system to look for interference is recommended. There is the difficulty of allocation of frequencies -- almost continuous use by these radars will be made when the band 40 to 60 MHz is allocated to other services.

Rottger, J.↗

A Data-Driven Pivot-Point-Based Time-Series Feeder Load Disaggregation Method

The load profile at a feeder-head is usually known to utility engineers while the nodal load profiles are not. However, the nodal load profiles are increasingly important for conducting time-series analysis in distribution systems. Therefore, in this paper, we present a pivot-point based, two-stage feeder load disaggregation algorithm using smart meter data. The two stages are load profile selection (LPS) and load profile allocation (LPA). In the LPS stage, a random load profile selection process is first executed to meet the load diversity requirement. Then, a few pairs of pivot points are selected as the matching targets. After that, a matching algorithm will run repetitively to select one load profile at a time for matching the reference load profile at the pivot points. In the LPA stage, the LPS selected load profiles are allocated to each load node on the feeder considering distribution transformer loading limits, load composition, and square-footage. The proposed method is validated using actual data collected in a North Carolina service area. Finally, simulation results show that the proposed method can generate a unique load shape for each load node while match the shape of their aggregated profile with the actual feeder head load profile.

42 ENGINEERING↗