Earth resources technology satellite. Volume 15 appendix - Functional analysis
Functional flow diagrams and allocation sheets for ERTS operations control and data processing
Source record↗
SEARCH · Engineering Papers
Results for “resource allocations”
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.
Unlocking aquifer sustainability through irrigator-driven groundwater conservation
Groundwater depletion caused by intensive pumping for irrigated agriculture is a global threat to economies, food security, and ecosystems. Pumping reductions are required to confront this threat, but their implementation is a “wicked” problem due to interlinked hydrological, social, and economic factors. In the US High Plains Aquifer, an irrigator-led conservation effort known as the Sheridan 6 Local Enhanced Management Area (SD-6 LEMA) is a rare example of successful collective action in agricultural-groundwater systems. In its first decade, the area has exceeded water use reduction goals and decreased depletion rates by over 50% without significantly affecting net income. In this Perspective, we highlight factors underlying the SD-6 LEMA’s effectiveness, and identify transferable governance tenets for other groundwater dependent regions striving for sustainable management of groundwater resources. These tenets include flexibility through multi-year allocations, regulatory oversight to support the irrigators’ plans, and a strong scientific foundation for sustainable agricultural-groundwater systems.
54 ENVIRONMENTAL SCIENCES↗
Operational optimization for multi-functional charging station with electric and hydrogen-powered vehicles
The rapid adoption of electric vehicles (EVs) and hydrogen fuel cell vehicles (HFCVs), combined with global efforts to reduce carbon emissions, has accelerated the development of EV charging and hydrogen refueling stations. In response to this demand, this paper introduces the concept of Multi-Functional Charging Station (MFCS) that integrates power generation, EV charging, battery swapping, and hydrogen refueling. A comprehensive operational model is developed for the MFCS that couples electricity and hydrogen conversion and storage technologies to enhance infrastructure utilization and improve overall system efficiency. The model also considers multiple revenue streams, including participation in energy and ancillary markets. To validate the effectiveness of the proposed model and evaluate its performance, a series of numerical experiments are conducted with different charger numbers, different electricity purchase limits, and different charger allocations. Numerical results demonstrate that shared charger configurations can lead to 8.11 % improvement in operational profit by improving resource utilization and reducing the number of depleted batteries at the end of operations compared to allocated charger setups. By varying the number of chargers, sensitivity analysis identifies diminishing marginal returns beyond about 45 chargers, suggesting it as an optimal sizing point under current settings. The integration of electricity and hydrogen conversion is also explored under scenarios with limited external electricity purchases. In conclusion, these findings indicate that optimizing charger allocation and energy management can significantly enhance station productivity and profitability, ultimately supporting the broader adoption of electrified and hydrogen-based transportation solutions.
Charging station↗
Distributed Energy Resource Interconnection Roadmap
Adopting strategic reforms to DER interconnection can help reduce interconnection delays, fairly allocate costs, improve transparency and equity, and support efficient and strategic investment in distribution and sub-transmission grids that can accommodate a rapidly evolving energy landscape. The Interconnection Innovation e-Xchange envisions this roadmap and its transmission system companion volume as collaborative resources to facilitate continued stakeholder discussions, problem-solving, and innovation as the U.S. works together to enable simpler, faster, and fairer interconnection of clean energy resources all while enhancing the reliability, resiliency, and security of our electric grid.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Soil nutrients affect biomass allocation at the individual tree level in Populus_deltoides
The allocation of carbon (C) to tree roots has implication for forest productivity and soil C storage. Here, we elucidated the factors affecting absolute and relative production of resource-acquiring absorptive fine roots (AFR) and other tree organs. We assessed soil properties, leaf (Leaves), stem and branch (Stem-Br), coarse root (CR), transport fine root (TFR), and AFR biomass, production, and allocation and leaf litterfall and AFR and TFR turnover for 12 trees in a youngPopulus deltoides plantation. On a biomass basis, standing crop of AFRs was significantly related to that of TFRs, but both were independent of biomass of leaves, CRs and Stem-Brs. Production (standing crop + turnover) as a proportion of total biomass (allocation) highlighted significant relationships between AFR%, TFR%, and tree and soil characteristics. AFR% and TFR% were negatively correlated with Stem-Br%, Leaf%, and total tree production. Spatial variation in soil nutrient gradients altered allocation withinP. deltoides.AFR% and TFR% were negatively correlated with CEC, N, and Ca but positively correlated with soil P, Fe, and Na. Stem-Br% was positively correlated with CEC and soil N but negatively correlated with P. AFR and TFR growth and death are tightly coupled at the individual tree level. AFR allocation, but not standing biomass, is highly correlated with allocation to leaves, suggesting tight regulation of the growth of these two resource-acquiring organs. Lower soil N and Ca increased allocation to AFRs at the cost of leaves, whereas allocation to AFRs and leaves increased with soil P. Such changes in response to soil P may control whole-tree production in the current study.
Biomass allocation↗
Exploring Enhanced Dominant Resource Fairness Using Linear Programming Calculated Weights
Maintaining resource fairness while achieving optimization for various performance metrics such as resource utilization, turnaround time and job latency is a well-known resource scheduling challenge in cloud computing. Despite the significant progress made with the introduction of dominant resource fairness by Ghodsi et al., which ensures major allocation properties such as sharing incentive, strategy-proofness, envy-freeness and Pareto efficiency to be achieved
Yan, Bo [Binghamton University]↗
Speed to Power: Solutions for Accelerating Large Load Connections
Rapid growth in demand from data centers and other large loads is creating a range of new challenges for electricity planners, investors, system operators, and regulators, leading to bottlenecks that have slowed connection of large loads to the electric grid. In response, innovative solutions for accelerating large load connections are beginning to emerge across the U.S. Drawing on an extensive document and literature review, this report identifies more than 40 potential solutions for accelerating large load connections, organized into five functional areas: load forecasting, interconnection, resource planning and procurement, markets and operations, and cost allocation and ratemaking. The five functional areas provide a framework for organizing challenges and solutions to large load connection bottlenecks.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Dynamic Transfers Of Tasks Among Computers
Allocation scheme gives jobs to idle computers. Ideal resource-sharing algorithm should have following characteristics: Dynamics, decentralized, and heterogeneous. Proposed enhanced receiver-initiated dynamic algorithm (ERIDA) for resource sharing fulfills all above criteria. Provides method balancing workload among hosts, resulting in improvement in response time and throughput performance of total system. Adjusts dynamically to traffic load of each station.
Liu, Howard T.↗
Model for Simulating a Spiral Software-Development Process
A discrete-event simulation model, and a computer program that implements the model, have been developed as means of analyzing a spiral software-development process. This model can be tailored to specific development environments for use by software project managers in making quantitative cases for deciding among different software-development processes, courses of action, and cost estimates. A spiral process can be contrasted with a waterfall process, which is a traditional process that consists of a sequence of activities that include analysis of requirements, design, coding, testing, and support. A spiral process is an iterative process that can be regarded as a repeating modified waterfall process. Each iteration includes assessment of risk, analysis of requirements, design, coding, testing, delivery, and evaluation. A key difference between a spiral and a waterfall process is that a spiral process can accommodate changes in requirements at each iteration, whereas in a waterfall process, requirements are considered to be fixed from the beginning and, therefore, a waterfall process is not flexible enough for some projects, especially those in which requirements are not known at the beginning or may change during development. For a given project, a spiral process may cost more and take more time than does a waterfall process, but may better satisfy a customer's expectations and needs. Models for simulating various waterfall processes have been developed previously, but until now, there have been no models for simulating spiral processes. The present spiral-process-simulating model and the software that implements it were developed by extending a discrete-event simulation process model of the IEEE 12207 Software Development Process, which was built using commercially available software known as the Process Analysis Tradeoff Tool (PATT). Typical inputs to PATT models include industry-average values of product size (expressed as number of lines of code), productivity (number of lines of code per hour), and number of defects per source line of code. The user provides the number of resources, the overall percent of effort that should be allocated to each process step, and the number of desired staff members for each step. The output of PATT includes the size of the product, a measure of effort, a measure of rework effort, the duration of the entire process, and the numbers of injected, detected, and corrected defects as well as a number of other interesting features. In the development of the present model, steps were added to the IEEE 12207 waterfall process, and this model and its implementing software were made to run repeatedly through the sequence of steps, each repetition representing an iteration in a spiral process. Because the IEEE 12207 model is founded on a waterfall paradigm, it enables direct comparison of spiral and waterfall processes. The model can be used throughout a software-development project to analyze the project as more information becomes available. For instance, data from early iterations can be used as inputs to the model, and the model can be used to estimate the time and cost of carrying the project to completion.
Mizell, Carolyn↗
Performance Prediction of Big Data Transfer Through Experimental Analysis and Machine Learning
Big data transfer in next-generation scientific applications is now commonly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) through advance bandwidth reservation. To use HPN resources efficiently, provisioning agents need to carefully schedule data transfer requests and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized by the requesting user, could be simply wasted or cause extra overhead and complexity in management due to exclusive access. This calls for the capability of performance prediction to reserve bandwidth resources that match actual needs. Towards this goal, we employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements, which are collected over a span of several years from a large number of data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated HPN testbeds. We first identify a comprehensive list of attributes involved in a typical big data transfer process, including end host system configurations, network connection properties, and control parameters of data transfer methods. We then conduct an in-depth exploratory analysis of their impacts on application-level throughput, which provides insights into big data transfer performance and motivates the use of machine learning. We also investigate the applicability of machine learning algorithms and derive their general performance bounds for performance prediction of big data transfer in HPNs. Experimental results show that, with appropriate data preprocessing, the proposed machine learning-based approach achieves 95% or higher prediction accuracy in up to 90% of the cases with very noisy real-life performance measurements.
Yun, Daqing↗
Performance Prediction of Big Data Transfer Through Experimental Analysis and Machine Learning
Big data transfer in next-generation scientific ap- plications is now commonly carried out over connections with guaranteed bandwidth provisioned in High-performance Net- works (HPNs) through advance bandwidth reservation. To use HPN resources efficiently, provisioning agents need to carefully schedule data transfer requests and allocate appropriate band- widths. Such reserved bandwidths, if not fully utilized by the requesting user, could be simply wasted or cause extra overhead and complexity in management due to exclusive access. This calls for the capability of performance prediction to reserve bandwidth resources that match actual needs. Towards this goal, we employ machine learning algorithms to predict big data transfer perfor- mance based on extensive performance measurements, which are collected over a span of several years from a large number of data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated HPN testbeds. We first identify a comprehensive list of attributes involved in a typical big data transfer process, including end host system configurations, network connection properties, and control parameters of data transfer methods. We then conduct an in-depth exploratory analysis of their impacts on application- level throughput, which provides insights into big data transfer performance and motivates the use of machine learning. We also investigate the applicability of machine learning algorithms and derive their general performance bounds for performance prediction of big data transfer in HPNs. Experimental results show that, with appropriate data preprocessing, the proposed machine learning-based approach achieves 95% or higher pre- diction accuracy in up to 90% of the cases with very noisy real-life performance measurements.
Yun, Daqing↗
When energy doesn’t add up: use of an energyshed framework in assessing progress towards renewable energy transitions
Global progress in energy transitions to support climate mitigation goals has been slower than anticipated; this has prompted shifts away from traditional paradigms of regulated energy ownership towards a model of energy democratization by local communities and individuals. For example, in the United States, local communities in over 250 cities, counties, and states have made pledges to reach 100% renewable electrification by target dates ranging from 2020 to 2050. However, the availability of infrastructure and the competition for renewable energy resources, as well as lack of awareness of these limitations, present significant barriers to overcome. In this study, we explored a subset of 31 of these cities to assess their current electricity generation and how much further they have to go to meet their goals. Through an energyshed framework, we estimated powerplant electricity allocation to each city assuming competition for power from various renewable and non-renewable resource types, as well as look at the ‘best case scenario’ assuming 100% allocation of renewable-sourced electricity for a handful of cities in order to understand the existing and planned energy mixes for 2021 and the following 20 years. It is likely most cities will meet 10% of their energy demand with renewable energy, with best cases scenarios reaching between 35% and 65% renewable penetration, within the next 20–30 years. This highlights the need for infrastructural development in the energy sector, as well as intentional planning efforts in order to make these energy goals a reality.
54 ENVIRONMENTAL SCIENCES↗
Spectrum allocations above 40 GHz
The 1979 World Administrative Radio Conference (WARC-79) revised the International Table of Frequency Allocations to reflect increased interest and activity in the region of the EM spectrum above 40 GHz. The total width of the spectrum allocated (235 GHz) in the region above 40 GHz indicates the extent of this new spectrum resource, made accessible by advances in the state-of-the-art of telecommunications equipment. There are some striking differences between the approach to allocation above and below 40 GHz. For example, there are not bands allocated exclusively. This reflects the characteristics of propagation and the small antenna beamwidths achievable at these frequencies. Attention is given to atmospheric window and absorption band limits, allocations to satellite services, allocations to scientific services, allocations to terrestrial services, the future refinement of the radio regulations above 40 GHz, and allocations of WARC-79 and frequency management.
Katzenstein, W. E.↗
Integrated Metrics for County-Level Resilience Ranking Using Entropy and TOPSIS
In the face of atypical weather events, power infrastructure failures, and limited resources for resilience investment, energy decision-makers need data-driven metrics to allocate resilience investments and maximize the reduction of power outage impacts. For state-level planning, for instance, ranking the resilience of each county is key to ensuring effective distribution of resources. In such cases, resilience for each spatial unit is multifaceted and is captured by a set of indicators (i.e., metrics) that can be combined into an overall score that reduces the complexity of power outage dynamics to a single decision metric. However, weighting of these indicators is often addressed by simplifying assumptions (i.e., equal weights) or semi-subjective methods that rely on user-defined weights that can introduce biases (e.g., weighted average score). Within the disaster risk reduction and resilience engineering community, a recurring challenge in multicriteria decision-making is the objective weighting of indicators for composite indices. To address this issue, we have leveraged a Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) combined with an entropy-based weighting approach to calculated the integrated scores. This method objectively determines the importance of each metric, better discerns between spatial units (i.e., counties), and offers a more reliable ranking of counties according to their relative resilience attributes. By improving methods for integrating resilience indicators, our approach helps planners and decision-makers prioritize resources more effectively for more efficient resilience investments.
Bhusal, Narayan [Oak Ridge National Laboratory (OR↗
Distribution Network Capacity Market Design: Marginal Distribution Capacity Pricing Mechanism for Efficient Investment and Cost Allocation
As electricity markets begin to shift from reliance on large, centralized power plants and towards distributed energy resources (DERs), there is a growing acknowledgement that more efficient planning, operations, and oversight is needed in the distribution system. This paper addresses one step in that direction by proposing an auction mechanism that uses a detailed distribution system planning model that allocates permits to end-used customers who request capacity to install new devices at their location and network upgrade contracts to utilities or 3rd-party companies who offer to upgrade system components. The resulting plan maximizes market surplus, that is, maximizes the total benefit to consumers minus the cost of network upgrades. We apply a marginal pricing scheme to the auction’s results such that the cost of each permits or contracts is differentiated by time and location, based on the Lagrangian multipliers of binding network constraints. These prices are shown to be no greater than the bid price of any awarded contract and no less than the offered cost of any awarded upgrade contract. Furthermore, the nonlinearity of power flows in the planning model result in an additional surplus that would be collected by the entity that hosts the auction, which could then be refunded to market participants or used to cover overhead costs of running the market. We provide four example auction results in a simple three-node distribution feeder to demonstrate the properties of the design. Results suggest that larger or more realistic case studies could be a promising next step.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Evolution of Electric Sector Water Use Under Alternative Electricity Futures
Increasing competition for water resources in the United States could create future challenges for allocating and using thermal cooling water in the U.S. electric power sector. While thermal power plant retirements and the growth of wind and solar technologies can reduce national aggregate power sector cooling water use, local water constraints and growing demand for agricultural or municipal supply could create greater needs for higher-cost alternative water supplies such as groundwater or recycled wastewater. For some regions, these incentives could change future electricity planning and operational decisions. These relationships and impacts are studied here using the National Renewable Energy Laboratory (NREL) Regional Energy Deployment System (ReEDS), a national electric sector planning model that has recently been upgraded to include a highly detailed representation of thermal cooling water demand and supply. Thermal power technologies are differentiated by both cooling technology and water source type to track and constrain thermal cooling water use in a way that incorporates both physical and legal water considerations in the United States. This capability is exercised under a range of electricity sector futures with alternative technology costs, fuel prices, and water constraints to illustrate ways that U.S. electric sector water use could evolve under uncertain future electric sector drivers. In exploring changes to regional generation and transmission planning and operation, water requirements, and cost, we highlight the environmental and economic impacts of future power sector water decisions.
29 ENERGY PLANNING, POLICY, AND ECONOMY↗
Enabling machine learning-ready HPC ensembles with Merlin
With the growing complexity of computational and experimental facilities, many scientific researchers are turning to machine learning (ML) techniques to analyze large scale ensemble data. With complexities such as multi-component workflows, heterogeneous machine architectures, parallel file systems, and batch scheduling, care must be taken to facilitate this analysis in a high performance computing (HPC) environment. Here, we present Merlin, a workflow framework to enable large ML-friendly ensembles of scientific HPC simulations. By augmenting traditional HPC with distributed compute technologies, Merlin aims to lower the barrier for scientific subject matter experts to incorporate ML into their analysis. As a producer–consumer workflow model, Merlin enables multi-machine, cross-batch job, dynamically allocated yet persistent workflows capable of utilizing surge-compute resources. Key features of Merlin are a flexible HPC-centric interface, low per-task overhead, multi-tiered fault recovery, and a hierarchical sampling algorithm that allows for $\mathscr{O}$(N) task execution and $\mathscr{O}$(N ln N) task queuing to ensembles of millions of tasks. In addition to Merlin’s design, we test the algorithm’s performance in an HPC center and demonstrate the ability to enqueue 40 million simulations in 100 s, with a 30 millisecond per-task overhead that is independent of ensemble size. Finally, we describe some example applications that Merlin has enabled on leadership-class HPC resources, such as the ML-augmented optimization of nuclear fusion experiments and the calibration of infectious disease models to study the progression of and possible mitigation strategies for COVID-19.
97 MATHEMATICS AND COMPUTING↗
GPU-Based Static Data-Flow Analysis for Fast and Scalable Android App Vetting
Many popular vetting tools for Android applications use static code analysis techniques. In particular, Interprocedural Data-Flow Graph (IDFG) construction is the computation at the core of Android static data-flow analysis and consumes most of the analysis time. Many analysis tools use a worklist algorithm, an iterative fixed-point approach, to construct the IDFG. In this paper, we observe that a straightforward GPU parallelization of the worklist algorithm leads to significant underutilization of the GPU resources. We identify four performance bottlenecks, namely, frequent dynamic memory allocations, high branch divergence, workload imbalance, and irregular memory access patterns. Accordingly, we propose GDroid, a GPU-based worklist algorithm implementation with multiple fine-grained optimizations tailored to common characteristics of Android applications. The optimizations considered are: matrix-based data structure, memory access-based node grouping, and worklist merging. Our experimental evaluation, performed on 1000 Android applications, shows that the proposed optimizations are beneficial to performance, and GDroid can achieve up to 128X speedups against a plain GPU implementation.
Android security↗