Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “emulation”

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 1,531 records · Page 85

Neuromorphic Computing is Turing-Complete

Neuromorphic computing is a non-von Neumann computing paradigm that performs computation by emulating the human brain. Neuromorphic systems are extremely energy-efficient and known to consume thousands of times less power than CPUs and GPUs. They have the potential to drive critical use cases such as autonomous vehicles, edge computing and internet of things in the future. For this reason, they are sought to be an indispensable part of the future computing landscape. Neuromorphic systems are mainly used for spike-based machine learning applications, although there are some non-machine learning applications in graph theory, differential equations, and spike-based simulations. These applications suggest that neuromorphic computing might be capable of general-purpose computing. However, general-purpose computability of neuromorphic computing has not been established yet. In this work, we prove that neuromorphic computing is Turing-complete and therefore capable of general-purpose computing. Specifically, we present a model of neuromorphic computing, with just two neuron parameters (threshold and leak), and two synaptic parameters (weight and delay). We devise neuromorphic circuits for computing all the μ-recursive functions (i.e., constant, successor and projection functions) and all the μ-recursive operators (i.e., composition, primitive recursion and minimization operators). Given that the μ-recursive functions and operators are precisely the ones that can be computed using a Turing machine, this work establishes the Turing-completeness of neuromorphic computing.

Date, Prasanna↗

Stealthy Cyber Anomaly Detection On Large Noisy Multi-material 3D Printer Datasets Using Probabilistic Models

As Additive Layer Manufacturing (ALM) becomes pervasive in industry, its applications in safety critical component manufacturing are being explored and adopted. However, ALM's reliance on embedded computing renders it vulnerable to tampering through cyber-attacks. Sensor instrumentation of ALM devices allows for rigorous process and security monitoring, but also results in a massive volume of noisy data for each run. As such, in-situ, near-real-time anomaly detection is very challenging. The ideal algorithm for this context is simple, computationally efficient, minimizes false positives, and is accurate enough to resolve small deviations. In this paper, we present a probabilistic-model-based approach to address this challenge. To test our approach, we analyze current measurements from a polymer composite 3D printer during emulated tampering attacks. Our results show that our approach can consistently and efficiently locate small changes in the presence of substantial operational noise.

Yoginath, Srikanth↗

Automated Adversary-in-the-Loop Cyber-Physical Defense Planning

Security of cyber-physical systems (CPS) continues to pose new challenges due to the tight integration and operational complexity of the cyber and physical components. To address these challenges, this article presents a domain-aware, optimization-based approach to determine an effective defense strategy for CPS in an automated fashion—by emulating a strategic adversary in the loop that exploits system vulnerabilities, interconnection of the CPS, and the dynamics of the physical components. Our approach builds on an adversarial decision-making model based on a Markov Decision Process (MDP) that determines the optimal cyber (discrete) and physical (continuous) attack actions over a CPS attack graph. The defense planning problem is modeled as a non-zero-sum game between the adversary and defender. We use a model-free reinforcement learning method to solve the adversary’s problem as a function of the defense strategy. We then employ Bayesian optimization (BO) to find an approximate best-response for the defender to harden the network against the resulting adversary policy. This process is iterated multiple times to improve the strategy for both players. We demonstrate the effectiveness of our approach on a ransomware-inspired graph with a smart building system as the physical process. Numerical studies show that our method converges to a Nash equilibrium for various defender-specific costs of network hardening.

97 MATHEMATICS AND COMPUTING↗

Experimental Study of TCP Throughput Profiles and Dynamics Over Dedicated Connections

A throughput profile expressed as a function of the round-trip times of a data transport infrastructure is a critical indicator of its level of optimization, particularly, over dedicated connections. We study the throughput profiles of eleven TCP versions using measurements collected over dedicated hardware-emulated connections with distances spanning round the earth. Among them, BBR has overall higher temporal variations and lower throughput profiles compared to five loss-based TCP versions, and the comparison with other TCP versions is mixed. Using the Poincare map regions of throughput time traces, we show that the richer dynamics of BBR are correlated with its lower throughput profiles. We present basic analytical results that indicate that higher temporal variations of TCP methods lead to lower throughput profiles, thereby establishing the underlying causality. Under external losses, BBR achieves sustained high throughput compared to others as the loss rate is increased. Overall, our results provide insights into the relationship between time dynamics and throughput profiles of TCP versions, in particular, show that limited time traces can be indicative of global properties of throughput profiles.

Rao, Nageswara↗

ChemComp: A Compilation Framework for Computing with Chemical Reaction Networks

The acceleration of scientific computation, data analytics, and artificial intelligence is driving a surge in computational requirements. Yet, state-of-the-art high-performance computing systems are approaching physical limitations that impede further significant improvements in energy efficiency. As we move towards post-exascale computing systems, innovative approaches are necessary to overcome this barrier in power consumption. Novel analog and hybrid digital-analog architectures hold promise for enhancing energy efficiency by several orders of magnitude. Biochemical computation stands out among the various solutions being explored due to its potential to enable new classes of devices with immense computational capabilities. These devices can capitalize on the inherent efficacy of biological cells in solving optimization problems and are scalable through increasing reaction system size or vessel capacity, potentially satisfying scientific computing's high-performance requirements. Nonetheless, several theoretical and practical limitations persist, including problem formulation and mapping to chemical reaction networks (CRNs) and implementation of actual CRN devices. In this paper, we propose a framework for biochemical computation using systems chemistry. We present the initial components of our approach: an abstract chemical reaction dialect implemented as a multi-level intermediate representation (MLIR) compiler extension and a pathway to represent mathematical problems with CRNs. To showcase the potential of this approach, we emulate a simplified chemical reservoir device. This work lays the groundwork for leveraging chemistry's computing potential in creating energy-efficient, high-performance computing systems tailored to contemporary computational needs.

artificial intelligence↗

Towards a High Fidelity Training Environment for Autonomous Cyber Defense Agents

Cyber defenders are overwhelmed by the frequency and scale of attacks against their networks. This problem will only be exacerbated as attackers leverage AI to automate their workflows. Autonomous cyber defense capabilities could aid defenders by automating operations and adapting dynamically to novel threats. However, existing training environments fall short in areas such as generalization, explainability, scalability, and transferability, making it intractable to train agents that will be effective in real networks. In this paper we take an important step towards creating autonomous cyber defense agents — we present a high fidelity training environment called Cyberwheel that includes both simulation and emulation capabilities. Cyberwheel simplifies customization of the training network and easily allows redefining the agent’s reward function, observation space, and action space to support rapid experimentation of novel approaches to agent design. It also provides visibility into agent behaviors necessary for agent evaluation and sufficient documentation / examples to lower the barrier to entry. As an example use case of Cyberwheel, we present initial results training an autonomous agent to deploy cyber deception strategies in simulation.

Oesch, T↗

Evaluating HPC Scheduling Strategies for Urgent Workloads

Scientific computing centers increasingly face workloads with diverse urgency requirements, driven by applications that demand rapid or even immediate execution. Appropriately configured scheduling policies can significantly improve both user satisfaction and overall cluster utilization. In this work, we present a systematic analysis of scheduler configurations under scenarios where a fraction of jobs have urgent computing needs. We evaluate multiple job scheduling simulators, develop a lightweight job-submission emulation framework, and create tools to analyze and visualize the resulting scheduling data. Our study identifies key trade-offs between responsiveness, fairness, and efficiency, and offers a set of practical scheduling configurations (particularly for Slurm) that can be tailored to HPC environments supporting mixed-urgency workloads.

Maheshwari, Ketan [ORNL] (ORCID:000000033800662X)↗

Editors’ Choice—Diffusion Media for Cation Contaminant Transport Suppression into Fuel Cell Electrodes

Polymer electrolyte membrane fuel cells provide an alternative option to fossil fuel-based energy conversion devices. However, the corrosion of fuel cell components, specifically the bipolar plates, introduces contaminants (e.g., Fe, Ni) into the membrane electrode assembly (MEA). These contaminants accelerate the ionomer degradation by acting as a Fenton’s reagent, decreasing the fuel cell’s durability. This study presents the mechanism and the diffusion media properties affecting the transport of cation contaminants into the MEA. Cation contaminant transport was studied after altering the gas diffusion layers (GDLs) wettability, emulating the GDL properties after prolonged operation, by ex situ hydrogen peroxide treatment or in situ electrochemical potential cycling. A GDL with crack-free microporous layer (MPL) showed a lower cation transport rate to the catalyst layer than MPL with cracks after both ex situ and in situ treatment. A novel GDL was developed from modification of the conventional GDL via the addition of a hydrophobic layer to the GDL substrate, which suppressed the contaminant cation transport significantly. This novel GDL also showed improved fuel cell performance.

25 ENERGY STORAGE↗

Ab Initio Study of the Interface of the Solid-State Electrolyte Li 9 N 2 Cl 3 with a Li-Metal Electrode

Ab initio molecular dynamics study of an electrochemical interface between a solid-state-electrolyte Li 9 N 2 Cl 3 and a Li-metal is performed to analyze interphase formation due to electrochemical instability. An external electric field is applied to emulate the interface under charging conditions. At open circuit, we observed electrochemical stability at both sides of the interface, without electrolyte decomposition, or new phase formation, in good agreement with reported experiments. However, a structural re-accommodation takes place at both sides of the interface. Some oxidation of the surface Li-atoms takes place when Cl and N anions capture Li from the metal to complete octahedral structures, a Bader charge and electron density analyses explain the difference between Cl and N behavior. At the interface with the Li 9 N 2 Cl 3 (002) facet, the larger negative charge on low-coordinated N atoms is able to retain more Li atoms than the Cl atoms do. At charging conditions applying an external electric field (0.5 V/Å), no major changes are observed in atomic diffusion or structural changes at the interphase; however, the main difference is the change of the Li-metal crystal structure. Due to migration of Li from the metal anode to the electrolyte, vacancies are created on the anode, causing a structural re-arrangement at the anode surface.

36 MATERIALS SCIENCE↗

Dynamic Characterization of Dendrite Deposition and Growth in Li-Surface by Electrochemical Impedance Spectroscopy

The evolution of dendrite formation is characterized by DC and AC electrochemical techniques. Interfacial mechanisms for lithium deposition are described and quantified by electrochemical impedance spectroscopy (EIS) between a lithium electrode and a graphite electrode. The initiation and growth of dendrites in the lithium surface due to the cathodic polarization conditions following anodic dissolution emulate long term cycling process occurring in the lithium electrodes. The dendrite initiation at the lithium/organic electrolyte interface is proposed to be performed through a combination of layering and interfacial reactions during different cathodic conditions. The growth is proposed to be performed by surface geometrical deposition. In this work, we use EIS in galvanostatic mode to assess the initiation and growth stages of dendrites by the accumulation of precipitates formed under different current conditions. The lithium/organic solvent experimental system using frequency domain techniques is validated by the theoretical approach using a deterministic model that accounts for the faradaic processes at the interface assuming a coverage fraction of the electrodic surface affected by the dendritic growth. (C) 2015 The Electrochemical Society. All rights reserved.

Hernandez-Maya, R↗

Comparison Evaluations of VRF and RTU Systems Performance on Flexible Research Platform

The energy performance of a variable refrigerant flow (VRF) system was evaluated using an occupancy-emulated research building in the southeastern region of the United States. Full- and part-load performance of the VRF system in heating and cooling seasons was compared with a conventional rooftop unit (RTU) variable-air-volume system with electric resistance heating. During both the heating and cooling seasons, full- and part-load conditions (i.e., 100%, 75%, and 50% thermal loads) were maintained alternately for 2 to 3 days each, and the energy use, thermal conditions, and coefficient of performance (COP) for the RTU and VRF system were measured. During the cooling season, the VRF system had an average COP of 4.2, 3.9, and 3.7 compared with 3.1, 3.0, and 2.5 for the RTU system under 100%, 75%, and 50% load conditions and resulted in estimated energy savings of 30%, 37%, and 47%, respectively. Finally, during the heating season, the VRF system had an average COP ranging from 1.2 to 2.0, substantially higher than the COPs of the RTU system, and resulted in estimated energy savings of 51%, 47%, and 27% under the three load conditions, respectively.

42 ENGINEERING↗

bus.py [SWR-15-14]

Bus.py is a transmission bus emulator with functionality for communicating with the distribution simulation software GridLAB-D.

Hansen, Timothy↗

Portals Reference Implementation v. 1.0

The Portals reference implementation is based on the Portals 4.X API, published by Sandia National Laboratories as a freely available public document. It is designed to be an implementation of the Portals Networking Application Programming Interface and is used by several other upper layer protocols like SHMEM, GASNet and MPI. It is implemented over existing networks, specifically Ethernet and InfiniBand networks. This implementation provides Portals networks functionality and serves as a software emulation of Portals compliant networking hardware. It can be used to develop software using the Portals API prior to the debut of Portals networking hardware, such as Bull’s BXI interconnect, as well as a substitute for portals hardware on development platforms that do not have Portals compliant hardware. The reference implementation provides new capabilities beyond that of a typical network, namely the ability to have messages matched in hardware in a way compatible with upper layer software such as MPI or SHMEM. It also offers methods of offloading network operations via triggered operations, which can be used to create offloaded collective operations. Specific details on the Portals API can be found at http://portals4.org.

Grant, RyanE.↗

Haystack

Haystack is a software agent platform for user emulation. We are leveraging python and the SPADE software packages to develop an architecture and platform where software agents can be sent actuation behaviors, configured with different behavior profiles (time based, event based, probability based, etc.), and controlled/monitored from a central control unit. The haystack agent platform provides the ability to model and simulate user behavior in cyber systems. This eliminates the need to fund real users to provide this interaction, provides control such that researchers can randomize, hold-steady, or model whatever behavior that want to study without running afoul of IRB requirements, and provides a documented truth that enables understanding what happened in and experiment and provides for repeatability.

Source record↗

CosmicEmu, Version 2.0

The CosmicEmu implements a Gaussian process emulation scheme to predict the dark matter and dark matter + neutrino power spectra over a range of physical parameters that describe the composition and evolution of the Universe. The procedure can produce thousands of spectra per second, much faster than the complex n-body simulations used to produce the training set, which can take weeks per simulation. The training simulations, their design, and the general scheme is described in Lawrence et al. (2010), Heitmann et al. (2014), Heitmann et al. (2016), and an upcoming paper.

Lawrence, Earl↗

Build and Execute Environment

At exascale, the challenge becomes to develop applications that run at scale and use exascale platforms reliably, efficiently, and flexibly. Workflows become much more complex because they must seamlessly integrate simulation and data analytics. They must include down-sampling, post-processing, feature extraction, and visualization. Power and data transfer limitations require these analysis tasks to be run in-situ or in-transit. We expect successful workflows will comprise multiple linked simulations along with tens of analysis routines. Users will have limited development time at scale and, therefore, must have rich tools to develop, debug, test, and deploy applications. At this scale, successful workflows will compose linked computations from an assortment of reliable, well-defined computation elements, ones that can come and go as required, based on the needs of the workflow over time. We propose a novel framework that utilizes both virtual machines (VMs) and software containers to create a workflow system that establishes a uniform build and execution environment (BEE) beyond the capabilities of current systems. In this environment, applications will run reliably and repeatably across heterogeneous hardware and software. Containers, both commercial (Docker and Rocket) and open-source (LXC and LXD), define a runtime that isolates all software dependencies from the machine operating system. Workflows may contain multiple containers that run different operating systems, different software, and even different versions of the same software. We will run containers in open-source virtual machines (KVM) and emulators (QEMU) so that workflows run on any machine entirely in user-space. On this platform of containers and virtual machines, we will deliver workflow software that provides services, including repeatable execution, provenance, checkpointing, and future proofing. We will capture provenance about how containers were launched and how they interact to annotate workflows for repeatable and partial re-execution. We will coordinate the physical snapshots of virtual machines with parallel programming constructs, such as barriers, to automate checkpoint and restart. We will also integrate with HPC-specific container runtimes to gain access to accelerators and other specialized hardware to preserve native performance. Containers will link development to continuous integration. When application developers check code in, it will automatically be tested on a suite of different software and hardware architectures.

Guan, Qiang↗

HALucinator v. 1.0

Scripts that enable emulating firmware by intercepting low-level hardware abstraction function calls and replacing their execution with abstractions of the hardware the intercepted functions are intended to interact with.

Clements, AbrahamA↗

Real-Time Optimization of Distribution-level Energy Resources [SWR-18-27]

Researchers at NREL have developed a novel real-time control architecture to optimize the operation of DERs at residential, commercial, and industrial levels. The real-time system enables (portions of) feeders to emulate virtual power plants providing services to the rest of the grid, while ensuring satisfaction of electrical limits and maximizing customers’ benefits. This system can be integrated with legacy hardware and/or new advanced systems to optimally manage both individually-controlled DERs and aggregations of DERs. By virtue of the proposed engineering approach, the DERs collectively regulate the powers at an electrical point to respond to grid dispatch signals such as an automatic generation control, a ramping signal, or a 5-minute dispatch. Overall, this architecture allows end customers to minimize their payments and partake in grid operations while guaranteeing power quality in the distribution network.

Dall-Anese, Emiliano↗