Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Entire DC Network
Improving Multi-Label Classification By Avoiding Implicit Negativity With Incomplete Data, Derrall L. Heath
Improving Multi-Label Classification By Avoiding Implicit Negativity With Incomplete Data, Derrall L. Heath
Theses and Dissertations
Many real world problems require multi-label classification, in which each training instance is associated with a set of labels. There are many existing learning algorithms for multi-label classification; however, these algorithms assume implicit negativity, where missing labels in the training data are automatically assumed to be negative. Additionally, many of the existing algorithms do not handle incremental learning in which new labels could be encountered later in the learning process. A novel multi-label adaptation of the backpropagation algorithm is proposed that does not assume implicit negativity. In addition, this algorithm can, using a naive Bayesian approach, infer missing labels in …
Modeling Wireless Networks For Rate Control, David C. Ripplinger
Modeling Wireless Networks For Rate Control, David C. Ripplinger
Theses and Dissertations
Congestion control algorithms for wireless networks are often designed based on a model of the wireless network and its corresponding network utility maximization (NUM) problem. The NUM problem is important to researchers and industry because the wireless medium is a scarce resource, and currently operating protocols such as 802.11 often result in extremely unfair allocation of data rates. The NUM approach offers a systematic framework to build rate control protocols that guarantee fair, optimal rates. However, classical models used with the NUM approach do not incorporate partial carrier sensing and interference, which can lead to significantly suboptimal performance when actually …
Backflip: A Principled Approach To Online Attribute Verification, Devlin R. Daley
Backflip: A Principled Approach To Online Attribute Verification, Devlin R. Daley
Theses and Dissertations
As traditional interactions in the real-word move online, services that require verified personal information from web users will increase. We propose an architecture for the verification of web user attributes without the use of cryptographic-based credentials. In this architecture, service providers are delegated a user's ability to directly contact a certifying party and retrieve attribute data. We demonstrate that this approach is simple for both developers and users, can be applied to existing Internet facilities and sufficiently secure for typical web use cases.
A Bittorrent Proxy, Robert Brent Larsen
A Bittorrent Proxy, Robert Brent Larsen
Theses and Dissertations
BitTorrent is a peer-to-peer protocol useful for distributing large files over the Internet. Many organizations use BitTorrent to distribute their software in order to reduce client download time and reduce the load on their servers. While there is a lot of legitimate content available via BitTorrent, some organizations ban BitTorrent usage due to concerns over copyright infringement and the amount of bandwidth that peers can consume. A BitTorrent proxy will allow organizations to control those risks and allow its members to use the BitTorrent protocol for approved uses. It will allow the organization to control the files that are downloaded …
Hop-By-Hop Transport Control For Multi-Hop Wireless Networks, Daniel N. Scofield
Hop-By-Hop Transport Control For Multi-Hop Wireless Networks, Daniel N. Scofield
Theses and Dissertations
TCP can perform poorly in multi-hop wireless networks due to problems with contention and poor feedback from end-to-end control algorithms. This thesis explores the design of a hop-by-hop transport protocol (HxH). By allowing intermediate nodes to actively participate, the protocol can respond more quickly to changing network conditions and exploit the unique characteristics of wireless networks. Results indicate that hop-by-hop transport can achieve throughput rates that are double those of TCP, depending on the speed of the wireless links.
Observational Studies Of Software Engineering Using Data From Software Repositories, Daniel Pierce Delorey
Observational Studies Of Software Engineering Using Data From Software Repositories, Daniel Pierce Delorey
Theses and Dissertations
Data for empirical studies of software engineering can be difficult to obtain. Extrapolations from small controlled experiments to large development environments are tenuous and observation tends to change the behavior of the subjects. In this thesis we propose the use of data gathered from software repositories in observational studies of software engineering. We present tools we have developed to extract data from CVS repositories and the SourceForge Research Archive. We use these tools to gather data from 9,999 Open Source projects. By analyzing these data we are able to provide insights into the structure of Open Source projects. For example, …