Search NASA⌕ Search

SEARCH · Search NASA

Results for “TOPOLOGICAL MAPPING”

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 19 records

Mapping topological order in coordinate space

The organization of the electrons in the ground state is classified by means of topological invariants, defined as global properties of the wave function. Here we address the Chern number of a two-dimensional insulator and we show that the corresponding topological order can be mapped by means of a ''topological marker'', defined in r space, and which may vary in different regions of the same sample. Notably, this applies equally well to periodic and open boundary conditions. Simulations over a model Hamiltonian validate our theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TGE: Machine Learning Based Task Graph Embedding for Large-Scale Topology Mapping

Task mapping is an important problem in parallel and distributed computing. The goal in task mapping is to find an optimal layout of the processes of an application (or a task) onto a given network topology. We target this problem in the context of staging applications. A staging application consists of two or more parallel applications (also referred to as staging tasks) which run concurrently and exchange data over the course of computation. Task mapping becomes a more challenging problem in staging applications, because not only data is exchanged between the staging tasks, but also the processes of a staging task may exchange data with each other. We propose a novel method, called Task Graph Embedding (TGE), that harnesses the observable graph structures of parallel applications and network topologies. TGE employs a machine learning based algorithm to find the best representation of a graph, called an embedding, onto a space in which the task-to-processor mapping problem can be solved. We evaluate and demonstrate the effectiveness of TGE experimentally with the communication patterns extracted from runs of XGC, a large-scale fusion simulation code, on Titan.

Choi, Jong Youl↗

System and method of mapping topology

A system for determining a fingerprint of a structure is provided. The system includes a plurality of granules inserted in a structure having a plurality of fissures, fractures, and cracks (collectively apertures), each granule comprising a membrane, and at least one bubble of compressed gas formed in the membrane, the membrane selectively dissolving in presence of a predetermined fluid and thereby selectively bursting the at least one bubble, thereby generating a concussing vibration, at least at least i) three detection devices for two-dimensional mapping or ii) four detection devices for three-dimensional mapping placed proximate to the structure according to a predetermined placement schedule, and a computing device comprising a processor configured to receive data from the at least three or four detection devices and to determine location of the at least one bubble of each of the plurality of the granules at the time of bursting by triangulating the concussive vibration in order to determine location of the at least one bubble.

Pyrak-Nolte, Laura↗

Duality and topology

Mappings between models may be obtained by unitary transformations with preservation of the spectra but in general a change in the states. Non-canonical transformations in general also change the statistics of the operators involved. In these cases one may expect a change of topological properties as a consequence of the mapping. Here we consider some dualities resulting from mappings, by systematically using a Majorana fermion representation of spin and fermionic problems. We focus on the change of topological invariants that results from unitary transformations taking as examples the mapping between a spin system and a topological superconductor, and between different fermionic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SCF Framework, HF Stability, and RPA Correlation for Jordan–Wigner-Transformed Spin Hamiltonians on Arbitrary Coupling Topologies

Mapping spins to fermions via the Jordan–Wigner (JW) transformation can render mean-field (Hartree–Fock, HF) descriptions effective for strongly correlated spin systems. As established in recent work, the application of such approaches is not limited by the nonlocal structure of JW strings or by site ordering because string operators can be absorbed into Thouless rotations of a Slater determinant, and the variational optimization of a unitary Lie-algebraic similarity transformation removes any ordering dependence. Leveraging these ideas, we develop a self-consistent field (SCF) scheme that expresses the mean-field energy as a functional of the single-particle density matrix, providing an alternative to gradient-based optimization of Thouless parameters. We derive the analytical orbital Hessian to diagnose HF stability and compute the ground-state correlation energy through the random-phase approximation (RPA). Benchmark results for the XXZ and J 1 –J 2 model on one- and two-dimensional lattices demonstrate that RPA significantly improves mean-field accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The Data Transfer Kit: A geometric rendezvous-based tool for multiphysics data transfer

The Data Transfer Kit (DTK) is a software library designed to provide parallel data transfer services for arbitrary physics components based on the concept of geometric rendezvous. The rendezvous algorithm provides a means to geometrically correlate two geometric domains that may be arbitrarily decomposed in a parallel simulation. By repartitioning both domains such that they have the same geometric domain on each parallel process, efficient and load balanced search operations and data transfer can be performed at a desirable algorithmic time complexity with low communication overhead relative to other types of mapping algorithms. With the increased development efforts in multiphysics simulation and other multiple mesh and geometry problems, generating parallel topology maps for transferring fields and other data between geometric domains is a common operation. The algorithms used to generate parallel topology maps based on the concept of geometric rendezvous as implemented in DTK are described with an example using a conjugate heat transfer calculation and thermal coupling with a neutronics code. In addition, we provide the results of initial scaling studies performed on the Jaguar Cray XK6 system at Oak Ridge National Laboratory for a worse-case-scenario problem in terms of algorithmic complexity that shows good scaling on 0(1 x 104) cores for topology map generation and excellent scaling on 0(1 x 105) cores for the data transfer operation with meshes of O(1 x 109) elements. (authors)

97 MATHEMATICS AND COMPUTING↗

The split algebras and noncompact Hopf maps

We develop a noncompact version of the Hopf maps based on the split algebras. The split algebras consist of three species: split-complex numbers, split quaternions, and split octonions. They correspond to three noncompact Hopf maps that represent topological maps between hyperboloids in different dimensions with hyperboloid bundle. We realize such noncompact Hopf maps in two ways: one is to utilize the split-imaginary unit, and the other is to utilize the ordinary imaginary unit. Topological structures of the hyperboloid bundles are explored, and the canonical connections are naturally regarded as noncompact gauge field of monopoles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast Photochemical Oxidation of Proteins Maps the Topology of Intrinsic Membrane Proteins: Light-Harvesting Complex 2 in a Nanodisc

Although membrane proteins are crucial participants in photosynthesis and other biological processes, many lack high-resolution structures. Prior to achieving a high-resolution structure, we are investigating whether MS-based footprinting can provide coarse-grained protein structure by following structural changes that occur upon ligand binding, pH change, and membrane binding. Our platform probes topology and conformation of membrane proteins by combining MS-based footprinting, specifically fast photochemical oxidation of proteins (FPOP), and lipid Nanodiscs, which are more similar to the native membrane environment than are the widely used detergent micelles. We describe here results that show a protein’s outer membrane regions are more heavily footprinted by OH radicals whereas the regions spanning the lipid bilayer remain inert to the labeling. Nanodiscs generally exhibit more protection of membrane proteins compared to detergent micelles and less shielding to those protein residues that exist outside the membrane. The combination of immobilizing the protein in Nanodiscs and footprinting with FPOP is a feasible approach to map extra-membrane protein surfaces, even at the amino-acid level, and to illuminate intrinsic membrane protein topology.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization of the hop-byte metric for effective topology aware mapping

Suitable mapping of processes to the nodes of a massively parallel machine can substantially improve communication performance by reducing network congestion. The hop-byte metric has been used as a measure of the quality of such a mapping by several recent works. Optimizing this metric is NP hard, and thus heuristics are applied. However, the heuristics proposed so far do not directly try to optimize this metric. Rather, they use some intuitive methods for reducing congestion and use the metric just to evaluate the quality of the mapping. In fact, heuristics intending to optimize other metrics too don't directly optimize for them, but, rather, use the metric to evaluate the results of the heuristic. In contrast, we pose the mapping problem with the hop-byte metric as a quadratic assignment problem and use a heuristic to directly optimize for this metric. We evaluate our approach on realistic node allocations obtained on the Kraken system at NICS. Our approach yields values for the metric that are up to 75% lower than the default mapping and 66 % lower than existing heuristics. However, the time taken to produce the mapping can be substantially more, which makes this suitable for somewhat static, though possibly irregular, communication patterns. We introduce new heuristics that reduce the time taken to be comparable to that of existing fast heuristics, while still producing mappings of higher quality than existing ones. We also use theoretical lower bounds to suggest that our mapping may be close to optimal, at least for medium sized problems. Consequently, our work can also provide insight into the tradeoff between mapping quality and time taken by other mapping heuristics.

Sudheer, C. D.↗

Inherent limits on optimization and discovery in physical systems

Topological mapping of a large physical system on a graph, and its decomposition using universal measures are proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by motifs, and the ability to reconstruct the full system given approximate representations. The approximate representation of the system most suited for optimization may be different from that which most accurately describes the full system. - Highlights: • Graph-based approach to analyze full and partial representations of physical systems. • Direct link between a change in the physical system and complexity of the graph. • Inherent limits to the potential for optimization of a general system. • Inherent limits to the reconstruction of full system from partial representations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Overexpression and topology of bacterial oligosaccharyltransferase PglB

Campylobacter jejuni contains a post-translational N-glycosylation system in which a STT3 homologue, PglB, functions as the oligosaccharyltransferase. Herein, we established a method for obtaining relatively large quantities of homogenous PglB proteins. PglB was overexpressed in Escherichia coli C43(DE3) at a level of 1 mg/L cell cultures. The activity of purified PglB was verified using a chemically synthesized sugar donor: N-acetylgalactosamine-diphospho-undecaprenyl (GalNAc-PP-Und) and a synthesized peptide acceptor. The result confirms that PglB is solely responsible for the oligosaccharyltransferase activity and complements the finding that PglB exhibits relaxed sugar substrate specificity. In addition, we performed the topology mapping of PglB using the PhoA/LacZ fusion method. The topological model shows that PglB possesses 11 transmembrane segments and two relatively large periplasmic regions other than the C-terminal domain, which is consistent with the proposal of the common N{sub cyt}-C{sub peri} topology with 11 transmembrane segments for the STT3 family proteins.

60 APPLIED LIFE SCIENCES↗

Performing optimized collective operations in an irregular subcommunicator of compute nodes in a parallel computer

In a parallel computer, performing optimized collective operations in an irregular subcommunicator of compute nodes may be carried out by: identifying, within the irregular subcommunicator, regular neighborhoods of compute nodes; selecting, for each neighborhood from the compute nodes of the neighborhood, a local root node; assigning each local root node to a node of a neighborhood-wide tree topology; mapping, for each neighborhood, the compute nodes of the neighborhood to a local tree topology having, at its root, the local root node of the neighborhood; and performing a one way, rooted collective operation within the subcommunicator including: performing, in one phase, the collective operation within each neighborhood; and performing, in another phase, the collective operation amongst the local root nodes.

Davis, Kristan D.↗