Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Preservation”

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

A Privacy-Preserving Cyber Threat Intelligence Sharing System

Cyber Threat Intelligence (CTI) is a key resource for developing defensive strategies against potential cyber adversaries. Entities typically access CTI through open-source platforms, national agencies, or specialized commercial services. However, the bi-directional exchange of CTI is hindered by organizational trust boundaries, which complicate the sharing processes between entities and CTI providers. Centralized CTI services benefit from receiving suspicious cyber observables such as IP addresses, domain names, and email addresses from various entities. The aggregation allows for the correlation of widespread adversarial activities to enhance the alert and response mechanisms across the network of involved parties. Despite these benefits, openly sharing such observables incurs potential legal, regulatory, and reputational risks for the disclosing entities.This paper introduces a system designed to facilitate the secure exchange of cyber observables across trust boundaries without compromising the anonymity of the sharing entities. Here, we propose an architecture that leverages common web protocols alongside zero-knowledge proofs to authenticate members while maintaining anonymity. Additionally, we outline a privacy model tailored for STIX (Structured Threat Information eXpression) cyber observables to minimize the risk of inadvertently disclosing private information. Through our threat models, we assess the privacy implications of our proposed system and demonstrate its potential to enhance collaborative cyber defense efforts without exposing entities to undue risk.

BBS+ Signatures↗
DOE OSTI2023

Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers

In this article, we discuss some aspects related to the symmetries of a quantum many-body problem when trying to treat it on a quantum computer. Several features related to symmetry conservation, symmetry breaking, and possible symmetry restoration are reviewed. After briefly discussing some of the standard symmetries relevant for many-particle systems, we discuss the advantage of encoding some symmetries directly in quantum ansätze, especially to reduce the quantum register size. It is, however, well-known that the use of symmetry-breaking states can also be a unique way to incorporate specific internal correlations when a spontaneous symmetry breaking occurs. These aspects are discussed in the quantum computing context. Ultimately, an accurate description of quantum systems can be achieved only when the initially broken symmetries are properly restored. We review several methods explored previously to perform symmetry restoration on a quantum computer, for instance, the ones based on symmetry filtering by quantum phase estimation and by an iterative independent set of Hadamard tests. We propose novel methods that pave the new directions to perform symmetry restoration, like those based on the purification of the state employing the linear combination of unitaries (LCU) approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Bound-preserving finite element approximations of the Keller–Segel equations

We report this paper aims to develop numerical approximations of the Keller–Segel equations that mimic at the discrete level the lower bounds and the energy law of the continuous problem. We solve these equations for two unknowns: the organism (or cell) density, which is a positive variable, and the chemoattractant density, which is a non-negative variable. We propose two algorithms, which combine a stabilized finite element method and a semi-implicit time integration. The stabilization consists of a nonlinear artificial diffusion that employs a graph-Laplacian operator and a shock detector that localizes local extrema. As a result, both algorithms turn out to be nonlinear and can generate cell and chemoattractant numerical densities fulfilling lower bounds. However, the first algorithm requires a suitable constraint between the space and time discrete parameters, whereas the second one does not. We design the latter to attain a discrete energy law on acute meshes. We report some numerical experiments to validate the theoretical results on blowup and nonblowup phenomena. In the blowup setting, we identify a locking phenomenon that relates the L ∞ (Ω)-norm to the L 1 (Ω)-norm limiting the growth of the singularity when supported on a macroelement.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Preserving Contextual Awareness during Selection of Moving Targets in Animated Stream Visualizations

In many types of dynamic interactive visualizations, it is often desired to interact with moving objects. Stopping moving objects can make selection easier, but pausing animated content can disrupt perception and understanding of the visualization. To address such problems, we explore selection techniques that only pause a subset of all moving targets in the visualization. We present various designs for controlling pause regions based on cursor trajectory or cursor position. We then report a dual-task experiment that evaluates how different techniques affect both target selection performance and contextual awareness of the visualization. Our findings indicate that all pause techniques significantly improved selection performance as compared to the baseline method without pause, but the results also show that pausing the entire visualization can interfere with contextual awareness. However, the problem with reduced contextual awareness was not observed with our new techniques that only pause a limited region of the visualization. Thus, our research provides evidence that region-limited pause techniques can retain the advantages of selection in dynamic visualizations without imposing a negative effect on contextual awareness.

Ragan, Eric↗
DOE OSTI2021

An Extreme-Preserving Long-Term Gridded Daily Precipitation Data Set for the Conterminous United States

Extreme daily precipitation contributes to flooding that can cause significant economic damages, and so is important to properly capture in gridded meteorological data sets. This work examines precipitation extremes, the mean precipitation on wet days, and fraction of wet days in two widely used gridded data sets over the conterminous U.S. (CONUS). When compared to the underlying station observations, the gridded data show a 27% reduction in annual 1-day maximum precipitation, 25% increase in wet day fraction, 1.5 to 2.5 day increase in mean wet spell length, 30% low bias in 20-year return values of daily precipitation, and 25% decrease in mean precipitation on wet days. It is shown these changes arise primarily from the time-adjustment applied to put the precipitation gauge observations into a uniform time frame, with the gridding process playing a lesser role. A new daily precipitation data set is developed that omits the time-adjustment (as well as extending the gridded data by 7 years) and is shown to perform significantly better in reproducing extreme precipitation metrics. When the new data set is used to force a land surface model, annually averaged 1-day maximum runoff increases 38% compared to the original data, annual mean runoff increases 17%, evapotranspiration drops 2.3%, and fewer wet days leads to a 3.3% increase in estimated solar insolation. Consequently, these changes are large enough to affect portrayals of flood risk and water balance components important for ecological and climate-change applications across the CONUS.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

A gene-editing/complementation strategy for tissue-specific lignin reduction while preserving biomass yield

Lignification of secondary cell walls is a major factor conferring recalcitrance of lignocellulosic biomass to deconstruction for fuels and chemicals. Genetic modification can reduce lignin content and enhance saccharification efficiency, but usually at the cost of moderate-to-severe growth penalties. We have developed a method, using a single DNA construct that uses CRISPR–Cas9 gene editing to knock-out expression of an endogenous gene of lignin monomer biosynthesis while at the same time expressing a modified version of the gene’s open reading frame that escapes cutting by the Cas9 system and complements the introduced mutation in a tissue-specific manner. Expressing the complementing open reading frame in vessels allows for the regeneration of Arabidopsis plants with reduced lignin, wild-type biomass yield, and up to fourfold enhancement of cell wall sugar yield per plant. The above phenotypes are seen in both homozygous and bi-allelic heterozygous T1 lines, and are stable over at least four generations. The method provides a rapid approach for generating reduced lignin trees or crops with one single transformation event, and, paired with a range of tissue-specific promoters, provides a general strategy for optimizing loss-of-function traits that are associated with growth penalties. This method should be applicable to any plant species in which transformation and gene editing are feasible and validated vessel-specific promoters are available.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Confidentiality-preserving machine learning algorithms for soft-failure detection in optical communication networks

Automated fault management is at the forefront of next-generation optical communication networks. The increase in complexity of modern networks has triggered the need for programmable and software-driven architectures to support the operation of agile and self-managed systems. In these scenarios, the European Telecommunications Standards Institute zero-touch network and service management approach is imperative. The need for machine learning algorithms to process the large volume of telemetry data brings safety concerns as distributed cloud-computing solutions become the preferred approach for deploying reliable communication network automation. This paper’s contribution is twofold. First, we propose a simple yet effective method to guarantee the confidentiality of the telemetry data based on feature scrambling. The method allows the operation of third-party computational services without direct access to the full content of the collected data. Additionally, the effectiveness of four unsupervised machine learning algorithms for soft-failure detection is evaluated when applied to the scrambled telemetry data. The methods are based on factor analysis, principal component analysis, nonlinear principal component analysis, and singular value decomposition. Most dimensionality reduction algorithms have the common property that they can maintain similar levels of fault classification performance while hiding the data structure from unauthorized access. Evaluations of the proposed algorithms demonstrate this capability.

97 MATHEMATICS AND COMPUTING↗