Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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,729 records · Page 96

Discovery of correlated electron molecular orbital materials using graph representations

Correlated electron molecular orbital (CEMO) materials host emergent electronic states built from molecular orbitals localized over clusters of transition metal ions yet have historically been discovered sporadically and generally been treated as isolated case studies. Here we establish CEMO materials as a systematically discoverable class and introduce a graph-based framework to identify, classify, and organize transition-metal cluster motifs in inorganic solids. Starting from crystal structures in the Materials Project, we construct transition metal connectivity graphs, extract cluster motifs using a bond-cutting algorithm, and determine cluster point groups, effective cluster sublattice dimensionality, and translational symmetry. Applying this approach in a high-throughput screen of 34,548 compounds yields 5,306 cluster-containing materials, including 2,627 stable or metastable compounds with isolated clusters and 984 materials featuring mixed-metal clusters. The resulting dataset reveals symmetry and element dependent trends in cluster formation. By integrating cluster classification with flat band lattice topology and battery-relevant information, we provide further relevant information to multiple scientific communities. The accompanying open dataset, Cluster Finder software, and interactive web platform enable systematic exploration of cluster driven electronic phenomena and establish a general pathway for discovering correlated quantum materials and functional materials with cluster-based or extended metal-metal bonding in inorganic solids.

Akhond, Md. Rajbanul [Department of Chemistry, 800↗

Dynamics and Formation of Antiferromagnetic Textures in MnBi 2 Te 4 Single Crystal

We report coherent X-ray imaging of antiferromagnetic (AFM) domains and domain walls in MnBi 2 Te 4 , an intrinsic AFM topological insulator. This technique enables direct visualization of domain morphology without reconstruction algorithms, allowing us to resolve antiphase domain walls as distinct dark lines arising from the A-type AFM structure. The wall width is determined to be 550(30) nm, in good agreement with earlier magnetic force microscopy results. The temperature dependence of the AFM order parameter extracted from our images closely follows previous neutron scattering data. Remarkably, however, we find a pronounced hysteresis in the evolution of domains and domain walls: upon cooling, dynamic reorganizations occur within a narrow ∼1 K interval below 𝑇 𝑁 , whereas upon warming, the domain configuration remains largely unchanged until AFM order disappears. These findings reveal a complex energy landscape in MnBi 2 Te 4 , governed by the interplay of exchange, anisotropy, and domain-wall energies, and underscore the critical role of AFM domain-wall dynamics in shaping its physical properties. These sharply defined and hysteretically evolving walls may provide a controllable AFM texture in MnBi 2 Te 4 , hinting at potential use in low-power spintronic devices based on domain-wall dynamics.

36 MATERIALS SCIENCE↗

REMOVING BIASES IN RESOLVED STELLAR MASS MAPS OF GALAXY DISKS THROUGH SUCCESSIVE BAYESIAN MARGINALIZATION

Stellar masses of galaxies are frequently obtained by fitting stellar population synthesis models to galaxy photometry or spectra. The state of the art method resolves spatial structures within a galaxy to assess the total stellar mass content. In comparison to unresolved studies, resolved methods yield, on average, higher fractions of stellar mass for galaxies. In this work we improve the current method in order to mitigate a bias related to the resolved spatial distribution derived for the mass. The bias consists in an apparent filamentary mass distribution and a spatial coincidence between mass structures and dust lanes near spiral arms. The improved method is based on iterative Bayesian marginalization, through a new algorithm we have named Bayesian Successive Priors (BSP). We have applied BSP to M51 and to a pilot sample of 90 spiral galaxies from the Ohio State University Bright Spiral Galaxy Survey. By quantitatively comparing both methods, we find that the average fraction of stellar mass missed by unresolved studies is only half what previously thought. In contrast with the previous method, the output BSP mass maps bear a better resemblance to near-infrared images.

79 ASTRONOMY AND ASTROPHYSICS↗

Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm

We study the problem of decomposing a volume with a smooth boundary into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled solution to this problem for generic smooth surfaces remained elusive. VoroCrust leverages ideas from weighted α-shapes and the power crust algorithm to produce unweighted Voronoi cells conforming to the surface, yielding the first provably-correct algorithm for this problem. Given a κ-sparse ε-sample, we work with the balls of radius δ times the local feature size centered at each sample. The corners of the union of these balls on both sides of the surface are the Voronoi sites and the interface of their cells is a watertight surface reconstruction embedded in the dual shape of the union of balls. With the surface protected, the enclosed volume can be further decomposed by generating more sites inside it. Compared to clipping-based algorithms, VoroCrust cells are full Voronoi cells, with convexity and fatness guarantees. Compared to the power crust algorithm, VoroCrust cells are not filtered, are unweighted, and offer greater flexibility in meshing the enclosed volume by either structured or randomly genenerated samples.

97 MATHEMATICS AND COMPUTING↗

Fleet DNA Phase 1 Refinement & Phase 2 Implementation; NREL (National Renewable Energy Laboratory)

Fleet DNA acts as a secure data warehouse for medium- and heavy-duty vehicle data. It demonstrates that vehicle drive cycle data can be collected and stored for large-scale analysis and modeling applications. The data serve as a real-world data source for model development and validation. Storage of the results of past/present/future data collection efforts improves analysis efficiency through pooling of shared data and provides the opportunity for 'big data' type analyses. Fleet DNA shows it is possible to develop a common database structure that can store/analyze/report on data sourced from multiple parties, each with unique data formats/types. Data filtration and normalization algorithms developed for the project allow for a wide range of data types and inputs, expanding the project’s potential. Fleet DNA demonstrates the power of integrating Big Data with existing and future tools and analyses: it provides an enhanced understanding and education of users, users can explore greenhouse gases and economic opportunities via AFLEET and ADOPT modeling, drive cycles can be characterized and visualized using DRIVE, high-level vehicle modeling can be performed using real-world drive cycles via FASTSim, and data reporting through Fleet DNA Phase 1 and 2 websites provides external users access to analysis results and gives the opportunity to explore on their own.

33 ADVANCED PROPULSION SYSTEMS↗

The Locus Algorithm II: A robust software system to maximise the quality of fields of view for Differential Photometry

We present the software system developed to implement the Locus Algorithm, a novel algorithm designed to maximise the performance of differential photometry systems by optimising the number and quality of reference stars in the Field of View with the target. Firstly, we state the design requirements, constraints and ambitions for the software system required to implement this algorithm. Then, a detailed software design is presented for the system in operation. Next, the data design including file structures used and the data environment required for the system are defined. Finally, we conclude by illustrating the scaling requirements which mandate a high-performance computing implementation of this system, which is discussed in the other papers in this series.

Nolan, Kevin↗

A 2.5d Yolo-Based Fusion Algorithm for 3d Localization Of Cells

Advances in microscopy techniques such as lattice-light-sheet, confocal, two-photon, and electron microscopy have enabled the visualization of 3D image volumes of tightly packed cells, extracellular structures in tissues, organelles, and subcellular components inside cells. These images sampled by 2D projections are often not accurately interpreted even by human experts. As a use case we focus on 3D image volumes of tightly packed nuclei in brain tissue. Due to out-of-plane excitation and low resolution in the z-axis, non-overlapping cells appear as overlapping 3D volumes and make detecting individual cells challenging. On the other hand, running 3D detection algorithms is computationally expensive and infeasible for large datasets. In addition, most existing 3D algorithms are designed to extract 3D objects by identifying the depth in the 2D images. In this work, we propose a YOLO-based 2.5D fusion algorithm for 3D localization of individual cells in densely packed volumes of nuclei. The proposed method fuses 2D detection of nuclei in sagittal, coronal, and axial planes and predicts six coordinates of the 3D bounding cubes around the detected 3D cells. Promising results were obtained on multiple examples of synthetic dense volumes of nuclei imitating confocal microscopy experimental datasets.

Ziabari, Amir↗

Fitting coupled potential energy surfaces for large systems: Method and construction of a 3-state representation for phenol photodissociation in the full 33 internal degrees of freedom using multireference configuration interaction determined data

A recently reported algorithm for representing adiabatic states coupled by conical intersections using a quasi-diabatic state Hamiltonian in four and five atom systems is extended to treat nonadiabatic processes in considerably larger molecules. The method treats all internal degrees of freedom and uses electronic structure data from ab initio multireference configuration interaction wave functions with nuclear configuration selection based on quasi-classical surface hopping trajectories. The method is shown here to be able to treat ∼30 internal degrees of freedom including dissociative and large amplitude internal motion. Two procedures are introduced which are essential to the algorithm, a null space projector which removes basis functions from the fitting process until they are needed and a partial diagonalization technique which allows for automated, but accurate, treatment of the vicinity of extended seams of conical intersections of two or more states. These procedures are described in detail. The method is illustrated using the photodissociaton of phenol, C{sub 6}H{sub 5}OH(X{sup ~1}A{sup ′}) + hv → C{sub 6}H{sub 5}OH(A{sup ~1}A{sup ′}, B{sup ~1}A{sup ′′}) → C{sub 6}H{sub 5}O(X{sup ~2}B{sub 1}, A{sup ~2}B{sub 2}) + H as a test case. Ab initio electronic structure data for the 1,2,3{sup 1}A states of phenol, which are coupled by conical intersections, are obtained from multireference first order configuration interaction wave functions. The design of bases to simultaneously treat large amplitude motion and dissociation is described, as is the ability of the fitting procedure to smooth the irregularities in the electronic energies attributable to the orbital changes that are inherent to nonadiabatic processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A fast, dense Chebyshev solver for electronic structure on GPUs

Matrix diagonalization is almost always involved in computing the density matrix needed in quantum chemistry calculations. In the case of modest matrix sizes (≲4000), performance of traditional dense diagonalization algorithms on modern GPUs is underwhelming compared to the peak performance of these devices. This motivates the exploration of alternative algorithms better suited to these types of architectures. We newly derive, and present in detail, an existing Chebyshev expansion algorithm whose number of required matrix multiplications scales with the square root of the number of terms in the expansion. Focusing on dense matrices of modest size, our implementation on GPUs results in large speed ups when compared to diagonalization. Additionally, we improve upon this existing method by capitalizing on the inherent task parallelism and concurrency in the algorithm. Furthermore, this improvement is implemented on GPUs by using CUDA and HIP streams via the MAGMA library and leads to a significant speed up over the serial-only approach for smaller (≲1000) matrix sizes. Finally, we apply our technique to a model system with a high density of states around the Fermi level, which typically presents significant challenges.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SU-E-T-461: Validation of Planning Algorithms in Dynamic Conformal Arc in IPlan Using ArcCHECK and 3DVH

Purpose: To study the effect of limited angular resolution of pencil beam calculation (PBC) on dynamic conformal arc plan (DCAP) in iPlan (BrainLab) using the ArcCHECK sytem and 3DVH software (Sun Nuclear Corporation). Methods: Four DCAPs were generated in iPlan RT Dose 4.5 treatment planning system on the ArcCHECK cylindrical phantom with central planning target volume (PTV). A cylindrical shell structure (SHELL) 2.85cm from phantom surface and 1.5 mm thickness was created to simulate the ArcCHECK diode array. Planned doses were calculated using both Monte Carlo calculation (MCC) and PBC algorithms, and exported to 3DVH software for global and target based comparisons using the 3Dgamma index. Four additional DCAPs were created and calculated on patient CT images and mapped onto the ArcCHECK phantom for measurement using a Varian TrueBeam STx. The measurements were compared against both MC and PB calculation using gamma index analysis. Results: For the ArcCHECK phantom, the dose distribution agreement quantified with 3D-gamma index is better (average-gamma (<γ>)=99.9%vs.79.1% and 96.8%vs45.7%, p=0.0294, 0.0286 for gamma (2mm,2%) and (1mm,1%) criteria respectively using Mann-Whitney U test) in the PTV than in the SHELL. The measurements show better agreement with MCC than the PB (<γ>=100%vs.86.7%, 99.6%vs.72.3%, 85.5%vs.50.8%, p=0.021, 0.026, 0.029 for gamma (3mm,3%), (2mm,2%) and (1mm,1%) criteria using Mann-Whitney U test respectively). The effect due to limited (10 degree) angular resolution of the PBC was observed, and it can be one of the possible reasons for poor agreement between measurement and PB calculation. Conclusion: The PBC of iPlan shows poor peripheral dose calculation accuracy for dynamic conformal arc plans due to limited angular resolution, but it performs well in the area close to target volume without considering heterogeneity. Since the user cannot change the 10 degree angular resolution of PBC, MCC is more appropriate for dynamic conformal arc plans.

60 APPLIED LIFE SCIENCES↗

Big Data in Reciprocal Space: Sliding Fast Fourier Transforms for Determining Periodicity

Significant advances in atomically resolved imaging of crystals and surfaces have occurred in the last decade allowing unprecedented insight into local crystal structures and periodicity. Yet, the analysis of the long-range periodicity from the local imaging data, critical to correlation of functional properties and chemistry to the local crystallography, remains a challenge. Here, we introduce a Sliding Fast Fourier Transform (FFT) filter to analyze atomically resolved images of in-situ grown La5/8Ca3/8MnO3 films. We demonstrate the ability of sliding FFT algorithm to differentiate two sub-lattices, resulting from a mixed-terminated surface. Principal Component Analysis (PCA) and Independent Component Analysis (ICA) of the Sliding FFT dataset reveal the distinct changes in crystallography, step edges and boundaries between the multiple sub-lattices. The method is universal for images with any periodicity, and is especially amenable to atomically resolved probe and electron-microscopy data for rapid identification of the sub-lattices present.

74 ATOMIC AND MOLECULAR PHYSICS↗

A Privacy-Preserving Strategy for the Trust Layer of the Energy Grid of Things Distributed Energy Resource Management System

Emergent from the shadows of the traditional grid flaws, the Smart Grid (SG) idea was born and led by government mandates toward cleaner energy production. The SG represents the next generation of electricity distribution systems that subsume recent technological innovations. It uses digital communication between its components and entities to attain more automation, self-sufficiency, and reliability. Unfortunately, this relatively new concept is not flawless; the intrinsic reliance on increased digital communication spreads open attack paths for adversaries. Therefore, finding solutions that address information exchange vulnerabilities has become imperative. The Energy Grid of Things (EGoT) is Portland State University’s (PSU’s) implementation of a Distributed Energy Resource Management System (DERMS). The EGoT DERMS requires access to customers’ information to achieve operational objectives. The system’s access to customers’ information needs to be restricted such that it does not violate customers’ privacy. Applying privacy protection models such as K-anonymity to EGoT DERMS sub-components safeguards that privacy. This thesis work proposes a strategy to ensure communication in the EGoT DERMS is privacy-preserving and secure. Specifically, it provides an approach to applying the Mondrian Algorithm to ensure data within the system excludes Personally Identifiable Information (PII) and provides means for securing the communication according to industry standards (IEEE 2030.5). Results suggest that the generalization hierarchy derived for the EGoT DERMS exhibits an Identical Generalization Hierarchy structure. Guarantees of sameness manifested in the test feeder topology would not hold in real-world scenarios. This thesis work proposes a strategy to ensure communication in the EGoT DERMS is privacy-preserving and secure. Specifically, it provides an approach to applying the Mondrian Algorithm to ensure data within the system excludes Personally Identifiable Information (PII) and provides means for securing the communication according to industry standards (IEEE 2030.5). Results suggest that the generalization hierarchy derived for the EGoT DERMS exhibits an Identical Generalization Hierarchy structure. Guarantees of sameness manifested in the test feeder topology would not hold in real-world scenarios.

Alsiad, Mohammed↗

redMaPPer. I. Algorithm and SDSS DR8 catalog

We describe redMaPPer, a new red sequence cluster finder specifically designed to make optimal use of ongoing and near-future large photometric surveys. The algorithm has multiple attractive features: (1) it can iteratively self-train the red sequence model based on a minimal spectroscopic training sample, an important feature for high-redshift surveys. (2) It can handle complex masks with varying depth. (3) It produces cluster-appropriate random points to enable large-scale structure studies. (4) All clusters are assigned a full redshift probability distribution P(z). (5) Similarly, clusters can have multiple candidate central galaxies, each with corresponding centering probabilities. (6) The algorithm is parallel and numerically efficient: it can run a Dark Energy Survey-like catalog in ∼500 CPU hours. (7) The algorithm exhibits excellent photometric redshift performance, the richness estimates are tightly correlated with external mass proxies, and the completeness and purity of the corresponding catalogs are superb. We apply the redMaPPer algorithm to ∼10, 000 deg{sup 2} of SDSS DR8 data and present the resulting catalog of ∼25,000 clusters over the redshift range z in [0.08, 0.55]. The redMaPPer photometric redshifts are nearly Gaussian, with a scatter σ {sub z} ≈ 0.006 at z ≈ 0.1, increasing to σ {sub z} ≈ 0.02 at z ≈ 0.5 due to increased photometric noise near the survey limit. The median value for |Δz|/(1 + z) for the full sample is 0.006. The incidence of projection effects is low (≤5%). Detailed performance comparisons of the redMaPPer DR8 cluster catalog to X-ray and Sunyaev-Zel'dovich catalogs are presented in a companion paper.

79 ASTRONOMY AND ASTROPHYSICS↗

A stochastic downscaling approach for generating high-frequency solar irradiance scenarios

Solar power is increasingly cost viable with solar photovoltaic (PV) installations becoming commonplace. PV planning and operational studies, however, require high-frequency solar irradiance scenarios to understand potential electric grid impacts due to the variability and uncertainty of the underlying solar resource. Existing remote sensing solar data products are often available over large spatial domains, but are limited in temporal resolution. For example, the global horizontal irradiance (GHI) component contained within the National Solar Radiation Database (NSRDB) is available at time resolution of 30 min on an approximately four-kilometer grid. In contrast, substantial solar variability is present at finer time scales and this article describes an algorithm to stochastically generate one-minute GHI from widely available sub-hourly NSRDB. A generalized linear modeling (GLM) framework is proposed, which includes non-Gaussian mixtures, and extends the literature involving the synthesis of GHI data. The model is trained on a set of sample locations around Oregon, USA, and validated across the USA using both the Surface Radiation Budget Network (SURFRAD) dataset and Solar Radiation Monitoring Laboratory (SRML) network. Simulated ensembles show good coverage properties and temporal correlation structure. The resulting downscaled ensembles allow for understanding the unpredictable variability inherent in GHI at locations without direct measurements. Here, future work can leverage the algorithm as part of a stochastic optimization of electric grid operations with high-penetration PV systems.

14 SOLAR ENERGY↗

Solid-state dimer method for calculating solid-solid phase transitions

The dimer method is a minimum mode following algorithm for finding saddle points on a potential energy surface of atomic systems. Here, the dimer method is extended to include the cell degrees of freedom for periodic solid-state systems. Using this method, reaction pathways of solid-solid phase transitions can be determined without having to specify the final state structure or reaction mechanism. Example calculations include concerted phase transitions between CdSe polymorphs and a nucleation and growth mechanism for the A15 to BCC transition in Mo.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Role of electron correlation on the adenine dimer interaction for non-equilibrium geometries: a benchmark Quantum Monte Carlo study

The accurate description of non-covalent interactions is critical for understanding the structure, dynamics, and eventual function of biomolecules. The adenine dimer serves as a benchmark system for computational methods due to its role in nucleic acid structures and its rich conformational landscape. In this study, we employ benchmark diffusion quantum Monte Carlo (DMC) methods to investigate the relative energies and role of electron correlation on a set of adenine dimer conformations generated via a search of the potential energy landscape using the global optimizer algorithm. Relative DMC energies are compared against a wide range of density functional theory (DFT) approximation results. We find that although most of the DFT functionals perform well for low-energy structures, their accuracy varies significantly for higher-energy conformations, including stacked and T-shaped structures. A large fraction of the variation is due to the treatment of the van der Waals interaction. BLYP, B3LYP, and PBE0 significantly improve with added D4 dispersion, while the recent r2SCAN-D4 and ωB97M-V functionals show the least scatter and closest agreement with the DMC. These findings highlight the delicate nature of these interactions in biomolecular systems and provide guidance for simulations of their structure and dynamics and for the development of machine learned interatomic potentials.

Washburn, Laurel [ORNL] (ORCID:0000000324179335)↗

Autonomous System Subversion Tactics: Prototypes and Recommended Countermeasures

One of the fielding requirements for Advanced and Small Modular Reactors (AR/SMR) is the ability to support remote and autonomous operations. Autonomous Control Systems (ACS) are found on platforms such as Autonomous Space Vehicles, Cruise Missiles, and advanced driver-assistance systems. Each of these ACS implementations depends upon a set of decision support subsystems responsible for supporting Autonomous Mission Managers (names vary based upon field and author preferences). These Autonomous Mission Managers receive inputs from system sensors (e.g., LIDAR collection from an automobile travelling down a street; transients from a nuclear reactor), and perform a set of classifications (e.g., Red Traffic Light; Small Pedestrian at 10m; Load Rejection; Single Coolant Pump Trip), and then use these classifications in combination with recommendation algorithms to achieve platform goals (e.g., Stop the Vehicle at the Traffic Light, Avoid the Small Pedestrian; Trip the Reactor to prevent a Safety Event). The design, implementation, and fielding of an ACS capability will alter the cyber-attack surface such that existing risk management plans will need to be updated to include how to protect and defend against data-science and decision-support-system attack classes. These attack classes would include protection of the design and training environments where algorithm selection and testing and training data would be obvious attack vectors. These attack classes would also require an informed set of detection and response procedures to identify anomalous behaviors and document best practices for anomaly assessment and vulnerability mitigation and remediation. Last year we published a Cyber Threat Assessment Methodology for Autonomous and Remote Operations for AR/SMRs along with a companion publication on Cyber Attack and Defense Use Cases. The focus of the methodology was on describing and enumerating ACS processes, components, and functions such that security engineers could: evaluate subversion options against the target; identify threat actor attributes and capabilities derived from each subversion option; and identify security controls and response countermeasures. The Use Cases document offered detailed methodology examples including an assessment of a Military Base SMR, an Autonomous System Decision Loop, and implementation of AR/SMR Machine Learning algorithms. Our proposal at the end of last year was to focus on implementation of subversion prototypes related to the last Use Case area: AR/SMR Machine Learning (ML) Algorithms. We included six attack scenarios in our Use Cases paper: a Poisoning Attack against ML functions implemented using an FPGA; a Trojaning Attack against ML classifiers exploiting the excitability of Nuclear Engineers; a Backdooring Attack against ML Training environments to ensure persistence of an attack vector; a False Positive Evasion Attack against multi-factor Access Control Systems using clever inputs; an Inference Attack against ML models by an Insider with access to the Operational environment; and an Adversarial Reprogramming Attack against a Material Access Control Video Surveillance System. At the beginning of this year these six attack scenarios were provided to our research teams at Georgia Tech and Idaho State University and each team successfully implemented a subversion attack against a ML implementation to include transient misclassifications. While this is a notable outcome from this type of research, this paper offers the reader insight into not only how to structure and execute these types of attacks, but into the thought process behind how the researcher investigated the problem space, performed initial algorithm implementation, and the trial-and-error behind arriving at the successful subversion prototypes. We include in this paper a set of associated Scenarios on how these subversion prototypes could be implemented and an initial set of guidance for AR/SMR architects, Nuclear Regulators, and Cyber Defenders to implement awareness and defense capabilities into their current operational portfolios.

42 ENGINEERING↗

Chasing Accreted Structures within Gaia DR2 Using Deep Learning

In previous work, we developed a deep neural network classifier that only relies on phase-space information to obtain a catalog of accreted stars based on the second data release of Gaia (DR2). In this paper, we apply two clustering algorithms to identify velocity substructure within this catalog. We focus on the subset of stars with line-of-sight velocity measurements that fall in the range of Galactocentric radii $r\in [6.5,9.5]\,{\rm{kpc}}$ and vertical distances $| z| \lt 3\,{\rm{kpc}}$. Known structures such as Gaia Enceladus and the Helmi stream are identified. The largest previously unknown structure, Nyx, is a vast stream consisting of at least 200 stars in the region of interest. This study displays the power of the machine-learning approach by not only successfully identifying known features but also discovering new kinematic structures that may shed light on the merger history of the Milky Way.

Astronomy & Astrophysics↗