Search NASA⌕ Search

SEARCH · Search NASA

Results for “Singularity”

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 1,495 records · Page 83

Engineering and revealing Dirac strings in spinor condensates

Artificial monopoles have been engineered in various systems, yet there has been no systematic study of the singular vector potentials associated with the monopole field. We show that the Dirac string, the line singularity of the vector potential, can be engineered, manipulated, and made manifest in a spinor atomic condensate. We elucidate the connection among spin, orbital degrees of freedom, and the artificial gauge, and show that there exists a mapping between the vortex filament and the Dirac string. We also devise a proposal where preparing initial spin states with relevant symmetries can result in different vortex patterns, revealing an underlying correspondence between the internal spin states and the spherical vortex structures. Such a mapping also leads to a new way of constructing spherical Landau levels, and monopole harmonics. Our observation provides insights into the behavior of quantum matter possessing internal symmetries in curved spaces. Published by the American Physical Society 2024

Xu, Gui-Sheng↗

Grand Unification of Quantum Algorithms

Quantum algorithms offer significant speed-ups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian simulation, which appear as subroutines for large families of composite quantum algorithms. A number of these quantum algorithms have recently been tied together by a novel technique known as the quantum singular value transformation (QSVT), which enables one to perform a polynomial transformation of the singular values of a linear operator embedded in a unitary matrix. In the seminal GSLW’19 paper on the QSVT [Gilyén et al., ACM STOC 2019], many algorithms are encompassed, including amplitude amplification, methods for the quantum linear systems problem, and quantum simulation. Here, we provide a pedagogical tutorial through these developments, first illustrating how quantum signal processing may be generalized to the quantum eigenvalue transform, from which the QSVT naturally emerges. Paralleling GSLW’19, we then employ the QSVT to construct intuitive quantum algorithms for search, phase estimation, and Hamiltonian simulation, and also showcase algorithms for the eigenvalue threshold problem and matrix inversion. This overview illustrates how the QSVT is a single framework comprising the three major quantum algorithms, suggesting a grand unification of quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Five-dimensional crystallography

Here it is demonstrated how five-dimensional crystallography can be used to determine a comprehensive chemical kinetic mechanism in concert with the atomic structures of transient intermediates that form and decay during the course of the reaction. A method for determining a comprehensive chemical kinetic mechanism in macromolecular reactions is presented. The method is based on five-dimensional crystallography, where, in addition to space and time, temperature is also taken into consideration and an analysis based on singular value decomposition is applied. First results of such a time-resolved crystallographic study are presented. Temperature-dependent time-resolved X-ray diffraction measurements were conducted on the newly upgraded BioCARS 14-ID-B beamline at the Advanced Photon Source and aimed at elucidating a comprehensive kinetic mechanism of the photoactive yellow protein photocycle. Extensive time series of crystallographic data were collected at two temperatures, 293 K and 303 K. Relaxation times of the reaction extracted from these time series exhibit measurable differences for the two temperatures, hence demonstrating that five-dimensional crystallography is feasible.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

The early development of neutron diffraction: science in the wings of the Manhattan Project

Early neutron diffraction experiments performed in 1944 using the first nuclear reactors are described. Although neutron diffraction was first observed using radioactive decay sources shortly after the discovery of the neutron, it was only with the availability of higher intensity neutron beams from the first nuclear reactors, constructed as part of the Manhattan Project, that systematic investigation of Bragg scattering became possible. Remarkably, at a time when the war effort was singularly focused on the development of the atomic bomb, groups working at Oak Ridge and Chicago carried out key measurements and recognized the future utility of neutron diffraction quite independent of its contributions to the measurement of nuclear cross sections. Ernest O. Wollan, Lyle B. Borst and Walter H. Zinn were all able to observe neutron diffraction in 1944 using the X-10 graphite reactor and the CP-3 heavy water reactor. Subsequent work by Wollan and Clifford G. Shull, who joined Wollan’s group at Oak Ridge in 1946, laid the foundations for widespread application of neutron diffraction as an important research tool.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SU-E-T-610: Phosphor-Based Fiber Optic Probes for Proton Beam Characterization

Purpose: To investigate feasibility of using fiber optics probes with rare-earth-based phosphor tips for proton beam radiation dosimetry. We designed and fabricated a fiber probe with submillimeter resolution (<0.5 mm3) based on TbF3 phosphors and evaluated its performance for measurement of proton beam including profiles and range. Methods: The fiber optic probe with TbF3 phosphor tip, embedded in tissue-mimicking phantoms was irradiated with double scattering proton beam with energy of 180 MeV. Luminescence spectroscopy was performed by a CCD-coupled spectrograph to analyze the emission spectra of the fiber tip. In order to measure the spatial beam profile and percentage depth dose, we used singular value decomposition method to spectrally separate the phosphors ionoluminescence signal from the background Cerenkov radiation signal. Results: The spectra of the TbF3 fiber probe showed characteristic ionoluminescence emission peaks at 489, 542, 586, and 620 nm. By using singular value decomposition we found the contribution of the ionoluminescence signal to measure the percentage depth dose in phantoms and compared that with measurements performed with ion chamber. We observed quenching effect at the spread out Bragg peak region, manifested as under-responding of the signal, due to the high LET of the beam. However, the beam profiles were not dramatically affected by the quenching effect. Conclusion: We have evaluated the performance of a fiber optic probe with submillimeter resolution for proton beam dosimetry. We demonstrated feasibility of spectral separation of the Cerenkov radiation from the collected signal. Such fiber probes can be used for measurements of proton beams profile and range. The experimental apparatus and spectroscopy method developed in this work provide a robust platform for characterization of proton-irradiated nanophosphor particles for ultralow fluence photodynamic therapy or molecular imaging applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Single-energy computed tomography-based pulmonary perfusion imaging: Proof-of-principle in a canine model

Purpose: Radiotherapy (RT) that selectively avoids irradiating highly functional lung regions may reduce pulmonary toxicity, which is substantial in lung cancer RT. Single-energy computed tomography (CT) pulmonary perfusion imaging has several advantages (e.g., higher resolution) over other modalities and has great potential for widespread clinical implementation, particularly in RT. The purpose of this study was to establish proof-of-principle for single-energy CT perfusion imaging. Methods: Single-energy CT perfusion imaging is based on the following: (1) acquisition of end-inspiratory breath-hold CT scans before and after intravenous injection of iodinated contrast agents, (2) deformable image registration (DIR) for spatial mapping of those two CT image data sets, and (3) subtraction of the precontrast image data set from the postcontrast image data set, yielding a map of regional Hounsfield unit (HU) enhancement, a surrogate for regional perfusion. In a protocol approved by the institutional animal care and use committee, the authors acquired CT scans in the prone position for a total of 14 anesthetized canines (seven canines with normal lungs and seven canines with diseased lungs). The elastix algorithm was used for DIR. The accuracy of DIR was evaluated based on the target registration error (TRE) of 50 anatomic pulmonary landmarks per subject for 10 randomly selected subjects as well as on singularities (i.e., regions where the displacement vector field is not bijective). Prior to perfusion computation, HUs of the precontrast end-inspiratory image were corrected for variation in the lung inflation level between the precontrast and postcontrast end-inspiratory CT scans, using a model built from two additional precontrast CT scans at end-expiration and midinspiration. The authors also assessed spatial heterogeneity and gravitationally directed gradients of regional perfusion for normal lung subjects and diseased lung subjects using a two-sample two-tailed t-test. Results: The mean TRE (and standard deviation) was 0.6 ± 0.7 mm (smaller than the voxel dimension) for DIR between pre contrast and postcontrast end-inspiratory CT image data sets. No singularities were observed in the displacement vector fields. The mean HU enhancement (and standard deviation) was 37.3 ± 10.5 HU for normal lung subjects and 30.7 ± 13.5 HU for diseased lung subjects. Spatial heterogeneity of regional perfusion was found to be higher for diseased lung subjects than for normal lung subjects, i.e., a mean coefficient of variation of 2.06 vs 1.59 (p = 0.07). The average gravitationally directed gradient was strong and significant (R{sup 2} = 0.99, p < 0.01) for normal lung dogs, whereas it was moderate and nonsignificant (R{sup 2} = 0.61, p = 0.12) for diseased lung dogs. Conclusions: This canine study demonstrated the accuracy of DIR with subvoxel TREs on average, higher spatial heterogeneity of regional perfusion for diseased lung subjects than for normal lung subjects, and a strong gravitationally directed gradient for normal lung subjects, providing proof-of-principle for single-energy CT pulmonary perfusion imaging. Further studies such as comparison with other perfusion imaging modalities will be necessary to validate the physiological significance.

60 APPLIED LIFE SCIENCES↗

Photoluminescence response of a quantum well to a change in the magnetic field of the Mn {delta} Layer in InGaAs/GaAs heterostructures

Ferromagnetic ordering of two types (depending on the sample geometry) is found to occur in a thin Ga{sub 1-x}Mn{sub x}As alloy layer (Mn {delta} layer) in heterostructures containing an InGaAs/GaAs quantum well. Singular samples in which the {delta} Mn layer is parallel to the (001) GaAs plane exhibit the '3/2' Bloch temperature dependence of magnetization, and vicinal samples in which the {delta} Mn layer deviates from the (001) GaAs plane exhibit a 'percolation' ferromagnetic transition. The photoluminescence polarization of the quantum well is shown to follow changes in the magnetization of the Mn {delta} layer as a function of temperature according to the Bloch law in the singular samples and to a percolation law in the vicinal samples.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Mean curvature flow of a hyperbolic surface

A four-parameter family of self-similar solutions is obtained to the mean curvature flow equation for a surface. This family is shown to be stable with respect to a small deformation of a hyperbolic surface. At time instant t*, a singular point is formed within a finite time interval, that is accompanied by a change in the topology of the surface. The solution is continued beyond the singular point. A relationship between the parameters describing the hyperbolic surface before and after the change in the surface topology is obtained. A particular case is analyzed when the unperturbed surface is a cylinder. A cylindrical surface is weakly unstable with respect to a perturbation in the form of a 'wide neck.' At the final stage of the development of the neck when its transverse size becomes much less than the cylinder radius at large distances from the neck, the surface flow in a wide region in the neighborhood of the neck is described by a universal two-parameter family of self-similar solutions. These solutions are stable with respect to small perturbations of the surface.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gravitating lepton bag model

The Kerr–Newman (KN) black hole (BH) solution exhibits the external gravitational and electromagnetic field corresponding to that of the Dirac electron. For the large spin/mass ratio, a ≫ m, the BH loses horizons and acquires a naked singular ring creating two-sheeted topology. This space is regularized by the Higgs mechanism of symmetry breaking, leading to an extended particle that has a regular spinning core compatible with the external KN solution. We show that this core has much in common with the known MIT and SLAC bag models, but has the important advantage of being in accordance with the external gravitational and electromagnetic fields of the KN solution. A peculiar two-sheeted structure of Kerr’s gravity provides a framework for the implementation of the Higgs mechanism of symmetry breaking in configuration space in accordance with the concept of the electroweak sector of the Standard Model. Similar to other bag models, the KN bag is flexible and pliant to deformations. For parameters of a spinning electron, the bag takes the shape of a thin rotating disk of the Compton radius, with a ring–string structure and a quark-like singular pole formed at the sharp edge of this disk, indicating that the considered lepton bag forms a single bag–string–quark system.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Conductance distribution near the Anderson transition

Using a modification of the Shapiro approach, we introduce the two-parameter family of conductance distributions W(g), defined by simple differential equations, which are in the one-to-one correspondence with conductance distributions for quasi-one-dimensional systems of size L{sup d–1} × L{sub z}, characterizing by parameters L/ξ and L{sub z}/L (ξ is the correlation length, d is the dimension of space). This family contains the Gaussian and log-normal distributions, typical for the metallic and localized phases. For a certain choice of parameters, we reproduce the results for the cumulants of conductance in the space dimension d = 2 + ϵ obtained in the framework of the σ-model approach. The universal property of distributions is existence of two asymptotic regimes, log-normal for small g and exponential for large g. In the metallic phase they refer to remote tails, in the critical region they determine practically all distribution, in the localized phase the former asymptotics forces out the latter. A singularity at g = 1, discovered in numerical experiments, is admissible in the framework of their calculational scheme, but related with a deficient definition of conductance. Apart of this singularity, the critical distribution for d = 3 is well described by the present theory. One-parameter scaling for the whole distribution takes place under condition, that two independent parameters characterizing this distribution are functions of the ratio L/ξ.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Kadomtsev−Petviashvili equation for a flow of highly nonisothermal collisionless plasma

It is shown that the equations of two-fluid electrodynamics for a cold ions flow and Boltzmann electrons in the vicinity of the ion-sound point can be reduced to the Kadomtsev−Petviashvili equation. Examples of two-dimensional equilibria with pole singularities obtained by exactly solving the equations are presented. An exact self-similar solution describing a two-dimensional transonic flow and having no pole singularities is found.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Nonlinear propagation of ion-acoustic waves through the Burgers equation in weakly relativistic plasmas

The Burgers equation is obtained to study the characteristics of nonlinear propagation of ionacoustic shock, singular kink, and periodic waves in weakly relativistic plasmas containing relativistic thermal ions, nonextensive distributed electrons, Boltzmann distributed positrons, and kinematic viscosity of ions using the well-known reductive perturbation technique. This equation is solved by employing the (G'/G)-expansion method taking unperturbed positron-to-electron concentration ratio, electron-to-positron temperature ratio, strength of electrons nonextensivity, ion kinematic viscosity, and weakly relativistic streaming factor. The influences of plasma parameters on nonlinear propagation of ion-acoustic shock, periodic, and singular kink waves are displayed graphically and the relevant physical explanations are described. It is found that these parameters extensively modify the shock structures excitation. The obtained results may be useful in understanding the features of small but finite amplitude localized relativistic ion-acoustic shock waves in an unmagnetized plasma system for some astrophysical compact objects and space plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Studies of Analytic Evolution of Two-Photon Generalized Distribution Amplitude in QCD

We extend our method of analytic ERBL evolution for the case of distribution amplitudes that have jumps at some points x = {zeta}{sub I} inside the support region 0 < x < 1. As an application of the method, we use it for evolution of the two-photon generalized distribution amplitude. Our approach has advantages over the standard method of expansion in Gegenbauer polynomials, which requires infinite number of terms in order to accuretly reproduce functions in the vicinity of singular points, and over the method of straightforward iteration of initial distribution with evolution kernel which produces logarithmically divergent terms at each iteration. In our method, the logarithmic singularities are summed from the start, which immediately produces a continuous curve, with only one or two iterations needed afterwards in order to get precise results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The price of privately releasing contingency tables, and the spectra of random matrices with correlated rows

Contingency tables are the method of choice of government agencies for releasing statistical summaries of categorical data. In this paper, we consider lower bounds on how much distortion (noise) is necessary in these tables to provide privacy guarantees when the data being summarized is sensitive. We extend a line of recent work on lower bounds on noise for private data analysis [10, 13. 14, 15] to a natural and important class of functionalities. Our investigation also leads to new results on the spectra of random matrices with correlated rows. Consider a database D consisting of n rows (one per individual), each row comprising d binary attributes. For any subset of T attributes of size |T| = k, the marginal table for T has 2{sup k} entries; each entry counts how many times in the database a particular setting of these attributes occurs. Imagine an agency that wishes to release all (d/k) contingency tables for a given database. For constant k, previous work showed that distortion {tilde {Omicron}}(min{l_brace}n, (n{sup 2}d){sup 1/3}, {radical}d{sup k}{r_brace}) is sufficient for satisfying differential privacy, a rigorous definition of privacy that has received extensive recent study. Our main contributions are: (1) For {epsilon}- and ({epsilon}, {delta})-differential privacy (with {epsilon} constant and {delta} = 1/poly(n)), we give a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}), which is tight for n = {tilde {Omega}}(d{sup k}). Moreover, for a natural and popular class of mechanisms based on additive noise, our bound can be strengthened to {Omega}({radical}d{sup k}), which is tight for all n. Our bounds extend even to non-constant k, losing roughly a factor of {radical}2{sup k} compared to the best known upper bounds for large n. (2) We give efficient polynomial time attacks which allow an adversary to reconstruct sensitive infonnation given insufficiently perturbed contingency table releases. For constant k, we obtain a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}) that applies to a large class of privacy notions, including K-anonymity (along with its variants) and differential privacy. In contrast to our bounds for differential privacy, this bound (a) is shown only for constant k, but (b) is tight for all values of n when k is constant. (3) Our reconstruction-based attacks require a new lower bound on the least singular values of random matrices with correlated rows. For a constant k, consider a matrix M with (d/k) rows which are formed by taking all possible k-way entry-wise products of an underlying set of d random vectors. We show that even for nearly square matrices with d{sup k}/log d columns, the least singular value is {Omega}({radical}d{sup k}) with high probability - asymptotically, the same bound as one gets for a matrix with independent rows. The proof requires several new ideas for analyzing random matrices and could be of independent interest.

97 MATHEMATICS AND COMPUTING↗

The HPC Container Experience on the Summit Supercomputer

Containers are seeing widespread use in the world of High Performance Computing, with many HPC Centers either providing their own containerization solution or adopting existing ones like Singularity and Apptainer. The demand for containerization options come from users who want to take advantage of the portability and reproducibility containers can provide, as well as being able to build and use applications that are only distributed in container form or are otherwise unsuited to natively run in an HPC environment. The users served by the Oak Ridge Leadership Computing Facility are no exception. We go over the past and current containerization offerings at the Oak Ridge Leadership Computing Facility, mainly focusing on the Summit supercomputer. We arrive at using a combination of Podman and Singularity to allow users to build and run containers directly on Summit, without requiring external resources or hardware for any step of the process. We look at a couple of projects running on Summit that greatly benefited from being able to use containers on Summit. And we compare benchmarks running natively and in containers on Summit at different scales, observing minimal performance difference and consistent behavior across all tests.

Abraham, Subil↗

CORRLA-RS

The CORRLA-RS package provides a suite of statistical methods for sampling multidimensional distributions and to conduct sensitivity and correlation analysis of large scale data in the Rust programming language. The software provides a unique solution to multidimensional constrained sampling problems utilizing a combination of parallelized Markov Chain Monte Carlo methods and traditional rejection sampling. The sensitivity and correlation analysis methods are backed by a high performance randomized singular value decomposition implementation which enables datasets larger than the random access memory (RAM) size to be analyzed. Additionally, CORRLA-RS implements the active subspace identification method using a KD-Tree and the randomized singular value decomposition acting in concert.

Gurecky, William [Oak Ridge National Laboratory (O↗

Smoothing Lexis diagrams using kernel functions: A contemporary approach

Lexis diagrams are rectangular arrays of event rates indexed by age and period. Analysis of Lexis diagrams is a cornerstone of cancer surveillance research. Typically, population-based descriptive studies analyze multiple Lexis diagrams defined by sex, tumor characteristics, race/ethnicity, geographic region, etc. Inevitably the amount of information per Lexis diminishes with increasing stratification. Several methods have been proposed to smooth observed Lexis diagrams up front to clarify salient patterns and improve summary estimates of averages, gradients, and trends. In this article, we develop a novel bivariate kernel-based smoother that incorporates two key innovations. First, for any given kernel, we calculate its singular values decomposition, and select an optimal truncation point—the number of leading singular vectors to retain—based on the bias-corrected Akaike information criterion. Second, we model-average over a panel of candidate kernels with diverse shapes and bandwidths. The truncated model averaging approach is fast, automatic, has excellent performance, and provides a variance-covariance matrix that takes model selection into account. We present an in-depth case study (invasive estrogen receptor-negative breast cancer incidence among non-Hispanic white women in the United States) and simulate operating characteristics for 20 representative cancers. The truncated model averaging approach consistently outperforms any fixed kernel. Our results support the routine use of the truncated model averaging approach in descriptive studies of cancer.

60 APPLIED LIFE SCIENCES↗

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗