Search NASA⌕ Search

SEARCH · Search NASA

Results for “connected components”

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 91 records · Page 5

Regression-based approach to modeling emerging HVAC technologies in EnergyPlus: A case study using a Vuilleumier-cycle heat pump

This paper presents a regression-based approach for modeling emerging heating, ventilation, and air-conditioning (HVAC) technologies using the user-defined coil object in the building simulation software EnergyPlus. The approach can use output from HVAC system models or experimental data to create regression-based performance curves, which are then used within the building simulation. The regression approach is an alternative to modeling new HVAC technologies directly in EnergyPlus or performing co-simulation with a system model in a separate program. The proposed approach connects component and system level designs, and their associated performance, with annual energy use and costs in a variety of climates. This study focused on a Vuilleumier-cycle heat pump for a commercial building. We describe (1) the design and modeling of this system, (2) methods for translating this performance into a simplified model in EnergyPlus, and (3) building energy simulation results in United States climate zones 4-6. The results predict that the Vuilleumier-cycle heat pump will use 34 to 44% less source heating energy than an 80% efficient gas furnace, and more source cooling energy than a SEER 13 air conditioner. Total energy costs are lower when electricity prices are high and natural gas prices are low.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existing graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.

97 MATHEMATICS AND COMPUTING↗

Streaming data analytics via message passing with application to graph algorithms

The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. We describe a lightweight, portable framework named PHISH which enables a set of independent processes to compute on a stream of data in a distributed-memory parallel manner. Datums are routed between processes in patterns defined by the application. PHISH can run on top of either message-passing via MPI or sockets via ZMQ. The former means streaming computations can be run on any parallel machine which supports MPI; the latter allows them to run on a heterogeneous, geographically dispersed network of machines. We illustrate how PHISH can support streaming MapReduce operations, and describe streaming versions of three algorithms for large, sparse graph analytics: triangle enumeration, subgraph isomorphism matching, and connected component finding. Lastly, we also provide benchmark timings for MPI versus socket performance of several kernel operations useful in streaming algorithms.

97 MATHEMATICS AND COMPUTING↗

A Quantum-Based Approach to Predict Primary Radiation Damage in Polymeric Networks

Initial atomistic-level radiation damage in chemically reactive materials is thought to induce reaction cascades that can result in undesirable degradation of macroscale properties. Ensembles of quantum-based molecular dynamics (QMD) simulations can accurately predict these cascades, but extracting chemical insights from the many underlying trajectories is a labor-intensive process that can require substantial a priori intuition. We develop here a general and automated graph-based approach to extract all chemically distinct structures sampled in QMD simulations and apply our approach to predict primary radiation damage of polydimethylsiloxane (PDMS), the main constituent of silicones. A postprocessing protocol is developed to identify underlying polymer backbone structures as connected components in QMD trajectories. Furthermore, these backbones form a repository of radiation-damaged structures. A scheme for extracting and updating a library of isomorphically distinct structures is proposed to identify the spanning set and aid chemical interpretation of the repository. The analyses are applied to ensembles of cascade QMD simulations in which the four element types in PDMS are selectively excited in primary knock-on atom events. Our approach reveals a much higher degree of combinatorial complexity in this system than was inferred through radiolysis experiments. Probabilities are extracted for radiation-induced network changes including formation of branch points, carbon linkages, cycles, bond scissions, and carbon uptake into the Si–O siloxane backbone network. The general analysis framework presented here is readily extendable to modeling chemical degradation of other polymers and molecular materials and provides a basis for future quantum-informed multiscale modeling of radiation damage.

36 MATERIALS SCIENCE↗

De Novo Sequencing of Peptides from Top-Down Tandem Mass Spectra

De novo sequencing of proteins and peptides is one of the most important problems in mass spectrometry-driven proteomics. A variety of methods have been developed to accomplish this task from a set of bottom-up tandem (MS/MS) mass spectra. However, a more recently emerged top-down technology, now gaining more and more popularity, opens new perspectives for protein analysis and characterization, implying a need in efficient algorithms for processing this kind of MS/MS data. Here we describe a method that allows to retrieve from a set of top-down MS/MS spectra long and accurate sequence fragments of the proteins contained in a sample. To this end, we outline a strategy for generating high-quality sequence tags from top-down spectra, and introduce the concept of a T-Bruijn graph by adapting to the case of tags the notion of an A-Bruijn graph widely used in genomics. The output of the proposed approach represents the set of amino acid strings spelled out by optimal paths in the connected components of a T-Bruijn graph. We illustrate its performance on top-down datasets acquired from carbonic anhydrase 2 (CAH2) and the Fab region of alemtuzumab.

Environmental Molecular Sciences Laboratory↗

Branes in Poisson sigma models

In this review we discuss possible boundary conditions (branes) for the Poisson sigma model. We show how to carry out the perturbative quantization in the presence of a general pre-Poisson brane and how this is related to the deformation quantization of Poisson structures. We conclude with an open problem: the perturbative quantization of the system when the boundary has several connected components and we use a different pre-Poisson brane in every component.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fermionic Tunneling Effect and Hawking Radiation in a Non Commutative FRW Universe

The formalism of a non commutative gauge gravity is applied to an FRW universe and the corresponding modified metric, veirbein and spin connection components are obtained. Moreover, using the Hamilton-Jacobi method and as a pure space-time deformation effect, the NCG Hawking radiation via a fermionic tunneling transition through the dynamical NCG horizon is also studied.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On the reflection type decomposition of the adjoint reduced phase space of a compact semisimple Lie group

We consider a system with symmetries whose configuration space is a compact Lie group, acted upon by inner automorphisms. The classical reduced phase space of this system decomposes into connected components of orbit type subsets. To investigate hypothetical quantum effects of this decomposition one has to construct the associated costratification of the Hilbert space of the quantum system in the sense of Huebschmann. In the present paper, instead of the decomposition by orbit types, we consider the related decomposition by reflection types (conjugacy classes of reflection subgroups). These two decompositions turn out to coincide, e.g., for the classical groups SU(n) and Sp(n). We derive defining relations for reflection type subsets in terms of irreducible characters and discuss how to obtain from that the corresponding costratification of the Hilbert space of the system. To illustrate the method, we give explicit results for some low rank classical groups.

97 MATHEMATICS AND COMPUTING↗

Existence of multi-bump solutions for a class of Kirchhoff type problems in R{sup 3}

Using variational methods, we establish existence of multi-bump solutions for a class of Kirchhoff type problems −(a+b∫{sub R{sup 3}}|∇u|{sup 2}dx)Δu+λV(x)u=f(u), where f is a continuous function with subcritical growth, V(x) is a critical frequency in the sense that inf{sub x∈R{sup 3}}V(x)=0. We show that if the zero set of V(x) has several isolated connected components Ω{sub 1}, …, Ω{sub k} such that the interior of Ω{sub i} is not empty and ∂Ω{sub i} is smooth, then for λ > 0 large there exists, for any non-empty subset J ⊂ (1, …, k), a bump solution is trapped in a neighborhood of ∪{sub j∈J}Ω{sub j}.

97 MATHEMATICS AND COMPUTING↗

On the space of connections having non-trivial twisted harmonic spinors

We consider Dirac operators on odd-dimensional compact spin manifolds which are twisted by a product bundle. We show that the space of connections on the twisting bundle which yields an invertible operator has infinitely many connected components if the untwisted Dirac operator is invertible and the dimension of the twisting bundle is sufficiently large.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward the “platinum standard” of quantum chemistry on quantum computers: Perturbative quadruple corrections in unitary coupled cluster theory

We propose a non-iterative, post-hoc correction to the unitary coupled cluster theory with the single, double, and triple excitations (UCCSDT) Ansatz, which considers the leading-order effects of neglected quadruple excitations. We present two ways to derive this correction, henceforth referred to as [Q-6], which leads to an improvement in the correlation energy shown to be truncated to sixth-order in many-body perturbation theory. Furthermore, a comparison between the UCC-based [Q-6] correction proposed in this work and analogous, “platinum standard” quadruple corrections proposed in conventional coupled cluster theory recognizes that [Q-6] is distinct from prior corrections since it is constructed entirely from internally connected components. Although trotterized (t) and full operator variants of UCCSDT exhibit errors in scans of small molecule potential energy surfaces that routinely exceed 1.6 mH, we find that t/UCCSDT[Q-6] is, nevertheless, able to achieve chemical accuracy as measured by the mean unsigned error.

Correlation energy↗

Lower bounds for the half-plane capacity of compact sets and symmetrization

Given a bounded relatively closed subset E of the upper half-plane H={l_brace}z:Imz>0{r_brace}, a new representation of the half-plane capacity of E is obtained in terms of the inner radius of the connected component of the set H/E which goes off to infinity. For this capacity, new lower bounds in terms of the capacities of sets obtained by application of a series of geometric transformations of the set E, including the Steiner and circular symmetrizations, are established, and its behaviour under linear and radial averaging transformations of families of compact sets {l_brace}E{sub k{r_brace}k=1}{sup n} is examined. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗

Topological features of the Sokolov integrable case on the Lie algebra so(3,1)

The integrable Sokolov case on so(3,1){sup ⋆} is investigated. This is a Hamiltonian system with two degrees of freedom, in which the Hamiltonian and the additional integral are homogeneous polynomials of degrees 2 and 4, respectively. It is an interesting feature of this system that connected components of common level surfaces of the Hamiltonian and the additional integral turn out to be noncompact. The critical points of the moment map and their indices are found, the bifurcation diagram is constructed, and the topology of noncompact level surfaces is determined, that is, the closures of solutions of the Sokolov system on so(3,1) are described. Bibliography: 24 titles.

97 MATHEMATICS AND COMPUTING↗

Approximating the trajectory attractor of the 3D Navier-Stokes system using various α-models of fluid dynamics

We study the limit as α→0+ of the long-time dynamics for various approximate α-models of a viscous incompressible fluid and their connection with the trajectory attractor of the exact 3D Navier-Stokes system. The α-models under consideration are divided into two classes depending on the orthogonality properties of the nonlinear terms of the equations generating every particular α-model. We show that the attractors of α-models of class I have stronger properties of attraction for their trajectories than the attractors of α-models of class II. We prove that for both classes the bounded families of trajectories of the α-models considered here converge in the corresponding weak topology to the trajectory attractor A{sub 0} of the exact 3D Navier-Stokes system as time t tends to infinity. Furthermore, we establish that the trajectory attractor A{sub α} of every α-model converges in the same topology to the attractor A{sub 0} as α→0+. We construct the minimal limits A{sub min}⊆A{sub 0} of the trajectory attractors A{sub α} for all α-models as α→0+. We prove that every such set A{sub min} is a compact connected component of the trajectory attractor A{sub 0}, and all the A{sub min} are strictly invariant under the action of the translation semigroup.Bibliography: 39 titles.

97 MATHEMATICS AND COMPUTING↗

A neural network clustering algorithm for the ATLAS silicon pixel detector

A novel technique to identify and split clusters created by multiple charged particles in the ATLAS pixel detector using a set of artificial neural networks is presented. Such merged clusters are a common feature of tracks originating from highly energetic objects, such as jets. Neural networks are trained using Monte Carlo samples produced with a detailed detector simulation. This technique replaces the former clustering approach based on a connected component analysis and charge interpolation. The performance of the neural network splitting technique is quantified using data from proton-proton collisions at the LHC collected by the ATLAS detector in 2011 and from Monte Carlo simulations. This technique reduces the number of clusters shared between tracks in highly energetic jets by up to a factor of three. It also provides more precise position and error estimates of the clusters in both the transverse and longitudinal impact parameter resolution.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Finding Regions of Interest on Toroidal Meshes

Fusion promises to provide clean and safe energy, and a considerable amount of research effort is underway to turn this aspiration intoreality. This work focuses on a building block for analyzing data produced from the simulation of microturbulence in magnetic confinementfusion devices: the task of efficiently extracting regions of interest. Like many other simulations where a large amount of data are produced,the careful study of ``interesting'' parts of the data is critical to gain understanding. In this paper, we present an efficient approach forfinding these regions of interest. Our approach takes full advantage of the underlying mesh structure in magnetic coordinates to produce acompact representation of the mesh points inside the regions and an efficient connected component labeling algorithm for constructingregions from points. This approach scales linearly with the surface area of the regions of interest instead of the volume as shown with bothcomputational complexity analysis and experimental measurements. Furthermore, this new approach is 100s of times faster than a recentlypublished method based on Cartesian coordinates.

97 MATHEMATICS AND COMPUTING↗

Morse Theory without Non-Degeneracy

Abstract We describe an extension of Morse theory to smooth functions on compact Riemannian manifolds, without any non-degeneracy assumptions except that the critical locus must have only finitely many connected components.

Mathematics↗