Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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,495 records · Page 83

Quasi-separatrix layers induced by ballooning instability in the near-Earth magnetotail

Magnetic reconnection processes in the near-Earth magnetotail can be highly three-dimensional (3-D) in geometry and dynamics, even though the magnetotail configuration itself is nearly two-dimensional due to the symmetry in the dusk–dawn direction. Such reconnection processes can be induced by the 3-D dynamics of nonlinear ballooning instability. In this work, we explore the global 3-D geometry of the reconnection process induced by ballooning instability in the near-Earth magnetotail by examining the distribution of quasi-separatrix layers associated with plasmoid formation in the entire 3-D domain of magnetotail configuration, using an algorithm previously developed in the context of solar physics. The 3-D distribution of quasi-separatrix layers (QSLs) as well as their evolution directly follow the plasmoid formation during the nonlinear development of ballooning instability in both time and space. Such a close correlation demonstrates a strong coupling between the ballooning and the corresponding reconnection processes. It further confirms the intrinsic 3-D nature of the ballooning-induced plasmoid formation and reconnection processes, in both geometry and dynamics. In addition, the reconstruction of the 3-D QSL geometry may provide an alternative means of identifying the location and timing of 3-D reconnection sites in the magnetotail from both numerical simulations and satellite observations.

79 ASTRONOMY AND ASTROPHYSICS↗

Effect of Te Inclusions on Internal Electric Field of CdMnTe Gamma-Ray Detectors

We studied two separate as-grown CdMnTe crystals by Infrared (IR) microscopy and Pockels effect imaging, and then developed an algorithm to analyze and visualize the electric field within the crystals’ bulk. In one of the two crystals the size and distribution of inclusions within the bulk promised to be more favorable in terms of efficiency as a detector crystal. However, the Te inclusions were arranged in characteristic ‘planes’. Pockels imaging revealed an accumulation of charges in the region of these planes. We demonstrated that the planes induced stress within the bulk of the crystal that accumulated charges, thereby causing non-uniformity of the internal electric field and degrading the detector’s performance.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Extraction and applications of skeletons in finite element mesh generation.

This paper focuses on the extraction of skeletons of CAD models and its applications in finite element (FE) mesh generation. The term 'skeleton of a CAD model' can be visualized as analogous to the 'skeleton of a human body'. The skeletal representations covered in this paper include medial axis transform (MAT), Voronoi diagram (VD), chordal axis transform (CAT), mid surface, digital skeletons, and disconnected skeletons. In the literature, the properties of a skeleton have been utilized in developing various algorithms for extracting skeletons. Three main approaches include: (1) the bisection method where the skeleton exists at equidistant from at least two points on boundary, (2) the grassfire propagation method in which the skeleton exists where the opposing fronts meet, and (3) the duality method where the skeleton is a dual of the object. In the last decade, the author has applied different skeletal representations in all-quad meshing, hex meshing, mid-surface meshing, mesh size function generation, defeaturing, and decomposition. A brief discussion on the related work from other researchers in the area of tri meshing, tet meshing, and anisotropic meshing is also included. This paper concludes by summarizing the strengths and weaknesses of the skeleton-based approaches in solving various geometry-centered problems in FE mesh generation. The skeletons have proved to be a great shape abstraction tool in analyzing the geometric complexity of CAD models as they are symmetric, simpler (reduced dimension), and provide local thickness information. However, skeletons generally require some cleanup, and stability and sensitivity of the skeletons should be controlled during extraction. Also, selecting a suitable application-specific skeleton and a computationally efficient method of extraction is critical.

99 GENERAL AND MISCELLANEOUS↗

Robust broadcast-communication control of electric vehicle charging

The anticipated increase in the number of plug-in electric vehicles (EV) will put additional strain on electrical distribution circuits. Many control schemes have been proposed to control EV charging. Here, we develop control algorithms based on randomized EV charging start times and simple one-way broadcast communication allowing for a time delay between communication events. Using arguments from queuing theory and statistical analysis, we seek to maximize the utilization of excess distribution circuit capacity while keeping the probability of a circuit overload negligible.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

[Skeleton extractions and applications].

This paper focuses on the extraction of skeletons of CAD models and its applications in finite element (FE) mesh generation. The term 'skeleton of a CAD model' can be visualized as analogous to the 'skeleton of a human body'. The skeletal representations covered in this paper include medial axis transform (MAT), Voronoi diagram (VD), chordal axis transform (CAT), mid surface, digital skeletons, and disconnected skeletons. In the literature, the properties of a skeleton have been utilized in developing various algorithms for extracting skeletons. Three main approaches include: (1) the bisection method where the skeleton exists at equidistant from at least two points on boundary, (2) the grassfire propagation method in which the skeleton exists where the opposing fronts meet, and (3) the duality method where the skeleton is a dual of the object. In the last decade, the author has applied different skeletal representations in all-quad meshing, hex meshing, mid-surface meshing, mesh size function generation, defeaturing, and decomposition. A brief discussion on the related work from other researchers in the area of tri meshing, tet meshing, and anisotropic meshing is also included. This paper concludes by summarizing the strengths and weaknesses of the skeleton-based approaches in solving various geometry-centered problems in FE mesh generation. The skeletons have proved to be a great shape abstraction tool in analyzing the geometric complexity of CAD models as they are symmetric, simpler (reduced dimension), and provide local thickness information. However, skeletons generally require some cleanup, and stability and sensitivity of the skeletons should be controlled during extraction. Also, selecting a suitable application-specific skeleton and a computationally efficient method of extraction is critical.

99 GENERAL AND MISCELLANEOUS↗

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↗

Vulnerability analysis for complex networks using aggressive abstraction.

Large, complex networks are ubiquitous in nature and society, and there is great interest in developing rigorous, scalable methods for identifying and characterizing their vulnerabilities. This paper presents an approach for analyzing the dynamics of complex networks in which the network of interest is first abstracted to a much simpler, but mathematically equivalent, representation, the required analysis is performed on the abstraction, and analytic conclusions are then mapped back to the original network and interpreted there. We begin by identifying a broad and important class of complex networks which admit vulnerability-preserving, finite state abstractions, and develop efficient algorithms for computing these abstractions. We then propose a vulnerability analysis methodology which combines these finite state abstractions with formal analytics from theoretical computer science to yield a comprehensive vulnerability analysis process for networks of realworld scale and complexity. The potential of the proposed approach is illustrated with a case study involving a realistic electric power grid model and also with brief discussions of biological and social network examples.

99 GENERAL AND MISCELLANEOUS↗

Scalable tensor factorizations with incomplete data.

The problem of incomplete data - i.e., data with missing or unknown values - in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision, communication networks, etc. We consider the problem of how to factorize data sets with missing values with the goal of capturing the underlying latent structure of the data and possibly reconstructing missing values (i.e., tensor completion). We focus on one of the most well-known tensor factorizations that captures multi-linear structure, CANDECOMP/PARAFAC (CP). In the presence of missing data, CP can be formulated as a weighted least squares problem that models only the known entries. We develop an algorithm called CP-WOPT (CP Weighted OPTimization) that uses a first-order optimization approach to solve the weighted least squares problem. Based on extensive numerical experiments, our algorithm is shown to successfully factorize tensors with noise and up to 99% missing data. A unique aspect of our approach is that it scales to sparse large-scale data, e.g., 1000 x 1000 x 1000 with five million known entries (0.5% dense). We further demonstrate the usefulness of CP-WOPT on two real-world applications: a novel EEG (electroencephalogram) application where missing data is frequently encountered due to disconnections of electrodes and the problem of modeling computer network traffic where data may be absent due to the expense of the data collection process.

99 GENERAL AND MISCELLANEOUS↗

StralSV: assessment of sequence variability within similar 3D structures and application to polio RNA-dependent RNA polymerase

Most of the currently used methods for protein function prediction rely on sequence-based comparisons between a query protein and those for which a functional annotation is provided. A serious limitation of sequence similarity-based approaches for identifying residue conservation among proteins is the low confidence in assigning residue-residue correspondences among proteins when the level of sequence identity between the compared proteins is poor. Multiple sequence alignment methods are more satisfactory - still, they cannot provide reliable results at low levels of sequence identity. Our goal in the current work was to develop an algorithm that could overcome these difficulties and facilitate the identification of structurally (and possibly functionally) relevant residue-residue correspondences between compared protein structures. Here we present StralSV, a new algorithm for detecting closely related structure fragments and quantifying residue frequency from tight local structure alignments. We apply StralSV in a study of the RNA-dependent RNA polymerase of poliovirus and demonstrate that the algorithm can be used to determine regions of the protein that are relatively unique or that shared structural similarity with structures that are distantly related. By quantifying residue frequencies among many residue-residue pairs extracted from local alignments, one can infer potential structural or functional importance of specific residues that are determined to be highly conserved or that deviate from a consensus. We further demonstrate that considerable detailed structural and phylogenetic information can be derived from StralSV analyses. StralSV is a new structure-based algorithm for identifying and aligning structure fragments that have similarity to a reference protein. StralSV analysis can be used to quantify residue-residue correspondences and identify residues that may be of particular structural or functional importance, as well as unusual or unexpected residues at a given sequence position.

59 BASIC BIOLOGICAL SCIENCES↗

Large Scale Shape Optimization for Accelerator Cavities

We present a shape optimization method for designing accelerator cavities with large scale computations. The objective is to find the best accelerator cavity shape with the desired spectral response, such as with the specified frequencies of resonant modes, field profiles, and external Q values. The forward problem is the large scale Maxwell equation in the frequency domain. The design parameters are the CAD parameters defining the cavity shape. We develop scalable algorithms with a discrete adjoint approach and use the quasi-Newton method to solve the nonlinear optimization problem. Two realistic accelerator cavity design examples are presented.

43 PARTICLE ACCELERATORS↗

Downscaling Solar Power Output to 4-Seconds for Use in Integration Studies (Presentation)

High penetration renewable integration studies require solar power data with high spatial and temporal accuracy to quantify the impact of high frequency solar power ramps on the operation of the system. Our previous work concentrated on downscaling solar power from one hour to one minute by simulation. This method used clearness classifications to categorize temporal and spatial variability, and iterative methods to simulate intra-hour clearness variability. We determined that solar power ramp correlations between sites decrease with distance and the duration of the ramp, starting at around 0.6 for 30-minute ramps between sites that are less than 20 km apart. The sub-hour irradiance algorithm we developed has a noise floor that causes the correlations to approach ~0.005. Below one minute, the majority of the correlations of solar power ramps between sites less than 20 km apart are zero, and thus a new method to simulate intra-minute variability is needed. These intra-minute solar power ramps can be simulated using several methods, three of which we evaluate: a cubic spline fit to the one-minute solar power data; projection of the power spectral density toward the higher frequency domain; and average high frequency power spectral density from measured data. Each of these methods either under- or over-estimates the variability of intra-minute solar power ramps. We show that an optimized weighted linear sum of methods, dependent on the classification of temporal variability of the segment of one-minute solar power data, yields time series and ramp distributions similar to measured high-resolution solar irradiance data.

14 SOLAR ENERGY↗

Downscaling Solar Power Output to 4-Seconds for Use in Integration Studies: Preprint

High penetration renewable integration studies require solar power data with high spatial and temporal accuracy to quantify the impact of high frequency solar power ramps on the operation of the system. Our previous work concentrated on downscaling solar power from one hour to one minute by simulation. This method used clearness classifications to categorize temporal and spatial variability, and iterative methods to simulate intra-hour clearness variability. We determined that solar power ramp correlations between sites decrease with distance and the duration of the ramp, starting at around 0.6 for 30-minute ramps between sites that are less than 20 km apart. The sub-hour irradiance algorithm we developed has a noise floor that causes the correlations to approach ~0.005. Below one minute, the majority of the correlations of solar power ramps between sites less than 20 km apart are zero, and thus a new method to simulate intra-minute variability is needed. These intra-minute solar power ramps can be simulated using several methods, three of which we evaluate: a cubic spline fit to the one-minute solar power data; projection of the power spectral density toward the higher frequency domain; and average high frequency power spectral density from measured data. Each of these methods either under- or over-estimates the variability of intra-minute solar power ramps. We show that an optimized weighted linear sum of methods, dependent on the classification of temporal variability of the segment of one-minute solar power data, yields time series and ramp distributions similar to measured high-resolution solar irradiance data.

14 SOLAR ENERGY↗

Update on Establishing the Feasibility of Lead Slowing Down Spectroscopy for Direct Measurement of Plutonium in Used Fuel

Developing a method for the accurate, direct, and independent assay of the fissile isotopes in bulk materials (such as used fuel) of next-generation domestic nuclear fuel cycles is a goal of the Office of Nuclear Energy, Fuel Cycle R&D, Material Protection and Control Technology (MPACT) Campaign. To meet this goal, MPACT supports a multi-institutional collaboration to address the feasibility of Lead Slowing Down Spectroscopy (LSDS) as an active, nondestructive assay method. LSDS has the potential to provide independent, direct measurement of Pu and U isotopic masses in used fuel with an uncertainty considerably lower than today’s confirmatory assay methods, for which typical uncertainties are approximately 10%. LSDS techniques are sensitive to the fission resonances in the energy range of ~0.1-1000 eV, enabling their use to determine the mass content of the fissile isotopes in used fuel. This paper will present an update with regard to applying LSDS for used fuel assay and the development of algorithms to extract fissile isotopic masses from the used fuel.

Lead Slowing Down Spectroscopy, Used Fuel, Spent F↗

ntermediate frequency atmospheric disturbances: A dynamical bridge connecting western U.S. extreme precipitation with East Asian cold surges

In this study, an atmospheric river (AR) detection algorithm is developed to investigate the downstream modulation of the eastern North Pacific ARs by another weather extreme, known as the East Asian cold surge (EACS), in both reanalysis data and high-resolution global model simulations. It is shown that following the peak of an EACS, atmospheric disturbances of intermediate frequency (IF; 10 30 day period) are excited downstream. This leads to the formation of a persistent cyclonic circulation anomaly over the eastern North Pacific that dramatically enhances the AR occurrence probability and the surface precipitation over the western U.S. between 30 N and 50 N. A diagnosis of the local geopotential height tendency further confirms the essential role of IF disturbances in establishing the observed persistent anomaly. This downstream modulation effect is then examined in the two simulations of the National Center for Atmospheric Research Community Climate System Model version 4 with different horizontal resolutions (T85 and T341) for the same period (1979 2005). The connection between EACS and AR is much better captured by the T341 version of the model, mainly due to a better representation of the scale interaction and the characteristics of IF atmospheric disturbances in the higher-resolution model. The findings here suggest that faithful representations of scale interaction in a global model are critical for modeling and predicting the occurrences of hydrological extremes in the western U.S. and for understanding their potential future changes.

atmospheric river↗

High-Performance Computing for Advanced Smart Grid Applications

The power grid is becoming far more complex as a result of the grid evolution meeting an information revolution. Due to the penetration of smart grid technologies, the grid is evolving as an unprecedented speed and the information infrastructure is fundamentally improved with a large number of smart meters and sensors that produce several orders of magnitude larger amounts of data. How to pull data in, perform analysis, and put information out in a real-time manner is a fundamental challenge in smart grid operation and planning. The future power grid requires high performance computing to be one of the foundational technologies in developing the algorithms and tools for the significantly increased complexity. New techniques and computational capabilities are required to meet the demands for higher reliability and better asset utilization, including advanced algorithms and computing hardware for large-scale modeling, simulation, and analysis. This chapter summarizes the computational challenges in smart grid and the need for high performance computing, and present examples of how high performance computing might be used for future smart grid operation and planning.

computational challenges↗

Development of Variational Guiding Center Algorithms for Parallel Calculations in Experimental Magnetic Equilibria

Structure-preserving algorithms obtained via discrete variational principles exhibit strong promise for the calculation of guiding center test particle trajectories. The non-canonical Hamiltonian structure of the guiding center equations forms a novel and challenging context for geometric integration. To demonstrate the practical relevance of these methods, a prototypical variational midpoint algorithm is applied to an experimental magnetic equilibrium. The stability characteristics, conservation properties, and implementation requirements associated with the variational algorithms are addressed. Furthermore, computational run time is reduced for large numbers of particles by parallelizing the calculation on GPU hardware.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Reasoning And Hypothesis-Generation Framework Based On Scalable Graph Analytics

Finding actionable insights from data has always been difficult. As the scale and forms of data increase tremendously, the task of finding value becomes even more challenging. Data scientists at Oak Ridge National Laboratory are leveraging unique leadership infrastructure (e.g. Urika-XA and Urika-GD appliances) to develop scalable algorithms for semantic, logical and statistical reasoning with unstructured Big Data. We present the deployment of such a framework called ORiGAMI (Oak Ridge Graph Analytics for Medical Innovations) on the National Library of Medicine s SEMANTIC Medline (archive of medical knowledge since 1994). Medline contains over 70 million knowledge nuggets published in 23.5 million papers in medical literature with thousands more added daily. ORiGAMI is available as an open-science medical hypothesis generation tool - both as a web-service and an application programming interface (API) at http://hypothesis.ornl.gov . Since becoming an online service, ORIGAMI has enabled clinical subject-matter experts to: (i) discover the relationship between beta-blocker treatment and diabetic retinopathy; (ii) hypothesize that xylene is an environmental cancer-causing carcinogen and (iii) aid doctors with diagnosis of challenging cases when rare diseases manifest with common symptoms. In 2015, ORiGAMI was featured in the Historical Clinical Pathological Conference in Baltimore as a demonstration of artificial intelligence to medicine, IEEE/ACM Supercomputing and recognized as a Centennial Showcase Exhibit at the Radiological Society of North America (RSNA) Conference in Chicago. The final paper will describe the workflow built for the Cray Urika-XA and Urika-GD appliances that is able to reason with the knowledge of every published medical paper every time a clinical researcher uses the tool.

graph analytics↗

Oak Ridge Graph Analytics for Medical Innovation (ORiGAMI)

In this era of data-driven decisions and discovery where Big Data is producing Bigger Data, data scientists at the Oak Ridge National Laboratory are leveraging unique leadership infrastructure (e.g., Urika XA and Urika GD appliances) to develop scalable algorithms for semantic, logical and statistical reasoning with Big Data (i.e., data stored in databases as well as unstructured data in documents). ORiGAMI is a next-generation knowledge-discovery framework that is: (a) knowledge nurturing (i.e., evolves seamlessly with newer knowledge and data), (b) smart and curious (i.e. using information-foraging and reasoning algorithms to digest content) and (c) synergistic (i.e., interfaces computers with what they do best to help subject-matter-experts do their best. ORiGAMI has been demonstrated using the National Library of Medicine's SEMANTIC MEDLINE (archive of medical knowledge since 1994).

Roberts, Larry W.↗