Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
Aspect-Oriented Programming For Test Control, Siyuan Liu
Aspect-Oriented Programming For Test Control, Siyuan Liu
Electronic Theses and Dissertations
Distributed and multithreaded systems are usually much more complex to analyze or test due to the nondeterminism involved. A possible approach to testing nondeterministic systems is to direct the execution of the program under test to take a certain path for each test, so that a unique output can be observed. Considering specification-based testing, we assume that a test case is given together with a test constraint for directing the internal nondeterministic choices. To instruct the program under test to execute according to a given test constraint, the program under test needs to communicate with the tester. In this thesis, …
Pathab: A New Method To Estimate End-To-End Available Bandwidth Of Network Path, Debashis Roy
Pathab: A New Method To Estimate End-To-End Available Bandwidth Of Network Path, Debashis Roy
Electronic Theses and Dissertations
Estimating available bandwidth accurately is extremely important for many network related applications, especially the ones which need real-time traffic information. With the ever increasing use of Internet, several available bandwidth measurement techniques have been proposed. But most of them assume fluid traffic model, whereas studies show that current Internet traffic follows Poisson distribution. Moreover, very few can operate in stand-alone mode and have relatively high estimation errors. We propose a new method, PathAB, which combines the concepts of three existing algorithms, MoSeab, PoissonProb and PathChirp. It first obtains a rough estimation of available bandwidth using an exponential probing train, and …
Webvoice: Speech Access To Traditional Web Content For Blind Users, Shahriar Chandon
Webvoice: Speech Access To Traditional Web Content For Blind Users, Shahriar Chandon
Electronic Theses and Dissertations
Traditional web content and navigation features are made available to blind users by converting a webpage into a speech enabled X+V application, which allows blind users to follow the links present in a web page via speech commands. Also the application can read the different paragraphs and search for a word. This X+V application runs on the Opera browser.
Discovering The Size Of A Deep Web Data Source By Coverage, Jie Liang
Discovering The Size Of A Deep Web Data Source By Coverage, Jie Liang
Electronic Theses and Dissertations
The deep web is a part of the web that can only be accessed via query interfaces. Discovering the size of a deep web data source has been an important and challenging problem ever since the web emerged. The size plays an important role in crawling and extracting a deep web data source. The thesis proposes a new estimation method based on coverage to estimate the size. This method relies on the construction of a query pool that can cover most of the data source. We propose two approaches to constructing a query pool so that document frequency variance is …
Design Of Three-Tiered Sensor Networks With A Mobile Data Collector Under Energy And Buffer Constraints, Da (Leah) Teng
Design Of Three-Tiered Sensor Networks With A Mobile Data Collector Under Energy And Buffer Constraints, Da (Leah) Teng
Electronic Theses and Dissertations
A sensor network consists of a network with a large number of sensor nodes deployed around some phenomenon to gather information. Since the nature of sensor nodes is that their energy is limited, many techniques focus on addressing the problem of minimizing the energy consumption in order to extend the network lifetime. One approach is to deploy relay nodes. However, the requirement to transmit over large distances leads to a high rate of energy dissipation. Therefore, mobile data collectors are introduced to resolve this problem. In this thesis, we present an Integer Linear Programming formulation that takes different parameters into …
A Distributed Algorithm For Finding Separation Pairs In A Computer Network, Katayoon Moazzami
A Distributed Algorithm For Finding Separation Pairs In A Computer Network, Katayoon Moazzami
Electronic Theses and Dissertations
One of the main problems in graph theory is graph connectivity which is often studied for network reliability problems.It can be studied from two aspects, vertex-connectivity and edge-connectivity. Vertex connectivity is the smallest number of vertices whose deletion will cause a connected graph to be disconnected. We focus our work on finding separation pairs of a graph which is the set of pairs of vertices that deleting them would disconnect a graph. Finding separation pairs can be used in solving vertex-connectivity problem and finding the triconnected components of the graph. The algorithms presented during the past are non-linear or if …
Object Segmentation Using Active Contours: A Level Set Approach, Farnaz Shariat
Object Segmentation Using Active Contours: A Level Set Approach, Farnaz Shariat
Electronic Theses and Dissertations
Image segmentation is responsible for partitioning an image into sub-regions based on a preferred feature. Active contour models have widely been used for image segmentation. The use of level set theory has enriched the implementation of active contours with more flexibility and simplicity. The past models of active contours rely on a gradient based stopping function to stop the curve evolution. However, when using gradient information for noisy and textured images, the evolving curve may pass through, or stop far from the salient object boundaries. We propose using a polarity based stopping function. Comparing to the gradient information, the polarity …