Search NASA⌕ Search

SEARCH · Search NASA

Results for “Boolean Functions”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Skyrmion-Based Programmable Logic Device with Complete Boolean Logic Functions

A skyrmionic programmable logic device (SkrPLD) with complete Boolean logic functions is proposed and analyzed by micromagnetic simulations. The SkrPLD is based on an antiferromagnet/ferromagnet bilayer structure, in which the antiferromagnetic layer supports the interfacial Dzyaloshinskii–Moriya interaction and the out-of-plane exchange bias field for stabilizing a zero-field skyrmion. By varying the local exchange bias field, artificial pinning sites are introduced for trapping the skyrmions. Depending on the input currents and the initial position of skyrmions at different pinning sites, different logic functions can be realized. Micromagnetic simulations show that the proposed SkrPLD has robust performance even under thermal fluctuations and inhomogeneity effects. Our work can provide insights for the design of programmable spin logic devices.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Testing Classical Properties from Quantum Data

Many properties of Boolean functions can be tested far more efficiently than the function itself can be learned. However, this dramatic advantage often disappears when testers are limited to random samples of ƒ instead of adaptively chosen queries to f. In this work we investigate the quantum version of this restriction: quantum algorithms that test properties of a Boolean function f solely from copies of either the function state |ƒ⟩ ∝ ∑ x |x, ƒ(x)⟩ or the phase state |(-1) ƒ ⟩ ∝ ∑ x (-1) ƒ(x) |x⟩. For monotonicity, symmetry, and triangle-freeness, we show passive quantum testers are unboundedly or super-polynomially better than their classical passive testing counterparts. They are competitive with classic query -based testers in each case. Our new testers use techniques beyond quantum Fourier sampling, and it turns out this is necessary: we show a certain class of bent functions can be tested from 𝒪(1) function states but has a sample complexity lower bound of 2 Ω(n) for any tester relying exclusively on Fourier and classical samples. Our passive quantum testers are competitive with classical query -based testers, but this isn't universal: we exhibit a testing problem that can be solved from 𝒪(1) classical queries but requires Ω(2 n/2 ) function state copies. The Forrelation problem provides a separation of the same magnitude in the opposite direction, so we conclude that quantum data and classical queries are "maximally incomparable" resources for testing. We also begin the study of lower bounds for testing from quantum data. For quantum monotonicity testing, we prove that the ensembles of [Goldreich et al., 2000; Black, 2024], which give exponential lower bounds for classical sample-based testing, do not yield any nontrivial lower bounds for testing from quantum data. New insights specific to quantum data will be required for proving copy complexity lower bounds for testing in this model.

Boolean Functions↗
DOE OSTI2023

Noncommutative Bohnenblust–Hille inequalities

Abstract Bohnenblust–Hille inequalities for Boolean cubes have been proven with dimension-free constants that grow subexponentially in the degree (Defant et al. in Math Ann 374(1):653–680, 2019). Such inequalities have found great applications in learning low-degree Boolean functions (Eskenazis and Ivanisvili in Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, pp 203–207, 2022). Motivated by learning quantum observables, a qubit analogue of Bohnenblust–Hille inequality for Boolean cubes was recently conjectured in Rouzé et al. (Quantum Talagrand, KKL and Friedgut’s theorems and the learnability of quantum Boolean functions, 2022. arXiv preprint arXiv:2209.07279 ). The conjecture was resolved in Huang et al. (Learning to predict arbitrary quantum processes, 2022. arXiv preprint arXiv:2210.14894 ). In this paper, we give a new proof of these Bohnenblust–Hille inequalities for qubit system with constants that are dimension-free and of exponential growth in the degree. As a consequence, we obtain a junta theorem for low-degree polynomials. Using similar ideas, we also study learning problems of low degree quantum observables and Bohr’s radius phenomenon on quantum Boolean cubes.

Volberg, Alexander↗
DOE OSTI2023

Predictor-corrector models for lightweight massive machine-type communications in Industry 4.0

Future Industry 4.0 scenarios are characterized by seamless integration between computational and physical processes. To achieve this objective, dense platforms made of small sensing nodes and other resource constraint devices are ubiquitously deployed. All these devices have a limited number of computational resources, just enough to perform the simple operation they are in charge of. The remaining operations are delegated to powerful gateways that manage sensing nodes, but resources are never unlimited, and as more and more devices are deployed on Industry 4.0 platforms, gateways present more problems to handle massive machine-type communications. Although the problems are diverse, those related to security are especially critical. To enable sensing nodes to establish secure communications, several semiconductor companies are currently promoting a new generation of devices based on Physical Unclonable Functions, whose usage grows every year in many real industrial scenarios. Those hardware devices do not consume any computational resource but force the gateway to keep large key-value catalogues for each individual node. In this context, memory usage is not scalable and processing delays increase exponentially with each new node on the platform. In this paper, we address this challenge through predictor-corrector models, representing the key-value catalogues. Models are mathematically complex, but we argue that they consume less computational resources than current approaches. The lightweight models are based on complex functions managed as Laurent series, cubic spline interpolations, and Boolean functions also developed as series. Unknown parameters in these models are predicted, and eventually corrected to calculate the output value for each given key. The initial parameters are based on the Kane Yee formula. An experimental analysis and a performance evaluation are provided in the experimental section, showing that the proposed approach causes a significant reduction in the resource consumption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

K-Spin Hamiltonian for Quantum-Resolvable Markov Decision Processes

The Markov decision process is the mathematical formalization underlying the modern field of reinforcement learning when transition and reward functions are unknown. We derive a pseudo-Boolean cost function that is equivalent to a K-spin Hamiltonian representation of the discrete, finite, discounted Markov decision process with infinite horizon. This K-spin Hamiltonian furnishes a starting point from which to solve for an optimal policy using heuristic quantum algorithms such as adiabatic quantum annealing and the quantum approximate optimization algorithm on near-term quantum hardware. In arguing that the variational minimization of our Hamiltonian is approximately equivalent to the Bellman optimality condition for a prevalent class of environments we establish an interesting analogy with classical field theory. Along with proof-of-concept calculations to corroborate our formulation by simulated and quantum annealing against classical Q-Learning, we analyze the scaling of physical resources required to solve our Hamiltonian on quantum hardware.

Hamiltonian↗
DOE OSTI2023

Logical Activation Functions v.1.1

SAND2024-01501O Logical Activation Functions software is a PyTorch implementation from the paper, "Logical Activation Functions for Training Arbitrary Probabilistic Boolean Logic." The activation functions approximate logit-space marginalization of probabilistic truth tables from probabilistic interpretations of inputs. They also provide a general methodology to approximate logical relationships between abstract antecedents and consequents for machine learning architectures. They do not target any specific application or use-case. By training probabilistic truth tables, these activation functions can capture more expressive relationships in a neural network than typical elementwise activation functions. This code is only designed for a single compute node with a GPU and is limited to machine learning architectures than can fit within the memory of a single GPU. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Duersch, Jed↗
DOE OSTI2025

ROSE Castor

ROSE Castor is a tool enabling automated verification of C++, built off of the ROSE compiler framework and the Why3 framework. Castor defines a verification language for providing specifications of C++ code, letting users perform automated functional formal verification of their C++ code. Castor is designed to target C++17, and supports a subset of the language, including classes, functions, templates, integers and booleans, pointers and references, and single inheritance. Castor currently does not support multiple or virtual inheritance, virtual functions, floating-point, threading, lambda functions, or the C++ STL, though some of these are planned in future updates. Castor ships with an in-house parser for parsing verification conditions.

Lane, PhillipA [Lawrence Livermore National Labora↗
DOE OSTI2022

Fracture-based shape optimization built upon the topological derivative

In Silva et al. (2011) and Alidoost et al. (2020), the authors developed an approximation of the energy release rate field associated with a small edge or surface crack at any boundary location and with any orientation using the topological derivative. The approximation is computationally attractive because it requires only a single analysis on the non-cracked domain in contrast with conventional boundary-element and finite-element-based methods, which require a separate and costlier analysis for each crack length-location-orientation combination. Here, a shape optimization scheme for fracture-resistant structures is developed using the energy release rate approximation. In the gradient-based optimization scheme, the domain and its boundary are defined implicitly using level-set functions. The level-set functions of arbitrary geometries are constructed using Boolean operations from the level-set functions of simple primitives. This geometrical representation has the dual advantage of (i) allowing shapes to intersect and/or separate during the optimization and (ii) simplifying the computation of the shape sensitivities.

42 ENGINEERING↗
DOE OSTI2023

Extending Parsimonious Bayesian Inference

Parsimonious Bayesian inference is a theoretical framework for efficient data assimilation that seeks to balance increased consistency between predictions and training data against corresponding increases in model complexity. Within this framework, over-training is understood as optimization that encodes excessive information within model parameters while only achieving small improvements between predictions and training data. This project aims to develop practical methods of limiting excess model information during optimization. One key observation is that practical heuristics for parsimonious learning in high-dimensions must balance expressivity, i.e. the ability of the model to capture diverse predictions with only a few non-zero parameters, against discoverability, i.e. the ability to train the model with gradient-based optimization and drive parameters to low information states. As such, we developed logical activation functions that are able to adaptively approximate arbitrary truth tables that define Boolean logic operations within a probabilistic framework. These functions have demonstrated the ability to learn exclusive disjunction (XOR) and conditioned disjunction (if [condition] then [result_if_true] else [result_if_false]) within a single layer of a neural network. To efficiently exploit these activation functions to drive parsimonious learning required several other advances within the domain of variational inference. The most efficient form of complexity suppression is structured sparsification, driving most model parameters to zero while achieving the structural coherence among nonzeros needed for bandwidth reduction. Such models are not only far more efficient at suppressing information-theoretic complexity, they also reduce the other forms of complexity (computations, communication, storage, and the number of dependencies needed to evaluate predictions). Aiming to support enhanced sparsification, this project examined new approaches to high-dimensional variational inference that allow us to calibrate and control parameter uncertainty during optimization. By identifying which parameters can sustain sparsifying perturbations with little impact on prediction quality, we can develop better pruning strategies by framing them as approximate Bayesian inference. These advances also open paths to mitigate concerns with deploying advanced learning methods in resource-constrained environments, such as running models on power-limited or communication-limited devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Tunable stochastic memristors for energy-efficient encryption and computing

Information security and computing, two critical technological challenges for post-digital computation, pose opposing requirements – security (encryption) requires a source of unpredictability, while computing generally requires predictability. Each of these contrasting requirements presently necessitates distinct conventional Si-based hardware units with power-hungry overheads. This work demonstrates Cu 0.3 Te 0.7 /HfO 2 (‘CuTeHO’) ion-migration-driven memristors that satisfy the contrasting requirements. Under specific operating biases, CuTeHO memristors generate truly random and physically unclonable functions, while under other biases, they perform universal Boolean logic. Using these computing primitives, this work experimentally demonstrates a single system that performs cryptographic key generation, universal Boolean logic operations, and encryption/decryption. Circuit-based calculations reveal the energy and latency advantages of the CuTeHO memristors in these operations. This work illustrates the functional flexibility of memristors in implementing operations with varying component-level requirements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Inverse Design of Plasma Metamaterial Devices for Optical Computing

We apply inverse-design methods to produce two-dimensional plasma metamaterial (PMM) devices. Backpropagated finite-difference frequency-domain (FDFD) simulations are used to design waveguides and demultiplexers operating under both TE and TM modes. Demultiplexing and waveguiding are demonstrated for devices composed of plasma elements with reasonable plasma densities of approximately 7 GHz, allowing for future in situ training and experimental realization of these designs. We also explore the possible applicability of PMMs to nonlinear boolean operations for use in optical computing. Functionally complete logical connectives (or and and) are achieved in the TM mode.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Circuit complexity and functionality: A statistical thermodynamics perspective

Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge (“wormhole”) connecting the two sides of an anti-de Sitter “eternal” black hole. Here, we are motivated by an independent set of considerations and explore links between complexity and thermodynamics for functionally equivalent circuits, making the physics-inspired approach relevant to real computational problems, for which functionality is the key element of interest. In particular, our thermodynamic framework provides an alternative perspective on the obfuscation of programs of arbitrary length—an important problem in cryptography—as thermalization through recursive mixing of neighboring sections of a circuit, which can be viewed as the mixing of two containers with “gases of gates.” This recursive process equilibrates the average complexity and leads to the saturation of the circuit entropy, while preserving functionality of the overall circuit. The thermodynamic arguments hinge on ergodicity in the space of circuits which we conjecture is limited to disconnected ergodic sectors due to fragmentation. The notion of fragmentation has important implications for the problem of circuit obfuscation as it implies that there are circuits of same size and functionality that cannot be connected via a polynomial number of local moves. Furthermore, we argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide, a statement that implies the collapse of the polynomial hierarchy of computational complexity theory to its first level.

Science & Technology - Other Topics↗
DOE OSTI2020

Simultaneous material, shape and topology optimization

Using three design fields we develop an optimization environment that can simultaneously optimize material, shape and topology. We use the implicit representation of the boundaries with level-set functions that define the shape and topology. Differentiable R-functions allow us to combine these shapes and topology descriptions with Boolean operations. Additionally, we incorporate design dependent-stiffness materials with another design field. Notably, this framework accommodates design dependent loads, has the ability to introduce holes, and ensures the satisfaction of optimality criteria. It builds upon the fictitious domain, ersatz material, material interpolation and level-set methods. Additionally, it also borrows from parameterized density-based topology optimization methods. Since analytical sensitivities can be computed, we use efficient nonlinear programming algorithms to update the design instead of the Hamilton–Jacobi’s scheme of level-set methods. We illustrate the features of our framework by designing a cantilever beam with octet truss microlattice, a dam with design-dependent loads, and a composite clevis plate.

42 ENGINEERING↗
DOE OSTI2026

Juvenile Salmon and Their Habitats in the Columbia River Estuary: A Review and Synthesis of Knowledge Development 2000–2025

[This is a 90% discussion draft.] This is the third Synthesis Memorandum funded by the U.S. Army Corps of Engineers and developed for the Columbia Estuary Ecosystem Restoration Program (CEERP) on the topic of habitat restoration in the Columbia River Estuary (CRE) from Bonneville Dam to the river mouth. While the first two were developed by PNNL and NOAA without the benefit of stakeholder participation, for the current memo, two key activities were initiated: (1) review, by the Expert Regional Technical Group (ERTG), of status and trends monitoring and action effectiveness monitoring funded by CEERP, and (2) a workshop including representatives of the Bonneville Power Administration and the U.S. Army Corps of Engineers (the action agencies [AAs]), the National Oceanic and Atmospheric Administration (NOAA), major research agencies contributing to CEERP, and sponsors who implement CEERP restoration actions. A systematic literature review was conducted using ClarivateTM Web of ScienceTM database. The topics of interest for CRE relevant research included salmon ecology, physical processes, and wetland habitats, and therefore required the use of broad search terms. Our final search criteria included a combination of Boolean operators and an approach to combine different sets of search terms. The final search result yielded 669 records. The records were classified by groups and assigned to the relevant disciplinary expert for review. The review identified substantive advances in understanding the provision of salmon habitat functions through spatiotemporally dynamic physical and ecological processes, and the use of CRE habitats by numerous stocks of juvenile salmon. It also uncovered heretofore unincorporated historical documentation of riparian habitats across the CRE. The characterization of the structural components of floodplain habitat including plant associations and channel networks has advanced considerably, together with the understanding of seasonal changes and long-term trends. The relative influence of salmon-habitat location in the CRE as compared with temporal factors, mainly season, has been well described, which affects the prioritization of restoration. Stressors on the ecosystem and fish, and the drivers of these stressors, have been more carefully elucidated and predictive models are in various stages of development. The vision, aims, and design of restoration projects have advanced together with methods of data collection, analysis, and modeling that have seen substantial improvements. Experiments intended to inform the design of restoration projects are underway or have been completed. An important outstanding area of research that has lagged behind the advances in fundamental understanding of the ecosystem and salmon habitat functions remains the peer-reviewed documentation of the outcomes of restoration for both habitats and fish functions.

estuary↗
DOE OSTI2025

NLR HPC Kestrel Jobs Data

Overview: Anonymized job-level records from the Kestrel HPC system at the National Laboratory of the Rockies (NLR). Each record represents a Slurm batch job with scheduling metadata, resource requests, utilization, energy estimates, and efficiency metrics. Sensitive fields (user, account, job name, submit line, working directory, submit script, and job type) are replaced with 7-character cryptographic hashes. System & Timeframe: Kestrel is located at the NLR campus. Standard compute nodes have 104 cores and 256 GB RAM; bigmem nodes have 2,000 GB. GPU nodes (gpu-h100 partition) use NVIDIA H100 GPUs. Data covers jobs submitted August 2023 through December 2025. Funding provided by the U.S. Department of Energy, EERE. Files: esif.hpc.kestrel.job-anon.zip — Anonymized job records (Hive-partitioned Parquet) datacard.md — Full dataset documentation ~11 million rows, 50 variables. Readable with PyArrow, pandas, DuckDB, Apache Spark, or any Parquet-compatible tool. Data Collection: Jobs collected via sacct with timezone-aware export (SLURM_TIME_FORMAT="%Y-%m-%dT%H:%M:%S%z"), loaded into PostgreSQL. Calculated columns updated via database triggers and batch functions. All timestamps use timestamptz and correctly handle DST transitions. Preprocessing: Anonymization of name, user, account, submit_line, work_dir, submit_script, and job_type via 7-char hex hashes Derived columns: queue_wait, cpu_eff, max/min/avg_mem_eff, energy estimates Simplified job state mapping (e.g., "CANCELLED by 132357" → "CANCELLED") Boolean flags: python_job, reframe_job Temporal decomposition: year, month, day, day_of_week, hour, minute from submit_time Shared node tracking: shared_job_count, nodes_shared, jobs_shared Key Variables: Scheduling: job_id, partition, state_simple, submit_time, start_time, end_time, queue_wait Resources: nodes_req/used, processors_req/used, memory_req, wallclock_req/used, gpus_requested Efficiency: cpu_eff, max/min/avg_mem_eff Energy: cpu_energy_tdp_estimated_max/used_watt_hours, consumed_energy_raw_joules, consumed_energy_raw_watt_hours Sharing: shared_job_count, nodes_shared, jobs_shared Partitions: short, standard, debug, gpu-h100 Job States: CANCELLED, COMPLETED, FAILED, PENDING, RUNNING QoS Levels: normal, high Important Notes: Timestamps include timezone offsets; DST transitions are handled correctly, though adding intervals across DST boundaries requires offset adjustment shared_job_count reflects physical node co-residency, not use of the shared partition Job step records and raw Slurm JSONB fields are excluded Do not attempt to re-identify individuals from hashed fields

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Theoretical Approach for Reliability Within Information Supply Chains With Cycles and Negations

Complex networks of information processing systems, or information supply chains, present challenges for performance analysis. Here, we establish a mathematical setting, in which a process within an information supply chain can be analyzed in terms of the functionality of the system’s components. Principles of this methodology are rigorously defended and induce a model for determining the reliability for the various products in these networks. Our model does not limit us from having cycles in the network, as long as the cycles do not contain negation. It is shown that our approach to reliability resolves the nonuniqueness caused by cycles in a probabilistic Boolean network. An iterative algorithm is given to find the reliability values of the model, using a process that can be fully automated. This automated method of discerning reliability is beneficial for systems managers. As a systems manager considers systems modification, such as the replacement of owned and maintained hardware systems with cloud computing resources, the need for comparative analysis of system reliability is paramount. The model is extended to handle conditional knowledge about the network, allowing one to make predictions of weaknesses in the system. Finally, to illustrate the model’s flexibility over different forms, it is demonstrated on a system of components and subcomponents.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Genetic circuit characterization by inferring RNA polymerase movement and ribosome usage

To perform their computational function, genetic circuits change states through a symphony of genetic parts that turn regulator expression on and off. Debugging is frustrated by an inability to characterize parts in the context of the circuit and identify the origins of failures. Here, we take snapshots of a large genetic circuit in different states: RNA-seq is used to visualize circuit function as a changing pattern of RNA polymerase (RNAP) flux along the DNA. Together with ribosome profiling, all 54 genetic parts (promoters, ribozymes, RBSs, terminators) are parameterized and used to inform a mathematical model that can predict circuit performance, dynamics, and robustness. The circuit behaves as designed; however, it is riddled with genetic errors, including cryptic sense/antisense promoters and translation, attenuation, incorrect start codons, and a failed gate. While not impacting the expected Boolean logic, they reduce the prediction accuracy and could lead to failures when the parts are used in other designs. Finally, the cellular power (RNAP and ribosome usage) required to maintain a circuit state is calculated. This work demonstrates the use of a small number of measurements to fully parameterize a regulatory circuit and quantify its impact on host.

59 BASIC BIOLOGICAL SCIENCES↗