Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

PDF

All Theses and Dissertations (ETDs)

Theses/Dissertations

2009

Computer Science

Articles 1 - 6 of 6

Full-Text Articles in Entire DC Network

Adaptive Middleware For Resource-Constrained Mobile Ad Hoc And Wireless Sensor Networks, Chien-Liang Fok Jan 2009

Adaptive Middleware For Resource-Constrained Mobile Ad Hoc And Wireless Sensor Networks, Chien-Liang Fok

All Theses and Dissertations (ETDs)

Mobile ad hoc networks: MANETs) and wireless sensor networks: WSNs) are two recently-developed technologies that uniquely function without fixed infrastructure support, and sense at scales, resolutions, and durations previously not possible. While both offer great potential in many applications, developing software for these types of networks is extremely difficult, preventing their wide-spread use. Three primary challenges are: 1) the high level of dynamics within the network in terms of changing wireless links and node hardware configurations,: 2) the wide variety of hardware present in these networks, and: 3) the extremely limited computational and energy resources available. Until now, the burden …


Statistical Aggregation: Theory And Applications, Ruibin Xi Jan 2009

Statistical Aggregation: Theory And Applications, Ruibin Xi

All Theses and Dissertations (ETDs)

Due to their size and complexity, massive data sets bring many computational challenges for statistical analysis, such as overcoming the memory limitation and improving computational efficiency of traditional statistical methods. In the dissertation, I propose the statistical aggregation strategy to conquer such challenges posed by massive data sets. Statistical aggregation partitions the entire data set into smaller subsets, compresses each subset into certain low-dimensional summary statistics and aggregates the summary statistics to approximate the desired computation based on the entire data. Results from statistical aggregation are required to be asymptotically equivalent. Statistical aggregation processes the entire data set part by …


Networking Mechanisms For Delay-Sensitive Applications, Maxim Podlesny Jan 2009

Networking Mechanisms For Delay-Sensitive Applications, Maxim Podlesny

All Theses and Dissertations (ETDs)

The diversity of applications served by the explosively growing Internet is increasing. In particular, applications that are sensitive to end-to-end packet delays become more common and include telephony, video conferencing, and networked games. While the single best-effort service of the current Internet favors throughput-greedy traffic by equipping congested links with large buffers, long queuing at the congested links hurts the delay-sensitive applications. Furthermore, while numerous alternative architectures have been proposed to offer diverse network services, the innovative alternatives failed to gain widespread end-to-end deployment. This dissertation explores different networking mechanisms for supporting low queueing delay required by delay-sensitive applications. In …


Design And Evaluation Of Distributed Algorithms For Placement Of Network Services, Todd Sproull Jan 2009

Design And Evaluation Of Distributed Algorithms For Placement Of Network Services, Todd Sproull

All Theses and Dissertations (ETDs)

Network services play an important role in the Internet today. They serve as data caches for websites, servers for multiplayer games and relay nodes for Voice over IP: VoIP) conversations. While much research has focused on the design of such services, little attention has been focused on their actual placement. This placement can impact the quality of the service, especially if low latency is a requirement. These services can be located on nodes in the network itself, making these nodes supernodes. Typically supernodes are selected in either a proprietary or ad hoc fashion, where a study of this placement is …


Scheduling Policy Design Using Stochastic Dynamic Programming, Robert Glaubius Jan 2009

Scheduling Policy Design Using Stochastic Dynamic Programming, Robert Glaubius

All Theses and Dissertations (ETDs)

Scheduling policies for open soft real-time systems must be able to balance the competing concerns of meeting their objectives under exceptional conditions while achieving good performance in the average case. Balancing these concerns requires modeling strategies that represent the range of possible task behaviors, and solution techniques that are capable of effectively managing uncertainty in order to discover scheduling policies that are effective across the range of system modes. We develop methods for solving a particular class of task scheduling problems in an open soft real-time setting involving repeating, non-preemptable tasks that contend for a single shared resource. We enforce …


Structural Rna Homology Search And Alignment Using Covariance Models, Eric Nawrocki Jan 2009

Structural Rna Homology Search And Alignment Using Covariance Models, Eric Nawrocki

All Theses and Dissertations (ETDs)

Functional RNA elements do not encode proteins, but rather function directly as RNAs. Many different types of RNAs play important roles in a wide range of cellular processes, including protein synthesis, gene regulation, protein transport, splicing, and more. Because important sequence and structural features tend to be evolutionarily conserved, one way to learn about functional RNAs is through comparative sequence analysis - by collecting and aligning examples of homologous RNAs and comparing them. Covariance models: CMs) are powerful computational tools for homology search and alignment that score both the conserved sequence and secondary structure of an RNA family. However, due …