Search NASA⌕ Search

SEARCH · Search NASA

Results for “group representations”

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 217 records · Page 12

Technology Assessment of High Capacity Data Storage Systems: Can We Avoid a Data Survivability Crisis?

In a recent address at the California Science Center in Los Angeles, Vice President Al Gore articulated a Digital Earth Vision. That vision spoke to developing a multi-resolution, three-dimensional visual representation of the planet into which we can roam and zoom into vast quantities of embedded geo-referenced data. The vision was not limited to moving through space, but also allowing travel over a time-line, which can be set for days, years, centuries, or even geological epochs. A working group of Federal Agencies, developing a coordinated program to implement the Vice President's vision, developed the definition of the Digital Earth as a visual representation of our planet that enables a person to explore and interact with the vast amounts of natural and cultural geo-referenced information gathered about the Earth. One of the challenges identified by the agencies was whether the technology existed that would be available to permanently store and deliver all the digital data that enterprises might want to save for decades and centuries. Satellite digital data is growing by Moore's Law as is the growth of computer generated data. Similarly, the density of digital storage media in our information-intensive society is also increasing by a factor of four every three years. The technological bottleneck is that the bandwidth for transferring data is only growing at a factor of four every nine years. This implies that the migration of data to viable long-term storage is growing more slowly. The implication is that older data stored on increasingly obsolete media are at considerable risk if they cannot be continuously migrated to media with longer life times. Another problem occurs when the software and hardware systems for which the media were designed are no longer serviced by their manufacturers. Many instances exist where support for these systems are phased out after mergers or even in going out of business. In addition, survivability of older media can suffer from physical breakdown of components (e.g. tapes simply lose their magnetic properties after a long time in storage). As a result, a potential data survivability crisis is emerging. The scale of the crisis is comparable to that facing the Social Security System. Sometime in one or two decades, the exponential growth of data will become so great that many enterprises will not be able to migrate through their data to more permanent media during the lifetime of the media on which it resides. This will result in significant losses of data and their resultant impacts. To avoid this crisis, we need to plan and devote greater financial and intellectual resources are needed for the development and refinement of new storage media and migration technologies in order to preserve all data any organization determines worth saving permanently. This talk will explore technological solutions and suggested recommendations to address this technological data crisis.

Halem, Milton↗

Frustrated Kondo impurity triangle: A simple model of deconfinement

We report that the concepts of deconfinement and topological order are of great current interest for quantum information science and for our understanding of quantum materials. Here, we introduce a simple model of three antiferromagnetically coupled Kondo impurities, a Kondo triangle, which can be used to further extend the application of these concepts to electronic systems. We show that, by tuning the magnetic frustration, the Kondo triangle undergoes a quantum phase transition between two phases of unbroken symmetry, signaling a phase transition beyond the Landau paradigm. We demonstrate that the frustrated spin liquid phase is described by a three-channel Kondo (3CK) fixed point and thus displays an irrational ground state degeneracy. Using an Abrikosov pseudofermion representation, this quantum state is categorized by an emergent U(1) gauge field and its projective symmetry group. The gauge theory is deconfining in the sense that a miniature Wilson loop orders and topological defects (instantons in the gauge field) are expelled. This phase persists in the presence of moderate Kondo screening until proliferation of topological defects leads to a quantum phase transition to an unfrustrated Fermi liquid phase. Based on this evidence, we propose that the 3CK phase displays topological order in a similar sense as gapless spin liquids.

36 MATERIALS SCIENCE↗

The 3-D inelastic analysis methods for hot section components (base program)

A series of computer codes are sought that would permit more accurate and efficient three-dimensional inelastic structural analysis of combustor liners, turbine blades, and turbine vanes. Each code embodies a progression of mathematical models for increasingly comprehensive representation of the geometrical features, loading conditions, and forms of nonlinear material response that distinguish these three groups of hot section components.

Todd, E. S.↗

On 3-D inelastic analysis methods for hot section components

The objective of this program is to produce a series of new computer codes that permit more accurate and efficient three-dimensional inelastic structural analysis of combustor liners, turbine blades, and turbine vanes. Each code embodies a progression of mathematical models for increasingly comprehensive representation of the geometrical features, loading conditions, and forms of nonlinear material response that distinguish these three groups of hot section components.

Todd, E. S.↗

Three-dimensional inelastic analysis methods for hot section components

The objective of this program is to produce a series of new computer codes that permit more accurate and efficient three-dimensional inelastic structural analysis of combustor liners, turbine blades, and turbine vanes. Each code embodies a progression of mathematical models for increasingly comprehensive representation of the geometrical features, loading conditions, and forms of nonlinear material response that distinguish these three groups of hot section components.

Todd, E. S.↗

Learning fuzzy information in a hybrid connectionist, symbolic model

An instance-based learning system is presented. SC-net is a fuzzy hybrid connectionist, symbolic learning system. It remembers some examples and makes groups of examples into exemplars. All real-valued attributes are represented as fuzzy sets. The network representation and learning method is described. To illustrate this approach to learning in fuzzy domains, an example of segmenting magnetic resonance images of the brain is discussed. Clearly, the boundaries between human tissues are ill-defined or fuzzy. Example fuzzy rules for recognition are generated. Segmentations are presented that provide results that radiologists find useful.

Romaniuk, Steve G.↗

Hypervelocity Impact Test Fragment Modeling: Modifications to the Fragment Rotation Analysis and Lightcurve Code

Hypervelocity impact tests on test satellites are performed by members of the orbital debris scientific community in order to understand and typify the on-orbit collision breakup process. By analysis of these test satellite fragments, the fragment size and mass distributions are derived and incorporated into various orbital debris models. These same fragments are currently being put to new use using emerging technologies. Digital models of these fragments are created using a laser scanner. A group of computer programs referred to as the Fragment Rotation Analysis and Lightcurve code uses these digital representations in a multitude of ways that describe, measure, and model on-orbit fragments and fragment behavior. The Dynamic Rotation subroutine generates all of the possible reflected intensities from a scanned fragment as if it were observed to rotate dynamically while in orbit about the Earth. This calls an additional subroutine that graphically displays the intensities and the resulting frequency of those intensities as a range of solar phase angles in a Probability Density Function plot. This document reports the additions and modifications to the subset of the Fragment Rotation Analysis and Lightcurve concerned with the Dynamic Rotation and Probability Density Function plotting subroutines.

Gouge, Michael F.↗

An overview of data tools for representing and managing building information and performance data

Building information modeling (BIM) has been widely adopted for representing and exchanging building data across disciplines during building design and construction. However, BIM's use in the building operation phase is limited. With the increasing deployment of low-cost sensors and meters, as well as affordable digital storage and computing technologies, growing volumes of data have been collected from buildings, their energy services systems, and occupants. Such data are crucial to help decision makers understand what, how, and when energy is consumed in buildings—a critical step to improving building performance for energy efficiency, demand flexibility, and resilience. However, practical analyses and use of the collected data are very limited due to various reasons, including poor data quality, ad-hoc representation of data, and lack of data science skills. To unlock value from building data, there is a strong need for a toolchain to curate and represent building information and performance data in common standardized terminologies and schemas, to enable interoperability between tools and applications. This study selected and reviewed 24 data tools based on common use cases of data across the building life cycle, from design to construction, commissioning, operation, and retrofits. The selected data tools are grouped into three categories: (1) data dictionary or terminology, (2) data ontology and schemas, and (3) data platforms. The data are grouped into ten typologies covering most types of data collected in buildings. This study resulted in five main findings: (1) most data representation tools can represent their intended data typologies well, such as Green Button for smart meter data and Brick schema for metadata of sensors in buildings and HVAC systems, but none of the tools cover all ten types of data; (2) there is a need for data schemas to represent the basis of design data and metadata of occupant data; (3) standard terminologies such as those defined in BEDES are only adopted in a few data tools; (4) integrating data across various stages in the building life cycle remains a challenge; and (5) most data tools were developed and maintained by different parties for different purposes, their flexibility and interoperability can be improved to support broader use cases. Finally, recommendations for future research on building data tools are provided for the data and buildings community based on the FAIR principles to make data Findable, Accessible, Interoperable, and Reusable.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Discontinuous Galerkin discretization for quantum simulation of chemistry

All-electron electronic structure methods based on the linear combination of atomic orbitals method with Gaussian basis set discretization offer a well established, compact representation that forms much of the foundation of modern correlated quantum chemistry calculations—on both classical and quantum computers. Despite their ability to describe essential physics with relatively few basis functions, these representations can suffer from a quartic growth of the number of integrals. Recent results have shown that, for some quantum and classical algorithms, moving to representations with diagonal two-body operators can result in dramatically lower asymptotic costs, even if the number of functions required increases significantly. We introduce a way to interpolate between the two regimes in a systematic and controllable manner, such that the number of functions is minimized while maintaining a block-diagonal structure of the two-body operator and desirable properties of an original, primitive basis. Techniques are analyzed for leveraging the structure of this new representation on quantum computers. Empirical results for hydrogen chains suggest a scaling improvement from O(N 4.5 ) in molecular orbital representations to O(N 2.6 ) in our representation for quantum evolution in a fault-tolerant setting, and exhibit a constant factor crossover at 15 to 20 atoms. Moreover, we test these methods using modern density matrix renormalization group methods classically, and achieve excellent accuracy with respect to the complete basis set limit with a speedup of 1–2 orders of magnitude with respect to using the primitive or Gaussian basis sets alone. These results suggest our representation provides significant cost reductions while maintaining accuracy relative to molecular orbital or strictly diagonal approaches for modest-sized systems in both classical and quantum computation for correlated systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Topological field theory with Haagerup symmetry

Here, we construct a (1 + 1)d topological field theory (TFT) whose topological defect lines (TDLs) realize the transparent Haagerup $\mathscr{H}$ 3 fusion category. This TFT has six vacua, and each of the three non-invertible simple TDLs hosts three defect operators, giving rise to a total of 15 point-like operators. The TFT data, including the three-point coefficients and lasso diagrams, are determined by solving all the sphere four-point crossing equations and torus one-point modular invariance equations. We further verify that the Cardy states furnish a non-negative integer matrix representation under TDL fusion. While many of the constraints we derive are not limited to this particular TFT with six vacua, we leave open the construction of TFTs with two or four vacua. Finally, TFTs realizing the Haagerup $\mathscr{H}$ 1 and $\mathscr{H}$ 2 fusion categories can be obtained by gauging algebra objects. This article makes a modest offering in our pursuit of exotica and the quest for their eventual conformity.

97 MATHEMATICS AND COMPUTING↗

Universal fine grained asymptotics of free and weakly coupled quantum field theory

We give a rigorous proof that in any free quantum field theory with a finite group global symmetry G, on a compact spatial manifold, at sufficiently high energy, the density of states ρ α (E) for each irreducible representation α of G obeys a universal formula as conjectured by Harlow and Ooguri. We further prove that this continues to hold in a weakly coupled quantum field theory, given an appropriate scaling of the coupling with temperature. This generalizes similar results that were previously obtained in (1 + 1)-D to higher spacetime dimension. We discuss the role of averaging in the density of states, and we compare and contrast with the case of continuous group G, where we prove a universal, albeit different, behavior.

Discrete Symmetries↗

Trinification from E 6 symmetry breaking

In the context of E 6 Grand Unified Theories (GUTs), an intriguing possibility for symmetry breaking to the Standard Model (SM) group involves an intermediate stage characterized by either SU(3) × SU(3) × SU(3) (trinification) or SU(6) × SU(2). The more common choices of SU(5) and SO(10) GUT symmetry groups do not offer such breaking chains. We argue that the presence of a real (rank 2 tensor) representation 650 of E 6 in the scalar sector is the minimal and likely only reasonable possibility to obtain one of the novel intermediate stages. We analyze the renormalizable scalar potential of a single copy of the 650 and find vacuum solutions that support regularly embedded subgroups SU(3) × SU(3) × SU(3), SU(6) × SU(2), and SO(10) × U(1), as well as specially embedded subgroups F 4 and SU(3) × G 2 that do not contain the SM gauge symmetry. We show that for a suitable choice of parameters, each of the regular cases can be obtained as the lowest among the analyzed minima in the potential.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Confronting grand unification with lepton flavour violation, dark matter and LHC data

We explore possible signatures for charged lepton flavour violation (LFV), sparticle discovery at the LHC and dark matter (DM) searches in grand unified theories (GUTs) based on SU(5), flipped SU(5) (FSU(5)) and SU(4) c ×SU(2) L ×SU(2) R (4-2-2). We assume that soft supersymmetry-breaking terms preserve the group symmetry at some high input scale, and focus on the non-universal effects on different matter representations generated by gauge interactions at lower scales, as well as the charged LFV induced in Type-1 see-saw models of neutrino masses. We identify the different mechanisms that control the relic DM density in the various GUT models, and contrast their LFV and LHC signatures. The SU(5) and 4-2-2 models offer good detection prospects both at the LHC and in LFV searches, though with different LSP compositions, and the SU(5) and FSU(5) models offer LFV within the current reach. The 4-2-2 model allows chargino and gluino coannihilations with neutralinos, and the former offer good detection prospects for both the LHC and LFV, while gluino coannihilations lead to lower LFV rates. Our results indicate that LFV is a powerful tool that complements LHC and DM searches, providing significant insights into the sparticle spectra and neutrino mass parameters in different models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reimagining Disassembly Interfaces With Visualization: Combining Instruction Tracing and Control Flow With DisViz

In applications where efficiency is critical, developers may examine their compiled binaries, seeking to understand how the compiler transformed their source code and what performance implications that transformation may have. This analysis is challenging due to the vast number of disassembled binary instructions and the many-to-many mappings between them and the source code. These problems are exacerbated as source code size increases, giving the compiler more freedom to map and disperse binary instructions across the disassembly space. Interfaces for disassembly typically display instructions as an unstructured listing or sacrifice the order of execution. Here, we design a new visual interface for disassembly code that combines execution order with control flow structure, enabling analysts to both trace through code and identify familiar aspects of the computation. Central to our approach is a novel layout of instructions grouped into basic blocks that displays a looping structure in an intuitive way. We add to this disassembly representation a unique block-based mini-map that leverages our layout and shows context across thousands of disassembly instructions. Finally, we embed our disassembly visualization in a web-based tool, DisViz, which adds dynamic linking with source code across the entire application. DizViz was developed in collaboration with program analysis experts following design study methodology and was validated through evaluation sessions with ten participants from four institutions. Participants successfully completed the evaluation tasks, hypothesized about compiler optimizations, and noted the utility of our new disassembly view. Our evaluation suggests that our new integrated view helps application developers in understanding and navigating disassembly code.

Computer science↗

Environmental modeling and recognition for an autonomous land vehicle

An architecture for object modeling and recognition for an autonomous land vehicle is presented. Examples of objects of interest include terrain features, fields, roads, horizon features, trees, etc. The architecture is organized around a set of data bases for generic object models and perceptual structures, temporary memory for the instantiation of object and relational hypotheses, and a long term memory for storing stable hypotheses that are affixed to the terrain representation. Multiple inference processes operate over these databases. Researchers describe these particular components: the perceptual structure database, the grouping processes that operate over this, schemas, and the long term terrain database. A processing example that matches predictions from the long term terrain model to imagery, extracts significant perceptual structures for consideration as potential landmarks, and extracts a relational structure to update the long term terrain database is given.

Lawton, D. T.↗

Collective Intelligence and Three Aspects of Planning in Organizations: A NASA Example

For many complex sociotechnical systems, planning seems to require explicit coordination; certainly, in executing a plan the activities of different actors must be tightly coupled. However, distributing the needed planning information can be very burdensome and error prone, because different groups need different collections of information, updated or kept current on different time cycles. Further, the information needed to form successful plans is often highly distributed, and while feedback about the success of prior plans may exist, it may not be available to those in a position of using this to improve plans or to detect and resolve other problems in the system (Weick, 1995). Tools to support various aspects of planning have been developed, and can provide a huge benefit to the individuals working on that aspect. To be tractable, most solutions address a quite bounded slice of work, isolating it from the larger context. Prospective planning takes place over multiple, nested cycles of decision making. This builds a plan that specifies activities of different granularity. "Subplans" may specify multiple parallel activities by different groups and individuals, as well as sequential, nested actions by a single actor. Planning produces valuable, sharable, external, representations: in addition to prospective use, plans support retrospective assessment and also action in the present. Viewing planning in a larger context - both temporal and organizational -- enables noticing what one does not know and generating more systemic and effective solutions. Viewing a problem as one of collective intelligence invites thinking about the larger organizational context. Many approaches to supporting collective intelligence do not support execution of highly contingent actions, distributed across many players, and hence provide incomplete support for planning. However, CI technology maybe helpful in managing the processes of gathering information for decision making in planning and of distributing plan information to various actors, needed on various time cycles.

Billman, Dorrit↗

Learning nuclear cross sections across the chart of nuclides with graph neural networks

We explore the use of deep learning techniques to learn how nuclear cross sections change as we add or remove protons and neutrons. As a proof of principle, we focus on the neutron-induced reactions in the fast energy regime. Our approach follows a two-stage learning framework. First, we apply representation learning to encode cross section data into a latent space using either variational autoencoders (VAEs) or implicit neural representations (INRs). Then, we train graph neural networks (GNNs) on the resulting embeddings to predict missing values across the nuclear chart by leveraging the topological structure of neighboring isotopes. We demonstrate accurate cross section predictions within a 9 × 9 block of missing nuclei. We also find that the optimal GNN training strategy depends on the type of latent representation used, with VAE embeddings performing best under end-to-end optimization in the original space, while INR embeddings achieve better results when the GNN is trained only in the latent space. Furthermore, using clustering algorithms, we map groups of latent vectors into regions of the nuclear chart and show that VAEs and INRs can discover some of the neutron magic numbers. These findings suggest that deep-learning models based on the representation encoding of cross sections combined with graph neural networks hold significant potential in augmenting nuclear theory models, e.g., by providing reliable estimates of covariances of cross sections, including cross-material covariances.

Machine learning↗