Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Relevance Vector Machine Image Reconstruction Algorithm for Electrical Capacitance Tomography With Explicit Uncertainty Estimates

We present a Relevance Vector Machine (RVM) based algorithm for electrical capacitance tomography (ECT) applications that can concurrently provide image reconstruction results and uncertainty estimates about the reconstruction. To illustrate the RVM operation in ECT, we simulate typical ECT scenarios, making explicit the connection between the reconstructed pixel values and the corresponding uncertainty estimates in each case. We compare the RVM reconstruction performance with that of the Iterative Landweber Method (ILM) and the least absolute shrinkage and selection operator (LASSO) in all the considered scenarios. The results show that, in addition to the key advantage of providing uncertainty measures, RVM can achieve similar reconstruction results with either lower or similar computational complexity.

42 ENGINEERING↗
NASA NTRS1994

Design and Implementation of a Distributed Version of the NASA Engine Performance Program

Distributed NEPP is a new version of the NASA Engine Performance Program that runs in parallel on a collection of Unix workstations connected through a network. The program is fault-tolerant, efficient, and shows significant speed-up in a multi-user, heterogeneous environment. This report describes the issues involved in designing distributed NEPP, the algorithms the program uses, and the performance distributed NEPP achieves. It develops an analytical model to predict and measure the performance of the simple distribution, multiple distribution, and fault-tolerant distribution algorithms that distributed NEPP incorporates. Finally, the appendices explain how to use distributed NEPP and document the organization of the program's source code.

Cours, Jeffrey T.↗
NASA NTRS1995

An executable specification for the message processor in a simple combining network

While the primary function of the network in a parallel computer is to communicate data between processors, it is often useful if the network can also perform rudimentary calculations. That is, some simple processing ability in the network itself, particularly for performing parallel prefix computations, can reduce both the volume of data being communicated and the computational load on the processors proper. Unfortunately, typical implementations of such networks require a large fraction of the hardware budget, and so combining networks are viewed as being impractical. The FFP Machine has such a combining network, and various characteristics of the machine allow a good deal of simplification in the network design. Despite being simple in construction however, the network relies on many subtle details to work correctly. This paper describes an executable model of the network which will serve several purposes. It provides a complete and detailed description of the network which can substantiate its ability to support necessary functions. It provides an environment in which algorithms to be run on the network can be designed and debugged more easily than they would on physical hardware. Finally, it provides the foundation for exploring the design of the message receiving facility which connects the network to the individual processors.

Middleton, David↗
DOE OSTI2023

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Conformal bootstrap deformations

We explore the space of extremal functionals in the conformal bootstrap. By recasting the bootstrap problem as a set of non-linear equations parameterized by the CFT data, we find an efficient algorithm for converging to the extremal solution corresponding to the boundary of allowed regions in the parameter space of CFTs. Furthermore, by deforming these solutions, we demonstrate that certain solutions corresponding to known theories are continuously connected. Employing these methods, we will explore the space of non-unitary CFTs in the context of modular as well as correlation function bootstrap. In two dimensions, we show that the extremal solution corresponding to the Ising model is connected to that of the Yang-Lee minimal model. By deforming this solution to three dimensions, we provide evidence that the CFT data obtained in this way is compatible with the E-expansion for a non-unitary theory

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Investigating capacity credit sensitivity to reliability metrics and computational methodologies

Assigning capacity value to renewable energy sources (RES) is a challenge faced in planning their integration with the grid. The difficulties stem from the natural characteristics of variability and intermittency of wind and solar sources. The capacity credit (CC) analysis evaluates the system’s actual power output compared with a constant capacity generator, i.e., conventional generator and determines an effective capacity to use for planning and operation. Herein this paper presents different factors that could affect the CC of a system. Two methods are proposed to determine the CC, namely equivalent firm capacity (EFC) and effective load carrying capability (ELCC). Since these methods are based on satisfying reliability criteria, daily loss of load expectation (LOLE), hourly loss of load (LOLH), and expected energy not served (EENS) have been employed as indices. To obtain the CC value, both methods apply two techniques: traditional and optimization. Genetic algorithm (GA) is the optimization approach used in this paper. Then, this work compares the two techniques and shows the superior performance of the optimization approach. Two hybrid systems, stand-alone (SA) and grid-connected (GC) modes, are proposed and used as case studies. The hybrid systems consist of photovoltaic (PV), wind turbine (WT), and battery energy storage system (BESS). In this work, three different scenarios are used to compare capacity credit: system as a whole, only wind, and no batteries. Finally, sensitivity analysis is carried out to examine the impact of varying the wind speed, solar irradiation, and load. It is demonstrated that the choice of reliability index plays an important role in determining the capacity credit and it is shown that EENS is a more comprehensive and consistent index of reliability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

‘Flux+Mutability’: a conditional generative approach to one-class classification and anomaly detection

Abstract Anomaly Detection is becoming increasingly popular within the experimental physics community. At experiments such as the Large Hadron Collider, anomaly detection is growing in interest for finding new physics beyond the Standard Model. This paper details the implementation of a novel Machine Learning architecture, called Flux+Mutability, which combines cutting-edge conditional generative models with clustering algorithms. In the ‘flux’ stage we learn the distribution of a reference class. The ‘mutability’ stage at inference addresses if data significantly deviates from the reference class. We demonstrate the validity of our approach and its connection to multiple problems spanning from one-class classification to anomaly detection. In particular, we apply our method to the isolation of neutral showers in an electromagnetic calorimeter and show its performance in detecting anomalous dijets events from standard QCD background. This approach limits assumptions on the reference sample and remains agnostic to the complementary class of objects of a given problem. We describe the possibility of dynamically generating a reference population and defining selection criteria via quantile cuts. Remarkably this flexible architecture can be deployed for a wide range of problems, and applications like multi-class classification or data quality control are left for further exploration.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Model-based interface design for smart field-device integration

Operational complexity is ever-increasing for electric utilities that face challenges including integration of DERs, customer expectation of energy choices, the proliferation of non-utility-owned resources, new business models with energy service providers, and new technology with IT/OT convergence. To maintain and improve the quality of operations, planning, and decision-making in general, utilities need to manage and navigate the complexity. Managing complexity requires a modular, scalable, and flexible solution. Connecting large amounts of DERs and introducing new services requires increased grid control and evolving applications. In this paper, we show an approach utilizing model-based standardized interfaces that simplifies integration and deployment of new algorithms and smart field devices for interoperability across legacy or new systems. A modular design is presented for a reference implementation of widely used DNP3 and IEEE 2030.5 interfaces within an open-source, standards-based data integration platform for integration of smart field devices with independently developed, best-of-breed applications.

Model-driven development, system integration, smar↗
NASA NTRS1977

Some aspects of the inversion problem in remote sensing

Several commonly used methods for inversion--constrained linear inversion, synthesis (Backus-Gilbert) methods and nonlinear iterative techniques for the Chahine type--are discussed. It is demonstrated that a very close connection exists between Backus-Gilbert solutions and those given by constrained linear inversion. A number of examples of the application of such methods are presented, showing that resolution is not greatly different for quite different algorithms, a result quite in accord with general theoretical considerations: more resolution can be achieved at the expense of introducing greater a priori bias in the procedure.

Twomey, S.↗
NASA NTRS2002

Distributed Framework for Dynamic Telescope and Instrument Control

Traditionally, instrument command and control systems have been developed specifically for a single instrument. Such solutions are frequently expensive and are inflexible to support the next instrument development effort. NASA Goddard Space Flight Center is developing an extensible framework, known as Instrument Remote Control (IRC) that applies to any kind of instrument that can be controlled by a computer. IRC combines the platform independent processing capabilities of Java with the power of the Extensible Markup Language (XML). A key aspect of the architecture is software that is driven by an instrument description, written using the Instrument Markup Language (IML). IML is an XML dialect used to describe graphical user interfaces to control and monitor the instrument, command sets and command formats, data streams, communication mechanisms, and data processing algorithms. The IRC framework provides the ability to communicate to components anywhere on a network using the JXTA protocol for dynamic discovery of distributed components. JXTA (see httD://www.jxta.org,) is a generalized protocol that allows any devices connected by a network to communicate in a peer-to-peer manner. IRC uses JXTA to advertise a device's IML and discover devices of interest on the network. Devices can join or leave the network and thus join or leave the instrument control environment of IRC. Currently, several astronomical instruments are working with the IRC development team to develop custom components for IRC to control their instruments. These instruments include: High resolution Airborne Wideband Camera (HAWC), a first light instrument for the Stratospheric Observatory for Infrared Astronomy (SOFIA); Submillimeter And Far Infrared Experiment (SAFIRE), a Principal Investigator instrument for SOFIA; and Fabry-Perot Interferometer Bolometer Research Experiment (FIBRE), a prototype of the SAFIRE instrument, used at the Caltech Submillimeter Observatory (CSO). Most recently, we have been working with the Submillimetre High Angular Resolution Camera IInd Generation (SHARCII) at the CSO to investigate using IRC capabilities with the SHARC instrument.

Ames, Troy J.↗
DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids: Preprint

Increase in the proliferation of DERs requires real-time situational awareness for efficient grid operations. State estimation plays an important role for real time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hierarchical spectral clustering-based network partition algorithm followed by a decentralized compressive sensing (DCS) based state estimation. The applicability of the proposed network partitioning algorithm is tested on IEEE-123 bus, IEEE-8500 node, and a 6204-node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6204-node distribution network after dividing the network into 18 optimal partitions. Simulation results show that DCS-based state estimation recovers the system states with high accuracy and low complexity.

ADMM↗
NASA NTRS1993

Time-domain analysis of planar microstrip devices using a generalized Yee-algorithm based on unstructured grids

The generalized Yee-algorithm is presented for the temporal full-wave analysis of planar microstrip devices. This algorithm has the significant advantage over the traditional Yee-algorithm in that it is based on unstructured and irregular grids. The robustness of the generalized Yee-algorithm is that structures that contain curved conductors or complex three-dimensional geometries can be more accurately, and much more conveniently modeled using standard automatic grid generation techniques. This generalized Yee-algorithm is based on the the time-marching solution of the discrete form of Maxwell's equations in their integral form. To this end, the electric and magnetic fields are discretized over a dual, irregular, and unstructured grid. The primary grid is assumed to be composed of general fitted polyhedra distributed throughout the volume. The secondary grid (or dual grid) is built up of the closed polyhedra whose edges connect the centroid's of adjacent primary cells, penetrating shared faces. Faraday's law and Ampere's law are used to update the fields normal to the primary and secondary grid faces, respectively. Subsequently, a correction scheme is introduced to project the normal fields onto the grid edges. It is shown that this scheme is stable, maintains second-order accuracy, and preserves the divergenceless nature of the flux densities. Finally, for computational efficiency the algorithm is structured as a series of sparse matrix-vector multiplications. Based on this scheme, the generalized Yee-algorithm has been implemented on vector and parallel high performance computers in a highly efficient manner.

Gedney, Stephen D.↗
DOE OSTI2026

Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications

This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗
DOE OSTI2021

Dynamic consensus and extended high gain observers as a tool to achieve practical frequency synchronization in power systems under unknown time-varying power demand

In this paper, we consider the frequency synchronization problem in a network of lossless, connected, and network-reduced power system. Frequency synchronization is an important problem in power systems as frequency deviation can lead to degraded power quality, tripping of generators, etc. We present a load-estimator-based consensus algorithm in a network of fourth-order generator models that achieves practical frequency synchronization in the presence of unknown time-varying power demand. We do not assume that the demand is generated by a known model. We follow a multiple time-scale approach for the stability analysis. It is shown that synchronization is achieved for the case of constant power demand, by showing that the system is exponentially stable. Furthermore, for the case of time-varying power demand, we show the error trajectories are ultimately bounded, and the synchronization error is proportional to an upper bound on the derivative of the time-varying power demand. We simulate the controller performance on a four area network which is equivalent to the IEEE New England 39-Bus system.

42 ENGINEERING↗
DOE OSTI2026

FIB-ToF-SIMS characterization of irradiated U-10Zr

Post-irradiation examination (PIE) is critical for the performance assessment and qualification of nuclear fuels. Secondary ion mass spectrometry (SIMS) is a powerful materials characterization technique that allows for elemental and isotopic mapping with a depth resolution greater than EDS and EPMA. However, it has not yet been applied to PIE of metallic nuclear fuel. Here, in this work, we characterize an fast neutron spectrum irradiated U-10Zr fuel sample using a time-of-flight SIMS (ToF-SIMS) system connected to a FIB/SEM system, which allows for flexible sample analysis compared to a dedicated ToF-SIMS instrument. Analysis of the resulting hyperspectral micrograph data was aided by the development of an unsupervised machine learning (ML) algorithm that iterates on existing methods to segment the 3D micrographic datasets based on the similarity of mass spectra. The results showed that the FIB-ToF-SIMS instrument was potentially capable of spatially resolving closed fission gas bubbles in 3D by continued ion sputtering of the analyzed volume. Additionally, the ML algorithm proved useful in revealing the chemical segregation of light fission products (those with an atomic mass between approximately 85–105 amu, such as ruthenium and rhodium) plus matrix zirconium, heavy fission products (those with an atomic mass between approximately 135–150 amu, such as the lanthanides) and uranium. Future studies are planned to conduct FIB-ToF-SIMS analysis on more irradiated U-Zr samples to study the constituent redistribution.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2020

Grid Application and Controls Development for Medium-Voltage SiC-Based Grid Interconnects

This paper studies, the grid-interconnection requirements of directly connected medium-voltage (MV) Silicon Carbide-based (SiC-based) converters and details the necessary control implementations. These power electronic converters follow the interconnection standard IEEE 1547-2018, but can also have additional controls supported by the microgrid standards in IEEE 2030.7, which is demonstrated in this work. Additionally, this paper defines the grid applications realized by these directly connected medium-voltage power electronic converters at the distribution scale and demonstrates results. The controls for the studied grid applications are then developed and implemented on the controller. The paper also includes details of the control algorithm development and validations of the control algorithm through hardware-in-the-loop results.

28 EE - Advanced Manufacturing Office (EE-5A)↗
NASA NTRS1985

Digital temperature and velocity control of mach 0.3 atmospheric pressure durability testing burner rigs in long time, unattended cyclic testing

Hardware and software were developed to implement the hybrid digital control of two Jet A-1 fueled Mach 0.3 burners from startup to completion of a preset number of hot corrosion flame durability cycle tests of materials at 1652 F. This was accomplished by use of a basic language programmable microcomputer and data aquisition and control unit connected together by the IEEE-488 Bus. The absolute specimen temperature was controlled to + or - 3 F by use of digital adjustment of the fuel flow using a P-I-D (Proportional-Integral-Derivative) control algorithm. The specimen temperature was within + or - 2 F of the set point more than 90 percent of the time. Pressure control was achieved by digital adjustment of the combustion air flow using a proportional control algorithm. The burner pressure was controlled at 1.0 + or - 0.02 psig. Logic schemes were incorporated into the system to protect the test specimen from abnormal test conditions in the event of a hardware of software malfunction.

Deadmore, D. L.↗