Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “edge network”

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 721 records · Page 40

Resolving the Atomic Structure of Sequential Infiltration Synthesis Derived Inorganic Clusters

Sequential infiltration synthesis (SIS) is a route to the precision deposition of inorganic solids in analogy to atomic layer deposition but occurs within (vs upon) a soft material template. SIS has enabled exquisite nanoscale morphological complexity in various oxides through selective nucleation in block copolymers templates. However, the earliest stages of SIS growth remain unresolved, including the atomic structure of nuclei and the evolution of local coordination environments, before and after polymer template removal. We employed In K-edge extended X-ray absorption fine structure and atomic pair distribution function analysis of high-energy X-ray scattering to unravel (1) the structural evolution of InO x H y clusters inside a poly(methyl methacrylate) (PMMA) host matrix and (2) the formation of porous In 2 O 3 solids (obtained after annealing) as a function of SIS cycle number. Early SIS cycles result in InO x H y cluster growth with high aspect ratio, followed by the formation of a three-dimensional network with additional SIS cycles. That the atomic structures of the InO x H y clusters can be modeled as multinuclear clusters with bonding patterns related to those in In 2 O 3 and In(OH) 3 crystal structures suggests that SIS may be an efficient route to 3D arrays of discrete-atom-number clusters. As a result, annealing the mixed inorganic/polymer films in air removes the PMMA template and consolidates the as-grown clusters into cubic In 2 O 3 nanocrystals with structural details that also depend on SIS cycle number.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Incremental Threshold Scheme Enabled IoT Group Key Management

Cyber landscape evolves rapidly. Internet of Things (IoT) and Edge Computing (EC) have rapidly become an integral part of the modern computing infrastructure. It is expected that there will be more than 50 billion active and connected IoT devices by 2025 [1]. Pervasive IoT/EC creates unprecedented opportunities bridging the gap between previously segregated cyber and physical spaces. However, this progress also brings along new security challenges. IoT devices typically have limited computation, communication, and storage resources. This leads to security architecture designs such as using symmetric keys for group communication. While secure and efficient in stable network settings, symmetric key solutions are ill-adapted for IoT's highly dynamic device mobility behavior and frequent group membership turnover. Whenever IoT members leave a group, the known symmetric keys cannot be made forgotten, posing a serious vulnerability. This leads to frequent re-groupings that require expensive re-authentication, key regeneration, and key redistribution in order to maintain IoT/EC security. We present a novel symmetric key management framework that integrate an Incremental Threshold Scheme (ITS) cryptographical function into communication protocol's key rotation mechanism to allow for secure and efficient symmetric key communication group member node revocation. This ITS-enabled key management framework alleviates the need of frequent and expensive re-grouping and re-keying needed by today's large and dynamic IoT/EC operations. We further applied this ITS-enabled key management framework to a distributed IoT/EC-integrated publish and subscribe framework for applicability validation.

Li, Mingyan↗

Comparison of Remote Sensing and Fixed-Site Monitoring Approaches for Examining Air Pollution and Health in a National Study Population

Satellite remote sensing (RS) has emerged as a cutting edge approach for estimating ground level ambient air pollution. Previous studies have reported a high correlation between ground level PM2.5 and NO2 estimated by RS and measurements collected at regulatory monitoring sites. The current study examined associations between air pollution and adverse respiratory and allergic health outcomes using multi-year averages of NO2 and PM2.5 from RS and from regulatory monitoring. RS estimates were derived using satellite measurements from OMI, MODIS, and MISR instruments. Regulatory monitoring data were obtained from Canada's National Air Pollution Surveillance Network. Self-reported prevalence of doctor-diagnosed asthma, current asthma, allergies, and chronic bronchitis were obtained from the Canadian Community Health Survey (a national sample of individuals 12 years of age and older). Multi-year ambient pollutant averages were assigned to each study participant based on their six digit postal code at the time of health survey, and were used as a marker for long-term exposure to air pollution. RS derived estimates of NO2 and PM2.5 were associated with 6e10% increases in respiratory and allergic health outcomes per interquartile range (3.97 mg m3 for PM2.5 and 1.03 ppb for NO2) among adults (aged 20e64) in the national study population. Risk estimates for air pollution and respiratory/ allergic health outcomes based on RS were similar to risk estimates based on regulatory monitoring for areas where regulatory monitoring data were available (within 40 km of a regulatory monitoring station). RS derived estimates of air pollution were also associated with adverse health outcomes among participants residing outside the catchment area of the regulatory monitoring network (p < 0.05).

validation↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Non-Hermitian topological states in 2D line-graph lattices: evolving triple exceptional points on reciprocal line graphs

Non-Hermitian (NH) topological states, such as the doubly-degenerate nodes dubbed as exceptional points (EPs) in Bloch band structure of 2D lattices driven by gain and loss, have attracted much recent interest. We demonstrate theoretically that in the three-site edge-centered lattices, i.e. the so-called line-graph lattices, such as kagome lattice which is a line graph of hexagonal lattice, there exist three types of triply-degenerate EPs evolving intriguingly on another set of line graphs in the reciprocal space. A single TEP (STEP) with ±1/3 topological charge moves faithfully along the edges of reciprocal line graphs with varying gain and loss, while two STEPs merge distinctively into one unconventional orthogonal double TEP (DTEP) with ±2/3 charge at the vertices, which is characterized with two ordinary self-orthogonal eigenfunctions but one surprising 'orthogonal' eigenfunction. Differently, in a modified line-graph lattice with an off-edge-center site, the ordinary coalesced state of DTEPs emerges with three identical self-orthogonal eigenfunctions. Such NH states and their evolution can be generally realized in various artificial systems, such as photonic and sonic crystals, where light and sonic vortex beams with different fractional twisting can be found. Our findings shed new light on fundamental understanding of gapless topological states in NH systems in terms of creation and evolution of high-order EPs, and open up new research directions to further link line graph and flow network theory coupled with topological physics, especially under non-equilibrium gain/loss conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Use of Dual-Polarization Radar Variables to Assess Low-Level Wind Shear in Severe Thunderstorm Near-storm Environments in the Tennessee Valley

The upgrade of the National Weather Service (NWS) network of S ]band dual-polarization radars is currently underway, and the incorporation of polarimetric information into the real ]time forecasting process will enhance the forecaster fs ability to assess thunderstorms and their near ]storm environments. Recent research has suggested that the combination of polarimetric variables differential reflectivity (ZDR) and specific differential phase (KDP) can be useful in the assessment of low level wind shear within a thunderstorm. In an environment with strong low ]level veering of the wind, ZDR values will be largest along the right inflow edge of the thunderstorm near a large gradient in horizontal reflectivity (indicative of large raindrops falling with a relative lack of smaller drops), and take the shape of an arc. Meanwhile, KDP values, which are proportional to liquid water content and indicative of a large number of smaller drops, are maximized deeper into the forward flank precipitation shield than the ZDR arc as the smaller drops are being advected further from the updraft core by the low level winds than the larger raindrops. Using findings from previous work, three severe weather events that occurred in North Alabama were examined in order to assess the utility of these signatures in determining the potential for tornadic activity. The first case is from October 26, 2010, where a large number of storms indicated tornadic potential from a standard reflectivity and velocity analysis but very few storms actually produced tornadoes. The second event is from February 28, 2011, where tornadic storms were present early on in the event, but as the day progressed, the tornado threat transitioned to a high wind threat. The third case is from April 27, 2011, where multiple rounds of tornadic storms ransacked the Tennessee Valley. This event provides a dataset including multiple modes of tornadic development, including QLCS and supercell structures. The overarching goal of examining these three events is to compare dual ]polarization features from this larger dataset to previous work and to determine if these signatures can be a useful indication of the potential for tornadic activity associated with the amount of low ]level wind shear in the near ]storm environment.

Crowe, Christina C.↗

Jay : A software framework for prototyping and evaluating offloading applications in hybrid edge clouds

Abstract We present Jay , a software framework for offloading applications in hybrid edge clouds. Jay provides an API, services, and tools that enable mobile application developers to implement, instrument, and evaluate offloading applications using configurable cloud topologies, offloading strategies, and job types. We start by presenting Jay 's job model and the concrete architecture of the framework. We then present the programming API with several examples of customization. Then, we turn to the description of the internal implementation of Jay instances and their components. Finally, we describe the Jay Workbench, a tool that allows the setup, execution, and reproduction of experiments with networks of hosts with different resource capabilities organized with specific topologies. The complete source code for the framework and workbench is provided in a GitHub repository.

Silva, Joaquim↗

Enhancing the Survivability of Power Systems With Grid-Edge DERs Against DoS Attacks

Power system survivability, defined as the ability of a system to maintain steady-state functionality under varying operational conditions, reflects its resilience against disturbances. While existing research primarily focuses on physical-layer disturbances, the increasing prevalence of grid-edge DERs, which are primarily used for integrating renewable energy, has significantly expanded the cyber attack surface. As a result, operational disruptions caused by cyber threats are posing significant challenges to system survivability and cannot be overlooked. To fill this gap, we redefine system survivability to incorporate the cyber layer’s status and propose a Distributionally Robust Optimization (DRO) approach to enhance power system survivability against potential cyber-physical threats. In this paper, we first analyze the operational guidelines of systems with a high penetration of DERs under various cyber network conditions and redefine survivability in this context. Next, we focus on the most common cyber threat, Denial-of-Service (DoS) attacks, and develop a corresponding attack model. This model allows for the creation of a kernel-based ambiguity set that captures attack uncertainties using historical data. Finally, we transform the proposed DRO model as a tractable optimization problem, with its solution providing an optimal cyber redundancy plan to enhance system survivability in DoS attack scenarios. Simulation results on the IEEE 13-node and 123-node test feeders demonstrate the effectiveness of our proposed model in improving system survivability. This model can also be expanded to include other types of common attacks and serve as a comprehensive planning tool to improve overall cyber physical survival of the system.

cybersecurity↗

Time-dependent aerodynamic analysis of ducted and unducted propfans at angle of attack

A three-dimensional unsteady aerodynamic analysis is described for predicting the time-dependent flow about ducted and unducted propfans operating at angle of attack. Although the freestream is assumed to be uniform, the flow relative to the rotating blades varies with circumferential position, resulting in an inherent unsteadiness due to the nonaxial inflow. The time-dependent Euler equations are solved utilizing a Runge-Kutta time-stepping scheme. The analysis is based on a finite-volume discretization employing a multiple-block grid network. To permit the use of large calculation time steps, an implicit residual smoothing scheme previously tested for unsteady flow calculations in two dimensions is extended to three spatial dimensions. For unducted propfans, a single H-type grid block is used for each blade passage to determine the time-periodic flowfield. For ducted propfans (ultra-high bypass fans) a body-centered C-type grid is wrapped about the cowl to improve the accuracy of the analysis in the high gradient flow region near the cowl leading edge. Numerical results are compared with available data for both ducted and unducted propfans operating at angle of attack.

Hall, Edward J.↗

The spatial distribution of ionospheric threats to WAAS integrity, 2000 – 2019: a systematic analysis

The United States’ Wide Area Augmentation System (WAAS) broadcasts data to facilitate aircraft navigation. This paper examines the spatial dependence of ionospheric disturbances that have threatened the accuracy and reliability of position estimates derived from these data over the period 2000 – 2019. We address two distinct aspects of this spatial dependence: (1) the geographic distribution of these threats, in particular, in relation to geomagnetic latitude, and (2) the geometric dependence of threats relative to the locations of the receiver sites that comprise the WAAS network. We analyze threat distributions in terms of the various means that WAAS employs to mitigate these threats, including the Extreme Storm Detector, the Moderate Storm Detector, local irregularity detectors, and the ionospheric threat model. Distinct distributions are presented for threats occurring in Solar Cycle 23 and those of Solar Cycle 24. To study the geometric dependence of threats on receiver locations, we use as a metric the distance separating a threat from the centroid of the nearest Ncentroid receivers. Large values of this metric identify threats at or beyond the edge of coverage. We conclude by discussing the implications of our results for WAAS operations.

Altshuler, Eric↗

Predicting Geologic Behavior in Carbon Storage Projects Using Graph Neural Network

This study was invited to presented at NVIDIA's GTC conference to highlight the potential of Graph Neural Network as a novel and promising methodology for predicting pressure and saturation evolution in carbon storage projects. Carbon capture and storage (CCS) technology plays a pivotal role in mitigating greenhouse gas emissions, facilitating the transition to a low-carbon future. Effective management of subsurface reservoirs is essential to ensure the safe and efficient storage of captured carbon dioxide (CO₂). Accurate predictions of pressure and saturation over time are critical for evaluating the long-term performance and integrity of CCS projects. In recent years, Graph Neural Network (GNN) has emerged as a powerful framework for analyzing complex data in graph-structured domains. This abstract explores the application of GNN to forecast pressure and saturation evolution in carbon storage projects. Traditional numerical simulations of subsurface reservoirs have proven successful in providing pressure and saturation forecasts. However, these simulations involve massive amounts of computational effort and require extensive domain expertise for proper model calibration and validation. Graph Neural Operator offers an alternative approach that harnesses the inherent graph structure of reservoirs, where nodes represent reservoir grid cells and edges represent the geological connectivity between them.

Shih, Chung Yan↗

CHESS 2025: Waveform LiDAR data from NEON AOP surveys

This dataset provides Level 1 (L1) full-waveform light detection and ranging (LiDAR) data collected for the 2025 Colorado Headwaters Ecological Spectroscopy Study (CHESS). These data were acquired to enable characterization of vegetation structure and other three-dimensional features of the land surface, and to evaluate structural changes that may have occurred between a prior LiDAR acquisition in 2018 and the 2025 overflight. Waveform LiDAR data can provide more detailed information about objects on the ground than discrete point clouds typically do, and they are often used for granular target segmentation and characterization of subcanopy vegetation. The data were acquired over three study domains in the Upper Gunnison river basin: the upper East River watershed (CRBU); Almont Triangle and Taylor Canyon (ALMO); and Upper Taylor River watershed (UPTA) between 2025-06-13 and 2025-07-15. LiDAR data were acquired using the Optech Galaxy Prime Airborne LiDAR Terrain Mapper onboard the National Ecological Observatory Network (NEON) Airborne Observation Platform (AOP). These are the primary waveform LiDAR data delivered by NEON and are provided per flightline in compressed Pulsewaves format, an open-source binary file standard. A Pulsewaves object comprises a two files: a pulse (.pls) file, which stores the geographic origin, outgoing vector, and metadata for every laser pulse emitted by the scanner, and a wave file (.wvs), which stores the sequential amplitude samples of the outgoing pulse and the returning signals. The files are published here in their compressed forms (.plz, .wvz). All waveform data were processed following the theoretical workflow described in the NEON L0-to-L1 Waveform LiDAR Algorithm Theoretical Basis Document (Krause and Goulden 2022a); however, the Pulsewaves output format differs from a legacy format described in that document. Waveform amplitude samples are recorded at 1 nanosecond intervals. All coordinates are provided in meters. Horizontal coordinates are referenced in Universal Transverse Mercator (UTM) zone 13N and the World Geodetic System (WGS) 1984 ensemble datum. Elevations are referenced to Geoid12A. Waveform data for the UPTA survey area were collected without incident and the published records are complete. However, both the ALMO and CRBU collections experienced issues that resulted in incomplete data for those areas. On collection day 2018-06-16 a hardware failure caused the waveform digitizer to lose data from the eastern edge of the ALMO site (Figure 22). The waveform data for flightlines 2–20 could not be extracted from the digitizer, and the data proved unrecoverable. As a result, a portion of the site does not have coverage with waveform data. Although no hardware failure was observed during collection over the CRBU area, final waveform files generated by vendor software contained only ~25% of the expected number of return pulses. After discovery, NEON initiated troubleshooting with the vendor. The root cause of the data ablation had not been identified at the time of publication. Additional data will be published in an update to this package if further recovery proves successful. CHESS Project Description: The Colorado Headwaters Ecological Spectroscopy Study (CHESS) comprised a multi-week airborne remote sensing and field observation campaign in the Upper Gunnison Basin, Colorado, conducted in June and July of 2025. Airborne remote sensing was conducted by the National Ecological Observatory Network Airborne Observation Platform (NEON AOP), concurrent with a field campaign run by the Rocky Mountain Biological Laboratory (RMBL), the Lawrence Berkeley National Laboratory (LBNL) and SLAC National Accelerator Laboratory Watershed Function Science Focus Area (SFA), and NASA-JPL (Jet Propulsion Laboratory) Earth Surface Mineral Dust Source Investigation (EMIT) program. Between June 10 and July 18, 2025, the NEON AOP flight team collected high-resolution aerial imaging spectroscopy and Light Detection and Ranging (LiDAR) data over three domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). In coordination with the flights, a field campaign acquired ground-truth observations, including observations of vegetation composition, foliar traits, forest demography, and subsurface properties in 18 core sampling areas within the domains. Additional surface water observations were taken at over 380 point locations. All CHESS campaign datasets can be found within the CHESS ESS-DIVE data portal: https://data.ess-dive.lbl.gov/portals/chess. Funding Acknowledgement: Field and remote-sensing data acquisition was performed under a grant from the National Aeronautics and Space Administration (80NSSC24K1005). This work was also supported by the Watershed Function Science Focus Area at Lawrence Berkeley National Laboratory funded by the US Department of Energy, Office of Science, Biological and Environmental Research under Contract No. DE-AC02-05CH11231.

2018 NEON and 2025 CHESS Campaigns↗

Machine Learning for Real-time Fusion Plasma Behavior Prediction and Manipulation (Final Report)

The goal of this project is to implement real-time analysis of 2D Beam Emission Spectroscopy (BES) data to predict and control transient and high-bandwidth events at DIII-D. In essence, we wish to bring high-bandwidth fluctuation diagnostics into the realm of real-time measurements and control. The BES ML models will necessarily be deep neural networks (DNN) with a “data flow” architecture for compatibility with high-throughput, low-latency evaluation on a field-programmable gate array (FPGA) or other emerging processor technologies. The real-time output will be fed to the plasma control system (PCS) for real-time control tasks, specifically for ELM control and avoidance and for QH-mode access and sustainment. We anticipate that the real-time analysis of fluctuation diagnostics will create new enabling technologies to predict and control transient events such as confinement mode transitions, edge-localized modes, Alfven eigenmode events, and disruptions. The proposed research is aligned with ITER research needs and DIII-D programmatic goals. For instance, the prediction and avoidance of ELM events is critical for ITER machine safety. Also, H-mode access with RMP ELM suppression in ITER is an active research area due to high separatrix density, narrow SOL width, and elevated LH transition power threshold.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A VLSI decomposition of the deBruijn graph

A new Viterbi decoder for convolutional codes with constraint lengths up to 15, called the Big Viterbi Decoder, is under development for the Deep Space Network. It will be demonstrated by decoding data from the Galileo spacecraft, which has a rate 1/4, constraint-length 15 convolutional encoder on board. Here, the mathematical theory underlying the design of the very-large-scale-integrated (VLSI) chips that are being used to build this decoder is explained. The deBruijn graph B sub n describes the topology of a fully parallel, rate 1/v, constraint length n+2 Viterbi decoder, and it is shown that B sub n can be built by appropriately wiring together (i.e., connecting together with extra edges) many isomorphic copies of a fixed graph called a B sub n building block. The efficiency of such a building block is defined as the fraction of the edges in B sub n that are present in the copies of the building block. It is shown, among other things, that for any alpha less than 1, there exists a graph G which is a B sub n building block of efficiency greater than alpha for all sufficiently large n. These results are illustrated by describing a special hierarchical family of deBruijn building blocks, which has led to the design of the gate-array chips being used in the Big Viterbi Decoder.

Collins, O.↗

Smart connected worker edge platform for smart manufacturing: Part 2—Implementation and on‐site deployment case study

Abstract In this paper, we describe specific deployments of the Smart Connected Worker (SCW) Edge Platform for Smart Manufacturing through implementation of four instructive real‐world use cases that illustrate the role of people in a Smart Manufacturing paradigm through which affordable, scalable, accessible, and portable (ASAP) information technology (IT) acquires and contextualizes data into information for transmission to operation technologies (OT). For case one, the platform captures the relationships between energy consumption and human workflows for improved energy productivity while workers interact with machines during semiconductor manufacturing. The platform utilizes human cognition to identify anomalous machine behavior for root cause analysis of system faults via neural network (NN) that recognize alarm postures of workers with cameras. For case two, a smart assembly line is demonstrated for state monitoring and fault detection. Machine learning (ML) models are used to recognize system states and identify fault scenarios with human intervention. For case three, the platform monitors human–machine interactions to classify manufacturing machine states for proper operations and energy productivity. Internal energy states of individual or collections of manufacturing equipment are determined via NN based algorithms that disaggregate signals associated with smart metering typically deployed at manufacturing facilities. These methods predict the real time energy profile of each machine from the total energy profile of a manufacturing site. For case four, a software defined sensor system built with scientific workflow engines is demonstrated for contextualizing data from laser surface refraction for characterization, and diagnostics in the processing of additively manufactured titanium alloy.

Donovan, Richard P.↗

A Self-Sustained CPS Design for Reliable Wildfire Monitoring

Continuous monitoring of areas nearby the electric grid is critical for preventing and early detection of devastating wildfires. Existing wildfire monitoring systems are intermittent and oblivious to local ambient risk factors, resulting in poor wildfire awareness. Ambient sensor suites deployed near the gridlines can increase the monitoring granularity and detection accuracy. However, these sensors must address two challenging and competing objectives at the same time. First, they must remain powered for years without manual maintenance due to their remote locations. Second, they must provide and transmit reliable information if and when a wildfire starts. The first objective requires aggressive energy savings and ambient energy harvesting, while the second requires continuous operation of a range of sensors. To the best of our knowledge, this paper presents the first self-sustained cyber-physical system that dynamically co-optimizes the wildfire detection accuracy and active time of sensors. The proposed approach employs reinforcement learning to train a policy that controls the sensor operations as a function of the environment (i.e., current sensor readings), harvested energy, and battery level. Here, the proposed cyber-physical system is evaluated extensively using real-life temperature, wind, and solar energy harvesting datasets and an open-source wildfire simulator. In long-term (5 years) evaluations, the proposed framework achieves 89% uptime, which is 46% higher than a carefully tuned heuristic approach. At the same time, it averages a 2-minute initial response time, which is at least 2.5× faster than the same heuristic approach. Furthermore, the policy network consumes 0.6 mJ per day on the TI CC2652R microcontroller using TensorFlow Lite for Micro, which is negligible compared to the daily sensor suite energy consumption.

54 ENVIRONMENTAL SCIENCES↗

Solving independent set problems with photonic quantum circuits

An independent set (IS) is a set of vertices in a graph such that no edge connects any two vertices. In adiabatic quantum computation [E. Farhi, et al ., Science 292, 472–475 (2001); A. Das, B. K. Chakrabarti, Rev. Mod. Phys. 80, 1061–1081 (2008)], a given graph G ( V , E ) can be naturally mapped onto a many-body Hamiltonian H IS G ( V , E ) , with edges E being the two-body interactions between adjacent vertices V . Thus, solving the IS problem is equivalent to finding all the computational basis ground states of H IS G ( V , E ) . Very recently, non-Abelian adiabatic mixing (NAAM) has been proposed to address this task, exploiting an emergent non-Abelian gauge symmetry of H IS G ( V , E ) [B. Wu, H. Yu, F. Wilczek, Phys. Rev. A 101, 012318 (2020)]. Here, we solve a representative IS problem G ( 8 , 7 ) by simulating the NAAM digitally using a linear optical quantum network, consisting of three C-Phase gates, four deterministic two-qubit gate arrays (DGA), and ten single rotation gates. The maximum IS has been successfully identified with sufficient Trotterization steps and a carefully chosen evolution path. Remarkably, we find IS with a total probability of 0.875(16), among which the nontrivial ones have a considerable weight of about 31.4%. Our experiment demonstrates the potential advantage of NAAM for solving IS-equivalent problems.

Science & Technology - Other Topics↗