Computer Sciences Commons^™

Modeling Human Group Behavior In Virtual Worlds, Fahad Shah

Electronic Theses and Dissertations

Virtual worlds and massively-multiplayer online games are rich sources of information about large-scale teams and groups, offering the tantalizing possibility of harvesting data about group formation, social networks, and network evolution. They provide new outlets for human social interaction that differ from both face-to-face interactions and non-physically-embodied social networking tools such as Facebook and Twitter. We aim to study group dynamics in these virtual worlds by collecting and analyzing public conversational patterns of users grouped in close physical proximity. To do this, we created a set of tools for monitoring, partitioning, and analyzing unstructured conversations between changing groups of participants …

Effective Task Transfer Through Indirect Encoding, Phillip Verbancsics

Electronic Theses and Dissertations

An important goal for machine learning is to transfer knowledge between tasks. For example, learning to play RoboCup Keepaway should contribute to learning the full game of RoboCup soccer. Often approaches to task transfer focus on transforming the original representation to fit the new task. Such representational transformations are necessary because the target task often requires new state information that was not included in the original representation. In RoboCup Keepaway, changing from the 3 vs. 2 variant of the task to 4 vs. 3 adds state information for each of the new players. In contrast, this dissertation explores the idea …

Research In High Performance And Low Power Computer Systems For Data-Intensive Environment, Pengju Shang

Electronic Theses and Dissertations

According to the data affinity, DAFA re-organizes data to maximize the parallelism of the affinitive data, and also subjective to the overall load balance. This enables DAFA to realize the maximum number of map tasks with data-locality. Besides the system performance, power consumption is another important concern of current computer systems. In the U.S. alone, the energy used by servers which could be saved comes to 3.17 million tons of carbon dioxide, or 580,678 cars {Kar09}. However, the goals of high performance and low energy consumption are at odds with each other. An ideal power management strategy should be able …

Virtual Router Approach For Wireless Ad Hoc Networks, Ai Hua Ho

Electronic Theses and Dissertations

Wireless networks have become increasingly popular in recent years. There are two variations of mobile wireless networks: infrastructure mobile networks and infrastructureless mobile networks. The latter are also known as mobile ad hoc network (MANET). MANETs have no fixed routers. Instead, mobile nodes function as relay nodes or routers, which discover and maintain communication connections between source nodes and destination nodes for various data transmission sessions. In other words, an MANET is a self-organizing multi-hop wireless network in which all nodes within a given geographical area participate in the routing and data forwarding process. Such networks are scalable and self-healing. …

P300-Based Bci Performance Prediction Through Examination Of Paradigm Manipulations And Principal Components Analysis., Nicholas Edward Schwartz

Electronic Theses and Dissertations

Severe neuromuscular disorders can produce locked-in syndrome (LIS), a loss of nearly all voluntary muscle control. A brain-computer interface (BCI) using the P300 event-related potential provides communication that does not depend on neuromuscular activity and can be useful for those with LIS. Currently, there is no way of determining the effectiveness of P300-based BCIs without testing a person's performance multiple times. Additionally, P300 responses in BCI tasks may not resemble the typical P300 response. I sought to clarify the relationship between the P300 response and BCI task parameters and examine the possibility of a predictive relationship between traditional oddball tasks …

A Study Of Improving The Parallel Performance Of Vasp., Matthew Brandon Baker

Electronic Theses and Dissertations

This thesis involves a case study in the use of parallelism to improve the performance of an application for computational research on molecules. The application, VASP, was migrated from a machine with 4 nodes and 16 single-threaded processors to a machine with 60 nodes and 120 dual-threaded processors. When initially migrated, VASP's performance deteriorated after about 17 processing elements (PEs), due to network contention. Subsequent modifications that restrict communication amongst VASP processes, together with additional support for threading, allowed VASP to scale up to 112 PEs, the maximum number that was tested. Other performance-enhancing optimizations that were attempted included replacing …

Early Stopping Of A Neural Network Via The Receiver Operating Curve., Daoping Yu

Electronic Theses and Dissertations

This thesis presents the area under the ROC (Receiver Operating Characteristics) curve, or abbreviated AUC, as an alternate measure for evaluating the predictive performance of ANNs (Artificial Neural Networks) classifiers. Conventionally, neural networks are trained to have total error converge to zero which may give rise to over-fitting problems. To ensure that they do not over fit the training data and then fail to generalize well in new data, it appears effective to stop training as early as possible once getting AUC sufficiently large via integrating ROC/AUC analysis into the training process. In order to reduce learning costs involving the …

Composing Music In Constrained Search Environments, Jeffrey Keene

Electronic Theses and Dissertations

Composing music with computers in constrained search environments adds complexities and problems not present in the traditional problem domain of generative music. The traditional and well researched mechanisms of Markov chains, genetic algorithms and data driven rule based systems do not directly map to a problem domain in which pitch choice and rhythm choice are likely to be highly limited.

We therefore explore several possible solutions to generating rhythms in extremely constrained environments with the goal of generating music that adheres to user specified constraints and is aesthetically pleasing.

Toward Using Games To Teach Fundamental Computer Science Concepts, Jeffrey Michael Edgington

Electronic Theses and Dissertations

Video and computer games have become an important area of study in the field of education. Games have been designed to teach mathematics, physics, raise social awareness, teach history and geography, and train soldiers in the military. Recent work has created computer games for teaching computer programming and understanding basic algorithms.

We present an investigation where computer games are used to teach two fundamental computer science concepts: boolean expressions and recursion. The games are intended to teach the concepts and not how to implement them in a programming language.

For this investigation, two computer games were created. One is designed …

Generating Compact Wasp Nest Structures Via Minimal Complexity Algorithms., Fadel Ewusi Kofi Adoe

Electronic Theses and Dissertations

Many models have been developed to explain the process of self organization-the emergence of seemingly purposeful behaviors from groups of entities with limited individual intelligence. However, the underlying behavior that facilitates the emergence of this global pattern is not generally well understood. Our study focuses on different low complexity building algorithms and characterizes how nests are built using these algorithms. Three rules postulated to be functions of wasps' building behavior were developed. First is the random rule, in which there is no constraint per the choice of site to be initiated. The second is the 2-cell rule where only sites …

Using Transitivity With Nearest Neighbor To Reduce Error In Sample-Based Pearson Correlation Coefficients, Taylor Phillips

Electronic Theses and Dissertations

Pearson product-moment correlation coefficients are a well-practiced quantification of linear dependence seen across many fields. When calculating a sample-based correlation coefficient, the accuracy of the estimation is dependent on the quality and quantity of the sample. Like all statistical models, these correlation coefficients can suffer from overfitting, which results in the representation of random error instead of an underlying trend.

In this paper, we discuss how Pearson's product-moment correlation coefficients can utilize information outside of the two items for which the correlation is being computed. By introducing a relationship with one or more additional items that meet specified criterion, our …

A Location Aware P2p Voice Communication Protocol For Networked Virtual Environments, Gabor Papp

Electronic Theses and Dissertations

Multiparty voice communication, where multiple people can communicate in a group, is an important component of networked virtual environments (NVEs), especially in many types of online games. While most research has been conducted on one-to-one communication, we focus on group communication. In this dissertation, we present the first measurement study on the characteristics of multiparty voice communications and develop a model of the talking and silence periods observed during multiparty communication. Over a total of 5 months, we measured over 11,000 sessions on an active multi-party voice communication server to quantify the characteristics of communication generated by game players, including …

A Robust Wireless Mesh Access Environment For Mobile Video Users, Fei Xie

Electronic Theses and Dissertations

The rapid advances in networking technology have enabled large-scale deployments of online video streaming services in today's Internet. In particular, wireless Internet access technology has been one of the most transforming and empowering technologies in recent years. We have witnessed a dramatic increase in the number of mobile users who access online video services through wireless access networks, such as wireless mesh networks and 3G cellular networks. Unlike in wired environment, using a dedicated stream for each video service request is very expensive for wireless networks. This simple strategy also has limited scalability when popular content is demanded by a …

Markerless Tracking Using Polar Correlation Of Camera Optical Flow, Prince Gupta

Electronic Theses and Dissertations

We present a novel, real-time, markerless vision-based tracking system, employing a rigid orthogonal configuration of two pairs of opposing cameras. Our system uses optical flow over sparse features to overcome the limitation of vision-based systems that require markers or a pre-loaded model of the physical environment. We show how opposing cameras enable cancellation of common components of optical flow leading to an efficient tracking algorithm that captures five degrees of freedom including direction of translation and angular velocity. Experiments comparing our device with an electromagnetic tracker show that its average tracking accuracy is 80% over 185 frames, and it is …

Architectural Support For Improving Computer Security, Jingfei Kong

Electronic Theses and Dissertations

Computer security and privacy are becoming extremely important nowadays. The task of protecting computer systems from malicious attacks and potential subsequent catastrophic losses is, however, challenged by the ever increasing complexity and size of modern hardware and software design. We propose several methods to improve computer security and privacy from architectural point of view. They provide strong protection as well as performance efficiency. In our first approach, we propose a new dynamic information flow method to protect systems from popular software attacks such as buffer overflow and format string attacks. In our second approach, we propose to deploy encryption schemes …

Real-Time Cinematic Design Of Visual Aspects In Computer-Generated Images, Juraj Obert

Electronic Theses and Dissertations

Creation of visually-pleasing images has always been one of the main goals of computer graphics. Two important components are necessary to achieve this goal --- artists who design visual aspects of an image (such as materials or lighting) and sophisticated algorithms that render the image. Traditionally, rendering has been of greater interest to researchers, while the design part has always been deemed as secondary. This has led to many inefficiencies, as artists, in order to create a stunning image, are often forced to resort to the traditional, creativity-baring, pipelines consisting of repeated rendering and parameter tweaking. Our work shifts the …

A New Framework For Qos Provisioning In Wireless Lans Using The P-Persistent Mac Protocol, Kiran Babu Anna

Electronic Theses and Dissertations

The support of multimedia traffic over IEEE 802.11 wireless local area networks (WLANs) has recently received considerable attention. This dissertation has proposed a new framework that provides efficient channel access, service differentiation and statistical QoS guarantees in the enhanced distributed channel access (EDCA) protocol of IEEE 802.11e. In the first part of the dissertation, the new framework to provide QoS support in IEEE 802.11e is presented. The framework uses three independent components, namely, a core MAC layer, a scheduler, and an admission control. The core MAC layer concentrates on the channel access mechanism to improve the overall system efficiency. The …

Spatio-Temporal Maximum Average Correlation Height Templates In Action Recognition And Video Summarization, Mikel Rodriguez

Electronic Theses and Dissertations

Action recognition represents one of the most difficult problems in computer vision given that it embodies the combination of several uncertain attributes, such as the subtle variability associated with individual human behavior and the challenges that come with viewpoint variations, scale changes and different temporal extents. Nevertheless, action recognition solutions are critical in a great number of domains, such video surveillance, assisted living environments, video search, interfaces, and virtual reality. In this dissertation, we investigate template-based action recognition algorithms that can incorporate the information contained in a set of training examples, and we explore how these algorithms perform in action …

A Fpga-Based Architecture For Led Backlight Driving, Zhaoshi Zheng

Electronic Theses and Dissertations

In recent years, Light-emitting Diodes (LEDs) have become a promising candidate for backlighting Liquid Crystal Displays [1] (LCDs). Compared with traditional Cold Cathode Fluorescent Lamps (CCFLs) technology, LEDs offer not only better visual quality, but also improved power efficiency. However, to fully utilized LEDs' capability requires dynamic independent control of individual LEDs, which remains as a challenging topic. A FPGA-based hardware system for LED backlight control is proposed in this work. We successfully achieve dynamic adjustment of any individual LED's intensity in each of the three color channels (Red, Green and Blue), in response to a real time incoming video …

Predicting Flavonoid Ugt Regioselectivity With Graphical Residue Models And Machine Learning., Arthur Rhydon Jackson

Electronic Theses and Dissertations

Machine learning is applied to a challenging and biologically significant protein classification problem: the prediction of flavonoid UGT acceptor regioselectivity from primary protein sequence. Novel indices characterizing graphical models of protein residues are introduced. The indices are compared with existing amino acid indices and found to cluster residues appropriately. A variety of models employing the indices are then investigated by examining their performance when analyzed using nearest neighbor, support vector machine, and Bayesian neural network classifiers. Improvements over nearest neighbor classifications relying on standard alignment similarity scores are reported.

Routing In The Dark: Pitch Black, Nathan S. Evans

Electronic Theses and Dissertations

In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Friendto-friend “darknet” networks have been shown to commonly have a small-world topology; while short paths exist between any pair of nodes in small-world networks, it is non-trivial to determine such paths with a distributed algorithm. Recently, Clarke and Sandberg proposed the first decentralized routing algorithm that achieves efficient routing in such small-world networks.

Herein this thesis we discuss the first independent security analysis of Clarke and Sandberg’s routing algorithm. We show that a relatively weak participating adversary can render …

Heuristics For Improved Enterprise Intrusion Detection, James J. Treinen

Electronic Theses and Dissertations

One of the greatest challenges facing network operators today is the identification of malicious activity on their networks. The current approach is to deploy a set of intrusion detection sensors (IDSs) in various locations throughout the network and on strategic hosts. Unfortunately, the available intrusion detection technologies generate an overwhelming volume of false alarms, making the task of identifying genuine attacks nearly impossible. This problem is very difficult to solve even in networks of nominal size. The task of uncovering attacks in enterprise class networks quickly becomes unmanageable.

Research on improving intrusion detection sensors is ongoing, but given the nature …

Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-Parallel Graphs, Rosa Enciso

Electronic Theses and Dissertations

Alliances are used to denote agreements between members of a group with similar interests. Alliances can occur between nations, biological sequences, business cartels, and other entities. The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in . A defensive alliance in a graph G = (V, E) is a non empty set S ⊆ V where, for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. Consequently, every vertex that is a member of a defensive alliance has at least as many vertices defending it as there are vertices attacking it. Alliances can …

On The Application Of Locality To Network Intrusion Detection: Working-Set Analysis Of Real And Synthetic Network Server Traffic, Robert Lee

Electronic Theses and Dissertations

Keeping computer networks safe from attack requires ever-increasing vigilance. Our work on applying locality to network intrusion detection is presented in this dissertation. Network servers that allow connections from both the internal network and the Internet are vulnerable to attack from all sides. Analysis of the behavior of incoming connections for properties of locality can be used to create a normal profile for such network servers. Intrusions can then be detected due to their abnormal behavior. Data was collected from a typical network server both under normal conditions and under specific attacks. Experiments show that connections to the server do …

Search And Delivery Techniques In Peer-To-Peer Networks, Tai Do

Electronic Theses and Dissertations

The presence of millions of interconnected personal computing devices has given rise to a new class of decentralized networking applications, which are loosely labeled as peer-to-peer (P2P) applications. These P2P applications leverage resources such as processing cycles, storage, content, and network bandwidth available to the user devices, which are also known as peers. A number of current systems - SETI@home, Napster, BitTorrent, and Pastry - are examples of these emerging P2P systems. To fully realize the potential of the peer-to-peer technology, there is a need to define and provide a set of core competencies, serving as the basic services upon …

Connectionless Approach: A Localized Scheme To Mobile Ad Hoc Networks, Yao Ho

Electronic Theses and Dissertations

According to a Gartner Group (www.gartner.com) report in September 2008, the worldwide telecommunications market is on pace to reach $2 trillion in 2008. Gartner predicts that by 2012, the ratio of mobile to fixed connections will exceed 4-to-1. The North American mobile data market grew to 141.1 million connections in 2007, with a compound annual growth rate of 41.7 percent. It is believed that a large portion will be ad hoc and multi-hop connections, which will open many opportunities for Mobile Ad hoc NETwork (MANET) applications and Wireless Mesh Network (WMN) applications. A MANET is a self-organizing multi-hop wireless network …

Learning Techniques For Information Retrieval And Mining In High-Dimensional Databases, Hao Cheng

Electronic Theses and Dissertations

The main focus of my research is to design effective learning techniques for information retrieval and mining in high-dimensional databases. There are two main aspects in the retrieval and mining research: accuracy and efficiency. The accuracy problem is how to return results which can better match the ground truth, and the efficiency problem is how to evaluate users' requests and execute learning algorithms as fast as possible. However, these problems are non-trivial because of the complexity of the high-level semantic concepts, the heterogeneous natures of the feature space, the high dimensionality of data representations and the size of the databases. …

Scheduling And Resource Management For Complex Systems: From Large-Scale Distributed Systems To Very Large Sensor Networks, Chen Yu

Electronic Theses and Dissertations

In this dissertation, we focus on multiple levels of optimized resource management techniques. We first consider a classic resource management problem, namely the scheduling of data-intensive applications. We define the Divisible Load Scheduling (DLS) problem, outline the system model based on the assumption that data staging and all communication with the sites can be done in parallel, and introduce a set of optimal divisible load scheduling algorithms and the related fault-tolerant coordination algorithm. The DLS algorithms introduced in this dissertation exploit parallel communication, consider realistic scenarios regarding the time when heterogeneous computing systems are available, and generate optimal schedules. Performance …

Automatic Graphics And Game Content Generation Through Evolutionary Computation, Erin Hastings

Electronic Theses and Dissertations

Simulation and game content includes the levels, models, textures, items, and other objects encountered and possessed by players during the game. In most modern video games and simulation software, the set of content shipped with the product is static and unchanging, or at best, randomized within a narrow set of parameters. However, ideally, if game content could be constantly and automatically renewed, players would remain engaged longer in the evolving stream of content. This dissertation introduces three novel technologies that together realize this ambition. (1) The first, NEAT Particles, is an evolutionary method to enable users to quickly and easily …

Detecting Malicious Software By Dynamicexecution, Jianyong Dai

Electronic Theses and Dissertations

Traditional way to detect malicious software is based on signature matching. However, signature matching only detects known malicious software. In order to detect unknown malicious software, it is necessary to analyze the software for its impact on the system when the software is executed. In one approach, the software code can be statically analyzed for any malicious patterns. Another approach is to execute the program and determine the nature of the program dynamically. Since the execution of malicious code may have negative impact on the system, the code must be executed in a controlled environment. For that purpose, we have …