Engineering Commons^™

Modeling User Transportation Patterns Using Mobile Devices, Erfan Davami

Electronic Theses and Dissertations

Participatory sensing frameworks use humans and their computing devices as a large mobile sensing network. Dramatic accessibility and affordability have turned mobile devices (smartphone and tablet computers) into the most popular computational machines in the world, exceeding laptops. By the end of 2013, more than 1.5 billion people on earth will have a smartphone. Increased coverage and higher speeds of cellular networks have given these devices the power to constantly stream large amounts of data. Most mobile devices are equipped with advanced sensors such as GPS, cameras, and microphones. This expansion of smartphone numbers and power has created a sensing …

Computational Methods For Comparative Non-Coding Rna Analysis: From Structural Motif Identification To Genome-Wide Functional Classification, Cuncong Zhong

Electronic Theses and Dissertations

Recent advances in biological research point out that many ribonucleic acids (RNAs) are transcribed from the genome to perform a variety of cellular functions, rather than merely acting as information carriers for protein synthesis. These RNAs are usually referred to as the non-coding RNAs (ncRNAs). The versatile regulation mechanisms and functionalities of the ncRNAs contribute to the amazing complexity of the biological system. The ncRNAs perform their biological functions by folding into specific structures. In this case, the comparative study of the ncRNA structures is key to the inference of their molecular and cellular functions. We are especially interested in …

Transient And Distributed Algorithms To Improve Islanding Detection Capability Of Inverter Based Distributed Generation, Mohamed Al Hosani

Electronic Theses and Dissertations

Recently, a lot of research work has been dedicated toward enhancing performance, reliability and integrity of distributed energy resources that are integrated into distribution networks. The problem of islanding detection and islanding prevention (i.e. anti-islanding) has stimulated a lot of research due to its role in severely compromising the safety of working personnel and resulting in equipment damages. Various Islanding Detection Methods (IDMs) have been developed within the last ten years in anticipation of the tremendous increase in the penetration of Distributed Generation (DG) in distribution system. This work proposes new IDMs that rely on transient and distributed behaviors to …

A Comparative Evaluation Of Fdsa,Ga, And Sa Non-Linear Programming Algorithms And Development Of System-Optimal Methodology For Dynamic Pricing On I-95 Express, Don Graham

Electronic Theses and Dissertations

As urban population across the globe increases, the demand for adequate transportation grows. Several strategies have been suggested as a solution to the congestion which results from this high demand outpacing the existing supply of transportation facilities. High –Occupancy Toll (HOT) lanes have become increasingly more popular as a feature on today’s highway system. The I-95 Express HOT lane in Miami Florida, which is currently being expanded from a single Phase (Phase I) into two Phases, is one such HOT facility. With the growing abundance of such facilities comes the need for indepth study of demand patterns and development of …

Algorithms For Community Identification In Complex Networks, Mahadevan Vasudevan

Electronic Theses and Dissertations

First and foremost, I would like to extend my deepest gratitude to my advisor, Professor Narsingh Deo, for his excellent guidance and encouragement, and also for introducing me to this wonderful science of complex networks. Without his support this dissertation would not have been possible. I would also like to thank the members of my research committee, professors Charles Hughes, Ratan Guha, Mainak Chatterjee and Yue Zhao for their advice and guidance during the entire process. I am indebted to the faculty and the staff of the Department of Electrical Engineering and Computer Science for providing me the resources and …

Spectrum Sharing And Service Pricing In Dynamic Spectrum Access Networks, Swastik Kumar Brahma

Electronic Theses and Dissertations

Traditionally, radio spectrum has been statically allocated to wireless service providers (WSPs). Regulators, like FCC, give wireless service providers exclusive long term licenses for using specific range of frequencies in particular geographic areas. Moreover, restrictions are imposed on the technologies to be used and the services to be provided. The lack of flexibility in static spectrum allocation constrains the ability to make use of new technologies and the ability to redeploy the spectrum to higher valued uses, thereby resulting in inefficient spectrum utilization [23, 38, 42, 62, 67]. These limitations have motivated a paradigm shift from static spectrum allocation towards …

Global Secure Sets Of Trees And Grid-Like Graphs, Yiu Yu Ho

Electronic Theses and Dissertations

Let G = (V, E) be a graph and let S ⊆ V be a subset of vertices. The set S is a defensive alliance if for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. The concept of defensive alliances was introduced in [KHH04], primarily for the modeling of nations in times of war, where allied nations are in mutual agreement to join forces if any one of them is attacked. For a vertex x in a defensive alliance, the number of neighbors of x inside the alliance, plus the vertex x, is at least the number …

Labeled Sampling Consensus A Novel Algorithm For Robustly Fitting Multiple Structures Using Compressed Sampling, Carl J. Messina

Electronic Theses and Dissertations

The ability to robustly fit structures in datasets that contain outliers is a very important task in Image Processing, Pattern Recognition and Computer Vision. Random Sampling Consensus or RANSAC is a very popular method for this task, due to its ability to handle over 50% outliers. The problem with RANSAC is that it is only capable of finding a single structure. Therefore, if a dataset contains multiple structures, they must be found sequentially by finding the best fit, removing the points, and repeating the process. However, removing incorrect points from the dataset could prove disastrous. This thesis offers a novel …

Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-Parallel Graphs, Rosa Enciso

Electronic Theses and Dissertations

Alliances are used to denote agreements between members of a group with similar interests. Alliances can occur between nations, biological sequences, business cartels, and other entities. The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in . A defensive alliance in a graph G = (V, E) is a non empty set S ⊆ V where, for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. Consequently, every vertex that is a member of a defensive alliance has at least as many vertices defending it as there are vertices attacking it. Alliances can …

Dynamic Shared State Maintenance In Distributed Virtual Environments, Felix George Hamza-Lup

Electronic Theses and Dissertations

Advances in computer networks and rendering systems facilitate the creation of distributed collaborative environments in which the distribution of information at remote locations allows efficient communication. Particularly challenging are distributed interactive Virtual Environments (VE) that allow knowledge sharing through 3D information. In a distributed interactive VE the dynamic shared state represents the changing information that multiple machines must maintain about the shared virtual components. One of the challenges in such environments is maintaining a consistent view of the dynamic shared state in the presence of inevitable network latency and jitter. A consistent view of the shared scene will significantly increase …

Implementation Of Inversion Algorithms In Reconfigurable Systolic Arrays, Haritini E. Andre

Retrospective Theses and Dissertations

Reducing the computing time of the matrix inversion has been a concern of many authors. The use of Systolic architectures containing orthogonally connected processing elements capable of few instructions multiple data have allowed for new algorithms to be implemented. Two algorithms are examined that rely on the triangularization methods for matrix inversion. One can be applied to the general non-singular matrix and the other to the symmetric matrix. The throughput in both implementation is revolutionized. The speed improvement over Liu and Young’s implementation of the symmetric matrix inversion is by a factor of three.

The throughput in both implementation is …

A Gate-Array Realization Of An Algorithm For Division, Salman Y. Abbasi

Retrospective Theses and Dissertations

A realization of a division algorithm suitable for high speed pipeline and realtime processors is presented. Implementation of the divide algorithm can be achieved by utilizing LSI / VLSI gate array technology. The divider performs precision, high speed 9 bit sign magnitude division. The design consist of combinational logic, where input and output data are latched into input and output registers. Data propagates through 16 divide stages. The n'th stage generates the n'th quotient bit upon receiving the updated dividend and controls from the previous stage. A simulation program is developed to verify the algorithm, and an analysis for speed …

Computer Solution Of Linear Programming Problems Using The Decomposition Algorithm, Walter Paul Kraslawsky

Retrospective Theses and Dissertations

No abstract provided.