Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex program transformations”

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 55 records · Page 3

Compiled MPI: Cost-Effective Exascale Applications Development

The complexity of petascale and exascale machines makes it increasingly difficult to develop applications that can take advantage of them. Future systems are expected to feature billion-way parallelism, complex heterogeneous compute nodes and poor availability of memory (Peter Kogge, 2008). This new challenge for application development is motivating a significant amount of research and development on new programming models and runtime systems designed to simplify large-scale application development. Unfortunately, DoE has significant multi-decadal investment in a large family of mission-critical scientific applications. Scaling these applications to exascale machines will require a significant investment that will dwarf the costs of hardware procurement. A key reason for the difficulty in transitioning today's applications to exascale hardware is their reliance on explicit programming techniques, such as the Message Passing Interface (MPI) programming model to enable parallelism. MPI provides a portable and high performance message-passing system that enables scalable performance on a wide variety of platforms. However, it also forces developers to lock the details of parallelization together with application logic, making it very difficult to adapt the application to significant changes in the underlying system. Further, MPI's explicit interface makes it difficult to separate the application's synchronization and communication structure, reducing the amount of support that can be provided by compiler and run-time tools. This is in contrast to the recent research on more implicit parallel programming models such as Chapel, OpenMP and OpenCL, which promise to provide significantly more flexibility at the cost of reimplementing significant portions of the application. We are developing CoMPI, a novel compiler-driven approach to enable existing MPI applications to scale to exascale systems with minimal modifications that can be made incrementally over the application's lifetime. It includes: (1) New set of source code annotations, inserted either manually or automatically, that will clarify the application's use of MPI to the compiler infrastructure, enabling greater accuracy where needed; (2) A compiler transformation framework that leverages these annotations to transform the original MPI source code to improve its performance and scalability; (3) Novel MPI runtime implementation techniques that will provide a rich set of functionality extensions to be used by applications that have been transformed by our compiler; and (4) A novel compiler analysis that leverages simple user annotations to automatically extract the application's communication structure and synthesize most complex code annotations.

97 MATHEMATICS AND COMPUTING↗

Demonstration of Embedded Sensors in Ceramic Structures

The Transformational Challenge Reactor (TCR) program seeks to demonstrate an advanced 3D printed nuclear reactor core. A binder jet additive manufacturing process is used to fabricate the complex SiC ceramic components of the TCR core. After printing, the components are densified via chemical vapor infiltration (CVI). This process allows complex cavities to be created in which sensors can be placed at strategic locations. Inserting the sensors during the CVI process allows the sensors to be embedded within the component as it is infiltrated. The primary challenge for embedding the sensors is identifying the sensors and sensor sheath materials that can survive the temperatures (>1,000°C) and chemical exposure to H 2 and HCl during CVI. The embedded sensors that are being investigated for use during TCR operation include thermocouples, self-powered neutron detectors, and spatially distributed fiber-optic temperature sensors. This report describes the CVI materials compatibility tests and initial trials for embedding functional sensors. Mo is identified as the most suitable sensor sheath material based on its availability in small diameter tubing, relatively low neutron absorption cross section, and compatibility with H 2 , HCl, and the surrounding SiC matrix at the process temperatures. Amorphous SiO2 fiber-optic samples with Au and Cu metal coatings were successfully embedded in SiC along with bare fibers, although the metal coatings showed some evidence of localized melting during CVI. Initial experiments attempting to embed functional sensors showed that the sensors can be embedded in 3D printed SiC parts, but there are still challenges that must be overcome to ensure that the sensors and sensor sheaths do not fail during CVI. In particular, Nb-sheathed Mo-Nb thermocouples failed at temperatures far lower than expected despite thermodynamic calculations and materials compatibility tests that show the Nb sheath to be compatible with the CVI environment. One potential explanation for the large expansion of the Nb sheath could be related to hydride formation in the lower temperature region of the sheath. Future work will focus on Mo-sheathed thermocouples instead of Nb. The fiberoptic sensors tested during the instrumented experiment broke due to the lack of mechanical protection after their polymer-based coatings were vaporized. Future instrumented experiments will use metal-coated optical fibers for strain sensing to provide additional mechanical protection. However, custom coatings with higher melting points than commercially available Au and Cu might be required. Regardless, fiber-optic sensors are still candidates for spatially distributed temperature measurements since they can be inserted into an embedded metal sheath after CVI.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Comparison of some optimal control methods for the design of turbine blades

This paper attempts a comparative study of some numerical methods for the optimal control design of turbine blades whose vibration characteristics are approximated by Timoshenko beam idealizations with shear and incorporating simple boundary conditions. The blade was synthesized using the following methods: (1) conjugate gradient minimization of the system Hamiltonian in function space incorporating penalty function transformations, (2) projection operator methods in a function space which includes the frequencies of vibration and the control function, (3) epsilon-technique penalty function transformation resulting in a highly nonlinear programming problem, (4) finite difference discretization of the state equations again resulting in a nonlinear program, (5) second variation methods with complex state differential equations to include damping effects resulting in systems of inhomogeneous matrix Riccatti equations some of which are stiff, (6) quasi-linear methods based on iterative linearization of the state and adjoint equation. The paper includes a discussion of some substantial computational difficulties encountered in the implementation of these techniques together with a resume of work presently in progress using a differential dynamic programming approach.

Desilva, B. M. E.↗

The method of complex characteristics for design of transonic blade sections

A variety of computational methods were developed to obtain shockless or near shockless flow past two-dimensional airfoils. The approach used was the method of complex characteristics, which determines smooth solutions to the transonic flow equations based on an input speed distribution. General results from fluid mechanics are presented. An account of the method of complex characteristics is given including a description of the particular spaces and coordinates, conformal transformations, and numerical procedures that are used. The operation of the computer program COMPRES is presented along with examples of blade sections designed with the code. A user manual is included with a glossary to provide additional information which may be helpful. The computer program in Fortran, including numerous comment cards is listed.

Bledsoe, M. R.↗

Initial Ada components evaluation

The SAIC has the responsibility for independent test and validation of the SSE. They have been using a mathematical functions library package implemented in Ada to test the SSE IV and V process. The library package consists of elementary mathematical functions and is both machine and accuracy independent. The SSE Ada components evaluation includes code complexity metrics based on Halstead's software science metrics and McCabe's measure of cyclomatic complexity. Halstead's metrics are based on the number of operators and operands on a logical unit of code and are compiled from the number of distinct operators, distinct operands, and total number of occurrences of operators and operands. These metrics give an indication of the physical size of a program in terms of operators and operands and are used diagnostically to point to potential problems. McCabe's Cyclomatic Complexity Metrics (CCM) are compiled from flow charts transformed to equivalent directed graphs. The CCM is a measure of the total number of linearly independent paths through the code's control structure. These metrics were computed for the Ada mathematical functions library using Software Automated Verification and Validation (SAVVAS), the SSE IV and V tool. A table with selected results was shown, indicating that most of these routines are of good quality. Thresholds for the Halstead measures indicate poor quality if the length metric exceeds 260 or difficulty is greater than 190. The McCabe CCM indicated a high quality of software products.

Moebes, Travis↗

Simulating the Composite Propellant Manufacturing Process

There is a strategic interest in understanding how the propellant manufacturing process contributes to military capabilities outside the United States. The paper will discuss how system dynamics (SD) has been applied to rapidly assess the capabilities and vulnerabilities of a specific composite propellant production complex. These facilities produce a commonly used solid propellant with military applications. The authors will explain how an SD model can be configured to match a specific production facility followed by a series of scenarios designed to analyze operational vulnerabilities. By using the simulation model to rapidly analyze operational risks, the analyst gains a better understanding of production complexities. There are several benefits of developing SD models to simulate chemical production. SD is an effective tool for characterizing complex problems, especially the production process where the cascading effect of outages quickly taxes common understanding. By programming expert knowledge into an SD application, these tools are transformed into a knowledge management resource that facilitates rapid learning without requiring years of experience in production operations. It also permits the analyst to rapidly respond to crisis situations and other time-sensitive missions. Most importantly, the quantitative understanding gained from applying the SD model lends itself to strategic analysis and planning.

Williamson, Suzanne↗

The Intelligent Data Understanding Element of NASA's Intelligent Systems Program

Within the NASA Intelligent Systems Program, the Intelligent Data Understanding (IDU) element develops techniques for transforming data into scientific understanding. Automating such tools is critical for space science, space-based earth science, and planetary exploration with onboard scientific data analysis. Intelligent data understanding (IDU) is about extracting meaning from large, diverse science and engineering databases, via autonomous techniques that transform very large datasets into understanding. The earth science community in particular needs new tools for analyzing multi-formatted and geographically distributed datasets and for identifying cause-effect relationships in the complex data. Research within the IDU program element seeks to automate data analysis tasks so that humans can focus on creative hypothesis generation and knowledge synthesis. It may also enable NASA space missions in which autonomous agents must generate knowledge and take actions, and missions where limited bandwidth permits transmission of only the most interesting scientific observations, summaries, and conclusions. Twenty-seven research projects are-currently funded.

Coughlan, Joseph C.↗

Interaction of Epstein-Barr virus (EBV) with human B-lymphocytes

Epstein-Barr virus, EBV, and humans have a common history that reaches back to our primate ancestors. The virus co-evolved with man and has established a largely harmless and highly complex co-existence. It is carried as silent infection by almost all human adults. A serendipitous discovery established that it is the causative agent of infectious mononucleosis. Still, EBV became known first in 1964, in a rare, geographically prevalent malignant lymphoma of B-cell origin, Burkitt lymphoma BL. Its association with a malignancy prompted intensive studies and its capacity to immortalize B-lymphocytes in vitro was soon demonstrated. Consequently EBV was classified therefore as a potentially tumorigenic virus. Despite of this property however, the virus carrier state itself does not lead to malignancies because the transformed cells are recognized by the immune response. Consequently the EBV induced proliferation of EBV carrying B-lymphocytes is manifested only under immunosuppressive conditions. The expression of EBV encoded genes is regulated by the cell phenotype. The virus genome can be found in malignancies originating from cell types other than the B-lymphocyte. Even in the EBV infected B-cell, the direct transforming capacity is restricted to a defined window of differentiation. A complex interaction between virally encoded proteins and B-cell specific cellular proteins constitute the proliferation inducing program. In this short review we touch upon aspects which are the subject of our present work. We describe the mechanisms of some of the functional interactions between EBV encoded and cellular proteins that determine the phenotype of latently infected B-cells. The growth promoting EBV encoded genes are not expressed in the virus carrying BL cells. Still, EBV seems to contribute to the etiology of this tumor by modifying events that influence cell survival and proliferation. We describe a possible growth promoting mechanism in the genesis of Burkitt lymphoma that depends on the presence of EBV.

60 APPLIED LIFE SCIENCES↗

A complexity science-based framework for global joint operations analysis to support force projection: LDRD Final Report

The military is undergoing a significant transformation as it modernizes for the information age and adapts to address an emerging asymmetric threat beyond traditional cold war era adversaries. Techniques such as traditional large-scale, joint services war gaming analysis are no longer adequate to support program evaluation activities and mission planning analysis at the enterprise level because the operating environment is evolving too quickly. New analytical capabilities are necessary to address modernization of the Department of Defense (DoD) enterprise. This presents significant opportunity to Sandia in supporting the nation at this transformational enterprise scale. Although Sandia has significant experience with engineering system of systems (SoS) and Complex Adaptive System of Systems (CASoS), significant fundamental research is required to develop modeling, simulation and analysis capabilities at the enterprise scale. This report documents an enterprise modeling framework which will enable senior level decision makers to better understand their enterprise and required future investments.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Organic and Organometallic Chemistry at the Single-Molecule, -Particle, and -Molecular-Catalyst-Turnover Level by Fluorescence Microscopy

Mechanistic studies have historically played a key role in the discovery and optimization of reactions in organic and organometallic chemistry. However, even apparently simple organic and organometallic transformations may have surprisingly complicated multistep mechanisms, increasing the difficulty of extracting this mechanistic information. The resulting reaction intermediates often constitute a small fraction of the total reaction mixture, for example, creating a long-term analytical challenge of detection. This challenge is particularly pronounced in cases where the positions of intermediates on the reaction energy surface mean that they do not “build up” to the quantities needed for observation by traditional ensemble analytical tools. Thus, their existence and single-step elementary reactivity cannot be studied directly. New approaches for obtaining this otherwise-missing mechanistic information are therefore needed. Single-turnover, single-molecule, single-particle, and other subensemble fluorescence microscopy techniques are ideally suited for this role because of their sensitivity and spatiotemporal resolution. Inspired by the robust development of single-molecule fluorescence microscopy tools for studying enzyme catalysis, our laboratory has developed analogous fluorescence microscopy techniques to overcome mechanistic challenges in synthetic chemistry, with sensitivity as high as the single-complex, single-turnover, and single-molecule level. These techniques free the experimenter from the previous restriction that intermediates must “build up” to quantities needed for detection by ensemble analytical tools and are suited to systems where synchronization through flash photolysis or stopped flow would be inconvenient or inaccessible. In this process, the techniques transform certain previously “unobservable” intermediates and their elementary single-step reactivities into “observable” ones through sensitive and selective spectral handles. Our program has focused on imaging reactions in small-molecule, organic, and polymer synthetic chemistry with an accent on the reactivity of molecular transition metal complexes and catalysts. Our laboratory initiated studies in this area in 2008 with the imaging of individual palladium complexes that were tagged with spectator fluorophores. To enable imaging, we started with fluorophore selection and development, overcame challenges with imaging in organic solvents, and developed strategies compatible with air-sensitive chemistry and concentrations of reagents generally used in small-molecule synthesis. These studies grew to include characterization of previously unknown organometallic intermediates in the synthesis of organozinc reagents and the direct study of their elementary-step reactivity. The ability to directly observe this behavior generated predictive power for selecting salts that accelerated organozinc reagent formation in synthesis, including salts that had not yet been reported synthetically. In 2017 we also developed the first single-turnover imaging of molecular (chemo)catalysts, which through the technique’s spatiotemporal resolution revealed abruptly time-variable polymerization kinetics wherein molecular ruthenium ring-opening metathesis polymerization (ROMP) catalysts changed rates independently from other catalysts less than 1 μm away. Individual catalytic turnovers, each corresponding to one single-chain-elongation reaction arising from insertion of single ROMP or enyne monomers at individual Grubbs II molecular ruthenium catalysts, were spatiotemporally resolved as green flashes in growing polymers. In this work, we discuss the development of this technique from idea to application, including challenges overcome and strategies created to image synthetic organic and organometallic molecular chemistry at the highest levels of detection sensitivity. We also describe challenges not yet solved and provide an outlook for this growing field at the intersection of microscopy and synthetic/molecular chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Universal Polarization Transformations: Spatial Programming of Polarization Scattering Matrices Using a Deep Learning‐Designed Diffractive Polarization Transformer

Abstract Controlled synthesis of optical fields having nonuniform polarization distributions presents a challenging task. Here, a universal polarization transformer is demonstrated that can synthesize a large set of arbitrarily‐selected, complex‐valued polarization scattering matrices between the polarization states at different positions within its input and output field‐of‐views (FOVs). This framework comprises 2D arrays of linear polarizers positioned between isotropic diffractive layers, each containing tens of thousands of diffractive features with optimizable transmission coefficients. After its deep learning‐based training, this diffractive polarization transformer can successfully implement N i N o = 10 000 different spatially‐encoded polarization scattering matrices with negligible error, where N i and N o represent the number of pixels in the input and output FOVs, respectively. This universal polarization transformation framework is experimentally validated in the terahertz spectrum by fabricating wire‐grid polarizers and integrating them with 3D‐printed diffractive layers to form a physical polarization transformer. Through this set‐up, an all‐optical polarization permutation operation of spatially‐varying polarization fields is demonstrated, and distinct spatially‐encoded polarization scattering matrices are simultaneously implemented between the input and output FOVs of a compact diffractive processor. This framework opens up new avenues for developing novel devices for universal polarization control and may find applications in, e.g., remote sensing, medical imaging, security, material inspection, and machine vision.

Optical neural networks↗

Aligning parallel arrays to reduce communication

Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

Sheffler, Thomas J.↗

Reduction of truncation errors in modal analysis

A condensation method and computer program are described for large discrete parameter vibration analysis of complex structures that greatly reduces truncation errors and provides accurate definition of modes in a selected frequency range. A dynamic transformation is obtained from the partitioned equations of motion that relates modes not explicitly in the condensed solution to the retained modes at a selected system frequency. The generalized mass and stiffness matrices, obtained with existing modal synthesis methods, are reduced using this transformation and solved. Revised solutions are then obtained using new transformations at the calculated eigenvalues and are also used to assess the accuracy of the results. Computations are made tractable by simplified forms of the transformation that result with various modal synthesis methods. Three examples using the dynamic transformation in conjunction with a General Electric stiffness coupling method and the method of Craig and Bampton indicate large reductions in truncation errors and demonstrate the method for sequential groups of modes.

Kuhar, E. J.↗

Efficient Two-Dimensional-FFT Program

Program computes 64 X 64-point fast Fourier transform in less than 17 microseconds. Optimized 64 X 64 Point Two-Dimensional Fast Fourier Transform combines performance of real- and complex-valued one-dimensional fast Fourier transforms (FFT's) to execute two-dimensional FFT and coefficients of power spectrum. Coefficients used in many applications, including analyzing spectra, convolution, digital filtering, processing images, and compressing data. Source code written in C, 8086 Assembly, and Texas Instruments TMS320C30 Assembly languages.

Miko, J.↗

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Guide to the Distributed Energy Resource Risk Management Framework

The emergence of distributed energy resources (DERs) has transformed the electric power sector and will likely have even more profound impacts on the future evolution of the United States energy sector as it modernizes and becomes more reliant upon complex informatics programming and systems to ensure that our power grid remains safe from malicious interference. To mitigate risks associated with the increased and diversified use of DERs, the Distributed Energy Resource Cybersecurity Framework (DER-CF) was developed in 2019. The National Renewable Energy Laboratory extended the scope of the DER-CF to include the RMF. To address the challenges faced by federal energy managers and energy system stakeholders in applying the RMF to DER systems, the Distributed Energy Resource Risk Manager (DER-RM) is a six-step process to proactively manage cybersecurity risk in a methodical manner. The DER-RM is independent of the DER-CF's existing assessment, allowing users to focus specifically on the RMF steps. The tools are targeted to different processes - DER-CF enables organizations to perform self-assessments to improve their cybersecurity posture, while DER-RM assists organizations in achieving compliance with specific requirements. This document provides an overview of the DER-RM. The RMF process outlined in this report serves as a guide to diagnose information and operational system threats, gather required materials to comply with industry standards, and document plans for achieving Authority to Operate. Using the DER-RM, federal agencies and other organizations can easily and intuitively follow the RMF process, manage the risks to their grid-edge infrastructure through the integration of their on-site DERs, and comply with appropriate requirements.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Analysis of At-Altitude LTE Power Spectra for C2 Communications for UAS Traffic Management

The National Aeronautics and Space Administration’s (NASA) Unmanned Aircraft Systems Traffic Management (UTM) project works to develop tools and technologies essential for safely enabling civilian low-altitude small Unmanned Aerial Systems (sUAS, also known as drones) operations. This paper presents results of work completed in the paper [1] presented at the 2018 ICNS conference where proposed approaches were explored for evaluating and analyzing sUAS Command and Control (C2) links based on commercial cellular networks. This paper focuses on the UTM Project’s Technology Capability Level 3 (TCL-3) test results which address the communications portion identified within the same paper. A software defined radio (SDR) was flown as a sUAS payload to capture received signal spectrum in Long Term Evolution (LTE) frequency bands of interest. The purpose was to measure the RF environment at UTM altitudes to characterize the interference potential. The SDR payload was flown at various stationary altitudes where the LTE over-the-air complex (I/Q) samples were captured by the SDR and later post-processed. The SDR received inputs through an omnidirectional antenna. The complex samples captured were an aggregate of transmissions received from all line-of-sight (LOS) towers within the geographic area for the specific radio frequency bandwidth the SDR is programmed to capture. Using this approach, the complex samples captured do not distinguish between the various eNodeB's (Long Term Evolution (LTE) transmitting towers). The complex samples were post processed via a Discrete Fourier Transform (DFT) algorithm to view the captured spectrum along with the power levels across the captured LTE bandwidth. This SDR payload process of capturing complex samples was done at two different regions within the US: 1) NASA's Ames Research Center (ARC) in Moffett Field, CA, and 2) Griffiss Airfield in Rome, NY. The data capture at the ARC site was done at two physical locations within the Ames campus where many stationary altitude captures where done as high as 800 ft. above ground level (AGL). The data captured at the Griffiss Airport (also known as the NY Corridor Site) were acquired at one location with three specific stationary altitude levels – {Ground Level (GL), 300 ft., and 400 ft.}. The LTE spectrum power levels were captured for two LTE carriers, AT&T and Verizon, at both sites where their respective spectra and power levels were measured and compared at various altitudes. The overall results show that there is an increase in LTE spectrum power levels at higher altitudes for drones. A detailed analysis of this data and conclusions drawn from the results are presented in this paper.

Kerczewski, Robert J.↗