Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Steiner Tree”

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.

5 records
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n1/4) rounds of communication and O ̃(n9/4) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗
NASA NTRSDate not supplied

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗
NASA NTRSDate not supplied

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees​

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n 1/4 ) rounds of communication and O ̃(n 9/4 ) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗
NASA NTRSDate not supplied

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; One for producing an approximately optimal Steiner Tree, and one for producing an exact Minimum Directed Spanning tree. These use O(n1/4) rounds of communication and O(n9/4) messages, leading to a quantum speedup in round and message complexity compared to any known algorithms in the classical CONGEST-CLIQUE model (vs O(n1/3) and O(n7/3)). At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Further, these problems can not be sped up in the CONGEST (non-clique) setting, and we characterize the constants involved.

Phillip Kerger↗
NASA NTRSDate not supplied

Establishing an Urban Heat Exposure Severity Index for Infrastructure Prioritization in Tempe, Arizona, Using NASA Earth Observations and LiDAR

Located on the banks of the Salt River in the Sonoran Desert, Tempe, Arizona, features a semi-arid climate with summer daily maximum temperatures regularly exceeding 37.8°C. Tempe is also subject to the southwestern monsoon season from July-September and the humidity exacerbates the high temperatures. Furthermore, the rapid urbanization experienced in Tempe has resulted in an intensification of the urban heat island. The summer of 2020 shattered the previous record of days exceeding 43.4°C, leading to higher energy and water costs, lower comfort, and increased risk of heat stroke for residents. Recognizing the impacts of extreme heat, the City of Tempe partnered with the Healthy Urban Environments initiative and NASA DEVELOP to identify census tracts that experience a higher mean land surface temperature than the city average. The NASA DEVELOP team used remotely sensed land surface temperature (LST), normalized difference vegetation index (NDVI), normalized difference built-up index (NDBI), normalized difference water index (NDWI), and albedo data calculated from Aqua Moderate Resolution Imaging Spectroradiometer (MODIS) and Landsat 8 Operational Land Imager (OLI) and Thermal Infrared Sensor (TIRS) instruments from 2015 to 2020 to create heat hazard and exposure maps. LiDAR point cloud data, provided by the United States Geological Survey through Arizona State University’s Map and Geospatial Hub, were used to derive 3D buildings, building footprints, and tree point data for a shading analysis of walking paths, roads, and buildings at the census tract level. In situ meteorological measurements including air temperature and humidity were used to compare the macro-scale temperature measurements. The team worked with the City of Tempe to develop a methodology to process available data and identify areas of highest concern for urban heat effects within the city. With these insights, Tempe, Arizona can better address these issues with data-driven information to make decisions regarding heat mitigation and adaptation efforts.

John Dialesandro↗