Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and data structure”

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,459 records · Page 81

FORWARD MODELING CAVITY DENSITY: A MULTI-INSTRUMENT DIAGNOSTIC

The thermodynamic properties of coronal prominence cavities present a unique probe into the energy and mass budget of prominences. Using a three-dimensional morphological model, we forward model the polarization brightness and extreme-ultraviolet (EUV) emission of a cavity and its surrounding streamer. Using a genetic algorithm, we find the best-fit density model by comparing the models to Mauna Loa Solar Observatory MK4 and Hinode EUV Imaging Spectrometer data. The effect of temperature variations on the derived density is also measured. We have measured the density inside a cavity down to 1.05 R{sub sun} with height-dependent error bars. Our forward modeling technique compensates for optically thin projection effects. This method provides a complementary technique to traditional line ratio diagnostics that is useful for diffuse off-limb coronal structures.

79 ASTRONOMY AND ASTROPHYSICS↗

Automatic Detection and Classification of Radio Galaxy Images by Deep Learning

Abstract Surveys conducted by radio astronomy observatories, such as SKA, MeerKAT, Very Large Array, and ASKAP, have generated massive astronomical images containing radio galaxies (RGs). This generation of massive RG images has imposed strict requirements on the detection and classification of RGs and makes manual classification and detection increasingly difficult, even impossible. Rapid classification and detection of images of different types of RGs help astronomers make full use of the observed astronomical image data for further processing and analysis. The classification of FRI and FRII is relatively easy, and there are more studies and literature on them at present, but FR0 and FRI are similar, so it is difficult to distinguish them. It poses a greater challenge to image processing. At present, deep learning has made breakthrough progress in the field of image analysis and processing and has preliminary applications in astronomical data processing. Compared with classification algorithms that can only classify galaxies, object detection algorithms that can locate and classify RGs simultaneously are preferred. In target detection algorithms, YOLOv5 has outstanding advantages in the classification and positioning of small targets. Therefore, we propose a deep-learning method based on an improved YOLOv5 object detection model that makes full use of multisource data, combining FIRST radio with SDSS optical image data, and realizes the automatic detection of FR0, FRI, and FRII RGs. The innovation of our work is that on the basis of the original YOLOv5 object detection model, we introduce the SE Net attention mechanism, increase the number of preset anchors, adjust the network structure of the feature pyramid, and modify the network structure, thereby allowing our model to demonstrate galaxy classification and position detection effects. Our improved model produces satisfactory results, as evidenced by experiments. Overall, the mean average precision (mAP@0.5) of our improved model on the test set reaches 89.4%, which can determine the position (R.A. and decl.) and automatically detect and classify FR0s, FRIs, and FRIIs. Our work contributes to astronomy because it allows astronomers to locate FR0, FRI, and FRII galaxies in a relatively short time and can be further combined with other astronomically generated data to study the properties of these galaxies. The target detection model can also help astronomers find FR0s, FRIs, and FRIIs in future surveys and build a large-scale star RG catalog. Moreover, our work is also useful for the detection of other types of galaxies.

Astronomy & Astrophysics↗

Scalable tensor factorizations with missing data.

The problem of missing data is ubiquitous in domains such as biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision, and communication networks|all domains in which data collection is subject to occasional errors. Moreover, these data sets can be quite large and have more than two axes of variation, e.g., sender, receiver, time. Many applications in those domains aim to capture the underlying latent structure of the data; in other words, they need to factorize data sets with missing entries. If we cannot address the problem of missing data, many important data sets will be discarded or improperly analyzed. Therefore, we need a robust and scalable approach for factorizing multi-way arrays (i.e., tensors) in the presence of missing data. We focus on one of the most well-known tensor factorizations, CANDECOMP/PARAFAC (CP), and formulate the CP model as a weighted least squares problem that models only the known entries. We develop an algorithm called CP-WOPT (CP Weighted OPTimization) using a first-order optimization approach to solve the weighted least squares problem. Based on extensive numerical experiments, our algorithm is shown to successfully factor tensors with noise and up to 70% missing data. Moreover, our approach is significantly faster than the leading alternative and scales to larger problems. To show the real-world usefulness of CP-WOPT, we illustrate its applicability on a novel EEG (electroencephalogram) application where missing data is frequently encountered due to disconnections of electrodes.

99 GENERAL AND MISCELLANEOUS↗

A model of the effects of heavy ion radiation on human tissue

In heavy ion radiotherapy and space travel humans are exposed to energetic heavy ions (C, Si, Fe and others). This type of irradiation often produces more severe biological effects per unit dose than more common X-rays. A new Monte Carlo model generates a physical space with the complex geometry of human tissue or a cell culture based model of tissue, which is affected by the passage of ionizing radiation. For irradiation, the model relies on a physical code for the ion track structure; for tissues, cellular maps are derived from two- or three-dimensional confocal microscopy images using image segmentation algorithm, which defines cells as pixilated volumes. The model is used to study tissue-specific statistics of direct ion hits and the remote ion action on cells. As an application of the technique, we considered the spatial pattern of apoptotic cells after heavy ion irradiation. The pattern of apoptosis is modeled as a stochastic process, which is defined by the action cross section taken from available experimental data. To characterize the degree of apoptosis, an autocorrelation function that describes the spatial correlation of apoptotic cells is introduced. The values of the autocorrelation function demonstrate the effect of the directionality of the radiation track on the spatial arrangements of inactivated cells in tissue. This effect is intrinsic only to high linear-energy-transfer radiation.

59 BASIC BIOLOGICAL SCIENCES↗

Baryon–Antibaryon Photoproduction off the Proton

The GlueX Experiment at Jefferson Lab uses linearly polarized photon beam to study the photoproduction of light mesons and baryons off a proton target with unprecedented precision. We have observed p¯p photoproduction and, for the first time, ?¯? photoproduction from thresholds up to E = 11.6 GeV. We reproduce the observed kinematic distributions with a phenomenological model that includes t-channel Regge exchange and double Regge exchange. The model uses few parameters to match all the kinematic spectra via an optimization algorithm developed specifically for this purpose. We report the total cross sections of the two reactions, as well as differential cross sections with respect to various momentum transfers and invariant mass spectra of p¯p, ?¯?, p¯? systems which show enhancements right above production thresholds. Furthermore, the beam asymmetries of the p¯p system are extracted from the GlueX data to further probe the nature of the t-channel Regge exchanges. We also report preliminary measurements of the spin polarizations of the individual hyperons. No prominent resonance structure was found in these reaction channels, but the angular distributions and the correlation of longitudinal momenta indicate the existence of multiple production mechanisms. Besides a dominant forward peak in the polar angle of the baryon-antibaryon pair in t-channel production, we see wide-angle antibaryon distributions different from that of the baryon. In the hyperon channel, we see a clear separation between the photoproduction of the ?¯?, p¯? systems.

Li, Hao↗

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗

Extended dynamic mode decomposition for model reduction in fluid dynamics simulations

High computational cost and storage/memory requirements of fluid dynamics simulations constrain their usefulness as a predictive tool. Reduced-order models (ROMs) provide a viable solution to this challenge by extracting the key underlying dynamics of a complex system directly from data. We investigate the efficacy and robustness of an extended dynamic mode decomposition (xDMD) algorithm in constructing ROMs of three-dimensional cardiovascular computations. Focusing on the ROMs' accuracy in representation and interpolation, we relate these metrics to the truncation rank of singular value decomposition, which underpins xDMD and other approaches to ROM construction. Our key innovation is to relate the truncation rank to the singular values of the original flow problem. This result establishes a priori guidelines for the xDMD deployment and its likely success as a means of data compression and reconstruction of the system's dynamics from dominant spatiotemporal structures present in the data.

Mechanics↗

A STELLAR MODEL-FITTING PIPELINE FOR ASTEROSEISMIC DATA FROM THE KEPLER MISSION

Over the past two decades, helioseismology has revolutionized our understanding of the interior structure and dynamics of the Sun. Asteroseismology will soon place this knowledge into a broader context by providing structural data for hundreds of Sun-like stars. Solar-like oscillations have already been detected from the ground in several stars, and NASA's Kepler mission is poised to unleash a flood of stellar pulsation data. Deriving reliable asteroseismic information from these observations demands a significant improvement in our analysis methods. In this paper, we report the initial results of our efforts to develop an objective stellar model-fitting pipeline for asteroseismic data. The cornerstone of our automated approach is an optimization method using a parallel genetic algorithm. We describe the details of the pipeline and we present the initial application to Sun-as-a-star data, yielding an optimal model that accurately reproduces the known solar properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

VTK-m: Accelerating the Visualization Toolkit for Massively Threaded Architectures

Execution on massively threaded processors is one of the most critical challenges for high-performance computing (HPC) scientific visualization. Of the many fundamental changes we are seeing in HPC systems, one of the most profound is a reliance on new processor types optimized for execution bandwidth over latency hiding. Moreover, our current production scientific visualization software is not designed for these new types of architectures. In order to address this issue, the VTK-m framework serves as a container for algorithms, provides flexible data representation, and simplifies the design of visualization algorithms on new and future computer architecture.

97 MATHEMATICS AND COMPUTING↗

GOTTCHA, Version2

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

GOTTCHA, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

The exploration of nonlinear elasticity and its efficient parameterization for crystalline materials

Conventional approaches to analyzing the very large coherency strains that can occur during solid-state phase transformations are founded in linear elasticity and rely on infinitesimal strain metrics. Despite this, there are many technologically important examples where misfit strains of multi-phase mixtures are very large during their synthesis and/or application. Here in this paper, we present a framework for constructing strain-energy expressions and stress-strain relationships beyond the linear-elastic limit for crystalline solids. This approach utilizes group theoretical concepts to minimize both the number of free parameters in the strain-energy expression and amount of first-principles training data required to parameterize strain-energy models that are invariant to all crystal symmetries. Within this framework, the strain-energy and elastic stiffness can be described to high accuracy in terms of a set of conventional symmetry-adapted finite strain metrics that we define independent of crystal symmetry. As an illustration, we use first-principles electronic structure data to parameterize strain energy polynomials and employ them to explore the strain- energy surfaces of HCP Zr and Mg, as well as several important Zr-H and Mg-Nd phases that are known to precipitate coherently within the HCP matrices of Zr and Mg.

36 MATERIALS SCIENCE↗

Anisotropic modeling and joint-MAP stitching for improved ultrasound model-based iterative reconstruction of large and thick specimens

One-sided non-destructive evaluation (NDE) is widely used to inspect materials, such as concrete structures in nuclear power plants (NPP). A widely used method for one-sided NDE is the synthetic aperture focusing technique (SAFT). The SAFT algorithm produces reasonable results when inspecting simple structures. However, for complex structures, such as heavily reinforced thick concrete structures, SAFT results in artifacts and hence there is a need for a more sophisticated inversion technique. Model-based iterative reconstruction (MBIR) algorithms, which are typically equivalent to regularized inversion techniques, offer a powerful framework to incorporate complex models for the physics, detector miscalibrations and the materials being imaged to obtain high quality reconstructions. Previously, we have proposed an ultrasonic MBIR method that signifcantly improves reconstruction quality compared to SAFT. However, the method made some simplifying assumptions on the propagation model and did not disucss ways to handle data that is obtained by raster scanning a system over a surface to inspect large regions. In this paper, we propose a novel MBIR algorithm that incorporates an anisotropic forward model and allows for the joint processing of data obtained from a system that raster scans a large surface. We demonstrate that the new MBIR method can produce dramatic improvements in reconstruction quality compared to SAFT and suppresses articfacts compared to the perviously presented MBIR approach.

Almansouri, Hani↗

Clusterdv: a simple density-based clustering method that is robust, general and automatic

Abstract Motivation How to partition a dataset into a set of distinct clusters is a ubiquitous and challenging problem. The fact that data vary widely in features such as cluster shape, cluster number, density distribution, background noise, outliers and degree of overlap, makes it difficult to find a single algorithm that can be broadly applied. One recent method, clusterdp, based on search of density peaks, can be applied successfully to cluster many kinds of data, but it is not fully automatic, and fails on some simple data distributions. Results We propose an alternative approach, clusterdv, which estimates density dips between points, and allows robust determination of cluster number and distribution across a wide range of data, without any manual parameter adjustment. We show that this method is able to solve a range of synthetic and experimental datasets, where the underlying structure is known, and identifies consistent and meaningful clusters in new behavioral data. Availability and implementation The clusterdv is implemented in Matlab. Its source code, together with example datasets are available on: https://github.com/jcbmarques/clusterdv. Supplementary information Supplementary data are available at Bioinformatics online.

Marques, João C.↗

Model-based Reconstruction for Single Particle Cryo-Electron Microscopy

Single particle cryo-electron microscopy is a vital tool for 3D characterization of protein structures. A typical workflow involves acquiring projection images of a collection of randomly oriented particles, picking and classifying individual particle projections by orientation, and finally using the individual particle projections to reconstruct a 3D map of the electron density profile. The reconstruction is challenging because of the low signal-to-noise ratio of the data, the unknown orientation of the particles, and the sparsity of data especially when dealing with flexible proteins where there may not be sufficient data corresponding to each class to obtain an accurate reconstruction using standard algorithms. In this paper we present a model-based image reconstruction technique that uses a regularized cost function to reconstruct the 3D density map by assuming known orientations for the particles. Our method casts the reconstruction as minimizing a cost function involving a novel forward model term that accounts for the contrast transfer function of the microscope, the orientation of the particles and the center of rotation offsets. We combine the forward model term with a regularizer that enforces desirable properties in the volume to be reconstructed. Using simulated data, we demonstrate how our method can significantly improve upon the typically used approach.

Venkatakrishnan, Singanallur↗

Gravitation and Mesh Adaption

The Gravitation and Mesh Adaptation (GaMA) toolbox consists of a set of Matlab classes for modeling the environment around asteroids and comets. A variety of gravitational models and supporting algorithms from are consolidated alongside a custom meshing utility tailored for the application. This allows the user to work within a single streamlined environment to import and manipulate surface definitions, probe the dynamical environment, integrate trajectories, and post-process results. For other applications, modified surface meshes can be exported. Gravity Models: 1) Werner's analytic polyhedron model 2) Mascon model 3) Gottlieb's spherical harmonic model 4) Approximate polyhedron models 5) Curvilinear surface models 6) Custom composite models Meshing Features: 1) Array-based half-edge data structure 2) Supports curvilinear surface definitions up to degree 4 3) Ray-tracing 4) Coarsening 5) Feature-based refinement 6) Projection 7) Smoothing 8) Mesh quality validity tests 9) Mesh repair Additional Features: 1) Solar radiation pressure model 2) Distant 3rd body model 3) Collision detection 4) Trajectory integration and post-processing 5) Visualization of surface fields

Pearl, Jason↗

Rock Valley Direct Comparison Relocation Working Group Location Results and Recommendations

Work accomplished: Collected and compared historic data for the 1993 Rock Valley earthquake sequence; Compared preliminary and prior location work from different location algorithms, phase pick sets, station constellations, and velocity models; Selected a common set of stations that could be used across all location methods for consistency; Reviewed 8 different sets of phase picks and converged on a single, reviewed set of picks for all common stations; Evaluated four pre-existing regional velocity models and incorporated new and preliminary results for five new velocity models that provide information on the very shallow (< 2km) structure near station RTPP; Compared location results from different methods while using the common sets of picks, stations, and velocity models

58 GEOSCIENCES↗