SEARCH · Search NASA

Results for “boolean factorization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

15 records

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Tucker-1 Boolean Tensor Factorization with Quantum Annealers

Quantum annealers are an emerging computational architecture that have the potential to address some challenging computational issues that will be left unresolved as we approach the end of the Moore's Law era of computing. D-Wave quantum annealers are designed to solve a challenging set of problems - quadratic unconstrained binary optimization problems. This makes them a natural fit for solving problems with binary or Boolean variables. Here, we explore the use of a quantum annealer to solve Boolean tensor factorization. The goal of Boolean tensor factorization is to represent a high-dimensional tensor filled with Boolean values as a product of Boolean matrices and a Boolean core tensor. We show that a particular Boolean tensor factorization problem (called Tucker-1 factorization) can be decomposed into a sequence of quadratic unconstrained binary optimization problems that can be solved with a D-Wave 2000Q quantum annealer. While quantum annealers specifically and quantum computers in general are at a fairly early stage in their development, they are currently capable of solving these Boolean tensor factorization problems. Importantly, our results show that for fairly small tensors, we are frequently able to obtain an accurate (sometimes exact) factorization using quantum annealing.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Boolean Matrix Factorization via Nonnegative Auxiliary Optimization

Not Available

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

QBTNs - Quantum Boolean Tensor Networks

We develop algorithms and software that uses the D-Wave 2000Q quantum annealer to solve several types of Boolean tensor factorization problems. Boolean tensor factorization refers to the problem of representing a high-dimensional tensor filled with Boolean values as a product of smaller Boolean core tensors and Boolean matrices. We consider different tensor factorization models, including Boolean Tensor Train, Boolean Tucker, and Boolean Hierarchical Tucker. As an exact decomposition of a given type may not exist in the general case, the objective is to minimize the difference between the input high-dimensional tensor and the product of the lower-dimensional tensors of the proposed factorization, using a specified tensor norm. In our approach, we reduce the Boolean tensor factorization problem to a sequence of quadratic unconstrained binary optimization problems suitable for the D-Wave 2000Q quantum annealer. Although current quantum technology is still fairly restricted in the problems it can tackle, we show that complex tensor factorization problems as the ones addressed by us can be solved efficiently and accurately.

Alexandrov, Boian↗

DOE OSTI2022

Quantum annealing algorithms for Boolean tensor networks

Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Efficient Probabilistic Computing with Stochastic Perovskite Nickelates

Probabilistic computing has emerged as a viable approach to solve hard optimization problems. Devices with inherent stochasticity can greatly simplify their implementation in electronic hardware. In this report we demonstrate intrinsic stochastic resistance switching controlled via electric fields in perovskite nickelates doped with hydrogen. The ability of hydrogen ions to reside in various metastable configurations in the lattice leads to a distribution of transport gaps. With experimentally characterized p-bits, a shared-synapse p-bit architecture demonstrates highly parallelized and energy-efficient solutions to optimization problems such as integer factorization and Boolean satisfiability. The results introduce perovskite nickelates as scalable potential candidates for probabilistic computing and showcase the potential of light-element dopants in next-generation correlated semiconductors.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

DOE OSTI2022

Factorization of Binary Matrices: Rank Relations, Uniqueness and Model Selection of Boolean Decomposition

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we examine the factorizations of binary matrices using standard arithmetic (real and nonnegative) and logical operations (Boolean and $\mathbb{Z}$ 2 ). We examine the relationships between the different ranks, and discuss when factorization is unique. In particular, we characterize when a Boolean factorization X = W$\land$H has a unique W, a unique H (for a fixed W), and when both W and H are unique, given a rank constraint. We introduce a method for robust Boolean model selection, called BMFk, and show on numerical examples that BMFk not only accurately determines the correct number of Boolean latent features but reconstruct the pre-determined factors accurately.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Unified architecture for quantum lookup tables

Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.

quantum circuits↗

NASA NTRS2007

Robust Fuzzy Controllers Using FPGAs

Electro-mechanical device controllers typically come in one of three forms, proportional (P), Proportional Derivative (PD), and Proportional Integral Derivative (PID). Two methods of control are discussed in this paper; they are (1) the classical technique that requires an in-depth mathematical use of poles and zeros, and (2) the fuzzy logic (FL) technique that is similar to the way humans think and make decisions. FL controllers are used in multiple industries; examples include control engineering, computer vision, pattern recognition, statistics, and data analysis. Presented is a study on the development of a PD motor controller written in very high speed hardware description language (VHDL), and implemented in FL. Four distinct abstractions compose the FL controller, they are the fuzzifier, the rule-base, the fuzzy inference system (FIS), and the defuzzifier. FL is similar to, but different from, Boolean logic; where the output value may be equal to 0 or 1, but it could also be equal to any decimal value between them. This controller is unique because of its VHDL implementation, which uses integer mathematics. To compensate for VHDL's inability to synthesis floating point numbers, a scale factor equal to 10(sup (N/4) is utilized; where N is equal to data word size. The scaling factor shifts the decimal digits to the left of the decimal point for increased precision. PD controllers are ideal for use with servo motors, where position control is effective. This paper discusses control methods for motion-base platforms where a constant velocity equivalent to a spectral resolution of 0.25 cm(exp -1) is required; however, the control capability of this controller extends to various other platforms.

Monroe, Author Gene S., Jr.↗

DOE OSTI2024

EPCAPE-PT-LANL Measurements: Ground based counterflow virtual impactor

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS2000

Shape-dependent control of cell growth, differentiation, and apoptosis: switching between attractors in cell regulatory networks

Development of characteristic tissue patterns requires that individual cells be switched locally between different phenotypes or "fates;" while one cell may proliferate, its neighbors may differentiate or die. Recent studies have revealed that local switching between these different gene programs is controlled through interplay between soluble growth factors, insoluble extracellular matrix molecules, and mechanical forces which produce cell shape distortion. Although the precise molecular basis remains unknown, shape-dependent control of cell growth and function appears to be mediated by tension-dependent changes in the actin cytoskeleton. However, the question remains: how can a generalized physical stimulus, such as cell distortion, activate the same set of genes and signaling proteins that are triggered by molecules which bind to specific cell surface receptors. In this article, we use computer simulations based on dynamic Boolean networks to show that the different cell fates that a particular cell can exhibit may represent a preprogrammed set of common end programs or "attractors" which self-organize within the cell's regulatory networks. In this type of dynamic network model of information processing, generalized stimuli (e.g., mechanical forces) and specific molecular cues elicit signals which follow different trajectories, but eventually converge onto one of a small set of common end programs (growth, quiescence, differentiation, apoptosis, etc.). In other words, if cells use this type of information processing system, then control of cell function would involve selection of preexisting (latent) behavioral modes of the cell, rather than instruction by specific binding molecules. Importantly, the results of the computer simulation closely mimic experimental data obtained with living endothelial cells. The major implication of this finding is that current methods used for analysis of cell function that rely on characterization of linear signaling pathways or clusters of genes with common activity profiles may overlook the most critical features of cellular information processing which normally determine how signal specificity is established and maintained in living cells. Copyright 2000 Academic Press.

Review↗

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 OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗

DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

EPCAPE-PT-LANL Measurements: Wideband Integrated Bioaerosol Sensor

Coastal cities offer a unique environment for studying aerosol-cloud interactions and the effects of urban emissions on cloud properties. As part of the Eastern Pacific Cloud Aerosol Precipitation Experiment (EPCAPE), the Partitioning Thrust by Los Alamos National Laboratory (EPCAPE-PT-LANL) was conducted. Our campaign focused on measuring the optical and chemical properties of aerosols and their interactions within marine stratocumulus clouds in La Jolla, California. EPCAPE-PT-LANL enhances the primary goals of EPCAPE through innovative observations of vapor-phase transitions between aerosols and cloud droplets, the impact of black carbon on aerosol-cloud dynamics, and the effects of cloud processing on aerosol optical properties. Instrument: Wideband Integrated Bioaerosol Sensor (Droplet Measurements Technology) Data Notes: The WIBS is an online single-particle measurement that detects FBAPs (within a size range of 0.5 - 30 microns in diameter) based on the excitation and emission wavelengths of the individual particles. Using two xenon lamps, the WIBS excites FBAPs at 280 nm and 370 nm. Their emission is detected across two wavebands of 310-400 nm and 420-650 nm. We classified the FBAPs into seven different categories (A, B, C, AB, BC, AC, and ABC) using the classification scheme in Perring et. al. (2015) [1]. Averaged number concentration of FBAPs (total and by category) and particles that non-fluorescent bioaerosols particles (NFBAPs). In separate files, we also present one-minute-averaged size distributions and the asymmetry factor (AF, a surrogate for shape) of all FBAPs and NFBAPs. The logarithmic bin width of the size bins are the same as the average bin width of the AOS's optical particle counter (OPC, Grimm) for the range of sizes in which they overlap (26 bins from 0.5 - 30 microns). AF of the particles ranges from 0-100 and is divided into five bins with a linear spacing at increments of 20. The smallest AF bin represents more spherical particles while the largest bin represents more rod-shaped particles. [1] Perring, A. E., et al. (2015), Airborne observations of regional variation in fluorescent aerosol across the United States, J. Geophys. Res. Atmos., 120, 1153–1170, doi:10.1002/2014JD022495. Abstract and description of the campaign can be found here : https://www.arm.gov/research/campaigns/amf2023epcape-pt-lanl. Files data_10min_WIBS_AFDist.csv Header: - FBAP_AFDist[/cm3]_Bin_1 to Bin_5: Concentration of fluorescent bioaerosol particles in the each of 5 AF bins, measured in particles per cubic centimeter. Each bin represents a specific range of particle AF, capturing the shapes of FBAPs detected during the measurement. - NFBAP_AFDist[/cm3]_Bin_1 to Bin_5: Concentration of non-fluorescent bioaerosol particles in the each of 5 AF bins, measured in particles per cubic centimeter. Each bin represents a specific range of particle AF, capturing the shapes of NFBAPs detected during the measurement. - CVI_Flag[bool]: A boolean flag indicating whether the Counterflow Virtual Impactor (CVI) was active (true) or inactive (false) during the measurement. AF Bins: • Bin 1: 0 – 20 [unitless] • Bin 2: 21 – 40 [unitless] • Bin 3: 41 – 60 [unitless] • Bin 4: 61 – 80 [unitless] • Bin 5: 81 – 100 [unitless] Files data_10min_WIBS_Conc.csv Header: - NumberConcentrationA[/cm3]: Number concentration of bioaerosol particles detected by fluorescence channel A, measured in particles per cubic centimeter. - NumberConcentrationB[/cm3]: Number concentration of bioaerosol particles detected by fluorescence channel B, measured in particles per cubic centimeter. - NumberConcentrationC[/cm3]: Number concentration of bioaerosol particles detected by fluorescence channel C, measured in particles per cubic centimeter. - NumberConcentrationAB[/cm3]: Combined number concentration of bioaerosol particles detected by both fluorescence channels A and B, measured in particles per cubic centimeter. - NumberConcentrationBC[/cm3]: Combined number concentration of bioaerosol particles detected by both fluorescence channels B and C, measured in particles per cubic centimeter. - NumberConcentrationAC[/cm3]: Combined number concentration of bioaerosol particles detected by both fluorescence channels A and C, measured in particles per cubic centimeter. - NumberConcentrationABC[/cm3]: Combined number concentration of bioaerosol particles detected by all three fluorescence channels A, B, and C, measured in particles per cubic centimeter. - NumberConcentrationNFBAP[/cm3]: Number concentration of non-fluorescent bioaerosol particles, measured in particles per cubic centimeter. - CVI_Flag[bool]: A boolean flag indicating whether the Counterflow Virtual Impactor (CVI) was active (true) or inactive (false) during the measurement. Files data_10min_WIBS_SizeDist.csv Header: - FBAP_SizeDist[/cm3]_Bin_1 to FBAP_SizeDist[/cm3]_Bin_26: Number concentrations of FBAP in each of 26 size bins, measured in particles per cubic centimeter. Each bin represents a specific range of particle sizes, capturing the size distribution of FBAPs detected during the measurement. - NFBAP_SizeDist[/cm3]_Bin_1 to NFBAP_SizeDist[/cm3]_Bin_26: Number concentrations of NFBAP in each of 26 size bins, measured in particles per cubic centimeter. Similar to FBAP, each bin covers a specific range of particle sizes, detailing the size distribution of NFBAPs detected. - CVI_Flag[bool]: A boolean flag indicating whether the Counterflow Virtual Impactor (CVI) was active (true) or inactive (false) during the measurement. Size Bins: • Bin 1: 0.48 to 0.57 μm • Bin 2: 0.57 to 0.67 μm • Bin 3: 0.67 to 0.79 μm • Bin 4: 0.79 to 0.93 μm • Bin 5: 0.93 to 1.1 μm • Bin 6: 1.1 to 1.29 μm • Bin 7: 1.29 to 1.52 μm • Bin 8: 1.52 to 1.8 μm • Bin 9: 1.8 to 2.11 μm • Bin 10: 2.11 to 2.5 μm • Bin 11: 2.5 to 2.94 μm • Bin 12: 2.94 to 3.46 μm • Bin 13: 3.46 to 4.08 μm • Bin 14: 4.08 to 4.81 μm • Bin 15: 4.81 to 5.67 μm • Bin 16: 5.67 to 6.68 μm • Bin 17: 6.68 to 7.88 μm • Bin 18: 7.88 to 9.29 μm • Bin 19: 9.29 to 10.96 μm • Bin 20: 10.96 to 12.92 μm • Bin 21: 12.92 to 15.23 μm • Bin 22: 15.23 to 17.96 μm • Bin 23: 17.96 to 21.17 μm • Bin 24: 21.17 to 24.96 μm • Bin 25: 24.96 to 29.43 μm • Bin 26: 29.43 to 34.70 μm

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2025

CANA v1.0.0: efficient quantification of canalization in automata networks

The biomolecular networks underpinning cell function exhibit canalization, or the buffering of fluctuations required to function in a noisy environment. We present a new major release of $\tt{CANA}$, v1.0.0, an open-source Python package for understanding canalization in automata network models, discrete dynamical systems in which activation of biomolecular entities (e.g. transcription of genes) is modeled as the activity of coupled automata. One understudied putative mechanism for canalization is the functional equivalence of biomolecular regulators (e.g. among the transcription factors for a gene). We study this mechanism using the theory of symmetry in discrete functions. We present a new exact method, $\tt{schematodes}$, for finding maximal symmetry groups among the inputs to discrete functions, and integrate it into $\tt{CANA}$. The $\tt{schematodes}$ method substantially outperforms the inexact method of previous $\tt{CANA}$ versions both in speed and accuracy. We apply $\tt{CANA}$ v1.0.0 to study symmetry in 74 experimentally supported automata network models from the Cell Collective (CC) repository. The symmetry distribution is significantly different in the CC than in random automata with the same in-degree (connectivity) and bias (average output) (Kolmogorov–Smirnov test, P ≪ .001). Its spread is much wider than in a null model (IQR 0.31 versus IQR 0.20 with equal medians), demonstrating that the CC is enriched in functions with extreme symmetry or asymmetry.

Boolean networks↗