Engineering Commons^™

A Network Path Advising Service, Xiongqi Wu

Theses and Dissertations--Computer Science

A common feature of emerging future Internet architectures is the ability for applications to select the path, or paths, their packets take between a source and destination. Unlike the current Internet architecture where routing protocols find a single (best) path between a source and destination, future Internet routing protocols will present applications with a set of paths and allow them to select the most appropriate path. Although this enables applications to be actively involved in the selection of the paths their packets travel, the huge number of potential paths and the need to know the current network conditions of each …

Misfit: Mining Software Fault Information And Types, Billy R. Kidwell

Theses and Dissertations--Computer Science

As software becomes more important to society, the number, age, and complexity of systems grow. Software organizations require continuous process improvement to maintain the reliability, security, and quality of these software systems. Software organizations can utilize data from manual fault classification to meet their process improvement needs, but organizations lack the expertise or resources to implement them correctly.

This dissertation addresses the need for the automation of software fault classification. Validation results show that automated fault classification, as implemented in the MiSFIT tool, can group faults of similar nature. The resulting classifications result in good agreement for common software faults …

Design Of A Scalable Path Service For The Internet, Mehmet O. Ascigil

Theses and Dissertations--Computer Science

Despite the world-changing success of the Internet, shortcomings in its routing and forwarding system have become increasingly apparent. One symptom is an escalating tension between users and providers over the control of routing and forwarding of packets: providers understandably want to control use of their infrastructure, and users understandably want paths with sufficient quality-of-service (QoS) to improve the performance of their applications. As a result, users resort to various “hacks” such as sending traffic through intermediate end-systems, and the providers fight back with mechanisms to inspect and block such traffic.

To enable users and providers to jointly control routing and …

Application Of Random Indexing To Multi Label Classification Problems: A Case Study With Mesh Term Assignment And Diagnosis Code Extraction, Yuan Lu

Theses and Dissertations--Computer Science

Many manual biomedical annotation tasks can be categorized as instances of the typical multi-label classification problem where several categories or labels from a fixed set need to assigned to an input instance. MeSH term assignment to biomedical articles and diagnosis code extraction from medical records are two such tasks. To address this problem automatically, in this thesis, we present a way to utilize latent associations between labels based on output label sets. We used random indexing as a method to determine latent associations and use the associations as a novel feature in a learning-to-rank algorithm that reranks candidate labels selected …

Multilevel Ant Colony Optimization To Solve Constrained Forest Transportation Planning Problems, Pengpeng Lin

Theses and Dissertations--Computer Science

In this dissertation, we focus on solving forest transportation planning related problems, including constraints that consider negative environmental impacts and multi-objective optimizations that provide forest managers and road planers alternatives for making informed decisions. Along this line of study, several multilevel techniques and mataheuristic algorithms have been developed and investigated. The forest transportation planning problem is a fixed-charge problem and known to be NP-hard. The general idea of utilizing multilevel approach is to solve the original problem of which the computational cost maybe prohibitive by using a set of increasingly smaller problems of which the computational cost is cheaper.

The …