Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied computing”

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,765 records · Page 98

The core structure and recombination energy of a copper screw dislocation: a Peierls study

The recombination process of dislocations is central to cross-slip, and transmission through Σ3 grain boundaries among other fundamental plastic deformation processes. Despite its importance, a detailed mechanistic understanding remains lacking. In this paper, we apply a continuous dislocation model, inspired by Peierls and Nabarro, complete with an ab-initio computed -surface and continuous units of infinitesimal dislocation slip, towards computing the stress-dependent recombination path of both an isotropic and anisotropic Cu screw dislocation. Under no applied stress, our model reproduces the stacking fault width between Shockley partial dislocations as predicted by discrete linear elasticity. Upon application of a compressive Escaig stress, the two partial dislocations coalesce to a separation of ~|b|. Upon increased loading the edge components of each partial dislocation recede, leaving behind a spread Peierls screw dislocation, indicating the recombined state. We demonstrate that the critical stress required to achieve the recombined state is independent of the shear modulus. Rather the critical recombination stress depends on an energy difference between an unstable fault energy (γτ) and the intrinsic stacking fault energy (γτ-γisf). We report recombination energies of ΔW = 0.168 eV/Å and ΔW = 0.084 eV/Å, respectively, for the Cu screw dislocation within isotropic and anisotropic media. Finally, we develop an analytic model which provides insight into our simulation results which compare favourably with other (similar) models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Elviz – exploration of metagenome assemblies with an interactive visualization tool

Metagenomics, the sequencing of DNA collected from an entire microbial community, enables the study of natural microbial consortia in their native habitats. Metagenomics studies produce huge volumes of data, including both the sequences themselves and metadata describing their abundance, assembly, predicted functional characteristics and environmental parameters. The ability to explore these data visually is critically important to meaningful biological interpretation. Current genomics applications cannot effectively integrate sequence data, assembly metadata, and annotation to support both genome and community-level inquiry. Elviz (Environmental Laboratory Visualization) is an interactive web-based tool for the visual exploration of assembled metagenomes and their complex metadata. Elviz allows scientists to navigate metagenome assemblies across multiple dimensions and scales, plotting parameters such as GC content, relative abundance, phylogenetic affiliation and assembled contig length. Furthermore Elviz enables interactive exploration using real-time plot navigation, search, filters, axis selection, and the ability to drill from a whole-community profile down to individual gene annotations. Thus scientists engage in a rapid feedback loop of visual pattern identification, hypothesis generation, and hypothesis testing. Compared to the current alternative of generating a succession of static figures, Elviz can greatly accelerate the speed of metagenome analysis. Elviz can be used to explore both user-submitted datasets and numerous metagenome studies publicly available at the Joint Genome Institute (JGI). Elviz is freely available at http://genome.jgi.doe.gov/viz and runs on most current web-browsers.

59 BASIC BIOLOGICAL SCIENCES↗

Diverse Power Iteration Embeddings and Its Applications

Abstract—Spectral Embedding is one of the most effective dimension reduction algorithms in data mining. However, its computation complexity has to be mitigated in order to apply it for real-world large scale data analysis. Many researches have been focusing on developing approximate spectral embeddings which are more efficient, but meanwhile far less effective. This paper proposes Diverse Power Iteration Embeddings (DPIE), which not only retains the similar efficiency of power iteration methods but also produces a series of diverse and more effective embedding vectors. We test this novel method by applying it to various data mining applications (e.g. clustering, anomaly detection and feature selection) and evaluating their performance improvements. The experimental results show our proposed DPIE is more effective than popular spectral approximation methods, and obtains the similar quality of classic spectral embedding derived from eigen-decompositions. Moreover it is extremely fast on big data applications. For example in terms of clustering result, DPIE achieves as good as 95% of classic spectral clustering on the complex datasets but 4000+ times faster in limited memory environment.

97 MATHEMATICS AND COMPUTING↗

Particle-image Velocimetry Sensitivity through Automatic Differentiation

A commonly encountered difficulty in modern experimental fluid dynamics experiments is the need for full-flow visualization and measurement; traditional techniques such as hot-wire probes and laser Doppler velocimetry cannot provide such information without difficult scanning procedures. Particle-image velocimetry (PIV) is a measurement technique which can overcome this spatial limitation to provide real-time three-dimensional fluid velocity vectors for an entire plane within the flow, as opposed to a single point that is provided by other measurement techniques. To accomplish this, a PIV system seeds the fluid flow with tracer particles; these must have nearly the same density as that of the fluid and a high drag coefficient to ensure that they follow the fluid flow without deviation. A laser is sent through optics to expand its beam into a sheet which illuminates the plane of interest in the fluid. The particles reflect more light than the fluid, and their image is recorded using a high speed camera. Due to limitations in bandwidth, video cannot be taken fast enough to be useful, and instead pairs of images are captured with a known separation in time. The illuminated particles will move between the two images taken by the camera, and their relative motion can be used to compute the fluid velocity at that point. When a single camera is used, only two-dimensional velocity vectors can be computed, but with the addition of another camera this can be improved to full three-dimensional vectors. The flow's time evolution can be measured by taking series of image pairs and processing each pair to get the velocity field at the time between each image pair. Only the two-dimensional version will be considered in this work. To compute the velocity vectors of the flow, the images are broken up into interrogation regions, usually in a uniform grid. In the most basic PIV algorithm, corresponding regions in the image pairs are cross-correlated to compute the most likely displacement from one image to the next. This is used since the cross correlation will achieve a maximum value when the two interrogation regions line up the best. The location of the peak in the correlation map and scaling information for the optical setup is used to compute the particle displacement from one image to the next. This process is similar to holding two semi-transparent images and moving one until they match as well as possible. Sub-pixel displacements between images can be obtained by fitting a Gaussian function to the correlation peak. Knowing the displacement vector for each set of interrogation regions in the image pair, it is a simple matter to divide by the time gap between the two images to compute the fluid velocity at the point in time and space. Since there are many interrogation regions in each image pair, the velocity field for a sheet is sampled according to the arrangement of the interrogation regions. The sensitivity of the final computed vector to the input images is difficult to compute, and has led most considerations of uncertainty in the PIV field to apply Monte Carlo methods and correlations to quantify the systematic and random errors which result from application of various PIV algorithms. In this work, automatic differentiation (AD) has been used to trace the dependence of velocity vectors computed using the correlation-peak PIV algorithm back to the input values given to an artificial image generator. These initial results form the foundation for continued work in the application of AD to algorithms in PIV. They demonstrate that AD methods can be successfully applied to PIV algorithms without undue complexity. The derivatives of each individual vector with regard to the coefficients of the velocity field used to create the artificial images can be computed and the statistics of them considered collectively, or correlated between each other to quantify the effectiveness of a PIV algorithm. With the initial implementation complete, adding extra algorithms is relatively simple and considerable data can be generated for analysis. It is hoped that application of these methods can lead to improved PIV algorithms which demonstrate better sensitivity to small variations in particle displacement. While these methods can be used as an analysis tool for refinement of new algorithms, computation of actual resultant vector sensitivities to input images' individual pixels is the next logical step of this work. Such information will be analyzed with experimental data to produce a better understanding of how output vectors' uncertainty relates to the actual image pairs, and lead to automatic bad vector removal. (authors)

42 ENGINEERING↗

WE-AB-303-07: Computational Monitoring Framework of Four-Dimensional Dose Distributions During Treatment Time Based On a 2D/3D Registration with Adaptive Transformation Parameters in Lung Stereotactic Body Radiotherapy

Purpose: The aim of this study was to develop a computational framework for monitoring four-dimensional (4D) dose distributions during treatment time based on a 2D/3D registration with adaptive transformation parameters (ATPs) in lung stereotactic body radiotherapy (SBRT). Methods: The 4D dose distributions during the SBRT were calculated by applying a pencil beam convolution (PBC) algorithm to simulated 4D-computed tomography (CT) images during treatment time (hereinafter referred to as “treatment” 4D-CT images). The “treatment” 4D-CT images were derived by deforming 3D planning CT images by using transformation parameters so that 2D planning portal dose images (PDIs) can resemble 2D dynamic clinical PDIs in each frame, which were derived from electronic portal imaging device (EPID) images. The transformation parameters were optimized by the Levenberg- Marquardt (LM) algorithm. The optimized transformation parameters in a certain frame were adaptively employed as initial transformation parameters for optimization of the parameters in the consecutive frame. Gamma pass rates (3mm/3%) between dynamic clinical PDIs and dynamic “treatment” PDIs derived from the “treatment” 4D-CT images were measured for comparing the proposed frameworks without and with the ATPs. These proposed frameworks were applied to the EPID dynamic images (40 frames) of two patients with lung cancer, who underwent the SBRT. Results: Gamma pass rates without and with the ATPs were 83.01±4.42% and 89.31±3.18% on average, respectively (p<0.05). Moreover, percentage errors between prescribed doses and estimated doses at an isocenter by the proposed frameworks without and with the ATPs were 10.67±5.66% and 6.34±0.47% on average, respectively (p<0.05). Conclusion: The proposed framework with ATPs could be useful to ensure the quality of the SBRT by monitoring 4D dose distributions during treatment time.

60 APPLIED LIFE SCIENCES↗

Multiscale Simulation of Moist Global Atmospheric Flows

The overarching goal of this award was to include phase changes of the water substance and accompanying latent heating and precipitation processes into the all-scale nonhydrostatic atmospheric dynamics EUlerian/LAGrangian (EULAG) model. The model includes fluid flow solver that is based on either an unabbreviated set of the governing equations (i.e., compressible dynamics) or a simplified set of equations without sound waves (i.e., sound-proof, either anelastic or pseudo-incompressible). The latter set has been used in small-scale dynamics for decades, but its application to the all-scale dynamics (from small-scale to planetary) has never been studied in practical implementations. The highlight of the project is the development of the moist implicit compressible model that can be run by applying time steps, as long as the anelastic model is limited only by the computational stability of the fluid flow and not by the speed of sound waves that limit the stability of explicit compressible models. Applying various versions of the EULAG model within the same numerical framework allows for an unprecedented comparison of solutions obtained with various sets of the governing equations and straightforward evaluation of the impact of various physical parameterizations on the model solutions. The main outcomes of this study are reported in three papers, two published and one currently under review. These papers include comparisons between model solutions for idealized moist problems across the range of scales from small to planetary. These tests include: moist thermals rising in the stable-stratified environment (following Grabowski and Clark, J. Atmos. Sci. 1991) and in the moist-neutral environment (after Bryan and Fritsch, Mon. Wea. Rev. 2002), moist flows over a mesoscale topography (as in Grabowski and Smolarkiewicz, Mon. Wea. Rev. 2002), deep convection in a sheared environment (following Weisman and Klemp, Mon. Wea. Rev. 1982), moist extension of the baroclinic wave on the sphere of Jablonowski and Williamson (Q. J. R. Met. Soc. 2006), and moist extension of the Held-Suarez idealized climate benchmark (Held and Suarez, Bull. Amer. Met. Soc., 1994).

54 ENVIRONMENTAL SCIENCES↗

Parameterized Neural Ordinary Differential Equations: Applications to Computational Physics Problems

This work proposes an extension of neural ordinary differential equations (NODEs) by introducing an additional set of ODE input parameters to NODEs. This extension allows NODEs to learn multiple dynamics specified by the input parameter instances. Our extension is inspired by the concept of parameterized ordinary differential equations, which are widely investigated in computational science and engineering contexts, where characteristics of the governing equations vary over the input parameters. We apply the proposed parameterized NODEs (PNODEs) for learning latent dynamics of complex dynamical processes that arise in computational physics, which is an essential component for enabling rapid numerical simulations for time-critical physics applications. For this, we propose an encoder-decoder-type framework, which models latent dynamics as PNODEs. We demonstrate the effectiveness of PNODEs with important benchmark problems from computational physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric electrostatic particle-in-cell algorithm on unstructured meshes

We present a geometric particle-in-cell (PIC) algorithm on unstructured meshes for studying electrostatic perturbations with frequency lower than electron gyrofrequency in magnetized plasmas. In this method, ions are treated as fully kinetic particles and electrons are described by the adiabatic response. The PIC method is derived from a discrete variational principle on unstructured meshes. To preserve the geometric structure of the system, the discrete variational principle requires that the electric field is interpolated using Whitney 1-forms, the charge is deposited using Whitney 0-forms and the electric field is computed by discrete exterior calculus. The algorithm has been applied to study the ion Bernstein wave (IBW) in two-dimensional magnetized plasmas. The simulated dispersion relations of the IBW in a rectangular region agree well with theoretical results. In a two-dimensional circular region with fixed boundary condition, the spectrum and eigenmode structures of the IBW are obtained from simulations. We compare the energy conservation property of the geometric PIC algorithm derived from the discrete variational principle with that of previous PIC methods on unstructured meshes. The comparison shows that the new PIC algorithm significantly improves the energy conservation property.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Direct observation of C 3 S particle dissolution using fast nano X-ray computed tomography

Tricalcium silicate (C 3 S) occupies 50 % to 70 % of ordinary portland cement (OPC) by mass and it is an important component affecting the hydration of OPC [1], [2], [3], [4], [5], [6], [7]. Generally, the hydration of C 3 S is described by two processes: the dissolution of C 3 S particles and the precipitation of hydration products. While it is understood that the dissolution rates of C 3 S vary with time, more precise measurements are needed to understand this process. Many mechanisms have been proposed to explain the time-evolving dissolution rates of C 3 S [2]. The metastable barrier hypothesis suggests that a thin metastable layer of hydrates forms around the C 3 S particle surface and prohibits the access of grains to the aqueous solution [8], [9], [10], [11], [12]. The slow dissolution step hypothesis suggests that the increased ion concentration from the initial reaction delays the C 3 S dissolution [2], [13], [14], [15], [16], [17]. More recent publications suggest that C 3 S may react differently depending on the existence of crystallographic defects [18], [19], [20]. Etch pits are thought to open on the particle surface during the initial reaction and this contributes to the C 3 S dissolution [21], [22]. As hydrates precipitate and cover these highly reactive surfaces, hydration slows down and the induction period starts [18], [23], [24], [25], [26]. Many experiments have been conducted to test the aforementioned mechanisms. Some hydration studies utilize bulk measurements, such as isothermal calorimetry [27], [28], [29], pore solution analysis [30], quasi-elastic neutron scattering [31], and nuclear magnetic resonance spectroscopy [32], [33]. One limitation of these measurements is that they do not provide direct and detailed information on the individual C 3 S particles. Some other studies utilize imaging techniques, such as scanning electron microscopy (SEM) [34], [35], [36] and transmission electron microscopy (TEM) [37]. However, SEM/TEM cannot track the evolution of individual particles throughout hydration [34], [35], [38], [39], [40] and they do not give insights into the microstructure of materials before hydration [34], [35], [39]. This makes it challenging to draw strong conclusions from only SEM or TEM observations. Synchrotron X-ray tomography techniques have been used more broadly in recent years to study cement hydration. They are not only non-destructive but also able to image a sample in full 3D with resolutions that can reach from micron to nanoscale. Nano computed tomography (nCT) is one technique that has been applied to study cement hydration at the nanoscale [26], [41]. A typical nCT can reach a pixel size from 15 to 65 nm, providing enough detail for observing features <1 μm. However, nCT often takes >0.5 h to finish one scan. This makes the application of this technique on continuous scans for in-situ observations challenging. Fast X-ray computerized tomography (fCT) is another technique that has shown success in studying the time-evolving cement microstructures [20], [42], [43], [44], [45], [46], [47], [48], [49]. Due to the high flux of the X-ray beam from the synchrotron ring, fCT allows a scan to be captured within 1 min at a pixel size of 1 μm. This allows a paste sample to be continuously scanned during the hydration process. However, the micron-sized resolutions limit does not provide detailed insights for particles <5 μm [20], [49]. Fortunately, the combination of nCT and fCT has allowed the development of fast nano X-ray computed tomography (fnCT). fnCT can capture a 3D data set in <2 min at a pixel size of 50 nm. This makes this procedure an exciting method to evaluate hydrating pastes. fnCT collects multiple X-ray radiographs at various rotation angles and generates a 3D model of the scanned sample, which is also referred to as a 3D tomography [50], [51]. In one tomography, the X-ray absorptions of different components (e.g., C 3 S and hydrates) differ as functions of density and chemistry [52], [53]. These X-ray absorption contrasts can be used to extract detailed information about the 3D microstructure [26], [54], [55]. In this paper, fnCT is used to collect time-lapse tomographs of hydrating C 3 S paste from 18 min after mixing to 7 h of hydration. The bulk measurements of anhydrous C 3 S, as well as the microstructural changes of individual C 3 S particles, are directly observed, quantified, and discussed. The dissolution behavior of C 3 S particles at various size scales is systematically analyzed and compared. This work aims to find the relationship between the size of C 3 S particle sizes and their dissolution rates. This provides significant insights into the early-age hydration of C 3 S on length and time scales not previously possible. Because of the magnitude of the data and the substantial amount of observations, this work will solely focus on the change in the anhydrous particles. Changes in the hydration products will be reported in future work.

42 ENGINEERING↗

Residual foreground contamination in the WMAP data and bias in non-Gaussianity estimation

We analyze whether there is any residual foreground contamination in the cleaned WMAP 7 years data for the differential assemblies, Q, V and W. We calculate the correlation between the foreground map, from which long wavelength correlations have been subtracted, and the foreground reduced map for each differential assembly after applying the Galaxy and point sources masks. We find positive correlations for all the differential assemblies, with high statistical significance. For Q and V, we find that a large fraction of the contamination comes from pixels where the foreground maps have positive values larger than three times the rms values. These findings imply the presence of residual contamination from Galactic emissions and unresolved point sources. We redo the analysis after masking the extended point sources cataloque of Scodeller et al. [7] and find a drop in the correlation and corresponding significance values. To quantify the effect of the residual contamination on the search for primordial non-Gaussianity in the CMB we add estimated contaminant fraction to simulated Gaussian CMB maps and calculate the characteristic non-Gaussian deviation shapes of Minkowski Functionals that arise due to the contamination. We find remarkable agreement of these deviation shapes with those measured from WMAP data, which imply that a major fraction of the observed non-Gaussian deviation comes from residual foreground contamination. We also compute non-Gaussian deviations of Minkowski Functionals after applying the point sources mask of Scodeller et al. and find a decrease in the overall amplitudes of the deviations which is consistent with a decrease in the level of contamination.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamic void distribution in myoglobin and five mutants

Globular proteins contain cavities/voids that play specific roles in controlling protein function. Elongated cavities provide migration channels for the transport of ions and small molecules to the active center of a protein or enzyme. Using Monte Carlo and Molecular Dynamics on fully atomistic protein/water models, a new computational methodology is introduced that takes into account the protein’s dynamic structure and maps all the cavities in and on the surface. To demonstrate its utility, the methodology is applied to study cavity structure in myoglobin and five of its mutants. Computed cavity and channel size distributions reveal significant differences relative to the wild type myoglobin. Computer visualization of the channels leading to the heme center indicates restricted ligand access for the mutants consistent with the existing interpretations. The new methodology provides a quantitative measure of cavity structure and distributions and can become a valuable tool for the structural characterization of proteins.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A fast algorithm for sparse matrix computations related to inversion

We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G{sup r} and G{sup <} for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors stay at a reasonable level.

97 MATHEMATICS AND COMPUTING↗

Accelerated statistical failure analysis of multifidelity TRISO fuel models

Statistical nuclear fuel failure analysis is critical for the design and development of advanced reactor technologies. Although Monte Carlo Sampling (MCS) is a standard method of statistical failure analysis for fuels, the low failure probabilities of some advanced fuel forms and the correspondingly large number of required model evaluations limit its application to low-fidelity (e.g., 1-D) fuel models. In this paper, we present four other statistical methods for fuel failure analysis in Bison, considering tri-structural isotropic (TRISO)-coated particle fuel as a case study. The statistical methods considered are Latin hypercube sampling (LHS), adaptive importance sampling (AIS), subset simulation (SS), and the Weibull theory. Using these methods, we analyzed both 1-D and 2-D representations of TRISO models to compute failure probabilities and the distributions of fuel properties that result in failures. The results of these methods compare well across all TRISO models considered. Overall, SS and the Weibull theory were deemed the most efficient, and can be applied to both 1-D and 2-D TRISO models to compute failure probabilities. Moreover, since SS also characterizes the distribution of parameters that cause TRISO failures, and can consider failure modes not described by the Weibull criterion, it may be preferred over the other methods. Finally, a discussion on the efficacy of different statistical methods of assessing nuclear fuel safety is provided.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Methods of photoelectrode characterization with high spatial and temporal resolution

Here, materials and photoelectrode architectures that are highly efficient, extremely stable, and made from low cost materials are required for commercially viable photoelectrochemical (PEC) water-splitting technology. A key challenge is the heterogeneous nature of real-world materials, which often possess spatial variation in their crystal structure, morphology, and/or composition at the nano-, micro-, or macro-scale. Different structures and compositions can have vastly different properties and can therefore strongly influence the overall performance of the photoelectrode through complex structure–property relationships. A complete understanding of photoelectrode materials would also involve elucidation of processes such as carrier collection and electrochemical charge transfer that occur at very fast time scales. We present herein an overview of a broad suite of experimental and computational tools that can be used to define the structure–property relationships of photoelectrode materials at small dimensions and on fast time scales. A major focus is on in situ scanning-probe measurement (SPM) techniques that possess the ability to measure differences in optical, electronic, catalytic, and physical properties with nano- or micro-scale spatial resolution. In situ ultrafast spectroscopic techniques, used to probe carrier dynamics involved with processes such as carrier generation, recombination, and interfacial charge transport, are also discussed. Complementing all of these experimental techniques are computational atomistic modeling tools, which can be invaluable for interpreting experimental results, aiding in materials discovery, and interrogating PEC processes at length and time scales not currently accessible by experiment. In addition to reviewing the basic capabilities of these experimental and computational techniques, we highlight key opportunities and limitations of applying these tools for the development of PEC materials.

08 HYDROGEN↗

A Simple Computational Proxy for Screening Magnetocaloric Compounds

Alternating cycles of isothermal magnetization and adiabatic demagnetization applied to a magnetocaloric material can drive refrigeration in very much the same manner as cycles of gas compression and expansion. The material property of interest in finding candidate magnetocaloric materials is ΔS M , their gravimetric entropy change upon application of a magnetic field under isothermal conditions. There is, however, no general method for screening materials for such an entropy change without actually performing the relevant, time- and effort-intensive magnetic measurements. Here we propose a simple computational proxy based on performing nonmagnetic and magnetic density functional theory calculations on magnetic materials. This proxy, which we term the magnetic deformation Σ M , is a measure of how much the unit cell deforms comparing with the relaxed structures with and without the inclusion of spin polarization. Σ M appears to correlate very well with experimentally measured magnetic entropy change values. Here, the proxy has been tested against 33 ferromagnetic materials with known ΔS M , including nine materials newly measured for this study. It has then been used to screen 134 ferromagnetic materials for which the magnetic entropy has not yet been reported, identifying 30 compounds as being promising for further study. As a demonstration of the effectiveness of our approach, we have prepared one of these compounds and measured its isothermal entropy change. MnCoP, with a T C of 575 K, shows a maximal ΔS M of –6.0 J kg –1 K –1 for an H = 5 T applied field.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SDE_quark

This program provides a fixed-grid quadrature algorithm to compute integrals in the self-energy of the quark propagator within the Maris-Tandy model. The quark propagator both on t he spacelike real axis and at complex-valued momenta is determined from its Schwinger-Dyson equation (SDE). We first apply an iterative solver to find the quark propagator on the spacelike real axis. The propagator at complex-valued momenta is then computed from its self-energy based on this solution, where demanding integrals are encountered. In order to compute of these integrals, we apply customized variable transformations for the radial integral after subtracting the asymptotics. We subsequently apply an optional compound of quadrature rules for the angular integral.

Jia, Shaoyang↗

AUTOMATIC LIMIT SURFACE SEARCH FOR PWR TRANSIENTS BY RELAP5-3D/RAVEN CODES

Deterministic safety analysis of nuclear power plants can be improved by applying modern algorithms and codes exploiting machine learning and parallel computing. In this paper we show the application of some of these advanced methodologies for the determination of limit surfaces. A limit surface is an n-dimensional surface describing the plant status, e.g. identifying, as function of selected plant parameters, the boundaries between failed and safe conditions for the core fuel. Using the RELAP5-3D system thermal-hydraulic code coupled to the RAVEN statistical-analysis code, we show how to apply machine-learning algorithms (near-neighbor, support-vector machine, etc.) for determining relevant limit surfaces for PWR station-blackout and loss of offsite power. As a first step, a set of training simulations is run to sample the nuclear power plant responses. Those calculations are used to train a Reduced-Order-Model (ROM), which RAVEN then uses for determining an approximated limit surface. Verification of the guessed limit surface is then automatically performed and calculation is terminated depending by the chosen convergence criteria. The combination of High Performance Computing (HPC) and ROMs allow a remarkable reduction of the time required for the surface determination. RAVEN performs also the automatic data collection of the output of the numerous runs, thus easing the workload of the safety analyst. Finally, using RAVEN “Ensamble Forward” sampling technique, we show how to inform the limit surface calculations with some of the code and input uncertainties.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗