Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cluster Computing”

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 217 records · Page 12

Computing nuclear response functions with time-dependent coupled-cluster theory

We compute nuclear response functions by solving the time-dependent 𝐴-body Schrödinger equation, recording the time-dependent transition moment and extracting spectral information via Fourier transforms. The solution of the time-dependent many-body problem accounts for correlations on top of the mean field by taking advantage of a time-dependent formulation of coupled-cluster theory. As a validation, we focus on electric dipole transitions in 4 He and 16 O and compare moments of the response function distribution to the results of an equivalent static framework, finding negligible discrepancies. We investigate how proton and neutron densities evolve in time, and we see the traditional picture of soft and giant dipole resonances as collective oscillations of protons and neutrons emerging from our calculations in 16 O and 24 O. Furthermore, this method also allows us to investigate the behavior of the nucleus in the presence of a strong electric field. In that regime, the behavior of the system becomes chaotic. Qualitatively, the spectral information obtained in this limit is in line with previous time-dependent mean-field results.

Ab initio calculations↗

Coreset Clustering on Small Quantum Computers

Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing to address this issue, relying on coresets to minimize the data loading overhead of quantum algorithms. We investigated using this paradigm to perform k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset. We used numerical simulations to compare the performance of this approach to classical k-means clustering. We were able to find data sets with which coresets work well relative to random sampling and where QAOA could potentially outperform standard k-means on a coreset. However, finding data sets where both coresets and QAOA work well—which is necessary for a quantum advantage over k-means on the entire data set—appears to be challenging.

42 ENGINEERING↗

Using Signal Clustering Similarity for Detecting CAN Masquerade Attacks

The computer code assumes that time series representing the physical signals of the vehicle have been extracted from the CAN bus. The main input of the computer code is the multivariate time series representation of the signals in the CAN bus. The computer code cluster these time series using agglomerative hierarchical clustering from benign and attack datasets. Based on this, it generates probability distributions from the similarity of the obtained clusters based in each scenario---benign and attack---using the CluSim method (https://github.com/Hoosier-Clusters/clusim). Finally, it compares how a new data collection compares with the previous distribution to provide and probability score for an intrusion.

Moriano, Pablo↗

Producing two-dimensional dust clouds and clusters using a movable electrode for complex plasma and fundamental physics experiments

We report a Bidirectional Electrode Control Arm Assembly (BECAA) for precisely manipulating dust clouds levitated above the powered electrode in RF plasmas. The reported techniques allow the creation of perfectly 2D dust layers by eliminating off-plane particles by moving the electrode from outside the plasma chamber without altering the plasma conditions. Here, the tilting and moving of electrodes using BECAA also allows the precise and repeatable elimination of dust particles one by one to achieve any desired number of grains N without trial and error. Simultaneously acquired top and side view images of dust clusters show that they are perfectly planar or 2D. A demonstration of clusters with N = 1–28 without changing the plasma conditions is presented to show the utility of BECAA for complex plasma and statistical physics experimental design. Demonstration videos and 3D printable part files are available for easy reproduction and adaptation of this new method to repeatably produce 2D clusters in existing RF plasma chambers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Mode-multiplexed photonic integrated vector dot-product core from inverse design

Photonic computing has the potential to harness the full degrees of freedom (DOFs) of the light field, including the wavelength, spatial mode, spatial location, phase quadrature, and polarization, to achieve a higher level of computing parallelism and scalability than digital electronic processors. While multiplexing using the wavelength and other DOFs can be readily integrated on silicon photonics platforms with compact footprints, conventional mode-division multiplexed (MDM) photonic designs occupy areas exceeding tens to hundreds of microns for a few spatial modes, significantly limiting their scalability. Here, we utilize inverse design to demonstrate an ultracompact photonic computing core that calculates vector dot products based on MDM coherent mixing. Our dot-product core integrates the functionalities of two-mode multiplexers and one multimode coherent mixer within a nominal footprint of 5 μm x 3 μm . We have experimentally demonstrated computing examples on the fabricated dot-product core, including complex number multiplication and motion estimation using optical flow. The compact dot-product core design enables large-scale on-chip integration in a parallel photonic computing primitive cluster for high-throughput scientific computing and computer vision tasks.

97 MATHEMATICS AND COMPUTING↗

Resource-efficient generation of linear cluster states by linear optics with postselection

Here we report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon-photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups that are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability for each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne, and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that the maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to 1/2 n-1 ; an m-tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of 1/4 m-1 .

97 MATHEMATICS AND COMPUTING↗

Analyzing simulation-based PRA data through traditional and topological clustering: A BWR station blackout case study

Here, dynamic probabilistic risk assessment (DPRA) methodologies couple system simulator codes (e.g., RELAP and MELCOR) with simulation controller codes (e.g., RAVEN and ADAPT). Whereas system simulator codes model system dynamics deterministically, simulation controller codes introduce both deterministic (e.g., system control logic and operating procedures) and stochastic (e.g., component failures and parameter uncertainties) elements into the simulation. Typically, a DPRA is performed by sampling values of a set of parameters and simulating the system behavior for that specific set of parameter values. For complex systems, a major challenge in using DPRA methodologies is to analyze the large number of scenarios generated, where clustering techniques are typically employed to better organize and interpret the data. In this paper, we focus on the analysis of two nuclear simulation datasets that are part of the risk-informed safety margin characterization (RISMC) boiling water reactor (BWR) station blackout (SBO) case study. We provide the domain experts a software tool that encodes traditional and topological clustering techniques within an interactive analysis and visualization environment, for understanding the structures of such high-dimensional nuclear simulation datasets. We demonstrate through our case study that both types of clustering techniques complement each other for enhanced structural understanding of the data.

97 MATHEMATICS AND COMPUTING↗

Balancing computation and communication power in power constrained clusters

Systems, apparatuses, and methods for balancing computation and communication power in power constrained environments. A data processing cluster with a plurality of compute nodes may perform parallel processing of a workload in a power constrained environment. Nodes that finish tasks early may be power-gated based on one or more conditions. In some scenarios, a node may predict a wait duration and go into a reduced power consumption state if the wait duration is predicted to be greater than a threshold. The power saved by power-gating one or more nodes may be reassigned for use by other nodes. A cluster agent may be configured to reassign the unused power to the active nodes to expedite workload processing.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Energy benchmarks for methane-water systems from quantum Monte Carlo and second-order Møller-Plesset calculations

The quantum Monte Carlo (QMC) technique is used to generate accurate energy benchmarks for methane-water clusters containing a single methane monomer and up to 20 water monomers. The benchmarks for each type of cluster are computed for a set of geometries drawn from molecular dynamics simulations. The accuracy of QMC is expected to be comparable with that of coupled-cluster calculations, and this is confirmed by comparisons for the CH{sub 4}-H{sub 2}O dimer. The benchmarks are used to assess the accuracy of the second-order Møller-Plesset (MP2) approximation close to the complete basis-set limit. A recently developed embedded many-body technique is shown to give an efficient procedure for computing basis-set converged MP2 energies for the large clusters. It is found that MP2 values for the methane binding energies and the cohesive energies of the water clusters without methane are in close agreement with the QMC benchmarks, but the agreement is aided by partial cancelation between 2-body and beyond-2-body errors of MP2. The embedding approach allows MP2 to be applied without loss of accuracy to the methane hydrate crystal, and it is shown that the resulting methane binding energy and the cohesive energy of the water lattice agree almost exactly with recently reported QMC values.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Balanced k -means clustering on an adiabatic quantum computer

Adiabatic quantum computers are a promising platform for efficiently solving challenging optimization problems. Therefore, many are interested in using these computers to train computationally expensive machine learning models. We present a quantum approach to solving the balanced k-means clustering training problem on the D-Wave 2000Q adiabatic quantum computer. In order to do this, we formulate the training problem as a quadratic unconstrained binary optimization (QUBO) problem. Unlike existing classical algorithms, our QUBO formulation targets the global solution to the balanced k-means model. We test our approach on a number of small problems and observe that despite the theoretical benefits of the QUBO formulation, the clustering solution obtained by a modern quantum computer is usually inferior to the solution obtained by the best classical clustering algorithms. Nevertheless, the solutions provided by the quantum computer do exhibit some promising characteristics. We also perform a scalability study to estimate the run time of our approach on large problems using future quantum hardware. Finally, as a final proof of concept, we used the quantum approach to cluster random subsets of the Iris benchmark data set.

97 MATHEMATICS AND COMPUTING↗

Efficient electronic structure theory via hierarchical scale-adaptive coupled-cluster formalism: I. Theory and computational complexity analysis

In this work, a novel reduced-scaling, general-order coupled-cluster approach is formulated by exploiting hierarchical representations of many-body tensors, combined with the recently suggested formalism of scale-adaptive tensor algebra. Inspired by the hierarchical techniques from the renormalization group approach, H/H 2 -matrix algebra and fast multipole method, the computational scaling reduction in our formalism is achieved via coarsening of quantum many-body interactions at larger interaction scales, thus imposing a hierarchical structure on many-body tensors of coupled-cluster theory. In our approach, the interaction scale can be defined on any appropriate Euclidean domain (spatial domain, momentum-space domain, energy domain, etc.). Additionally, we show that the hierarchically resolved many-body tensors reduce the storage requirements to O(N), where N is the number of simulated quantum particles. Subsequently, we prove that any connected many-body diagram with arbitrary-order tensors, e.g., an arbitrary coupled-cluster diagram, can be evaluated in O(NlogN) floating-point operations. On top of that, we elaborate an additional approximation to further reduce the computational complexity of higher-order coupled-cluster equations, i.e., equations involving higher than double excitations, which otherwise would introduce a large prefactor into formal O(NlogN) scaling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The one-loop matter bispectrum in the Effective Field Theory of Large Scale Structures

With this study, given the importance of future large scale structure surveys for delivering new cosmological information, it is crucial to reliably predict their observables. The Effective Field Theory of Large Scale Structures (EFTofLSS) provides a manifestly convergent perturbative scheme to compute the clustering of dark matter in the weakly nonlinear regime in an expansion in k/k NL , where k is the wavenumber of interest and k NL is the wavenumber associated to the nonlinear scale. It has been recently shown that the EFTofLSS matches to 1% level the dark matter power spectrum at redshift zero up to k ≃ 0.3 h Mpc –1 and k ≃ 0.6 h Mpc –1 at one and two loops respectively, using only one counterterm that is fit to data. Similar results have been obtained for the momentum power spectrum at one loop. This is a remarkable improvement with respect to former analytical techniques. Here we study the prediction for the equal-time dark matter bispectrum at one loop. We find that at this order it is sufficient to consider the same counterterm that was measured in the power spectrum. Without any remaining free parameter, and in a cosmology for which kNL is smaller than in the previously considered cases (σ 8 =0.9), we find that the prediction from the EFTofLSS agrees very well with N-body simulations up to k ≃ 0.25 h Mpc –1 , given the accuracy of the measurements, which is of order a few percent at the highest k's of interest. While the fit is very good on average up to k ≃ 0.25 h Mpc –1 , the fit performs slightly worse on equilateral configurations, in agreement with expectations that for a given maximum k, equilateral triangles are the most nonlinear.

79 ASTRONOMY AND ASTROPHYSICS↗

Real‐time XFEL data analysis at SLAC and NERSC: A trial run of nascent exascale experimental data analysis

X‐ray scattering experiments using free electron lasers (XFELs) are a powerful tool to determine the molecular structure and function of unknown samples (such as COVID‐19 viral proteins). XFEL experiments are a challenge to computing in two ways: (i) due to the high cost of running XFELs, a fast turnaround time from data acquisition to data analysis is essential to make informed decisions on experimental protocols; (ii) data‐collection rates are growing exponentially, requiring new scalable algorithms. Here we report our experiences analyzing data from two experiments at the Linac Coherent Light Source (LCLS) during September 2020. Raw data were analyzed on NERSC's Cori XC40 system, using the Superfacility paradigm: our workflow automatically moves raw data between LCLS and NERSC, where it is analyzed using the software package CCTBX. We achieved real time data analysis with a turnaround time from data acquisition to full molecular reconstruction in as little as 10 min—sufficient time for the experiment's operators to make informed decisions. By hosting the data analysis on Cori, and by automating LCLS‐NERSC interoperability, we achieved a data analysis rate which matches the data acquisition rate. Completing data analysis within 10 min is a first for XFEL experiments and an important milestone if we are to keep up with data‐collection trends.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Improving Estimation of the Koopman Operator with Kolmogorov–Smirnov Indicator Functions

It has become common to perform kinetic analysis using approximate Koopman operators that transform high-dimensional timeseries of observables into ranked dynamical modes. The key to the practical success of the approach is the identification of a set of observables that form a good basis on which to expand the slow relaxation modes. Good observables are, however, difficult to identify a priori and suboptimal choices can lead to significant underestimations of characteristic time scales. Leveraging the representation of slow dynamics in terms of Hidden Markov Models (HMM), we propose a simple and computationally efficient clustering procedure to infer surrogate observables that form a good basis for slow modes. Here, we apply the approach to an analytically solvable model system as well as on three protein systems of different complexities. We consistently demonstrate that the inferred indicator functions can significantly improve the estimation of the leading eigenvalues of Koopman operators and correctly identify key states and transition time scales of stochastic systems, even when good observables are not known a priori.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Resource-Efficient Chemistry on Quantum Computers with the Variational Quantum Eigensolver and The Double Unitary Coupled-Cluster approach

Applications of quantum simulation algorithms to obtain electronic energies of molecules on noisy intermediate-scale quantum (NISQ) devices require careful consideration of resources describing the complex electron correlation effects. In modeling second-quantized problems, the biggest challenge confronted is that the number of qubits scales linearly with the size of molecular basis. This poses a significant limitation on the size of the basis sets and the number of correlated electrons included in quantum simulations of chemical processes. To address this issue and to enable more realistic simulations on NISQ computers, we employ the double unitary coupled-cluster (DUCC) method to effectively downfold correlation effects into the reduced-size orbital space, commonly referred to as the active space. Using downfolding techniques, we demonstrate that properly constructed effective Hamiltonians can capture the effect of the whole orbital space in small-size active spaces. Combining the downfolding pre-processing technique with the Variational Quantum Eigensolver, we solve for the ground-state energy of H2 and Li2 in the cc-pVTZ basis using the DUCC-reduced active spaces. We compare these results to full configuration-interaction and high-level coupled-cluster reference calculations.

quantum computing, variational quantum solver, cou↗

Computational study of the adsorption of bimetallic clusters on alumina substrate

We performed computational investigation of the adsorption of bimetallic Pd 3 M 2 (where M changes from Ag, Au, Co, Cu, Mn, Ni, Pt, and Ru) cluster on the hydroxylated alumina surface. Previously, it was shown that small silver cluster can control the rate of discharge at the cathode of lithium-oxygen battery. The gap near the fermi energy was shown to control the oxygen reduction, an important reaction for LiO 2 formation. Controlling the gap would ultimately control the rate of LiO 2 formation. One can vary the size of the cluster to vary the gap, however, this "knob" provides limited variance in the gap. Alloying, in combination with size variation offer a much wider control of the gap, hence the LiO 2 formation. Using Density Functional Theory (DFT), we determined the most stable geometry of the bimetallic clusters Pd 3 M 2 and calculated the binding energies of these clusters on the alumina substrate which ranges from 0.2 eV to 0.25 eV depending upon the composition of the alloy-cluster, its orientation and the adsorption site. We also find that Pd atoms bind strongly with the substrate oxygen atoms with an average short bond-length of about 2.2 angstrom. We explored how the gap at the Fermi level of the system varies as a function of elemental composition and the calculated gap ranges from 0 meV to 90 meV. Charges distribution using Bader analysis was also performed to probe how charges are transferred between the cluster and the substrate. These preliminary results will open the door for more systematic studies of alloy clusters of different size and stoichiometry for Li-O 2 battery cathode design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗