SEARCH · Engineering Papers
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.
Binary phase modulation is demonstrated with the aid of commercially available LC matrix. Elements of plane diffraction optics (cylindrical and spherical lenses) are fabricated and experimentally studied. Limitations related to a finite size of a pixel of a binary diffraction SLM are considered.
Abstract Neutrinos are copiously emitted by neutron star mergers, due to the high temperatures reached by dense matter during the merger and its aftermath. Neutrinos influence the merger dynamics and shape the properties of the ejecta, including the resulting r -process nucleosynthesis and kilonova emission. In this work, we analyse neutrino emission from a large sample of binary neutron star merger simulations in Numerical Relativity, covering a broad range of initial masses, nuclear equation of state and viscosity treatments. We extract neutrino luminosities and mean energies, and compute quantities of interest such as the peak values, peak broadnesses, time averages and decrease time scales. We provide a systematic description of such quantities, including their dependence on the initial parameters of the system. We find that for equal-mass systems the total neutrino luminosity (several $$10^{53}{\hbox {erg}~{\hbox {s}}^{-1}}$$ 10 53 erg s - 1 ) decreases as the reduced tidal deformability increases, as a consequence of the less violent merger dynamics. Similarly, tidal disruption in asymmetric mergers leads to systematically smaller luminosities. Peak luminosities can be twice as large as the average ones. Electron antineutrino luminosities dominate (initially by a factor of 2-3) over electron neutrino ones, while electron neutrinos and heavy flavour neutrinos have similar luminosities. Mean energies are nearly constant in time and independent on the binary parameters. Their values reflect the different decoupling temperature inside the merger remnant. Despite present uncertainties in neutrino modelling, our results provide a broad and physically grounded characterisation of neutrino emission, and they can serve as a reference point to develop more sophisticated neutrino transport schemes.
Highly optimized programs are prone to bit rot, where performance quickly becomes suboptimal in the face of new hardware and compiler techniques. In this paper we show how to automatically lift performance-critical stencil kernels from a stripped x86 binary and generate the corresponding code in the high-level domain-specific language Halide. Using Halide's state-of-the-art optimizations targeting current hardware, we show that new optimized versions of these kernels can replace the originals to rejuvenate the application for newer hardware. The original optimized code for kernels in stripped binaries is nearly impossible to analyze statically. Instead, we rely on dynamic traces to regenerate the kernels. We perform buffer structure reconstruction to identify input, intermediate and output buffer shapes. Here, we abstract from a forest of concrete dependency trees which contain absolute memory addresses to symbolic trees suitable for high-level code generation. This is done by canonicalizing trees, clustering them based on structure, inferring higher-dimensional buffer accesses and finally by solving a set of linear equations based on buffer accesses to lift them up to simple, high-level expressions. Helium can handle highly optimized, complex stencil kernels with input-dependent conditionals. We lift seven kernels from Adobe Photoshop giving a 75 % performance improvement, four kernels from Irfan View, leading to 4.97 x performance, and one stencil from the mini GMG multigrid benchmark netting a 4.25 x improvement in performance. We manually rejuvenated Photoshop by replacing eleven of Photoshop's filters with our lifted implementations, giving 1.12 x speedup without affecting the user experience.
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.
The spatially conformally flat approximation (CFA) is a viable method to deduce initial conditions for the subsequent evolution of binary neutron stars employing the full Einstein equations. Here in this paper, we analyze the viability of the CFA for the general relativistic hydrodynamic initial conditions of binary neutron stars. We illustrate the stability of the conformally flat condition on the hydrodynamics by numerically evolving ~100 quasicircular orbits. We illustrate the use of this approximation for orbiting neutron stars in the quasicircular orbit approximation to demonstrate the equation of state dependence of these initial conditions and how they might affect the emergent gravitational wave frequency as the stars approach the innermost stable circular orbit.
Publicly available collections of drug-like molecules have grown to comprise tens of billions of compounds due to advances in combinatorial chemistry. Traditional methods for identifying "hit" molecules from a large collection of potential drug-like candidates have relied on biophysical theory to compute approximations to the Gibbs free energy of the binding interaction between the drug and its protein target. These approaches have the major drawback that they require exceptional computing capabilities for even relatively small collections of molecules. Hyperdimensional Computing (HDC) is a recently-proposed learning paradigm that represents data with high-dimension binary vectors; this allows the use of low-precision binary vector arithmetic to create models of the data that can be learned without the need for the gradient-based optimization required in many conventional machine learning and deep learning methods. This algorithmic simplicity allows for acceleration in hardware that has been previously demonstrated in a range of application areas. We consider existing HDC approaches for molecular property classification and introduce two novel encodings of a commonly-used molecular representation, the extended connectivity fingerprint (ECFP). We show that HDC-based inference methods are as much as 91 times more efficient than traditional machine learning methods, and achieve an acceleration of nearly nine orders of magnitude compared to molecular docking. Our results show that HDC accelerated methods retain competitive accuracy on a number of well-studied tasks such as molecular property predictions using the MoleculeNet dataset, and bind/no-bind activity classification using the DUD-E and LIT-PCBA datasets. Our work thus motivates further investigation into molecular representation learning to develop ultraefficient pre-screening tools.
Optimizing the controls of quantum systems plays a crucial role in advancing quantum technologies. The time-varying noises in quantum systems and the widespread use of inhomogeneous quantum ensembles raise the need for high-quality quantum controls under uncertainties. In this paper, we consider a stochastic discrete optimization formulation of a discretized binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimizes both risk-neutral and risk-averse measurements of control policies, and solve these with two gradient-based algorithms using sum-up-rounding approaches. Furthermore, we discuss the differentiability of the objective function and prove upper bounds of the gaps between the optimal solutions to binary control problems and their continuous relaxations. We conduct numerical simulations on various sized problem instances based on two applications of quantum pulse optimization; we evaluate different strategies to mitigate the impact of uncertainties in quantum systems. In conclusion, we demonstrate that the controls of our stochastic optimization model achieve significantly higher quality and robustness compared with the controls of a deterministic model.
Spatially dithered distributions of binary amplitude pixels are optimized using a full direct binary search taking into account the experimental configuration for amplitude modulation of coherent waves. This design process is shown to yield a significant reduction of the noise induced by binarization and pixelation over the region of interest. In this study, we demonstrate this approach for beam shaping and optical differentiation wavefront sensing, where the region of interest is in an image plane of the pixel distribution and in the far field of the pixel distribution, respectively. Lastly, the observed reduction in error compared to a standard error diffusion algorithm is significant for both applications because it improves performance without the tighter fabrication tolerance and cost associated with smaller pixels.
Glyceraldehyde 3-phosphate dehydrogenase or GAPDH is an evolutionarily conserved glycolytic enzyme. It catalyzes the two step oxidative phosphorylation of D-glyceraldehyde 3-phosphate into 1,3-bisphosphoglycerate using inorganic phosphate and NAD + as cofactor. GAPDH of Group B Streptococcus is a major virulence factor and a potential vaccine candidate. Moreover, since GAPDH activity is essential for bacterial growth it may serve as a possible drug target. Crystal structures of Group B Streptococcus GAPDH in the apo-form, two different binary complexes and the ternary complex are described here. The two binary complexes contained NAD + bound to 2 (mixed-holo) or 4 (holo) subunits of the tetrameric protein. The structure of the mixed-holo complex reveals the effects of NAD + binding on the conformation of the protein. In the ternary complex, the phosphate group of the substrate was bound to the new Pi site in all four subunits. Comparison with the structure of human GAPDH showed several differences near the adenosyl binding pocket in Group B Streptococcus GAPDH. The structures also reveal at least three surface-exposed areas that differ in amino acid sequence compared to the corresponding areas of human GAPDH.
Malware is a serious problem for computer systems and costs businesses and customers billions of dollars a year in addition to compromising their private information. Detecting malware is particularly difficult because malware source code can be compiled in many different ways and generate many different digital signatures, which causes problems for most anti-malware programs that rely on static signature detection. Our project uses a convolutional neural network to identify malware programs but these require large amounts of data to be effective. Towards that end, we gather thousands of source code files from publicly available programming contest sites and compile them with several different compilers and flags. Building upon current research, we then transform these binary files into image representations and use them to train a long-term recurrent convolutional neural network that will eventually be used to identify how a malware binary was compiled. This information will include the compiler, version of the compiler and the options used in compilation, information which can be critical in determining where a malware program came from and even who authored it.
Increasingly diverse mission needs, the emergence of AI and cloud, and increasing hardware diversity are driving HPC software to be more complex. Modern codes are built from hundreds of small, complex components, and much of the software development process involves integrating these components rather than developing new components from scratch. The goal of the BUILD project was to ease the task of software integration for developers across LLNL’s programs. The project focused on (1) modeling software compatibility, (2) modeling ABI compatibility with binary analysis, (3) developing solver techniques to reason about compatibility, and (4) developing AI/ML models to fill gaps in our understanding of software compatibility. The project has developed several key technologies that help developers—by accelerating development workflows, removing the need for rebuilds, and enabling faster, automatic, and less error-prone code sharing. These technologies are used in LLNL codes and will be ready for the new El Capitan Exascale system in Livermore Computing. Many of these technologies have been hardened and integrated with LLNL’s Spack package manager, and they are already in use by production code teams. Results of BUILD have laid the groundwork for future advances in software integration—the ML and binary modification techniques developed in this project still need to be operationalized but have great potential to further speed up software integration.
The proliferation of Connected and Autonomous Vehicles (CAVs) has necessitated the development of efficient, reliable communication methods between vehicles and their surroundings. This study presents a novel methodology, the VECTOR system, that addresses this need by converting dynamic vehicle data into a binary code and displaying it on an LED panel. The system involves a three-step process of data collection, polynomial fitting of velocity data, and encoding the polynomial parameters into binary form using a Cyclic Redundancy Check (CRC). The study also explores the practical application of this system by conducting experiments with modified Lincoln MKZ hybrids, demonstrating the feasibility and efficiency of this approach. The paper presents both the methodology and results of these experiments, further expanding upon the potential applications and implications for CAV technology. By comparing the final accuracy, we find this approach can achieve 80% of the original velocity data.
Industrial, municipal, and agricultural waste streams containing stranded organic carbon represent a significant and underutilized feedstock to produce fuels and chemicals. With anaerobic digestion deployed at large scales to capture organic waste streams, over 6 million tons of biogas are available today. However, the utilization of biogas represents a significant challenge due to its low pressure and presence of contaminants such as H 2 S, ammonia, and volatile organic carbon compounds. To tap into this immense potential, effective biotechnologies that co-utilize both CO 2 and CH 4 are needed. Recent studies demonstrated that, in nature, microbial communities have developed a highly efficient way to recover energy and capture carbon from both CH 4 and CO 2 through metabolic coupling of methane oxidation to oxygenic photosynthesis. Using two synthetic methanotroph – photoautotroph (M-P) co-cultures that exhibit stable growth under a broad range of cultivation conditions, in this project we proposed to harness the interspecies interactions within these cocultures for biogas conversion to fuels and chemicals. To facilitate this overarching objective, we aim to develop experimental and computational tools to gain qualitative and quantitative understandings on the interactions and dynamics of the coculture at both systems and molecular levels, and to validate our findings through experiments and mutant development. The fundamental understanding on the interactions and dynamics of the photoautotroph-methanotroph will lay the foundation for the design and optimization of synthetic binary consortia for production of fuels and chemicals from biogas. We expect the knowledge gained from this project may be generally applicable to other cross-feeding binary consortium, and the tools developed can be adapted to study the interactions and dynamics of other multi-organism platforms.
Compact binary mergers are rare events in the universe, but produce many of the brightest observed outbursts observed today. In addition, these mergers play an important role in the production of heavy elements, perhaps dominating the r-process nucleosynthesis as well as iron-peak elements. These mergers are also strong sources of gravitational waves and, if understand fully, can tie gravitational wave measurements to the understanding of matter at extreme conditions. One of the major uncertainties in our understanding of compact remnant mergers is the mass distribution. The mass distribution can help determine the relative rates of different compact binary mergers. Here I review our current understanding of the formation processes behind compact systems, focusing on the mass distribution of these objects.
Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L 2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.
Bounding the best achievable error probability for binary classification problems is relevant to many applications including machine learning, signal processing, and information theory. Many bounds on the Bayes binary classification error rate depend on information divergences between the pair of class distributions. Recently, the Henze–Penrose (HP) divergence has been proposed for bounding classification error probability. We consider the problem of empirically estimating the HP-divergence from random samples. We derive a bound on the convergence rate for the Friedman–Rafsky (FR) estimator of the HP-divergence, which is related to a multivariate runs statistic for testing between two distributions. The FR estimator is derived from a multicolored Euclidean minimal spanning tree (MST) that spans the merged samples. We obtain a concentration inequality for the Friedman–Rafsky estimator of the Henze–Penrose divergence. We validate our results experimentally and illustrate their application to real datasets.
The integrity of the final printed components is mostly dictated by the adhesion between the particles and phases that form upon solidification, which is a major problem in printing metallic parts using available In-Space Manufacturing (ISM) technologies based on the Fused Deposition Modeling (FDM) methodology. Understanding the melting/solidification process helps increase particle adherence and allows to produce components with greater mechanical integrity. We developed a phase-field model of solidification for binary alloys. The phase-field approach is unique in capturing the microstructure with computationally tractable costs. The developed phase-field model of solidification of binary alloys satisfies the stability conditions at all temperatures. The suggested model is tuned for Ni-Cu alloy feedstocks. We derived the Ginzburg-Landau equations governing the phase transformation kinetics and solved them analytically for the dilute solution. We calculated the concentration profile as a function of interface velocity for a one-dimensional steady-state diffuse interface neglecting elasticity and obtained the partition coefficient, k, as a function of interface velocity. Numerical simulations for the diluted solution are used to study the interface velocity as a function of undercooling for the classic sharp interface model, partitionless solidification, and thin interface.
Even though it was discovered more than a decade ago, LSR 1610−0040 remains an enigma. This object has a peculiar spectrum that exhibits some features typically found in L subdwarfs, and others common in the spectra of more massive M dwarf stars. It is also a binary system with a known astrometric orbital solution. Given the available data, it remains a challenge to reconcile the observed properties of the combined light of LSR 1610−0040AB with current theoretical models of low-mass stars and brown dwarfs. We present the results of a joint fit to both astrometric and radial velocity measurements of this unresolved, low-mass binary. We find that the photocentric orbit has a period P=633.0±1.7 days, somewhat longer than previous results, eccentricity of e=0.42±0.03, and we estimate that the semimajor axis of the orbit of the primary is a{sub 1}≈0.32 AU, consistent with previous results. While a complete characterization of the system is limited by our small number of radial velocity measurements, we establish a likely primary mass range of 0.09–0.10 M{sub ⊙} from photometric and color–magnitude data. For a primary mass in this range, the secondary is constrained to be 0.06–0.075 M{sub ⊙}, making a negligible contribution to the total I-band luminosity. This effectively rules out the possibility of the secondary being a compact object such as an old, low-mass white dwarf. Based on our analysis, we predict a likely angular separation at apoapsis comparable to the resolution limits of current high-resolution imaging systems. Measuring the angular separation of the A and B components would finally enable a full, unambiguous solution for the masses of the components of this system.