Michael G. Gowanlock

Learn More
Applications in many domains search moving object trajectory databases. The distance threshold search finds all trajectories within a given distance of a query trajectory. We develop three GPU distance threshold search implementations that use indexing techniques significantly different from those used in CPU implementations. We determine experimentally(More)
We present a model of the galactic habitable zone (GHZ), described in terms of the spatial and temporal dimensions of the Galaxy that may favor the development of complex life. The Milky Way galaxy was modeled using a computational approach by populating stars and their planetary systems on an individual basis by employing Monte Carlo methods. We began with(More)
In this study, we combine bibliometric techniques with a machine learning algorithm, the sequential information bottleneck, to assess the interdisciplinarity of research produced by the University of Hawaii NASA Astrobiology Institute (UHNAI). In particular, we cluster abstract data to evaluate Thomson Reuters Web of Knowledge subject categories as(More)
The processing of moving object trajectories arises in many application domains. We focus on a trajectory similarity search, the distance threshold search, which finds all trajectories within a given distance of a query trajectory over a time interval. A multithreaded CPU implementation that makes use of an in-memory R-tree index can achieve high parallel(More)
Processing moving object trajectories arises in many application domains and has been addressed by practitioners in the spatiotemporal database and Geographical Information System communities. In this work, we focus on a trajectory similarity search, the distance threshold query, which finds all trajectories within a given distance d of a search trajectory(More)
Spatiotemporal databases are utilized in many applications to store the trajectories of moving objects. In this context, we focus on in-memory distance threshold queries that return all trajectories found within a distance d of a fixed or moving object over a time interval. We present performance results for a sequential query processing algorithm that uses(More)
This paper studies a form of parallelism termed variant-based parallelism, which exploits commonalities and reuse among variant computations in order to improve multithreading scalability. The problem is motivated by space weather studies that aim to identify changes in the Earth's ionosphere caused by auroral activity, tsunamis, and earthquakes. Today it(More)
The process of scientific discovery is traditionally assumed to be entirely executed by humans. This article highlights how increasing data volumes and human cognitive limits are challenging this traditional assumption. Relevant examples are found in observational astronomy and geoscience, disciplines that are undergoing transformation due to growing(More)
Applications in many domains require processing moving object trajectories. In this work, we focus on a trajectory similarity search that finds all trajectories within a given distance of a query trajectory over a time interval, which we call the distance threshold similarity search. We develop three indexing strategies with spatial, temporal and(More)