Search NASA⌕ Search

SEARCH · Search NASA

Results for “vector fitting”

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 289 records · Page 16

Xylella fastidiosa modulates exopolysaccharide polymer length and the dynamics of biofilm development with a β-1,4-endoglucanase

Xylella fastidiosa is a Gram-negative bacterium that causes disease in many economically important crops. It colonizes the plant host xylem and the mouthparts of its insect vectors where it produces exopolysaccharide (EPS) and forms robust biofilms. Typically, the ability to form a biofilm enhances virulence, but X. fastidiosa does not fit neatly into that paradigm. Instead, X. fastidiosa enters into biofilms to attenuate its movement in the xylem, which, in turn, slows disease progression. In most of its over 600 known plant hosts, X. fastidiosa behaves as a benign commensal, but in some hosts like Vitis vinifera grapevines, it acts as a pathogen. Its ability to attenuate its own virulence in susceptible hosts may be a remnant of its commensal lifestyle in other hosts. Here, we demonstrate that X. fastidiosa utilizes a β-1,4 endoglucanase to cleave its self-produced β-1,4-glucan exopolysaccharide polymer to process it from a higher molecular weight to a lower molecular weight polymer. This processing mediates surface adherence of the cells and ultimately governs overall biofilm architecture, indicating enzymatic pruning of the EPS plays a key role in biofilm-mediated attenuation of X. fastidiosa in planta and, thus, is a key vestige that links its commensal behaviors to its parasitic behaviors in specific hosts.

59 BASIC BIOLOGICAL SCIENCES↗

Fast, Conservative Algorithm for Solving the Transonic Full-Potential Equation

A fast, fully implicit approximate factorization algorithm designed to solve the conservative, transonic, full-potential equation in either two or three dimensions is described. The algorithm uses an upwind bias of the density coefficient for stability in supersonic regions. This provides an effective upwind difference of the streamwise terms for any orientation of the velocity vector (i.e., rotated differencing), thereby greatly enhancing the reliability of the present algorithm. A numerical transformation is used to establish an arbitrary body-fitted, finite-difference mesh. Computed results for both airfoils and simplified wings demonstrate substantial improvement in convergence speed for the new algorithm relative to standard successive-line over-relaxation algorithms.

Holst, Terry L.↗

On-the-Fly Decompression and Rendering of Multiresolution Terrain

We present a streaming geometry compression codec for multiresolution, uniformly-gridded, triangular terrain patches that supports very fast decompression. Our method is based on linear prediction and residual coding for lossless compression of the full-resolution data. As simplified patches on coarser levels in the hierarchy already incur some data loss, we optionally allow further quantization for more lossy compression. The quantization levels are adaptive on a per-patch basis, while still permitting seamless, adaptive tessellations of the terrain. Our geometry compression on such a hierarchy achieves compression ratios of 3:1 to 12:1. Our scheme is not only suitable for fast decompression on the CPU, but also for parallel decoding on the GPU with peak throughput over 2 billion triangles per second. Each terrain patch is independently decompressed on the fly from a variable-rate bitstream by a GPU geometry program with no branches or conditionals. Thus we can store the geometry compressed on the GPU, reducing storage and bandwidth requirements throughout the system. In our rendering approach, only compressed bitstreams and the decoded height values in the view-dependent 'cut' are explicitly stored on the GPU. Normal vectors are computed in a streaming fashion, and remaining geometry and texture coordinates, as well as mesh connectivity, are shared and re-used for all patches. We demonstrate and evaluate our algorithms on a small prototype system in which all compressed geometry fits in the GPU memory and decompression occurs on the fly every rendering frame without any cache maintenance.

99 GENERAL AND MISCELLANEOUS↗

An arbitrarily high-order three-dimensional Cartesian-grid method for reconstructing interfaces from volume fraction fields

Here Tthis work describes a newly developed, arbitrarily high-order Cartesian-grid method for reconstructing material interfaces from a volume fraction field. The method begins by identifying all of the grid cells in the volume fraction field that are intersected by the interface and need to be approximated by the reconstruction scheme. Finite-differences are used to calculate the gradient of the volume fraction field and provide an estimate of the surface normal in all of the interfacial grid cells. Groups of connected grid cells are then identified which all have the same dominant component of the normal vector. This grouping by orientation determines the proper dependent variable to use in the surface reconstruction (e.g. for a 2D curve, this step determines if the surface will be approximated by a function of x or y). A cumulative integral over the surface is constructed and fit using b-splines for two-dimensional problems or tensor-product b-splines for three-dimensional problems. This construction allows for the interface to be recovered through application of the second fundamental theorem of calculus. Fitting the cumulative integral with $\mathscr{N}$ th-order b-splines (or tensor-product b-splines) yields an ($\mathscr{N}$-1) th-order convergence rate of the interface shape. Differentiation of the b-spline interface function(s) allows for the high-order approximation of the normal vector and curvature to be obtained directly anywhere along b-spline. Together, the proposed reconstruction technique can achieve arbitrarily high mesh convergence rates. Validation tests are presented with mesh convergence rates ranging from fourth- to tenth-order.

97 MATHEMATICS AND COMPUTING↗

WeakIdent: Weak formulation for identifying differential equation using narrow-fit and trimming

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation with two new mechanisms, narrow-fit and trimming, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise, and two new mechanisms, narrow-fit and trimming, improve the coefficient support and value recoveries respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

97 MATHEMATICS AND COMPUTING↗

Using Downwelling Far- and Thermal-Infrared Hyperspectral Radiance for Cloud Phase Classification in the Antarctic

The cloud phase is one of the most important parameters of clouds. In this paper, we propose a method for cloud phase classification that synergistically utilizes the far- and thermal-infrared bands based on the Atmospheric Emitted Radiance Interferometer (AERI) at the Atmospheric Radiation Measurement West Antarctic Radiation Experiment (AWARE) observatory in 2016. The possible features in the far- and thermal-infrared bands are analyzed based on the differences in the simulated cloud brightness temperature (BT) spectra with different cloud phases. Using the support vector machine (SVM) algorithm, four features are determined to identify the cloud phase, which include the BT at 900 cm -1 , the slope of the fitted function of BT in the 900–1000 cm -1 interval, the BT difference (BTD) between 512 cm -1 and 726 cm -1 , and the BTD between 550 cm -1 and 726 cm -1 . Here, the performance of the proposed method is evaluated with Shupe’s and Turner’s method. The monthly average accuracy of the proposed method, the method without the two far-infrared features, and Turner’s method are about 76%, 36%, and 49%, respectively, which infer the good performance of the proposed method and also indicate that the far-infrared band features can effectively enhance cloud phase classification. It is notable that, compared to Shupe’s method, the accuracy for the proposed method is only 61% during the Antarctic summer, which results from the definitions of cloud phase and radiative effect. In addition, the accuracy is only 44% for Turner’s method in seasons with a low frequency of mixed clouds due to the significant effect of water vapor.

54 ENVIRONMENTAL SCIENCES↗

An initial feasibility stage for Stoer's constrained least squares algorithm

A procedure is described for computing an initial feasible vector, x sub 0, for Stoer's algorithm for solving the linear least squares problem subject to linear equality and inequality constraints. The procedure described fits well with Stoer's algorithm since much of the computation performed to determine x sub 0 accomplishes initializing transformations of the problem data, which would otherwise be done in Stoer's algorithm after being given an x sub 0.

Lawson, C. L.↗

An experimental study of a jet issuing from a lifting wing

An experimental program was conducted to determine the behavior of a round turbulent jet issuing from a lifting two-dimensional wing in crossflow. The jet was located at 65% wing chord on an NACA 0021 airfoil fitted with a 30% chord NACA 4415 flap. The flowfield associated with the jet was surveyed extensively with directional pressure probes to determine local velocity vectors and pressures for three different values of lift coefficient at jet effective velocity ratios (square root of the ratio of the jet dynamic pressure to the freestream dynamic pressure) of 4, 6, and 8. Data describing the jet centerline and the path of the contrarotating vortices accompanying the deflected jet are presented and compared with similar data for a round jet issuing from a large flat plate. The spacing and strength of the vortices are calculated using a simple vortex model previously proposed for the flat plate case. The results show that the penetration of the jet and the vortices increases significantly with increasing lift for the range of test parameters covered in the study. The calculated vortex spacing and strength also show an increase with lift.

Mcmahon, H. M.↗

A fast, conservative algorithm for solving the transonic full-potential equation

A fast, fully implicit approximate factorization (AF) algorithm designed to solve the conservative transonic full-potential equation in either two or three dimensions is described. The algorithm uses an upwind bias of the density coefficient for stability in supersonic regions. This provides an effective upwind difference of the streamwise terms for any orientation of the velocity vector (i.e., 'rotated differencing'), and thereby greatly enhances the reliability of the present algorithm. A numerical transformation is used to establish an arbitrary body-fitted finite-difference mesh. Computed results for both airfoils and simplified wings demonstrate substantial improvement in convergence speed for the new algorithm relative to standard successive-line overrelaxation algorithms.

Holst, T. L.↗

Conventional and Bimodal Nuclear Thermal Rocket (NTR) Artificial Gravity Mars Transfer Vehicle Concepts

A variety of countermeasures have been developed to address the debilitating physiological effects of "zero-gravity" (0-g) experienced by cosmonauts and astronauts during their approximately 0.5-1.2 year long stays in LEO (Low Earth Orbit). Longer interplanetary flights, combined with possible prolonged stays in Mars orbit, could subject crewmembers to up to approximately 2.5 years of weightlessness. In view of known and recently diagnosed problems associated with 0-g, an artificial gravity spacecraft offers many advantages and may indeed be an enabling technology for human flights to Mars. A number of important human factors must be taken into account in selecting the rotation radius, rotation rate, and orientation of the habitation module or modules. These factors include the gravity gradient effect, radial and tangential Coriolis forces, along with cross-coupled acceleration effects. Artificial gravity (AG) Mars transfer vehicle (MTV) concepts are presented that utilize both conventional NTR, as well as, enhanced "bimodal" nuclear thermal rocket (BNTR) propulsion. The NTR is a proven technology that generates high thrust and has a specific impulse (I (sub sp)) capability of approximately 900 s - twice that of today's best chemical rockets. The AG/MTV concepts using conventional NTP carry twin cylindrical "ISS-type" habitation modules with their long axes oriented either perpendicular or parallel to the longitudinal spin axis of the MTV and utilize photovoltaic arrays (PVAs) for spacecraft power. The twin habitat modules are connected to a central operations hub located at the front of the MTV via two pressurized tunnels that provide the rotation radius for the habitat modules. For the BNTR AG/MTV option, each engine has its own "closed" secondary helium-xenon gas loop and Brayton rotating unit that can generate tens of kilowatts (kW (sub e)) of spacecraft electrical power during the mission coast phase eliminating the need for large PVAs. A single inflatable "TransHab-type" habitation module is also used with multiple vertical floors oriented radial to the MTV spin axis. The BNTR MTV's geometry - long and linear - is naturally compatible with AG operation. By rotating the vehicle about its center-of-mass and perpendicular to its flight vector at approximately 3.0 - 5.2 rpm, a centrifugal force and AG environment corresponding to approximately 0.38 - 1.0 g can be established to help maintain crew fitness out to Mars and back. Vehicles using NTP/BNTP can more readily accommodate the heavier payload mass and increased RCS propellant loading associated with AG operation, and can travel faster to and from Mars thereby reducing the crew's exposure to galactic cosmic radiation and solar flares. Mission scenario descriptions, key vehicle features and operational characteristics for each propulsion options are presented using the lift capability and payload volumes estimated for the SLS-1A and HLV.

Nuclear Propulsion↗

CHARACTERIZING THE FORMATION HISTORY OF MILKY WAY LIKE STELLAR HALOS WITH MODEL EMULATORS

We use the semi-analytic model ChemTreeN, coupled to cosmological N-body simulations, to explore how different galaxy formation histories can affect observational properties of Milky Way like galaxies' stellar halos and their satellite populations. Gaussian processes are used to generate model emulators that allow one to statistically estimate a desired set of model outputs at any location of a p-dimensional input parameter space. This enables one to explore the full input parameter space orders of magnitude faster than could be done otherwise. Using mock observational data sets generated by ChemTreeN itself, we show that it is possible to successfully recover the input parameter vectors used to generate the mock observables if the merger history of the host halo is known. However, our results indicate that for a given observational data set, the determination of 'best-fit' parameters is highly susceptible to the particular merger history of the host. Very different halo merger histories can reproduce the same observational data set, if the 'best-fit' parameters are allowed to vary from history to history. Thus, attempts to characterize the formation history of the Milky Way using these kind of techniques must be performed statistically, analyzing large samples of high-resolution N-body simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Electromagnetic form factors of nucleons in the extended vector meson dominance model

The extended vector meson dominance model, which allows one to describe the electromagnetic form factors of nucleons obeying the asymptotic quark counting rule prescriptions and contains the minimal number of free parameters, is presented. We obtain a reasonable fit of form factors over the experimentally available spacelike region of momentum transfer and reasonable results in the timelike region.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Rare Higgs Processes at CMS and Precision Timing Detector Studies for HL-LHC CMS Upgrade

This thesis describes the search for two rare Higgs processes. The first analysis describes the CMS Run 2 search for $H$ $\rightarrow$ $\mu$$\mu$ decays, with 137.3 fb$^{-1}$ of data at $\sqrt{s}$ = 13 TeV. The analysis targeted four different Higgs production modes: the gluon fusion (ggH), the vector boson fusion (VBF), the Higgs-strahlung process (VH), and the production in association with a pair of top quarks (ttH). Each category used a dedicated machine learning based classifier to separate the signal from the background processes. A combined fit from all these categories saw a slight excess in the data corresponding to 3.0 standard deviations at $M$$_{H}$ = 125.38 GeV, and gave the first evidence for the Higgs boson decay to second-generation fermions. The best-fit signal strength and the corresponding 68% CL interval was found to be +0.17?????? = 1.19 $_{-0.39}^{+0.41}$ (stat)$_{-0.16}^{+0.17}$(syst) at $M$$_{H}$ = 125.38 GeV. The second analysis describes the CMS Run 2 search for 𝐻𝐻 → 𝑏𝑏𝑏𝑏 with highly boosted Higgs bosons. This analysis used a dedicated jet identification algorithm based on graph neural networks (ParticleNet) to identify boosted H→ bb jets. This search targeted the gluon fusion and the vector boson fusion HH production modes, and put constraints on the allowed values of the various Higgs couplings as: 𝜅𝜆 ∈ [−9.9, 16.9] when 𝜅𝑉 = 1, 𝜅2𝑉 = 1; 𝜅𝑉 ∈ [−1.17, −0.79] ∪ [0.81, 1.18] when 𝜅𝜆 = 1, 𝜅2𝑉 = 1; 𝜅2𝑉 ∈ [0.62, 1.41] when 𝜅𝜆 = 1, 𝜅𝑉 = 1. A scenario with 𝜅2𝑉 = 0 was excluded with a significance of 6.3 standard deviations for the first time, when other H couplings are fixed to their SM values. The combined observed (expected) 95% upper limit on the HH production cross section was found to be 9.9 (5.1) × SM. Finally, this thesis also discusses the planned MIP Timing Detector (MTD) upgrade for CMS at the HL-LHC. The MTD will be a time-of-flight (TOF) detector, designed to provide a precision timing information for charged particles using SiPMs + LYSO scintillating crystals, with a time resolution of ∼30 ps. This thesis describes several R&D tests that have been performed for characterizing the sensor properties (time resolution, light yield, etc.) and optimizing the sensor design geometry. This thesis also contains a description of mock test setups for cooling the sensors, since it is known to be an effective way of mitigating the increased dark current rates in the sensors due to radiation damage.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗

Application of multivariate autoregressive spectrum estimation to ULF waves

The estimation of the power spectrum of a time series by fitting a finite autoregressive model to the data has recently found widespread application in the physical sciences. The extension of this method to the analysis of vector time series is presented here through its application to ULF waves observed in the magnetosphere by the ATS 6 synchronous satellite. Autoregressive spectral estimates of the power and cross-power spectra of these waves are computed with computer programs developed by the author and are compared with the corresponding Blackman-Tukey spectral estimates. The resulting spectral density matrices are then analyzed to determine the direction of propagation and polarization of the observed waves.

Ioannidis, G. A.↗

B(B{sub s}){yields}D{sub (s)}P, D{sub (s)}V, D{sub (s)}*P, and D{sub (s)}*V decays in the perturbative QCD approach

Two-body charmed decays B{sub (s)}{yields}D{sub (s)}P, D{sub (s)}*P, D{sub (s)}V, and D{sub (s)}*V, where P and V denote the light pseudoscalar meson and vector meson, respectively, are analyzed in the perturbative QCD (pQCD) approach. Using the experimental data of six B{yields}DP channels, we test the D meson wave function by {chi}{sup 2} fit. We give the branching ratios of all the charmed B decay channels, most of which agree with experiments amazingly well. The predicted B{sub s} decays can be confronted with the future experimental data. By straightforward calculations, our pQCD approach gives the right relative strong phase of a{sub 2}/a{sub 1} that agrees with experiments. We also predict the percentage of transverse polarizations in B{sub (s)}{yields}D*V decay channels.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Simulation of the Impact of Point Defects and Edge Dislocations on X-Ray Diffraction in Hexagonal (Ni,Co) 1+2 x Ti 1– x O 3 Thin Films

In this work, a computer code for simulating high-resolution X-ray diffraction (XRD) data from disordered crystals with arbitrary spatial composition and local lattice parameters is developed. Simulated patterns are compared with the experimental data collected on a single phase, highly crystalline (Ni 0.42 Co 0.58 ) 2.22 Ti 0.39 O 3 solid-solution thin film exhibiting a large number of subsidiary minima. As a case study, the edge dislocations in hexagonal (Ni,Co) 3 O 3 thin films with Burgers vector parallel and perpendicular to the a-axis and c-axis, respectively, are modeled. No peak profiles are assumed and thus issues related to profile fitting are avoided. Both macroscopic features, such as film thickness, and atomic-scale structure, such as dislocations, are simultaneously modeled. Simulations are run on a desktop machine. Commonly applied database-based phase identification routines can result in wrong phase identification, unless intensities are properly modeled. Modeling tools of diffractometer manufacturers are compared with the present approach. An example of how simulated reciprocal lattice patterns can be used to choose relevant measurement geometries in defected thin films is given.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

TU-C-12A-09: Modeling Pathologic Response of Locally Advanced Esophageal Cancer to Chemo-Radiotherapy Using Quantitative PET/CT Features, Clinical Parameters and Demographics

Purpose: To develop predictive models using quantitative PET/CT features for the evaluation of tumor response to neoadjuvant chemo-radiotherapy (CRT) in patients with locally advanced esophageal cancer. Methods: This study included 20 patients who underwent tri-modality therapy (CRT + surgery) and had {sup 18}F-FDG PET/CT scans before initiation of CRT and 4-6 weeks after completion of CRT but prior to surgery. Four groups of tumor features were examined: (1) conventional PET/CT response measures (SUVmax, tumor diameter, etc.); (2) clinical parameters (TNM stage, histology, etc.) and demographics; (3) spatial-temporal PET features, which characterize tumor SUV intensity distribution, spatial patterns, geometry, and associated changes resulting from CRT; and (4) all features combined. An optimal feature set was identified with recursive feature selection and cross-validations. Support vector machine (SVM) and logistic regression (LR) models were constructed for prediction of pathologic tumor response to CRT, using cross-validations to avoid model over-fitting. Prediction accuracy was assessed via area under the receiver operating characteristic curve (AUC), and precision was evaluated via confidence intervals (CIs) of AUC. Results: When applied to the 4 groups of tumor features, the LR model achieved AUCs (95% CI) of 0.57 (0.10), 0.73 (0.07), 0.90 (0.06), and 0.90 (0.06). The SVM model achieved AUCs (95% CI) of 0.56 (0.07), 0.60 (0.06), 0.94 (0.02), and 1.00 (no misclassifications). Using spatial-temporal PET features combined with conventional PET/CT measures and clinical parameters, the SVM model achieved very high accuracy (AUC 1.00) and precision (no misclassifications), significantly better than using conventional PET/CT measures or clinical parameters and demographics alone. For groups with a large number of tumor features (groups 3 and 4), the SVM model achieved significantly higher accuracy than the LR model. Conclusion: The SVM model using all features including quantitative PET/CT features accurately and precisely predicted pathologic tumor response to CRT in esophageal cancer. This work was supported in part by National Cancer Institute Grant R21 CA131979 and R01 CA172638. Shan Tan was supported in part by the National Natural Science Foundation of China 60971112 and 61375018, and by Fundamental Research Funds for the Central Universities 2012QN086.

60 APPLIED LIFE SCIENCES↗