Search NASA⌕ Search

SEARCH · Search NASA

Results for “VECTOR PROCESSING”

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 307 records · Page 17

Reprogramming of human fibroblasts to pluripotent stem cells using mRNA of four transcription factors

Reprogramming of differentiated cells into induced pluripotent cells (iPS) was accomplished in 2006 by expressing four, or less, embryonic stem cell (ESC)-specific transcription factors. Due to the possible danger of DNA damage and the potential tumorigenicity associated with such DNA damage, attempts were made to minimize DNA integration by the vectors involved in this process without complete success. Here we present a method of using RNA transfection as a tool for reprogramming human fibroblasts to iPS. We used RNA synthesized in vitro from cDNA of the same reprogramming four transcription factors. After transfection of the RNA, we show intracellular expression and nuclear localization of the respective proteins in at least 70% of the cells. We used five consecutive transfections to support continuous protein expression resulting in the formation of iPS colonies that express alkaline phosphatase and several ESC markers and that can be expanded. This method completely avoids DNA integration and may be developed to replace the use of DNA vectors in the formation of iPS.

60 APPLIED LIFE SCIENCES↗

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗

Strong decays of radially excited mesons in a chiral approach

We study radial excitations of pseudoscalar and vector qq mesons within a chiral approach. We derive a general form for a chiral Lagrangian describing processes involving excited pseudoscalar and vector mesons. The parameters of the chiral Lagrangian are fitted using data and previous calculations in the framework of the {sup 3}P{sub 0} model. Finite-width effects are examined and predictions for mesons previously not discussed are given. Available experimental data is analyzed whenever possible. Possible hints for exotic mesons and open interpretation issues are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Applying Machine‐Learning Methods to Laser Acceleration of Protons: Lessons Learned From Synthetic Data

ABSTRACT In this study, we consider three different machine‐learning methods—a three‐hidden‐layer neural network, support vector regression, and Gaussian process regression—and compare how well they can learn from a synthetic data set for proton acceleration in the Target Normal Sheath Acceleration regime. The synthetic data set was generated from a previously published theoretical model by Fuchs et al. 2005 that we modified. Once trained, these machine‐learning methods can assist with efforts to maximize the peak proton energy, or with the more general problem of configuring the laser system to produce a proton energy spectrum with desired characteristics. In our study, we focus on both the accuracy of the machine‐learning methods and the performance on one GPU including memory consumption. Although it is arguably the least sophisticated machine‐learning model we considered, support vector regression performed very well in our tests.

Desai, Ronak↗

A communication-avoiding, hybrid-parallel, rank-revealing orthogonalization method.

Orthogonalization consumes much of the run time of many iterative methods for solving sparse linear systems and eigenvalue problems. Commonly used algorithms, such as variants of Gram-Schmidt or Householder QR, have performance dominated by communication. Here, 'communication' includes both data movement between the CPU and memory, and messages between processors in parallel. Our Tall Skinny QR (TSQR) family of algorithms requires asymptotically fewer messages between processors and data movement between CPU and memory than typical orthogonalization methods, yet achieves the same accuracy as Householder QR factorization. Furthermore, in block orthogonalizations, TSQR is faster and more accurate than existing approaches for orthogonalizing the vectors within each block ('normalization'). TSQR's rank-revealing capability also makes it useful for detecting deflation in block iterative methods, for which existing approaches sacrifice performance, accuracy, or both. We have implemented a version of TSQR that exploits both distributed-memory and shared-memory parallelism, and supports real and complex arithmetic. Our implementation is optimized for the case of orthogonalizing a small number (5-20) of very long vectors. The shared-memory parallel component uses Intel's Threading Building Blocks, though its modular design supports other shared-memory programming models as well, including computation on the GPU. Our implementation achieves speedups of 2 times or more over competing orthogonalizations. It is available now in the development branch of the Trilinos software package, and will be included in the 10.8 release.

99 GENERAL AND MISCELLANEOUS↗

e08-008: Exclusive study of deuteron electrodisintegration near threshold

The study of threshold electrodisintegration of and elastic scattering on the only stable two nucleon system, the deuteron, can reveal specific aspects of the N-N interaction. The simplicity of electrodisintegration along with the simplicity of the deuteron makes this study most appropriate for revealing these interactions. By using an incident beam of polarized electrons and by measuring the polarization of the recoiling proton, the ratio of the electric (G {sub E }) and magnetic (G {sub M }) form factors for d( e-vector ,e{sup ′} p-vector ) (and p( e-vector ,e{sup ′} p-vector )) reactions may be extracted. This experiment was conducted in Hall A at Jefferson Lab in Newport News, Virginia using a beam of polarized electrons provided by the CEBAF Accelerator incident on a liquid deuterium (and hydrogen) target. The scattered electron and the recoiling (polarized) proton were detected using the High Resolution Spectrometers of Hall A. To determine the polarization of the recoil proton, an analyzing material was placed perpendicular to the protons trajectory through the spectrometer, in front of a set of straw chambers. Due to the spin-orbit interactions involved in the scattering of the proton from the analyzer material, asymmetries seen in the distribution of events detected by these straw chambers reveal the polarization of the recoil proton. By tracking the spin procession of the polarized protons from the straw chambers back to the target, the transferred and induced polarization of the proton may be determined. The (double-spin) asymmetries observed in the straw chambers will first be studied for the well-known elastic p( e-vector ,e{sup ′} p-vector ) process and compared to the asymmetries for d( e-vector ,e{sup ′} p-vector )n(x{sub B}=1). The analysis will then be repeated to determine how these asymmetries change with increasing x {sub B }(to the kinematic limit for deuteron electrodisintegration).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Comparison of Fault Detection Algorithms for Real-time Diagnosis in Large-Scale System

In this paper, we present a review of different real-time capable algorithms to detect and isolate component failures in large-scale systems in the presence of inaccurate test results. A sequence of imperfect test results (as a row vector of I's and O's) are available to the algorithms. In this case, the problem is to recover the uncorrupted test result vector and match it to one of the rows in the test dictionary, which in turn will isolate the faults. In order to recover the uncorrupted test result vector, one needs the accuracy of each test. That is, its detection and false alarm probabilities are required. In this problem, their true values are not known and, therefore, have to be estimated online. Other major aspects in this problem are the large-scale nature and the real-time capability requirement. Test dictionaries of sizes up to 1000 x 1000 are to be handled. That is, results from 1000 tests measuring the state of 1000 components are available. However, at any time, only 10-20% of the test results are available. Then, the objective becomes the real-time fault diagnosis using incomplete and inaccurate test results with online estimation of test accuracies. It should also be noted that the test accuracies can vary with time --- one needs a mechanism to update them after processing each test result vector. Using Qualtech's TEAMS-RT (system simulation and real-time diagnosis tool), we test the performances of 1) TEAMSAT's built-in diagnosis algorithm, 2) Hamming distance based diagnosis, 3) Maximum Likelihood based diagnosis, and 4) HidderMarkov Model based diagnosis.

Kirubarajan, Thiagalingam↗

Modeling Cooperative Threads to Project GPU Performance for Adaptive Parallelism

Most accelerators, such as graphics processing units (GPUs) and vector processors, are particularly suitable for accelerating massively parallel workloads. On the other hand, conventional workloads are developed for multi-core parallelism, which often scale to only a few dozen OpenMP threads. When hardware threads significantly outnumber the degree of parallelism in the outer loop, programmers are challenged with efficient hardware utilization. A common solution is to further exploit the parallelism hidden deep in the code structure. Such parallelism is less structured: parallel and sequential loops may be imperfectly nested within each other, neigh boring inner loops may exhibit different concurrency patterns (e.g. Reduction vs. Forall), yet have to be parallelized in the same parallel section. Many input-dependent transformations have to be explored. A programmer often employs a larger group of hardware threads to cooperatively walk through a smaller outer loop partition and adaptively exploit any encountered parallelism. This process is time-consuming and error-prone, yet the risk of gaining little or no performance remains high for such workloads. To reduce risk and guide implementation, we propose a technique to model workloads with limited parallelism that can automatically explore and evaluate transformations involving cooperative threads. Eventually, our framework projects the best achievable performance and the most promising transformations without implementing GPU code or using physical hardware. We envision our technique to be integrated into future compilers or optimization frameworks for autotuning.

Meng, Jiayuan↗

Dynamic reduction of dimensions of a document vector in a document search and retrieval system

The method and system of the invention involves processing each new document (20) coming into the system into a document vector (16), and creating a document vector with reduced dimensionality (17) for comparison with the data model (15) without recomputing the data model (15). These operations are carried out by a first computer (11) while a second computer (12) updates the data model (18), which can be comprised of an initial large group of documents (19) and is premised on the computing an initial data model (13, 14, 15) to provide a reference point for determining document vectors from documents processed from the data stream (20).

97 MATHEMATICS AND COMPUTING↗

Spin Physics at ANKE-COSY

The COSY accelerator (Jülich, Germany) provides beams of polarised protons and deuterons. The ANKE facility at COSY is equipped with polarised hydrogen and deuterium atomic gas targets. The reactions investigated with polarised probes at ANKE include the deuteron break-up at small and large momentum transfer, the pion production processes in pp and pn collisions and the near-threshold η meson production in dip d-vector p→{sup 3}Heη process. Use of the polarised deuteron beam properties allowed a precision measurement of the η meson mass. The future experimental program covers the study of the elementary pp and pn-interaction with polarised beams up to the maximal COSY energy, and a double polarised measurement of the A {sub x, z }spin correlation parameter in the pN → {pp}{sub s }π process.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The magnetic field investigation on Cluster

The magnetic field investigation of the Cluster four-spacecraft mission is designed to provide intercalibrated measurements of the B magnetic field vector. The instrumentation and data processing of the mission are discussed. The instrumentation is identical on the four spacecraft. It consists of two triaxial fluxgate sensors and of a failure tolerant data processing unit. The combined analysis of the four spacecraft data will yield such parameters as the current density vector, wave vectors, and the geometry and structure of discontinuities.

Balogh, A.↗

Parallel-vector computation for linear structural analysis and non-linear unconstrained optimization problems

Several parallel-vector computational improvements to the unconstrained optimization procedure are described which speed up the structural analysis-synthesis process. A fast parallel-vector Choleski-based equation solver, pvsolve, is incorporated into the well-known SAP-4 general-purpose finite-element code. The new code, denoted PV-SAP, is tested for static structural analysis. Initial results on a four processor CRAY 2 show that using pvsolve reduces the equation solution time by a factor of 14-16 over the original SAP-4 code. In addition, parallel-vector procedures for the Golden Block Search technique and the BFGS method are developed and tested for nonlinear unconstrained optimization. A parallel version of an iterative solver and the pvsolve direct solver are incorporated into the BFGS method. Preliminary results on nonlinear unconstrained optimization test problems, using pvsolve in the analysis, show excellent parallel-vector performance indicating that these parallel-vector algorithms can be used in a new generation of finite-element based structural design/analysis-synthesis codes.

Nguyen, D. T.↗

Notes on power of normality tests of error terms in regression models

Normality is one of the basic assumptions in applying statistical procedures. For example in linear regression most of the inferential procedures are based on the assumption of normality, i.e. the disturbance vector is assumed to be normally distributed. Failure to assess non-normality of the error terms may lead to incorrect results of usual statistical inference techniques such as t-test or F-test. Thus, error terms should be normally distributed in order to allow us to make exact inferences. As a consequence, normally distributed stochastic errors are necessary in order to make a not misleading inferences which explains a necessity and importance of robust tests of normality. Therefore, the aim of this contribution is to discuss normality testing of error terms in regression models. In this contribution, we introduce the general RT class of robust tests for normality, and present and discuss the trade-off between power and robustness of selected classical and robust normality tests of error terms in regression models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Systems of Markov functions generated by graphs and the asymptotics of their Hermite-Pade approximants

The paper considers Hermite-Pade approximants to systems of Markov functions defined by means of directed graphs. The minimization problem for the energy functional is investigated for a vector measure whose components are related by a given interaction matrix and supported in some fixed system of intervals. The weak asymptotics of the approximants are obtained in terms of the solution of this problem. The defining graph is allowed to contain undirected cycles, so the minimization problem in question is considered within the class of measures whose masses are not fixed, but allowed to 'flow' between intervals. Strong asymptotic formulae are also obtained. The basic tool that is used is an algebraic Riemann surface defined by means of the supports of the components of the extremal measure. The strong asymptotic formulae involve standard functions on this Riemann surface and solutions of some boundary value problems on it. The proof depends upon an asymptotic solution of the corresponding matrix Riemann-Hilbert problem. Bibliography: 40 titles.

97 MATHEMATICS AND COMPUTING↗

Constraints on astro-unparticle physics from SN 1987A

SN 1987A observations have been used to place constraints on the interactions between standard model particles and unparticles. In this study we calculate the energy loss from the supernovae core through scalar, pseudo-scalar, vector, and pseudo-vector unparticle emission from nuclear bremsstrahlung for degenerate nuclear matter interacting through one pion exchange. In order to examine the constraints on d{sub U} = we considered the emission of scalars, pseudo-scalars, vectors, pseudo-vectors and tensors through the pair annihilation process e{sup +}e{sup -} {yields} U{sub {gamma}}. In addition we have re-examined other pair annihilation processes. The most stringent bounds on the dimensionless coupling constants for d{sub U}=1 and {Lambda}{sub U}=m{sub Z} are obtained from the nuclear bremsstrahlung process for the pseudo-scalar and pseudo-vector couplings |{lambda}{sup P}{sub 0,1}|{<=}4 Multiplication-Sign 10{sup -11}, and for tensor interaction, the best limit on dimensionless coupling is obtained from e{sup +}e{sup -} {yields} U{sub {gamma}} and we get |{lambda}{sup T}|{<=}6 Multiplication-Sign 10{sup -6}.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Machine Learning with Gradient-Based Optimization of Nuclear Waste Vitrification with Uncertainties and Constraints

Gekko is an optimization suite in Python that solves optimization problems involving mixed-integer, nonlinear, and differential equations. The purpose of this study is to integrate common Machine Learning (ML) algorithms such as Gaussian Process Regression (GPR), support vector regression (SVR), and artificial neural network (ANN) models into Gekko to solve data based optimization problems. Uncertainty quantification (UQ) is used alongside ML for better decision making. These methods include ensemble methods, model-specific methods, conformal predictions, and the delta method. An optimization problem involving nuclear waste vitrification is presented to demonstrate the benefit of ML in this field. ML models are compared against the current partial quadratic mixture (PQM) model in an optimization problem in Gekko. GPR with conformal uncertainty was chosen as the best substitute model as it had a lower mean squared error of 0.0025 compared to 0.018 and more confidently predicted a higher waste loading of 37.5 wt% compared to 34 wt%. The example problem shows that these tools can be used in similar industry settings where easier use and better performance is needed over classical approaches. Future works with these tools include expanding them with other regression models and UQ methods, and exploration into other optimization problems or dynamic control.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Prediction of interest rate using CKLS model with stochastic parameters

The Chan, Karolyi, Longstaff and Sanders (CKLS) model is a popular one-factor model for describing the spot interest rates. In this paper, the four parameters in the CKLS model are regarded as stochastic. The parameter vector φ{sup (j)} of four parameters at the (J+n)-th time point is estimated by the j-th window which is defined as the set consisting of the observed interest rates at the j′-th time point where j≤j′≤j+n. To model the variation of φ{sup (j)}, we assume that φ{sup (j)} depends on φ{sup (j−m)}, φ{sup (j−m+1)},…, φ{sup (j−1)} and the interest rate r{sub j+n} at the (j+n)-th time point via a four-dimensional conditional distribution which is derived from a [4(m+1)+1]-dimensional power-normal distribution. Treating the (j+n)-th time point as the present time point, we find a prediction interval for the future value r{sub j+n+1} of the interest rate at the next time point when the value r{sub j+n} of the interest rate is given. From the above four-dimensional conditional distribution, we also find a prediction interval for the future interest rate r{sub j+n+d} at the next d-th (d≥2) time point. The prediction intervals based on the CKLS model with stochastic parameters are found to have better ability of covering the observed future interest rates when compared with those based on the model with fixed parameters.

97 MATHEMATICS AND COMPUTING↗

Adaptive sparse polynomial chaos expansion based on least angle regression

Polynomial chaos (PC) expansions are used in stochastic finite element analysis to represent the random model response by a set of coefficients in a suitable (so-called polynomial chaos) basis. The number of terms to be computed grows dramatically with the size of the input random vector, which makes the computational cost of classical solution schemes (may it be intrusive (i.e. of Galerkin type) or non intrusive) unaffordable when the deterministic finite element model is expensive to evaluate. To address such problems, the paper describes a non intrusive method that builds a sparse PC expansion. First, an original strategy for truncating the PC expansions, based on hyperbolic index sets, is proposed. Then an adaptive algorithm based on least angle regression (LAR) is devised for automatically detecting the significant coefficients of the PC expansion. Beside the sparsity of the basis, the experimental design used at each step of the algorithm is systematically complemented in order to avoid the overfitting phenomenon. The accuracy of the PC metamodel is checked using an estimate inspired by statistical learning theory, namely the corrected leave-one-out error. As a consequence, a rather small number of PC terms are eventually retained (sparse representation), which may be obtained at a reduced computational cost compared to the classical 'full' PC approximation. The convergence of the algorithm is shown on an analytical function. Then the method is illustrated on three stochastic finite element problems. The first model features 10 input random variables, whereas the two others involve an input random field, which is discretized into 38 and 30 - 500 random variables, respectively.

97 MATHEMATICS AND COMPUTING↗