Computer Sciences Commons^™

Automatic Identification Of Interestingness In Biomedical Literature, Gaurish Anand

Browse all Theses and Dissertations

This thesis presents research on automatically identifying interestingness in a graph of semantic predications. Interestingness represents a subjective quality of information that represents its value in meeting a user's known or unknown retrieval needs. The perception of information as interesting requires a level of utility for the user as well as a balance between significant novelty and sufficient familiarity. It can also be influenced by additional factors such as unexpectedness or serendipity with recent experiences. The ability to identify interesting information facilitates the development of user-centered retrieval, especially in information semantic summarization and iterative, step-wise searching such as in discovery …

A Context-Driven Subgraph Model For Literature-Based Discovery, Delroy Huborn Cameron

Browse all Theses and Dissertations

Literature-Based Discovery (LBD) refers to the process of uncovering hidden connections that are implicit in scientific literature. Numerous hypotheses have been generated from scientific literature using the LBD paradigm, which influenced innovations in diagnosis, treatment, preventions and overall public health. However, much of the existing research on discovering hidden connections among concepts have used distributional statistics and graph-theoretic measures to capture implicit associations. Such metrics do not explicitly capture the semantics of hidden connections. Rather, they only allude to the existence of meaningful underlying associations. To gain in-depth insights into the meaning of hidden (and other) connections, complementary methods have …

Curated Reasoning By Formal Modeling Of Provenance, Kevin B. Shaw

LSU New Orleans Theses and Dissertations

The core problem addressed in this research is the current lack of an ability to repurpose and curate scientific data among interdisciplinary scientists within a research enterprise environment. Explosive growth in sensor technology as well as the cost of collecting ocean data and airborne measurements has allowed for exponential increases in scientific data collection as well as substantial enterprise resources required for data collection. There is currently no framework for efficiently curating this scientific data for repurposing or intergenerational use.

There are several reasons why this problem has eluded solution to date to include the competitive requirements for funding and …

Forensic Analysis Of Whatsapp On Android Smartphones, Neha S. Thakur

LSU New Orleans Theses and Dissertations

Android forensics has evolved over time offering significant opportunities and exciting challenges. On one hand, being an open source platform Android is giving developers the freedom to contribute to the rapid growth of the Android market whereas on the other hand Android users may not be aware of the security and privacy implications of installing these applications on their phones. Users may assume that a password-locked device protects their personal information, but applications may retain private information on devices, in ways that users might not anticipate. In this thesis we will be concentrating on one such application called 'WhatsApp', a …

Simulating Inflation, Ryan M. Heathcote

Senior Honors Theses

Inflation is a common problem in modern economics, and it seems to persist, requiring government financial policy intervention on a regular basis in order to properly manage. The mechanics of inflation are difficult to understand, since the best metric modern society has for inflation involves taking samples of prices across the country. A simulation can give deeper insight into more than the mere fact that prices rise over time: a simulation can help to answer the “why” question. The problem with this statement is that developing a simulation is not as simple as writing some code. A simulation is developed …

A Large Scale Distributed Syntactic, Semantic And Lexical Language Model For Machine Translation, Ming Tan

Browse all Theses and Dissertations

The n-gram model is the most widely used language model (LM) in statistical machine translation system, due to its simplicity and scalability. However, it only encodes the local lexical relation between adjacent words and clearly ignores the rich syntactic and semantic structures of the natural languages. Attempting to increase the order of an n-gram to describe longer range dependencies in natural language immediately runs into the curse of dimensionality. Although previous researches tried to increase the order of n-gram on a large corpus, they did not see obvious improvement beyond 6-gram. Meanwhile, other LMs, such as syntactic language models and …

A Federated Architecture For Managing Health Information In Ethiopia, Russell Gillen Ms

All Student Scholarship

Electronic health systems can be leveraged to aid in the delivery and management of health care for patients in developing countries. The delivery of health information by mobile devices is playing an increasing role in health information management.

Toward Large-Scale Agent Guidance In An Urban Taxi Service, Agussurja Lucas, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Empty taxi cruising represents a wastage of resources in the context of urban taxi services. In this work, we seek to minimize such wastage. An analysis of a large trace of taxi operations reveals that the services’ inefficiency is caused by drivers’ greedy cruising behavior. We model the existing system as a continuous time Markov chain. To address the problem, we propose that each taxi be equipped with an intelligent agent that will guide the driver when cruising for passengers. Then, drawing from AI literature on multiagent planning, we explore two possible ways to compute such guidance. The first formulation …

College Of Engineering Graduate Celebration 2012 Announcement, University Of Nevada, Las Vegas

College of Engineering: Graduate Celebration Programs

The Howard R. Hughes College of Engineering Graduate Celebration is an event that recognizes the scholarly work of our engineering and computer science graduate students within the college. The target audience includes undergraduate students, graduate students, college faculty and staff, and the campus community as well as local and regional stakeholders. The objective of the event is to promote and publicize the research activities of the College of Engineering and to inform our stakeholders of our students’ achievements.

Software Engineering For The Mobile Application Market, Jacob Schwartz

Honors Theses and Capstones

One of the goals of the current United States government is to lower healthcare costs. One of the solutions is to alter the behavior of the population to be more physically active and to eat healthier. This project will focus on the latter solution by writing applications for the Android and iOS mobile platforms that will allow a user to monitor their dietary intake to see and correct patterns in their eating behavior.

Random Number Generation: Types And Techniques, David F. Dicarlo

Senior Honors Theses

What does it mean to have random numbers? Without understanding where a group of numbers came from, it is impossible to know if they were randomly generated. However, common sense claims that if the process to generate these numbers is truly understood, then the numbers could not be random. Methods that are able to let their internal workings be known without sacrificing random results are what this paper sets out to describe. Beginning with a study of what it really means for something to be random, this paper dives into the topic of random number generators and summarizes the key …

Procedurally Generating Everything, Micah Caunter

Senior Independent Study Theses

This paper investigates using Perlin Noise in a three-dimensional environment. Perlin Noise has been previously used to simulate clouds, marble, wood, and other natural phenomena as well as to model virtual landscapes. The simulation created for the I.S. procedurally generates both static and animated textures and models virtual landscapes to create a virtual world. In order to keep up with the rapidly advancing graphics industry, the OpenGL API is utilized to generate the textures in real-time and to display the final product.

Smart Card Based User Authentication, Brandon James

Browse all Theses and Dissertations

User authentication plays a very important role in building a secure computing system. In this thesis, we first studied and investigated existing user authentication schemes and some basic concepts of smart cards. We then proposed and implemented an improved user authentication scheme based on the smart card, specifically, Java card. We simulated a web server, and implemented the user authentication scheme with the Java card by programming a Java card applet and a Java program to send commands and receive responses from the card.

The proposed user authentication scheme has two phases: the registration phase and the user authentication phase. …

Knn-R: Building Secure And Efficient Outsourced Knn Query Service With The Rasp Encryption, Huiqi Xu

Browse all Theses and Dissertations

With the wide deployment of public cloud computing infrastructures, outsourcing database services to the cloud has become an appealing solution to save operating expense. However, some databases might be so sensitive or precious that the data owner does not want to move to the cloud unless the security is guaranteed. On the other hand, a secure outsourced service should still provide efficient query processing and significantly reduce the inhouse workload to fully realize the benefits of outsourcing. We summarize these key features for an outsourced service as the CPEL criteria: data Confidentiality, query Privacy, Efficient query processing, and Low inhouse …

Direct Optimization Of Ranking Measures For Learning To Rank Models, Li Li Guo

Browse all Theses and Dissertations

The main challenge in learning-to-rank for information retrieval is the difficulty to di- rectly optimize ranking measures to automatically construct a ranking model from training data. It is mainly due to the fact that the ranking measures are determined by the order of ranked documents rather than the specific values of ranking model scores, thus they are non-convex, nondifferentiable and discontinuous. To address this issue, listwise approaches have been proposed where loss functions are defined either by exploiting a probabilistic model or by optimizing upper bounds or smoothed approximations of ranking measures. Even though very promising results have been achieved, …

Linked Open Data Alignment & Querying, Prateek Jain

Browse all Theses and Dissertations

The recent emergence of the "Linked Data" approach for publishing data represents a major step forward in realizing the original vision of a web that can "understand and satisfy the requests of people and machines to use the web content" i.e. the Semantic Web. This new approach has resulted in the Linked Open Data (LOD) Cloud, which includes more than 295 large datasets contributed by experts belonging to diverse communities such as geography, entertainment, and life sciences. However, the current interlinks between datasets in the LOD Cloud, as we will illustrate,are too shallow to realize much of the benefits promised. …

Predicting Traffic On The Maine Turnpike Using Artificial Neural Networks, Robert Swain Ms

All Student Scholarship

In this thesis, I compare the forecasting accuracy of statistical models with artificial neural networks when predicting daily traffic counts on the Maine turnpike over holiday weekends.

Simulation, Application, And Resilience Of An Organic Neuromorphic Architecture, Made With Organic Bistable Devices And Organic Field Effect Transistors, Robert A. Nawrocki

Electronic Theses and Dissertations

This thesis presents work done simulating a type of organic neuromorphic architecture, modeled after Artificial Neural Network, and termed Synthetic Neural Network, or SNN. The first major contribution of this thesis is development of a single-transistor-single-organic-bistable-device-per-input circuit that approximates behavior of an artificial neuron. The efficacy of this design is validated by comparing the behavior of a single synthetic neuron to that of an artificial neuron as well as two examples involving a network of synthetic neurons. The analysis utilizes electrical characteristics of polymer electronic elements, namely Organic Bistable Device and Organic Field Effect Transistor, created in the laboratory at …

Parallel Sorting On Multi-Core Architecture, Wei Wang

Browse all Theses and Dissertations

With the limitations given by the power consumption (power wall), memory wall and the instruction level parallelism, the computing industry has turned its direction to multi-core architectures. Nowadays, the multi-core and many-core architectures are becoming the trend of the processor design. But how to exploit these architectures is the primary challenge for the research community. To take advantage of the multi-core architectures, the software design has undergone fundamental changes.

Sorting is a fundamental, important problem in computer science. It is utilized in many applications such as databases and search engines. In this thesis, we will investigate and auto-tune two parallel …

Towards Optimal Resource Provisioning For Running Mapreduce Programs In Public Clouds, Fengguang Tian

Browse all Theses and Dissertations

Running MapReduce programs in the public cloud introduces the important problem: how to optimize resource provisioning to minimize the financial charge for a specific job? In this thesis, We study the whole process of MapReduce processing and build up a cost function that explicitly models the relationship between the amount of input data, the available system resources (Map and Reduce slots), and the complexity of the Reduce function for the target MapReduce job. The model parameters can be learned from test runs with a small number of nodes on a small amount of data. Based on this cost model, we …

Testing And Maintenance In The Video Game Industry Today, Anthony A. Jarman

Senior Honors Theses

Testing and maintenance are important when designing any type of software, especially video games. Since the gaming industry began, testing and maintenance techniques have evolved and changed. In order to understand how testing and maintenance techniques are practiced in the gaming industry, several key elements must be examined. First, specific testing and maintenance techniques that are most useful for video games must be analyzed to understand their effectiveness. Second, the processes used for testing and maintaining video games at the beginning of the industry must be reviewed in order to see how far testing and maintenance techniques have progressed. Third, …

Quantum Algorithm Animator, Lori Eileen Nicholson

CCAC Theses and Dissertations

The design and development of quantum algorithms present a challenge, especially for inexperienced computer science students. Despite the numerous common concepts with classical computer science, quantum computation is still considered a branch of theoretical physics not commonly used by computer scientists. Experimental research into the development of a quantum computer makes the use of quantum mechanics in organizing computation more attractive, however the physical realization of a working quantum computer may still be decades away.

This study introduces quantum computing to computer science students using a quantum algorithm animator called QuAL. QuAL's design uses features common to classical algorithm animators …

Collapsible Graphs And Reductions Of Line Graphs, Zhi-Hong Chen, Peter C.B. Lam, Wai-Chee Shiu

Scholarship and Professional Work - LAS

A graph G is collapsible if for every even subset X ⊆ V ( G ) , G has a subgraph such that G − E ( Γ ) is connected and the set of odd-degree vertices of Γ is X . A graph obtained by contracting all the non-trivial collapsible subgraphs of G is called the reduction of G . In this paper, we characterize graphs of diameter two in terms of collapsible subgraphs and investigate the relationship between the line graph of the reduction and the reduction of the line graph. Our results extend former results in [H.-J. …

Isolation And Dependency Resolution Of Presentation, Processing And Persistence, Mehrab Monjur

Master's Theses (2009 -)

For business application development it is important to isolate programming efforts of the concerns: Presentation, Processing and Persistence. Development of each of these concerns has an independent thinking process and requires somewhat different programming languages and development tools. In order to isolate the concerns, we provide passages between the concerns and control the flow of execution by following essentially three rules: 1. Presentation and Processing are coroutines, 2. Processing is finished before Presentation can begin to show output, and 3. Persistence is a subsystem of Processing. We explain how these rules come to existence, and what the implications are in …

New Computational Approaches For Multiple Rna Alignment And Rna Search, Daniel Deblasio

Electronic Theses and Dissertations

In this thesis we explore the the theory and history behind RNA alignment. Normal sequence alignments as studied by computer scientists can be completed in O(n2) time in the naive case. The process involves taking two input sequences and finding the list of edits that can transform one sequence into the other. This process is applied to biology in many forms, such as the creation of multiple alignments and the search of genomic sequences. When you take into account the RNA sequence structure the problem becomes even harder. Multiple RNA structure alignment is particularly challenging because covarying mutations make sequence …

A Framework For Efficient Data Distribution In Peer-To-Peer Networks., Darshan Purandare

Electronic Theses and Dissertations

Peer to Peer (P2P) models are based on user altruism, wherein a user shares its content with other users in the pool and it also has an interest in the content of the other nodes. Most P2P systems in their current form are not fair in terms of the content served by a peer and the service obtained from swarm. Most systems suffer from free rider's problem where many high uplink capacity peers contribute much more than they should while many others get a free ride for downloading the content. This leaves high capacity nodes with very little or no …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 8, June 2006, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 7, May 2006, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 6, April 2006, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A six page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Design And Measurement Of A Real-Time Peer-To-Peer Game, Michael D. Simonsen

Theses and Dissertations

Currently, multiplayer online games use the client-server architecture which is very resource intensive, expensive, and time consuming. Peer-to-peer protocols are a less resource intensive alternative to the client-server model. We implement a peer-to-peer protocol called NEO in a multiplayer game and run experiments in a lab setting and over the Internet. These experiments show us that NEO is able to run a smooth playable game, with low unused updates and low location error. This happens as long as the arrival delay is long enough to allow updates to arrive in the given time limit and the round length is short …