Computer Sciences Commons^™

Focused Multi-Document Summarization: Human Summarization Activity Vs. Automated Systems Techniques, Quinsulon L. Israel, Hyoil Han, Il-Yeol Song

Computer Sciences and Electrical Engineering Faculty Research

Focused Multi-Document Summarization (MDS) is concerned with summarizing documents in a collection with a concentration toward a particular external request (i.e. query, question, topic, etc.), or focus. Although the current state-of-the-art provides somewhat decent performance for DUC/TAC-like evaluations (i.e. government and news concerns), other considerations need to be explored. This paper not only briefly explores the state-of-the-art in automatic systems techniques, but also a comparison with human summarization activity.

Development Of A Systematic And Practical Methodology For The Design Of Vehicles Semi-Active Suspension Control System, Hamidreza Bolandhemmat, Christopher M. Clark, Farid Golnaraghi

Computer Science and Software Engineering

In this paper, a novel systematic and practical methodology is presented for design of vehicle semi-active suspension systems. Typically, the semi-active control strategies developed to improve vehicle ride comfort and stability have a switching nature. This makes the design of the controlled suspension systems difficult and highly dependent on an extensive trial-and-error process. The proposed methodology maps the discontinuous control system model to a continuous linear region, where all the time and frequency design techniques, established in the conventional control system theory, can be applied. If the semi-active control system is designed to satisfy some ride and stability requirements, an …

Community Funding Models For Computational Resources, Amy Apon, Jeff Pummill, Dana Brunson

Publications

As scientific research has extended far beyond the practicality and abilities of laboratory experiments, computational simulations have become the mainstay of enabling and furthering the research in a way never previously thought possible. It is becoming commonplace to model and simulate both the very large, such as black hole collisions in astrophysics, and the very small, such as subatomic particle behavior and interaction in high energy physics. In addition to the previous examples detailing extremes, practically every area of research currently utilizes and benefits from computational resources to simulate their work; financial modeling, weather forecasting, geological phenomena, geo-spatial data analysis, …

Using Ant Colonization Optimization To Control Difficulty In Video Game Ai., Joshua Courtney

Undergraduate Honors Theses

Ant colony optimization (ACO) is an algorithm which simulates ant foraging behavior. When ants search for food they leave pheromone trails to tell other ants which paths to take to find food. ACO has been adapted to many different problems in computer science: mainly variations on shortest path algorithms for graphs and networks.

ACO can be adapted to work as a form of communication between separate agents in a video game AI. By controlling the effectiveness of this communication, the difficulty of the game should be able to be controlled. Experimentation has shown that ACO works effectively as a form …

Linked Sensor Data, Harshal Kamlesh Patni, Cory Andrew Henson, Amit P. Sheth

Kno.e.sis Publications

A number of government, corporate, and academic organizations are collecting enormous amounts of data provided by environmental sensors. However, this data is too often locked within organizations and underutilized by the greater community. In this paper, we present a framework to make this sensor data openly accessible by publishing it on the Linked Open Data (LOD) Cloud. This is accomplished by converting raw sensor observations to RDF and linking with other datasets on LOD. With such a framework, organizations can make large amounts of sensor data openly accessible, thus allowing greater opportunity for utilization and analysis.

Implementing The Intelligent Mail Barcode In The N-Tiered Service Library Of A Print Mail Enterprise, Christopher E. Bunch

Theses and Dissertations

Starting in autumn, 2009, the Intelligent Mail Barcode fully replaced the PostNet barcode for the United States Postal Service. This barcode enables a sender of a mailpiece to track the mailpiece through the entire mail stream, as well as track any remit mail returned to the sender. This thesis explains how the Intelligent Mail Barcode was implemented in the n- tiered Windows Communication Foundation service architecture of the Emdeon, Inc. print-mail engine. To help provide a full understanding of the environment, this document, also, explains the operation of the print mail engine at Emdeon.

Examining The Behavioral Intentions Of Older Adults As Virtual Tourists In The Context Of A Second Life Destination, Dorinda Christian

All Dissertations

ABSTRACT
Tourism opportunities are being promoted heavily on the web, yet one of the largest and most lucrative markets, older adults are least likely to use the internet. In an effort to explore barriers to and potential acceptance of technology for tourism experiences, this study followed closely ten older adults through a learning process with technology. Qualitative methodology was used to explore in-depth the experience of these older adults being exposed to online virtual world technology for the first time and exploring the process by which technology acceptance takes place. The findings indicate that online virtual world such as Second …

A 3-D Photo Forensic Analysis Of The Lee Harvey Oswald Backyard Photo, Hany Farid

Computer Science Technical Reports

More than forty-five years after the assassination of U.S. President Kennedy theories continue to circulate suggesting that the accused assassin, Lee Harvey Oswald, acted as part of a larger conspiracy. It has been argued, for example, that incriminating photographs of Oswald were manipulated, and hence evidence of a broader plot. We describe a detailed 3-D analysis of the Oswald photos to determine if such claims of tampering are warranted.

A Note On Randomized Streaming Space Bounds For The Longest Increasing Subsequence Problem, Amit Chakrabarti

Computer Science Technical Reports

The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be Theta~(sqrt N). However, the randomized complexity is wide open. We show that the technique used in earlier work to establish the Omega(sqrt N) deterministic lower bound fails strongly under randomization: specifically, we show that the communication problems on which the lower bound is based have very efficient randomized protocols. The purpose of this note is to guide and alert future researchers working on this very interesting problem.

Personalization By Website Transformation: Theory And Practice, Saverio Perugini

Computer Science Faculty Publications

We present an analysis of a progressive series of out-of-turn transformations on a hierarchical website to personalize a user’s interaction with the site. We formalize the transformation in graph-theoretic terms and describe a toolkit we built that enumerates all of the traversals enabled by every possible complete series of these transformations in any site and computes a variety of metrics while simulating each traversal therein to qualify the relationship between a site’s structure and the cumulative effect of support for the transformation in a site. We employed this toolkit in two websites. The results indicate that the transformation enables users …

Capacity-Driven Pricing Mechanism In Special Service Industries, Lijian Chen, Suraj M. Alexander

MIS/OM/DS Faculty Publications

We propose a capacity driven pricing mechanism for several service industries in which the customer behavior, the price demand relationship, and the competition are significantly distinct from other industries. According our observation, we found that the price demand relationship in these industries cannot be modeled by fitted curves; the customers would neither plan in advance nor purchase the service strategically; and the competition would be largely local. We analyze both risk neutral and risk aversion pricing models and conclude the proposed capacity driven model would be the optimal solution under mild assumptions. The resulting pricing mechanism has been implemented at …

Time Series Models For Computing Activation In Fmri, Daniel W. Adrian, Ranjan Maitra, Daniel B. Rowe

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

Automated Extraction Of Structures From Sketches Of Biological Specimens, Jamie Joseph Schirf

School of Computing: Dissertations, Theses, and Student Research

The goal of this study was to develop automated techniques to extract biological structures from sketches of biological specimens. This will form the basis for a searchable database of information about the specimens. Having such a database enables researchers to efficiently search for specimens with particular qualities or identify unknown specimens. After some preprocessing of the images, the important internal organs of the specimen are extracted using image analysis techniques. The shape, size, and organization of the organs are used to categorize and then to reorganize them in the image. Results using a large database of sketches of trematodes, in …

Handling Concept Drift In Text Data Stream Constrained By High Labelling Cost, Patrick Lindstrom, Sarah Jane Delany, Brian Mac Namee

Conference papers

In many real-world classification problems the concept being modelled is not static but rather changes over time - a situation known as concept drift. Most techniques for handling concept drift rely on the true classifications of test instances being available shortly after classification so that classifiers can be retrained to handle the drift. However, in applications where labelling instances with their true class has a high cost this is not reasonable. In this paper we present an approach for keeping a classifier up-to-date in a concept drift domain which is constrained by a high cost of labelling. We use …

The Sitac Approach For Time-Aware Query Translation In Text Archives, Amal Kaluarachchi

Theses, Dissertations and Culminating Projects

With an exponential growth in archival of time-stamped documents such as newswire articles, blog posts and other web-pages, information retrieval (IR) has become a challenging task. The degree of complexity in this IR task increases when these archives cover long time-spans and the terminology in them has undergone significant changes. When users pose queries pertaining to historical information over such document collections, the queries need to be translated, incorporating temporal changes, to provide accurate responses. For example, a query on Sri Lanka should automatically retrieve documents with its former name Ceylon. We call such concepts SITACs i.e., Semantically Identical Temporally …

Building Scientific Clouds: The Distributed, Peer-To-Peer Approach, Linton Vadakedathu

All Theses

The Scientific community is constantly growing in size. The increase in personnel number and projects have resulted in the requirement of large amounts of storage, CPU power and other computing resources. It has also become necessary to acquire these resources in an affordable
manner that is sensitive to work loads. In this thesis, the author presents a novel approach that provides the communication platform that will support such large scale scientific projects. These resources could be difficult to acquire due to NATs, firewalls and other site-based restrictions and policies. Methods used to overcome these hurdles have been discussed in detail …

Sat-Based Answer Set Programming, Yuliya Lierler

Computer Science Faculty Publications

Answer set programming (ASP) is a declarative programming paradigm oriented towards difficult combinatorial search problems. Syntactically, ASP programs look like Prolog programs, but solutions are represented in ASP by sets of atoms, and not by substitutions, as in Prolog. Answer set systems, such as SMODELS, SMODELSCC, and DLV, compute answer sets of a given program in the sense of the answer set (stable model) semantics. This is different from the functionality of Prolog systems, which determine when a given query is true relative to a given logic program. ASP has been applied to many areas of science and technology, from …

Sense Of Place In Virtual World Learning Environments: A Conceptual Exploration, Vipin Arora, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

In this paper we conceptually explore the notion of sense of place and its potential use in the design of a ‗place for learning‘ in 3D immersive environments such as virtual worlds. We draw from earlier research in the fields of environmental psychology, social psychology and Human Computer Interaction. Our goal in this paper is to summarize the conceptual foundations that will form the basis for further empirical research aimed to inform institutions aspiring to create learning spaces in 3D virtual worlds.

Hidra: Hierarchical Inter-Domain Routing Architecture, Bryan Clevenger

Master's Theses

As the Internet continues to expand, the global default-free zone (DFZ) forwarding table has begun to grow faster than hardware can economically keep pace with. Various policies are in place to mitigate this growth rate, but current projections indicate policy alone is inadequate. As such, a number of technical solutions have been proposed. This work builds on many of these proposed solutions, and furthers the debate surrounding the resolution to this problem. It discusses several design decisions necessary to any proposed solution, and based on these tradeoffs it proposes a Hierarchical Inter-Domain Routing Architecture - HIDRA, a comprehensive architecture with …

Saluki: A High-Performance Wi-Fi Sniffing Program, Keren Tan, David Kotz

Dartmouth Scholarship

Building a campus-wide wireless LAN measurement system faces many efficiency, scalability and security challenges. To address these challenges, we developed a distributed Wi-Fi sniffing program called Saluki. Compared to our previous implementation and to other available sniffing programs, Saluki has the following advantages: (1) its small footprint makes it suitable for a resource-constrained Linux platform, such as those in commercial Wi-Fi access points; (2) the frame-capture rate increased more than three-fold over tcpdump with minimal frame loss; (3) all traffic between this sniffer and the back-end server was secured using 128-bit encryption; and (4) the traffic load on the backbone …

A Study Of Three Artificial Neural Networks Models' Ability To Identify Emotions From Facial Images, Timothy Scott Hyde

Theses and Dissertations

Facial expressions conveying emotions are vital for human communication. They are also important in the studies of human interaction and behavioral studies. Recognition of emotions, using facial images, may provide a fast and practical approach that is noninvasive. Most previous studies of emotion recognition through facial images were based on the Facial Action Coding System (FACS). The FACS, which was developed by Ekman and Freisen in 1978, was created to identify different facial muscular actions. Previous artificial neural network-based approaches for classification of facial expressions focused on improving one particular neural network model for better accuracy. The purpose of this …

Parameterized Algorithm For 3-Sat, Yi Gao

Theses and Dissertations - UTB/UTPA

The SAT problem is the classical NP-complete problem. In the past, many methods have been proposed for solving this problem. We investigated a new method for 3-SAT problem, which is a fixed parameterized algorithm proposed in this paper first. This method uses a fixed parameter k, where k is the number of true values in an assignment for checking whether the formula is satisfied or not. The complexity of our algorithm is O(3k ), which is exponentially independent of the number of variables. Theoretical analysis shows that when k is small, this method has smaller search space and higher speed.

Dna Staged Self-Assembly At Temperature 1, Nicholas H. Guiterrez

Theses and Dissertations - UTB/UTPA

We introduce alternate temperature 1 self-assembly constructions of an n x n square by efficiently utilizing bins and stages to achieve desirable results. These bins are able to contain a variety of tiles or supertiles, which are then mixed together in a pre-determined sequence of distinct stages. The basic 2D tile assembly model at temperature 1 uses 2n-1 tile types to construct a square. The model only utilizes one bin and occurs all in one stage. We will demonstrate how the use of bins and stages will allow for the construction of these squares more efficiently.

Guppie: A Coordination Framework For Parallel Processing Using Shared Memory Featuring A Master-Worker Relationship, Sean Christopher Mccarthy

Dissertations

Most programs can be parallelized to some extent. The processing power available in computers today makes parallel computing more desirable and attainable than ever before. Many machines today have multiple processors or multiple processing cores making parallel computing more available locally, as well as over a network. In order for parallel applications to be written, they require a computing language, such as C++, and a coordination language (or library), such as Linda. This research involves the creation and implementation of a coordination framework, Guppie, which is easy to use, similar to Linda, but provides more efficiency when dealing with large …

Applying Information Visualization To Computer Security Applications, Robert Bruce Whitaker

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This thesis presents two phases of research in applying visualization to network security challenges. The first phase included discovering the most useful and powerful features in existing computer security visualizations and incorporating them into the AdviseAid visualization platform, an existing software package. The incorporation of such a complete feature set required novel resolution of software engineering, human factors, and computer graphics issues. We also designed additional novel features, such as plugin interfaces, allowing for rapid prototyping and experimentation with novel visualization features and capabilities. The second phase of the research focused on the development of novel visualization techniques themselves. These …

Practical Implementation Of The Virtual Organization Cluster Model, Michael Fenn

All Theses

Virtualization has great potential in the realm of scientific computing because of its inherent advantages with regard to environment customization and isolation. Virtualization technology is not without it's downsides, most notably, increased computational overhead. This thesis introduces the operating mechanisms of grid technologies in general, and the Open Science Grid in particular, including a discussion of general organization and specific software implementation. A model for utilization of virtualization resources with separate administrative domains for the virtual machines (VMs) and the physical resources is then presented. Two well-known virtual machine monitors, Xen and the Kernel-based Virtual Machine (KVM), are introduced and …

Virtual Organization Clusters: Self-Provisioned Clouds On The Grid, Michael Murphy

All Dissertations

Virtual Organization Clusters (VOCs) provide a novel architecture for overlaying dedicated cluster systems on existing grid infrastructures. VOCs provide customized, homogeneous execution environments on a per-Virtual Organization basis, without the cost of physical cluster construction or the overhead of per-job containers. Administrative access and overlay network capabilities are granted to Virtual Organizations (VOs) that choose to implement VOC technology, while the system remains completely transparent to end users and non-participating VOs. Unlike alternative systems that require explicit leases, VOCs are autonomically self-provisioned according to configurable usage policies. As a grid computing architecture, VOCs are designed to be technology agnostic and …

Pslr(1): Pseudo-Scannerless Minimal Lr(1) For The Deterministic Parsing Of Composite Languages, Joel Denny

All Dissertations

Composite languages are composed of multiple sub-languages. Examples include the parser specification languages read by parser generators like Yacc, modern extensible languages with complex layers of domain-specific sub-languages, and even traditional programming languages like C and C++. In this dissertation, we describe PSLR(1), a new scanner-based LR(1) parser generation system that automatically eliminates scanner conflicts typically caused by language composition. The fundamental premise of PSLR(1) is the pseudo-scanner, a scanner that only recognizes tokens accepted by the current parser state. However, use of the pseudo-scanner raises several unique challenges, for which we describe a novel set of solutions. One major …

Architecture Optimization, Training Convergence And Network Estimation Robustness Of A Fully Connected Recurrent Neural Network, Xiaoyu Wang

All Dissertations

Recurrent neural networks (RNN) have been rapidly developed in recent years. Applications of RNN can be found in system identification, optimization, image processing, pattern reorganization, classification, clustering, memory association, etc.
In this study, an optimized RNN is proposed to model nonlinear dynamical systems. A fully connected RNN is developed first which is modified from a fully forward connected neural network (FFCNN) by accommodating recurrent connections among its hidden neurons. In addition, a destructive structure optimization algorithm is applied and the extended Kalman filter (EKF) is adopted as a network's training algorithm. These two algorithms can seamlessly work together to generate …

Creating A Biomedical Ontology Indexed Search Engine To Improve The Semantic Relevance Of Retreived Medical Text, William Taylor Ii

All Dissertations

Medical Subject Headings (MeSH) is a controlled vocabulary used by the National Library of Medicine to index medical articles, abstracts, and journals contained within the MEDLINE database. Although MeSH imposes uniformity and consistency in the indexing process, it has been proven that using MeSH indices only result in a small increase in precision over free-text indexing. Moreover, studies have shown that the use of controlled vocabularies in the indexing process is not an effective method to increase semantic relevance in information retrieval.
To address the need for semantic relevance, we present an ontology-based information retrieval system for the MEDLINE collection …