Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “FACTS”

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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Self-calibration strategies for reducing systematic slope measurement errors of autocollimators in deflectometric profilometry

Deflectometric profilometers are used to precisely measure the form of beam shaping optics of synchrotrons and X-ray free-electron lasers. They often utilize autocollimators which measure slope by evaluating the displacement of a reticle image on a detector. Based on our privileged access to the raw image data of an autocollimator, novel strategies to reduce the systematic measurement errors by using a set of overlapping images of the reticle obtained at different positions on the detector are discussed. It is demonstrated that imaging properties such as, for example, geometrical distortions and vignetting, can be extracted from this redundant set of images without recourse to external calibration facilities. This approach is based on the fact that the properties of the reticle itself do not change – all changes in the reticle image are due to the imaging process. Firstly, by combining interpolation and correlation, it is possible to determine the shift of a reticle image relative to a reference image with minimal error propagation. Secondly, the intensity of the reticle image is analysed as a function of its position on the CCD and a vignetting correction is calculated. Thirdly, the size of the reticle image is analysed as a function of its position and an imaging distortion correction is derived. It is demonstrated that, for different measurement ranges and aperture diameters of the autocollimator, reductions in the systematic errors of up to a factor of four to five can be achieved without recourse to external measurements.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Unsupervised learning approaches to characterizing heterogeneous samples using X-ray single-particle imaging

One of the outstanding analytical problems in X-ray single-particle imaging (SPI) is the classification of structural heterogeneity, which is especially difficult given the low signal-to-noise ratios of individual patterns and the fact that even identical objects can yield patterns that vary greatly when orientation is taken into consideration. Proposed here are two methods which explicitly account for this orientation-induced variation and can robustly determine the structural landscape of a sample ensemble. The first, termed common-line principal component analysis (PCA), provides a rough classification which is essentially parameter free and can be run automatically on any SPI dataset. The second method, utilizing variation auto-encoders (VAEs), can generate 3D structures of the objects at any point in the structural landscape. Both these methods are implemented in combination with the noise-tolerant expand–maximize–compress (EMC) algorithm and its utility is demonstrated by applying it to an experimental dataset from gold nanoparticles with only a few thousand photons per pattern. Both discrete structural classes and continuous deformations are recovered. These developments diverge from previous approaches of extracting reproducible subsets of patterns from a dataset and open up the possibility of moving beyond the study of homogeneous sample sets to addressing open questions on topics such as nanocrystal growth and dynamics, as well as phase transitions which have not been externally triggered.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Improved joint X-ray and neutron refinement procedure in Phenix

Neutron diffraction is one of the three crystallographic techniques (X-ray, neutron and electron diffraction) used to determine the atomic structures of molecules. Its particular strengths derive from the fact that H (and D) atoms are strong neutron scatterers, meaning that their positions, and thus protonation states, can be derived from crystallographic maps. However, because of technical limitations and experimental obstacles, the quality of neutron diffraction data is typically much poorer (completeness, resolution and signal to noise) than that of X-ray diffraction data for the same sample. Further, refinement is more complex as it usually requires additional parameters to describe the H (and D) atoms. The increase in the number of parameters may be mitigated by using the `riding hydrogen' refinement strategy, in which the positions of H atoms without a rotational degree of freedom are inferred from their neighboring heavy atoms. However, this does not address the issues related to poor data quality. Therefore, neutron structure determination often relies on the presence of an X-ray data set for joint X-ray and neutron (XN) refinement. In this approach, the X-ray data serve to compensate for the deficiencies of the neutron diffraction data by refining one model simultaneously against the X-ray and neutron data sets. To be applicable, it is assumed that both data sets are highly isomorphous, and preferably collected from the same crystals and at the same temperature. However, the approach has a number of limitations that are discussed in this work by comparing four separately re-refined neutron models. To address the limitations, a new method for joint XN refinement is introduced that optimizes two different models against the different data sets. This approach is tested using neutron models and data deposited in the Protein Data Bank. The efficacy of refining models with H atoms as riding or as individual atoms is also investigated.

36 MATERIALS SCIENCE↗
DOE OSTI2021

QLiG: Query Like a Graph For Subgraph Matching

A graph is a natural and flexible modeling approach to represent entities and relationships between them in real-world. A Knowledge Graphs (KG) is a specialized graph with formal and structured representation of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on underlying data model. Various graph query specifications have been developed over the years and have led to the development of different open-sourced and vendor-specific query languages. Such specification are modeled as an extension of relational algebra used to develop relational query languages such as SQL. Such relational concepts do not inherently support graph queries. There is a need to represent graph queries in terms on graph-based components to expedite query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in Labeled Property Graph. We present the query specifications, salient features, and a use case to show functional examples.

Purohit, Sumit↗
DOE OSTI2022

Transactional Knowledge Graph Generation To Model Adversarial Activities

A Knowledge Graph (KG) is a formal and structured representation of facts, relationships, and semantic descriptions of a set of entities. Traditionally, KGs are used to describe metadata about entities and to provide additional context to target application results. Many real-world domains also involve temporal interactions between entities in addition to the metadata data. Modeling these attributed transactions is a critical requirement when using KGs in complex real-world applications. Modeling adversarial activities is one such application that develops methodology and tools to produce realistic large-scale background activity graphs that include embedded Weapons of Mass Destruction (WMD) activity patterns. We present a novel platform for constructing a transactional knowledge graph from a diverse set of sources. We present the core components and architecture of the framework, and a use case for generating a background knowledge graph and WMD activity template to evaluate network alignment and subgraph matching algorithms.

Purohit, Sumit↗
DOE OSTI2020

DeepFreeze: Towards Scalable Asynchronous Checkpointing of Deep Learning Models

In the age of big data, deep learning has emerged as a powerful tool to extract insight and exploit its value, both in industry and scientific applications. One common pattern emerging in such applications is frequent checkpointing of the state of the learning model during training, needed in a variety of scenarios: analysis of intermediate states to explain features and correlations with training data, exploration strategies involving alternative models that share a common ancestor, knowledge transfer, resilience, etc. However, with increasing size of the learning models and popularity of distributed data-parallel training approaches, simple checkpointing techniques used so far face several limitations: low serialization performance, blocking I/O, stragglers due to the fact that only a single process is involved in checkpointing. This paper proposes a checkpointing technique specifically designed to address the aforementioned limitations, introducing efficient asynchronous techniques to hide the overhead of serialization and I/O, and distribute the load over all participating processes. Experiments with two deep learning applications (CANDLE and ResNet) on a pre-Exascale HPC platform (Theta) shows significant improvement over state-of-art, both in terms of checkpointing duration and runtime overhead.

checkpointing↗
DOE OSTI2023

Making Corgis Important for Honeycomb Classification: Adversarial Attacks on Concept-based Explainability Tools

Methods for model explainability have become increasingly critical for testing the fairness and soundness of deep learning. Concept-based interpretability techniques, which use a small set of human-interpretable concept exemplars in order to measure the influence of a concept on a model's internal representation of input, are an important thread in this line of research. In this work we show that these explainability methods can suffer the same vulnerability to adversarial attacks as the models they are meant to analyze. We demonstrate this phenomenon on two well-known concept-based interpretability methods: TCAV and faceted feature visualization. We show that by leveraging the geometry of the problem and carefully perturbing the examples of the concept that is being investigated, we can radically change the output of the interpretability method. The attacks that we propose can either induce positive interpretations (polka dots are an important concept for a model when classifying zebras) or negative interpretations (stripes are not an important factor in identifying images of a zebra). Our work highlights the fact that in safety-critical applications, there is need for security around not only the machine learning pipeline but also the model interpretation process.

Brown, Davis R.↗
DOE OSTI2025

Development of a Practical Secondary Control for Hardware Microgrids

Practical, vendor-agnostic interoperability guidelines for the secondary control architecture of microgrids (MGs) with multiple grid-forming (GFM) inverter-based resources (IBRs) have not yet been developed. Therefore, this paper proposes a generic and vendor-agnostic secondary control architecture that operates with all GFM IBRs and synchronous generators. This secondary control does not require the use of additional measurement devices in the MG and utilizes the inherent communication systems of the GFM units, such as Modbus TCP/IP. The practical challenges of Modbus registers, such as packet loss and quantization error, and their detrimental impacts on secondary control actions are investigated. The proposed three-stage modification for any secondary control architecture to mitigate these impacts includes: 1) averaging the data read, 2) situational event-triggering of the controller, and 3) finite iteration of the controlling action. The proposed method is validated using a 3-..phi.., 480 V, 60 Hz, 500 kVA laboratory hardware microgrid with commercial two GFM IBRs and one diesel generator. The experimental results corroborates the fact the proposed modification in the secondary control architecture is advantageous for practical usage under erroneous measurements.

communication systems↗
DOE OSTI2022

Load Margin Constrained Moving Target Defense against False Data Injection Attacks

Cyber physical security of power systems with high penetration of renewable generation has attracted attention from researchers. One critical issue is that cyber-physical attacks, disguised as uncertain renewable generation, can target conventional power system state estimation (SE). Moving target defense (MTD) is a promising defense strategy to detect stealthy false data injection (FDI) attacks against SE. However, all existing studies myopically perturb the reactance of transmission lines equipped with distributed flexible AC transmission system (D-FACTS) devices without adequately considering the system voltage stability. Exacerbated by the renewable generation uncertainty, existing MTD may cause voltage instability when the power grid is under stress. To address this issue, we propose a novel MTD framework that explicitly considers system voltage stability by using continuation power flow. We utilize the sensitivity matrix of power injection to line impedance, on which an optimization problem for maximizing load margin is formulated. This framework is validated on the IEEE 14-bus system and the IEEE 118-bus system, in which net load redistribution attacks are launched by sophisticated attackers. Steady-state simulations and dynamic simulations on PSS/E show the effectiveness of the proposed framework in circumventing the voltage instability while maintaining the detection effectiveness of MTD. The impact of the proposed method on attack detection effectiveness is also revealed.

Zhang, Hang↗
DOE OSTI2020

Power Factor revisited

Power factor is a term whose value can be found by dividing the power in a load to the product of the voltage and the current. It has been used as a rule of thumb to estimate the cost of the losses incurred in delivering reactive power. But it has been extremely troublesome. The same load might be penalized by some definitions, and might not by others. That is still the situation today. There have been two efforts at solution. In 1919 a committee of experts was formed to solve the problem of its definition. The effort did not succeed at producing a definition; two alternatives were recommended in the committee’s final report, but both were adopted. In 2010, IEEE issued Standard 1459 to give definitions. In this standard, definitions of power factor appear under no less than seven different headings. The problem demands solution. The matter is of considerable economic importance to power producers, consumers, and instrument makers. This paper examines the history of the topic, and explores reasons for the difficulty of definition in terms of measurement theory. It is shown that power factor is not suited to purpose. In fact, no definition can exist that will define power factor usefully for its intended economic purpose. Two alternatives are proposed.

power factror, definitions, measurement theory, IE↗
DOE OSTI2021

Con Connections: Detecting Fraud from Abstracts using Topological Data Analysis

In this paper we present a novel approach for identifying fraudulent papers from their titles and abstracts. The premise of the approach is that there are holes in the presentation of the approach and findings of fraudulent research papers. As an abstract is intended to highlight key features of the approach as well as important conclusions the authors seek to determine if the assumed existence of holes can be identified from analysis of abstracts alone. The data set considered is derived from papers sharing a single author with labels determined based on a formal linguistic analysis of the complete documents. To detect these logical and literary holes we utilize techniques from topological data analysis which summarizes data based on the presence of multi-dimensional, topological holes. We find that, in fact, topological features derived through a combination of techniques in natural language processing and time-series analysis allow for superior detection of the fraudulent papers than the natural language processing tools alone. Thus we conclude that the connections and holes present in the abstracts of research cons contributes to an ability to infer the scientific validity of the corresponding work.

Tymochko, Sarah J.↗
DOE OSTI2021

Optimized Quantum Program Execution Ordering to Mitigate Errors in Simulations of Quantum Systems

Simulating the time evolution of a physical system at quantum mechanical levels of detail - known as Hamiltonian Simulation (HS) - is an important and interesting problem across physics and chemistry. For this task, algorithms that run on quantum computers are known to be exponentially faster than classical algorithms; in fact, this application motivated Feynman to propose the construction of quantum computers. Nonetheless, there are challenges in reaching this performance potential. Prior work has focused on compiling circuits (quantum programs) for HS with the goal of maximizing either accuracy or gate cancellation. Our work proposes a compilation strategy that simultaneously advances both goals. At a high level, we use classical optimizations such as graph coloring and travelling salesperson to order the execution of quantum programs. Specifically, we group together mutually commuting terms in the Hamiltonian (a matrix characterizing the quantum mechanical system) to improve the accuracy of the simulation. We then rearrange the terms within each group to maximize gate cancellation in the final quantum circuit. Furthermore, these optimizations work together to improve HS performance and result in an average 40% reduction in circuit depth. This work advances the frontier of HS which in turn can advance physical and chemical modeling in both basic and applied sciences.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Operation of AlGaN Channel HEMTs at 850 °C With ON/OFF Ratio >10 4

Here, we report 850 ° C operation of ultrawide bandgap (UWBG) Al-rich Al 0.68 Ga 0.32 N channel high electron mobility transistors (HEMTs) at atmospheric pressure in nitrogen ambient. Temperature dependent DC electrical characteristics were measured in situ up to 850 ° C, after exposure to 850 ° C for 60 minutes, and at 25 ° C after high temperature testing. At 850 ° C (time, t = 0 min), all HEMTs tested maintained an on/off ratio greater than 10 4 (maximum of 4.6 × 10 4 ). The threshold voltage demonstrated excellent stability with less than ±10% deviation. After returning to 25 ° C, the devices showed negligible degradation. In fact, the off-state gate current decreased and on/off ratio slightly increased. The robustness of these UWBG AlGaN transistors at temperatures up to 850 ° C demonstrates their viability for extreme environment applications.

AlGaN↗
DOE OSTI2023

Exascale Was Not Inevitable; Neither Is What Comes Next

The long, steady advance of supercomputing capabilities historically makes it tempting to assume that similar future improvements are inevitable. In fact, the successful path to exascale systems was far from certain, requiring a shift to accelerator-based designs, an associated end-to-end rethinking of traditional computational approaches, and a fundamental change in how scientists collaborate and interact. Here in this article, we share lessons from the U.S. Department of Energy Exascale Computing Project along with perspectives on how to design and implement scientific applications in the exascale and post-exascale eras.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Grid Edge Visibility: Gaps and a Road Map

Behind-The-Meter (BTM) resources at the grid edge are rapidly becoming an important component of the electric grid, requiring a substantial reconfiguration of traditional grid practices, such as policy changes, market redesign, and infrastructure upgrades. This adjustment is challenged by the fact that, by definition, grid edge elements are not easily observable by grid control entities. Increasing the visibility of these resources is therefore an important goal, one that is experiencing much research and discussion by various power system stakeholders. For example, policy makers are analyzing the tradeoffs of using grid edge meters to impose charges on grid edge electricity generation. System operators, such as the Midcontinent Independent System Operator (MISO) in the United States, can identify visibility information on the electrical location and the size of the grid edge resources as a critical consideration across the transmission-and-distribution (T&D) spectrum. This article summarizes the challenges and needs of grid entities resulting from the introduction of grid edge resources as well the gaps in the extant grid edge visibility frameworks.

behind-the-meter↗
DOE OSTI2023

Geodesic-based relaxation for deep canonical correlation analysis

Deep canonical correlation analysis (DCCA) is often applied to paired data samples from diverse sources to extract meaningful common information. However, when the data sources are heterogeneous, some of the useful information may be complementary but not exactly common. In spite of this fact, existing techniques learn maximally correlated representations from multiple views and are formulated so that they aim to yield identical latent subspaces for each view. This approach is sub-optimal in estimating the true signal subspaces for heterogeneous data sources. We propose a residual relaxation for deep canonical correlation analysis (RDCCA) based on a subspace distance metric, which generalizes the existing problem formulation and extracts representations that are better estimates of the actual, non-identical subspaces. We demonstrate that when using such a relaxation, the learned representations are closer to the true ones and that RDCCA outperforms CCA and DCCA in scenarios with heterogeneous data.

Kuschel, Maurice↗
DOE OSTI2022

Unsafe at Any Clock Speed: The Insecurity of Computer System Design, Implementation, and Operation

It appears that there are enormous differences of opinion as to the probability of a [system failure]. The higher figures come from the working engineers, and the very low figures from management. When playing Russian roulette the fact that the first shot got off safely is little comfort for the next. [T]here have been recent suggestions by management to curtail elaborate and expensive tests as being unnecessary. However, this must be resisted. The proper way to save money is to curtail the number of requested changes, not the quality of testing for each.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Robust Solution Approach for Bilevel Demand Response Game at Distribution Level

In this paper, a bilevel electricity pricing and demand response game between a distribution system operator (DSO) and load aggregators (LAs) is considered, and a robust decision model is proposed for the DSO to deal with the uncertainties from the wholesale market prices and demand consumptions of LAs. With the max-min objective at the upper level, the robust bilevel model is converted into a single level model by the Karush-Kuhn-Tucker (KKT) conditions and prime-dual transformation. Several groups of experiments have been conducted based on different preferences on uncertainty gaps and peak load reductions to show its effectiveness. After-the-fact scenario analysis has indicated that the robust solution is more beneficial in reducing the risk of inaccurate predictions as compared to the risk neutral strategy.

Chen, Yang↗