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 343 records · Page 19

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↗

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↗

An Approach to Uncertainty Identification in the Valuation of Transactive Energy Systems

Valuation of transactive energy (TE) systems should be supported by a structured and systematic approach to uncertainty identification, assessment, and treatment in the interest of risk-informed decision making. The proposed approach, a variation of fault tree analysis, is anticipated to support valuation analysts in analyzing conventional and transactive system scenarios. This approach allows for expanding the entire tree up to the level of minute details or collapsing them to a level sufficient enough to get an overview of the problem. Quantification scheme for the described approach lends itself for valuation. The method complements value exchange analysis, simulation, and field demonstration studies. The practicality of the proposed approach is demonstrated through uncertainty assessment of the smart grid interoperability panel peak heat day scenario.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Live attenuated vaccines: Historical successes and current challenges

Live attenuated vaccines against human viral diseases have been amongst the most successful cost effective interventions in medical history. Smallpox was declared eradicated in 1980; poliomyelitis is nearing global eradication and measles has been controlled in most parts of the world. Vaccines function well for acute diseases such as these but chronic infections such as HIV are more challenging for reasons of both likely safety and probable efficacy. The derivation of the vaccines used has in general not been purely rational except in the sense that it has involved careful clinical trials of candidates and subsequent careful follow up in clinical use; the identification of the candidates is reviewed. - Highlights: • Live vaccines against human diseases caused by viruses have been very successful. • They have been developed by empirical clinical studies and problems identified in later use. • It can be difficult to balance ability to cause disease and ability to immunise for a strain. • There is currently no reliable basis for predicting success from pure virological studies. • Vaccinia, which eradicated smallpox, is the paradigm for all successes and issues.

60 APPLIED LIFE SCIENCES↗

Advanced Diagnostic and Sample Preparation Platform for Early Threat Surveillance

Emerging infectious diseases present a profound threat to global health, economic development, and political stability, and therefore represent a significant national security concern for the United States. The increased prevalence of international travel and globalized trade further amplify the threat of infectious disease outbreaks of catastrophic effect. The key to containing and eradicating an outbreak before it goes global is rapid identification of index cases and initial clusters of affected individuals. This depends upon establishment of a biosurveillance network that effectively reaches infectious disease hotspots in even the most remote regions of the world and provides a network-integrated, location-appropriate diagnostic capability. At present, there are two critical needs which must be addressed in order to extend biosurveillance activities beyond centralized laboratory facilities: 1) A simple, reliable, and safe method for immediate stabilization of clinical specimens in the field; and 2) A flexible sample processing platform that enables in-field preparation of clinical specimens for rapid, on-site analysis using a variety of diagnostic assay platforms. These needs are not necessarily mutually exclusive; in fact, we propose that they are most efficiently addressed by a deployable sample processing platform that immediately stabilizes the information content of clinical specimens through transformation of the inherently unstable analytes of interest into stable equivalents that are appropriately formatted for downstream analysis. In order to address this problem, we have developed a sample processing pipeline and microfluidics-based platform modules enabling: 1) Extraction of total RNA from finger-stick quantities of human whole blood; and 2) Microscale synthesis of appropriately-formatted cDNA products that capture the information content of blood RNA in a stable form that supports pathogen detection and/or characterization via PCR and/or Second Generation Sequencing (SGS). Through this research we have discovered new, effective solutions for problems that thus far have hindered use of digital microfluidics (DMF) in biomedical applications. Our work reveals a clear path forward to fieldable, automated sample processing systems that will enable rapid, on-site identification of usual-suspect and novel pathogens in clinical specimens for improved biosurveillance.

59 BASIC BIOLOGICAL SCIENCES↗

Overview of RFID Applications Utilizing Neural Networks

As Radio Frequency Identification (RFID) methods continue to evolve to higher levels of complexity, one form of machine learning is making its appearance. The use of Neural Networks (NN) in the RFID field is steadily increasing, and in the fields of localization and activity recognition, promising results are being shown from a variety of research. RFID applications fall primarily under two types of problems including regression and classification. We analyze RIFD localization techniques which fall under regression, and activity recognition which falls under classification. Many works don’t classify themselves as activity recognition methods, but because they fall under the classification category, we still consider them as activity recognition techniques. This research overviews the Neural Network models in the localization field based on whether they can perform independently of the environment in which they were tested. For activity recognition and accessory fields, the major methods involve tag-based and tag-free approaches. In conclusion, after the models are surveyed, a comparison study is given to examine what may be the cause for increased accuracy between different Neural Network models.

42 ENGINEERING↗

Overview: Understanding nucleation phenomena from simulations of lattice gas models

Monte Carlo simulations of homogeneous and heterogeneous nucleation in Ising/lattice gas models are reviewed with an emphasis on the general insight gained on the mechanisms by which metastable states decay. Attention is paid to the proper distinction of particles that belong to a cluster (droplet), that may trigger a nucleation event, from particles in its environment, a problem crucial near the critical point. Well below the critical point, the lattice structure causes an anisotropy of the interface tension, and hence nonspherical droplet shapes result, making the treatment nontrivial even within the conventional classical theory of homogeneous nucleation. For temperatures below the roughening transition temperature facetted crystals rather than spherical droplets result. The possibility to find nucleation barriers from a thermodynamic analysis avoiding a cluster identification on the particle level is discussed, as well as the question of curvature corrections to the interfacial tension. For the interpretation of heterogeneous nucleation at planar walls, knowledge of contact angles and line tensions is desirable, and methods to extract these quantities from simulations will be mentioned. Finally, also the problem of nucleation near the stability limit of metastable states and the significance of the spinodal curve will be discussed, in the light of simulations of Ising models with medium range interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Navigating Large Chemical Spaces Using Graph Theory and Integer Programming

Navigating and analyzing large chemical spaces are necessary to accelerate the design and discovery of new molecules and chemical processes. In this work, we introduce a computational framework that integrates graph theory and integer programming to enable the efficient navigation of large chemical spaces. Our framework represents the chemical space as a graph, wherein nodes represent molecules and edges represent the degree of similarity or connectivity based on domain-specific information. Using the graph representation, we identify representative molecules by computing the so-called minimum dominating set (MDS), which in our context is the minimum set of molecules that is connected to all other molecules. We present a suite of solution strategies for the MDS problem including heuristic and rigorous integer programming (IP) approaches. We show that these approaches allow us to capture physicochemical properties and domain-specific logic and constraints, facilitating the identification of molecules with the target properties. We demonstrate the effectiveness of the proposed approach by navigating the chemical space of per- and polyfluoroalkyl substances (PFAS); this comprises approximately 15,000 molecular structures. We compare our framework against traditional dimensionality reduction and clustering methods such as t-SNE and K-means clustering.

Chemical structure↗

Improving ICARUS track reconstruction algorithms

The ICARUS experiment is part of the Short-Baseline Neutrino program at Fermilab. Its primary objective is to explore the possible existence of sterile neutrinos in the O(1 eV) mass range and to clarify the anomalies observed in the Liquid Scintillator Neutrino Detector and MiniBooNE experiments. The ICARUS-T600 detector is a Liquid Argon Time Projection Chamber, capable of producing high-resolution 3D images and precise calorimetric measurements of ionizing particles. This technology allows for a detailed study of neutrino interactions across a broad energy range, from a few keV to several hundred GeV. The track reconstruction is achieved through a software framework that applies a series of pattern recognition algorithms, transforming raw detector signals into fully reconstructed event topologies. This process involves identifying interaction vertices, particle tracks, and electromagnetic showers within the TPC. However, in certain cases, these algorithms may mistakenly break a single particle track into several shorter segments, interpreting each as a distinct particle. Since track length is used to estimate the particle's energy, such fragmentation can result in an energy underestimation of several hundred MeV. Furthermore, when a track is split into multiple segments, the particle identification (which relies on analyzing the energy loss as a function of the residual range) may fail, potentially leading to the loss of the entire event. To mitigate this problem, we have developed a dedicated algorithm designed to identify and reconnect (“stitch”) the tracks that were erroneously divided into multiple segments.

Ricci, Alessandro Maria [Pisa U.; INFN, Pisa] (ORC↗

Effects of Phasor Measurement Uncertainty on Power Line Outage Detection

Phasor measurement unit (PMU) technology provides an effective tool to enhance the wide-area monitoring systems (WAMSs) in power grids. Although extensive studies have been conducted to develop several PMU applications in power systems (e.g., state estimation, oscillation detection and control, voltage stability analysis, and line outage detection), the uncertainty aspects of PMUs have not been adequately investigated. This paper focuses on quantifying the impact of PMU uncertainty on power line outage detection and identification, in which a limited number of PMUs installed at a subset of buses are utilized to detect and identify the line outage events. Specifically, the line outage detection problem is formulated as a multi-hypothesis test, and a general Bayesian criterion is used for the detection procedure, in which the PMU uncertainty is analytically characterized. We further apply the minimum detection error criterion for the multi-hypothesis test and derive the expected detection error probability in terms of PMU uncertainty. The framework proposed provides fundamental guidance for quantifying the effects of PMU uncertainty on power line outage detection. Case studies are provided to validate our analysis and show how PMU uncertainty influences power line outage detection.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SU-E-T-558: Monte Carlo Photon Transport Simulations On GPU with Quadric Geometry

Purpose: Monte Carlo simulation on GPU has experienced rapid advancements over the past a few years and tremendous accelerations have been achieved. Yet existing packages were developed only in voxelized geometry. In some applications, e.g. radioactive seed modeling, simulations in more complicated geometry are needed. This abstract reports our initial efforts towards developing a quadric geometry module aiming at expanding the application scope of GPU-based MC simulations. Methods: We defined the simulation geometry consisting of a number of homogeneous bodies, each specified by its material composition and limiting surfaces characterized by quadric functions. A tree data structure was utilized to define geometric relationship between different bodies. We modified our GPU-based photon MC transport package to incorporate this geometry. Specifically, geometry parameters were loaded into GPU’s shared memory for fast access. Geometry functions were rewritten to enable the identification of the body that contains the current particle location via a fast searching algorithm based on the tree data structure. Results: We tested our package in an example problem of HDR-brachytherapy dose calculation for shielded cylinder. The dose under the quadric geometry and that under the voxelized geometry agreed in 94.2% of total voxels within 20% isodose line based on a statistical t-test (95% confidence level), where the reference dose was defined to be the one at 0.5cm away from the cylinder surface. It took 243sec to transport 100million source photons under this quadric geometry on an NVidia Titan GPU card. Compared with simulation time of 99.6sec in the voxelized geometry, including quadric geometry reduced efficiency due to the complicated geometry-related computations. Conclusion: Our GPU-based MC package has been extended to support photon transport simulation in quadric geometry. Satisfactory accuracy was observed with a reduced efficiency. Developments for charged particle transport in this geometry are currently in progress.

61 RADIATION PROTECTION AND DOSIMETRY↗

Structural and Functional Proteomic Analysis of a Developing Energy Transducing Membrane

While much is known about the light reactions of photosynthesis in purple bacteria, comparatively little information is available on how the requisite integral membrane proteins are assembled, their patterns of cellular localization are established or their apoproteins cooperate with numerous assembly factors in their insertion into the growing intracytoplasmic membrane (ICM). This problem was approached through a detailed structural and functional proteomic analysis of ICM assembly process in the well-characterized purple bacterium Rhodobacter sphaeroides. Proteomic approaches have focused upon identification of membrane proteins temporally expressed during ICM development and spatially localized in both membrane growth initiation sites and in mature ICM vesicles. Protocols were established for ICM induction under reduced aeration and ICM remodeling in cells adapting to low intensity illumination, which permitted isolation, in sucrose density gradients, of ICM growth initiation sites as an upper pigmented band (UPB) and mature ICM vesicles as the main (chromatophore) band. Non-denaturing clear native gel electrophoresis (CNE) of these isolated membrane fractions gave rise to pigmented bands containing the peripheral light-harvesting 2 (LH2) antenna and the reaction center-light-harvesting 1 (RC-LH1) core complex, together with a full array of other ICM proteins, which were subjected to proteomic analysis.

14 SOLAR ENERGY↗

Occupancy-Based HVAC Control with Short-Term Occupancy Prediction Algorithms for Energy-Efficient Buildings

This study aims to develop a concrete occupancy prediction as well as an optimal occupancy-based control solution for improving the efficiency of Heating, Ventilation, and Air-Conditioning (HVAC) systems. Accurate occupancy prediction is a key enabler for demand-based HVAC control so as to ensure HVAC is not run needlessly when when a room/zone is unoccupied. In this paper, we propose simple yet effective algorithms to predict occupancy alongside an algorithm for automatically assigning temperature set-points. Utilizing past occupancy observations, we introduce three different techniques for occupancy prediction. Firstly, we propose an identification-based approach, which identifies the model via Expectation Maximization (EM) algorithm. Secondly, we study a novel finite state automata (FSA) which can be reconstructed by a general systems problem solver (GSPS). Thirdly, we introduce an alternative stochastic model based on uncertain basis functions. The results show that all the proposed occupancy prediction techniques could achieve around 70% accuracy. Then, we have proposed a scheme to adaptively adjust the temperature set-points according to a novel temperature set algorithm with customers’ different discomfort tolerance indexes. By cooperating with the temperature set algorithm, our occupancy-based HVAC control shows 20% energy saving while still maintaining building comfort requirements.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Online Identification of Power Required for Self-Sustainability of the Battery in Hybrid Electric Vehicles

Hybrid electric vehicles have shown great potential for enhancing fuel economy and reducing emissions. Deriving a power management control policy to distribute the power demanded by the driver optimally to the available subsystems (e.g., the internal combustion engine, motor, generator, and battery) has been a challenging control problem. One of the main aspects of the power management control algorithms is concerned with the self-sustainability of the electrical path, which must be guaranteed for the entire driving cycle. This paper considers the problem of identifying online the power required by the battery to maintain the state of charge within a range of the target value. An algorithm is presented that realizes how much power the engine needs to provide to the battery so that self-sustainability of the electrical path is maintained.

fuel economy↗

Fast Uncovering of Graph Communities on a Chip: Toward Scalable Community Detection on Multicore and Manycore Platforms

Graph representations are pervasive in scientific and social computing. They serve as vital tools to model the interplay among different interacting entities. In this paper, we visit the problem of community detection, which is one of the most widely used graph operations toward scientific discovery. Community detection refers to the process of identifying tightly-knit subgroups of vertices in a large graph. These sub-groups (or communities) represent vertices that are tied together through common structure or function. Identification of communities could help in understanding the modular organization of complex networks. However, owing to large data sizes and high computational costs, performing community detection at scale has become increasingly challenging. Here, we present a detailed review and analysis of some of the leading computational methods and implementations developed for executing community detection on modern day multicore and manycore architectures. Our goals are to: a) define the problem of community detection and highlight its scientific significance; b) relate to challenges in parallelizing the operation on modern day architectures; c) provide a detailed report and taxonomical classification of the approaches that have been designed for various architectures; and d) finally, provide insights into the strengths and suitability of different architectures for community detection, and a preview into the future trends of the area. It is our hope that this detailed treatment of community detection on parallel architectures can serve as an exemplar study for extending the application of modern day multicore and manycore architectures to other complex graph applications.

community detection, multithreaded platforms↗