Search NASA⌕ Search

SEARCH · Search NASA

Results for “clustering algorithms”

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,063 records · Page 59
All sourcesNASA NTRSDOE OSTI
NASA NTRS2017

Understanding the International Space Station Crew Perspective following Long-Duration Missions through Data Analytics & Visualization of Crew Feedback

The International Space Station (ISS) first became a home and research laboratory for NASA and International Partner crewmembers over 16 years ago. Each ISS mission lasts approximately 6 months and consists of three to six crewmembers. After returning to Earth, most crewmembers participate in an extensive series of 30+ debriefs intended to further understand life onboard ISS and allow crews to reflect on their experiences. Examples of debrief data collected include ISS crew feedback about sleep, dining, payload science, scheduling and time planning, health & safety, and maintenance. The Flight Crew Integration (FCI) Operational Habitability (OpsHab) team, based at Johnson Space Center (JSC), is a small group of Human Factors engineers and one stenographer that has worked collaboratively with the NASA Astronaut office and ISS Program to collect, maintain, disseminate and analyze this data. The database provides an exceptional and unique resource for understanding the "crew perspective" on long duration space missions. Data is formatted and categorized to allow for ease of search, reporting, and ultimately trending, in order to understand lessons learned, recurring issues and efficiencies gained over time. Recently, the FCI OpsHab team began collaborating with the NASA JSC Knowledge Management team to provide analytical analysis and visualization of these over 75,000 crew comments in order to better ascertain the crew's perspective on long duration spaceflight and gain insight on changes over time. In this initial phase of study, a text mining framework was used to cluster similar comments and develop measures of similarity useful for identifying relevant topics affecting crew health or performance, locating similar comments when a particular issue or item of operational interest is identified, and providing search capabilities to identify information pertinent to future spaceflight systems and processes for things like procedure development and training. In addition, the comments were scored for sentiment using a polarity scoring algorithm to identify both positive and negative comments for particular groups and clusters, allowing the team to make analytically informed decisions regarding future hardware and operating procedures. The use of polarity scoring with time series analysis was used to provide insight into how crew health and habitability is changing throughout various spaceflight increments or the station lifecycle as a whole. Finally, a visualization framework was developed to address the needs of the end users to search for and analyze comments by user, category or mission. This paper will discuss how the use of an analytical framework in conjunction with the current human interface, improved the understanding of crew perspective and shortened the time for analysis allowing for more informed decisions and rapid development of improvements. These methods are significantly optimizing the way that this valuable data can be assessed and applied to current and future spaceflight design and development. This collaboration allows the FCI OpsHab team to effectively analyze and share data in a more automated and timely fashion. Trends are no longer derived manually and can be illustrated effectively and accurately with these evolving techniques to an ever growing group of human spaceflight end users.

Bryant, Cody↗
DOE OSTI2014

CMB lensing power spectrum biases from galaxies and clusters using high-angular resolution temperature maps

The lensing power spectrum from cosmic microwave background (CMB) temperature maps will be measured with unprecedented precision with upcoming experiments, including upgrades to the Atacama Cosmology Telescope and the South Pole Telescope. Achieving significant improvements in cosmological parameter constraints, such as percent level errors on σ{sub 8} and an uncertainty on the total neutrino mass of ∼50 meV, requires percent level measurements of the CMB lensing power. This necessitates tight control of systematic biases. We study several types of biases to the temperature-based lensing reconstruction signal from foreground sources such as radio and infrared galaxies and the thermal Sunyaev-Zel'dovich effect from galaxy clusters. These foregrounds bias the CMB lensing signal due to their non-Gaussian nature. Using simulations as well as some analytical models we find that these sources can substantially impact the measured signal if left untreated. However, these biases can be brought to the percent level if one masks galaxies with fluxes at 150 GHz above 1 mJy and galaxy clusters with masses above M {sub vir} = 10{sup 14} M {sub ☉}. To achieve such percent level bias, we find that only modes up to a maximum multipole of l {sub max} ∼ 2500 should be included in the lensing reconstruction. We also discuss ways to minimize additional bias induced by such aggressive foreground masking by, for example, exploring a two-step masking and in-painting algorithm.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2013

Automatic Data Filter Customization Using a Genetic Algorithm

This work predicts whether a retrieval algorithm will usefully determine CO2 concentration from an input spectrum of GOSAT (Greenhouse Gases Observing Satellite). This was done to eliminate needless runtime on atmospheric soundings that would never yield useful results. A space of 50 dimensions was examined for predictive power on the final CO2 results. Retrieval algorithms are frequently expensive to run, and wasted effort defeats requirements and expends needless resources. This algorithm could be used to help predict and filter unneeded runs in any computationally expensive regime. Traditional methods such as the Fischer discriminant analysis and decision trees can attempt to predict whether a sounding will be properly processed. However, this work sought to detect a subsection of the dimensional space that can be simply filtered out to eliminate unwanted runs. LDAs (linear discriminant analyses) and other systems examine the entire data and judge a "best fit," giving equal weight to complex and problematic regions as well as simple, clear-cut regions. In this implementation, a genetic space of "left" and "right" thresholds outside of which all data are rejected was defined. These left/right pairs are created for each of the 50 input dimensions. A genetic algorithm then runs through countless potential filter settings using a JPL computer cluster, optimizing the tossed-out data s yield (proper vs. improper run removal) and number of points tossed. This solution is robust to an arbitrary decision boundary within the data and avoids the global optimization problem of whole-dataset fitting using LDA or decision trees. It filters out runs that would not have produced useful CO2 values to save needless computation. This would be an algorithmic preprocessing improvement to any computationally expensive system.

Mandrake, Lukas↗
NASA NTRS2004

Pre-Hardware Optimization and Implementation Of Fast Optics Closed Control Loop Algorithms

One of the main heritage tools used in scientific and engineering data spectrum analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). The FFT is particularly useful in two-dimensional (2-D) image processing (FFT2) within optical systems control. However, timing constraints of a fast optics closed control loop would require a supercomputer to run the software implementation of the FFT2 and its inverse, as well as other image processing representative algorithm, such as numerical image folding and fringe feature extraction. A laboratory supercomputer is not always available even for ground operations and is not feasible for a night project. However, the computationally intensive algorithms still warrant alternative implementation using reconfigurable computing technologies (RC) such as Digital Signal Processors (DSP) and Field Programmable Gate Arrays (FPGA), which provide low cost compact super-computing capabilities. We present a new RC hardware implementation and utilization architecture that significantly reduces the computational complexity of a few basic image-processing algorithm, such as FFT2, image folding and phase diversity for the NASA Solar Viewing Interferometer Prototype (SVIP) using a cluster of DSPs and FPGAs. The DSP cluster utilization architecture also assures avoidance of a single point of failure, while using commercially available hardware. This, combined with the control algorithms pre-hardware optimization, or the first time allows construction of image-based 800 Hertz (Hz) optics closed control loops on-board a spacecraft, based on the SVIP ground instrument. That spacecraft is the proposed Earth Atmosphere Solar Occultation Imager (EASI) to study greenhouse gases CO2, C2H, H2O, O3, O2, N2O from Lagrange-2 point in space. This paper provides an advanced insight into a new type of science capabilities for future space exploration missions based on on-board image processing for control and for robotics missions using vision sensors. It presents a top-level description of technologies required for the design and construction of SVIP and EASI and to advance the spatial-spectral imaging and large-scale space interferometry science and engineering.

Kizhner, Semion↗
DOE OSTI2023

Robust sampling for weak lensing and clustering analyses with the Dark Energy Survey

Recent cosmological analyses rely on the ability to accurately sample from high-dimensional posterior distributions. A variety of algorithms have been applied in the field, but justification of the particular sampler choice and settings is often lacking. Here, we investigate three such samplers to motivate and validate the algorithm and settings used for the Dark Energy Survey (DES) analyses of the first 3 yr (Y3) of data from combined measurements of weak lensing and galaxy clustering. We employ the full DES Year 1 likelihood alongside a much faster approximate likelihood, which enables us to assess the outcomes from each sampler choice and demonstrate the robustness of our full results. We find that the ellipsoidal nested sampling algorithm multinest reports inconsistent estimates of the Bayesian evidence and somewhat narrower parameter credible intervals than the sliced nested sampling implemented in polychord. We compare the findings from multinest and polychord with parameter inference from the Metropolis–Hastings algorithm, finding good agreement. We determine that polychord provides a good balance of speed and robustness for posterior and evidence estimation, and recommend different settings for testing purposes and final chains for analyses with DES Y3 data. Our methodology can readily be reproduced to obtain suitable sampler settings for future surveys.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS2020

An Algorithm for Hyperspectral Remote Sensing of Aerosols: 3. Application to the GEO-TASO Data in KORUS-AQ Field Campaign

This paper describes the third part of a series of investigations to develop algorithms for simultaneous retrieval of aerosol parameters and surface spectral reflectance from the data measured by GEOstationary Trace gas and Aerosol Sensor Optimization (GEO-TASO) instrument. Since the algorithm is designed for future hyperspectral and geostationary satellite sensors, such as Tropospheric Emissions: Monitoring of Pollution (TEMPO), it is applied to GEO-TASO data measured over the same area by different flights as part of the Korea-United Stated Air Quality Study (KORUS-AQ) field campaign in 2016. While GEO-TAOS has a spectral sampling interval of ~0.28 nm in the visible, its data is thinned through a band selection approach with consideration of atmospheric transmittance and different surface types, which yields 20 common spectral bands to be used by the algorithm. The algorithm starts with 4 common principal components (PCs) for surface spectral reflectance extracted from various spectral libraries, and the constraints of surface reflectance parameters and aerosol scattering models respectively from k- means clustering analysis of the Rayleigh-corrected GEO-TASO spectra and AERONET data. The algorithm then proceeds iteratively with an optimal estimation approach to update PCs and retrieve aerosol optical depth (AOD) until the best match between simulated and GEOS-TASO measured spectra is achieved. The spectral AODs are compared between those retrieved from GEO-TASO (x) and 7 AERONETS (y) in 440, 550, 550, 675 nm, respectively. The comparison reveals that iterative updates of surface spectral PCs (and so surface reflectance) yield significant enhancement in AOD retrievals, improving the mean linear fitting equations from y = 0.735x + 0.088 (without update of PCs) to y = 1.055x+ 0.01, and the Pearson correlation coefficient (𝑅𝑅2) from 0.54 to 0.76, respectively. Move case studies are need to further evaluate the algorithm for its application to TEMPO that carries a enhanced version of GEO-TASO instrument.

Tropospheric Emissions: Monitoring of Pollution (T↗
DOE OSTI2020

Unraveling the structural stability and the electronic structure of ThO 2 clusters

Unraveling the correlations between the geometry, the relative energy and the electronic structure of metal oxide nanostructures is crucial for a better control of their size, shape and properties. Here, we investigated these correlations for stoichiometric thorium dioxide clusters ranging from ThO 2 to Th 8 O 16 using a chemically-driven geometry search algorithm in combination with state-of-the-art first principles calculations. This strategy allows us to homogeneously screen the potential energy surface of actinide oxide clusters for the first time. It is found that the presence of peroxo and superoxo groups tends to increase the total energy of the system by at least 3.5 eV and 7 eV, respectively. For the larger clusters, the presence of terminal oxygen atoms increases the energy by about 0.5 eV. Regarding the electronic structure, it is found that the HOMO–LUMO gap is larger in systems containing only bridging oxygen atoms (~2–3.5 eV) than for systems containing oxo groups (~1–3 eV), peroxo groups (~0–2 eV), and superoxo groups (~0–1 eV). Furthermore, while the LUMO is always dominated by thorium orbitals, the composition of the HOMO changes in the presence or the absence of oxo, peroxo and/or superoxo groups: in the presence of peroxo groups, it is dominated by thorium orbitals, in all other cases, it is dominated by oxygen orbitals, and is rather localized in the presence of terminal oxo or superoxo groups. These correlations are of great interest for synthesizing clusters with tailored properties, especially for applications in the field of nuclear energy and heterogeneous catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2015

HACC: Simulating sky surveys on state-of-the-art supercomputing architectures

Current and future surveys of large-scale cosmic structure are associated with a massive and complex datastream to study, characterize, and ultimately understand the physics behind the two major components of the ‘Dark Universe’, dark energy and dark matter. In addition, the surveys also probe primordial perturbations and carry out fundamental measurements, such as determining the sum of neutrino masses. Large-scale simulations of structure formation in the Universe play a critical role in the interpretation of the data and extraction of the physics of interest. Just as survey instruments continue to grow in size and complexity, so do the supercomputers that enable these simulations. In this paper, we report on HACC (Hardware/Hybrid Accelerated Cosmology Code), a recently developed and evolving cosmology N-body code framework, designed to run efficiently on diverse computing architectures and to scale to millions of cores and beyond. HACC can run on all current supercomputer architectures and supports a variety of programming models and algorithms. It has been demonstrated at scale on Cell- and GPU-accelerated systems, standard multi-core node clusters, and Blue Gene systems. HACC’s design allows for ease of portability, and at the same time, high levels of sustained performance on the fastest supercomputers available. We present a description of the design philosophy of HACC, the underlying algorithms and code structure, and outline implementation details for several specific architectures. We show selected accuracy and performance results from some of the largest high resolution cosmological simulations so far performed, including benchmarks evolving more than 3.6 trillion particles.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2013

Breast density quantification using magnetic resonance imaging (MRI) with bias field correction: A postmortem study

Purpose: Quantification of breast density based on three-dimensional breast MRI may provide useful information for the early detection of breast cancer. However, the field inhomogeneity can severely challenge the computerized image segmentation process. In this work, the effect of the bias field in breast density quantification has been investigated with a postmortem study. Methods: T1-weighted images of 20 pairs of postmortem breasts were acquired on a 1.5 T breast MRI scanner. Two computer-assisted algorithms were used to quantify the volumetric breast density. First, standard fuzzy c-means (FCM) clustering was used on raw images with the bias field present. Then, the coherent local intensity clustering (CLIC) method estimated and corrected the bias field during the iterative tissue segmentation process. Finally, FCM clustering was performed on the bias-field-corrected images produced by CLIC method. The left–right correlation for breasts in the same pair was studied for both segmentation algorithms to evaluate the precision of the tissue classification. Finally, the breast densities measured with the three methods were compared to the gold standard tissue compositions obtained from chemical analysis. The linear correlation coefficient, Pearson'sr, was used to evaluate the two image segmentation algorithms and the effect of bias field. Results: The CLIC method successfully corrected the intensity inhomogeneity induced by the bias field. In left–right comparisons, the CLIC method significantly improved the slope and the correlation coefficient of the linear fitting for the glandular volume estimation. The left–right breast density correlation was also increased from 0.93 to 0.98. When compared with the percent fibroglandular volume (%FGV) from chemical analysis, results after bias field correction from both the CLIC the FCM algorithms showed improved linear correlation. As a result, the Pearson'sr increased from 0.86 to 0.92 with the bias field correction. Conclusions: The investigated CLIC method significantly increased the precision and accuracy of breast density quantification using breast MRI images by effectively correcting the bias field. It is expected that a fully automated computerized algorithm for breast density quantification may have great potential in clinical MRI applications.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
NASA NTRS1998

Parallel Implicit Algorithms for CFD

The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.

Keyes, David E.↗
NASA NTRS2005

A Parallel Processing Algorithm for Remote Sensing Classification

A current thread in parallel computation is the use of cluster computers created by networking a few to thousands of commodity general-purpose workstation-level commuters using the Linux operating system. For example on the Medusa cluster at NASA/GSFC, this provides for super computing performance, 130 G(sub flops) (Linpack Benchmark) at moderate cost, $370K. However, to be useful for scientific computing in the area of Earth science, issues of ease of programming, access to existing scientific libraries, and portability of existing code need to be considered. In this paper, I address these issues in the context of tools for rendering earth science remote sensing data into useful products. In particular, I focus on a problem that can be decomposed into a set of independent tasks, which on a serial computer would be performed sequentially, but with a cluster computer can be performed in parallel, giving an obvious speedup. To make the ideas concrete, I consider the problem of classifying hyperspectral imagery where some ground truth is available to train the classifier. In particular I will use the Support Vector Machine (SVM) approach as applied to hyperspectral imagery. The approach will be to introduce notions about parallel computation and then to restrict the development to the SVM problem. Pseudocode (an outline of the computation) will be described and then details specific to the implementation will be given. Then timing results will be reported to show what speedups are possible using parallel computation. The paper will close with a discussion of the results.

Gualtieri, J. Anthony↗
DOE OSTI2018

Objective Quantification of Convective Clustering Observed During the AMIE/DYNAMO Two-Day Rain Episodes

One critical bottleneck in developing and evaluating ways to represent the mesoscale organization of convection in cumulus parameterization schemes is that there is no single accepted method of objectively quantifying the degree of convective organization or clustering from observations. This study addresses this need using high-quality S-PolKa radar data from the Atmospheric Radiation Measurement Madden-Julian Oscillation Investigation Experiment/Dynamics of the Madden-Julian Oscillation (AMIE/DYNAMO) field campaign. We first identify convective elements (contiguous convective echoes [CCEs]) from radar reflectivity observations using the rain type classification algorithm of Powell et al. (2016, https://doi.org/10.1175/JTECH-D-15-0135.1). Then we apply scalar clustering metrics, including the organization index (I org ) of Tompkins and Semie, to the radar CCEs to test their ability of quantifying convective clustering during the observed two-day rain episodes. Our results show two distinct phases of convective clustering during the two-day rain episodes, with each phase covering about 10 hr before (Phase 1) and after (Phase 2) the time of peak rain rate. In Phase 1 clustering, the number of CCEs increases and convective cells cluster as new cells form preferentially near existing convective entities. The number of CCEs decreases as the environment stabilizes in Phase 2 clustering, during which already clustered cells with associated stratiform clouds are preferred over the isolated ones. I org is capable of capturing convective clustering in both phases. The possible mechanisms for convective clustering are discussed, including cold pool-updraft feedback, moisture-convection interaction, and mesoscale circulations. Our results suggest that parameterizations of convective organization should represent the feedback processes that are responsible for the convective clustering during both phases.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Chandra Follow-up of the SDSS DR8 Redmapper Catalog Using the MATCha Pipeline

In order to place constraints on cosmology through optical surveys of galaxy clusters, one must first understand the properties of those clusters. To this end, we introduce the Mass Analysis Tool for Chandra (MATCha), a pipeline that uses a parallellized algorithm to analyze archival Chandra data. MATCha simultaneously calculates X-ray temperatures and luminosities and performs centering measurements for hundreds of potential galaxy clusters using archival X-ray exposures. We run MATCha on the redMaPPer SDSS DR8 cluster catalog and use MATCha's output X-ray temperatures and luminosities to analyze the galaxy cluster temperature–richness, luminosity–richness, luminosity–temperature, and temperature–luminosity scaling relations. We detect 447 clusters and determine 246 r 2500 temperatures across all redshifts. Within 0.1 < z < 0.35, we find that r 2500 T X scales with optical richness (λ) as $\mathrm{ln}\left(\tfrac{{k}_{B}{T}_{{\rm{X}}}}{1.0\,\mathrm{keV}}\right)=(0.52\pm 0.05)\mathrm{ln}\left(\tfrac{\lambda }{70}\right)+(1.85\pm 0.03)$ with an intrinsic scatter of $0.27\pm 0.02$ ($1\sigma $). We investigate the distribution of offsets between the X-ray center and redMaPPer center within 0.1 < z < 0.35, finding that 68%.3 ± 6.5% of clusters are well-centered. However, we find a broad tail of large offsets in this distribution, and we explore some of the causes of redMaPPer miscentering.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Sub-system quantum dynamics using coupled cluster downfolding techniques

In this paper, we discuss extending the sub-system embedding sub-algebra coupled cluster (SES-CC) formalism and the double unitary coupled cluster (DUCC) ansatz to the time domain. As we demonstrated in earlier studies, it is possible, using these formalisms, to calculate the energy of the entire system as an eigenvalue of downfolded/effective Hamiltonian in the active space, that is identifiable with the sub-system of the composite system. In these studies, we demonstrated that downfolded Hamiltonians integrate out Fermionic degrees of freedom that do not correspond to the physics encapsulated by the active space. We extend these results to the time-dependent Schrödinger equation, showing that a similar construct is possible to partition a system into a sub-system that varies slowly in time and a remaining subsystem that corresponds to fast oscillations. This time dependent formalism allows coupled cluster quantum dynamics to be extended to larger systems and for the formulation of novel quantum algorithms based on the quantum Lanczos approach, which have recently been considered in the literature.

coupled cluster, Electron correlation, quantum dyn↗
DOE OSTI2019

Correcting for fibre assignment incompleteness in the DESI Bright Galaxy Survey

The Dark Energy Spectroscopic Instrument (DESI) Bright Galaxy Survey (BGS) will be a survey of bright, low-redshift galaxies, which is planned to cover an area of ~14000 square degrees in three passes. Each pass will cover the survey area with ~2000 pointings, each of area ~8 square degrees. The BGS is currently proposed to consist of a bright high priority sample to an r-band magnitude limit r ~ 19.5, with a fainter low priority sample to r ~ 20. The geometry of the DESI fibre positioners in the focal plane of the telescope affects the completeness of the survey and has a non-trivial impact on clustering measurements. Using a BGS mock catalogue, we demonstrate that completeness due to fibre assignment primarily depends on the surface density of galaxies. Completeness is high (>95 per cent) in low-density regions, but very low (<10 per cent) in the centre of massive clusters. We apply the pair inverse probability (PIP) weighting correction to clustering measurements from a BGS mock which has been through the fibre assignment algorithm. This method is only unbiased if it is possible to observe every galaxy pair. To expedite this, we randomly promote a small fraction of the fainter sample to be high priority, and dither the set of tile positions by a small angle. We show that inverse pair weighting combined with angular upweighting provides an unbiased correction to galaxy clustering measurements for the complete three pass survey, and also after one pass, which is highly incomplete.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Post-processing interstitialcy diffusion from molecular dynamics simulations

An algorithm to rigorously trace the interstitialcy diffusion trajectory in crystals is developed. The algorithm incorporates unsupervised learning and graph optimization which obviate the need to input extra domain specific information depending on crystal or temperature of the simulation. The algorithm is implemented in a flexible framework as a post-processor to molecular dynamics (MD) simulations. We describe in detail the reduction of interstitialcy diffusion into known computational problems of unsupervised clustering and graph optimization. We also discuss the steps, computational efficiency and key components of the algorithm. Using the algorithm, thermal interstitialcy diffusion from low to near-melting point temperatures is studied. We encapsulate the algorithms in a modular framework with functionality to calculate diffusion coefficients, migration energies and other trajectory properties. The study validates the algorithm by establishing the conformity of output parameters with experimental values and provides detailed insights for the interstitialcy diffusion mechanism. The algorithm along with the help of supporting visualizations and analysis gives convincing details and a new approach to quantifying diffusion jumps, jump-lengths, time between jumps and to identify interstitials from lattice atoms. -- Graphical abstract:.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2011

GALAXY CLUSTER RADIO RELICS IN ADAPTIVE MESH REFINEMENT COSMOLOGICAL SIMULATIONS: RELIC PROPERTIES AND SCALING RELATIONSHIPS

Cosmological shocks are a critical part of large-scale structure formation, and are responsible for heating the intracluster medium in galaxy clusters. In addition, they are capable of accelerating non-thermal electrons and protons. In this work, we focus on the acceleration of electrons at shock fronts, which is thought to be responsible for radio relics-extended radio features in the vicinity of merging galaxy clusters. By combining high-resolution adaptive mesh refinement/N-body cosmological simulations with an accurate shock-finding algorithm and a model for electron acceleration, we calculate the expected synchrotron emission resulting from cosmological structure formation. We produce synthetic radio maps of a large sample of galaxy clusters and present luminosity functions and scaling relationships. With upcoming long-wavelength radio telescopes, we expect to see an abundance of radio emission associated with merger shocks in the intracluster medium. By producing observationally motivated statistics, we provide predictions that can be compared with observations to further improve our understanding of magnetic fields and electron shock acceleration.

79 ASTRONOMY AND ASTROPHYSICS↗