Physical Sciences and Mathematics Commons^™

Mining Data From Multiple Software Development Projects, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao, Naeem Seliya

Computer Science Faculty Publications

A large system often goes through multiple software project development cycles, in part due to changes in operation and development environments. For example, rapid turnover of the development team between releases can influence software quality, making it important to mine software project data over multiple system releases when building defect predictors. Data collection of software attributes are often conducted independent of the quality improvement goals, leading to the availability of a large number of attributes for analysis. Given the problems associated with variations in development process, data collection, and quality goals from one release to another emphasizes the importance of …

High-Dimensional Software Engineering Data And Feature Selection, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao

Computer Science Faculty Publications

Software metrics collected during project development play a critical role in software quality assurance. A software practitioner is very keen on learning which software metrics to focus on for software quality prediction. While a concise set of software metrics is often desired, a typical project collects a very large number of metrics. Minimal attention has been devoted to finding the minimum set of software metrics that have the same predictive capability as a larger set of metrics – we strive to answer that question in this paper. We present a comprehensive comparison between seven commonly-used filter-based feature ranking techniques (FRT) …

A Coherent Measurement Of Web-Search Relevance, William Mahoney, Peter Hospodka, William Sousan, Ryan Nickell, Qiuming Zhu

Computer Science Faculty Publications

We present a metric for quantitatively assessing the quality of Web searches. The relevance-of-searching-on-target index measures how relevant a search result is with respect to the searcher's interest and intention. The measurement is established on the basis of the cognitive characteristics of common user's online Web-browsing behavior and processes. We evaluated the accuracy of the index function with respect to a set of surveys conducted on several groups of our college students. While the index is primarily intended to be used to compare the Web-search results and tell which is more relevant, it can be extended to other applications. For …

Stochastic Stability In Internet Router Congestion Games, Christine Chung, Evangelia Pyrga

Computer Science Faculty Publications

No abstract provided.

On The Price Of Stability For Undirected Network Design, Giorgos Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob Van Stee

Computer Science Faculty Publications

No abstract provided.

Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov

Computer Science Faculty Publications

Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work has shown that direct sampling of user lifetimes may lead to certain bias (arising from missed peers and round-off inconsistencies) and proposed a technique that estimates lifetimes based on sampled residuals. In this paper, however, we show that under non-stationary arrivals, which are often present in real systems, residual-based sampling does not correctly reconstruct user lifetimes and suffers a varying degree of bias, which in some cases makes estimation completely impossible. We overcome this problem using two contributions: a …

An Empirical Investigation Of Filter Attribute Selection Techniques For Software Quality Classification, Kehan Gao, Taghi M. Khoshgoftaar, Huanjing Wang

Computer Science Faculty Publications

Attribute selection is an important activity in data preprocessing for software quality modeling and other data mining problems. The software quality models have been used to improve the fault detection process. Finding faulty components in a software system during early stages of software development process can lead to a more reliable final product and can reduce development and maintenance costs. It has been shown in some studies that prediction accuracy of the models improves when irrelevant and redundant features are removed from the original data set. In this study, we investigated four filter attribute selection techniques, Automatic Hybrid Search (AHS), …

Evolutionary Solutions And Internet Applications For Algorithmic Game Theory, Christine Chung

Computer Science Faculty Publications

The growing pervasiveness of the internet has created a new class of algorithmic problems: those in which the strategic interaction of autonomous, self-interested entities must be accounted for. So motivated, we seek to (1) use game theoretic models and techniques to study practical problems in load balancing, data streams and internet traffic congestion, and (2) demonstrate the usefulness of evolutionary game theory’s adaptive model as an analytical and evaluative tool.

First we consider the evolutionary game theory concept of stochastic stability, and propose the price of stochastic anarchy as an alternative to the price of anarchy for quantifying the cost …

Residual-Based Estimation Of Peer And Link Lifetimes In P2p Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov

Computer Science Faculty Publications

Existing methods of measuring lifetimes in P2P systems usually rely on the so-called Create-BasedMethod (CBM), which divides a given observation window into two halves and samples users ldquocreatedrdquo in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we first derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …

Adding Escience Assets To The Data Web, Herbert H. Van De Sompel, Carl Lagoze, Michael L. Nelson, Simeon Warner, Robert Sanderson, Pete Johnston

Computer Science Faculty Publications

Aggregations of Web resources are increasingly important in scholarship as it adopts new methods that are data-centric, collaborative, and networked-based. The same notion of aggregations of resources is common to the mashed-up, socially networked information environment of Web 2.0. We present a mechanism to identify and describe aggregations of Web resources that has resulted from the Open Archives Initiative - Object Reuse and Exchange (OAI-ORE) project. The OAI-ORE specifications are based on the principles of the Architecture of the World Wide Web, the Semantic Web, and the Linked Data effort. Therefore, their incorporation into the cyberinfrastructure that supports eScholarship will …

3d Medical Collaboration Technology To Enhance Emergency Healthcare, Greg Welch, Diane H. Sonnenwald, Henry Fuchs, Bruce Cairns, Ketan Mayer-Patel, Hanna M. Söderholm, Ruigang Yang, Andrei State, Herman Towles, Adrian Ilie, Manoj Ampalam, Srinivas Krishnan, Vincent Noel, Michael Noland, James E. Manning

Computer Science Faculty Publications

Two-dimensional (2D) videoconferencing has been explored widely in the past 15–20 years to support collaboration in healthcare. Two issues that arise in most evaluations of 2D videoconferencing in telemedicine are the difficulty obtaining optimal camera views and poor depth perception. To address these problems, we are exploring the use of a small array of cameras to reconstruct dynamic three-dimensional (3D) views of a remote environment and of events taking place within. The 3D views could be sent across wired or wireless networks to remote healthcare professionals equipped with fixed displays or with mobile devices such as personal digital assistants (PDAs). …

Evaluating Hydrology Preservation Of Simplified Terrain Representations, Christopher S. Stuetzle, W. Randolph Franklin, Barbara Cutler

Computer Science Faculty Publications

We present an error metric based on the potential energy of water flow to evaluate the quality of lossy terrain simplification algorithms. Typically, terrain compression algorithms seek to minimize RMS (root mean square) and maximum error. These metrics fail to capture whether a reconstructed terrain preserves the drainage network. A quantitative measurement of how accurately a drainage network captures the hydrology is important for determining the effectiveness of a terrain simplification technique. Having a measurement for testing and comparing different models has the potential to be widely used in numerous applications (flood prevention, erosion measurement, pollutant propagation, etc). In this …

Extensive Phylogenetic Analysis Of A Soil Bacterial Community Illustrates Extreme Taxon Evenness And The Effects Of Amplicon Length, Degree Of Coverage, And Dna Fractionation On Classification And Ecological Parameters, Sergio E. Morales, Theodore F. Cosart, Jesse Johnson, William Holben

Computer Science Faculty Publications

To thoroughly investigate the bacterial community diversity present in a single composite sample from an agricultural soil and to examine potential biases resulting from data acquisition and analytical approaches, we examined the effects of percent G+C DNA fractionation, sequence length, and degree of coverage of bacterial diversity on several commonly used ecological parameters (species estimation, diversity indices, and evenness). We also examined variation in phylogenetic placement based on multiple commonly used approaches (ARB alignments and multiple RDP tools). The results demonstrate that this soil bacterial community is highly diverse, with 1,714 operational taxonomic units demonstrated and 3,555 estimated (based on …

Node Isolation Model And Age-Based Neighbor Selection In Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov

Computer Science Faculty Publications

Previous analytical studies of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared with uniform selection of neighbors. In fact, the second strategy based on random walks on age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system monotonically increases …

A Community Ice Sheet Model For Sea Level Prediction, William Lipscomb, Robert Bindschadler, Ed Bueler, David Holland, Jesse Johnson, Stephen Price

Computer Science Faculty Publications

Summary of a workshop that was held at Los Alamos National Laboratory, New Mexico, 18-20 August 2008, whose primary goal was to create a detailed plan for developing, testing, and implementing a Community Ice Sheet Model (CISM) to aid in predicting sea level rise.

A Straightforward Path Routing In Wireless Ad Hoc Sensor Networks, Zhen Jiang, Junchao Ma, Wei Lou, Jie Wu

Computer Science Faculty Publications

No abstract provided.

Composing Analysis Patterns To Build Complex Models: Flight Reservation, Zhen Jiang, Eduardo B. Fernandez

Computer Science Faculty Publications

No abstract provided.

Sink-Anonymity Mobility Control In Wireless Sensor Networks, Qijun Gu, Xiao Chen, Zhen Jiang, Jie Wu

Computer Science Faculty Publications

No abstract provided.

User Interface Design, Moritz Stefaner, Sebastien Ferre, Saverio Perugini, Jonathan Koren, Yi Zhang

Computer Science Faculty Publications

As detailed in Chap. 1, system implementations for dynamic taxonomies and faceted search allow a wide range of query possibilities on the data. Only when these are made accessible by appropriate user interfaces, the resulting applications can support a variety of search, browsing and analysis tasks. User interface design in this area is confronted with specific challenges. This chapter presents an overview of both established and novel principles and solutions.

The Effect Of Wavelet Families On Watermarking, Evelyn Brannock, Michael Weeks, Robert W. Harrison

Computer Science Faculty Publications

With the advance of technologies such as the Internet, Wi-Fi Internet availability and mobile access, it is becoming harder than ever to safeguard intellectual property in a digital form. Digital watermarking is a steganographic technique that is used to protect creative content. Copyrighted work can be accessed from many different computing platforms; the same image can exist on a handheld personal digital assistant, as well as a laptop and desktop server computer. For those who want to pirate, it is simple to copy, modify and redistribute digital media. Because this impacts business profits adversely, this is a highly researched field …

Slc30a3 (Znt3) Oligomerization By Dityrosine Bonds Regulates Its Subcellular Localization And Metal Transport Capacity, Gloria Salazar, Juan M. Falcon-Perez, Robert W. Harrison, Victor Faundez

Computer Science Faculty Publications

Non-covalent and covalent homo-oligomerization of membrane proteins regulates their subcellular localization and function. Here, we described a novel oligomerization mechanism affecting solute carrier family 30 member 3/zinc transporter 3 (SLC30A3/ZnT3). Oligomerization was mediated by intermolecular covalent dityrosine bonds. Using mutagenized ZnT3 expressed in PC12 cells, we identified two critical tyrosine residues necessary for dityrosine-mediated ZnT3 oligomerization. ZnT3 carrying the Y372F mutation prevented ZnT3 oligomerization, decreased ZnT3 targeting to synaptic-like microvesicles (SLMVs), and decreased resistance to zinc toxicity. Strikingly, ZnT3 harboring the Y357F mutation behaved as a ‘‘gain-of-function’’ mutant as it displayed increased ZnT3 oligomerization, targeting to SLMVs, and increased resistance …

Reinterpreting No Free Lunch, Jonathan E. Rowe, Michael D. Vose, Alden H. Wright

Computer Science Faculty Publications

Since it’s inception, the “No Free Lunch theorem” has concerned the application of symmetry results rather than the symmetries themselves. In our view, the conflation of result and application obscures the simplicity, generality, and power of the symmetries involved. This paper separates result from application, focusing on and clarifying the nature of underlying symmetries. The result is a general set-theoretic version of NFL which speaks to symmetries when arbitrary domains and co-domains are involved. Although our framework is deterministic, we note situations where our deterministic set-theoretic results speak nevertheless to stochastic algorithms.

Evaluating Multicore Algorithms On The Unified Memory Model, John E. Savage, Mohammad Zubair

Computer Science Faculty Publications

One of the challenges to achieving good performance on multicore architectures is the effective utilization of the underlying memory hierarchy. While this is an issue for single-core architectures, it is a critical problem for multicore chips. In this paper, we formulate the unified multicore model (UMM) to help understand the fundamental limits on cache performance on these architectures. The UMM seamlessly handles different types of multiple-core processors with varying degrees of cache sharing at different levels. We demonstrate that our model can be used to study a variety of multicore architectures on a variety of applications. In particular, we use …

Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle

Computer Science Faculty Publications

Designing secure sensor networks is difficult. We propose an approach that uses multicast communications and requires fewer encryptions than pairwise communications. The network is partitioned into multicast regions; each region is managed by a sensor node chosen to act as a keyserver. The keyservers solicit nodes in their neighborhood to join the local multicast tree. The keyserver generates a binary tree of keys to maintain communication within the multicast region using a shared key. Our approach supports a distributed key agreement protocol that identifies the compromised keys and supports membership changes with minimum system overhead. We evaluate the overhead of …

Exploring Out-Of-Turn Interactions With Websites, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones, Mary E. Pinney, Mary Beth Rosson

Computer Science Faculty Publications

Hierarchies are ubiquitous on the web for structuring online catalogs and indexing multidimensional attributed data sets. They are a natural metaphor for information seeking if their levelwise structure mirrors the user's conception of the underlying domain. In other cases, they can be frustrating, especially if multiple drill‐downs are necessary to arrive at information of interest. To support a broad range of users, site designers often expose multiple faceted classifications or provide within‐page pruning mechanisms. We present a new technique, called out-of-turn interaction, that increases the richness of user interaction at hierarchical sites, without enumerating all possible completion paths in the …

A Secure Group Communication Architecture For Autonomous Unmanned Aerial Vehicle, Adrian N. Phillips, Barry Mullins, Richard Raines, Rusty O. Baldwin

Computer Science Faculty Publications

This paper investigates the application of a secure group communication architecture to a swarm of autonomous unmanned aerial vehicles (UAVs). A multicast secure group communication architecture for the low earth orbit (LEO) satellite environment is evaluated to determine if it can be effectively adapted to a swarm of UAVs and provide secure, scalable, and efficient communications. The performance of the proposed security architecture is evaluated with two other commonly used architectures using a discrete event computer simulation developed using MATLAB. Performance is evaluated in terms of the scalability and efficiency of the group key distribution and management scheme when the …

Everyone Is A Curator: Human-Assisted Preservation For Ore Aggregations, Frank Mccown, Michael L. Nelson, Herbert Van De Sompel

Computer Science Faculty Publications

The Open Archives Initiative (OAI) has recently created the Object Reuse and Exchange (ORE) project that defines Resource Maps (ReMs) for describing aggregations of web resources. These aggregations are susceptible to many of the same preservation challenges that face other web resources. In this paper, we investigate how the aggregations of web resources can be preserved outside of the typical repository environment and instead rely on the thousands of interactive users in the web community and the Web Infrastructure (the collection of web archives, search engines, and personal archiving services) to facilitate preservation. Inspired by Web 2.0 services such as …

Correlation Of Music Charts And Search Engine Rankings, Martin Klein, Olena Hunsicker, Michael Nelson

Computer Science Faculty Publications

We investigate the question whether expert rankings of real-world entities correlate with search engine (SE) rankings of corresponding web resources. We compare Billboards "Hot 100 Airplay" music charts with SE rankings of associated web resources. Out of nine comparisons we found two strong, two moderate, two weak and one negative correlation. The remaining two comparisons were inconclusive.

Object Reuse And Exchange, Michael L. Nelson, Carl Lagoze, Herbert Van De Sompel, Pete Johnston, Robert Sanderson, Simeon Warner, Jürgen Sieck (Ed.), Michael A. Herzog (Ed.)

Computer Science Faculty Publications

The Open Archives Object Reuse and Exchange (OAI-ORE) project defines standards for the description and exchange of aggregations of Web resources. The OAI-ORE abstract data model is conformant with the Architecture of the World Wide Web and leverages concepts from the Semantic Web, including RDF descriptions and Linked Data. In this paper we provide a brief review of a motivating example and its serialization in Atom.

"Your Cell Will Teach You Everything": Old Wisdom, Modern Science, And The Art Of Attention, Noreen L. Herzfeld

Computer Science Faculty Publications

Here is a brief excerpt of the content:

A brother came to Scetis to visit Abba Moses and asked him "Father, give me a word." The old man said to him "Go, sit in your cell, and your cell will teach you everything." ¹ Among the Desert Fathers, Christian monks of the fourth and fifth centuries, it was customary for a novice to go to an elder and ask for "a word," a word of advice, of counsel, a word to take home and reflect on. What does this word of advice say to us today?

A Multitasking World

"Your …