You searched for +publisher:"University of Houston" +contributor:("Gabriel, Edgar")
.
Showing records 1 – 30 of
60 total matches.
◁ [1] [2] ▶

University of Houston
1.
Hervey, Marcus W. 1970-.
Enhanced Debugging of Data Races in Parallel Programs Using OpenMP.
Degree: MS, Computer Science, 2016, University of Houston
URL: http://hdl.handle.net/10657/1711
► Parallel computing is pervasive. The variety and number of parallel hardware architectures increase daily. As this technology evolves, parallel developers will need productivity enhancing tools…
(more)
▼ Parallel computing is pervasive. The variety and number of parallel hardware architectures increase daily. As this technology evolves, parallel developers will need productivity enhancing tools to analyze, debug, and tune their parallel applications.
Current debugging tools that excel for sequential programs do not have the features necessary to help locate errors common to parallel programs (i.e. deadlock, livelock, priority inversion, race conditions). Data races, one type of race condition, are the most common software fault in shared-memory programs, and can be difficult to find because they are nondeterministic. Current data-race detection tools are often plagued by numerous false-positives and may exhibit inefficient execution times and memory loads. Enhancing the accuracy and efficiency of data race detectors can both increase the acceptance of shared memory programming models like OpenMP and improve developer productivity.
I describe a complementary analysis technique to detect data races in parallel programs using the OpenMP programming model. This hybrid-analysis technique capitalizes on the strengths of stand-alone static and dynamic data-race detection methods.
A proposed, future tool would implement the static-analysis capabilities of the OpenUH compiler to complement the dynamic-analysis techniques used in Sun (now Oracle) Thread Analyzer. This combination is expected to result in an improved debugging experience for developers intending to resolve data-race errors resulting from poor-programmer discipline, erroneous synchronization or inappropriate data-scoping.
Advisors/Committee Members: Gabriel, Edgar (advisor), Gabriel, Edgar (committee member), Shah, Shishir Kirit (committee member), Chapman, Barbara M. (committee member).
Subjects/Keywords: Data races; Parallel programming; Static-analysis; Dynamic-analysis; Complementary-analysis; Debugging; RaceFree
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hervey, M. W. 1. (2016). Enhanced Debugging of Data Races in Parallel Programs Using OpenMP. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1711
Chicago Manual of Style (16th Edition):
Hervey, Marcus W 1970-. “Enhanced Debugging of Data Races in Parallel Programs Using OpenMP.” 2016. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1711.
MLA Handbook (7th Edition):
Hervey, Marcus W 1970-. “Enhanced Debugging of Data Races in Parallel Programs Using OpenMP.” 2016. Web. 05 Mar 2021.
Vancouver:
Hervey MW1. Enhanced Debugging of Data Races in Parallel Programs Using OpenMP. [Internet] [Masters thesis]. University of Houston; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1711.
Council of Science Editors:
Hervey MW1. Enhanced Debugging of Data Races in Parallel Programs Using OpenMP. [Masters Thesis]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/1711

University of Houston
2.
Khan, Saba Hafeez.
A Parallel Implementation of the Pandas Framework.
Degree: MS, Computer Science, 2020, University of Houston
URL: http://hdl.handle.net/10657/6602
► High-performance is a highly desirable trait for applications today. Companies large and small are migrating their serial applications to parallel versions to reduce execution time…
(more)
▼ High-performance is a highly desirable trait for applications today. Companies large and small are migrating their serial applications to parallel versions to reduce execution time and increase efficiency. However, preparing serial applications for parallel processing is not a simple process. Pandas, which is a Python library containing rich data structures and tools, is used abundantly in Data Science applications. However, Pandas framework is built for single-core processing and is unable to fully utilize multi-core processors or cluster technology. Because of this limitation, Pandas users are forced to look for other frameworks when working with large quantities of data. This thesis introduces a Parallel-Pandas library which makes the process of parallelizing serial Pandas applications easy and transparent. The Parallel-Pandas library provides Pandas users the ability to upgrade existing applications transparently, by using only a library import. This thesis contains details about the design decisions and implementation of the Parallel-Pandas library. The Parallel-Pandas library is evaluated with unit testing, microbenchmarks, and a real-world application with different datasets. Parallel-Pandas has also been compared with PySpark, a framework that provides parallelism by following the MapReduce structure. The results presented in this paper show that the Parallel-Pandas library has promising potential and delivers performance close to manually parallelized and tuned applications.
Advisors/Committee Members: Gabriel, Edgar (advisor), Solorio, Thamar (committee member), Lindner, Peggy (committee member).
Subjects/Keywords: High Performance Computing; Pandas; MPI; Data Science; Duplicate Detection; Big Data; Python; Parallel-Pandas; mpi4py
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Khan, S. H. (2020). A Parallel Implementation of the Pandas Framework. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/6602
Chicago Manual of Style (16th Edition):
Khan, Saba Hafeez. “A Parallel Implementation of the Pandas Framework.” 2020. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/6602.
MLA Handbook (7th Edition):
Khan, Saba Hafeez. “A Parallel Implementation of the Pandas Framework.” 2020. Web. 05 Mar 2021.
Vancouver:
Khan SH. A Parallel Implementation of the Pandas Framework. [Internet] [Masters thesis]. University of Houston; 2020. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/6602.
Council of Science Editors:
Khan SH. A Parallel Implementation of the Pandas Framework. [Masters Thesis]. University of Houston; 2020. Available from: http://hdl.handle.net/10657/6602

University of Houston
3.
Sharma, Sarthak 1994-.
Device Free Activity Recognition using Ultra-Wideband Radio Communication.
Degree: MS, Computer Science, 2018, University of Houston
URL: http://hdl.handle.net/10657/3303
► Human Activity Recognition (HAR) is a fundamental building block in many Internet of Things (IoT) applications. Although there has been a lot of interest in…
(more)
▼ Human Activity Recognition (HAR) is a fundamental building block in many Internet of Things (IoT) applications. Although there has been a lot of interest in HAR, research in non-intrusive activity recognition is still in nascent stages. This research investigates the capability of Ultra-Wideband (UWB) communication technology to be used for HAR. In this work, UWB radio devices are placed in the periphery of a monitored area. This setup infers user activities without the need of any additional sensors or physical device. Packets are exchanged between these UWB devices, and received packets are used to obtain information of the environment. The key idea is that these received packets are affected by environmental modification due to the human activities. We collect Channel Impulse Response (CIR) data from the received packets of the UWB signals. We then use machine learning algorithms to classify the activity (standing, sitting, lying) being performed.
The experiments show that by using CIR data as features we can classify simple activities such as standing, sitting, lying and when the room is empty with an accuracy of 95%.To compare this performance, we trained classification models using Wi-Fi Channel State Information (CSI). We found that for all the models UWB CIR significantly outperformed Wi-Fi CSI in activity classification. This study also includes an application for this system. We used the HAR system for caloric expenditure estimation during a time period. We use HAR to infer the pose and time spent at each pose and use models from the literature to estimate the caloric expenditure for each pose. Our approach reports 32% more calories than what is reported by commercial devices, which are known to severely under-report calories when the subjects are not very active.
Advisors/Committee Members: Gnawali, Omprakash (advisor), Gabriel, Edgar (committee member), Kim, Kyungki (committee member).
Subjects/Keywords: Ultra-Wideband; Device Free; Activity recognition
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sharma, S. 1. (2018). Device Free Activity Recognition using Ultra-Wideband Radio Communication. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/3303
Chicago Manual of Style (16th Edition):
Sharma, Sarthak 1994-. “Device Free Activity Recognition using Ultra-Wideband Radio Communication.” 2018. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/3303.
MLA Handbook (7th Edition):
Sharma, Sarthak 1994-. “Device Free Activity Recognition using Ultra-Wideband Radio Communication.” 2018. Web. 05 Mar 2021.
Vancouver:
Sharma S1. Device Free Activity Recognition using Ultra-Wideband Radio Communication. [Internet] [Masters thesis]. University of Houston; 2018. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/3303.
Council of Science Editors:
Sharma S1. Device Free Activity Recognition using Ultra-Wideband Radio Communication. [Masters Thesis]. University of Houston; 2018. Available from: http://hdl.handle.net/10657/3303

University of Houston
4.
Montakhabi, Hadi 1983-.
HPX-RTE: A LIGHTWEIGHT RUNTIME ENVIRONMENT FOR OPEN MPI.
Degree: MS, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/1272
► High-performance computing systems are growing toward hundreds-of-thousands to million-node machines, utilizing the computing power of billions of cores. Running parallel applications on such large machines…
(more)
▼ High-performance computing systems are growing toward hundreds-of-thousands to million-node machines, utilizing the computing power of billions of cores. Running parallel applications on such large machines efficiently will require optimized runtime environments that are scalable and resilient. Multi- and many-core chip architectures in large-scale supercomputers pose several new challenges to designers of operating systems and runtime environments.
ParalleX is a general-purpose parallel-execution model aiming to overcome the limitations imposed by the current hardware and the way we write applications today. High-Performance ParalleX (HPX) is an experimental runtime system for ParalleX.
The majority of scientific and commercial applications in HPC are written in MPI. In order to facilitate the transition from MPI model to ParalleX, there is a need for a compatibility mechanism between the two. Currently, this mechanism does not exist. This thesis provides a compatibility mechanism for MPI applications to use the HPX runtime system. This is achieved by developing a new runtime system for the Open MPI project, an open source implementation of MPI. This new runtime system is called HPX-RTE.
HPX-RTE is a new, lightweight, and open-source runtime system specifically designed for the emerging exascale computing environment. The system is designed relying on HPX project advanced features to allow for easy extension and transparent scalability. HPX-RTE provides full compatibility for current MPI applications to run on HPX runtime system. HPX-RTE provides an easy and simple path for transition from MPI to HPX. It also paves the way for future hybrid programming models such as HPX-MPI and integration of more features from HPX into Open MPI.
Advisors/Committee Members: Gabriel, Edgar (advisor), Subhlok, Jaspal (committee member), Anand, Rakhi (committee member).
Subjects/Keywords: Parallel programming; Runtime system; Open MPI; Parallex; Hpx; Exascale
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Montakhabi, H. 1. (2015). HPX-RTE: A LIGHTWEIGHT RUNTIME ENVIRONMENT FOR OPEN MPI. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1272
Chicago Manual of Style (16th Edition):
Montakhabi, Hadi 1983-. “HPX-RTE: A LIGHTWEIGHT RUNTIME ENVIRONMENT FOR OPEN MPI.” 2015. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1272.
MLA Handbook (7th Edition):
Montakhabi, Hadi 1983-. “HPX-RTE: A LIGHTWEIGHT RUNTIME ENVIRONMENT FOR OPEN MPI.” 2015. Web. 05 Mar 2021.
Vancouver:
Montakhabi H1. HPX-RTE: A LIGHTWEIGHT RUNTIME ENVIRONMENT FOR OPEN MPI. [Internet] [Masters thesis]. University of Houston; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1272.
Council of Science Editors:
Montakhabi H1. HPX-RTE: A LIGHTWEIGHT RUNTIME ENVIRONMENT FOR OPEN MPI. [Masters Thesis]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1272

University of Houston
5.
Biddle, Nicholas.
Challenges in Converting a Large Scale Proteomics Application to Another Programming Language.
Degree: MS, Computer Science, 2020, University of Houston
URL: http://hdl.handle.net/10657/7272
► Cross-linked mass spectrometry has been gaining popularity lately as a relatively cheap and versatile method for providing macromolecular structural data. However, the software required for…
(more)
▼ Cross-linked mass spectrometry has been gaining popularity lately as a relatively cheap and versatile method for providing macromolecular structural data. However, the software required for matching the ion fragments produced during the mass spectrometry experiments presents a scaling issue that can lead to very long run times. The problem is that matching the spectra present in the mass spectrometry data requires a database search. A full database search is O(n2) in the number of entries in the database. Reducing the number of entries in the database can lead to inaccurate results. It is desirable to be able to perform a full database search as quickly as possible so that the database search is not such a bottleneck for these types of experiments. Many applications exist for performing the spectra matching required for cross-linked mass spectrometry experiments. However, none of these applications is ready for a high-performance computing environment. It is desirable to provide a proteomics search software package that can be executed on a cluster of computers. This project approaches this problem by converting an open-source proteomics search package from C# to C++, which is a more appropriate language for high-performance computing applications. As the program selected for this project is very large, this project only details the conversion of certain aspects of it. These aspects include file input and output functionality, unit test functionality, and providing functions and classes that exist in C# but are missing in C++. The converted functions and classes were evaluated using unit tests and execution time benchmarks. The unit tests were used to determine the correctness of the converted code, while the benchmarks were used to make a comparison between the original C# execution time and the converted C++ execution time.
Advisors/Committee Members: Gabriel, Edgar (advisor), Cheung, Margaret (committee member), Alipour, Amin (committee member).
Subjects/Keywords: Programming Language; Conversion; Proteomics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Biddle, N. (2020). Challenges in Converting a Large Scale Proteomics Application to Another Programming Language. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/7272
Chicago Manual of Style (16th Edition):
Biddle, Nicholas. “Challenges in Converting a Large Scale Proteomics Application to Another Programming Language.” 2020. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/7272.
MLA Handbook (7th Edition):
Biddle, Nicholas. “Challenges in Converting a Large Scale Proteomics Application to Another Programming Language.” 2020. Web. 05 Mar 2021.
Vancouver:
Biddle N. Challenges in Converting a Large Scale Proteomics Application to Another Programming Language. [Internet] [Masters thesis]. University of Houston; 2020. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/7272.
Council of Science Editors:
Biddle N. Challenges in Converting a Large Scale Proteomics Application to Another Programming Language. [Masters Thesis]. University of Houston; 2020. Available from: http://hdl.handle.net/10657/7272

University of Houston
6.
-4435-6546.
Automatic Detection of Nastiness and Early Signs of Cyberbullying Incidents on Social Media.
Degree: PhD, Computer Science, 2020, University of Houston
URL: http://hdl.handle.net/10657/6728
► Although social media has made it easy for people to connect on an unlimited virtual space, it has also opened doors to people who misuse…
(more)
▼ Although social media has made it easy for people to connect on an unlimited virtual space, it has also opened doors to people who misuse it to bully others. Nowadays, abusive behavior and cyberbullying are considered as major issues in cyberspace that can seriously affect the mental and physical health of victims. However, due to the growing number of social media users, manual moderation of online content is impractical. Available automatic systems for hate speech and cyberbullying detection fail to make opportune predictions, which makes them ineffective for warning the possible victims of these attacks. In this thesis, we aim at advancing new technology that will help to protect vulnerable online users against cyber attacks. As a first approximation to this goal, we develop computational methods to identify extremely aggressive texts automatically. We start by exploiting a wide range of linguistic features to create a machine learning model to detect online abusive content. Then, we build a deep neural architecture to identify offensive content in online short and noisy texts more precisely, by incorporating emotion information into textual representations. We further expand these methods and propose a Natural Language Processing system that constantly monitors online conversations, and triggers an alert when a possible case of cyberbullying is happening. We design a new evaluation framework, and show that our system is able to provide timely and accurate cyberbullying predictions, based on limited evidence. In this research, we are mainly concerned about kids and young adults, as the most vulnerable group of users under online attacks. To this end, we propose new language resources for both tasks of abusive language and cyberbullying detection from social media platforms that are specifically popular among youth. Furthermore, within our experimentations, we discuss the differences among these corpora and the other available resources that include data on adult topics.
Advisors/Committee Members: Solorio, Thamar (advisor), Gabriel, Edgar (committee member), Verma, Rakesh M. (committee member), Huang, Ruihong (committee member).
Subjects/Keywords: Natural Language Processing; Abusive Language Detection; Cyberbullying Detection; Early Text Categorization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-4435-6546. (2020). Automatic Detection of Nastiness and Early Signs of Cyberbullying Incidents on Social Media. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/6728
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-4435-6546. “Automatic Detection of Nastiness and Early Signs of Cyberbullying Incidents on Social Media.” 2020. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/6728.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-4435-6546. “Automatic Detection of Nastiness and Early Signs of Cyberbullying Incidents on Social Media.” 2020. Web. 05 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-4435-6546. Automatic Detection of Nastiness and Early Signs of Cyberbullying Incidents on Social Media. [Internet] [Doctoral dissertation]. University of Houston; 2020. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/6728.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-4435-6546. Automatic Detection of Nastiness and Early Signs of Cyberbullying Incidents on Social Media. [Doctoral Dissertation]. University of Houston; 2020. Available from: http://hdl.handle.net/10657/6728
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Houston
7.
Rodgers, John Scott.
MPI Based Python Libraries for Data Science Applications.
Degree: MS, Computer Science, 2020, University of Houston
URL: http://hdl.handle.net/10657/6601
► Tools commonly leveraged to tackle large-scale data science workflows have traditionally shied away from existing high performance computing paradigms, largely due to their lack of…
(more)
▼ Tools commonly leveraged to tackle large-scale data science workflows have traditionally shied away from existing high performance computing paradigms, largely due to their lack of fault tolerance and computation resiliency. However, these concerns are typically only of critical importance to problems tackled by technology companies at the highest level. For the average data scientist, the benefits of resiliency may not be as important as the overall execution performance. To this end, the work of this thesis aims to develop prototypes of tools favored by the data science community that function in a data-parallel environment, taking advantage of functionality commonly used in high performance computing. To achieve this goal, a prototype-distributed clone of the Python NumPy library and a select module from the SciPy library were developed, which leverage MPI for inter-process communication and data transfers while abstracting away the complexity of MPI programming from its users. Through various benchmarks, the overhead introduced by logic necessary to resolve functioning in a data-parallel environment, as well as the scalability of using parallel compute resources for routines commonly used by the emulated libraries, are analyzed. For the distributed NumPy clone, it was found that for routines that could act solely on their local array contents, the impact of the introduced overhead was minimal; while for routines that required global scope of distributed elements, a considerable amount of overhead was introduced. In terms of scalability, both the distributed NumPy clone and select SciPy module, a distributed implementation of K-Means clustering, exhibited reasonably performant results; notably showing sensitivity to local process problem sizes and operations that required large amounts of collective communication/synchronization. As this work mainly focused on the initial exploration and prototyping of behavior, the results of the benchmarks can be used in future development efforts to target operations for refinement and optimization.
Advisors/Committee Members: Gabriel, Edgar (advisor), Shah, Shishir Kirit (committee member), Huarte-Espinosa, Martin (committee member).
Subjects/Keywords: Parallel Python; Message Passing Interface; High Performance Computing; Computer Science; Distributed Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rodgers, J. S. (2020). MPI Based Python Libraries for Data Science Applications. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/6601
Chicago Manual of Style (16th Edition):
Rodgers, John Scott. “MPI Based Python Libraries for Data Science Applications.” 2020. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/6601.
MLA Handbook (7th Edition):
Rodgers, John Scott. “MPI Based Python Libraries for Data Science Applications.” 2020. Web. 05 Mar 2021.
Vancouver:
Rodgers JS. MPI Based Python Libraries for Data Science Applications. [Internet] [Masters thesis]. University of Houston; 2020. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/6601.
Council of Science Editors:
Rodgers JS. MPI Based Python Libraries for Data Science Applications. [Masters Thesis]. University of Houston; 2020. Available from: http://hdl.handle.net/10657/6601

University of Houston
8.
Heydariaan, Milad.
Efficient, Scalable, and Accurate Localization with Ultra-wideband Radios Through Concurrent Transmissions.
Degree: PhD, Computer Science, 2020, University of Houston
URL: http://hdl.handle.net/10657/6715
► The technology to determine the location of a mobile device, also called localization technology, enables us to develop applications and systems that can optimize our…
(more)
▼ The technology to determine the location of a mobile device, also called localization technology, enables us to develop applications and systems that can optimize our work and lives in the physical world. Many IoT applications today rely on GPS for localization. However, GPS fails to provide the necessary location accuracy for indoor applications. Ultra-wideband (UWB) radios have facilitated accurate and precise (10 cm) indoor localization in the past few years. Wireless interference can severely impact the performance of localization and communication systems. Many localization and communication systems avoid or mitigate the destructive interference, which can lead to inefficient use of the wireless spectrum. A relatively new research approach to increase efficiency and scalability is to enable concurrent transmissions, i.e., create techniques that allow multiple transmitters to transmit their packets concurrently while enabling the receivers to successfully receive and decode those packets and consequently reduce the total time required for packet exchanges. Time-of- arrival (ToA)-based localization and angle-of-arrival (AoA)-based localization are two common techniques for precise indoor localization with UWB radios. A UWB receiver node can measure the difference in ToA or AoA from multiple UWB transmitter nodes by analyzing the channel impulse response (CIR). Related work investigated the feasibility of UWB ToA-based concurrent localization, but existing solutions are not practical in real-world environments due to scalability and accuracy issues. To the best of our knowledge, there is no prior work on concurrent AoA estimation. In this dissertation, we focus on three main challenges: (1) designing a reflection resilient concurrent response detection algorithm by making use of the difference between the time deviation of concurrent peaks and multipath components (MPCs); (2) relaxing transmitter processing time constraints by using a clock skew correction method to minimize inaccuracies caused by clock drift; and (3) investigating the feasibility of concurrent AoA estimation with UWB radios and designing an efficient, scalable, and accurate indoor localization system using the angle difference of arrival (ADoA) technique. Our research not only creates new algorithms and designs of localization systems but also evaluates their performance using real-world implementations on state-of-the-art hardware platforms and testbeds.
Advisors/Committee Members: Gnawali, Omprakash (advisor), Subhlok, Jaspal (committee member), Gabriel, Edgar (committee member), Kim, Kyungki (committee member).
Subjects/Keywords: Ultra-wideband; UWB; Angle of Arrival; AoA; Angle Difference of Arrival; ADoA; Localization; Phase Different of Arrival; PDoA; Decawave; Concurrent Transmission; Non-Line of Sight; NLoS; Internet of Things; IoT; Wireless Networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Heydariaan, M. (2020). Efficient, Scalable, and Accurate Localization with Ultra-wideband Radios Through Concurrent Transmissions. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/6715
Chicago Manual of Style (16th Edition):
Heydariaan, Milad. “Efficient, Scalable, and Accurate Localization with Ultra-wideband Radios Through Concurrent Transmissions.” 2020. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/6715.
MLA Handbook (7th Edition):
Heydariaan, Milad. “Efficient, Scalable, and Accurate Localization with Ultra-wideband Radios Through Concurrent Transmissions.” 2020. Web. 05 Mar 2021.
Vancouver:
Heydariaan M. Efficient, Scalable, and Accurate Localization with Ultra-wideband Radios Through Concurrent Transmissions. [Internet] [Doctoral dissertation]. University of Houston; 2020. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/6715.
Council of Science Editors:
Heydariaan M. Efficient, Scalable, and Accurate Localization with Ultra-wideband Radios Through Concurrent Transmissions. [Doctoral Dissertation]. University of Houston; 2020. Available from: http://hdl.handle.net/10657/6715

University of Houston
9.
Sghir, Ilyes 1990-.
Modeling Human Motion for Predicting Usage of Hospital Operating Room.
Degree: MS, Computer Science, 2014, University of Houston
URL: http://hdl.handle.net/10657/1458
► We present a system that exploits existing video streams from an hospital operating room (OR) to infer the OR usage state through Bayesian modeling. We…
(more)
▼ We present a system that exploits existing video streams from an hospital operating room (OR) to infer the OR usage state through Bayesian modeling. We define OR states based on common surgical processes that are relevant for assessing OR efficiency. The human motion pattern within the OR is analyzed to ascertain usage states. The system proposed takes advantage of a discriminatively trained part-based human detector as well as a data association algorithm to reconstruct motion trajectories. Human motion patterns are then extracted using kernel density estimation and a Bayesian classifier is used to assess OR usage states during testing. Our model is tested on a large collection of videos and the results show that human motion patterns provide significant discriminative power in understanding usage of an OR.
Advisors/Committee Members: Shah, Shishir Kirit (advisor), Gabriel, Edgar (committee member), Prasad, Saurabh (committee member).
Subjects/Keywords: Hospital Operating Room; Workflow Monitoring; Pattern recognition; Human motion; Gaussian Kernel Density Estimation; Bayesian inference
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sghir, I. 1. (2014). Modeling Human Motion for Predicting Usage of Hospital Operating Room. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1458
Chicago Manual of Style (16th Edition):
Sghir, Ilyes 1990-. “Modeling Human Motion for Predicting Usage of Hospital Operating Room.” 2014. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1458.
MLA Handbook (7th Edition):
Sghir, Ilyes 1990-. “Modeling Human Motion for Predicting Usage of Hospital Operating Room.” 2014. Web. 05 Mar 2021.
Vancouver:
Sghir I1. Modeling Human Motion for Predicting Usage of Hospital Operating Room. [Internet] [Masters thesis]. University of Houston; 2014. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1458.
Council of Science Editors:
Sghir I1. Modeling Human Motion for Predicting Usage of Hospital Operating Room. [Masters Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/1458

University of Houston
10.
Kazemi Alamouti, Zeinab 1990-.
Timing Analysis of the Abort-and-Restart Paradigm on a Scratchpad Memory-based Execution Platform.
Degree: MS, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/1941
► Priority-based Functional Reactive Programming (P-FRP) is a new variant of FRP to model reactive applications in real-time systems. In P-FRP, when the currently running task…
(more)
▼ Priority-based Functional Reactive Programming (P-FRP) is a new variant of FRP
to model reactive applications in real-time systems. In P-FRP, when the currently
running task is preempted by an arriving higher-priority task, the lower-priority
running task is aborted and the higher-priority task will execute. The lower-priority
task restarts when the higher-priority one completes. However, unlike the preemptive
model, when a task aborts, all the changes made by this task are discarded. That is
to say, when an aborted task restarts, it should execute from the beginning. In order
to provide a realistic Worst-Case Response Time (WCRT) of the tasks in P-FRP,
it is therefore mandatory to derive a realistic Worst-Case Execution Time (WCET)
of each task. Previous studies have ignored memory latency in the derivation of
the WCRT, making the resulting estimate inaccurate and unrealistic. Furthermore,
these studies have also assumed that the WCET of each task is known a priori. In
this thesis, a scratchpad memory (SPM)-based platform for executing P-FRP tasks
and an approach to determine the WCET of the tasks by considering the memory
cost of the aborted tasks is introduced. The WCET of a task in a P-FRP system
is rst computed, and then the memory penalty caused by preemption is derived.
In the next step, the WCRT of the task sets in P-FRP is calculated by considering
memory latency in the proposed platform. Experimental results from the derivations
of the WCET and WCRT using task sets from the SNU real-time benchmarks and
randomly generated tasks are presented to validate this approach.
Advisors/Committee Members: Cheng, Albert M. K. (advisor), Gabriel, Edgar (committee member), Chen, Yuhua (committee member).
Subjects/Keywords: P-FRP; Scratchpad Memory; Worst-case execution time (WCET); Worst-case response time (WCRT)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kazemi Alamouti, Z. 1. (2015). Timing Analysis of the Abort-and-Restart Paradigm on a Scratchpad Memory-based Execution Platform. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1941
Chicago Manual of Style (16th Edition):
Kazemi Alamouti, Zeinab 1990-. “Timing Analysis of the Abort-and-Restart Paradigm on a Scratchpad Memory-based Execution Platform.” 2015. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1941.
MLA Handbook (7th Edition):
Kazemi Alamouti, Zeinab 1990-. “Timing Analysis of the Abort-and-Restart Paradigm on a Scratchpad Memory-based Execution Platform.” 2015. Web. 05 Mar 2021.
Vancouver:
Kazemi Alamouti Z1. Timing Analysis of the Abort-and-Restart Paradigm on a Scratchpad Memory-based Execution Platform. [Internet] [Masters thesis]. University of Houston; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1941.
Council of Science Editors:
Kazemi Alamouti Z1. Timing Analysis of the Abort-and-Restart Paradigm on a Scratchpad Memory-based Execution Platform. [Masters Thesis]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1941

University of Houston
11.
Altuaimi, Abdulelah 1987-.
Towards a New Directive-based Tasking API for Distributed Systems.
Degree: MS, Computer Science, 2016, University of Houston
URL: http://hdl.handle.net/10657/1707
► Programming for large-scale computing requires programming models carefully designed for that purpose. MPI is often the model of choice for distributed systems, but writing MPI…
(more)
▼ Programming for large-scale computing requires programming models carefully designed for that purpose. MPI is often the model of choice for distributed systems, but writing MPI program is time-consuming and complicated to maintain and debug as the program size gets larger. Moreover, MPI does not exploit some of the potential benefits of shared memory systems. Using a hybrid model also requires a high level of programmer expertise. Designing algorithms in terms of tasks potentially reduces the development effort and has many performance-related advantages. In addition, directive-based programming styles have made parallel programming and migration of serial code to multicore chips easier than ever. Although directive-based tasking models have paved the way to distributed systems, they still lack capabilities necessary for efficient large-scale computing.
TagHit is an API proposed by the HPCTools group in the Department of Computer Science at the
University of
Houston. Targeted for exascale computing, TagHit combines the benefits of task-based programming models with the simplicity of directive-based programming styles. This thesis tackles task creation and scheduling in TagHit. First, I present an overview of six existing task-based programming models. Next, I propose an experimental runtime design of TagHit's task creation and scheduling modules and then describe in detail a prototype implementation of the runtime. The goal of this work is to guide the definition of TagHit's concept and semantics and to assess the implementation cost and challenges of creating and scheduling tasks in TagHit. Finally, I present two TagHit benchmarks with results that show the design and implementation have supported the general concept of TagHit with good speedup and scheduling behavior.
Advisors/Committee Members: Subhlok, Jaspal (advisor), Chapman, Barbara M. (committee member), Gabriel, Edgar (committee member), Marcinkiewicz, Henryk (committee member).
Subjects/Keywords: Parallel; Distributed; Shared Memory; Distributed systems; Distributed memory; Directive-based; MPI; API; Tasking; Task-based; Task Scheduling; Work-stealing; Exascale; Large-scale computing; Computing systems; Programming
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Altuaimi, A. 1. (2016). Towards a New Directive-based Tasking API for Distributed Systems. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1707
Chicago Manual of Style (16th Edition):
Altuaimi, Abdulelah 1987-. “Towards a New Directive-based Tasking API for Distributed Systems.” 2016. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1707.
MLA Handbook (7th Edition):
Altuaimi, Abdulelah 1987-. “Towards a New Directive-based Tasking API for Distributed Systems.” 2016. Web. 05 Mar 2021.
Vancouver:
Altuaimi A1. Towards a New Directive-based Tasking API for Distributed Systems. [Internet] [Masters thesis]. University of Houston; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1707.
Council of Science Editors:
Altuaimi A1. Towards a New Directive-based Tasking API for Distributed Systems. [Masters Thesis]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/1707

University of Houston
12.
Islam, Mdtarikul 1986-.
Efficient Message Logging to Support Process Replicas in a Volunteer Computing Environment.
Degree: MS, Computer Science, 2013, University of Houston
URL: http://hdl.handle.net/10657/528
► A volunteer PC grid is a low cost computing environment where nodes are heterogeneous and availability is highly unpredictable. This research is in the context…
(more)
▼ A volunteer PC grid is a low cost computing environment where nodes are heterogeneous and availability is highly unpredictable. This research is in the context of a communication model based on the single sided put/get calls to an abstract global space for communicating parallel applications. This model is a good match for a volunteer environment since the processes can execute their communication operation independently and asynchronously. Parallel applications need replication as well checkpointing to make continuous progress in such a unreliable environment. Since different instances of the same process can execute in the same logical program state at different clock times, communicated data objects must be logged to ensure the replicas of a logical process receive identical communication data streams. Logging to support redundancy can be the source of a significant overhead in time and storage. In this thesis we develop, implement and evaluate and compare pessimistic and optimistic logging schemes to support redundant communication. Pessimistic scheme log a copy of the data object returned to a read/get request. Multiple copies of a data object may present on the log if the data object is read multiple times. On the other hand, optimistic scheme log the old data object when a put request to the server is overwriting it with a new data object. But identifying the correct data object for the replica read request is a challenge, as the replica must receive identical data object to the original read. A Virtual Time Stamp (VTS) that capture global execution state is logged along with data object to make this possible. We develop an optimized pessimistic that ensure only one copy of a data object will be in the dataspace and also have an optimized optimistic that reduce the VTS size and creation time overhead. Our experimental result shows that optimize version of pessimistic and optimistic have better performance in terms of storage and time overhead than regular pessimistic and optimistic. It also shows that optimized pessimistic perform better with most of the applications in volunteer computing environment.
Advisors/Committee Members: Subhlok, Jaspal (advisor), Gabriel, Edgar (committee member), Bittner, Eric R. (committee member).
Subjects/Keywords: Volunteer computing; Cloud computing; Fault tolerance; Message logging; Computer science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Islam, M. 1. (2013). Efficient Message Logging to Support Process Replicas in a Volunteer Computing Environment. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/528
Chicago Manual of Style (16th Edition):
Islam, Mdtarikul 1986-. “Efficient Message Logging to Support Process Replicas in a Volunteer Computing Environment.” 2013. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/528.
MLA Handbook (7th Edition):
Islam, Mdtarikul 1986-. “Efficient Message Logging to Support Process Replicas in a Volunteer Computing Environment.” 2013. Web. 05 Mar 2021.
Vancouver:
Islam M1. Efficient Message Logging to Support Process Replicas in a Volunteer Computing Environment. [Internet] [Masters thesis]. University of Houston; 2013. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/528.
Council of Science Editors:
Islam M1. Efficient Message Logging to Support Process Replicas in a Volunteer Computing Environment. [Masters Thesis]. University of Houston; 2013. Available from: http://hdl.handle.net/10657/528

University of Houston
13.
Jha, Shweta 1986-.
Performance Tuning and Modeling of Communication in Parallel Applications.
Degree: PhD, Computer Science, 2017, University of Houston
URL: http://hdl.handle.net/10657/4509
► The goal of high performance computing is executing very large problems in the least amount of time, typically by deploying parallelization techniques. However, in- troducing…
(more)
▼ The goal of high performance computing is executing very large problems in the least amount of time, typically by deploying parallelization techniques. However, in- troducing parallelization to an application also introduces synchronization and com- munication overhead, which in turn creates a performance bottleneck. Performance modeling and tuning can be used to predict and ease this bottleneck to improve the overall performance of the application.
There are two aspects of an application which can be improved from performance point of view, namely, the computational section and the communication section. The time spent in communication operations is a major factor in determining the scalability of parallel applications. Tuning the parameters of a communication library can be used to adapt its characteristics to a particular platform, minimizing the communication time of an application. On the other hand performance modeling can be used to predict the performance using the network and application attributes.
The goal of this dissertation is to improve the performance of a parallel applica- tion by performance tuning and performance modeling. Specifically, we introduce the notion of a personalized MPI library, highlighting the necessity and the methodology each application needs to have a communication library tuned for the particular plat- form. Secondly, this dissertation contributes towards the theoretical understanding of impact and limitations of point-to-point communication performance on collective communication and the overall application. This study has been further extended to develop performance models for communication aspect of collective I/O for one and two dimensional data decomposition, and for two file partitioning strategies, namely even and static partitioning.
Advisors/Committee Members: Gabriel, Edgar (advisor), Subhlok, Jaspal (committee member), Shi, Weidong (committee member), Gurkan, Deniz (committee member).
Subjects/Keywords: Performance tuning; Performance models; Collective communication; Point-to-point communication
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jha, S. 1. (2017). Performance Tuning and Modeling of Communication in Parallel Applications. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/4509
Chicago Manual of Style (16th Edition):
Jha, Shweta 1986-. “Performance Tuning and Modeling of Communication in Parallel Applications.” 2017. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/4509.
MLA Handbook (7th Edition):
Jha, Shweta 1986-. “Performance Tuning and Modeling of Communication in Parallel Applications.” 2017. Web. 05 Mar 2021.
Vancouver:
Jha S1. Performance Tuning and Modeling of Communication in Parallel Applications. [Internet] [Doctoral dissertation]. University of Houston; 2017. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/4509.
Council of Science Editors:
Jha S1. Performance Tuning and Modeling of Communication in Parallel Applications. [Doctoral Dissertation]. University of Houston; 2017. Available from: http://hdl.handle.net/10657/4509

University of Houston
14.
-4445-2186.
An Interactive Pedestrian Re-Identification Tool with Semantic Based Re-Identification.
Degree: MS, Computer Science, 2016, University of Houston
URL: http://hdl.handle.net/10657/5431
► Person re-identification is an essential task of recognizing and matching people from non-overlapping cameras. A typical application of person re-identification is identifying a particular person…
(more)
▼ Person re-identification is an essential task of recognizing and matching people from non-overlapping cameras. A typical application of person re-identification is identifying a particular person in a gallery of pedestrian images from a camera with one or more given probe images of this person from another camera. This is a chal- lenging and practical task that provides solutions for video-surveillance. In this work, we present a person re-identification software which is called Interactive Pedestrian Re-identification GUI (IPRG), and a semantic-based labelling tool named Reid It (Reidit). According to the growing need for surveillance applications, we develop IPRG to address the person searching and matching problem with the dataset from on-campus security camera videos. From these video frames, we can get semantic in- formation of the candidate such as height, ethnicity, cloth color, etc. By customizing these semantic features in IPRG, we can identify a candidate in the video database rapidly. We also propose a light-labelling tool, Reidit, for labelling pedestrian images with semantic features as the pre-processing for pedestrian recognition. We present an experiment on IPRG with Viewpoint Invariant Pedestrian Recognition (VIPeR) dataset which contains 632 identities. Our experiment shows that our software is more efficient and accurate compared with traditional manual solutions. Moreover, IPRG can handle the situation of missing query person in the database, and it will return the top ten possible individuals. Our software is compatible with different platforms and user-friendly with customizable databases and semantic features.
Advisors/Committee Members: Shah, Shishir Kirit (advisor), Gabriel, Edgar (committee member), Merchant, Fatima Aziz (committee member).
Subjects/Keywords: Person re-identification; Semantic
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-4445-2186. (2016). An Interactive Pedestrian Re-Identification Tool with Semantic Based Re-Identification. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/5431
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-4445-2186. “An Interactive Pedestrian Re-Identification Tool with Semantic Based Re-Identification.” 2016. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/5431.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-4445-2186. “An Interactive Pedestrian Re-Identification Tool with Semantic Based Re-Identification.” 2016. Web. 05 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-4445-2186. An Interactive Pedestrian Re-Identification Tool with Semantic Based Re-Identification. [Internet] [Masters thesis]. University of Houston; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/5431.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-4445-2186. An Interactive Pedestrian Re-Identification Tool with Semantic Based Re-Identification. [Masters Thesis]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/5431
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Houston
15.
-5603-7043.
Performance models for parallel applications under failures.
Degree: PhD, Computer Science, 2017, University of Houston
URL: http://hdl.handle.net/10657/5687
► Due to the growing size of compute clusters, large scale parallel applications increasingly have to deal with hardware malfunctions and other failure scenarios during execution.…
(more)
▼ Due to the growing size of compute clusters, large scale parallel applications increasingly have to deal with hardware malfunctions and other failure scenarios during execution. The overall goal of this research is to get good performance of parallel applications despite failures. This dissertation introduces two mathematical models to improve resilience of parallel applications on two different frameworks. The first one is a mathematical model to minimize job completion time for inter-dependent parallel processes running in a volunteer environment by finding the optimal checkpoint interval. Validation is performed with a sample real world application running on a pool of distributed volunteer nodes. The results shows that the predicted checkpoint interval gives performance closed to optimal checkpoint interval determined empirically after extensive experimentation.
The second part of the dissertation evaluates the performance of Hadoop MapReduce applications, with different execution parameters and under different failure scenarios. The dissertation introduces performance models for Hadoop MapReduce applications considering node and process failures. Having a performance model allows to determine optimal settings for some of the parameters, such as split size. Validation of the model is done by running two MapReduce applications with different parameter settings. The results show that different applications require different settings for the same MapReduce parameters and the proposed model can predict the performance very well.
Advisors/Committee Members: Gabriel, Edgar (advisor), Subhlok, Jaspal (committee member), Pandurangan, Gopal (committee member), Cheung, Margaret S. (committee member).
Subjects/Keywords: Performance models; Parallel Execution; Fault tolerance; Volunteer computing; Checkpointing; Replication; Host Selection; MapReduce; Hadoop
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-5603-7043. (2017). Performance models for parallel applications under failures. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/5687
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-5603-7043. “Performance models for parallel applications under failures.” 2017. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/5687.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-5603-7043. “Performance models for parallel applications under failures.” 2017. Web. 05 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-5603-7043. Performance models for parallel applications under failures. [Internet] [Doctoral dissertation]. University of Houston; 2017. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/5687.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-5603-7043. Performance models for parallel applications under failures. [Doctoral Dissertation]. University of Houston; 2017. Available from: http://hdl.handle.net/10657/5687
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Houston
16.
Velusamy, Gandhimathi 1970-.
Energy-Delay Aware Web Request Routing Using Learning Automata.
Degree: PhD, Computer Science, 2018, University of Houston
URL: http://hdl.handle.net/10657/5708
► The ever-increasing dependency on the Internet in our day-to-day life and the pay-as-you-go model of the cloud computing causes an extensive number of applications to…
(more)
▼ The ever-increasing dependency on the Internet in our day-to-day life and the pay-as-you-go model of the cloud computing causes an extensive number of applications to be deployed as web services. The web services are normally deployed on clusters of redundant servers replicated across different geographical locations to provide reliable and better-quality services. Usually, a front-end server receives the requests from clients and distributes to the redundant servers based on load balancing policies.
The explosion of web services and the replication causes a massive number of servers to be run from data centers. These servers consume enormous electricity and become a concern for data-center owners with increased electricity bills.
The U.S. electricity market possesses spatio-temporal variations in electricity prices. Normally, the requests are served from the nearest servers to the clients. However, this will increase the load on the data centers in more populated areas. Moreover, the electricity rates at the nearest locations may be higher. In this scenario, by making the front-end servers route the requests to the back-end servers based on the electricity prices, the cost of delivering the web services for a data-center owner could be controlled.
However, if we try to optimize the energy cost by serving a request from a location where the electricity cost is cheaper, it may increase the delay in receiving the response based on the distance between the server and client, state of the network and the server. In certain applications, the increased latency in receiving the responses may lead to revenue loss if any dissatisfied customer revokes his subscription.
So, reducing the energy cost without increasing the latency is a great challenge in web-based service delivery. In this dissertation, we propose a solution to reduce the electricity costs for data-center owners and to serve the requests with reduced latency. We propose an online learning automata based request routing algorithm to be run from the front-end servers to select back-end servers with energy-delay awareness. Our experiments on a cloud testbed with real-time workload have proved with better performance in both electricity cost and delay compared to the existing methods.
Advisors/Committee Members: Subhlok, Jaspal (advisor), Lent, Ricardo (committee member), Gnawali, Omprakash (committee member), Gabriel, Edgar (committee member).
Subjects/Keywords: Learning automata; Learning; Cloud; Energy; Web service
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Velusamy, G. 1. (2018). Energy-Delay Aware Web Request Routing Using Learning Automata. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/5708
Chicago Manual of Style (16th Edition):
Velusamy, Gandhimathi 1970-. “Energy-Delay Aware Web Request Routing Using Learning Automata.” 2018. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/5708.
MLA Handbook (7th Edition):
Velusamy, Gandhimathi 1970-. “Energy-Delay Aware Web Request Routing Using Learning Automata.” 2018. Web. 05 Mar 2021.
Vancouver:
Velusamy G1. Energy-Delay Aware Web Request Routing Using Learning Automata. [Internet] [Doctoral dissertation]. University of Houston; 2018. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/5708.
Council of Science Editors:
Velusamy G1. Energy-Delay Aware Web Request Routing Using Learning Automata. [Doctoral Dissertation]. University of Houston; 2018. Available from: http://hdl.handle.net/10657/5708

University of Houston
17.
Chaturvedi, Ananya 1987-.
On Holomorphic Sectional Curvature and Fibrations.
Degree: PhD, Mathematics, 2016, University of Houston
URL: http://hdl.handle.net/10657/1937
► In this dissertation, we prove the existence of a metric of definite holomorphic sectional curvature on certain compact fibrations. The basic idea for these curvature…
(more)
▼ In this dissertation, we prove the existence of a metric of definite holomorphic sectional curvature on certain compact fibrations. The basic idea for these curvature computations is to use the already available information on the signs of the holomorphic sectional curvatures along the base and the fibers of the fibration, and construct an appropriate warped metric on the total space. For a few specific fibrations, like Hirzebruch surfaces, isotrivial families of curves, and product manifolds, we shall also comment on the pinching constants of the holomorphic sectional curvatures. All these results are either in the case of strictly positive holomorphic sectional curvature, or in the case of strictly negative holomorphic sectional curvature. At the end of this dissertation, we give a few examples to show that the sign of the holomorphic sectional curvature of a fibration might not be what we would expect in the cases where the base or the fibers have semi-definite holomorphic sectional curvatures.
Advisors/Committee Members: Heier, Gordon (advisor), Gabriel, Edgar (committee member), Ru, Min (committee member), Ji, Shanyu (committee member).
Subjects/Keywords: Holomorphic sectional curvature; Curvature; Fibration; Negative curvature; Positive curvature; Hirzebruch surface; Isotrivial family of curves; Family of curves; Product manifold; Product metric; Covering space; Semi-definite curvature; Warped metric
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chaturvedi, A. 1. (2016). On Holomorphic Sectional Curvature and Fibrations. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/1937
Chicago Manual of Style (16th Edition):
Chaturvedi, Ananya 1987-. “On Holomorphic Sectional Curvature and Fibrations.” 2016. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1937.
MLA Handbook (7th Edition):
Chaturvedi, Ananya 1987-. “On Holomorphic Sectional Curvature and Fibrations.” 2016. Web. 05 Mar 2021.
Vancouver:
Chaturvedi A1. On Holomorphic Sectional Curvature and Fibrations. [Internet] [Doctoral dissertation]. University of Houston; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1937.
Council of Science Editors:
Chaturvedi A1. On Holomorphic Sectional Curvature and Fibrations. [Doctoral Dissertation]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/1937

University of Houston
18.
Wei, Li 1988-.
Contextual Information for Applications in Video Surveillance.
Degree: PhD, Computer Science, 2016, University of Houston
URL: http://hdl.handle.net/10657/5394
► With a growing network of cameras being used for security applications, video-based monitoring relying on human operators is ineffective and lacking in reliability and scalability.…
(more)
▼ With a growing network of cameras being used for security applications, video-based monitoring relying on human operators is ineffective and lacking in reliability and scalability. In this thesis, I present automatic solutions that enable monitoring of humans in videos, such as identifying same individuals across different cameras (human re-identification) and recognizing human activities.
Analyzing videos using only individual-based features can be very challenging because of the significant appearance and motion variance due to the changing viewpoints, different lighting conditions, and occlusions. Motivated by the fact that people often form groups, it is feasible to model the interaction among group members to disambiguate the individual features in video analysis tasks. This thesis introduces features that leverage the human group as contextual information and demonstrates its performance for the tasks of human re-identification and activity recognition. Two descriptors are introduced for human re-identification. The Subject Centric Group (SCG) feature captures a person’s group appearance and shape information using the estimate of persons' positions in 3D space. The metric is designed to consider both human appearance and group similarity. The Spatial Appearance Group (SAG) feature extracts group appearance and shape information directly from video frames. A random-forest model is trained to predict the group's similarity score. For human activity recognition, I propose context features along with a deep model to recognize the individual subject’s activity in videos of real-world scenes. Besides the motion features of the person, I also utilize group context information and scene context information to improve the recognition performance.
This thesis demonstrates the application of proposed features in both problems. Our experiments show that proposed features can reach state-of-the-art accuracy on challenging re-identification datasets that represent real-world scenario, and can also outperform state-of-the art human activity recognition methods on 5-activities and 6-activities versions of the Collective Activities dataset.
Advisors/Committee Members: Shah, Shishir Kirit (advisor), Subhlok, Jaspal (committee member), Gabriel, Edgar (committee member), Prasad, Saurabh (committee member).
Subjects/Keywords: Context Information; Person re-identification; Activity recognition; Video analytics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wei, L. 1. (2016). Contextual Information for Applications in Video Surveillance. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/5394
Chicago Manual of Style (16th Edition):
Wei, Li 1988-. “Contextual Information for Applications in Video Surveillance.” 2016. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/5394.
MLA Handbook (7th Edition):
Wei, Li 1988-. “Contextual Information for Applications in Video Surveillance.” 2016. Web. 05 Mar 2021.
Vancouver:
Wei L1. Contextual Information for Applications in Video Surveillance. [Internet] [Doctoral dissertation]. University of Houston; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/5394.
Council of Science Editors:
Wei L1. Contextual Information for Applications in Video Surveillance. [Doctoral Dissertation]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/5394

University of Houston
19.
Hao, Pengfei 1989-.
A Checkpointing Restart Approach for OpenSHMEM Fault Tolerance.
Degree: MS, Computer Science, 2016, University of Houston
URL: http://hdl.handle.net/10657/3272
► The Partitioned Global Address Space (PGAS) has emerged recently for parallel programming at large scale. The PGAS ecosystem contains libraries, and languages (often implemented atop…
(more)
▼ The Partitioned Global Address Space (PGAS) has emerged recently for parallel programming at large scale. The PGAS ecosystem contains libraries, and languages (often implemented atop those libraries). One such library is OpenSHMEM, which offers an intuitive and easy-to-use API. OpenSHMEM's main feature is one-sided communication: in which communication and computation can be overlapped easily.
Performing computational science at large scale requires a resilient computing environment. Current computer systems, although generally reliable, do suffer from occasional faults. As the size of leadership high performance computing systems trends towards Exascale, the presence of faults will lead to system failures that cause fatal software failures. To mitigate against this problem requires software resilience, or "fault tolerance." One common approach is to checkpoint and restart from a known good state when an error is detected.
A long-running (e.g., weeks or months) program without fault tolerance will suffer from failure-restart cycles, which introduces unacceptably lengthy, uncertain execution times, and hugely increased resource usage. In this thesis work, we explore a fault tolerance scheme based on check-point and restart that is specialized for the needs of PGAS programming models, using OpenSHMEM as a concrete implementation. Using a 1-D Jacobi code, we show that this kind of approach is scalable and can save considerable resource usage. Ideas for more general solutions and other approaches are presented as future work.
Advisors/Committee Members: Chapman, Barbara M. (advisor), Shamis, Pavel (committee member), Gabriel, Edgar (committee member).
Subjects/Keywords: OpenSHMEM; Fault tolerance; PGAS; One-sided
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hao, P. 1. (2016). A Checkpointing Restart Approach for OpenSHMEM Fault Tolerance. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/3272
Chicago Manual of Style (16th Edition):
Hao, Pengfei 1989-. “A Checkpointing Restart Approach for OpenSHMEM Fault Tolerance.” 2016. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/3272.
MLA Handbook (7th Edition):
Hao, Pengfei 1989-. “A Checkpointing Restart Approach for OpenSHMEM Fault Tolerance.” 2016. Web. 05 Mar 2021.
Vancouver:
Hao P1. A Checkpointing Restart Approach for OpenSHMEM Fault Tolerance. [Internet] [Masters thesis]. University of Houston; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/3272.
Council of Science Editors:
Hao P1. A Checkpointing Restart Approach for OpenSHMEM Fault Tolerance. [Masters Thesis]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/3272

University of Houston
20.
Ge, Shiyao 1991-.
Implementation and Evaluation of Additional Parallel Features of Coarary Fortran.
Degree: MS, Computer Science, 2016, University of Houston
URL: http://hdl.handle.net/10657/3268
► The Fortran 2008 language standard added a feature called "coarrays" to allow parallel programming in Fortran with only minimal changes to existing sequential Fortran programs.…
(more)
▼ The Fortran 2008 language standard added a feature called "coarrays" to allow parallel programming in Fortran with only minimal changes to existing sequential Fortran programs. Coarrays turn Fortran into a Partitioned Global Address Space (PGAS) language, following the Single Program, Multiple Data (SPMD) model. The next revision of the Fortran standard is expected to introduce some more sophisticated coarrays language features. One feature is the "team"; a way of grouping components (images) of parallel Fortran programs. Teams can, for example, be allocated different sub-tasks. Proposed team support in the standard includes statements for forming image teams, reassigning membership of teams, and statements for performing communication and synchronization with respect to image teams. These features are collected and discussed in the Fortran Technical Specification Draft.
In this thesis, we will present implementation and evaluation of some of these new features. The open-source compiler, OpenUH, developed by this research group is extended to implement support for team and collective. We discuss two optimizations we have applied in order to reduce network communication and local memory footprint in the compiler's Coarrays runtime. Experimental results using several micro-benchmarks, one benchmark from the NAS Parallel Benchmark suite and High Performance Linpack suite show that new features make the program logic more concise, while achieving good performance.
Advisors/Committee Members: Chapman, Barbara M. (advisor), Gabriel, Edgar (committee member), Sekachev, Mikhail A. (committee member).
Subjects/Keywords: Coarray Fortran; Runtime library
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ge, S. 1. (2016). Implementation and Evaluation of Additional Parallel Features of Coarary Fortran. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/3268
Chicago Manual of Style (16th Edition):
Ge, Shiyao 1991-. “Implementation and Evaluation of Additional Parallel Features of Coarary Fortran.” 2016. Masters Thesis, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/3268.
MLA Handbook (7th Edition):
Ge, Shiyao 1991-. “Implementation and Evaluation of Additional Parallel Features of Coarary Fortran.” 2016. Web. 05 Mar 2021.
Vancouver:
Ge S1. Implementation and Evaluation of Additional Parallel Features of Coarary Fortran. [Internet] [Masters thesis]. University of Houston; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/3268.
Council of Science Editors:
Ge S1. Implementation and Evaluation of Additional Parallel Features of Coarary Fortran. [Masters Thesis]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/3268

University of Houston
21.
-8617-9683.
A Computational Study of Visual Attention on Objects and Gestures during Infancy.
Degree: PhD, Computer Science, 2017, University of Houston
URL: http://hdl.handle.net/10657/4809
► Understanding the pathway to the development of visual attention and the role of vision in object name learning during infancy have been one of the…
(more)
▼ Understanding the pathway to the development of visual attention and the role of vision in object name learning during infancy have been one of the focus of developmental studies over the years. Head cameras have been increasingly used in such studies as they provide a unique source of information about child's momentary visual experiences by approximating child's visual field and may yield new insights into what factors generate attention in infants. However, frame by frame analysis of such videos is cumbersome and time consuming and several parameters that impact child's visual attention such as constant motion of camera cannot be assessed by human analysis. In this thesis, we propose computer vision tools to help developmental scientists perform automated, fast and accurate analysis on videos collected from child-parent tabletop toy play. The computer vision tools in this thesis are used to further our understanding of the development of visual attention in children on objects and gestures. In the first stage of this thesis, we propose a semi-automated method for object segmentation in child's egocentric videos. The method is applied to large volume of videos and obtain binary masks of toy objects that are being used during child-parent toy play. Afterwards, the object masks are used to study how much of the time children visually attend to objects at progressive ages and the location of objects within their visual field. In the second stage, we propose an automated tool for analysis of motion patterns and parent's gestures in videos that are collected from child-parent toy play from third perspective and eye bird view. The proposed method employs an unsupervised clustering approach for clustering the videos into multiple groups by extracting dense trajectories from image sequences and using k-means clustering. Each motion group is further explored to study potential correlations of motion patterns in parent's gestures with object saliency in child's visual field. The proposed methods in this thesis, enable developmental scientists to explore unknown patterns in the development of child's visual by performing automated and accurate analysis on videos of child-parent toy play obtained from multiple views.
Advisors/Committee Members: Shah, Shishir Kirit (advisor), Subhlok, Jaspal (committee member), Gabriel, Edgar (committee member), Yoshida, Hanako (committee member).
Subjects/Keywords: Object name learning; Infant visual attention; Head camera; Object segmentation; Motion analysis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-8617-9683. (2017). A Computational Study of Visual Attention on Objects and Gestures during Infancy. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/4809
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-8617-9683. “A Computational Study of Visual Attention on Objects and Gestures during Infancy.” 2017. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/4809.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-8617-9683. “A Computational Study of Visual Attention on Objects and Gestures during Infancy.” 2017. Web. 05 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-8617-9683. A Computational Study of Visual Attention on Objects and Gestures during Infancy. [Internet] [Doctoral dissertation]. University of Houston; 2017. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/4809.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-8617-9683. A Computational Study of Visual Attention on Objects and Gestures during Infancy. [Doctoral Dissertation]. University of Houston; 2017. Available from: http://hdl.handle.net/10657/4809
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Houston
22.
Rahman, Mahbubur 1982-.
A Computational Framework to Understand Vascular Adaptation.
Degree: PhD, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/2016
► Researchers have been continuously applying a wide variety of approaches to understand vascular adaptation over the past two decades. However, the specific cause/effect or links…
(more)
▼ Researchers have been continuously applying a wide variety of approaches to understand vascular adaptation over the past two decades. However, the specific cause/effect or links between the hemodynamic factors, inflammatory biochemical mediators, cellular effectors and vascular occlusive phenotype remain unexplained still today. To explain these biological phenomena, we have introduced a multi-scale computational framework to systematically test many hypotheses associated with the vascular adaptation and finally applied this framework to explain some widely observed clinical and experimental cases. Our framework incorporates the cellular activities inside the vein graft influenced by the shear stress and tension, which are two of the most important environmental factors in the vascular adaptation. This is a hybrid agent based model (ABM) coupled with the partial differential equations (PDEs) associated with the calculation of the shear stress. Based on the computational framework, we have designed and developed a modular, adaptive, efficient and scalable simulation program so that we can explain some specific pattern formations associated with the vascular adaptation by pattern recognition algorithms of the framework in real time. Finally, we have coupled a genetic algorithm with the framework to verify the fact that a combination of interesting patterns associated with the vascular adaptation can be regenerated in a multivariate data analysis environment. As a result, this research will reduce the gap in understanding different cases observed in the vascular adaptation.
Advisors/Committee Members: Garbey, Marc (advisor), Berceli, Scott A. (committee member), Tsekos, Nikolaos V. (committee member), Gabriel, Edgar (committee member), Hilford, Victoria (committee member).
Subjects/Keywords: Vascular adaptation; Intimal hyperplasia; Medial hyperplasia; Phenotype
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rahman, M. 1. (2015). A Computational Framework to Understand Vascular Adaptation. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/2016
Chicago Manual of Style (16th Edition):
Rahman, Mahbubur 1982-. “A Computational Framework to Understand Vascular Adaptation.” 2015. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/2016.
MLA Handbook (7th Edition):
Rahman, Mahbubur 1982-. “A Computational Framework to Understand Vascular Adaptation.” 2015. Web. 05 Mar 2021.
Vancouver:
Rahman M1. A Computational Framework to Understand Vascular Adaptation. [Internet] [Doctoral dissertation]. University of Houston; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/2016.
Council of Science Editors:
Rahman M1. A Computational Framework to Understand Vascular Adaptation. [Doctoral Dissertation]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/2016

University of Houston
23.
Mantini, Pranav 1985-.
Contextual Human Trajectory Forecasting within Indoor Environments and Its Applications.
Degree: PhD, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/4880
► A human trajectory is the likely path a human subject would take to get to a destination. Human trajectory forecasting algorithms try to estimate or…
(more)
▼ A human trajectory is the likely path a human subject would take to get to a destination. Human trajectory forecasting algorithms try to estimate or predict this path. Such algorithms have wide applications in robotics, computer vision and video surveillance. Understanding the human behavior can provide useful information towards the design of these algorithms. Human trajectory forecasting algorithm is an interesting problem because the outcome is influenced by many factors, of which we believe that the destination, geometry of the environment, and the humans in it play a significant role. In addressing this problem, we propose a model to estimate the occupancy behavior of humans based on the geometry and behavioral norms. We also develop a trajectory forecasting algorithm that understands this occupancy and leverages it for trajectory forecasting in previously unseen geometries. The algorithm can be useful in a variety of applications. In this work, we show its utility in three applications, namely person re-identification, camera placement optimization, and human tracking. Experiments were performed with real world data and compared to state-of-the-art methods to assess the quality of the forecasting algorithm and the enhancement in the quality of the applications. Results obtained suggests a significant enhancement in the accuracy of trajectory forecasting and the computer vision applications.
Advisors/Committee Members: Shah, Shishir Kirit (advisor), Gabriel, Edgar (committee member), Eick, Christoph F. (committee member), Chen, Guoning (committee member), Prasad, Saurabh (committee member).
Subjects/Keywords: Human trajectory forecasting; Human motion; Person re-identification; People tracking; Camera network; Camera placement; Human behavior
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mantini, P. 1. (2015). Contextual Human Trajectory Forecasting within Indoor Environments and Its Applications. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/4880
Chicago Manual of Style (16th Edition):
Mantini, Pranav 1985-. “Contextual Human Trajectory Forecasting within Indoor Environments and Its Applications.” 2015. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/4880.
MLA Handbook (7th Edition):
Mantini, Pranav 1985-. “Contextual Human Trajectory Forecasting within Indoor Environments and Its Applications.” 2015. Web. 05 Mar 2021.
Vancouver:
Mantini P1. Contextual Human Trajectory Forecasting within Indoor Environments and Its Applications. [Internet] [Doctoral dissertation]. University of Houston; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/4880.
Council of Science Editors:
Mantini P1. Contextual Human Trajectory Forecasting within Indoor Environments and Its Applications. [Doctoral Dissertation]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/4880

University of Houston
24.
-9491-8813.
Scalable Indoor Localization Using Ultra-Wideband Radios.
Degree: PhD, Computer Science, 2019, University of Houston
URL: http://hdl.handle.net/10657/4655
► The recent advances in the Internet of Things (IoT) technologies have started a new era in sensor networks and smart assistant systems. Various types of…
(more)
▼ The recent advances in the Internet of Things (IoT) technologies have started a new era in sensor networks and smart assistant systems. Various types of sensing platforms are being deployed to understand the in-depth behavior of people while maintaining human comfort. Technology that tracks people inside buildings could become a key enabler for many applications in this space. Indoor localization is a process to find the exact location of devices, objects or people inside buildings in which GPS service is mostly unreliable. Existing indoor localization and tracking solutions can be divided into two main categories: passive and active solutions. Passive asset tracking systems are scalable, but their accuracy is limited to a few meters (Room Level). On the other hand, in active tracking scenarios, the target has to carry a tacking device, which makes the location estimation more accurate and robust. In this dissertation, we improve the scalability and robustness of indoor tracking solutions. Ultrawideband (UWB)-based indoor localization techniques are one of the well-known and popular active indoor tracking systems. Large bandwidth of UWB signals makes them resilient to multipath fading problem and brings the ability to estimate the location of a target with a few centimeters error. Despite the recent advancement of the accuracy of UWB based indoor tracking systems, the scalability of these systems did not receive enough attention from the research community until the last few years. In this dissertation, we focus on four primary challenges in scalability of UWB systems: adaptively finding optimum UWB physical layer setting to achieve best ranging performance while maintaining application requirements, reducing deployment constraints by proposing single anchor UWB indoor localization, studying and mitigating the impact of multi-user interference on UWB ranging, and combining ranging traffic with non-ranging traffic to increase the applicability of UWB networks for non-ranging applications.
Advisors/Committee Members: Gnawali, Omprakash (advisor), Subhlok, Jaspal (committee member), Gabriel, Edgar (committee member), Munir, Sirajum (committee member), Kim, Kyungki (committee member).
Subjects/Keywords: Ultrawideband (UWB); Indoor localization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-9491-8813. (2019). Scalable Indoor Localization Using Ultra-Wideband Radios. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/4655
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-9491-8813. “Scalable Indoor Localization Using Ultra-Wideband Radios.” 2019. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/4655.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-9491-8813. “Scalable Indoor Localization Using Ultra-Wideband Radios.” 2019. Web. 05 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-9491-8813. Scalable Indoor Localization Using Ultra-Wideband Radios. [Internet] [Doctoral dissertation]. University of Houston; 2019. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/4655.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-9491-8813. Scalable Indoor Localization Using Ultra-Wideband Radios. [Doctoral Dissertation]. University of Houston; 2019. Available from: http://hdl.handle.net/10657/4655
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Houston
25.
Han, Dong 1985-.
Energy Measurements and Analysis to Understand Computing Systems and Networks.
Degree: PhD, Computer Science, 2014, University of Houston
URL: http://hdl.handle.net/10657/1916
► In this work, we design techniques to use energy instrumentation to study the health and workloads of a computing system. Analysis of energy consumption with…
(more)
▼ In this work, we design techniques to use energy instrumentation to study the health and workloads of a computing system. Analysis of energy consumption with the goal of understanding the computing system in an uncontrolled environment is an open research area. The main challenge is to infer the system state only from discrete time-series energy data.
We have analyzed power-consumption data on computing systems. Our focus is on how to distinguish various events and how to reveal the health of the system. In addition to studying the data collected in a laboratory environment, we have analyzed 3-years of continuous energy measurements of a large enterprise computing environment. We can infer system health, failures, activities, and trends from energy data.
We have investigated power-consumption data of networking systems, especially the low-power wireless networks. We designed two novel features called High-Power-Length-Counter and High-Power-Overlap-Counter. We evaluated our approaches on three real-world testbeds and various network scenarios. We found that these features reveal network protocols, application workloads, and routing topology from energy data alone. This information was not possible to reveal only from energy data prior to this work.
The contributions of this work are: (a) Techniques to analyze and reveal health information of computing system. The energy profiling during boot up, idle and failure exposes operating states of the system. (b) Design of two novel features that use fine-grained energy-instrumentation data on networking systems, to identify routing protocol, infer network topology, and determine application workloads. Our proposed features can achieve 97% accuracy when used to identify the routing protocols, and infer the network topology with 98% accuracy. (c) Identification of sources of waste in computing systems. We found that, at least 60% of energy consumed per day was wasted when the collection of computers we studied were left in idle state in a computer lab environment.
Advisors/Committee Members: Gnawali, Omprakash (advisor), Gabriel, Edgar (committee member), Subhlok, Jaspal (committee member), Vilalta, Ricardo (committee member), Sharma, Abhishek (committee member).
Subjects/Keywords: Energy instrumentation; Computing systems; Networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Han, D. 1. (2014). Energy Measurements and Analysis to Understand Computing Systems and Networks. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/1916
Chicago Manual of Style (16th Edition):
Han, Dong 1985-. “Energy Measurements and Analysis to Understand Computing Systems and Networks.” 2014. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1916.
MLA Handbook (7th Edition):
Han, Dong 1985-. “Energy Measurements and Analysis to Understand Computing Systems and Networks.” 2014. Web. 05 Mar 2021.
Vancouver:
Han D1. Energy Measurements and Analysis to Understand Computing Systems and Networks. [Internet] [Doctoral dissertation]. University of Houston; 2014. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1916.
Council of Science Editors:
Han D1. Energy Measurements and Analysis to Understand Computing Systems and Networks. [Doctoral Dissertation]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/1916

University of Houston
26.
-0416-7970.
Compiler and Runtime Approach for Supporting Efficient Execution of Coarray Fortran Programs.
Degree: PhD, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/4879
► Fortran remains a very widely used programming language for technical computing. Fortran coarrays are new elements in the Fortran standard which aim to support the…
(more)
▼ Fortran remains a very widely used programming language for technical computing. Fortran coarrays are new elements in the Fortran standard which aim to support the development of parallel programs without requiring the use of external constructs such as libraries (e.g. MPI) or directives (e.g. OpenMP). Coarrays provide a Partitioned Global Address Space (PGAS) approach to parallel programming in which the programmer declares arrays to be partitioned across different images that collaboratively perform the computations. However, to date coarrays are not widely used in commercial code since a robust implementation has only been available on Cray platforms. As a result, there has been relatively little experience with coarrays, reporting of performance data, and a clear lack of portability. The work described in this dissertation aims to make a fundamental contribution to the state of the art of parallel programming by providing a robust, open-source implementation of the coarray features in the Fortran standard. It describes an efficient, near-commercial strength implementation technology for coarrays which we developed. An evaluation of this implementation using developed micro-benchmarks is presented, where we show in particular the benefits of our approach for supporting strided communication, synchronization, and collectives compared to other coarray implementations. When running developed benchmarks and codes from real-world applications, we obtained performance with our coarray implementation on par or exceeding that obtained using other implementations. We also present support for additional features expected to be added to the Fortran standard, demonstrating its utility for writing and improving the performance of a range of codes. Finally, we describe an extension for parallel I/O in coarray programs which we designed.
Advisors/Committee Members: Chapman, Barbara M. (advisor), Gabriel, Edgar (committee member), Huang, Lei (committee member), Subhlok, Jaspal (committee member), Weglein, Arthur B. (committee member).
Subjects/Keywords: Compilers; PGAS; Coarrays
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-0416-7970. (2015). Compiler and Runtime Approach for Supporting Efficient Execution of Coarray Fortran Programs. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/4879
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-0416-7970. “Compiler and Runtime Approach for Supporting Efficient Execution of Coarray Fortran Programs.” 2015. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/4879.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-0416-7970. “Compiler and Runtime Approach for Supporting Efficient Execution of Coarray Fortran Programs.” 2015. Web. 05 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-0416-7970. Compiler and Runtime Approach for Supporting Efficient Execution of Coarray Fortran Programs. [Internet] [Doctoral dissertation]. University of Houston; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/4879.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-0416-7970. Compiler and Runtime Approach for Supporting Efficient Execution of Coarray Fortran Programs. [Doctoral Dissertation]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/4879
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Houston
27.
Barigou, Youcef 1987-.
On Communication-Computation Overlap in High-Performance Computing.
Degree: PhD, Computer Science, 2016, University of Houston
URL: http://hdl.handle.net/10657/3274
► The number of compute nodes and cores per node have increased many fold on high end computer systems over the last decade. For a parallel…
(more)
▼ The number of compute nodes and cores per node have increased many fold on high end computer systems over the last decade. For a parallel application to scale to tens or even hundreds of thousands of processes, all non-computing related operations have to be kept at an absolute minimum, including communication operations.
Non-blocking-collective operations extend the concept of collective operations by offering the additional benefit of being able to overlap communication and computation. However, it has been demonstrated that collective operations have to be carefully tuned for a given platform and application scenario to maximize their performance. Also, using non-blocking-collective operations in real-world applications is non-trivial. Application codes often have to be restructured significantly in order to maximize the communication-computation overlap.
The goal of this dissertation is to optimize non-blocking collective-communication operations and facilitate their utilization at the end-user level. This is achieved by an automatic run-time tuning of non-blocking collective-communication operations, which allows the communication library to maximize communication-computation overlap, and choose the best performing implementation for a non-blocking-collective operation on a case by case basis. Specifically, an approach to maximize the communication-computation overlap for hybrid OpenMP/MPI applications is developed. It leverages automatic parallelization by extending existing concepts to utilize non-blocking-collective operations. It also integrates the run-time auto-tuning techniques of non-blocking-collective operations, optimizing both, the algorithms used for the non-blocking-collective operations as well as location and frequency of accompanying progress-function calls.
Advisors/Committee Members: Gabriel, Edgar (advisor), Subhlok, Jaspal (committee member), Shah, Shishir Kirit (committee member), Grabow, Lars C. (committee member).
Subjects/Keywords: High performance computing; Message Passing Interface; MPI; Collective Operations; Communication-computation Overlap; Optimization; Distributed memory; Automatic Parallelization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Barigou, Y. 1. (2016). On Communication-Computation Overlap in High-Performance Computing. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/3274
Chicago Manual of Style (16th Edition):
Barigou, Youcef 1987-. “On Communication-Computation Overlap in High-Performance Computing.” 2016. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/3274.
MLA Handbook (7th Edition):
Barigou, Youcef 1987-. “On Communication-Computation Overlap in High-Performance Computing.” 2016. Web. 05 Mar 2021.
Vancouver:
Barigou Y1. On Communication-Computation Overlap in High-Performance Computing. [Internet] [Doctoral dissertation]. University of Houston; 2016. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/3274.
Council of Science Editors:
Barigou Y1. On Communication-Computation Overlap in High-Performance Computing. [Doctoral Dissertation]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/3274

University of Houston
28.
Yin, Shengrong 1989-.
Heterogeneous Wireless and Visible Light Communication for the Internet of Things.
Degree: PhD, Computer Science, 2018, University of Houston
URL: http://hdl.handle.net/10657/3300
► Connecting sensor, control, and edge devices to the Internet in a reliable and robust way is critical to the success of many big data and…
(more)
▼ Connecting sensor, control, and edge devices to the Internet in a reliable and robust way is critical to the success of many big data and IoT applications. Wireless technologies enable such connectivity but have come under increasing challenge due to the proliferation of devices and increase in data requirements. Devices with wireless connectivity compete with each other in the limited spectrum resources, causing spectrum crunch and interference, which signi cantly hampers the IoT vision. In this dissertation, we study how serious the problem of interference is in wireless networks for IoT, and then propose two solutions to solve this problem. Our goal is to connect IoT devices to the Internet with reliability, robustness, and adaptiveness using edge computing algorithms and methodologies in a practical manner.
One solution is to leverage the wireless interference across various IoT devices. We transformed the interference into a communication channel between these devices and evaluated its feasibility in practical environments. The communication channel was established based on the spectrum sharing by various wireless devices that are using different wireless technologies, such as WiFi, Zigbee, or Bluetooth. In this work, we have achieved one-way communication from WiFi devices to Zigbee devices. We have demonstrated the feasibility to send control signals utilizing the interference. This validates that interference utilization can be a practical solution to solve the spectrum-crunch problem.
The other solution is to avoid interference by exploring new spectrum resources that can provide wireless connectivity. We adopt visible light as the communication medium since it is ubiquitous and free from wireless interference. Existing embedded LED-to-LED communication is considered a promising technique for IoT connectivity. However, low-cost embedded visible light communication (VLC) has been largely restricted by its reliability, robustness, and speed. In this work, we propose adaptive ambient light cancellation to improve the robustness of embedded VLC, we also design, implement, and open-source a novel embedded VLC platform with a 6-7x performance gain compared to state-of-the-art.
Advisors/Committee Members: Gnawali, Omprakash (advisor), Gabriel, Edgar (committee member), Ordonez, Carlos (committee member), Pandurangan, Gopal (committee member), Vieira, Marcos Augusto Menezes (committee member).
Subjects/Keywords: Radio Interference; Crosstalk-based Communication; Visible Light Communication
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yin, S. 1. (2018). Heterogeneous Wireless and Visible Light Communication for the Internet of Things. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/3300
Chicago Manual of Style (16th Edition):
Yin, Shengrong 1989-. “Heterogeneous Wireless and Visible Light Communication for the Internet of Things.” 2018. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/3300.
MLA Handbook (7th Edition):
Yin, Shengrong 1989-. “Heterogeneous Wireless and Visible Light Communication for the Internet of Things.” 2018. Web. 05 Mar 2021.
Vancouver:
Yin S1. Heterogeneous Wireless and Visible Light Communication for the Internet of Things. [Internet] [Doctoral dissertation]. University of Houston; 2018. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/3300.
Council of Science Editors:
Yin S1. Heterogeneous Wireless and Visible Light Communication for the Internet of Things. [Doctoral Dissertation]. University of Houston; 2018. Available from: http://hdl.handle.net/10657/3300
29.
Hans, Charu 1985-.
IMAGE ANALYSIS FOR ZEBRAFISH VASCULATURE.
Degree: PhD, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/1147
► Zebrafish has become a viable model for various research including vertebrate development, gene expression analysis, human diseases modeling, drug screening and toxicology analysis. Zebrafish have…
(more)
▼ Zebrafish has become a viable model for various research including vertebrate development, gene expression analysis, human diseases modeling, drug screening and toxicology analysis. Zebrafish have a closed circulatory system, and the mechanisms of vessel formation are highly similar to those in humans. Being able to model the growth of blood vessel in the vasculature system of zebrafish is interesting for understanding both the circulatory system in humans, and for facilitating large scale screening of the influence of various chemicals on vascular development. Zebrafish embryo is an attractive alternative for environmental risk assessment of chemicals since it offers the possibility to perform high throughput analysis in vivo. Intersegmental vessels (ISV) and caudal vein plexus (CVP) undergo active development via angiogenesis. Hence, providing excellent models to study vasculature system. However, the lack of tools for automated analysis of acquired images is a huge bottleneck in utilizing the zebrafish to its full potential.
Most of the current research based on ISV observe the presence or absence of ISVs or perturbation of ISV morphology but do not quantify growth dynamics. Moreover, these analyses are done manually; hence, it is tedious and expensive. All of these factors drive the need for automated image processing methods to quantitatively analyze the imaged embryos. In this work, we have focused on developing image processing algorithms to automatically segment and quantify ISVs of zebrafish embryos that have been exposed to various chemicals. We tested the algorithms on images of zebrafish embryos obtained from screening compounds that may act as an ISV disruptor. The efficiency of segmentation and quantification approach is demonstrated by our experiments of the entire zebrafish vasculature recorded using a fluorescence microscope.
In this work, we have also presented an approach to segment and detect abnormalities in the CVP region of zebrafish embryos due to exposure to chemicals. Morphological changes due to chemicals exposure are modeled based on the proposed gradient weighted co-occurrence histogram of oriented gradients (gCo-HOG). These features are compared to more commonly use gray level co-occurrence matrix (GLCM), histogram of oriented gradients (HOG) features, and co-occurrence histogram of oriented gradients (Co-HOG) features that utilizes distribution of neighboring pixels to capture spatial structure.
Advisors/Committee Members: Shah, Shishir Kirit (advisor), Merchant, Fatima Aziz (committee member), Gabriel, Edgar (committee member), Chen, Guoning (committee member), Bondesson, Maria (committee member).
Subjects/Keywords: Zebrafish; Image processing; Computer science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hans, C. 1. (2015). IMAGE ANALYSIS FOR ZEBRAFISH VASCULATURE. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/1147
Chicago Manual of Style (16th Edition):
Hans, Charu 1985-. “IMAGE ANALYSIS FOR ZEBRAFISH VASCULATURE.” 2015. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1147.
MLA Handbook (7th Edition):
Hans, Charu 1985-. “IMAGE ANALYSIS FOR ZEBRAFISH VASCULATURE.” 2015. Web. 05 Mar 2021.
Vancouver:
Hans C1. IMAGE ANALYSIS FOR ZEBRAFISH VASCULATURE. [Internet] [Doctoral dissertation]. University of Houston; 2015. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1147.
Council of Science Editors:
Hans C1. IMAGE ANALYSIS FOR ZEBRAFISH VASCULATURE. [Doctoral Dissertation]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1147

University of Houston
30.
Yan, Xu 1986-.
Modeling Local Behavior for Multi-Person Tracking.
Degree: PhD, Computer Science, 2014, University of Houston
URL: http://hdl.handle.net/10657/1895
► Multiple-pedestrian tracking in unconstrained environments is an important task that has received considerable attention from the computer vision community in the past two decades. Accurate…
(more)
▼ Multiple-pedestrian tracking in unconstrained environments is an important task that has received considerable attention from the computer vision community in the past two decades. Accurate multiple-pedestrian tracking can greatly improve the performance of activity recognition and analysis of high level events through a surveillance system.
Traditional approaches to pedestrian tracking build a motion prediction model to track the target. With improvements in object detection methods, recent approaches replace the motion prediction stage and track targets by selecting among the outputs of a detector. To incorporate the merit of traditional and recent approaches, we have developed a novel approach using an ensemble framework that optimally chooses target tracking results from that of independent trackers and a detector at each time step. The compound model is designed to select the best candidate scored by a function integrating detection confidence, appearance affinity, and smoothness constraints.
To further improve the tracking performance we focus on the design of a novel motion prediction model. Human interaction behavior is known to play an important role in human motion. We present a novel tracking approach utilizing human collision avoidance behavior, which is motivated by the human vision system. The model predicts human motion based on modeling of perceived information. An attention map is designed to mimic human reasoning that integrates both spatial and temporal information.
We also develop an enhanced tracker that models human group behavior using a hierarchical group structures. The groups are identified by a bottom-up social group discovery method. The inter- and intra-group structures are modeled as a two-layer graph and tracking is posed as optimization of the integrated structure.
Finally, we propose another novel tracking method to unify multiple human behavior. To investigate the effects of potential multiple social behaviors, we present an algorithm that decomposes the combined social behaviors into multiple basic interaction modes, such as attraction, repulsion, and no interaction. We integrate these multiple social interaction modes into an interactive Markov Chain Monte Carlo tracker and demonstrate how the developed method translates into a more informed motion prediction, resulting in robust tracking performance.
Advisors/Committee Members: Shah, Shishir Kirit (advisor), Gabriel, Edgar (committee member), Eick, Christoph F. (committee member), Prasad, Saurabh (committee member), Kakadiaris, Ioannis A. (committee member).
Subjects/Keywords: Multi-person Tracking; Local Behavior
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yan, X. 1. (2014). Modeling Local Behavior for Multi-Person Tracking. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/1895
Chicago Manual of Style (16th Edition):
Yan, Xu 1986-. “Modeling Local Behavior for Multi-Person Tracking.” 2014. Doctoral Dissertation, University of Houston. Accessed March 05, 2021.
http://hdl.handle.net/10657/1895.
MLA Handbook (7th Edition):
Yan, Xu 1986-. “Modeling Local Behavior for Multi-Person Tracking.” 2014. Web. 05 Mar 2021.
Vancouver:
Yan X1. Modeling Local Behavior for Multi-Person Tracking. [Internet] [Doctoral dissertation]. University of Houston; 2014. [cited 2021 Mar 05].
Available from: http://hdl.handle.net/10657/1895.
Council of Science Editors:
Yan X1. Modeling Local Behavior for Multi-Person Tracking. [Doctoral Dissertation]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/1895
◁ [1] [2] ▶
.