Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized algorithm”

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,081 records · Page 60

Estimation of LOCA break size using cascaded support vector regression - 334

A failure of emergency core cooling system (ECCS) during a certain small break loss of coolant accident (SBLOCA) can cause a severe core uncovery and fuel failure. The safety injection systems (SISs) might not function properly in case of a SBLOCA, due to the slight change of pressure in the pipes. Early trend of the major parameters has to be observed and the accurate information has to be given to the nuclear power plant (NPP) operators by precisely identifying the break size to effectively manage accidents. In this study, the objective is to provide to operators the information on the break size in a short time by considering the accident situations such as hot-leg LOCA, cold-leg LOCA, steam generator tube rupture (SGTR). A cascaded support vector regression (CSVR) is used in order to estimate the break size. The simulation data set was obtained from the optimized power plant reactor 1000 (OPR1000) using modular accident analysis program (MAAP) code. And genetic algorithm (GA) was used to select the input variables of the CSVR model and optimize its parameters. As a result of this study, the CSVR model estimate very well the break size of LOCAs. If the operators can predict the break size in the LOCA, they can response quickly and properly to LOCA circumstances to prevent the core uncovery and fuel failure. Also, it will be possible to more efficiently manage beyond design basis accidents. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A novel computer-aided lung nodule detection system for CT images

Purpose: The paper presents a complete computer-aided detection (CAD) system for the detection of lung nodules in computed tomography images. A new mixed feature selection and classification methodology is applied for the first time on a difficult medical image analysis problem. Methods: The CAD system was trained and tested on images from the publicly available Lung Image Database Consortium (LIDC) on the National Cancer Institute website. The detection stage of the system consists of a nodule segmentation method based on nodule and vessel enhancement filters and a computed divergence feature to locate the centers of the nodule clusters. In the subsequent classification stage, invariant features, defined on a gauge coordinates system, are used to differentiate between real nodules and some forms of blood vessels that are easily generating false positive detections. The performance of the novel feature-selective classifier based on genetic algorithms and artificial neural networks (ANNs) is compared with that of two other established classifiers, namely, support vector machines (SVMs) and fixed-topology neural networks. A set of 235 randomly selected cases from the LIDC database was used to train the CAD system. The system has been tested on 125 independent cases from the LIDC database. Results: The overall performance of the fixed-topology ANN classifier slightly exceeds that of the other classifiers, provided the number of internal ANN nodes is chosen well. Making educated guesses about the number of internal ANN nodes is not needed in the new feature-selective classifier, and therefore this classifier remains interesting due to its flexibility and adaptability to the complexity of the classification problem to be solved. Our fixed-topology ANN classifier with 11 hidden nodes reaches a detection sensitivity of 87.5% with an average of four false positives per scan, for nodules with diameter greater than or equal to 3 mm. Analysis of the false positive items reveals that a considerable proportion (18%) of them are smaller nodules, less than 3 mm in diameter. Conclusions: A complete CAD system incorporating novel features is presented, and its performance with three separate classifiers is compared and analyzed. The overall performance of our CAD system equipped with any of the three classifiers is well with respect to other methods described in literature.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An Incremental Tensor Train Decomposition Algorithm

We present a new algorithm for incrementally updating the tensor train decomposition of a stream of tensor data. This new algorithm, called the tensor train incremental core expansion (TT-ICE) improves upon the current state-of-the-art algorithms for compressing in tensor train format by developing a new adaptive approach that incurs significantly slower rank growth and guarantees compression accuracy. This capability is achieved by limiting the number of new vectors appended to the TT-cores of an existing accumulation tensor after each data increment. These vectors represent directions orthogonal to the span of existing cores and are limited to those needed to represent a newly arrived tensor to a target accuracy. We provide two versions of the algorithm: TT-ICE and TT-ICE accelerated with heuristics (TT-ICE*). Here, we provide a proof of correctness for TT-ICE and empirically demonstrate the performance of the algorithms in compressing large-scale video and scientific simulation datasets. Compared to existing approaches that also use rank adaptation, TT-ICE* achieves 57× higher compression and up to 95% reduction in computational time.

97 MATHEMATICS AND COMPUTING↗

Shape-constrained Input Estimation for Efficient Multi-shaker Vibration Testing

Multi-shaker vibration testing is gaining interest from structural dynamics test engineers as it can provide a much more accurate match to complicated field vibration responses than traditional single-axis shaker tests. However, the force capabilities of the small modal shakers typically used in multi-shaker vibration tests has limited the achievable response levels. To date, most multi-shaker vibration tests have been performed using a variety of standard, commercially-available control systems. While these control systems are adequate for a wide range of multiple-input/multiple-output tests, their control algorithms have not been tailored for the specific problem of multi-shaker vibration tests: efficiently coordinating the various shakers to work together to achieve a desired response. Here, a new input estimation algorithm is developed and demonstrated using simulations and actual test data. This algorithm, dubbed shape-constrained input estimation, is shown to effectively coordinate multiple shakers using a set of constraint vectors based on the deflection shapes of the test structure. This is accomplished by using the singular vector shapes of the system frequency response matrix, which allows the constraint vectors to automatically change as a function of frequency. Simulation and test results indicate a significant reduction in the input forces required to achieve a desired response. Finally, the results indicate that shape-constrained input estimation is an effective method to achieve higher response levels from limited shaker forces which will enable higher level multi-shaker vibration tests to be performed.

42 ENGINEERING↗

Lung tumor tracking in fluoroscopic video based on optical flow

Respiratory gating and tumor tracking for dynamic multileaf collimator delivery require accurate and real-time localization of the lung tumor position during treatment. Deriving tumor position from external surrogates such as abdominal surface motion may have large uncertainties due to the intra- and interfraction variations of the correlation between the external surrogates and internal tumor motion. Implanted fiducial markers can be used to track tumors fluoroscopically in real time with sufficient accuracy. However, it may not be a practical procedure when implanting fiducials bronchoscopically. In this work, a method is presented to track the lung tumor mass or relevant anatomic features projected in fluoroscopic images without implanted fiducial markers based on an optical flow algorithm. The algorithm generates the centroid position of the tracked target and ignores shape changes of the tumor mass shadow. The tracking starts with a segmented tumor projection in an initial image frame. Then, the optical flow between this and all incoming frames acquired during treatment delivery is computed as initial estimations of tumor centroid displacements. The tumor contour in the initial frame is transferred to the incoming frames based on the average of the motion vectors, and its positions in the incoming frames are determined by fine-tuning the contour positions using a template matching algorithm with a small search range. The tracking results were validated by comparing with clinician determined contours on each frame. The position difference in 95% of the frames was found to be less than 1.4 pixels ({approx}0.7 mm) in the best case and 2.8 pixels ({approx}1.4 mm) in the worst case for the five patients studied.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

WE-D-9A-02: Automated Landmark-Guided CT to Cone-Beam CT Deformable Image Registration

Purpose: The anatomical changes that occur between the simulation CT and daily cone-beam CT (CBCT) are investigated using an automated landmark-guided deformable image registration (LDIR) algorithm with simultaneous intensity correction. LDIR was designed to be accurate in the presence of tissue intensity mismatch and heavy noise contamination. Method: An auto-landmark generation algorithm was used in conjunction with a local small volume (LSV) gradient matching search engine to map corresponding landmarks between the CBCT and planning CT. The LSVs offsets were used to perform an initial deformation, generate landmarks, and correct local intensity mismatch. The landmarks act as stabilizing controlpoints in the Demons objective function. The accuracy of the LDIR algorithm was evaluated on one synthetic case with ground truth and data of ten head and neck cancer patients. The deformation vector field (DVF) accuracy was accessed using a synthetic case. The Root mean square error of the 3D canny edge (RMSECE), mutual information (MI), and feature similarity index metric (FSIM) were used to access the accuracy of LDIR on the patient data. The quality of the corresponding deformed contours was verified by an attending physician. Results: The resulting 90 percentile DVF error for the synthetic case was within 5.63mm for the original demons algorithm, 2.84mm for intensity correction alone, 2.45mm using controlpoints without intensity correction, and 1.48 mm for the LDIR algorithm. For the five patients the mean RMSECE of the original CT, Demons deformed CT, intensity corrected Demons CT, control-point stabilized deformed CT, and LDIR CT was 0.24, 0.26, 0.20, 0.20, and 0.16 respectively. Conclusion: LDIR is accurate in the presence of multimodal intensity mismatch and CBCT noise contamination. Since LDIR is GPU based it can be implemented with minimal additional strain on clinical resources. This project has been supported by a CPRIT individual investigator award RP11032.

60 APPLIED LIFE SCIENCES↗

Linearized Functional Minimization for Inverse Modeling

Heterogeneous aquifers typically consist of multiple lithofacies, whose spatial arrangement significantly affects flow and transport. The estimation of these lithofacies is complicated by the scarcity of data and by the lack of a clear correlation between identifiable geologic indicators and attributes. We introduce a new inverse-modeling approach to estimate both the spatial extent of hydrofacies and their properties from sparse measurements of hydraulic conductivity and hydraulic head. Our approach is to minimize a functional defined on the vectors of values of hydraulic conductivity and hydraulic head fields defined on regular grids at a user-determined resolution. This functional is constructed to (i) enforce the relationship between conductivity and heads provided by the groundwater flow equation, (ii) penalize deviations of the reconstructed fields from measurements where they are available, and (iii) penalize reconstructed fields that are not piece-wise smooth. We develop an iterative solver for this functional that exploits a local linearization of the mapping from conductivity to head. This approach provides a computationally efficient algorithm that rapidly converges to a solution. A series of numerical experiments demonstrates the robustness of our approach.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

An Explicit Upwind Algorithm for Solving the Parabolized Navier-Stokes Equations

An explicit, upwind algorithm was developed for the direct (noniterative) integration of the 3-D Parabolized Navier-Stokes (PNS) equations in a generalized coordinate system. The new algorithm uses upwind approximations of the numerical fluxes for the pressure and convection terms obtained by combining flux difference splittings (FDS) formed from the solution of an approximate Riemann (RP). The approximate RP is solved using an extension of the method developed by Roe for steady supersonic flow of an ideal gas. Roe's method is extended for use with the 3-D PNS equations expressed in generalized coordinates and to include Vigneron's technique of splitting the streamwise pressure gradient. The difficulty associated with applying Roe's scheme in the subsonic region is overcome. The second-order upwind differencing of the flux derivatives are obtained by adding FDS to either an original forward or backward differencing of the flux derivative. This approach is used to modify an explicit MacCormack differencing scheme into an upwind differencing scheme. The second order upwind flux approximations, applied with flux limiters, provide a method for numerically capturing shocks without the need for additional artificial damping terms which require adjustment by the user. In addition, a cubic equation is derived for determining Vegneron's pressure splitting coefficient using the updated streamwise flux vector. Decoding the streamwise flux vector with the updated value of Vigneron's pressure splitting improves the stability of the scheme. The new algorithm is applied to 2-D and 3-D supersonic and hypersonic laminar flow test cases. Results are presented for the experimental studies of Holden and of Tracy. In addition, a flow field solution is presented for a generic hypersonic aircraft at a Mach number of 24.5 and angle of attack of 1 degree. The computed results compare well to both experimental data and numerical results from other algorithms. Computational times required for the upwind PNS code are approximately equal to an explicit PNS MacCormack's code and existing implicit PNS solvers.

Korte, John J.↗

Coherency-Based Detection Algorithm for Synchrophasor Cyberattacks

The wide area monitoring system (WAMS) is critical for power system situational awareness, but represents a growing cybersecurity vulnerability. Malicious adversaries may seek to compromise one or more PMUs in order to effect control decisions that unnecessarily disrupt typical grid operations. One example of a particularly pernicious attack vector is the spoofing or replaying of a fault event using one or more compromised PMUs. This work documents the development and validation of a coherency-based cyberattack detection algorithm that integrates a sliding-window singular value decomposition (SVD) with physics-based partitioning analysis to achieve accurate classification of events. Special consideration is given to discerning a sophisticated fault-replay or fault spoofing attack from actual faults. A software-based cybersecurity testbed has been developed for rigorous testing of the algorithm. The algorithm is further validated using simulated synchrophasor datasets obtained from a MinniWECC 63-bus test system. Results show that the algorithm can successfully detect fault-replay attacks even when over half of the PMUs are compromised.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Prediction and compression of lattice QCD data using machine learning algorithms on quantum annealer

We present regression and compression algorithms for lattice QCD data utilizing the efficient binary optimization ability of quantum annealers. In the regression algorithm, we encode the correlation between the input and output variables into a sparse coding machine learning algorithm. The trained correlation pattern is used to predict lattice QCD observables of unseen lattice configurations from other observables measured on the lattice. In the compression algorithm, we define a mapping from lattice QCD data of floating-point numbers to the binary coefficients that closely reconstruct the input data from a set of basis vectors. Since the reconstruction is not exact, the mapping defines a lossy compression, but, a reasonably small number of binary coefficients are able to reconstruct the input vector of lattice QCD data with the reconstruction error much smaller than the statistical fluctuation. In both applications, we use D-Wave quantum annealers to solve the NP-hard binary optimization problems of the machine learning algorithms.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient ptychographic phase retrieval via a matrix-free Levenberg-Marquardt algorithm

The phase retrieval problem, where one aims to recover a complex-valued image from far-field intensity measurements, is a classic problem encountered in a range of imaging applications. Modern phase retrieval approaches usually rely on gradient descent methods in a nonlinear minimization framework. Calculating closed-form gradients for use in these methods is tedious work, and formulating second order derivatives is even more laborious. Additionally, second order techniques often require the storage and inversion of large matrices of partial derivatives, with memory requirements that can be prohibitive for data-rich imaging modalities. We use a reverse-mode automatic differentiation (AD) framework to implement an efficient matrix-free version of the Levenberg-Marquardt (LM) algorithm, a longstanding method that finds popular use in nonlinear least-square minimization problems but which has seen little use in phase retrieval. Furthermore, we extend the basic LM algorithm so that it can be applied for more general constrained optimization problems (including phase retrieval problems) beyond just the least-square applications. Since we use AD, we only need to specify the physics-based forward model for a specific imaging application; the first and second-order derivative terms are calculated automatically through matrix-vector products, without explicitly forming the large Jacobian or Gauss-Newton matrices typically required for the LM method. We demonstrate that this algorithm can be used to solve both the unconstrained ptychographic object retrieval problem and the constrained “blind” ptychographic object and probe retrieval problems, under the popular Gaussian noise model as well as the Poisson noise model. We compare this algorithm to state-of-the-art first order ptychographic reconstruction methods to demonstrate empirically that this method outperforms best-in-class first-order methods: it provides excellent convergence guarantees with (in many cases) a superlinear rate of convergence, all with a computational cost comparable to, or lower than, the tested first-order algorithms.

36 MATERIALS SCIENCE↗

Motion-map constrained image reconstruction (MCIR): Application to four-dimensional cone-beam computed tomography

Purpose: Utilization of respiratory correlated four-dimensional cone-beam computed tomography (4DCBCT) has enabled verification of internal target motion and volume immediately prior to treatment. However, with current standard CBCT scan, 4DCBCT poses challenge for reconstruction due to the fact that multiple phase binning leads to insufficient number of projection data to reconstruct and thus cause streaking artifacts. The purpose of this study is to develop a novel 4DCBCT reconstruction algorithm framework called motion-map constrained image reconstruction (MCIR), that allows reconstruction of high quality and high phase resolution 4DCBCT images with no more than the imaging dose as well as projections used in a standard free breathing 3DCBCT (FB-3DCBCT) scan.Methods: The unknown 4DCBCT volume at each phase was mathematically modeled as a combination of FB-3DCBCT and phase-specific update vector which has an associated motion-map matrix. The motion-map matrix, which is the key innovation of the MCIR algorithm, was defined as the matrix that distinguishes voxels that are moving from stationary ones. This 4DCBCT model was then reconstructed with compressed sensing (CS) reconstruction framework such that the voxels with high motion would be aggressively updated by the phase-wise sorted projections and the voxels with less motion would be minimally updated to preserve the FB-3DCBCT. To evaluate the performance of our proposed MCIR algorithm, we evaluated both numerical phantoms and a lung cancer patient. The results were then compared with the (1) clinical FB-3DCBCT reconstructed using the FDK, (2) 4DCBCT reconstructed using the FDK, and (3) 4DCBCT reconstructed using the well-known prior image constrained compressed sensing (PICCS).Results: Examination of the MCIR algorithm showed that high phase-resolved 4DCBCT with sets of up to 20 phases using a typical FB-3DCBCT scan could be reconstructed without compromising the image quality. Moreover, in comparison with other published algorithms, the image quality of the MCIR algorithm is shown to be excellent.Conclusions: This work demonstrates the potential for providing high-quality 4DCBCT during on-line image-guided radiation therapy (IGRT), without increasing the imaging dose. The results showed that (at least) 20 phase images could be reconstructed using the same projections data, used to reconstruct a single FB-3DCBCT, without streak artifacts that are caused by insufficient projections.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Modeling of dodecagonal quasicrystal lattices

We consider a method for constructing dodecagonal quasi-lattices, which involves the recurrent multiplication of the initial group of sites that are vertices of a regular dodecagon. The algorithm of modeling of reciprocal lattices of dodecagonal quasicrystals has been analyzed. The proposed modeling method is compared with the traditional projection method. We have performed indexing of the diffraction pattern from dodecagonal quasicrystals, which is analogous to indexing proposed by Cahn for icosahedral quasicrystals. The ambiguity of the choice of the basis vectors of the quasicrystal reciprocal lattice has been considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Transitionless driving on adiabatic search algorithm

We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Anomaly detection in scientific data using joint statistical moments

We propose an anomaly detection method for multi-variate scientific data based on analysis of high-order joint moments. Using kurtosis as a reliable measure of outliers, we suggest that principal kurtosis vectors, by analogy to principal component analysis (PCA) vectors, signify the principal directions along which outliers appear. The inception of an anomaly, then, manifests as a change in the principal values and vectors of kurtosis. Obtaining the principal kurtosis vectors requires decomposing a fourth order joint cumulant tensor for which we use a simple, computationally less expensive approach that involves performing a singular value decomposition (SVD) over the matricized tensor. We demonstrate the efficacy of this approach on synthetic data, and develop an algorithm to identify the occurrence of a spatial and/or temporal anomalous event in scientific phenomena. The algorithm decomposes the data into several spatial sub-domains and time steps to identify regions with such events. Feature moment metrics, based on the alignments of the principal kurtosis vectors, are computed at each sub-domain and time step for all features to quantify their relative importance towards the overall kurtosis in the data. Accordingly, spatial and temporal anomaly metrics for each sub-domain are proposed using the Hellinger distance of the feature moment metric distribution from a suitable nominal distribution. Finally, we apply the algorithm to two turbulent auto-ignition combustion cases and demonstrate that the anomaly metrics reliably capture the occurrence of auto-ignition in relevant spatial sub-domains at the right time steps.

97 MATHEMATICS AND COMPUTING↗

Cohomology of line bundles: A computational algorithm

We present an algorithm for computing line bundle valued cohomology classes over toric varieties. This is the basic starting point for computing massless modes in both heterotic and type IIB/F-theory compactifications, where the manifolds of interest are complete intersections of hypersurfaces in toric varieties supporting additional vector bundles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Choice of velocity variables for complex flow computation

The issue of adopting the velocity components as dependent velocity variables for the Navier-Stokes flow computations is investigated. The viewpoint advocated is that a numerical algorithm should preferably honor both the physical conservation law in differential form and the geometric conservation law in discrete form. With the use of Cartesian velocity vector, the momentum equations in curvilinear coordinates can retain the full conservation-law form and satisfy the physical conservation laws. With the curvilinear velocity components, source terms appear in differential equations and hence the full conservation law form can not be retained. In discrete expressions, algorithms based on the Cartesian components can satisfy the geometric conservation-law form for convection terms but not for viscous terms; those based on the curvilinear components, on the other hand, cannot satisfy the geometric conservation-law form for either convection or viscous terms. Several flow solutions for domain with 90 and 360 degree turnings are presented to illustrate the issues of using the Cartesian velocity components and the staggered grid arrangement.

Shyy, W.↗

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗