9,738 research outputs found
Appendix_2 – Supplemental material for The Effect of Medicaid Expansion on the Nature of New Enrollees’ Emergency Department Use
No full textSupplemental material, Appendix_2 for The Effect of Medicaid Expansion on the Nature of New Enrollees’ Emergency Department Use by Rahul Ladhania, Amelia M. Haviland, Arvind Venkat, Rahul Telang and Jesse M. Pines in Medical Care Research and Review</p
Two new species of the genus Hishimonus (Hemiptera: Cicadellidae) with a new record from India
No full textMeshram, Naresh M., Chaubey, Rahul (2016): Two new species of the genus Hishimonus (Hemiptera: Cicadellidae) with a new record from India. Zootaxa 4103 (3): 259-266, DOI: 10.11646/zootaxa.4103.3.
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
No full textIn this work, we present a collection of new results on two fundamental problems in geometric data structures: orthogonal point location and rectangle stabbing.
- Orthogonal point location. We give the first linear-space data structure that supports 3-d point location queries on n disjoint axis-aligned boxes with optimal O(log n) query time in the (arithmetic) pointer machine model. This improves the previous O(log^{3/2} n) bound of Rahul [SODA 2015]. We similarly obtain the first linear-space data structure in the I/O model with optimal query cost, and also the first linear-space data structure in the word RAM model with sub-logarithmic query time.
- Rectangle stabbing. We give the first linear-space data structure that supports 3-d 4-sided and 5-sided rectangle stabbing queries in optimal O(log_wn+k) time in the word RAM model. We similarly obtain the first optimal data structure for the closely related problem of 2-d top-k rectangle stabbing in the word RAM model, and also improved results for 3-d 6-sided rectangle stabbing.
For point location, our solution is simpler than previous methods, and is based on an interesting variant of the van Emde Boas recursion, applied in a round-robin fashion over the dimensions, combined with bit-packing techniques. For rectangle stabbing, our solution is a variant of Alstrup, Brodal, and Rauhe's grid-based recursive technique (FOCS 2000), combined with a number of new ideas
FIGURES 32–39. Hishimonus thapai Viraktamath & Murthy 32, 33 in Two new species of the genus Hishimonus (Hemiptera: Cicadellidae) with a new record from India
No full textFIGURES 32–39. Hishimonus thapai Viraktamath & Murthy 32, 33. Habitus, dorsal and lateral view; 34. Face; 35. Pygofer; 36. Style; 37, 38. Aedeagus, lateral and dorsal view; 39. Subgenital plate.Published as part of Meshram, Naresh M. & Chaubey, Rahul, 2016, Two new species of the genus Hishimonus (Hemiptera: Cicadellidae) with a new record from India, pp. 259-266 in Zootaxa 4103 (3) on page 264, DOI: 10.11646/zootaxa.4103.3.4, http://zenodo.org/record/25464
Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points
No full textIn this paper, we present simple randomized multi-pass streaming algorithms for fundamental computational geometry problems of finding the skyline (maximal) points and the extreme points of the convex hull. For the skyline problem, one of our algorithm occupies O(h) space and performs O(log n) passes, where h is the number of skyline points. This improves the space bound of the currently best known result by Das Sarma, Lall, Nanongkai, and Xu [VLDB'09] by a logarithmic factor. For the extreme points problem, we present the first non-trivial result for any constant dimension greater than two: an O(h log^{O(1)}n) space and O(log^dn) pass algorithm, where h is the number of extreme points. Finally, we argue why randomization seems unavoidable for these problems, by proving lower bounds on the performance of deterministic algorithms for a related problem of finding maximal elements in a poset
Toccolosida nigraregina N. Singh, Kirti & Ranjan
No full text494. Toccolosida nigraregina N. Singh, Kirti & Ranjan in N. Singh et al., 2019a: 190, figs 1, 6–7 Type locality: Kawrthah (717 m), Mizoram, India Distribution. Indian records: India, Mizoram, Kawrthah (Singh et al. 2019a). Global records: unknown.Published as part of Singh, Navneet, Ranjan, Rahul, Talukdar, Avishek, Joshi, Rahul, Kirti, Jagbir Singh, Chandra, Kailash & Mally, Richard, 2022, A catalogue of Indian Pyraloidea (Lepidoptera), pp. 1-423 in Zootaxa 5197 (1) on page 139, DOI: 10.11646/zootaxa.5197.1.1, http://zenodo.org/record/725229
#PandemicFoodPorn: Resilience and Precarity During COVID-19
No full textJournal #65 from Media Rise's Quarantined Across Borders Collection by Rahul Mitra. From India. Quarantined in Michigan, USA. Story about food and culture.I negotiate the complex intersections between making (eating) food while quarantined at home and sharing those pictures on social media, especially as they help us be more resilient in a world that has all-too-suddenly changed forever.Media Rise Publications. Quarantined Across Borders Collection. Edited by Dr Srividya "Srivi" Ramasubramanian
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs
No full textThe problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan regions, unit contact disk graphs (penny graphs), and chordal graphs. For each of these graph families, we present space-efficient algorithms for the Reachability problem.
For intersection graphs of Jordan regions, we show how to obtain a "good" vertex separator in a space-efficient manner and use it to solve the Reachability in polynomial time and O(m^{1/2} log n) space, where n is the number of Jordan regions, and m is the total number of crossings among the regions. We use a similar approach for chordal graphs and obtain a polynomial time and O(m^{1/2} log n) space algorithm, where n and m are the number of vertices and edges, respectively. However, for unit contact disk graphs (penny graphs), we use a more involved technique and obtain a better algorithm. We show that for every ε > 0, there exists a polynomial time algorithm that can solve Reachability in an n vertex directed penny graph, using O(n^{1/4+ε}) space. We note that the method used to solve penny graphs does not extend naturally to the class of geometric intersection graphs that include arbitrary size cliques
- …
