Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Engineering
Transient And Distributed Algorithms To Improve Islanding Detection Capability Of Inverter Based Distributed Generation, Mohamed Al Hosani
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 …
Spectrum Sharing And Service Pricing In Dynamic Spectrum Access Networks, Swastik Kumar Brahma
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
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
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 …