Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “space data system”

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 91 records · Page 5

SU-F-T-81: Treating Nose Skin Using Energy and Intensity Modulated Electron Beams with Monte Carlo Based Dose Calculation

Purpose: Treating nose skin with an electron beam is of a substantial challenge due to uneven nose surfaces and tissue heterogeneity, and consequently could have a great uncertainty of dose accuracy on the target. This work explored the method using Monte Carlo (MC)-based energy and intensity modulated electron radiotherapy (MERT), which would be delivered with a photon MLC in a standard medical linac (Artiste). Methods: The traditional treatment on the nose skin involves the usage of a bolus, often with a single energy electron beam. This work avoided using the bolus, and utilized mixed energies of electron beams. An in-house developed Monte Carlo (MC)-based dose calculation/optimization planning system was employed for treatment planning. Phase space data (6, 9, 12 and 15 MeV) were used as an input source for MC dose calculations for the linac. To reduce the scatter-caused penumbra, a short SSD (61 cm) was used. A clinical case of the nose skin, which was previously treated with a single 9 MeV electron beam, was replanned with the MERT method. The resultant dose distributions were compared with the plan previously clinically used. The dose volume histogram of the MERT plan is calculated to examine the coverage of the planning target volume (PTV) and critical structure doses. Results: The target coverage and conformality in the MERT plan are improved as compared to the conventional plan. The MERT can provide more sufficient target coverage and less normal tissue dose underneath the nose skin. Conclusion: Compared to the conventional treatment technique, using MERT for the nose skin treatment has shown the dosimetric advantages in the PTV coverage and conformality. In addition, this technique eliminates the necessity of the cutout and bolus, which makes the treatment more efficient and accurate.

60 APPLIED LIFE SCIENCES↗

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗

In Situ Machine Learning for Intelligent Data Capture on Exascale Platforms. Final Report

In many dynamic systems, interesting events occur locally in time and space. Examples of such systems include ignition events in combustion simulations, material fractures in mechanics simulations, and extreme weather events in climate simulations. Due to memory constraints and data I/O costs, current simulation workflows save data at regularly spaced time-steps, at a fixed rate determined before the start of the simulation. Often this mode of operation results in missed events of interest, necessitating a simulation restart from before an event occurred with more frequent data saves. This data saving workflow is grossly inefficient and is already a bottleneck in the computing process. We propose to develop machine learning algorithms that can detect when interesting dynamical events are occurring, triggering data saves. These machine learning algorithms will perform in situ anomaly detection to flag regions with different dynamical properties than those previously recorded. The adaptive data saves would be local in time and space to match the event of interest, thereby enabling a much more efficient workflow that will reduce data I/O costs and data storage memory requirements. The algorithms will be tested on two applications: auto-ignition simulations and climate simulations. A critical component of this project will be developing machine learning algorithms that can be deployed efficiently in situ on HPC platforms with out-of-the-box functionality. The development of in situ machine learning methods to detect anomalous events would enable a more efficient and effective workflow, in which all the relevant data are saved in a single simulation run, without re-starts or scientist intervention.

42 ENGINEERING↗

A LONG-PERIOD TOTALLY ECLIPSING BINARY STAR AT THE TURNOFF OF THE OPEN CLUSTER NGC 6819 DISCOVERED WITH KEPLER

We present the discovery of the totally eclipsing long-period (P = 771.8 days) binary system WOCS 23009 in the old open cluster NGC 6819 that contains both an evolved star near central hydrogen exhaustion and a low-mass (0.45 M {sub Sun }) star. This system was previously known to be a single-lined spectroscopic binary, but the discovery of an eclipse near apastron using data from the Kepler space telescope makes it clear that the system has an inclination that is very close to 90 Degree-Sign . Although the secondary star has not been identified in spectra, the mass of the primary star can be constrained using other eclipsing binaries in the cluster. The combination of the total eclipses and a mass constraint for the primary star allows us to determine a reliable mass for the secondary star and radii for both stars, and to constrain the cluster age. Unlike well-measured stars of similar mass in field binaries, the low-mass secondary is not significantly inflated in radius compared to model predictions. The primary star characteristics, in combination with cluster photometry and masses from other cluster binaries, indicate a best age of 2.62 {+-} 0.25 Gyr, although stellar model physics may introduce systematic uncertainties at the {approx}10% level. We find preliminary evidence that the asteroseismic predictions for red giant masses in this cluster are systematically too high by as much as 8%.

79 ASTRONOMY AND ASTROPHYSICS↗

The Grassmannian Atlas: A General Framework for Exploring Linear Projections of High-Dimensional Data

Linear projections are one of the most common approaches to visualize high-dimensional data. Since the space of possible projections is large, existing systems usually select a small set of interesting projections by ranking a large set of candidate projections based on a chosen quality measure. However, while highly ranked projections can be informative, some lower ranked ones could offer important complementary information. Therefore, selection based on ranking may miss projections that are important to provide a global picture of the data. Here, the proposed work fills this gap by presenting the Grassmannian Atlas, a framework that captures the global structures of quality measures in the space of all projections, which enables a systematic exploration of many complementary projections and provides new insights into the properties of existing quality measures.

97 MATHEMATICS AND COMPUTING↗

Reactor Testing and Qualification: Prioritized High-level Criticality Testing Needs

Researchers at the Idaho National Laboratory (INL) were tasked with reviewing possible criticality testing needs to support development of the fission surface power system reactor design. Reactor physics testing can provide significant information to aid in development of technologies associated with small, fast spectrum reactors that could be applied for non-terrestrial power systems, leading to eventual system qualification. Several studies have been conducted in recent years to assess the data and analyses required to design and build a space fission power system with high confidence that the system will perform as designed [Marcille, 2004a, 2004b; Weaver, 2007; Parry et al., 2008]. This report will provide a summary of previous critical tests and physics measurements that are potentially applicable to the current reactor design (both those that have been benchmarked and those not yet benchmarked), summarize recent studies of potential nuclear testing needs for space reactor development and their applicability to the current baseline fission surface power (FSP) system design, and provide an overview of a suite of tests (separate effects, sub-critical or critical) that could fill in the information database to improve the accuracy of physics modeling efforts as the FSP design is refined. Some recommendations for tasks that could be completed in the near term are also included. Specific recommendations on critical test configurations will be reserved until after the sensitivity analyses being conducted by Los Alamos National Laboratory (LANL) are completed (due August 2011).

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Uncertainty Visualization Challenges in Decision Systems with Ensemble Data & Surrogate Models: Preprint

Uncertainty visualization is a key component in translating important insights from ensemble data into actionable decision-making by visually conveying various aspects of uncertainty within a system. With the recent advent of fast surrogate models for computationally expensive simulations, users can interact with more aspects of data spaces than ever before. However, the integration of ensemble data with surrogate models in a decision-making tool brings up new challenges for uncertainty visualization, namely how to reconcile and communicate the new and different types of uncertainties brought in by surrogates and how to utilize these new data estimates in actionable ways. In this work, we examine these issues as they relate to high-dimensional data visualization, the integration of discrete datasets and the continuous representations of those datasets, and the unique difficulties associated with systems that allow users to iterate between input and output spaces. We assess the role of uncertainty visualization in facilitating intuitive and actionable interaction with ensemble data and surrogate models, and highlight key challenges in this new frontier of computational simulation.

ensemble visualization↗

STRUCTURE AND COMPOSITION OF TWO TRANSITIONAL CIRCUMSTELLAR DISKS IN CORONA AUSTRALIS

The late stages of evolution of the primordial circumstellar disks surrounding young stars are poorly understood, yet vital to constraining theories of planet formation. We consider basic structural models for the disks around two {approx}10 Myr old members of the nearby RCrA association: RX J1842.9-3532 and RX J1852.3-3700. We present new arcsecond-resolution maps of their 230 GHz continuum emission from the Submillimeter Array and unresolved CO(3-2) spectra from the Atacama Submillimeter Telescope Experiment. By combining these data with broadband fluxes from the literature and infrared fluxes and spectra from the catalog of the Formation and Evolution of Planetary Systems Legacy program on the Spitzer Space Telescope, we assemble a multiwavelength data set probing the gas and dust disks. Using the Monte Carlo radiative transfer code RADMC to model simultaneously the spectral energy distribution and millimeter continuum visibilities, we derive basic dust disk properties and identify an inner cavity of radius 16 AU in the disk around RX J1852.3-3700. We also identify an optically thin 5 AU cavity in the disk around RX J1842.9-3532, with a small amount of optically thick material close to the star. The molecular line observations suggest an intermediate disk inclination in RX J1842.9-3532, consistent with the continuum emission. In combination with the dust models, the molecular data allow us to derive a lower CO content than expected, suggesting that the process of gas clearing is likely underway in both systems, perhaps simultaneously with planet formation.

79 ASTRONOMY AND ASTROPHYSICS↗

MAGDAS Project for Space Weather Research and Application

The Space Environment Research Center (SERC), Kyushu University, is currently deploying a new ground-based magnetometer network of MAGnetic Data Acqusition System (MAGDAS), in cooperation with about 30 organizations in the world, in order to understand the complex Sun-Earth system for space weather research and application. SERC will conducts MAGDAS observation at 50 stations in the Circum-pan Pacific Magnetometer Network (CPMN) region, and FM-CW radar observation along the 210 deg. magnetic meridian (MM) during the IHY/ILWS/CAWSES periods. This project is actively providing the following space weather monitoring:(1) Global 3-dimensional current system to know electromagnetic coupling of the region 1 and 2 field-aligned currents, auroral electrojet current, Sq current, and equatorial electrojet current. (2) Plasma mass density along the 210 deg. MM to understand plasma environment change during space storms. (3) Ionospheric electric field intensity with 10-sec sampling at L = 1.26 to understand how the external electric field penetrates into the equatorial ionosphere.

79 ASTRONOMY AND ASTROPHYSICS↗

THE GLOBULAR CLUSTER POPULATION OF NGC 7457: CLUES TO THE EVOLUTION OF FIELD S0 GALAXIES

In this paper, we present the results of a wide-field imaging study of the globular cluster (GC) system of the field S0 galaxy NGC 7457. To derive the global properties of the GC system, we obtained deep BVR images with the WIYN 3.5 m telescope and Minimosaic Imager and studied the GC population of NGC 7457 to a projected radius of {approx}30 kpc. Our ground-based data were combined with archival and published Hubble Space Telescope data to probe the properties of the GC system close to the galaxy center and reduce contamination in the GC candidate sample from foreground stars and background galaxies. We performed surface photometry of NGC 7457 and compared the galaxy's surface brightness profile with the surface density profile of the GC system. The profiles have similar shapes in the inner 1' (3.9 kpc), but the GC system profile appears to flatten relative to the galaxy light at larger radii. The GC system of NGC 7457 is noticeably elliptical in our images; we measure {epsilon} = 0.66 {+-} 0.14 for the GC distribution, which is consistent with our measured ellipticity of the galaxy light. We integrated the radial surface density profile of the GC system to derive a total number of GCs, N{sub GC} = 210 {+-} 30. The GC specific frequencies normalized by the galaxy luminosity and mass are S{sub N} = 3.1 {+-} 0.7 and T = 4.8 {+-} 1.1, respectively. Comparing the derived GC system properties and other empirical data for NGC 7457 to S0 formation scenarios suggests that this field S0 galaxy may have formed in an unequal-mass merger.

79 ASTRONOMY AND ASTROPHYSICS↗

Internet of Things (IoT) Products and Applications: Lighting - Manufacturer and End-User Perspectives

It is forecast that the Internet of Things (IoT) market will experience significant growth in the coming years, with many expecting compound annual growth rates generally in the mid-20% (Forbes 2017). For lighting manufacturers, this is a tremendous opportunity to revolutionize their products to address the dwindling sales of lamps, once a major revenue stream, and bring new capabilities and services to their customers through luminaires and other lighting system components. For end-users, lighting products of the future may do more than simply provide light, with a cadre of connected sensors and controls that may help them do everything from exploring energy saving opportunities in other building systems to data-mining occupancy data to optimize use of space or increase sales. The focus of this study is to evaluate where the lighting market is today with respect to integrating IoT into its product offerings and end-user experiences with IoT, and in particular with IoT incorporated into lighting systems. The benefits, in terms of energy savings, of encouraging the adoption of connected lighting systems beyond the current solid state lighting (SSL) path to more aggressive DOE SSL Program Goals can result in an additional 33-percent of the LED energy savings, or 1.4 Quads, in 2035 (Navigant 2016).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗

[La(UO{sub 2})V{sub 2}O{sub 7}][(UO{sub 2})(VO{sub 4})] the first lanthanum uranyl-vanadate with structure built from two types of sheets based upon the uranophane anion-topology

The new lanthanum uranyl vanadate divanadate, [La(UO{sub 2})V{sub 2}O{sub 7}][(UO{sub 2})(VO{sub 4})] was obtained by reaction at 800 Degree-Sign C between lanthanum chloride, uranium oxide (U{sub 3}O{sub 8}) and vanadium oxide (V{sub 2}O{sub 5}) and the structure was determined from single-crystal X-ray diffraction data. This compound crystallizes in the orthorhombic system with space group P2{sub 1}2{sub 1}2{sub 1} and unit-cell parameters a=6.9470(2) A, b=7.0934(2) A, c=25.7464(6) A, V=1268.73(5) A{sup 3}, Z=4. A full matrix least-squares refinement yielded R{sub 1}=0.0219 for 5493 independent reflections. The crystal structure is characterized by the stacking of uranophane-type sheets {sup 2}{sub {infinity}}[(UO{sub 2})(VO{sub 4})]{sup -} and double layers {sup 2}{sub {infinity}}[La(UO{sub 2})(V{sub 2}O{sub 7})]{sup +} connected through La-O bonds involving the uranyl oxygen of the uranyl-vanadate sheets. The double layers result from the connection of two {sup 2}{sub {infinity}}[La(UO{sub 2})(VO{sub 4}){sub 2}]{sup -} sheets derived from the uranophane anion-topology by replacing half of the uranyl ions by lanthanum atoms and connected through the formation of divanadate entities. - Graphical abstract: A view of the three-dimensional structure of [La(UO{sub 2})V{sub 2}O{sub 7}][(UO{sub 2})(VO{sub 4})]. Highlights: Black-Right-Pointing-Pointer New lanthanum uranyl vanadate divanadate has been synthesized. Black-Right-Pointing-Pointer Structure was determined from single-crystal X-ray diffraction data. Black-Right-Pointing-Pointer Structure is characterized by uranophane-type sheets and double layers {sup 2}{sub {infinity}}[La(UO{sub 2})(V{sub 2}O{sub 7})]{sup +}.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automated classification of big X-ray diffraction data using deep learning models

Abstract In current in situ X-ray diffraction (XRD) techniques, data generation surpasses human analytical capabilities, potentially leading to the loss of insights. Automated techniques require human intervention, and lack the performance and adaptability required for material exploration. Given the critical need for high-throughput automated XRD pattern analysis, we present a generalized deep learning model to classify a diverse set of materials’ crystal systems and space groups. In our approach, we generate training data with a holistic representation of patterns that emerge from varying experimental conditions and crystal properties. We also employ an expedited learning technique to refine our model’s expertise to experimental conditions. In addition, we optimize model architecture to elicit classification based on Bragg’s Law and use evaluation data to interpret our model’s decision-making. We evaluate our models using experimental data, materials unseen in training, and altered cubic crystals, where we observe state-of-the-art performance and even greater advances in space group classification.

Chemistry↗

Data Storage and sharing for the long tail of science

Research data infrastructure such as storage must now accommodate new requirements resulting from trends in research data management that require researchers to store their data for the long term and make it available to other researchers. We propose Data Depot, a system and service that provides capabilities for shared space within a group, shared applications, flexible access patterns and ease of transfer at Purdue University. We evaluate Depot as a solution for storing and sharing multiterabytes of data produced in the long tail of science with a use case in soundscape ecology studies from the Human- Environment Modeling and Analysis Laboratory. We observe that with the capabilities enabled by Data Depot, researchers can easily deploy fine-grained data access control, manage data transfer and sharing, as well as integrate their workflows into a High Performance Computing environment.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗