Computer Sciences Commons^™

Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ

Master's Theses

View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.

In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft Development Training, suggested …

On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz

Engineering Faculty Articles and Research

We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.

Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari

Engineering Faculty Articles and Research

Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …

Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.

Supporting Multiple Paths To Objects In Information Hierarchies: Faceted Classification, Faceted Search, And Symbolic Links, Saverio Perugini

Computer Science Faculty Publications

We present three fundamental, interrelated approaches to support multiple access paths to each terminal object in information hierarchies: faceted classification, faceted search, and web directories with embedded symbolic links. This survey aims to demonstrate how each approach supports users who seek information from multiple perspectives. We achieve this by exploring each approach, the relationships between these approaches, including tradeoffs, and how they can be used in concert, while focusing on a core set of hypermedia elements common to all. This approach provides a foundation from which to study, understand, and synthesize applications which employ these techniques. This survey does not …

High School Microsoft Powerpoint, Ladane Du Boulay

Technology

The purpose of this lesson is for students to deepend and demonstrate their understanding of Powerpoint. The students will create a sample multimedia-rich presentation. They will be using their prior knowledge related to their social studies (i.e. Abraham Lincoln) and Science (i.e. Charles Darwin) classes.

On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan

Engineering Faculty Articles and Research

We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.

Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz

Engineering Faculty Articles and Research

We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …

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 …

An Evaluation Of Potential Technologies For A Web Based Development Environment For Cs1 Students, Manuel Garcia

Computer Science and Software Engineering

The goal of this senior project was to design a web-based integrated development environment that would incorporate Web-CAT. Web-CAT is an automated testing tool designed by Stephen Edwards at Virginia Tech University, to help beginning students learn test-driven development. This tool runs on a server where a professor assigns usernames and passwords to students so they can submit code. This program can assist professors in grading, and students in showing errors in code. The development environment design waskept simple to create less confusion for beginning programming students. This development environment will be online to give all students universal access and …

A Parallel Computing Test Bed For Performing An Unsupervised Fluoroscopic Analysis Of Knee Joint Kinematics, Renu Ramanatha

Boise State University Theses and Dissertations

Fluoroscopic analysis of knee joint kinematics involves accurately determining the position and orientation of bones in the knee joint. This data can be derived using the static 3-D CT scan images and 2-D video fluoroscopy images together. This involves generating hypothetical digitally reconstructed radiographs (DRR) from the CT scan image with known position and orientation and comparing them to the original fluoroscopic frame. This represents a search problem in which, among all the DRRs possible from a CT image, the image that most closely matches the target fluoroscopy frame of the knee joint has to be found.

Each image in …

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) …

Dragon Age: Origins - Maps & Benchmark Problems, Nathan R. Sturtevant, Bioware Corp

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted from Dragon Age: Origins with help and explicit permission from BioWare Corp. for use and distribution as benchmark problems.

Contains 156 maps and benchmark problem sets.

Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet

School of Computing: Conference and Workshop Papers

Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that describes measurements over a period of time in history while the predicted class is expected to occur in the future. We describe a new temporal classification method that improves the accuracy of standard classification methods. The benefits of the method are tested on weather forecasting using the meteorological database from the Texas Commission on Environmental Quality.

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), …

Sound And The City: Multi-Layer Representation And Navigation Of Audio Scenarios, Luca A. Ludovico, Davide Andrea Mauro Phd

Computer Sciences and Electrical Engineering Faculty Research

IEEE 1599-2008 is an XML-based standard originally intended for the multi-layer representation of music information. Nevertheless, it is versatile enough to describe also information different from traditional scores written according to the Common Western Notation (CWN) rules. This paper will discuss the application of IEEE 1599-2008 to the audio description of paths and scenarios from the urban life or other landscapes. The standard we adopt allows the multilayer integration of textual, symbolical, structural, graphical, audio and video contents within a unique synchronized environment. Besides, for each kind of media, a number of digital objects is supported. As a consequence, thanks …

Open Forum: The Future Of Library Systems, Maria Collins, Andrée J. Rathemacher

Technical Services Faculty Publications

Moderated by Maria Collins of North Carolina State University, discussion at this open forum on the future of library systems touched on open-source library systems, cloud computing, new initiatives by the Open Library Environment (OLE) Project and OCLC, and desired characteristics of future integrated library systems. Most participants had limited experience with next-generation library systems and attended the open forum with the desire to broaden their understanding, although some were exposed to or had worked with the open-source discovery tool VuFind, the OLE Project, WorldCat Local, and the OCLC Web-scale service. A strong desire to customize library systems to meet …

Feeding Phishers, Nicholas J. Lynch

Master's Theses

Phishing campaigns continue to deceive users into revealing their credentials, despite advancing spam filters, browser and toolbar warnings, and educational efforts. Recently, researchers have begun investigating how fake credentials --- or honeytokens --- can be used to detect phishing sites and protect users. BogusBiter, one such work, creates sets of honeytokens based on users' real credentials and sends them alongside real user submissions to phishing sites. In this paper, we present Phish Feeder, an anti-phishing tool which extends the BogusBiter honeytoken generation algorithm in order to create more realistic and authentic-looking credentials. Phish Feeder also employs a ``honeytoken repository'' which …

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 …

Puremx: Automatic Transcription Of Midi Live Music Performances Into Xml Format, Stefano Baldan, Luca A. Ludovico, Davide Andrea Mauro Phd

Computer Sciences and Electrical Engineering Faculty Research

This paper addresses the problem of the real-time automatic transcription of a live music performance into a symbolic format based on XML.

The source data are given by any music instrument or other device able to communicate with Pure Data by MIDI. Pure Data is a free, multi-platform, real-time programming environment for graphical, audio, and video processing. During a performance, music events are parsed and their parameters are evaluated thanks to rhythm and pitch detection algorithms. The final step is the creation of a well-formed XML document, validated against the new international standard known as IEEE 1599.

This work will …

Visualizing The Simulation Of 3-D Underwater Sensor Networks, Matthew T. Tran

Honors Scholar Theses

The majority of sensor network research deals with land-based networks, which are essentially two-dimensional, and thus the majority of simulation and animation tools also only handle such networks. Underwater sensor networks on the other hand, are essentially 3D networks because the depth at which a sensor node is located needs to be considered as well. Due to that additional dimension, specialized tools need to be used when conducting simulations for experimentation.

The School of Engineering’s Underwater Sensor Network (UWSN) lab is conducting research on underwater sensor networks and requires simulation tools for 3D networks. The lab has extended NS-2, a …

Alternative Task Bar: A Usability Study, Jordan Cote

Honors Scholar Theses

An alternate approach to the task bar is proposed, one which makes use of modern computers' graphical abilities. This was accomplished with OpenGL, which is typically used in 3D scene generation. The application was integrated into the Desktop Environment in a novel way, in order to produce an arbitrary shaped window. The application was presented to survey participants, who were asked questions to reveal the feasibility of this type of task bar. Responses were positive, which encourages further development.

Turn Constrained Path Planning Problems, Victor M. Roman

UNLV Theses, Dissertations, Professional Papers, and Capstones

We consider the problem of constructing multiple disjoint paths connecting a source point s to a target point t in a geometric graph. We require that the paths do not have any sharp turn angles. We present a review of turn constrained path planning algorithms and also algorithms for constructing disjoint paths. We then combine these techniques and present an O(nlogn) time algorithm for constructing a pair of edge disjoint turn constrained paths connecting two nodes in a planar geometric graph. We also consider the development of a turn constrained shortest path map in the presence of …

Language Modeling Approaches To Information Retrieval, Protima Banerjee, Hyoil Han

Computer Sciences and Electrical Engineering Faculty Research

This article surveys recent research in the area of language modeling (sometimes called statistical language modeling) approaches to information retrieval. Language modeling is a formal probabilistic retrieval framework with roots in speech recognition and natural language processing. The underlying assumption of language modeling is that human language generation is a random process; the goal is to model that process via a generative statistical model.

In this article, we discuss current research in the application of language modeling to information retrieval, the role of semantics in the language modeling framework, cluster-based language models, use of language modeling for XML retrieval and …

Range Estimation Algorithm Comparison In 3-D Flash Ladar Data, Steven P. Jordan

Theses and Dissertations

Range estimation algorithms have been applied to Laser Detection and Ranging (LADAR) data to test for accuracy and precision. Data was acquired from Matlab® simulations and an experiment using the Advanced Scientific Concepts 3-D flash LADAR camera. Simulated LADAR data was based on a Gaussian pulse shape model with Poisson noise added. Simulations were performed to test range estimation algorithm performance with respect to waveform position within the range gate. The effectiveness of each algorithm is presented in terms of its average root mean square error and standard deviation in 1000 trials. The measured data experiment examined the effectiveness of …

A Hybrid Templated-Based Composite Classification System, Michael A. Turnbaugh

Theses and Dissertations

An automatic target classification system contains a classifier which reads a feature as an input and outputs a class label. Typically, the feature is a vector of real numbers. Other features can be non-numeric, such as a string of symbols or alphabets. One method of improving the performance of an automatic classification system is through combining two or more independent classifiers that are complementary in nature. Complementary classifiers are observed by finding an optimal method for partitioning the problem space. For example, the individual classifiers may operate to identify specific objects. Another method may be to use classifiers that operate …

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 …

Maze Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 60 maps of size 512x512 and benchmark problem sets. These maps are algorithm-generated mazes with corridor widths of 1, 2, 4, 8, 16, or 32. There are 10 maps and problem sets for each corridor size.

Room Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 40 maps of size 512x512 and problem sets. Maps are divided into rooms of size 8x8, 16x16, 32x32, and 64x64. There are 10 maps and problem sets for each room size. Maps with differing room sizes are not scaled: thickness of walls and passages differs.