Search NASA⌕ Search

SEARCH · Search NASA

Results for “identification problem”

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 883 records · Page 49

Recent Experiences in Multidisciplinary Analysis and Optimization, part 1

Papers presented at the NASA Symposium on Recent Experiences in Multidisciplinary Analysis and Optimization held at NASA Langley Research Center, Hampton, Virginia April 24 to 26, 1984 are given. The purposes of the symposium were to exchange information about the status of the application of optimization and associated analyses in industry or research laboratories to real life problems and to examine the directions of future developments. Information exchange has encompassed the following: (1) examples of successful applications; (2) attempt and failure examples; (3) identification of potential applications and benefits; (4) synergistic effects of optimized interaction and trade-offs occurring among two or more engineering disciplines and/or subsystems in a system; and (5) traditional organization of a design process as a vehicle for or an impediment to the progress in the design methodology.

Sobieski, J.↗

Radar signal categorization using a neural network

Neural networks were used to analyze a complex simulated radar environment which contains noisy radar pulses generated by many different emitters. The neural network used is an energy minimizing network (the BSB model) which forms energy minima - attractors in the network dynamical system - based on learned input data. The system first determines how many emitters are present (the deinterleaving problem). Pulses from individual simulated emitters give rise to separate stable attractors in the network. Once individual emitters are characterized, it is possible to make tentative identifications of them based on their observed parameters. As a test of this idea, a neural network was used to form a small data base that potentially could make emitter identifications.

Anderson, James A.↗

Solutions Network Formulation Report. Landsat Data Continuity Mission Simulated Data Products for Bureau of Land Management and Environmental Protection Agency Abandoned Mine Lands Decision Support

Presently, the BLM (Bureau of Land Management) has identified a multitude of abandoned mine sites in primarily Western states for cleanup. These sites are prioritized and appropriate cleanup has been called in to reclaim the sites. The task is great in needing considerable amounts of agency resources. For instance, in Colorado alone there exists an estimated 23,000 abandoned mines. The problem is not limited to Colorado or to the United States. Cooperation for reclamation is sought at local, state, and federal agency level to aid in identification, inventory, and cleanup efforts. Dangers posed by abandoned mines are recognized widely and will tend to increase with time because some of these areas are increasingly used for recreation and, in some cases, have been or are in the process of development. In some cases, mines are often vandalized once they are closed. The perpetrators leave them open, so others can then access the mines without realizing the danger posed. Abandoned mine workings often fill with water or oxygen-deficient air and dangerous gases following mining. If the workings are accidentally entered into, water or bad air can prove fatal to those underground. Moreover, mine residue drainage negatively impacts the local watershed ecology. Some of the major hazards that might be monitored by higher-resolution satellites include acid mine drainage, clogged streams, impoundments, slides, piles, embankments, hazardous equipment or facilities, surface burning, smoke from underground fires, and mine openings.

Estep, Leland↗

Dalitz Plot Analysis of B{sup -{yields}}D{sup +{pi}-{pi}-}

We present a Dalitz plot analysis of B{sup -{yields}}D{sup +{pi}-{pi}-} decays, based on a sample of about 383 million {Upsilon}(4S){yields}BB-bar decays collected by the BABAR detector at the PEP-II asymmetric-energy B Factory at SLAC. The analysis has been published previously in [1]. We measure the inclusive branching fraction of the three-body decay to be B(B{sup -{yields}}D{sup +{pi}+{pi}-}) = (1.08{+-}0.03(stat){+-}0.05(syst))x10{sup -3}. We observe the established D{sub 2}*{sup 0} and confirm the existence of D{sub 0}*{sup 0} in their decays to D{sup +{pi}-}, where the D{sub 2}*{sup 0} and D{sub 0}*{sup 0} are the 2{sup +} and 0{sup +} cu-bar P-wave states, respectively. We measure the masses and widths of D{sub 2}*{sup 0} and {Gamma}D{sub 0}*{sup 0} to be: mD{sub 2}* = (2460.4{+-}1.2{+-}1.2{+-}1.9) MeV/c{sup 2}, {Gamma}D{sub 2}* = (41.8{+-}2.5{+-}2.1{+-}2.0) MeV, mD{sub 0}* = (2297{+-}8{+-}5{+-}19) MeV/c{sup 2}, {Gamma}D{sub 0}* = (273{+-}12{+-}17{+-}45) MeV. The stated errors reflect the statistical and systematic uncertainties, and the uncertainty related to the assumed composition of signal events and the theoretical model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Metal artifact reduction in x-ray computed tomography (CT) by constrained optimization

Purpose: The streak artifacts caused by metal implants have long been recognized as a problem that limits various applications of CT imaging. In this work, the authors propose an iterative metal artifact reduction algorithm based on constrained optimization. Methods: After the shape and location of metal objects in the image domain is determined automatically by the binary metal identification algorithm and the segmentation of ''metal shadows'' in projection domain is done, constrained optimization is used for image reconstruction. It minimizes a predefined function that reflects a priori knowledge of the image, subject to the constraint that the estimated projection data are within a specified tolerance of the available metal-shadow-excluded projection data, with image non-negativity enforced. The minimization problem is solved through the alternation of projection-onto-convex-sets and the steepest gradient descent of the objective function. The constrained optimization algorithm is evaluated with a penalized smoothness objective. Results: The study shows that the proposed method is capable of significantly reducing metal artifacts, suppressing noise, and improving soft-tissue visibility. It outperforms the FBP-type methods and ART and EM methods and yields artifacts-free images. Conclusions: Constrained optimization is an effective way to deal with CT reconstruction with embedded metal objects. Although the method is presented in the context of metal artifacts, it is applicable to general ''missing data'' image reconstruction problems.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Multivariable frequency domain identification via 2-norm minimization

The author develops a computational approach to multivariable frequency domain identification, based on 2-norm minimization. In particular, a Gauss-Newton (GN) iteration is developed to minimize the 2-norm of the error between frequency domain data and a matrix fraction transfer function estimate. To improve the global performance of the optimization algorithm, the GN iteration is initialized using the solution to a particular sequentially reweighted least squares problem, denoted as the SK iteration. The least squares problems which arise from both the SK and GN iterations are shown to involve sparse matrices with identical block structure. A sparse matrix QR factorization method is developed to exploit the special block structure, and to efficiently compute the least squares solution. A numerical example involving the identification of a multiple-input multiple-output (MIMO) plant having 286 unknown parameters is given to illustrate the effectiveness of the algorithm.

Bayard, David S.↗

Excited state baryon spectroscopy from lattice QCD

Here, we present a calculation of the Nucleon and Delta excited state spectrum on dynamical anisotropic clover lattices. A method for operator construction is introduced that allows for the reliable identification of the continuum spins of baryon states, overcoming the reduced symmetry of the cubic lattice. Using this method, we are able to determine a spectrum of single-particle states for spins up to and including $J = 7/2$, of both parities, the first time this has been achieved in a lattice calculation. We find a spectrum of states identifiable as admixtures of $SU(6) Ⓧ O(3)$ representations and a counting of levels that is consistent with the non-relativistic $qqq$ constituent quark model. This dense spectrum is incompatible with quark-diquark model solutions to the "missing resonance problem" and shows no signs of parity doubling of states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated Coronal Loop Identification Using Digital Image Processing Techniques

The results of a master thesis project on a study of computer algorithms for automatic identification of optical-thin, 3-dimensional solar coronal loop centers from extreme ultraviolet and X-ray 2-dimensional images will be presented. These center splines are proxies of associated magnetic field lines. The project is pattern recognition problems in which there are no unique shapes or edges and in which photon and detector noise heavily influence the images. The study explores extraction techniques using: (1) linear feature recognition of local patterns (related to the inertia-tensor concept), (2) parametric space via the Hough transform, and (3) topological adaptive contours (snakes) that constrains curvature and continuity as possible candidates for digital loop detection schemes. We have developed synthesized images for the coronal loops to test the various loop identification algorithms. Since the topology of these solar features is dominated by the magnetic field structure, a first-order magnetic field approximation using multiple dipoles provides a priori information in the identification process. Results from both synthesized and solar images will be presented.

Lee, Jong K.↗

Flame Spread Across Liquids

The principal goal of our recent research on flame spread across liquid pools is the detailed identification of the mechanisms that control the rate and nature of flame spread when the liquid pool is initially at an isothermal bulk temperature that is below the fuel's flash point temperature. In our project, we specialize the subject to highlight the roles of buoyancy-related processes regarding the mechanisms of flame spread, an area of research cited recently by Linan and Williams as one that needs further attention and which microgravity (micro-g) experiments could help to resolve. Toward resolving the effects of buoyancy on this flame spread problem, comparisons - between 1-g and micro-g experimental observations, and between model predictions and experimental data at each of these gravitational levels - are extensively utilized. The present experimental and computational foundation is presented to support identification of the mechanisms that control flame spread in the pulsating flame spread regime for which long-duration, micro-g flame spread experiments have been conducted aboard a sounding rocket.

Ross, Howard D.↗

Genomic Island Identification Software v 1.0

Genomic islands are key mobile DNA elements in bacterial evolution, that can distinguish pathogenic strains from each other, or distinguish pathogenic strains from non-pathogenic strains. Their detection in genomes is a challenging problem. We present 3 main software components that attack the island detection problem on two different bases: 1) the preference of islands to insert in chromosomal tRNA or tmRNA genes (islander.pl), and 2) islands' sporadic occurrence among closely related strains. The latter principle is employed in both an algorithm (learnedPhyloblocks.pl) and a visualization method (panGenome.pl). Component islander.pl finds islands based on their preference for a particular target gene type. We annotate each tRNA and tmRNA gene, find fragments of each such gene as candidates for the distal ends of islands, and filter candidates to remove false positives. Component learnedPhyloblocks.pl uses islands found by islander.pl and other methods as a training set to find new islands. Reference genomes are aligned using mugsy, then the "phylotypes" or patterns of occurrence in the reference set are determined for each position in the target genome, and those phylotypes most enriched in the training set of islands are followed to detect yet more islands. Component panGenome.pl produces a big-data visualization of the chromosomally-ordered "pan-genome", that includes every gene of every reference genome (x-axis, pan-genome order; y-axis, reference genomes; color-coding, gene presence/absence etc.), islands appearing as dark patches.

Williams, KellyPorter↗

Genomic Island Identification Software v 1.0

Genomic islands are key mobile DNA elements in bacterial evolution, that can distinguish pathogenic strains from each other, or distinguish pathogenic strains from non-pathogenic strains. Their detection in genomes is a challenging problem. We present 3 main software components that attack the island detection problem on two different bases: 1) the preference of islands to insert in chromosomal tRNA or tmRNA genes (islander.pl), and 2) islands' sporadic occurrence among closely related strains. The latter principle is employed in both an algorithm (learnedPhyloblocks.pl) and a visualization method (panGenome.pl). Component islander.pl finds islands based on their preference for a particular target gene type. We annotate each tRNA and tmRNA gene, find fragments of each such gene as candidates for the distal ends of islands, and filter candidates to remove false positives. Component learnedPhyloblocks.pl uses islands found by islander.pl and other methods as a training set to find new islands. Reference genomes are aligned using mugsy, then the "phylotypes" or patterns of occurrence in the reference set are determined for each position in the target genome, and those phylotypes most enriched in the training set of islands are followed to detect yet more islands. Component panGenome.pl produces a big-data visualization of the chromosomally-ordered "pan-genome", that includes every gene of every reference genome (x-axis, pan-genome order; y-axis, reference genomes; color-coding, gene presence/absence etc.), islands appearing as dark patches.

Source record↗

A Reinforcement Learning Hyper-Heuristic in Multi-Objective Optimization with Application to Structural Damage Identification

Multi-objective optimization allows satisfying multiple decision criteria concurrently, and generally yields multiple solutions. It has the potential to be applied to structural damage identification applications which are oftentimes under-determined. How to achieve high-quality solutions in terms of accuracy, diversity, and completeness is a challenging research subject. The solution techniques and parametric selections are believed to be problem specific. In this research, we formulate a reinforcement learning hyper-heuristic scheme to work coherently with the single-point search algorithm MOSA/R (Multi-Objective Simulated Annealing Algorithm based on Re-seed). The four low-level heuristics proposed can meet various optimization requirements adaptively and autonomously using the domination amount, crowding distance, and hypervolume calculations. The new approach exhibits improved and more robust performance than AMOSA, NSGA-II, and MOEA/D when applied to benchmark test cases. It is then applied to an active damage interrogation scheme for structural damage identification where solution diversity/completeness and accuracy are critically important. Results show that this approach can successfully include the true damage scenario in the solution set identified. The outcome of this research can potentially be extended to a variety of applications.

Pei Cao↗

Relativistic MR-MP energy levels: Low-lying states in the Mg isoelectronic sequence

The relativistic Multi-Reference Møller–Plesset (MR-MP) many-body perturbation theory was applied to calculate the energies of all excited states within the 3s3p, 3p{sup 2}, 3s3d, 3p3d and 3d{sup 2} configurations for every ion of the Mg isoelectronic sequence (Z=12−100). The results are compared with previous calculations and available experimental data. The MR-MP excitation energies agree with experiment typically within 100 ppm over a wide range of Z, particularly for mid- and high-range Z. Experimental data for highly charged ions in this isoelectronic sequence are limited and the complete and accurate dataset presented here is expected to ease the identification process upon measurements.

74 ATOMIC AND MOLECULAR PHYSICS↗

Toroidal regularization of the guiding center Lagrangian

In the Lagrangian theory of guiding center motion, an effective magnetic field B* = B+ (m/e)v ∥ ∇ x b appears prominently in the equations of motion. Because the parallel component of this field can vanish, there is a range of parallel velocities where the Lagrangian guiding center equations of motion are either ill-defined or very badly behaved. Moreover, the velocity dependence of B* greatly complicates the identification of canonical variables and therefore the formulation of symplectic integrators for guiding center dynamics. Here, this letter introduces a simple coordinate transformation that alleviates both these problems simultaneously. In the new coordinates, the Liouville volume element is equal to the toroidal contravariant component of the magnetic field. Consequently, the large-velocity singularity is completely eliminated. Moreover, passing from the new coordinate system to canonical coordinates is extremely simple, even if the magnetic field is devoid of flux surfaces. We demonstrate the utility of this approach in regularizing the guiding center Lagrangian by presenting a new and stable one-step variational integrator for guiding centers moving in arbitrary time-dependent electromagnetic fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Online Parameter Estimation Methods for Adaptive Cruise Control Systems

Modeling Adaptive Cruise Control (ACC) vehicles enables the understanding of the impact of these vehicles on traffic flow. In this work, two online methods are used to provide real time system identification of ACC enabled vehicles. The first technique is a recursive least squares (RLS) approach, while the second method solves a nonlinear joint state and parameter estimation problem via particle filtering (PF). We provide a parameter identifiability analysis for both methods to analytically show that the model parameters are not identifiable using equilibrium driving. The accuracy and computational runtime of the online methods are compared to a commonly used offline simulation-based optimization (i.e., batch optimization) approach. The methods are tested on synthetic data as well as on empirical data collected directly from a 2019 model year ACC vehicle using data from sensors that are part of the stock ACC system. The online methods are scalable and provide comparable accuracy to the batch method. RLS runs in real time and is two orders of magnitude faster than the batch method for modest sized (e.g., 15 min) datasets. The particle filter also runs in real- time, and is also suitable in streaming applications in which the datasets can grow arbitrarily large.

33 ADVANCED PROPULSION SYSTEMS↗

Prior knowledge driven Granger causality analysis on gene regulatory network discovery

Our study focuses on discovering gene regulatory networks from time series gene expression data using the Granger causality (GC) model. However, the number of available time points (T) usually is much smaller than the number of target genes (n) in biological datasets. The widely applied pairwise GC model (PGC) and other regularization strategies can lead to a significant number of false identifications when n>>T. In this study, we proposed a new method, viz., CGC-2SPR (CGC using two-step prior Ridge regularization) to resolve the problem by incorporating prior biological knowledge about a target gene data set. In our simulation experiments, the propose new methodology CGC-2SPR showed significant performance improvement in terms of accuracy over other widely used GC modeling (PGC, Ridge and Lasso) and MI-based (MRNET and ARACNE) methods. In addition, we applied CGC-2SPR to a real biological dataset, i.e., the yeast metabolic cycle, and discovered more true positive edges with CGC-2SPR than with the other existing methods. In our research, we noticed a “ 1+1>2” effect when we combined prior knowledge and gene expression data to discover regulatory networks. Based on causality networks, we made a functional prediction that the Abm1 gene (its functions previously were unknown) might be related to the yeast’s responses to different levels of glucose. In conclusion, our research improves causality modeling by combining heterogeneous knowledge, which is well aligned with the future direction in system biology. Furthermore, we proposed a method of Monte Carlo significance estimation (MCSE) to calculate the edge significances which provide statistical meanings to the discovered causality networks. All of our data and source codes will be available under the link https://bitbucket.org/dtyu/granger-causality/wiki/Home.

60 APPLIED LIFE SCIENCES↗

A Ganymede lander mission

The paper addresses the dynamical problem and question of technical feasibility associated with delivering a simple, semi-hard lander to one of the Galilean satellites, Ganymede. Emphasis is placed on the identification of a viable, not necessarily optimal, baseline trajectory and maneuver sequence. Simplicity is stressed in the lander's use of two fixed-impulse solid rockets for landing maneuvers. It is shown through an error analysis that navigation and maneuver execution errors can be compensated on the baseline descent trajectory by controlling just the thrust direction. Finally, specific subsystem capabilities needed on the lander to achieve a successful touchdown within a specific performance envelope are also identified.

Boain, R. J.↗

Robust detection-isolation-accommodation for sensor failures

The results of a one year study to: (1) develop a theory for Robust Failure Detection and Identification (FDI) in the presence of model uncertainty, (2) develop a design methodology which utilizes the robust FDI ththeory, (3) apply the methodology to a sensor FDI problem for the F-100 jet engine, and (4) demonstrate the application of the theory to the evaluation of alternative FDI schemes are presented. Theoretical results in statistical discrimination are used to evaluate the robustness of residual signals (or parity relations) in terms of their usefulness for FDI. Furthermore, optimally robust parity relations are derived through the optimization of robustness metrics. The result is viewed as decentralization of the FDI process. A general structure for decentralized FDI is proposed and robustness metrics are used for determining various parameters of the algorithm.

Weiss, J. L.↗