Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “information computation”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Space Information For Educators

Anyone with personal computer, modem, and telephone can obtain educational materials. Access to collection of NASA information, stored in computer in Huntsville, Alabama, obtained over telephone lines from computers in classrooms and homes. Available free of charge. Users must pay own telephone charges. Data base offers information on following topics: NASA news; Research in aeronautics; Space exploration before Space Shuttle; Exploration with Space Shuttle and beyond; NASA and its centers; NASA educational services; Classroom materials; and Space program spinoffs. User communicates with Spacelink via almost any existing communication software. Simple keystrokes control display of documents on user's terminal.

Anderson, Bill↗
DOE OSTI2026

String-Breaking Dynamics in Quantum Adiabatic and Diabatic Processes

Confinement prohibits isolation of color charges, e.g., quarks, in nature via a process called string breaking : the separation of two charges results in an increase in the energy of a color flux, visualized as a string, connecting those charges. Eventually, creating additional charges is energetically favored, hence breaking the string. Such a phenomenon can be probed in simpler models, including quantum spin chains, enabling enhanced understanding of string-breaking dynamics. A challenging task is to understand how string breaking occurs as time elapses, in an out-of-equilibrium setting. This work establishes the phenomenology of dynamical string breaking induced by a gradual increase of string tension over time. It, thus, goes beyond instantaneous quench processes and enables tracking the real-time evolution of strings in a more controlled setting. We focus on domain-wall confinement in a family of quantum Ising chains. Our results indicate that, for sufficiently short strings and slow evolution, string breaking can be described by the transition dynamics of a two-state quantum system akin to a Landau-Zener process. For longer strings, a more intricate spatiotemporal pattern emerges: the string breaks by forming a superposition of bubbles (domains of flipped spins of varying sizes), which involve highly excited states. We finally demonstrate that string breaking driven only by quantum fluctuations can be realized in the presence of sufficiently long-ranged interactions. This work holds immediate relevance for studying string breaking in quantum-simulation experiments.

Ising model↗
DOE OSTI2025

Solving k –SAT problems with generalized quantum measurement

We generalize the projection–based quantum measurement–driven k –SAT algorithm of Benjamin, Zhao, and Fitzsimons to arbitrary strength quantum measurements, including the limit of continuous monitoring. In doing so, we clarify that this algorithm is a particular case of the measurement–driven quantum control strategy elsewhere referred to as “Zeno dragging”. We argue that the algorithm is most efficient with finite time and measurement resources in the continuum limit, where measurements have an infinitesimal strength and duration. Moreover, for solvable k -SAT problems, the dynamics generated by the algorithm converge deterministically towards target dynamics in the long–time (Zeno) limit, implying that the algorithm can successfully operate autonomously via Lindblad dissipation, without detection. We subsequently study both the conditional and unconditional dynamics of the algorithm implemented via generalized measurements, quantifying the advantages of detection for heralding errors. These strategies are investigated first in a computationally–trivial 2-qubit 2-SAT problem to build intuition, and then we consider the scaling of the algorithm on 3-SAT problems encoded with 4–10 qubits. We numerically investigate the scaling of 3-SAT with respect to algorithmic runtime and find that the optimized time to solution scales with qubit number n as λ n , where λ is slightly larger than $\sqrt{2}$ for unconditional dynamics and less than $\sqrt{2}$ for conditional dynamics. We assess the implications for using this analog measurement–driven approach to quantum computing in practice.

quantum information↗
NASA NTRS1972

Natural Resource Information System. Volume 1: Overall description

A prototype computer-based Natural Resource Information System was designed which could store, process, and display data of maximum usefulness to land management decision making. The system includes graphic input and display, the use of remote sensing as a data source, and it is useful at multiple management levels. A survey established current decision making processes and functions, information requirements, and data collection and processing procedures. The applications of remote sensing data and processing requirements were established. Processing software was constructed and a data base established using high-altitude imagery and map coverage of selected areas of SE Arizona. Finally a demonstration of system processing functions was conducted utilizing material from the data base.

Source record↗
DOE OSTI2024

Assessing Resilience in Lane Detection Methods: Infrastructure-Based Sensors and Traditional Approaches for Autonomous Vehicles

Traditional autonomous vehicle perception subsystems that use onboard sensors have the drawbacks of high computational load and data duplication. Infrastructure-based sensors, which can provide high quality information without the computational burden and data duplication, are an alternative to traditional autonomous vehicle perception subsystems. However, these technologies are still in the early stages of development and have not been extensively evaluated for lane detection system performance. Therefore, there is a lack of quantitative data on their performance relative to traditional perception methods, especially during hazardous scenarios, such as lane line occlusion, sensor failure, and environmental obstructions. We address this need by evaluating the influence of hazards on the resilience of three different lane detection methods in simulation: (1) traditional camera detection using a U-Net algorithm, (2) radar detections using infrastructure-based radar retro-reflectors (RRs), and (3) direct communication of lane line information using chip-enabled raised pavement markers (CERPMs). The performance of each of these methods is assessed using resilience engineering metrics by simulating the individual methods for each sensor technology’s response to related hazards in the CARLA simulator. Using simulation techniques to replicate these methods and hazards acquires extensive datasets without lengthy time investments. Specifically, the resilience triangle was used to quantitatively measure the resilience of the lane detection system to obtain unique insights into each of the three lane detection methods; notably the infrastructure-based CERPMs and RRs had high resistance to hazards and were not as easily affected as the vision-based U-Net. However, while U-Net was able to recover the fastest from the disruption as compared to the other two methods, it also had the most performance loss. Overall, this study demonstrates that while infrastructure-based lane keeping technologies are still in early development, they have great potential as alternatives to traditional ones.

Patil, Pritesh↗
DOE OSTI2022

Anti-$\mathscr{PT}$-symmetric qubit: Decoherence and entanglement entropy

We investigate the dynamics of a general two-level based anti-parity-time (anti-$\mathscr{PT}$)-symmetric qubit and study its decoherence as well as entanglement entropy properties. We compare our findings with that of the corresponding parity-time ($\mathscr{PT}$)-symmetric and Hermitian qubits. To begin, we consider the time-dependent Dyson map to find the exact analytical dynamics for a general non-Hermitian qubit system weakly coupled with a thermal bath for pure dephasing, before specializing it to the case of a general anti-$\mathscr{PT}$-symmetric qubit. Basing the comparison under the same coupling strength or increasing the non-Hermiticity, we observe that the decoherence function and entanglement entropy of the anti-$\mathscr{PT}$-symmetric qubit decays and grows more slowly, respectively, compared to the $\mathscr{PT}$-symmetric and Hermitian qubits. Similarly, the corresponding variance and area of Fisher information are much higher compared to the $\mathscr{PT}$-symmetric and Hermitian qubits. These results demonstrate that anti-$\mathscr{PT}$-symmetric qubits may be better suited for quantum computing and quantum information processing applications than conventional Hermitian or even $\mathscr{PT}$-symmetric qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1973

Automatic information extraction for land use and agricultural applications

Description of some current work in interpretation technique development for automatic computer-aided image information extraction related to various application areas, including land use mapping and agricultural survey and monitoring. In particular, the application of a fast template matching algorithm, employing the sequential similarity detection principle, to image registration, linear feature detection, and the extraction and enumeration of scene objects is discussed and illustrated.

Bond, A. D.↗
NASA NTRS1975

Hybrid computer methods for direct functional optimization

Control and trajectory optimization involves the minimization of a performance index (PI) of integral form where some optimal control law exists in a dynamic system. In this paper, a hybrid minicomputer with an adaptive random-search algorithm implements an iterative search for the optimal control. The search assumes that some initial control is randomly perturbed and a fast analog computer generates respective PI from the analog response of the dynamic system. An improved PI informs the digital computer to utilize the perturbed control as a basis for the next iteration; otherwise a new perturbation replaces the old perturbation in the next iteration. The search terminates when no further improvements occur.

Andrews, M.↗
DOE OSTI2024

Quantum Information Encoding and Decoding for Quantum Sensi

This two-year theory project focused on theoretical investigations of novel paradigms for quantum sensing, building on information encoding and techniques from quantum error correction, quantum computing and other quantum information domains. The outcomes facilitate quantum information technology development, especially at the interface of quantum computing and quantum sensing. The results of the project show new use cases and new paradigms for quantum sensing beyond what has so far been considered. One outcome shows how quantum sensing opens new opportunities for fundamental physics such as the capability of single graviton detection. Another outcome reveals a new application of NISQ quantum computers with error correction for metrology, building on recent advances in practical quantum error correction implementation. The third outcome of the project creates new paradigms of back-action-evading sensing inspired by collective quantum information encoding, which achieves quantum sensing beyond the quantum limit without the use of entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2001

A Simple XML Producer-Consumer Protocol

There are many different projects from government, academia, and industry that provide services for delivering events in distributed environments. The problem with these event services is that they are not general enough to support all uses and they speak different protocols so that they cannot interoperate. We require such interoperability when we, for example, wish to analyze the performance of an application in a distributed environment. Such an analysis might require performance information from the application, computer systems, networks, and scientific instruments. In this work we propose and evaluate a standard XML-based protocol for the transmission of events in distributed systems. One recent trend in government and academic research is the development and deployment of computational grids. Computational grids are large-scale distributed systems that typically consist of high-performance compute, storage, and networking resources. Examples of such computational grids are the DOE Science Grid, the NASA Information Power Grid (IPG), and the NSF Partnerships for Advanced Computing Infrastructure (PACIs). The major effort to deploy these grids is in the area of developing the software services to allow users to execute applications on these large and diverse sets of resources. These services include security, execution of remote applications, managing remote data, access to information about resources and services, and so on. There are several toolkits for providing these services such as Globus, Legion, and Condor. As part of these efforts to develop computational grids, the Global Grid Forum is working to standardize the protocols and APIs used by various grid services. This standardization will allow interoperability between the client and server software of the toolkits that are providing the grid services. The goal of the Performance Working Group of the Grid Forum is to standardize protocols and representations related to the storage and distribution of performance data. These standard protocols and representations must support tasks such as profiling parallel applications, monitoring the status of computers and networks, and monitoring the performance of services provided by a computational grid. This paper describes a proposed protocol and data representation for the exchange of events in a distributed system. The protocol exchanges messages formatted in XML and it can be layered atop any low-level communication protocol such as TCP or UDP Further, we describe Java and C++ implementations of this protocol and discuss their performance. The next section will provide some further background information. Section 3 describes the main communication patterns of our protocol. Section 4 describes how we represent events and related information using XML. Section 5 describes our protocol and Section 6 discusses the performance of two implementations of the protocol. Finally, an appendix provides the XML Schema definition of our protocol and event information.

Smith, Warren↗
DOE OSTI2023

Information Processing Capacity of Spintronic Oscillator

Physical reservoir computing is a framework that enables energy‐efficient information processing by using physical systems. Nonlinear dynamics in physical systems provide a computational capability that is unique to reservoirs. It is, however, difficult to find an appropriate task for a reservoir because of the complexity of nonlinear information processing. The information processing capacity has recently been used to clarify systematically the tasks that are solved by reservoirs; it quantifies the memory capacity of reservoirs in accordance with the order of nonlinearity. Herein, an experimental evaluation of the information processing capacity of a spintronic oscillator consisting of nanostructured ferromagnets is reported. The spintronic reservoir state is electrically manipulated by adding a delayed‐feedback circuit. The total capacity reaches a maximum of 5.6 at the edge of the echo state property. A trade‐off between the linear and nonlinear components of the capacity is also found. The result can be used to better understand the nonlinear information processing in reservoirs and to find good matches between reservoirs and tasks. As an example, a function‐approximation task is performed and it is found that it can be efficiently solved when the reservoir state is appropriately tuned so that its information processing capacity matches that of the task.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

On the hardness of learning ground state entanglement of geometrically local Hamiltonians

Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main result is that to show it is cryptographically hard to determine if the ground state of a geometrically local, polynomially gapped Hamiltonian on qudits (d=O(1)) has near-area law vs near-volume law entanglement. This improves prior work of Bouland et al. (arXiv:2311.12017) showing this for non-geometrically local Hamiltonians. In particular we show this problem is roughly factoring-hard in 1D, and LWE-hard in 2D. Our proof works by constructing a novel form of public-key pseudo-entanglement which is highly space-efficient, and combining this with a modification of Gottesman and Irani's quantum Turing machine to Hamiltonian construction. Our work suggests that the problem of learning so-called "gapless" quantum phases of matter might be intractable.

Computational Complexity (cs.CC)↗
NASA NTRS1974

The question of the possibility of using Associative Computer Devices (ACD) for parallel adaptive discretization of multichannel telemetry information

The method of parallel adaptive discretization of data is considered the most promising and allows the effective compression algorithms to be used for high information-capacity radio telemetry systems. An associative computer device (ACD), i.e., parallel computers based on associative memory units (AMU), are recommended for realization of this method. A detailed discussion of the problems of application of AMU is followed by description of a particular ACD and its recommended use.

Kantor, A. V.↗
NASA NTRS1979

LANDSAT's role in HUD 701 programs

A survey of states concerning the use of LANDSAT in support of the comprehensive planning assistance program (Title IV, section 701) of the Housing and Community Development Act (1974) which is aimed mostly at small communities and rural counties, shows: (1) state governments used or were aware of the application of LANDSAT for inventorying land use and land cover at the state and local level; (2) use of satellite data was associated with the development of automated geographic information systems and the computer capability of handling and analyzing mapped information and other data tied to geographic coordinates and boundaries; and (3) LANDSAT capabilities in states tend to be institutionalized within state government information services where they can be readily assessed by state agencies. A summary of the state program for New Jersey and South Dakota is presented along with the state development guide plans, the rationale for using the satellite, and potential applications.

Source record↗
NASA NTRS1995

Data Base On Cables And Connectors

Report describes Connector Adapter Cable Information Data Base (CONNAID) computer program, managing data base containing necessary information concerning electrical connectors, breakout boxes, adapter cables, backshells, and pertinent torque specifications for engineering project.

Bowen, Arlen R.↗
NASA NTRS1977

AOIPS data base management systems support for GARP data sets

A data base management system is identified, developed to provide flexible access to data sets produced by GARP during its data systems tests. The content and coverage of the data base are defined and a computer-aided, interactive information storage and retrieval system, implemented to facilitate access to user specified data subsets, is described. The computer programs developed to provide the capability were implemented on the highly interactive, minicomputer-based AOIPS and are referred to as the data retrieval system (DRS). Implemented as a user interactive but menu guided system, the DRS permits users to inventory the data tape library and create duplicate or subset data sets based on a user selected window defined by time and latitude/longitude boundaries. The DRS permits users to select, display, or produce formatted hard copy of individual data items contained within the data records.

Gary, J. P.↗
NASA NTRS2003

Accelerating the Design of Space Vehicles

One of NASA's key goals is to increase the safety and reduce the cost of space transportation. Thus, a key element of NASA's new Integrated Space Transportation Plan is to develop new propulsion, structures, and operations for future generations of reusable launch vehicles (RLVs). As part of this effort to develop the next RLV, the ClCT Program's Computing, Networking, and Information Systems (CNIS) Project is developing and demonstrating collaborative software technologies that use the collective power of the NASA Grid to accelerate spacecraft design. One of these technologies, called AeroDB, automates the execution and monitoring of computational fluid dynamics (CFD) parameter studies on the NASA Grid. About the NASA Grid The NASA Grid, or Information Power Grid,. is being developed to leverage the distributed resources of NASA's many computers. instruments, simulators, and data storage systems. The goal is to use these combined resources to sdve difficult NASA challenges, such as iimulating the entire flight of a space vehicle from ascent to descent.To realize the vision of the NASA Grid, the CNIS Project is developing the software framework and protocols for building domain-specific environments and interfaces, new Grid services based on emerging industry standards, and advanced networking and computing testbeds to support new Grid-based applications such as AeroDB.

Laufenberg, Larry↗
DOE OSTI2023

Computing system operational methods and apparatus

Computing system operational methods and apparatus are described. According to one aspect, a computing system operational method includes accessing user information regarding a user logging onto a computing device of the computing system, processing the user information to determine if the user information is authentic, as a result of the processing determining that the user information is authentic, first enabling the computing device to execute an application segment, and as a result of the processing determining that the user information is authentic, second enabling the application segment to communicate data externally of the computing device via one of a plurality of network segments of the computing system.

Edgar, Thomas W.↗