Computer Sciences Commons^™

Directed Test Suite Augmentation, Zhihong Xu

School of Computing: Conference and Workshop Papers

Test suite augmentation techniques are used in regression testing to identify code elements affected by changes and to generate test cases to cover those elements. Whereas methods and techniques to find affected elements have been extensively researched in regression testing, how to generate new test cases to cover these elements cost-effectively has rarely been studied. It is known that generating test cases is very expensive, so we want to focus on this second step. We believe that reusing existing test cases will help us achieve this task. This research intends to provide a framework for test suite augmentation techniques that …

Tcp Congestion Avoidance Algorithm Identification, Peng Yang, Wen Luo, Lisong Xu, Jitender S. Deogun, Ying Lu

School of Computing: Conference and Workshop Papers

The Internet has recently been evolving from homogeneous congestion control to heterogeneous congestion control. Several years ago, Internet traffic was mainly controlled by the traditional AIMD algorithm, whereas Internet traffic is now controlled by many different TCP algorithms, such as AIMD, BIC, CUBIC, and CTCP. However, there is very little work on the performance and stability study of the Internet with heterogeneous congestion control. One fundamental reason is the lack of the deployment information of different TCP algorithms. In this paper, we first propose a tool called TCP Congestion Avoidance Algorithm Identification (CAAI) for actively identifying the TCP algorithm of …

Using Property-Based Oracles When Testing Embedded System Applications, Tingting Yu, Ahyoung Sung, Witawas Srisaan, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Embedded systems are becoming increasingly ubiquitous, controlling a wide variety of popular and safety critical devices. Effective testing techniques could improve the dependability of these systems. In prior work we presented an approach for testing embedded systems, focusing on embedded system applications and the tasks that comprise them. In this work we focus on a second but equally important aspect of testing embedded systems; namely, the need to provide observability of system behavior sufficient to allow engineers to detect failures. We present several property-based oracles that can be instantiated in embedded systems through program analysis and instrumentation, and can detect …

Automatic Generation Of Load Tests, Pingyu Zhang, Sebastian Elbaum, Matthew Dwyer

School of Computing: Conference and Workshop Papers

Load tests aim to validate whether system performance is acceptable under peak conditions. Existing test generation techniques induce load by increasing the size or rate of the input. Ignoring the particular input values, however, may lead to test suites that grossly mischaracterize a system’s performance. To address this limitation we introduce a mixed symbolic execution based approach that is unique in how it 1) favors program paths associated with a performance measure of interest, 2) operates in an iterative-deepening beam-search fashion to discard paths that are unlikely to lead to high-load tests, and 3) generates a test suite of a …

Response Time Analysis Of Hierarchical Scheduling: The Synchronized Deferrable Servers Approach, Haitao Zhu, Steve Goddard, M. Dwyer

School of Computing: Conference and Workshop Papers

Hierarchical scheduling allows reservation of processor bandwidth and the use of different schedulers for different applications on a single platform. We propose a hierarchical scheduling interface called synchronized deferrable servers that can reserve different processor bandwidth on each core, and can combine global and partitioned scheduling on a multicore platform. Significant challenges will arise in the response time analysis of a task set if the tasks are globally scheduled on a multiprocessor platform and the processor bandwidth reserved for the tasks on each processor is different; as a result, existing works on response time analysis for dedicated scheduling on identical …

Experiences With Dynamic Circuit Creation In A Regional Network Testbed, Pragatheeswaran Angu, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

In this paper we share our experiences of enabling dynamic circuit creation in the GpENI network. GpENI is a network research testbed in the mid-west USA involving several educational institutions. University of Nebraska-Lincoln is involved in provisioning dynamic circuits across the GpENI network among its participating universities. We discuss several options investigated for deploying dynamic circuits over the GpENI network as well as our demonstration experiments at the GENI engineering conferences. UNL has also collaborated with ProtoGENI project of University of Utah and Mid-Atlantic Crossroads (MAX) facility of Washington DC to create interdomain dynamic circuits.

Analysis Of Event Detection Delay In Wireless Sensor Networks, Yunbo Wang, Mehmet C. Vuran, Steve Goddard

School of Computing: Conference and Workshop Papers

Emerging applications of wireless sensor networks (WSNs) require real-time event detection to be provided by the network. In a typical event monitoring WSN, multiple reports are generated by several nodes when a physical event occurs, and are then forwarded through multi-hop communication to a sink that detects the event. To improve the event detection reliability, usually timely delivery of a certain number of packets is required. Traditional timing analysis of WSNs are, however, either focused on individual packets or traffic flows from individual nodes. In this paper, a spatio-temporal fluid model is developed to capture the delay characteristics of event …

Testing Embedded System Applications, Tingting Yu

School of Computing: Dissertations, Theses, and Student Research

Embedded systems are becoming increasingly ubiquitous, controlling a wide variety of popular and safety-critical devices. Testing is the most commonly used method for validating software systems, and effective testing techniques could be helpful for improving the dependability of these systems. However, there are challenges involved in developing such techniques. Embedded systems consist of layers of software – application layers utilize services provided by underlying system service and hardware support layers. A typical embedded application consists of multiple user tasks. Interactions between application layers and lower layers, and interactions between the various user tasks that are initiated by the application layer, …

The R Journal (December 2010) 2(2): Complete Issue, The R Foundation

The R Journal

Contributed Research Articles

Solving Differential Equations in R, Karline Soetaert, Thomas Petzoldt and R. Woodrow Setzer

Source References, Duncan Murdoch

hglm: A Package for Fitting Hierarchical Generalized Linear Models, Lars Rönnegård, Xia Shen and Moudud Alam

dclone: Data Cloning in R, Péter Sólymos

stringr: Modern, Consistent String Processing, Hadley Wickham

Bayesian Estimation of the GARCH(1,1) Model with Student-t Innovations, David Ardia and Lennart F. Hoogerheide

cudaBayesreg: Bayesian Computation in CUDA, Adelino Ferreira da Silva

binGroup: A Package for Group Testing, Christopher R. Bilder, Boan Zhang, Frank Schaarschmidt, and Joshua M. Tebbs

The RecordLinkage Package: Detecting Errors in Data, Murat Sariyar …

The Recordlinkage Package: Detecting Errors In Data, Murat Sariyar, Andreas Borg

The R Journal

Record linkage deals with detecting homonyms and mainly synonyms in data. The package RecordLinkage provides means to per form and evaluate different record linkage methods. A stochastic framework is implemented which calculates weights through an EM algorithm. The determination of the necessary thresholds in this model can be achieved by tools of extreme value theory. Furthermore, machine learning methods are utilized, including decision trees (rpart), bootstrap aggregating (bagging), ada boost (ada), neural nets (nnet) and support vector machines (svm). The generation of record pairs and comparison patterns from single data …

Bingroup: A Package For Group Testing, Christopher R. Bilder, Boan Zhang, Frank Schaarschmidt, Joshua M. Tebbs

The R Journal

When the prevalence of a disease or of some other binary characteristic is small, group testing (also known as pooled testing) is frequently used to estimate the prevalence and/or to identify individuals as positive or negative. We have developed the binGroup package as the first package designed to address the estimation problem in group testing. We present functions to estimate an overall prevalence for a homogeneous population. Also, for this set ting, we have functions to aid in the very important choice of the group size. When individuals come from a heterogeneous population, our group testing regression functions can be …

Stringr: Modern, Consistent String Processing, Hadley Wickham

The R Journal

String processing is not glamorous, but it is frequently used in data cleaning and preparation. The existing string functions in R are powerful, but not friendly. To remedy this, the stringr package provides string functions that are simpler and more consistent, and also fixes some functionality that R is missing compared to other programming languages.

Source References, Duncan Murdoch

The R Journal

Since version 2.10.0, R includes expanded support for source references in R code and ‘.Rd’ files. This paper describes the origin and purposes of source references, and current and future support for them.

Mapping And Measuring Country Shapes, Nils B. Weidmann, Kristian Skrede Gleditsch

The R Journal

The article introduces the cshapes R package, which includes our CShapes dataset of contemporary and historical country boundaries, as well as computational tools for computing geographical measures from these maps. We provide an overview of the need for considering spatial dependence in comparative re search, how this requires appropriate historical maps, and detail how the cshapes associated R package cshapes can contribute to these ends. We illustrate the use of the package for drawing maps, computing spatial variables for countries, and generating weights matrices for spatial statistics.

Dclone: Data Cloning In R, Péter Sólymos

The R Journal

The dclone R package contains low level functions for implementing maximum likelihood estimating procedures for complex models using data cloning and Bayesian Markov Chain Monte Carlo methods with support for JAGS, WinBUGS and OpenBUGS.

Solving Differential Equations In R, Karline Soetaert, Thomas Petzoldt, R. Woodrow Setzer

The R Journal

Although R is still predominantly applied for statistical analysis and graphical representation, it is rapidly becoming more suitable for mathematical computing. One of the fields where considerable progress has been made recently is the solution of differential equations. Here we give a brief overview of differential equations that can now be solved by R.

Spikeslab: Prediction And Variable Selection Using Spike And Slab Regression, Hemant Ishwaran, Udaya B. Kogalur, J. Sunil Rao

The R Journal

Weighted generalized ridge regression offers unique advantages in correlated high dimensional problems. Such estimators can be efficiently computed using Bayesian spike and slab models and are effective for prediction. For sparse variable selection, a generalization of the elastic net can be used in tandem with these Bayesian estimates. In this article, we de scribe the R-software package spikeslab for implementing this new spike and slab prediction and variable selection methodology.

Hglm: A Package For Fitting Hierarchical Generalized Linear Models, Lars Rönnegård, Xia Shen, Moudud Alam

The R Journal

We present the hglm package for fit ting hierarchical generalized linear models. It can be used for linear mixed models and generalized linear mixed models with random effects for a variety of links and a variety of distributions for both the outcomes and the random effects. Fixed effects can also be fitted in the dispersion part of the model.

Bayesian Estimation Of The Garch(1,1) Model With Student-T Innovations, David Ardia, Lennart F. Hoogerheide

The R Journal

This note presents the R package bayesGARCH which provides functions for the Bayesian estimation of the parsimonious and effective GARCH(1,1) model with Student-t innovations. The estimation procedure is fully automatic and thus avoids the tedious task of tuning an MCMC sampling algorithm. The usage of the package is shown in an empirical application to exchange rate log-returns

Online Reproducible Research: An Application To Multivariate Analysis Of Bacterial Dna Fingerprint Data, Jean Thioulouse, Claire Valiente-Moro, Lionel Zenner

The R Journal

This paper presents an example of online reproducible multivariate data analysis. This example is based on a web page providing an online computing facility on a server. HTML forms contain editable R code snippets that can be executed in any web browser thanks to the Rweb software. The example is based on the multivariate analysis of DNA fingerprints of the internal bacterial flora of the poultry red mite Dermanyssus gallinae. Several multivariate data analysis methods from the ade4 package are used to compare the fingerprints of mite pools coming from various poultry farms. All the computations and graphical displays …

Cudabayesreg: Bayesian Computation In Cuda, Adelino Ferreira Da Silva

The R Journal

Graphical processing units are rapidly gaining maturity as powerful general parallel computing devices. The package cudaBayesreg uses GPU–oriented procedures to improve the performance of Bayesian computations. The paper motivates the need for devising high performance computing strategies in the con text of fMRI data analysis. Some features of the package for Bayesian analysis of brain fMRI data are illustrated. Comparative computing performance figures between sequential and parallel implementations are presented as well.

Experimental Evaluation Of Transmission Link Characteristics In Body Area Networks, Apoorva Kiran Pandya

School of Computing: Dissertations, Theses, and Student Research

Recent advances in digital electronics, embedded systems, and wireless communications have led the way to a new class of distributed Wireless Sensor Networks (WSNs). A Body Area Network (BAN) is a WSN consisting of miniaturized, low-power, autonomous, wireless biosensors, which are seamlessly placed or implanted in the human body to provide an adaptable and smart health care system. The possible applications of BAN are in health care services and medicine, assisting persons with disabilities, and entertainment and sports. The nodes in a BAN generally use IEEE 802.15.4 radios which have low- power consumption and are relatively immune to interference. In …

Tree-Based Algorithms For Computing K-Combinations And K-Compositions, Shant Karakashian, Berthe Y. Choueiry

School of Computing: Technical Reports

In this document, we describe two tree-based algorithms for computing all k-combinations and k-compositions of a finite set.

We have developed two algorithms for solving the following combinatorial tasks:

• Given a finite set S and a natural number k, find all subsets of S of size k. In the literature, this problem is called k-subsets and k-combinations.

• Given two natural numbers k, n where k [less than or equal to] n, find all k-compositions of n where a k-composition is an ordered combination of k nonzero natural numbers whose sum is n. Note that in the literature, a …

Agent Sensing With Stateful Resources, Adam D. Eck

School of Computing: Dissertations, Theses, and Student Research

In many real-world applications of multi-agent systems, agent reasoning suffers from bounded rationality caused by both limited resources and limited knowledge. When agent sensing also requires resource use, the agent’s knowledge revision is affected due to its inability to always sense when and as accurately as needed, further leading to poor decision making. In this research, we consider what happens when sensing activities require the use of stateful resources, which we define as resources whose state-dependent behavior changes over time based on usage. Specifically, sensing itself can change the state of a resource, and thus its behavior, which affects both …

Is Competition Making A Comeback? Discovering Methods To Keep Female Adolescents Engaged In Stem: A Phenomenological Approach, Kathryn B. Notter

College of Education and Human Sciences: Dissertations, Theses, and Student Research

The decreasing number of women who are graduating in the Science, Technology, Engineering and Mathematics (STEM) fields continues to be a major concern. Despite national support in the form of grants provided by National Science Foundation, National Center for Information and Technology and legislation passed such as the Deficit Reduction Act of 2005 that encourages women to enter the STEM fields, the number of women actually graduating in these fields is surprisingly low. This research study focuses on a robotics competition and its ability to engage female adolescents in STEM curricula. Data have been collected to help explain why young …

Simsight: A Virtual Machine Based Dynamic Call Graph Generator, Xueling Chen

School of Computing: Dissertations, Theses, and Student Research

One problem with using component-based software development approach is that once software modules are reused over generations of products, they form legacy structures that can be challenging to understand, making validating these systems difficult. Therefore, tools and methodologies that enable engineers to see interactions of these software modules will enhance their ability to make these software systems more dependable. To address this need, we propose SimSight, a framework to capture dynamic call graphs in Simics, a widely adopted commercial full-system simulator. Simics is a software system that simulates complete computer systems. Thus, it performs nearly identical tasks to …

Managing Large Data Sets Using Support Vector Machines, Ranjini Srinivas

School of Computing: Dissertations, Theses, and Student Research

Hundreds of Terabytes of CMS (Compact Muon Solenoid) data are being accumulated for storage day by day at the University of Nebraska-Lincoln, which is one of the eight US CMS Tier-2 sites. Managing this data includes retaining useful CMS data sets and clearing storage space for newly arriving data by deleting less useful data sets. This is an important task that is currently being done manually and it requires a large amount of time. The overall objective of this study was to develop a methodology to help identify the data sets to be deleted when there is a requirement for …

Jvm-Based Techniques For Improving Java Observability, Peng Du

School of Computing: Dissertations, Theses, and Student Research

Observability measures the support of computer systems to accurately capture, analyze, and present (collectively observe) the internal information about the systems. Observability frameworks play important roles for program understanding, troubleshooting, performance diagnosis, and optimizations. However, traditional solutions are either expensive or coarse-grained, consequently compromising their utility in accommodating today’s increasingly complex software systems. New solutions are emerging for VM-based languages due to the full control language VMs have over program executions. Existing such solutions, nonetheless, still lack flexibility, have high overhead, or provide limited context information for developing powerful dynamic analyses. In this thesis, we present a VM-based infrastructure, called …

A Framework For Automatically Repairing Gui Test Suites, Si Huang

School of Computing: Dissertations, Theses, and Student Research

Testing is an effective means for assuring the quality of software. In programs with Graphical User Interfaces (GUIs), event sequences serve as test cases for executing system tests. To aid in the test generation process, researchers have developed methods that automatically derive graph models from GUIs, which can then be traversed to create sequences for testing. Recent advances using these graph models incorporate combinatorial interaction testing sampling techniques to generate longer GUI test cases, which exercise more event interactions and have been shown to improve fault detection. However, because the models extracted are only approximations of the actual event interactions, …

A First Practical Algorithm For High Levels Of Relational Consistency, Shant Karakashian, Robert J. Woodward, Christopher Reesons, Berthe Y. Choueiry, Christian Bessiere

School of Computing: Conference and Workshop Papers

Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. In this paper, we study the relational consistency property R(∗,m)C, which is equivalent to m-wise consistency proposed in relational databases. We also define wR(∗,m)C, a weaker variant of this property. We propose an algorithm for enforcing these properties on a Constraint Satisfaction Problem by tightening the existing relations and without introducing new ones. We empirically show that wR(∗,m)C solves in a backtrack-free manner all the instances of some CSP benchmark classes, thus hinting at the tractability of those classes.