Computer Sciences Commons^™

Data Stream Algorithms For Large Graphs And High Dimensional Data, Hoa Vu

Doctoral Dissertations

In contrast to the traditional random access memory computational model where the entire input is available in the working memory, the data stream model only provides sequential access to the input. The data stream model is a natural framework to handle large and dynamic data. In this model, we focus on designing algorithms that use sublinear memory and a small number of passes over the stream. Other desirable properties include fast update time, query time, and post processing time. In this dissertation, we consider different problems in graph theory, combinatorial optimization, and high dimensional data processing. The first part of …

Algorithms Leveraging Smartphone Sensing For Analyzing Explosion Events, Srinivas Chakravarthi Thandu

Doctoral Dissertations

"The increasing frequency of explosive disasters throughout the world in recent years have created a clear need for the systems to monitor for them continuously to improve the post-disaster emergency events such as rescue and recovery operations. Disasters both man-made and natural are unfortunate and not preferred, however monitoring them may be a lifesaving phenomenon in emergency scenarios. Dedicated sensors deployed in the public places and their associated networks to monitor such events may be inadequate and must be complemented for making the monitoring more pervasive and effective. In the recent past, modern smartphones with significant processing, networking and storage …

Sensitivity Of Mixed Models To Computational Algorithms Of Time Series Data, Gunaime Nevine

Doctoral Dissertations

Statistical analysis is influenced by implementation of the algorithms used to execute the computations associated with various statistical techniques. Over many years; very important criteria for model comparison has been studied and examined, and two algorithms on a single dataset have been performed numerous times. The goal of this research is not comparing two or more models on one dataset, but comparing models with numerical algorithms that have been used to solve them on the same dataset.

In this research, different models have been broadly applied in modeling and their contrasting which are affected by the numerical algorithms in different …

Making Networks Robust To Component Failures, Daniel Gyllstrom

Doctoral Dissertations

In this thesis, we consider instances of component failure in the Internet and in networked cyber-physical systems, such as the communication network used by the modern electric power grid (termed the smart grid). We design algorithms that make these networks more robust to various component failures, including failed routers, failures of links connecting routers, and failed sensors. This thesis divides into three parts: recovery from malicious or misconfigured nodes injecting false information into a distributed system (e.g., the Internet), placing smart grid sensors to provide measurement error detection, and fast recovery from link failures in a smart grid communication …