Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scheduling and spacing”

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 37 records · Page 2

Harvesting the low-hanging fruit of high energy savings -- Virtual Occupancy using Wi-Fi Data

Approximately 20% of primary energy consumed in the U.S. is attributed to HVAC use. Ideally, HVAC operation would be driven by actual building occupancy, but lack of reliable occupancy information often results in the use of conservative static schedules. This disparity is even more pronounced in a college campus, where the function of each space differs by building (classrooms, offices, libraries) and the class schedules change frequently -- every semester, day of week, and hour. While several research papers propose the use of counts of the Wi-Fi connections (e.g., phones, computers) as a proxy for occupancy, few real-world implementations exist. This paper describes the development and deployment of an open-source Wi-Fi-to-Occupancy software library in 65 buildings of a college campus, and the planned integration with the building energy management and control system at the building scale. Over a year of Wi-Fi data was gathered into distinct academic periods, including fall and spring semester, academic breaks, and summer sessions. Patterns such as students moving between classrooms, closing laptops before exams, etc., can be visualized from the data. Approximating occupancy from Wi-Fi data presents challenges which we address in this project -- for example, identifying static devices, or estimating the ratio of devices per person. Utilizing real-time occupancy data to inform optimal HVAC schedules and ventilation rates creates the potential to identify and reduce energy waste. Other potential applications include forecasting occupancy, and using Wi-Fi data to predict peak demands. Finally, the paper discusses how to easily scale these tools to other buildings.

Pritoni, Marco↗

Fuzzified PaCcET for Economic-Emission Scheduling of Microgrids

In this paper, a new approach is proposed to solve a multi-objective economic-emission scheduling problem in microgrids (MGs) by simultaneously minimizing the energy and emission costs of the MG with various distributed energy resources (DERs). The proposed approach is an extension of a computationally effective multiobjective optimization technique, Pareto concavity elimination transformation (PaCcET). The proposed approach, referred to as Fuzzified-PaCcET, employs a fuzzy logic controller to dynamically revise crossover and mutation rates in the original PaCcET leading to the faster convergence of the solution. The proposed approach finds the best Pareto front, also referred to as a Non-dominated set (NDS) of solutions, instead of finding a single optimal solution. In order to find the solutions on concave areas of the Pareto front, an iterative objective space transformation is performed in the PaCcET algorithm to allow a linear combination of objective functions (in the transformed objective space). The proposed Fuzzified-PaCcET-based scheduling is implemented on a MG with various dispatchable and non-dispatchable DERs to find the set of optimal solutions according to the total fuel cost of DERs, as well as the most optimum environmental cost. In order to extract the best compromise solution (BCS) among NDS of solutions, a fuzzy-based method is implemented. The comparison of the simulation results of the Fuzzified-PaCcET with that of PaCcET shows that Fuzzified-PaCcET can generate better solution with less computational burden.

Gautam, Mukesh↗

Fuzzified PaCcET for Economic-Emission Scheduling of Microgrids

In this paper, a new approach is proposed to solve a multi-objective economic-emission scheduling problem in microgrids (MGs) by simultaneously minimizing the energy and emission costs of the MG with various distributed energy resources (DERs). The proposed approach is an extension of a computationally effective multiobjective optimization technique, Pareto concavity elimination transformation (PaCcET). The proposed approach, referred to as Fuzzified-PaCcET, employs a fuzzy logic controller to dynamically revise crossover and mutation rates in the original PaCcET leading to the faster convergence of the solution. The proposed approach finds the best Pareto front, also referred to as a Non-dominated set (NDS) of solutions, instead of finding a single optimal solution. In order to find the solutions on concave areas of the Pareto front, an iterative objective space transformation is performed in the PaCcET algorithm to allow a linear combination of objective functions (in the transformed objective space). The proposed Fuzzified-PaCcET-based scheduling is implemented on a MG with various dispatchable and non-dispatchable DERs to find the set of optimal solutions according to the total fuel cost of DERs, as well as the most optimum environmental cost. In order to extract the best compromise solution (BCS) among NDS of solutions, a fuzzy-based method is implemented. The comparison of the simulation results of the Fuzzified-PaCcET with that of PaCcET shows that Fuzzified-PaCcET can generate better solution with less computational burden.

42 ENGINEERING↗

Lifting and Dropping VMs to Dynamically Transition Between Time- and Space-sharing for Large-Scale HPC Systems

As HPC environments increasingly integrate with edge based systems, system architectures will need to handle a broader class of workloads and scheduling requirements. One result of this shift will be the need to simultaneously support bulk-synchronous parallel (BSP) and on-demand service based applications on the same infrastructure. This in turn will require that future resource management approaches utilize both space-shared as well as time-shared resource scheduling strategies. In this work we introduce the concept of "VM-lifting'' (and its inverse "VM-Dropping'') which allows dynamically switching an HPC workload between space-shared and time-shared scheduling regimes. Our work targets co-kernel based HPC system software environments, in which multiple specialized OS kernels execute natively on dedicated physical resource partitions inside a single compute node. With VM-lifting, a native co-kernel can be migrated at runtime to and from locally hosted Virtual Machine Environments due to changing scheduling requirements of the node. This allows an HPC node to be dynamically (re-)configured as either a time-shared Infrastructure-as-a-Service (IaaS) resource or a dedicated space shared resource based on the current workload demands. We have implemented this approach in the context of the Hobbes Exascale System Software stack and have demonstrated that a node can be reconfigured with minimal impact on the running applications.

Gordon, Nick↗

Energy performance of an operational government building retrofitted with ceiling phase change material tiles in a mixed-humid climate

The aging U.S. building stock requires various retrofit measures to enhance their energy efficiency. Here, this study explores the integration of thermal energy storage and advanced building controls as viable retrofit solutions for load flexibility and peak demand response while maintaining the occupants' comfort. A detailed assessment is conducted on the energy use of an administrative building in Sumner County, Kansas, focusing on the implementation of phase change materials (PCMs) in the ceiling of occupied zones. First, a time-resolved, whole-building energy model is developed in EnergyPlus, incorporating complex thermal behaviors such as air exchange between the plenum space and occupied zones, envelope leakage, and operational schedules. The model is then validated using experimental field test data, and subsequently a parametric assessment of key PCM properties and application strategies is performed to evaluate cooling electricity demand benefits. The parametric study shows that the optimal retrofit strategy, comprising a PCM with 23°C peak melting temperature, 0.125 in. (3.17 mm) thickness, and 150 kJ/kg latent heat, combined with active controls that include 8 h of precooling, forced convection under the ceiling, and a 2°C thermostat setback during peak hours, can result in a maximum load shift during the peak period of 99.6 % and the total electricity savings during the peak period of 98.9 % for the optimum case and thus provide significant cost savings under time-of-use pricing scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Enhancing Streamflow Forecast and Extracting Insights Using Long-Short Term Memory Networks With Data Integration at Continental Scales

Recent observations with varied schedules and types (moving average, snapshot, or regularly spaced) can help to improve streamflow forecasts, but it is challenging to integrate them effectively. Based on a long short-term memory (LSTM) streamflow model, we tested multiple versions of a flexible procedure we call data integration (DI) to leverage recent discharge measurements to improve forecasts. DI accepts lagged inputs either directly or through a convolutional neural network unit. DI ubiquitously elevated streamflow forecast performance to unseen levels, reaching a record continental-scale median Nash-Sutcliffe Efficiency coefficient value of 0.86. Integrating moving-average discharge, discharge from the last few days, or even average discharge from the previous calendar month could all improve daily forecasts. Directly using lagged observations as inputs was comparable in performance to using the convolutional neural network unit. Importantly, we obtained valuable insights regarding hydrologic processes impacting LSTM and DI performance. Before applying DI, the base LSTM model worked well in mountainous or snow-dominated regions, but less well in regions with low discharge volumes (due to either low precipitation or high precipitation-energy synchronicity) and large interannual storage variability. DI was most beneficial in regions with high flow autocorrelation: it greatly reduced baseflow bias in groundwater-dominated western basins and also improved peak prediction for basins with dynamical surface water storage, such as the Prairie Potholes or Great Lakes regions. However, even DI cannot elevate performance in high-aridity basins with 1-day flash peaks. Despite this limitation, there is much promise for a deep-learning-based forecast paradigm due to its performance, automation, efficiency, and flexibility.

54 ENVIRONMENTAL SCIENCES↗

2020 Exascale Computing Project Annual Meeting (Executive Summary Report)

The Exascale Computing Project (ECP) delivers specific applications, software products, and outcomes on DOE computing facilities. Integration across these elements for specific hardware technologies for exascale system instantiations is fundamental to ECP success. The outcome of the ECP is the delivery of a capable exascale computing ecosystem to provide breakthrough solutions addressing our most critical challenges in scientific discovery, energy assurance, economic competitiveness, and national security. This outcome is not a matter of ensuring more powerful computing systems. The ECP is designed to create more valuable and rapid insights from a wide variety of applications (“capable”), which requires a much higher level of inherent efficacy in all methods, software tools, and ECP-enabled computing technologies to be acquired by DOE laboratories (“ecosystem”). The ECP annual meeting provides a unique opportunity for the core technical expertise in the United States focused on achieving this next plateau of computational science and computing performance to engage in direct discussions on project execution. Face-to-face gatherings in technical communities like this are common and needed for the exchange of scientific ideas and technical performance. The ECP annual meeting stands apart from other technical conferences and meetings in the computing community as it is uniquely and solely focused on the execution of the ECP and the integration of technical activities leading to the creation of the exascale computing ecosystem for the future. The direct interaction of key critical technical staff, who are leaders in their respective fields, and the resulting give-and-take between software, applications, and hardware and the technical co-design therein, is unique and essential to the effective execution of the ECP. The first annual meeting was held in Knoxville, Tennessee, January 31 – February 2, 2017 and brought together, for the first time, a diverse collection of researchers from 16 DOE national laboratories as well as university computer and computational science researchers to discuss shared problems and joint solutions for the development of a capable exascale computing ecosystem. These interactions resulted in focused technical plans and an energized community centered on advances for ECP. The second annual meeting was held in Knoxville, Tennessee, February 5–9, 2018. It included 643 individual thought leaders and performers in application development, software research and deployment, and hardware research and integrators, all of whom are part of the multifaceted, billion dollar HPC community. This meeting provided a platform to discuss and disseminate numerous examples where researchers with common goals and synergistic solutions came together for the first time to deliver tangible results. Additionally, at the 2018 meeting, ECP researchers had the opportunity to digest all US HPC vendor R&D product roadmaps pointing to exascale – not only to learn how their research can play a role, but, more importantly, to influence those roadmaps to ensure successful delivery on DOE applications that will contribute to (if not solve) problems of national interest in national security, science, energy, and health, as well as growing security threats. The third annual meeting was held in Houston, Texas, January 14–17, 2019. With a 19% increase in the number of registrations (768 people), and the change in location, the third annual meeting was considered the most impactful of the three at the time. The new website provided a better platform for the dissemination of the content, the new venue as a meeting hotel instead of a conference center facilitated interactions and discussions after event hours, and the addition of an award-winning mobile event conference app (Whova) transformed dramatically the attendee experience at the event. This fourth annual meeting was held in Houston, Texas, February 3-7, 2020. This meeting had an increase in the number of attendees for a total of 824 people registered (782 attendees) and included numerous enhancements based on feedback and lessons learned from previous meetings, some of which are listed here: Improved quality of the sessions, their material and the whole program.; Had more industry participation and addition of external collaborators from overseas.; Published the full agenda earlier to better accommodate attendance and travel plans based on schedule.; Centralized all sessions in one venue.; Provided additional hotels and room blocks for the attendees.; Improved communication with the audience (links, material, directions, notifications, etc.) to go paperless.; Enhanced side meeting scheduling, management and user experience.; Made available additional space and tables for impromptu meetings and side discussions.; Improved IT and A/V solutions for speakers. In addition, our final survey captured the following points as opportunities for improvement in future meetings: consider a different meeting location that is more pedestrian friendly, reduce talks during working meals to allow more collaboration and informal time, adapt the agenda to acknowledge attendees from different timezones, consider recording some of the tutorials and/or sessions to share broadly with the HPC community, have a larger poster room, provide additional power strips, and improve the WiFi.

97 MATHEMATICS AND COMPUTING↗

LSST Scheduler & Progress Monitoring

The NSF-DOE Vera C. Rubin Observatory scheduling team is providing a set of tools for monitoring the scheduler and progress on the Legacy Survey of Space and Time (LSST). These slides provide an overview of available pages and assorted figures on them: the night summary provides an overview of a completed night of observing, including maps of exposures and plots of data quality metrics; the pre-night briefing, an analysis of a simulation of an upcoming night; and a handful of figures that provide information on long-term progress toward LSST survey goals.

H.Neilsen, Eric, Jr. [Fermilab] (ORCID:00000002735↗

Dynamical logical qubits in the Bacon-Shor code

The Bacon-Shor code is a quantum error correcting subsystem code composed of weight-2 check operators that admits a single logical qubit, and has distance 𝑑 on a 𝑑×𝑑 square lattice. We show that when viewed as a Floquet code, by choosing an appropriate measurement schedule of the check operators, it can additionally host several dynamical logical qubits. Specifically, we identify a period-4 measurement schedule of the check operators that preserves logical information between the instantaneous stabilizer groups. Such a schedule not only measures the usual stabilizers of the Bacon-Shor code, but also measures and promotes gauge operators of the parent subsystem code to additional temporary stabilizers that protect the dynamical logical qubits against errors. We show that the code distance of these Floquet-Bacon-Shor codes scales as Θ⁢(𝑑/√𝑘) on an 𝑛=𝑑×𝑑 lattice with 𝑘 dynamical logical qubits, along with the logical qubit of the parent subsystem code. Unlike the usual Bacon-Shor code, the Floquet-Bacon-Shor code family introduced here can therefore saturate the subsystem bound 𝑘⁢𝑑=𝑂⁡(𝑛). Moreover, several errors are shown to be self-corrected purely by the measurement schedule itself. This work provides insights into the design space for dynamical codes and expands the known approaches for constructing Floquet codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Validation and Demonstration of Control System Functional Capabilities within the IES Plug-and-Play Simulation Environment

The concept of an integrated energy system (IES) is meant to combine different energy technologies in synergistic ways to achieve a more secure and economical energy supply. The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the IES. The new RAVEN plugin for grid and capacity optimization (HERON) only addresses the limits that affect the production variables and the corresponding rates of variation (explicit constraints). However, other variables are subject to constraints, and the associated limits should be accounted for (implicit constraints). In particular, for the power dispatch problem, the optimization algorithm takes into account the limits on the electrical power output and the corresponding hourly power variations but does not consider other constraints on process variables whose response affects the service life of the IES. This report describes a scheme that allows accounting for implicit constraints without increasing the size of the optimization problem. To obtain a more accurate approximation of the nonlinear dynamic behavior, a parametric version of the dynamic mode decomposition with control (DMDc) algorithm was developed to derive the state-space representation matrices of the IES components at different scheduling parameter. Thanks to this approach, a more accurate approximation of the system response can be obtained, the limits imposed by thermal mechanical implicit constraints can be translated into power dispatch limits, and the feedbacks to HERON power dispatcher can be provided. To assess the developed methodology, a power dispatching test case composed of three power generating and storage units (Balance of Plant, Secondary Energy Source, Thermal Energy Storage) was developed. The power output of each one of the three units was optimized to meet the imposed time-dependent load demand trajectory and to maximize the IES profitability by meeting both the explicit and implicit constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The NASA ISRO SAR (NISAR) Mission - Validation of Science Measurement Requirements

The NASA ISRO Synthetic Aperture Radar (NISAR) is scheduled for launch early in 2024 from the Satish Dhawan Space Centre (SDSC), at Sriharikota, near Chennai, India. This mission is the result of a collaboration between NASA and Indian Space Research Organization (ISRO), where NASA has contributed elements of the mission such as an L-band SAR, and ISRO has contributed other elements, such as an S-band SAR. After successful launch, the NISAR mission will collect left-looking L-band SAR data over most of the Earth’s land areas twice during every 12-day exact repeat orbit. (once while in an ascending orbit direction and once while in a descending orbit direction). NASA and ISRO have individual and joint requirements on the mission that include the performance of the imaging radars onboard the spacecraft. For example, NASA must demonstrate that this L-band SAR will achieve a set of identified science measurement accuracy requirements that span Ecosystem science, Solid Earth science, and Cryosphere science disciplines. Likewise, ISRO has several applications objectives on both the L-band and S-band data from NISAR that the ISRO science team and project will be developing and testing. Pre-launch and post-launch activities have been planned to validate that these requirements are met. Here, we will discuss how the NASA plans are being executed and will present any initial results at the conference.

Chapman, Bruce↗

Robustness of Deep Learning Classification to Adversarial Input on GPUs: Asynchronous Parallel Accumulation Is a Source of Vulnerability

The ability of machine learning (ML) classification models to resist small, targeted input perturbations—known as adversarial attacks—is a key measure of their safety and reliability. We show that floating-point non associativity (FPNA) coupled with asynchronous parallel programming on GPUs is sufficient to result in misclassification, without any perturbation to the input. Additionally, we show that this misclassification is particularly significant for inputs close to the decision boundary and that standard adversarial robustness results may be overestimated up to 4.6 when not considering machine-level details. We first study a linear classifier, before focusing on standard Graph Neural Network (GNN) architectures and datasets used in robustness assessments. We develop a novel black-box attack using Bayesian optimization to discover external workloads that can change the instruction scheduling which bias the output of reductions on GPUs and reliably lead to misclassification. Motivated by these results, we present a new learnable permutation (LP) gradient-based approach to learning floating-point operation orderings that lead to misclassifications. The LP approach provides a worst-case estimate in a computationally efficient manner, avoiding the need to run identical experiments tens of thousands of times over a potentially large set of possible GPU states or architectures. Finally, using instrumentation-based testing, we investigate parallel reduction ordering across different GPU architectures under external background workloads, when utilizing multi-GPU virtualization, and when applying power capping. Our results demonstrate that parallel reduction ordering varies significantly across architectures under the first two conditions, substantially increasing the search space required to fully test the effects of this parallel scheduler-based vulnerability. These results and the methods developed here can help to include machine-level considerations into adversarial robustness assessments, which can make a difference in safety and mission critical applications.

Shanmugavelu, Sanjif [Maxeler Technologies, a Groq↗

From Cell to System: Accelerated hpc Simulations of BESS Aging under Frequency Regulation and Arbitrage use cases

Lithium-ion battery energy storage systems (BESS) packs have emerged as a leading solution for grid-scale energy storage, enhancing resiliency and balancing load fluctuations. Yet, experimental characterization of large-format LIB packs-particularly to assess performance and degradation over hundreds of cycles - demands substantial hardware investment and multi-year testing campaigns. In this work, we couple a hierarchical, physics-based modeling framework agnostic to electrode chemistries with high-performance computing to accelerate systems level evaluation by upto two orders of magnitude. Building on the open-source liionpack platform, we implement cell, module, and pack-scale electrochemical models enriched with mechanistic aging mechanisms and deploy them on an HPC cluster to simulate 150−200kWh systems over 500 - 1,000 cycles with in days. We subject these virtual B ESS to both constant-current cycling and realistic grid service profiles spanning frequency regulation, ramp-rate support, and energy arbitrage-and quantify the resulting degradation patterns. Our results reveal that localized cell aging can induce substantial nonuniformity at module and pack levels, with service-specific cycling protocols driving distinct aging modes. This rapid, multiscale modeling approach provides a powerful design-space exploration tool for optimizing electrical architecture, control strategies, and operational schedules to prolong pack lifetime and lower total cost of ownership.

Ayalasomayajula, Surya [ORNL] (ORCID:0009000860788↗

Why it is Unfortunate that Linear Machine Learning “Works” so well in Electromechanical Switching of Ferroelectric Thin Films

Machine learning (ML) is relied on for materials spectroscopy. It is challenging to make ML models fail because statistical correlations can mimic the physics without causality. Here, using a benchmark band-excitation piezoresponse force microscopy polarization spectroscopy (BEPS) dataset the pitfalls of the so-called “better”, “faster”, and “less-biased” ML of electromechanical switching are demonstrated and overcome. Using a toy and real experimental dataset, it is demonstrated how linear nontemporal ML methods result in physically reasonable embedding (eigenvalues) while producing nonsensical eigenvectors and generated spectra, promoting misleading interpretations. A new method of unsupervised multimodal hyperspectral analysis of BEPS is demonstrated using long-short-term memory (LSTM) β-variational autoencoders (β-VAEs) . By including LSTM neurons, the ordinal nature of ferroelectric switching is considered. Further, to improve the interpretability of the latent space, a variational Kullback–Leibler-divergency regularization is imposed . Finally, regularization scheduling of β as a disentanglement metric is leveraged to reduce user bias. Combining these experiment-inspired modifications enables the automated detection of ferroelectric switching mechanisms, including a complex two-step, three-state one. Ultimately, this work provides a robust ML method for the rapid discovery of electromechanical switching mechanisms in ferroelectrics and is applicable to other multimodal hyperspectral materials spectroscopies.

36 MATERIALS SCIENCE↗

DFSynthesizer: Dataflow-based Synthesis of Spiking Neural Networks to Neuromorphic Hardware

Spiking Neural Networks (SNNs) are an emerging computation model that uses event-driven activation and bio-inspired learning algorithms. SNN-based machine learning programs are typically executed on tile-based neuromorphic hardware platforms, where each tile consists of a computation unit called a crossbar, which maps neurons and synapses of the program. However, synthesizing such programs on an off-the-shelf neuromorphic hardware is challenging. This is because of the inherent resource and latency limitations of the hardware, which impact both model performance, e.g., accuracy, and hardware performance, e.g., throughput. We propose DFSynthesizer, an end-to-end framework for synthesizing SNN-based machine learning programs to neuromorphic hardware. The proposed framework works in four steps. First, it analyzes a machine learning program and generates SNN workload using representative data. Second, it partitions the SNN workload and generates clusters that fit on crossbars of the target neuromorphic hardware. Third, it exploits the rich semantics of the Synchronous Dataflow Graph (SDFG) to represent a clustered SNN program, allowing for performance analysis in terms of key hardware constraints such as number of crossbars, dimension of each crossbar, buffer space on tiles, and tile communication bandwidth. Finally, it uses a novel scheduling algorithm to execute clusters on crossbars of the hardware, guaranteeing hardware performance. We evaluate DFSynthesizer with 10 commonly used machine learning programs. Our results demonstrate that DFSynthesizer provides a much tighter performance guarantee compared to current mapping approaches.

Computer Science↗

Link Scheduling in Satellite Networks via Machine Learning Over Riemannian Manifolds

Low Earth Orbit (LEO) satellites play a crucial role in enhancing global connectivity, serving a complementary solution to existing terrestrial systems. In wireless networks, scheduling is a vital process that allocates time-frequency resources to users for interference management. However, LEO satellite networks face significant challenges in scheduling their links towards ground users due to the satellites’ mobility and overlapping coverage. This paper addresses the dynamic link scheduling problem in LEO satellite networks by considering spatio-temporal correlations introduced by the satellites’ movements. The first step in the proposed solution involves modeling the network over Riemannian manifolds, thanks to their representation as symmetric positive definite matrices. We introduce two machine learning (ML)-based link scheduling techniques that model the dynamic evolution of satellite positions and link conditions over time and space. To accurately predict satellite link states, we present a recurrent neural network (RNN) over Riemannian manifolds, which captures spatio-temporal characteristics over time. Furthermore, we introduce a separate model, the convolutional neural network (CNN) over Riemannian manifolds, which captures geometric relationships between satellites and users by extracting spatial features from the network topology across all links. Simulation results demonstrate that both RNN and CNN over Riemannian manifolds deliver comparable performance to the fractional programming-based link scheduling (FPLinQ) benchmark. Remarkably, unlike other ML-based models that require extensive training data, both models only need 30 training samples to achieve over 99% of the sum rate while maintaining similar computational complexity relative to the benchmark.

42 ENGINEERING↗

Resilience-based Recovery Scheduling of Transportation Network in Mixed Traffic Environment: A Deep-Ensemble-Assisted Active Learning Approach

Devising effective post-hazard recovery strategies is critical in enhancing the resilience of transportation networks (TNs). However, existing work does not consider the multiclass users’ travel behavior in network functionality quantification and the metaheuristic solution procedures often suffer from extensive computational burden due to the exploration need in large solution space and the expensive functionality quantification. Here, this study develops a bilevel decision-making framework for the resilience-based recovery scheduling of the TN in a mixed traffic environment with connected and autonomous vehicles (CAVs) and human-driven vehicles (HDVs). The lower level quantifies the TN's functionality over time considering different travel behavior of CAV and HDV users arisen from their different levels of information perception. The upper level presents a novel deep-ensemble-assisted active learning approach to balance optimization performance and computational cost. This framework can help decision makers better quantify the TN's functionality to support effective recovery scheduling of TN with different mixed traffic scenarios ranging from HDV-only to future CAV-dominant traffic. The optimization approach bears the potential to be extended to solving general large-scale network recovery scheduling problems effectively and efficiently. The proposed methodology is demonstrated using a real-world traffic network in Southern California under earthquake considering deterministic and stochastic repair durations.

42 ENGINEERING↗

Going Forward with the Nancy Grace Roman Space Telescope Transient Survey: Validation of Precision Forward-modeling Photometry for Undersampled Imaging

The Nancy Grace Roman Space Telescope (Roman) is an observatory for both wide-field observations and coronagraphy that is scheduled for launch in the mid-2020s. Part of the planned survey is a deep, cadenced field or fields that enable cosmological measurements with type Ia supernovae (SNe Ia). With a pixel scale of 0$_.^"$11, the Wide Field Instrument will be undersampled, presenting a difficulty for precisely subtracting the galaxy light underneath the SNe. We use simulated data to validate the ability of a forward-model code (such codes are frequently also called “scene-modeling” codes) to perform precision supernova photometry for the Roman SN survey. Our simulation includes over 760,000 image cutouts around SNe Ia or host galaxies (~10% of a full-scale survey). To have a realistic 2D distribution of underlying galaxy light, we use the VELA simulated high-resolution images of galaxies. We run each set of cutouts through our forward-modeling code which automatically measures time-dependent SN fluxes. Given our assumed inputs of a perfect model of the instrument point-spread functions and calibration, we find biases at the millimagnitude level from this method in four red filters (Y106, J129, H158, and F184), easily meeting the 0.5% Roman inter-filter calibration requirement for a cutting-edge measurement of cosmological parameters using SNe Ia. Simulated data in the bluer Z087 filter shows larger ~ 2–3 mmg biases, also meeting this requirement, but with more room for improvement. Our forward-model code has been released on Zenodo.

79 ASTRONOMY AND ASTROPHYSICS↗