Search NASA⌕ Search

SEARCH · Search NASA

Results for “data ordering”

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 163 records · Page 9

Efficient Space–Time Reduced Order Model for Linear Dynamical Systems in Python Using Less than 120 Lines of Code

A classical reduced order model (ROM) for dynamical problems typically involves only the spatial reduction of a given problem. Recently, a novel space–time ROM for linear dynamical problems has been developed [Choi et al., Space–tume reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems, Journal of Computational Physics, 2020], which further reduces the problem size by introducing a temporal reduction in addition to a spatial reduction without much loss in accuracy. The authors show an order of a thousand speed-up with a relative error of less than 10−5 for a large-scale Boltzmann transport problem. In this work, we present for the first time the derivation of the space–time least-squares Petrov–Galerkin (LSPG) projection for linear dynamical systems and its corresponding block structures. Utilizing these block structures, we demonstrate the ease of construction of the space–time ROM method with two model problems: 2D diffusion and 2D convection diffusion, with and without a linear source term. For each problem, we demonstrate the entire process of generating the full order model (FOM) data, constructing the space–time ROM, and predicting the reduced-order solutions, all in less than 120 lines of Python code. We compare our LSPG method with the traditional Galerkin method and show that the space–time ROMs can achieve O(10−3) to O(10−4) relative errors for these problems. Depending on parameter–separability, online speed-ups may or may not be achieved. For the FOMs with parameter–separability, the space–time ROMs can achieve O(10) online speed-ups. Finally, we present an error analysis for the space–time LSPG projection and derive an error bound, which shows an improvement compared to traditional spatial Galerkin ROM methods.

97 MATHEMATICS AND COMPUTING↗

Partner with a Third-Party Delivery Service or Not? A Prediction-and-Decision Tool for Restaurants Facing Takeout Demand Surges During a Pandemic

Amidst the COVID-19 pandemic, restaurants become more reliant on no-contact pick-up or delivery ways for serving customers. As a result, they need to make tactical planning decisions such as whether to partner with online platforms, to form their own delivery team, or both. In this paper, we develop an integrated prediction-decision model to analyze the profit of combining the two approaches and to decide the needed number of drivers under stochastic demand. We first use the susceptible-infected-recovered (SIR) model to forecast future infected cases in a given region and then construct an autoregressive-moving-average (ARMA) regression model to predict food-ordering demand. Using predicted demand samples, we formulate a stochastic integer program to optimize food delivery plans. We conduct numerical studies using COVID-19 data and food-ordering demand data collected from local restaurants in Nuevo Leon, Mexico, from April to October 2020, to show results for helping restaurants build contingency plans under rapid market changes. Our method can be used under unexpected demand surges, various infection/vaccination status, and demand patterns. Here, our results show that a restaurant can benefit from partnering with third-party delivery platforms when (i) the subscription fee is low, (ii) customers can flexibly decide whether to order from platforms or from restaurants directly, (iii) customers require more efficient delivery, (iv) average delivery distance is long, or (v) demand variance is high.

97 MATHEMATICS AND COMPUTING↗

Computational Tools and Workflows for Quantitative Risk Assessment and Decision Support for Geologic Carbon Storage Sites: Progress and Insights from the U.S. DOE’s National Risk Assessment Partnership

The 2005 Intergovernmental Panel on Climate Change (IPCC) Special Report on CCS raised the profile of CO2 capture and storage (CCS) as an important technology for reducing greenhouse gas (GHG) emissions. CCS is now recognized as a key component of most climate change mitigation scenarios. Since publication of that report the international research, development, and deployment (RD&D) community has advanced key technical aspects, clarified regulatory requirements, explored value chain and infrastructure solutions, and developed incentive paradigms to enable and promote large-scale deployment of CCS. These efforts have included research to better characterize geologic storage resources, to improve injection performance and storage efficiency, to assess and manage subsurface environmental risks, and to advance monitoring technologies to assure system conformance. These efforts have helped to build confidence in the viability of geologic carbon storage (GCS), but stakeholder concerns about long-term risks and liability associated with GCS remain a hurdle to broad acceptance and large-scale deployment of CCS. Since 2010, the U.S. DOE’s National Risk Assessment Partnership (NRAP) – a research collaboration between five contributing national laboratories – has worked to establish and demonstrate methods and tools to quantify and manage the subsurface environmental risks associated with GCS, amidst uncertainty. This work supports the Office of Fossil Energy and Carbon Management Carbon Transport and Storage Program’s goal of advancing safe and secure commercial-scale GCS deployment. To address the technical challenge of simulating the physical response of the GCS site to large-scale CO2 injection, NRAP has adopted an approach that relies on coupling computationally efficient reduced-order and/or data-driven proxy models of important system components (i.e., storage reservoir, sealing caprock, leakage pathways, intermediate formations, overlying groundwater aquifers, and the atmosphere) in integrated assessment framework. That integrated model of the physical system is complemented with fit-for purpose functionality to support site characterization and risk-related decisions. The recently released NRAP Phase II toolset includes the Open-Source Integrated Assessment Model (NRAP-Open-IAM) for evaluation of trends in leakage risk and potential impact, tools to support monitoring design optimization (Designs for Risk Evaluation and Management – DREAM v3.0 and Passive Seismic Monitoring Tool - PSMT), and tools for state of stress evaluation (State-of-Stress Analysis Tool - SOSAT) and forecasting induced seismicity risk. The NRAP team has also released a pair of reports describing conceptual workflows to incorporate physics-based, quantitative risk assessment into many of the design, planning, operation, and closure decisions for GCS projects. An online catalogue highlights published studies where these tools and methods are demonstrated. In this presentation, the utility of these products to assess risks and address key stakeholder questions will be highlighted through examples, and related insights about the safety and security of geologic carbon storage in qualified storage sites will be discussed. The prospect of rapid, large-scale deployment of GCS technology to aggressively reduce anthropogenic CO2 emissions requires careful consideration of interference between multiple commercial-scale storage projects within a basin. Going forward, NRAP is expanding and adapting site-scale risk quantification tools and methods to enable assessment of risks and inform management decisions for basin-scale deployment. Increasingly, this work will leverage next-generation approaches for surrogate modelling, fast prediction, and advanced visualization enabled by machine learning and artificial intelligence to promote virtual learning, scenario evaluation, and augment risk-based decision making.

quantitative risk assessment, geologic carbon stor↗

Multidecadal Biological Monitoring and Abatement Program assessing human impacts on aquatic ecosystems within the Oak Ridge Reservation in eastern Tennessee, USA

Human activities can be powerful drivers of ecosystem change within catchments. While most long-term catchment studies have been conducted at pristine sites, such studies are less common from sites more impacted by human activity. The Oak Ridge National Laboratory's Biological Monitoring and Abatement Program (BMAP) was developed in the mid-1980s to (1) assess compliance with environmental regulations, (2) identify causes of adverse ecological impacts, (3) provide data for human and ecological risk assessments, and (4) evaluate the effectiveness of remedial actions taken to mitigate the impacts of contaminants in soils, groundwater, and surface water by documenting ecological recovery on the Oak Ridge Reservation (ORR), a federally owned 33,476-acre site in eastern Tennessee, USA, managed by the U.S. Department of Energy. The ORR is composed of multiple watersheds containing many small to mid-size streams. BMAP uses an integrated approach for determining stream health; its databases include long-term seasonal records of contaminant concentrations in water and biota, data from aquatic toxicity testing, and surveys of macroinvertebrate and fish assemblages from impacted and reference streams. These long-term data provide valuable records of degradation and recovery in catchment ecosystems. Our objective in this work is to describe our study system and data series in order to increase awareness of the availability of these long-term data to the catchment science community.

54 ENVIRONMENTAL SCIENCES↗

A case study on parallel HDF5 dataset concatenation for high energy physics data analysis

In High Energy Physics (HEP), experimentalists generate large volumes of data that, when analyzed, helps us better understand the fundamental particles and their interactions. This data is often captured in many files of small size, creating a data management challenge for scientists. In order to better facilitate data management, transfer, and analysis on large scale platforms, it is advantageous to aggregate data further into a smaller number of larger files. However, this translation process can consume significant time and resources, and if performed incorrectly the resulting aggregated files can be inefficient for highly parallel access during analysis on large scale platforms. In this paper, we present our case study on parallel I/O strategies and HDF5 features for reducing data aggregation time, making effective use of compression, and ensuring efficient access to the resulting data during analysis at scale. We focus on NOvA detector data in this case study, a large-scale HEP experiment generating many terabytes of data. Here, the lessons learned from our case study inform the handling of similar datasets, thus expanding community knowledge related to this common data management task.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Mitigate: An Adaptive Network Data Anonymization Tool Using Condensation-Based Differential Privacy

Modern network devices collect a large amount of data that can be analyzed to identify bottlenecks, anomalies, cyber-attacks, etc. Therefore, there is often a need to analyze such collections of network data quite often by an external expert or by the research community. However, these collections of data contain sensitive, proprietary information. In order for the network data to be shared, it must first be anonymized. The overall objective of this project is to develop an innovative privacy management tool to anonymize network data and achieve sufficient privacy, acceptable data utility, and efficient data analysis at the same time. No existing anonymization methods can achieve all of these at the same time. The core of this technology is a differential private clustering algorithm that provides strong privacy protection, preserves data properties important for subsequent analysis, and allows the party receiving the anonymized data to conduct analysis directly on anonymized data without the need of decryption or any extra processing. The research carried out was to design, implement and verify a solution to this problem by completing the following tasks: 1) developing the core technology; 2) developing a context based method that automatically recommends fields that must be anonymized; 3) conducted experiments showing superior results using our approach compared to existing tools, and 4) developed an intuitive but basic user interface. The research that was conducted generated novel algorithmic techniques that utilize state-of-the-art methods such as condensation, differential privacy preservation, clustering, automated tuning based on contextual awareness, and recommendation techniques to specify columns to users for anonymization leading to optimal privacy that allows research analysis on the dataset. Experiments were conducted to evaluate the efficacy of these novel algorithmic techniques by performing analysis on original non-anonymized datasets, then conducting analysis on the same yet anonymized datasets and comparing the results of the analyses. Overall, the anonymized analysis results were within 1% of the original results, verifying that the generated technology not only guarantees a high level of privacy but also enables research analysis as if it were conducted on the original dataset. Potential applications of this technology include anonymization of any type of structured network datasets that contain sensitive identifiers, such as IP addresses, that can be used in multiple applications. For example, to create an AI or machine learning model for cyber security, e.g., to detect attacks, or for performance analysis, e.g., identify bottlenecks or predict performance. In addition, a market analysis that was conducted for potential applications of this technology identified a broader range of applications of our anonymization technology beyond the network sector that includes healthcare, banking, insurance, securities, finance (FISB), data brokering, cloud services, ad sales, and government.

97 MATHEMATICS AND COMPUTING↗

Differential Organic Carbon Mineralization Responses to Soil Moisture in Three Different Soil Orders Under Mixed Forested System: Supporting Data

This data contains data from 90-day long incubation study which aimed to look at the soil moisture-texture relationship on soil organic carbon (SOC) cycling. Soils were collected from three distinct soil textures from mixed forests in 2017: sandy (Georgia, 2017-05-01), loamy (Missouri, 2017-06-14) and clayey (Texas, December 2017) were incubated at different soil moisture levels (air-dried, 25% water holding capacity (WHC), 50% WHC, 100% WHC and 175% WHC) at room temperature for a period of 90 days. Files contain microbial respiration, active and slow SOC pools, and their respective mineralization rates, extractable organic carbon (C), and C-acquiring extracellular enzymes. Findings from these data were used in Singh et al. (2021). This study aimed to examine the interactive effect of soil moisture and texture on SOC mineralization. Soil samples of three distinct textures (sandy, loamy, and clayey) were collected from mixed forests of Georgia, Missouri, and Texas, respectively. Soil cores of 5 cm diameter were collected from numerous random locations at each site from 0-15 cm depth after scraping the litter layer and mixed thoroughly to obtain a composite sample per site. Three additional soil cores were collected to determine the WHC using pressure plate extractors. Soil samples were composited, and triplicate soil samples were incubated in mason jars for a period of 90 days at room temperature under different moisture regimes: air dried, 25% WHC, 50% WHC, at WHC and 100% saturation. Soil respiration was measured weekly, and destructive sampling was conducted at 1, 15, 60, and 90 days to determine extractable organic C, C acquiring enzyme activity, and active and slow SOC pools with their respective mineralization rates. The C acquiring enzyme activity was the total activity of α-glucosidase, β-glucosidase, cellobiohydrolase, and β-xylosidase enzymes. Gas samples for microbial respiration measurements were collected from headspace of incubation jars through the sampling ports on the lids and then analyzed using a Shimadzu Gas Chromatograph (GC-2014). Prior to sampling, the vials were evacuated. Blank correction was also done by collecting gas samples from empty incubation jars. Double pool exponential decay model was used in SigmaPlot to determine the active and slow SOC pools and their mineralization rates (Farrar et al., 2012; Jagadamma et al., 2014). The C-acquiring extracellular enzymes were measured using the microplate method by German et al., (2011). Microbial community structure was determined using the phospholipid fatty acid (PLFA) and neutral lipid fatty acid (NLFA) analyses (Buyer and Sasser, 2012). This dataset has seven data files provided in comma-separate (*.csv) format. Additional metadata are provided: seven data dictionaries and a file-level metadata file in comma separate (*.csv) format and a user guide in PDF (*.pdf) format.

Carbon acquiring enzyme activity↗

Updates to the ATLAS Data Carousel Project

The High Luminosity upgrade to the LHC (HL-LHC) is expected to deliver scientific data at the multi-exabyte scale. In order to address this unprecedented data storage challenge, the ATLAS experiment launched the Data Carousel project in 2018. Data Carousel is a tape-driven workflow whereby bulk production campaigns with input data resident on tape are executed by staging and promptly processing a sliding window to disk buffer such that only a small fraction of inputs are pinned on disk at any one time. Data Carousel is now in production for ATLAS in Run3. In this paper, we provide updates on recent Data Carousel R&D projects, including data-on-demand and tape smart writing. Data-on-demand removes from disk data that has not been accessed for a predefined period, when users request them, they will be either staged from tape or recreated by following the original production steps. Tape smart writing employs intelligent algorithms for file placement on tape in order to retrieve data back more efficiently, which is our long term strategy to achieve optimal tape usage in Data Carousel.

42 ENGINEERING↗

Photometric calibration in u -band using blue halo stars

ABSTRACT We develop a method to calibrate u-band photometry based on the observed colour of blue Galactic halo stars. The Galactic halo stars belong to an old stellar population of the Milky Way and have relatively low metallicity. The ‘blue tip’ of the halo population – the main sequence turn-off (MSTO) stars – is known to have a relatively uniform intrinsic edge u-g colour with only slow spatial variation. In SDSS data, the observed variation is correlated with Galactic Latitude, which we attribute to contamination by higher metallicity disc stars and fit with an empirical curve. This curve can then be used to calibrate u-band imaging if g-band imaging of matching depth is available. Our approach can be applied to single-field observations at |b| > 30°, and removes the need for standard star observations or overlap with calibrated u-band imaging. We include in our method the calibration of g-band data with ATLAS-Refcat2. We test our approach on stars in KiDS DR 4, ATLAS DR 4, and DECam imaging from the NOIRLab Source Catalog (NSC DR2), and compare our calibration with SDSS. For this process, we use synthetic magnitudes to derive the colour equations between these data sets, in order to improve zero-point accuracy. We find an improvement for all data sets, reaching a zero-point precision of 0.016 mag for KiDS (compared to the original 0.033 mag), 0.020 mag for ATLAS (originally 0.027 mag), and 0.016 mag for DECam (originally 0.041 mag). Thus, this method alone reaches the goal of 0.02 mag photometric precision in u-band for the Rubin Observatory’s Legacy Survey of Space and Time (LSST).

79 ASTRONOMY AND ASTROPHYSICS↗

Singleton Sieving: Overcoming the Memory/Speed Trade-Off in Exascale k-mer Analysis

Traditional filter data structures, such as Bloom filters, do not offer necessary features that modern high-performance data analytics applications need in order to efficiently perform complex data analysis tasks. For example, MetaHipMer, a de novo metagenome assembler, can use filters to weed out singleton k-mers and reduce memory usage by 30%-70%. However, the filter needs the ability to associate values with k-mers in order to perform the analysis in a single communication pass. Bloom filters do not support value associations and cause the application to perform an extra communication pass, thereby increasing the run time. Therefore, MetaHipMer faces a trade off between memory and speed due to the limited capabilities of traditional filters. In this paper, we overcome the memory and speed trade off in MetaHipMer by integrating a GPU-based feature-rich filter, the Two-Choice filter (TCF), in the MetaHipMer pipeline. The TCF uses key-value association to approximately store k-mers with extensions. This allows MetaHipMer to perform k-mer analysis on the GPUs in a single communication pass. Our empirical analysis shows a 50% reduction in memory usage in k-mer analysis on each node in MetaHipMer without any effect on the overall run time or assembly quality. The memory reduction in turn results in a 43% reduction in the number of nodes required to assemble datasets and enables MetaHipMer to scale to much larger datasets.

McCoy, Hunter↗

Reduced order modeling for flow and transport problems with Barlow Twins self-supervised learning

Abstract We propose a unified data-driven reduced order model (ROM) that bridges the performance gap between linear and nonlinear manifold approaches. Deep learning ROM (DL-ROM) using deep-convolutional autoencoders (DC–AE) has been shown to capture nonlinear solution manifolds but fails to perform adequately when linear subspace approaches such as proper orthogonal decomposition (POD) would be optimal. Besides, most DL-ROM models rely on convolutional layers, which might limit its application to only a structured mesh. The proposed framework in this study relies on the combination of an autoencoder (AE) and Barlow Twins (BT) self-supervised learning, where BT maximizes the information content of the embedding with the latent space through a joint embedding architecture. Through a series of benchmark problems of natural convection in porous media, BT–AE performs better than the previous DL-ROM framework by providing comparable results to POD-based approaches for problems where the solution lies within a linear subspace as well as DL-ROM autoencoder-based techniques where the solution lies on a nonlinear manifold; consequently, bridges the gap between linear and nonlinear reduced manifolds. We illustrate that a proficient construction of the latent space is key to achieving these results, enabling us to map these latent spaces using regression models. The proposed framework achieves a relative error of 2% on average and 12% in the worst-case scenario (i.e., the training data is small, but the parameter space is large.). We also show that our framework provides a speed-up of $$7 \times 10^{6}$$ 7 × 10 6 times, in the best case, and $$7 \times 10^{3}$$ 7 × 10 3 times on average compared to a finite element solver. Furthermore, this BT–AE framework can operate on unstructured meshes, which provides flexibility in its application to standard numerical solvers, on-site measurements, experimental data, or a combination of these sources.

97 MATHEMATICS AND COMPUTING↗

An Overview of Gemma FY20 Verification Activities

Gemma verification activities for FY20 can be divided into three categories: the development of specialized quadrature rules, initial progress towards the development of manufactured solutions for code verification, and automated code-verification testing. In the method-of-moments implementation of the electric-field integral equation, the presence of a Green’s function in the four-dimensional integrals yields singularities in the integrand when two elements are nearby. To address these challenges, we have developed quadrature rules to integrate the functions through which the singularities can be characterized. Code verification is necessary to develop confidence in the implementation of the numerical methods in Gemma. Therefore, we have begun investigating the use of manufactured solutions to more thoroughly verify Gemma. Manufactured solutions provide greater flexibility for testing aspects of the code; however, the aforementioned singularities provide challenges, and existing work is limited in rigor and quantity. Finally, we have implemented automated code-verification testing using the VVTest framework to automate the mesh refinement and execution of a Gemma simulation to generate mesh convergence data. This infrastructure computes the observed order of accuracy from these data and compares it with the theoretical order of accuracy to either develop confidence in the implementation of the numerical methods or detect coding errors.

97 MATHEMATICS AND COMPUTING↗

OpenSesame tutorial

OpenSesame is a program for generating tabular equations of state (EOS), with capabilities for multiphase EOS construction. In this tutorial, we provide an overview of how to run OpenSesame to construct a multiphase EOS. We discuss some general features of OpenSesame, followed by a description of sample input files required for multiphase EOS construction. We also discuss how to extract data from EOS tables in order to compare to experimental data, with an example using the OpenSesame GUI. Lastly, we provide a description of how to generate ASCII-formatted EOS tables most often used by hydro code users.

97 MATHEMATICS AND COMPUTING↗

Extending and Smoothing Two-dimension Equation of State Simulation Data

The Multiphase Equation of State (MEOS) project works to produce high quality equation of state tables which are used in computationally intensive simulations of materials in different conditions. An equation of state table describes the state of matter under certain physical conditions such as pressure, volume, temperature, or internal energy. MEOS uses many different models and combinations thereof to produce accurate tables consisting of continuous smooth data, derivatives, and higher-order derivatives. Accurate and smooth data are important factors in producing precise simulations. This report focuses on improving the electron tables produced from Purgatorio and Thomas-Fermi data. Purgatorio data is extremely accurate but often jagged and discontinuous in the lower temperature and density region. Thomas-Fermi is a model that provides smooth data throughout. Together, this produces an EOS data table that is both accurate and smooth. This report describes the implementation of a new feature that allows users to define more detailed regions in the Purgatorio table to be replaced with Thomas-Fermi. As a result, MEOS can generate a table that is both more smooth and still accurate.

97 MATHEMATICS AND COMPUTING↗

Development of a cosmic ray oriented trigger for the fluorescence telescope on EUSO-SPB2

The Extreme Universe Space Observatory on a Super Pressure Balloon 2 (EUSO-SPB2), in preparation, aims to make the first observations of Ultra-High Energy Cosmic Rays (UHECRs) from near space using optical techniques. EUSO-SPB2 will prototype instrumentation for future satellite-based missions, including the Probe of Extreme Multi-Messenger Astrophysics (POEMMA) and K-EUSO. The payload will consist of two telescopes. The first is a Cherenkov telescope (CT) being developed to quantify the background for future below-the-limb very high energy (E 10 PeV) astrophysical neutrino observations, and the second is a fluorescence telescope (FT) being developed for detection of UHECRs. The FT will consist of a Schmidt telescope, and a 6192 pixel ultraviolet camera with an integration time of 1.05 s. The first step in the data acquisition process for the FT is a hardware level trigger in order to decide which data to record. In order to maximize the number of UHECR induced extensive air showers (EASs) which can be detected, a novel trigger algorithm has been developed based on the intricacies and limitations of the detector. Finally, the expected performance of the trigger has been characterized by simulations and, pending hardware verification, shows that EUSO-SPB2 is well positioned to attempt the first near-space observation of UHECRs via optical techniques.

79 ASTRONOMY AND ASTROPHYSICS↗

The Alcock–Paczynski effect from Lyman- α forest correlations: analysis validation with synthetic data

The three-dimensional distribution of the Ly α forest has been extensively used to constrain cosmology through measurements of the baryon acoustic oscillations (BAO) scale. However, more cosmological information could be extracted from the full shapes of the Ly α forest correlations through the Alcock–Paczynski (AP) effect. In this work, we prepare for a cosmological analysis of the full shape of the Ly α forest correlations by studying synthetic data of the extended Baryon Oscillation Spectroscopic Survey (eBOSS). We use a set of 100 eBOSS synthetic data sets in order to validate such an analysis. These mocks undergo the same analysis process as the real data. We perform a full-shape analysis on the mean of the correlation functions measured from the 100 eBOSS realizations, and find that our model of the Ly α correlations performs well on current data sets. We show that we are able to obtain an unbiased full-shape measurement of D M /D H (z eff ), where D M is the transverse comoving distance, D H is the Hubble distance, and z eff is the effective redshift of the measurement. We test the fit over a range of scales, and decide to use a minimum separation of r min = 25 h –1 Mpc. Here, we also study and discuss the impact of the main contaminants affecting Ly α forest correlations, and give recommendations on how to perform such analysis with real data. While the final eBOSS Ly α BAO analysis measured D M /D H (z eff = 2.33) with 4 per cent statistical precision, a full-shape fit of the same correlations could provide an $\sim 2~{{\ \rm per\ cent}}$ measurement.

79 ASTRONOMY AND ASTROPHYSICS↗

Weak-form latent space dynamics identification

Recent work in data-driven modeling has demonstrated that a weak formulation of model equations enhances the noise robustness of a wide range of computational methods. In this paper, we demonstrate the power of the weak form to enhance the LaSDI (Latent Space Dynamics Identification) algorithm, a recently developed data-driven reduced order modeling technique. We introduce a weak form-based version WLaSDI (Weak-form Latent Space Dynamics Identification). WLaSDI first compresses data, then projects onto the test functions and learns the local latent space models. Notably, WLaSDI demonstrates significantly enhanced robustness to noise. With WLaSDI, the local latent space is obtained using weak-form equation learning techniques. Compared to the standard sparse identification of nonlinear dynamics (SINDy) used in LaSDI, the variance reduction of the weak form guarantees a robust and precise latent space recovery, hence allowing for a fast, robust, and accurate simulation. We demonstrate the efficacy of WLaSDI vs. LaSDI on several common benchmark examples including viscid and inviscid Burgers', radial advection, and heat conduction. For instance, in the case of 1D inviscid Burgers' simulations with the addition of up to 100% Gaussian white noise, the relative error remains consistently below 6% for WLaSDI, while it can exceed 10,000% for LaSDI. Similarly, for radial advection simulations, the relative errors stay below 15% for WLaSDI, in stark contrast to the potential errors of up to 10,000% with LaSDI. Moreover, speedups of several orders of magnitude can be obtained with WLaSDI. For example applying WLaSDI to 1D Burgers' yields a 140X speedup compared to the corresponding full order model.

97 MATHEMATICS AND COMPUTING↗

Understanding collective human movement dynamics during large-scale events using big geosocial data analytics

Conventional approaches for modeling human mobility pattern often focus on human activity and movement dynamics in their regular daily lives and cannot capture changes in human movement dynamics in response to large-scale events. With the rapid advancement of information and communication technologies, many researchers have adopted alternative data sources (e.g., cell phone records, GPS trajectory data) from private data vendors to study human movement dynamics in response to large-scale natural or societal events. Big geosocial data such as georeferenced tweets are publicly available and dynamically evolving as real-world events are happening, making it more likely to capture the real-time sentiments and responses of populations. However, precisely-geolocated geosocial data is scarce and biased toward urban population centers. In this research, we developed a big geosocial data analytical framework for extracting human movement dynamics in response to large-scale events from publicly available georeferenced tweets. The framework includes a two-stage data collection module that collects data in a more targeted fashion in order to mitigate the data scarcity issue of georeferenced tweets; in addition, a variable bandwidth kernel density estimation(VB-KDE) approach was adopted to fuse georeference information at different spatial scales, further augmenting the signals of human movement dynamics contained in georeferenced tweets. To correct for the sampling bias of georeferenced tweets, we adjusted the number of tweets for different spatial units (e.g., county, state) by population. To demonstrate the performance of the proposed analytic framework, we chose an astronomical event that occurred nationwide across the United States, i.e., the 2017 Great American Eclipse, as an example event and studied the human movement dynamics in response to this event. Finally, this analytic framework can easily be applied to other types of large-scale events such as hurricanes or earthquakes.

54 ENVIRONMENTAL SCIENCES↗