Programming and Performance Visualization Tools
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for the optimum value of such NP-hard optimization problems, given the problem can be embedded on their hardware. However, this is often not possible due to certain limitations of the hardware connectivity structure of the annealer. This paper studies a general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices. Our generic algorithm allows us to recursively divide an instance until the generated subproblems can be embedded on the quantum annealer hardware and subsequently solved. Furthermore, the framework is applied to the maximum clique and minimum vertex cover problems, and we propose several pruning and reduction techniques to speed up the recursive decomposition. The performance of both algorithms is assessed in a detailed simulation study.
Experiments using laser cooled atoms and ions show real promise for practical applications in quantum-enhanced metrology, timing, navigation, and sensing as well as exotic roles in quantum computing, networking, and simulation. The heart of many of these experiments has been translated to microfabricated platforms known as atom chips whose construction readily lend themselves to integration with larger systems and future mass production. To truly make the jump from laboratory demonstrations to practical, rugged devices, the complex surrounding infrastructure (including vacuum systems, optics, and lasers) also needs to be miniaturized and integrated. In this paper we explore the feasibility of applying this approach to the Magneto-Optical Trap; incorporating the vacuum system, atom source and optical geometry into a permanently sealed micro-litre system capable of maintaining 10{sup −10} mbar for more than 1000 days of operation with passive pumping alone. We demonstrate such an engineering challenge is achievable using recent advances in semiconductor microfabrication techniques and materials.
Parallel Discrete Events Simulation (PDES) is becoming increasingly important to lab efforts in security and intelligence. It is used to model complex asynchronous systems such as computer networks, satellite systems, vehicular traffic, and human performance. Uncertainty Quantification (UQ) techniques have become a mainstay of Verification and Validation (V&V) efforts on physics simulations. However, PDES models are very different from traditional physics simulations, and research into UQ techniques for PDES is in its infancy. It is not clear which traditional UQ techniques can be applied to PDES, or what new techniques will need to be developed. The goal of this project was to identify existing UQ techniques that can be applied to PDES, and to develop new techniques as necessary. The project implemented or developed techniques to handle issues that do not appear in traditional physics simulations, but are common among PDES, including sampling techniques for high-dimensional homogenous inputs, response surfaces for high-variance heteroskedastic output, and characterization of skewed output distributions. These are foundational UQ techniques that must be used in any complete UQ analysis (Tong 2018).
Abstract Networks composed of nanoscale memristive components, such as nanowire and nanoparticle networks, have recently received considerable attention because of their potential use as neuromorphic devices. In this study, we explore ergodicity in memristive networks, showing that the performance on machine leaning tasks improves when these networks are tuned to operate at the edge between two global stability points. We find this lack of ergodicity is associated with the emergence of memory in the system. We measure the level of ergodicity using the Thirumalai-Mountain metric, and we show that in the absence of ergodicity, two different memristive network systems show improved performance when utilized as reservoir computers (RC). We highlight that it is also important to let the system synchronize to the input signal in order for the performance of the RC to exhibit improvements over the baseline.
With the increasing availability of the Remote Direct Memory Access (RDMA) support in computer networks, the so called Partitioned Global Address Space (PGAS) model has evolved in the last few years. Although there are several cases where a PGAS approach can easily solve difficult message passing situations, like in particle tracking and adaptive mesh refinement applications, the producer-consumer pattern, usually adopted in task-based parallelism, can only be implemented inefficiently because of the separation between data transfer and synchronization (which is usually unified in message passing programming models). Here, in this paper, we provide two contributions: (1) we propose an extension for the Fortran language that provides the concept of Notified Access by associating regular coarray variables with event variables. (2) We demonstrate that the MPI extension proposed by foMPI for Notified Access can be used effectively to implement the same concept in a PGAS run-time library like OpenCoarrays. Moreover, for a hydrodynamics mini-application, we found that Fortran 2018 events perform always better than Fortran 2008 sync statements on many-core processors. We finally show how the proposed Notified Access can improve the performance even more.
There are over 3000 electricity providers in the United States, encompassing investor and publicly owned utilities as well as electric cooperatives. There has been ongoing trends to increasingly automate and provide remote control and monitoring of electric energy delivery systems. The deployment of computer network technologies has increased the efficiency and reliability of electric power infrastructure. However, the increased use of digital communications has also increased the vulnerability to malicious cyber attacks [1]. In 2004 the National Research Councils (National Academies) formed a committee of specialists to address these vulnerabilities and propose possible solutions with an objective to prioritize the R&D needs for developing countermeasures. The committee addressed many potential concerns in the electric power delivery system and classified them based upon different criteria and presented recommendations to minimize the gap between the academic research directions and the needs of the electric utility industry. The complexity and diversity of the electric power delivery system in the U.S. has opened many ports for attackers and intruders [1]. This complexity and diversity is attributed to the fact that power delivery system is a network of substations, transmission and distribution lines, sub-networks of controlling, sensing and monitoring units, and human operator involvement for running the system [1]. Accordingly, any incident such as the occurrence of a fault or disturbance in this complex network cannot be deferred and should be resolved within an order of milliseconds, otherwise there is risk of large-scale outages similar to the occurrences in India and the U.S. in 2003 [2]. There are three main vulnerabilities in supervisory control and data acquisition (SCADA) systems commonly identified—physical vulnerability, cyber vulnerability and personal vulnerability [1]. In terms of cyber threats, SCADA systems are the most critical elements in the electric power grid in the U.S. Unauthorized access to a SCADA system could enable/disable unexpected equipment (such as disable the protection system or a circuit breaker) which could cause large scale disruptions of electric power delivery. This paper provides an overview of power system SCADA technologies in transmission substations (Section 2) and summarizes the best practices for implementing a cyber security program. After introducing SCADA system operations in Section 2, a description of the security challenges for SCADA systems is presented in Section 3. In Section 4, NECRC Critical Infrastructure Protection standards CIP-002 through CIP-009 are summarized. An overview of industry best practices is presented in Section 5.
Motivation. Critical infrastructures are large, complex engineered systems that must be operated robustly under abnormal conditions resulting from natural hazards or intentional acts. For example, electric power systems must be robust to line faults, water utilities must rapidly mitigate contamination incidents, and computing networks must adapt to adversarial intrusions to protect critical information. Problem. It is difficult for decision-makers within resiliency analysis in critical infrastructure to optimize designs and develop effective response strategies that can account for uncertainties. Facing incomplete information and the sheer scope that a natural hazard or attack vector may incorporate, response can be ineffective without reliable, scalable decision support tools. These problems are intrinsically nonlinear and involve discrete decisions, and unfortunately, existing off-the-shelf mathematical programming methods cannot support optimization-based decision-making of these nonlinear at scale. Method/Approach and Results. This project emphasized development of fundamental optimization strategies that supported real- time mitigation and response for critical infrastructures. In particular, the project developed multi- tree approaches based on piecewise outer-approximations for solution of mixed-integer nonlinear programming (MINLP) problems. These techniques alternate between an MILP or MISOCP relaxation to obtain a lower bound and candidate discrete solutions and an NLP subproblem to obtain upper bounds. Using tailored relaxations based on problem structure, these methods were used to solve several key applications in resilience and response of critical infrastructure. This work resulted in two open-source, copyrighted software packages: CORAMIN (https://github.com/Coramin/Coramin) -- an object-oriented mathematical programming framework that supports tailored multi-tree algorithms for solution of large- scale mixed-integer nonlinear programming; and EGRET (Electrical Grid Research and Engineering Toolkit) (https://github.com/grid- parity-exchange/Egret) -- a declarative mathematical programming framework built upon CORAMIN and Pyomo for formulation and solution of resilience and operations problems in power grid systems. Furthermore, these tools resulted in several important published results, including the following: The first known global optimization approach that could solve the unit-commitment problem with nonlinear power flow constraints on medium-sized test problems; Improved parallel optimization-based bounds tightening and strengthening of relaxations of AC power flow constraints; and, Optimization-based approaches for improved grid resilience and use of demand response to improve grid resilience with reduction in capital requirements. Result Implications. This project developed first-of-a-kind algorithms for decision-making in critical infrastructure resilience operations and planning, as well as a next-generation toolkit for MINLP researchers. These approaches leveraged high-performance computing architectures to solve some of the largest, most challenging nonlinear discrete optimization problems to global optimality, and these successes were captured in open-source software to enable optimization-based decision-making, and efficient solution of MINLP formulations for electric power transmission grids.
There is an unprecedented promise of enhanced capabilities for federations of leadership computing systems and experimental science facilities by leveraging software technologies for fast and efficient operations. These federations seek to unify different science instruments, both computing and experimental, to effectively support science users and operators to execute complex workflows. The FedScI project addresses the software challenges associated with the formation and operation of federated environments by leveraging recent advances in containerization of software and softwarization of hardware. We propose a software framework to streamline the federation usage by science users and it’s provisioning and operations by facility providers. A distinguishing element of our work is the support for improved interaction between experimental devices, such as beam-line instruments, and more traditional high-performance computing resources, including compute, network, storage systems. We present guiding principles for the software framework and highlight portions of a current prototype implementation. We describe our science use case involving neutron imaging beam-lines (SNAP/BL-3, Imaging/CG-1D) at the Spallation Neutron Source and High Flux Isotope Reactor facilities at Oak Ridge National Laboratory. Additionally, we detail plans for a more direct instrument interaction within a federated environment, which could enable more advanced workflows with feedback loops to shorten the time to science.
The CLAS12 Data Acquisition System was designed and built as part of the CLAS12 detector project in Hall B at Jefferson Laboratory. This article contains a full description of the system, including requirements, design, hardware, and software descriptions, as well as the achieved performance. The associated computing, network, and slow controls systems are also described.
Biomaterial-based memristors (bio-memristors) are often adopted to emulate biological synapse functions and applied to construct neural computing networks in brain-inspired chip systems. However, the randomness of conductive filament formation in bio-memristors inhibits their switching performance by causing the dispersion of the device-switching parameters. In this case, a facile porous silk fibroin (p-SF) memristor was obtained through a protein surface reconstruction strategy, in which the size of the hole can be adjusted by the density of hybrid nanoseeds. Here, the porous SF memristors exhibit greatly enhanced electrical characteristics, including uniform I-V cycles, centralized distribution of the switching voltages, and both high and low resistances, compared to devices without pores. The results of three-dimensional (3D) simulations based on classical density functional theory (cDFT) suggest that the reconstructed pores in the SF layers guide the formation and fracture of Ag filaments under an electric field and enhance the overall conductivity by separating Ag + ion and electron diffusion pathways. Ag + ions are predicted to preferentially diffuse through pores, whereas electrons diffuse through the SF network. Interestingly, the device conductance can be bidirectionally modulated gradually by positive and negative voltages, can faithfully simulate short-term and long-term plasticity, and can even realize the triplet-spike-timing-dependent plasticity (triplet-STDP) rule, which can be used for pattern recognition in biological systems. The simulation results reveal that a memristor network of this type has an accuracy of ~95.78% in memory learning and the capability of pattern learning. This work provides a facile technology route to improve the performance of bionic-material memristors.
The underlying mechanisms that lead to dramatic differences between closely related pathogens are not always readily apparent. For example, the genomes of Yersinia pestis (YP) the causative agent of plague with a high mortality rate and Yersinia pseudotuberculosis (YPT) an enteric pathogen with a modest mortality rate are highly similar with some species specific differences; however the molecular causes of their distinct clinical outcomes remain poorly understood. In this study, a temporal multi-omic analysis of YP and YPT at physiologically relevant temperatures was performed to gain insights into how an acute and highly lethal bacterial pathogen, YP, differs from its less virulent progenitor, YPT. This analysis revealed higher gene and protein expression levels of conserved major virulence factors in YP relative to YPT, including the Yop virulon and the pH6 antigen. This suggests that adaptation in the regulatory architecture, in addition to the presence of unique genetic material, may contribute to the increased pathogenenicity of YP relative to YPT. Additionally, global transcriptome and proteome responses of YP and YPT revealed conserved post-transcriptional control of metabolism and the translational machinery including the modulation of glutamate levels in Yersiniae. Finally, the omics data was coupled with a computational network analysis, allowing an efficient prediction of novel Yersinia virulence factors based on gene and protein expression patterns.
The efficiency of computing at peak output has increased rapidly since the dawn of the computer age. This paper summarizes some of the key factors affecting the efficiency of computing in all usage modes. While there is still great potential for improving the efficiency of computing devices, we will need to alter how we do computing in the next few decades because we are finally approaching the limits of current technologies.
We present the first calculation of the bispectrum of the matter perturbations induced by cosmic strings. The calculation is performed in two different ways: the first uses the unequal time correlators (UETCs) of the string network - computed using a Gaussian model previously employed for cosmic string power spectra. The second approach uses the wake model, where string density perturbations are concentrated in sheet-like structures whose surface density grows with time. The qualitative and quantitative agreement of the two gives confidence to the results. An essential ingredient in the UETC approach is the inclusion of compensation factors in the integration with the Green's function of the matter and radiation fluids, and we show that these compensation factors must be included in the wake model also. We also present a comparison of the UETCs computed in the Gaussian model, and those computed in the unconnected segment model (USM) used by the standard cosmic string perturbation package CMBACT. We compare numerical estimates for the bispectrum of cosmic strings to those produced by perturbations from an inflationary era, and discover that, despite the intrinsically non-Gaussian nature of string-induced perturbations, the matter bispectrum is unlikely to produce competitive constraints on a population of cosmic strings.
The Imaging Neutral Particle Analyzer (INPA) at DIII-D is a diagnostic system used to accurately resolve the energy and spatial distributions of fast ions in fusion plasmas. A novel artificial intelligence (AI) technique named INPA-net is based on Reservoir Computing Networks and developed here to predict active and passive signals produced by charge-exchange reactions from injected and edge-cold neutrals, respectively, in magnetically confined fusion plasmas. This model is trained using a set of 21 time domain signals between 0 s to 3.35 s that includes injected beam and thermal plasma information, and 6444 real 2D experimental images of the INPA in 12 plasma discharges at DIII-D. The trained neural network is able to forecast experimental images in real-time. The model achieves an R-squared value of 0.91, which is higher than the 0.83 value achieved by a simple linear regression model. This improvement highlights the model's enhanced predictive accuracy for measured images from the validation set. This AI approach is valuable due to its rapid response times and potential for integration into real-time plasma control systems. A version of this model capable of generating syntehic images would be useful for the real-time monitoring of fast-ion transport. A comprehensive sensitivity study reveals that INPA-net maintains high performance even with variations in the input parameters, indicating the model's robustness and reliability. While developed for the INPA, the underlying architecture is adaptable and may be applied to various 2D imaging diagnostics in fusion research.
Optical nonreciprocity plays a key role in almost every optical system, directing light flow and protecting optical components from backscattered light. Controllable forms of on-chip nonreciprocity are needed for the robust operation of increasingly sophisticated photonic integrated circuits (PICs) in the context of classical and quantum computation, networking, communications, and sensing. However, it has been challenging to achieve wideband, low-loss optical nonreciprocity on-chip. In this paper, we demonstrate strong coupling and Rabi-like energy exchange between photonic bands, possessing a continuum of modes, to unlock nonreciprocity and frequency translation over wide optical bandwidths in silicon. Using a traveling-wave phonon field to drive indirect interband photonic transitions, we demonstrate band hybridization that enables an intriguing form of nonreciprocal dissipation engineering. Using the converted mode to create a nonreciprocal dissipation channel, we demonstrate a frequency-neutral, low-loss (less than 1 dB) isolator with high nonreciprocal contrast (more than 14 dB) and broad operating bandwidth (more than 59 GHz). Additionally, through the implementation of complete interband conversion, we demonstrate a high extinction (more than 55 dB) optical frequency translation operation with near-unity efficiency.
In this study we synthesize zigzag persistence from topological data analysis with autoencoder-based approaches to detect malicious cyber activity, and derive analytic insights. Cybersecurity aims to safeguard computers, networks, and servers from various forms of malicious attacks, including network damage, data theft, and activity monitoring. We focus on the cybersecurity domain and investigate the detection of malicious activity using log data. We consider the dynamics of the log data and explore the changing topology of a hypergraph representation of this data to gain insights into the underlying activity. These hypergraphs capture complex interactions between processes, together with their temporal information. To study the changing topology we use zigzag persistence, which captures how topological features persist at multiple dimensions over time. We observe that this detects malicious activity in a cyber data set. To automate this detection we implement an autoencoder trained on a vectorization of the resulting zigzag persistence barcodes. Our experimental results demonstrate the effectiveness of the autoencoder in detecting malicious activity. Overall, this study highlights the potential of zigzag persistence and its combination with temporal hypergraphs for analyzing cybersecurity log data and detecting malicious behavior.
The Grid accounting and auditing mechanisms were designed under the assumption that users would submit their jobs directly to the Grid gatekeepers. However, many groups are starting to use pilot-based systems, where users submit jobs to a centralized queue and are successively transferred to the Grid resources by the pilot infrastructure. While this approach greatly improves the user experience, it does disrupt the established accounting and auditing procedures. Open Science Grid deploys gLExec on the worker nodes to keep the pilot-related accounting and auditing information and centralizes the accounting collection with GRATIA.