Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 9 of 9

Full-Text Articles in Computer Sciences

Multi-Stream Longitudinal Data Analysis Using Deep Learning, Sajjad Fouladvand Jan 2021

Multi-Stream Longitudinal Data Analysis Using Deep Learning, Sajjad Fouladvand

Theses and Dissertations--Computer Science

Longitudinal healthcare data encompasses all tasks where patients information are collected at multiple follow-up times. Analyzing this data is critical in addressing many real world problems in healthcare such as disease prediction and prevention. In this thesis, technical challenges in analyzing longitudinal administrative claims data are addressed and novel deep learning based models are proposed for multi-stream data analysis and disease prediction tasks. These algorithms and frameworks are assessed mainly on substance use disorders prediction tasks and specifically designed to tackled these disorders. Substance use disorder is a public health crisis costing the US an estimated $740 billion annually in …


Neural Representations Of Concepts And Texts For Biomedical Information Retrieval, Jiho Noh Jan 2021

Neural Representations Of Concepts And Texts For Biomedical Information Retrieval, Jiho Noh

Theses and Dissertations--Computer Science

Information retrieval (IR) methods are an indispensable tool in the current landscape of exponentially increasing textual data, especially on the Web. A typical IR task involves fetching and ranking a set of documents (from a large corpus) in terms of relevance to a user's query, which is often expressed as a short phrase. IR methods are the backbone of modern search engines where additional system-level aspects including fault tolerance, scale, user interfaces, and session maintenance are also addressed. In addition to fetching documents, modern search systems may also identify snippets within the documents that are potentially most relevant to the …


Markov Decision Processes With Embedded Agents, Luke Harold Miles Jan 2021

Markov Decision Processes With Embedded Agents, Luke Harold Miles

Theses and Dissertations--Computer Science

We present Markov Decision Processes with Embedded Agents (MDPEAs), an extension of multi-agent POMDPs that allow for the modeling of environments that can change the actuators, sensors, and learning function of the agent, e.g., a household robot which could gain and lose hardware from its frame, or a sovereign software agent which could encounter viruses on computers that modify its code. We show several toy problems for which standard reinforcement-learning methods fail to converge, and give an algorithm, `just-copy-it`, which learns some of them. Unlike MDPs, MDPEAs are closed systems and hence their evolution over time can be treated as …


Personality And Emotion For Virtual Characters In Strong-Story Narrative Planning, Alireza Shirvani Jan 2021

Personality And Emotion For Virtual Characters In Strong-Story Narrative Planning, Alireza Shirvani

Theses and Dissertations--Computer Science

Interactive virtual worlds provide an immersive and effective environment for training, education, and entertainment purposes. Virtual characters are an essential part of every interactive narrative. The interaction of rich virtual characters can produce interesting narratives and enhance user experience in virtual environments. I propose models of personality and emotion that are highly domain independent and integrate those models into multi-agent strong-story narrative planning systems. I demonstrate the value of the strong-story properties of the model by generating story conflicts intelligently. My models of emotion and personality enable the narrative generation system to create more opportunities for players to resolve conflicts …


Novel Hedonic Games And Stability Notions, Jacob Schlueter Jan 2021

Novel Hedonic Games And Stability Notions, Jacob Schlueter

Theses and Dissertations--Computer Science

We present here work on matching problems, namely hedonic games, also known as coalition formation games. We introduce two classes of hedonic games, Super Altruistic Hedonic Games (SAHGs) and Anchored Team Formation Games (ATFGs), and investigate the computational complexity of finding optimal partitions of agents into coalitions, or finding - or determining the existence of - stable coalition structures. We introduce a new stability notion for hedonic games and examine its relation to core and Nash stability for several classes of hedonic games.


Representing And Learning Preferences Over Combinatorial Domains, Michael Huelsman Jan 2021

Representing And Learning Preferences Over Combinatorial Domains, Michael Huelsman

Theses and Dissertations--Computer Science

Agents make decisions based on their preferences. Thus, to predict their decisions one has to learn the agent's preferences. A key step in the learning process is selecting a model to represent those preferences. We studied this problem by borrowing techniques from the algorithm selection problem to analyze preference example sets and select the most appropriate preference representation for learning. We approached this problem in multiple steps.

First, we determined which representations to consider. For this problem we developed the notion of preference representation language subsumption, which compares representations based on their expressive power. Subsumption creates a hierarchy of preference …


Computational Utilities For The Game Of Simplicial Nim, Nelson Penn Jan 2021

Computational Utilities For The Game Of Simplicial Nim, Nelson Penn

Theses and Dissertations--Computer Science

Simplicial nim games, a class of impartial games, have very interesting mathematical properties. Winning strategies on a simplicial nim game can be determined by the set of positions in the game whose Sprague-Grundy values are zero (also zero positions). In this work, I provide two major contributions to the study of simplicial nim games. First, I provide a modern and efficient implementation of the Sprague-Grundy function for an arbitrary simplicial complex, and discuss its performance and scope of viability. Secondly, I provide a method to find a simple mathematical expression to model that function if it exists. I show the …


Revisiting Absolute Pose Regression, Hunter Blanton Jan 2021

Revisiting Absolute Pose Regression, Hunter Blanton

Theses and Dissertations--Computer Science

Images provide direct evidence for the position and orientation of the camera in space, known as camera pose. Traditionally, the problem of estimating the camera pose requires reference data for determining image correspondence and leveraging geometric relationships between features in the image. Recent advances in deep learning have led to a new class of methods that regress the pose directly from a single image.

This thesis proposes methods for absolute camera pose regression. Absolute pose regression estimates the pose of a camera from a single image as the output of a fixed computation pipeline. These methods have many practical benefits …


Expanding Social Network Modeling Software And Agent Models For Diffusion Processes, Patrick Vaden Shepherd Jan 2021

Expanding Social Network Modeling Software And Agent Models For Diffusion Processes, Patrick Vaden Shepherd

Theses and Dissertations--Computer Science

In an increasingly digitally interconnected world, the study of social networks and their dynamics is burgeoning. Anthropologically, the ubiquity of online social networks has had striking implications for the condition of large portions of humanity. This technology has facilitated content creation of virtually all sorts, information sharing on an unprecedented scale, and connections and communities among people with similar interests and skills. The first part of my research is a social network evolution and visualization engine. Built on top of existing technologies, my software is designed to provide abstractions from the underlying libraries, drive real-time network evolution based on user-defined …