1,722,852 research outputs found
Supplemental Material, How_to_Write_a_Systematic_Review_of_the_Literature - How to Write a Systematic Review of the Literature
No full textSupplemental Material, How_to_Write_a_Systematic_Review_of_the_Literature for How to Write a Systematic Review of the Literature by Debajyoti Pati, Lesa N. Lorusso in HERD: Health Environments Research & Design Journal</p
sj-docx-1-idx-10.1177_10717641231207031 – Supplemental material for Identifying Environmental Elements and Attributes that Contribute to Indoor Wayfinding: An Exploratory Study Utilizing Think-Aloud Protocol
No full textSupplemental material, sj-docx-1-idx-10.1177_10717641231207031 for Identifying Environmental Elements and Attributes that Contribute to Indoor Wayfinding: An Exploratory Study Utilizing Think-Aloud Protocol by Saman Jamshidi and Debajyoti Pati in Journal of Interior Design</p
sj-jpg-2-idx-10.1177_10717641231207031 – Supplemental material for Identifying Environmental Elements and Attributes that Contribute to Indoor Wayfinding: An Exploratory Study Utilizing Think-Aloud Protocol
No full textSupplemental material, sj-jpg-2-idx-10.1177_10717641231207031 for Identifying Environmental Elements and Attributes that Contribute to Indoor Wayfinding: An Exploratory Study Utilizing Think-Aloud Protocol by Saman Jamshidi and Debajyoti Pati in Journal of Interior Design</p
Influence of Planetary Surface Temperature on the Tectonic Transition from Heat Pipes (Simulation results and data extraction and plotting scripts)
No full textSimulation results and data extraction and plotting scripts for Geophysical Research Letters submission titled "Influence of Planetary Surface Temperature on the Tectonic Transition from Heat Pipes" by Basu Sarkar, Debajyoti and Moore, William B. (2022)
sj-jpg-3-idx-10.1177_10717641231207031 – Supplemental material for Identifying Environmental Elements and Attributes that Contribute to Indoor Wayfinding: An Exploratory Study Utilizing Think-Aloud Protocol
No full textSupplemental material, sj-jpg-3-idx-10.1177_10717641231207031 for Identifying Environmental Elements and Attributes that Contribute to Indoor Wayfinding: An Exploratory Study Utilizing Think-Aloud Protocol by Saman Jamshidi and Debajyoti Pati in Journal of Interior Design</p
sj-docx-4-idx-10.1177_10717641231207031 – Supplemental material for Identifying Environmental Elements and Attributes that Contribute to Indoor Wayfinding: An Exploratory Study Utilizing Think-Aloud Protocol
No full textSupplemental material, sj-docx-4-idx-10.1177_10717641231207031 for Identifying Environmental Elements and Attributes that Contribute to Indoor Wayfinding: An Exploratory Study Utilizing Think-Aloud Protocol by Saman Jamshidi and Debajyoti Pati in Journal of Interior Design</p
Supplementary Material - Online_Supplementary_Table_S7 - The Impact of Environmental Design on Teamwork and Communication in Healthcare Facilities: A Systematic Literature Review
No full textSupplementary Material - Online_Supplementary_Table_S7 - The Impact of Environmental Design on Teamwork and Communication in Healthcare Facilities: A Systematic Literature Review by Arsalan Gharaveis, D. Kirk Hamilton, Debajyoti Pati in HERD: Health Environments Research & Design Journal</p
A Generalized Quantum Branching Program
Get PDFClassical branching programs are studied to understand the space complexity of computational problems. Prior to this work, Nakanishi and Ablayev had separately defined two different quantum versions of branching programs that we refer to as NQBP and AQBP. However, none of them, to our satisfaction, captures the intuitive idea of being able to query different variables in superposition in one step of a branching program traversal. Here, we propose a quantum branching program model, referred to as GQBP, with that ability. To motivate our definition, we explicitly give examples of GQBP for n-bit Deutsch-Jozsa, n-bit Parity, and 3-bit Majority with optimal lengths. We then show several equivalences, namely, between GQBP and AQBP, GQBP and NQBP, and GQBP and query complexities (using either oracle gates or a QRAM to query input bits). In a way, this unifies the different results that we have for the two earlier branching programs and also connects them to query complexity. We hope that GQBP can be used to prove space and space-time lower bounds for quantum solutions to combinatorial problems
Relating Graph Thickness to Planar Layers and Bend Complexity
Get PDFThe thickness of a graph G = (V, E) with n vertices is the minimum number of planar subgraphs of G whose union is G. A polyline drawing of G in R^2 is a drawing Gamma of G, where each vertex is mapped to a point and each edge is mapped to a polygonal chain. Bend and layer complexities are two important aesthetics of such a drawing. The bend complexity of Gamma is the maximum number of bends per edge in Gamma, and the layer complexity of Gamma is the minimum integer r such that the set of polygonal chains in Gamma can be partitioned into r disjoint sets, where each set corresponds to a planar polyline drawing. Let G be a graph of thickness t. By Fáry’s theorem, if t = 1, then G can be drawn on a single layer with bend complexity 0. A few extensions to higher thickness are known, e.g., if t = 2 (resp., t > 2), then G can be drawn on t layers with bend complexity 2 (resp., 3n + O(1)).
In this paper we present an elegant extension of Fáry's theorem to draw graphs of thickness t > 2. We first prove that thickness-t graphs can be drawn on t layers with 2.25n + O(1) bends per edge. We then develop another technique to draw thickness-t graphs on t layers with reduced bend complexity for small values of t, e.g., for t in {3, 4}, the bend complexity decreases to O(sqrt(n)).
Previously, the bend complexity was not known to be sublinear for t > 2. Finally, we show that graphs with linear arboricity k can be drawn on k layers with bend complexity 3*(k-1)*n/(4k-2)
- …
