Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Software algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 775 records · Page 43

A variant selection framework for genome graphs

Abstract Motivation Variation graph representations are projected to either replace or supplement conventional single genome references due to their ability to capture population genetic diversity and reduce reference bias. Vast catalogues of genetic variants for many species now exist, and it is natural to ask which among these are crucial to circumvent reference bias during read mapping. Results In this work, we propose a novel mathematical framework for variant selection, by casting it in terms of minimizing variation graph size subject to preserving paths of length α with at most δ differences. This framework leads to a rich set of problems based on the types of variants [e.g. single nucleotide polymorphisms (SNPs), indels or structural variants (SVs)], and whether the goal is to minimize the number of positions at which variants are listed or to minimize the total number of variants listed. We classify the computational complexity of these problems and provide efficient algorithms along with their software implementation when feasible. We empirically evaluate the magnitude of graph reduction achieved in human chromosome variation graphs using multiple α and δ parameter values corresponding to short and long-read resequencing characteristics. When our algorithm is run with parameter settings amenable to long-read mapping (α = 10 kbp, δ = 1000), 99.99% SNPs and 73% SVs can be safely excluded from human chromosome 1 variation graph. The graph size reduction can benefit downstream pan-genome analysis. Availability and implementation https://github.com/AT-CG/VF. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗

Electrical Impedance Tomography Technology: 2013 Center Innovation Fund Final Report

Electrical impedance tomography is a medical noninvasive imaging technology which has advantages over other medical imaging technologies for medically safe long term real time internal imaging monitoring applications in human patients. The technology is much more compact, portable, low power and potentially more low cost compared to other medical image technologies, making it very well suited for medical aerospace and spaceflight applications. EIT technology’s main drawback has been low image resolution, and consequently improving EIT resolution is the primary research goal, as well as increasing imaging speed for real time animation imaging. In a relatively short time the BERL group has brought together design plans, technical resources and has built and tested hardware with the purpose of improving EIT imaging technology. EIT prototype system development plans and system designs have been made to target needed EIT technical improvement in electronic and computer hardware as well as EIT software technology. New hardware design and fabrication resources and technologies have been brought together through resourceful use of existing equipment and software at BERL, and a significant advance has been made in custom electronic hardware prototyping capabilities in collaboration with EFAL, for mutual benefit for both NASA KSC laboratories. BERL has gained significant EIT software capability and tested EIT imaging algorithm code through collaboration with an internationally recognized EIT software development and research forum. A new custom workstation has been developed, built and tested using internal resources, equipment and expertise, that includes a new state-of-the-art massively parallel technology that is commercially available. Custom prototype hardware has been designed and tested, a high priority electronic design, key to improving electronic performance and image quality, has been researched and tested in four designs, with a summary of test results of the selected design illustrated here. The selected design performance exceeds the developed EIT design hardware specifications.

Michael R Lapointe↗

Multiresolution molecular mechanics: Implementation and efficiency

Atomistic/continuum coupling methods combine accurate atomistic methods and efficient continuum methods to simulate the behavior of highly ordered crystalline systems. Coupled methods utilize the advantages of both approaches to simulate systems at a lower computational cost, while retaining the accuracy associated with atomistic methods. Many concurrent atomistic/continuum coupling methods have been proposed in the past; however, their true computational efficiency has not been demonstrated. The present work presents an efficient implementation of a concurrent coupling method called the Multiresolution Molecular Mechanics (MMM) for serial, parallel, and adaptive analysis. First, we present the features of the software implemented along with the associated technologies. The scalability of the software implementation is demonstrated, and the competing effects of multiscale modeling and parallelization are discussed. Then, the algorithms contributing to the efficiency of the software are presented. These include algorithms for eliminating latent ghost atoms from calculations and measurement-based dynamic balancing of parallel workload. The efficiency improvements made by these algorithms are demonstrated by benchmark tests. The efficiency of the software is found to be on par with LAMMPS, a state-of-the-art Molecular Dynamics (MD) simulation code, when performing full atomistic simulations. Speed-up of the MMM method is shown to be directly proportional to the reduction of the number of the atoms visited in force computation. Finally, an adaptive MMM analysis on a nanoindentation problem, containing over a million atoms, is performed, yielding an improvement of 6.3–8.5 times in efficiency, over the full atomistic MD method. For the first time, the efficiency of a concurrent atomistic/continuum coupling method is comprehensively investigated and demonstrated.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Software engineering capability for Ada (GRASP/Ada Tool)

The GRASP/Ada project (Graphical Representations of Algorithms, Structures, and Processes for Ada) has successfully created and prototyped a new algorithmic level graphical representation for Ada software, the Control Structure Diagram (CSD). The primary impetus for creation of the CSD was to improve the comprehension efficiency of Ada software and, as a result, improve reliability and reduce costs. The emphasis has been on the automatic generation of the CSD from Ada PDL or source code to support reverse engineering and maintenance. The CSD has the potential to replace traditional prettyprinted Ada Source code. A new Motif compliant graphical user interface has been developed for the GRASP/Ada prototype.

Cross, James H., II↗

A Unifying Multibody Dynamics Algorithm Development Workbench

The development of new and efficient algorithms for multibody dynamics has been an important research area. These algorithms are used for modeling, simulation, and control of systems such as spacecraft, robotic systems, automotive applications, the human body, manufacturing operations, and micro-electromechanical systems (MEMS). At JPL's Dynamics and Real Time Simulation (DARTS) Laboratory we have developed software that serves as a computational workbench for these algorithms. This software utilizes the mathematical perspective of the spatial operator algebra, which allows the development of dynamics algorithms and new insights into multibody dynamics.

Ziegler, John L.↗

FEASTPACK v. 1.0

The software implements the generative graph algorithm described in the following reference: T. G. Kolda, A. Pinar, T. Plantenga and C. Seshadhri. A Scalable Generative Graph Model with Community Structure, arXiv:1302.6636, March 2013, http:l/arxiv.org/abs/1302.6636. The software also implements the clustering coefficient algorithms described in C. Seshadhri, A. Pinar and T. G. Kolda. Triadic Measures on Graphs: The Power of Wedge Sampling, in Proc. 2013 SIAM International Conference on Data Mining {SDM), May 2013.

None, SeshadhriComandur↗

FEASTPACK v. 1.0

The software implements the generative graph algorithm described in the following reference: T. G. Kolda, A. Pinar, T. Plantenga and C. Seshadhri. A Scalable Generative Graph Model with Community Structure, arXiv:1302.6636, March 2013, http:l/arxiv.org/abs/1302.6636. The software also implements the clustering coefficient algorithms described in C. Seshadhri, A. Pinar and T. G. Kolda. Triadic Measures on Graphs: The Power of Wedge Sampling, in Proc. 2013 SIAM International Conference on Data Mining {SDM), May 2013.

Source record↗

Outline of a fast hardware implementation of Winograd's DFT algorithm

The main characteristics of the discrete Fourier transform (DFT) algorithm considered by Winograd (1976) is a significant reduction in the number of multiplications. Its primary disadvantage is a higher structural complexity. It is, therefore, difficult to translate the reduced number of multiplications into faster execution of the DFT by means of a software implementation of the algorithm. For this reason, a hardware implementation is considered in the current study, taking into account a design based on the algorithm prescription discussed by Zohar (1979). The hardware implementation of a FORTRAN subroutine is proposed, giving attention to a pipelining scheme in which 5 consecutive data batches are being operated on simultaneously, each batch undergoing one of 5 processing phases.

Zohar, S.↗

Sensitive and Specific Peak Detection for SELDI-TOF Mass Spectrometry Using a Wavelet/Neural-Network Based Approach

SELDI-TOF mass spectrometer’s compact size and automated, high throughput design have been attractive to clinical researchers, and the platform has seen steady-use in biomarker studies. Despite new algorithms and preprocessing pipelines that have been developed to address reproducibility issues, visual inspection of the results of SELDI spectra preprocessing by the best algorithms still shows miscalled peaks and systematic sources of error. This suggests that there continues to be problems with SELDI preprocessing. In this work, we study the preprocessing of SELDI in detail and introduce improvements. While many algorithms, including the vendor supplied software, can identify peak clusters of specific mass (or m/z) in groups of spectra with high specificity and low false discover rate (FDR), the algorithms tend to underperform estimating the exact prevalence and intensity of peaks in those clusters. Thus group differences that at first appear very strong are shown, after careful and laborious hand inspection of the spectra, to be less than significant. Here we introduce a wavelet/neural network based algorithm which mimics what a team of expert, human users would call for peaks in each of several hundred spectra in a typical SELDI clinical study. The wavelet denoising part of the algorithm optimally smoothes the signal in each spectrum according to an improved suite of signal processing algorithms previously reported (the LibSELDI toolbox under development). The neural network part of the algorithm combines those results with the raw signal and a training dataset of expertly called peaks, to call peaks in a test set of spectra with approximately 95% accuracy. The new method was applied to data collected from a study of cervical mucus for the early detection of cervical cancer in HPV infected women. The method shows promise in addressing the ongoing SELDI reproducibility issues.

59 BASIC BIOLOGICAL SCIENCES↗

Implementation of a partitioned algorithm for simulation of large CSI problems

The implementation of a partitioned numerical algorithm for determining the dynamic response of coupled structure/controller/estimator finite-dimensional systems is reviewed. The partitioned approach leads to a set of coupled first and second-order linear differential equations which are numerically integrated with extrapolation and implicit step methods. The present software implementation, ACSIS, utilizes parallel processing techniques at various levels to optimize performance on a shared-memory concurrent/vector processing system. A general procedure for the design of controller and filter gains is also implemented, which utilizes the vibration characteristics of the structure to be solved. Also presented are: example problems; a user's guide to the software; the procedures and algorithm scripts; a stability analysis for the algorithm; and the source code for the parallel implementation.

Alvin, Kenneth F.↗

I-V characterization and parameter extraction tool [SWR-24-59]

GPT-crafted control software and graphical user interface for Keithley 2400 Source Measure Units and global optimization algorithm. It contains Numba-compatible self-adaptive differential evolution algorithm for optimization tasks. This software is comprised of two repositories: https://github.com/NREL/Keithley_GPT https://github.com/NREL/DE

Febba, Davi Marcelo↗

p4est : Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees

We present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR), partitioning, and 2:1 balancing on computational domains composed of multiple connected two-dimensional quadtrees or three-dimensional octrees, referred to as a forest of octrees. By distributing the union of octants from all octrees in parallel, we combine the high scalability proven previously for adaptive single-octree algorithms with the geometric flexibility that can be achieved by arbitrarily connected hexahedral macromeshes, in which each macroelement is the root of an adapted octree. A key concept of our approach is an encoding scheme of the interoctree connectivity that permits arbitrary relative orientations between octrees. Based on this encoding we develop interoctree transformations of octants. These form the basis for high-level parallel octree algorithms, which are designed to interact with an application code such as a numerical solver for partial differential equations. We have implemented and tested these algorithms in the p4est software library. We demonstrate the parallel scalability of p4est on its own and in combination with two geophysics codes. Using p4est we generate and adapt multioctree meshes with up to $5.13\times10^{11}$ octants on as many as 220,320 CPU cores and execute the 2:1 balance algorithm in less than 10 seconds per million octants per process.

Mathematics↗

High-Performance Scanning Acousto-Ultrasonic System

A high-performance scanning acousto-ultrasonic system, now undergoing development, is designed to afford enhanced capabilities for imaging microstructural features, including flaws, inside plate specimens of materials. The system is expected to be especially helpful in analyzing defects that contribute to failures in polymer- and ceramic-matrix composite materials, which are difficult to characterize by conventional scanning ultrasonic techniques and other conventional nondestructive testing techniques. Selected aspects of the acousto-ultrasonic method have been described in several NASA Tech Briefs articles in recent years. Summarizing briefly: The acousto-ultrasonic method involves the use of an apparatus like the one depicted in the figure (or an apparatus of similar functionality). Pulses are excited at one location on a surface of a plate specimen by use of a broadband transmitting ultrasonic transducer. The stress waves associated with these pulses propagate along the specimen to a receiving transducer at a different location on the same surface. Along the way, the stress waves interact with the microstructure and flaws present between the transducers. The received signal is analyzed to evaluate the microstructure and flaws. The specific variant of the acousto-ultrasonic method implemented in the present developmental system goes beyond the basic principle described above to include the following major additional features: Computer-controlled motorized translation stages are used to automatically position the transducers at specified locations. Scanning is performed in the sense that the measurement, data-acquisition, and data-analysis processes are repeated at different specified transducer locations in an array that spans the specimen surface (or a specified portion of the surface). A pneumatic actuator with a load cell is used to apply a controlled contact force. In analyzing the measurement data for each pair of transducer locations in the scan, the total (multimode) acousto-ultrasonic response of the specimen is utilized. The analysis is performed by custom software that extracts parameters of signals in the time and frequency domains. The computer hardware and software provide both real-time and postscan processing and display options. For example, oscilloscope displays of waveforms and power spectral densities are available in real time. Images can be computed while scanning continues. Signals can be digitally preprocessed and/or post-processed by filtering, windowing, time-segmenting, and running-waveform-averaging algorithms. In addition, the software affords options for off-line simulation of the waveform-data-acquisition and scanning processes. In tests, the system has been shown to be capable of characterizing microstructural changes and defects in SiC/SiC and C/SiC ceramic-matrix composites. Delaminations, variations in density, microstructural changes attributable to infiltration by silicon, and crack-space indications (defined in the next sentence) have been revealed in images formed from several time- and frequency-domain parameters of scanning acousto-ultrasonic signals. The crack-space indications were image features that were not revealed by other nondestructive testing methods and are so named because they turned out to mark locations where cracking eventually occurred.

Roth, Don↗

Using a focal-plane array to estimate antenna pointing errors

The use of extra collecting horns in the focal plane of an antenna as a means of determining the Direction of Arrival (DOA) of the signal impinging on it, provided it is within the antenna beam, is considered. Our analysis yields a relatively simple algorithm to extract the DOA from the horns' outputs. An algorithm which, in effect, measures the thermal noise of the horns' signals and determines its effect on the uncertainty of the extracted DOA parameters is developed. Both algorithms were implemented in software and tested in simulated data. Based on these tests, it is concluded that this is a viable approach to the DOA determination. Though the results obtained are of general applicability, the particular motivation for the present work is their application to the pointing of a mechanically deformed antenna. It is anticipated that the pointing algorithm developed for a deformed antenna could be obtained as a small perturbation of the algorithm developed for an undeformed antenna. In this context, it should be pointed out that, with a deformed antenna, the array of horns and its associated circuitry constitute the main part of the deformation-compensation system. In this case, the pointing system proposed may be viewed as an additional task carried out by the deformation-compensation hardware.

Zohar, S.↗

Algorithm for Wavefront Sensing Using an Extended Scene

A recently conceived algorithm for processing image data acquired by a Shack-Hartmann (SH) wavefront sensor is not subject to the restriction, previously applicable in SH wavefront sensing, that the image be formed from a distant star or other equivalent of a point light source. That is to say, the image could be of an extended scene. (One still has the option of using a point source.) The algorithm can be implemented in commercially available software on ordinary computers. The steps of the algorithm are the following: 1. Suppose that the image comprises M sub-images. Determine the x,y Cartesian coordinates of the centers of these sub-images and store them in a 2xM matrix. 2. Within each sub-image, choose an NxN-pixel cell centered at the coordinates determined in step 1. For the ith sub-image, let this cell be denoted as si(x,y). Let the cell of another subimage (preferably near the center of the whole extended-scene image) be designated a reference cell, denoted r(x,y). 3. Calculate the fast Fourier transforms of the sub-sub-images in the central NxN portions (where N < N and both are preferably powers of 2) of r(x,y) and si(x,y). 4. Multiply the two transforms to obtain a cross-correlation function Ci(u,v), in the Fourier domain. Then let the phase of Ci(u, v) constitute a phase function, phi(u,v). 5. Fit u and v slopes to phi (u,v) over a small u,v subdomain. 6. Compute the fast Fourier transform, Si(u,v) of the full NxN cell si(x,y). Multiply this transform by the u and phase slopes obtained in step 4. Then compute the inverse fast Fourier transform of the product. 7. Repeat steps 4 through 6 in an iteration loop, cumulating the u and slopes, until a maximum iteration number is reached or the change in image shift becomes smaller than a predetermined tolerance. 8. Repeat steps 4 through 7 for the cells of all other sub-images.

Sidick, Erkin↗

TensorID v1.0

This Python software package includes new and efficient algorithms for satellite and core interpolative decomposition of tensor data. In general, these algorithms target high-dimensional data reduction and compression. The software is purely numerical and can be applied by others to many important sources of tensor data generated by computation or experiment.

Zhang, Yifan [Lawrence Berkeley National Laborator↗

Bendable X-ray Optics at the ALS: Design, Tuning, Performance and Applications

We review the development at the Advanced Light Source (ALS) of bendable x-ray optics widely used for focusing of beams of soft and hard x-rays. Typically, the focusing is divided in the tangential and sagittal directions into two elliptically cylindrical reflecting elements, the so-called Kirkpatrick-Baez (KB) pair [1]. Because fabrication of elliptical surfaces is complicated, the cost of directly fabricated tangential elliptical cylinders is often prohibitive. This is in contrast to flat optics, that are simpler to manufacture and easier to measure by conventional interferometry. The figure of a flat substrate can be changed by placing torques (couples) at each end. Equal couples form a tangential cylinder, and unequal couples can approximate a tangential ellipse or parabola. We review the nature of the bending, requirements and approaches to the mechanical design, and describe a technique developed at the ALS Optical Metrology Laboratory (OML) for optimal tuning of bendable mirrors before installation in the beamline [2]. The tuning technique adapts a method previously used to adjust bendable mirrors on synchrotron radiation beamlines [3]. However, in our case, optimal tuning of a bendable mirror is based on surface slope trace data obtained with a slope measuring instrument--in our case, the long trace profiler (LTP). We show that due to the near linearity of the bending problem, the minimal set of data, necessary for tuning of two benders, consists of only three slope traces measured before and after a single adjustment of each bending couple. We provide an algorithm that was used in dedicated software for finding optimal settings for the mirror benders. The algorithm is based on the method of regression analysis with experimentally found characteristic functions of the benders. The resulting approximation to the functional dependence of the desired slope shape provides nearly final settings for the benders. Moreover, the characteristic functions of the benders found in the course of tuning, can be used for retuning of the optics to a new desired shape without removing it from the beamline and re-measuring with the LTP. The result of practical use of the developed technique to precisely tune a KB mirror used at the ALS for micro-focusing is also presented. We also describe a simple ray trace using the profiler data which shows expected performance in the beamline and compare the simulation with experimental data. In summary, we also discuss the next steps in the systematic improvement of optical performance for the application of KB pairs in synchrotron beamlines at the ALS.

47 OTHER INSTRUMENTATION↗

Advances in Structure Prediction of Lanthanides and Actinides with Genetic Algorithms

Computationally guided materials discovery has advanced significantly in the past two decades. Recent developments of widely available genetic algorithm-based structure prediction software in the past 10+ years has led to increased use of this methodology in the discovery and design of new materials. Owing to the computational challenges of treating f-block elements and computationally expensive methods for structure prediction, the discovery of new phases of lanthanide and actinide materials has been particularly challenging. With advancements in the development of genetic algorithms for structure prediction and the continuing improvement of high-performance computing resources, genetic algorithms provide a tractable method to find new stable phases of materials at high pressure or to search a large phase space for unknown compounds. Genetic algorithms have already been applied to the successful identification of novel lanthanide and actinide materials, as well as the prediction of unusual material properties in new phases that make promising synthetic targets.

Shields, Ashley↗