Theory and Algorithms Commons^™

Automatic Program Rewriting In Non-Ground Answer Set Programs, Nicholas Hippen, Yuliya Lierler

Yuliya Lierler

Strong Equivalence And Program's Structure In Arguing Essential Equivalence Between First-Order Logic Programs, Yuliya Lierler

Yuliya Lierler

Smt-Based Constraint Answer Set Solver Ezsmt+ For Non-Tight Programs, Da Shen, Yuliya Lierler

Yuliya Lierler

Strong Equivalence And Conservative Extensions Hand In Hand For Arguing Correctness Of New Action Language C Formalization, Yuliya Lierler

Yuliya Lierler

Smt-Based Answer Set Solver Cmodels-Diff (System Description), Da Shen, Yuliya Lierler

Yuliya Lierler

Computer Vision Evidence Supporting Craniometric Alignment Of Rat Brain Atlases To Streamline Expert-Guided, First-Order Migration Of Hypothalamic Spatial Datasets Related To Behavioral Control, Arshad M. Khan, Jose G. Perez, Claire E. Wells, Olac Fuentes

Arshad M. Khan, Ph.D.

First-Order Modular Logic Programs And Their Conservative Extensions (Extended Abstract), Amelia Harrison, Yuliya Lierler

Yuliya Lierler

What Is Answer Set Programming To Propositional Satisfiability, Yuliya Lierler

Yuliya Lierler

Constraint Cnf: A Sat And Csp Language Under One Roof, Broes De Cat, Yuliya Lierler

Yuliya Lierler

A Tool For Staging Mixed-Initiative Dialogs, Joshua W. Buck, Saverio Perugini

Saverio Perugini

We discuss and demonstrate a tool for prototyping dialog-based systems that, given a high-level specification of a human-computer dialog, stages the dialog for interactive use. The tool enables a dialog designer to evaluate a variety of dialogs without having to program each individual dialog, and serves as a proof-of-concept for our approach to mixed-initiative dialog modeling and implementation from a programming language-based perspective.

Iclp Tutorial: Relating Constraint Answer Set Programming And Satisfiability Modulo Theories, Yuliya Lierler

Yuliya Lierler

No abstract provided.

Detection Of Diabetic Foot Ulcers Using Svm Based Classification, Lei Wang, Peder Pedersen, Diane Strong, Bengisu Tulu, Emmanuel Agu, Qian He, Ronald Ignotz, Raymond Dunn, David Harlan, Sherry Pagoto

Emmanuel O. Agu

Diabetic foot ulcers represent a significant health issue, for both patients’ quality of life and healthcare system costs. Currently, wound care is mainly based on visual assessment of wound size, which suffers from lack of accuracy and consistency. Hence, a more quantitative and computer-based method is needed. Supervised machine learning based object recognition is an attractive option, using training sample images with boundaries labeled by experienced clinicians. We use forty sample images collected from the UMASS Wound Clinic by tracking 8 subjects over 6 months with a smartphone camera. To maintain a consistent imaging environment and facilitate the capture process …

Disjunctive Answer Set Solvers Via Templates, Remi Brochenin, Yuliya Lierler, Marco Maratea

Yuliya Lierler

Metalogic Notes, Saverio Perugini

Saverio Perugini

A collection of notes, formulas, theorems, postulates and terminology in symbolic logic, syntactic notions, semantic notions, linkages between syntax and semantics, soundness and completeness, quantified logic, first-order theories, Goedel's First Incompleteness Theorem and more.

Statistics Notes, Saverio Perugini

Saverio Perugini

A collection of terms, definitions, formulas and explanations about statistics.

A Behavior-Reactive Autonomous System To Identify Pokémon Characters, Xu Cao, Bohan Zhang, Jeremy Straub, Eunjin Kim

Jeremy Straub

Pokémon is an entertainment franchise with a large fan base. This project uses well-known Pokémon characters to demonstrate the operations of a question selection system. Presented in the form of a game where the computer attempts to guess the user-selected character, the system attempts to minimize the number of questions required for this purpose by identifying questions that most constrain the decision space. The decision making process is refined based on actual user behavior.

Work Done On The Operating Software For Openorbiter, Dayln Limesand, Timothy Whitney, Jeremy Straub, Ronald Marsh

Jeremy Straub

The OpenOrbiter Program aims to develop a tem-plate for a CubeSat spacecraft that can be used world-wide to reduce spacecraft development costs1. Unlike other approaches, which may require $50,000 in upfront hardware costs2 or $250,000 in design expenses2, an OPEN-class spacecraft can be built with a parts budget of under $5,0003. This aims to enable low-cost educa-tional missions and missions in developing regions4.

Theory Identity: A Machine-Learning Approach, Kai Larsen, Dirk Hovorka, Jevin West, James Birt, James Pfaff, Trevor Chambers, Zebula Sampedro, Nick Zager, Bruce Vanstone

Bruce Vanstone

Theory identity is a fundamental problem for researchers seeking to determine theory quality, create theory ontologies and taxonomies, or perform focused theory-specific reviews and meta-analyses. We demonstrate a novel machine-learning approach to theory identification based on citation data and article features. The multi-disciplinary ecosystem of articles which cite a theory's originating paper is created and refined into the network of papers predicted to contribute to, and thus identify, a specific theory. We provide a 'proof-of-concept' for a highly-cited theory. Implications for crossdisciplinary theory integration and the identification of theories for a rapidly expanding scientific literature are discussed.

Scheduling Algorithm Development For An Open Source Software Spacecraft, Calvin Bina, Jeremy Straub, Ronald Marsh

Jeremy Straub

The OpenOrbiter project at the University of North Dakota is working to develop a set of designs for a CubeSat class spacecraft as well as a working, modular collection of open source code that can be used by other CubeSat projects as a starting point for development. The availability of these designs and this codebase should foster accelerated development for other CubeSat projects, allowing those projects to focus their effort on their own application area, instead of reinventing the proverbial wheel. One aspect of this is to implement a task scheduler which will run on a Raspberry Pi flight computer …

Voting Rules As Error Correcting Codes, Nisarg Shah, Ariel Procaccia, Yair Zick

Yair Zick

No abstract provided.

Constraint Answer Set Programming Versus Satisfiability Modulo Theories Or Constraints Versus Theories, Yuliya Lierler, Benjamin Susman

Yuliya Lierler

Clustering Of Search Trajectory And Its Application To Parameter Tuning, Linda Lindawati, Hoong Chuin Lau, David Lo

David LO

This paper is concerned with automated classification of Combinatorial Optimization Problem instances for instance-specific parameter tuning purpose. We propose the CluPaTra Framework, a generic approach to CLUster instances based on similar PAtterns according to search TRAjectories and apply it on parameter tuning. The key idea is to use the search trajectory as a generic feature for clustering problem instances. The advantage of using search trajectory is that it can be obtained from any local-search based algorithm with small additional computation time. We explore and compare two different search trajectory representations, two sequence alignment techniques (to calculate similarities) as well as …

Budgeted Personalized Incentive Approaches For Smoothing Congestion In Resource Networks, Pradeep Varakantham, Na Fu, William Yeoh, Shih-Fen Cheng, Hoong Chuin Lau

Shih-Fen CHENG

Congestion occurs when there is competition for resources by sel sh agents. In this paper, we are concerned with smoothing out congestion in a network of resources by using personalized well-timed in- centives that are subject to budget constraints. To that end, we provide: (i) a mathematical formulation that computes equilibrium for the re- source sharing congestion game with incentives and budget constraints; (ii) an integrated approach that scales to larger problems by exploiting the factored network structure and approximating the attained equilib- rium; (iii) an iterative best response algorithm for solving the uncon- strained version (no budget) of the …

Mechanisms For Arranging Ride Sharing And Fare Splitting For Last-Mile Travel Demands, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau

Shih-Fen CHENG

A great challenge of city planners is to provide efficient and effective connection service to travelers using public transportation system. This is commonly known as the last-mile problem and is critical in promoting the utilization of public transportation system. In this paper, we address the last-mile problem by considering a dynamic and demand-responsive mechanism for arranging ride sharing on a non-dedicated commercial fleet (such as taxis or passenger vans). Our approach has the benefits of being dynamic, flexible, and with low setup cost. A critical issue in such ride-sharing service is how riders should be grouped and serviced, and how …

Constraint Satisfaction Problem: A Generic Scheduler, Ben Carpenter, Brent Weichel, Jeremy Straub, Eunjin Kim

Jeremy Straub

The task was to create a scheduler that would create a schedule that gets as many of the tasks done as possible while maximizing the total value of the tasks performed. Each task was assigned a value, a priority, and a duration. Each task also had certain times that they could be run, so they couldn’t just be run at any point where they fit. We decided that in order to get a more accurate ordering for the process, we would take the value divided by the duration that way we were less likely to skip over processes that ran …

Dynamic Task Scheduling Problem: Greedy Knapsack Solution, Christian Sandtveit, Darrin Winger, Jeremy Straub, Eunjin Kim

Jeremy Straub

The problem that we worked with was a dynamic scheduling problem. For this problem, we are given a set of tasks to be scheduled in an allotted time slot, so that the total value of the tasks done is maximized. Each task has a duration, value. Each task also has one or more periods in which they can be scheduled. Some tasks can have conflicting time slots that can prevent other tasks from being scheduled. As tasks are assigned time slots it is possible to prevent other tasks from being as-signed a time slot. Looking for ways to minimize the …

Medical Rate Setting: Multi-Curve Approximation And Projection, Darrin Winger, Christian Sandtveit, Jeremy Straub, Eunjin Kim

Jeremy Straub

In order to maximize profit, our approach was to maximize the difference between total revenue and total cost, where total revenue would be larger than total cost. In the problem we are given a series of points, which relates price, cost, profit and quantity. We can calculate the total revenue by multi-plying the price with quantity, and the total cost by multiplying the cost with the quantity. Total profit is calculated by multiplying profit and quantity. We are given 4 initial points, and based on those 4 points we will calculate the point where the profit is currently maximized. Based …

Task Scheduling Problem: Using The Most Constrained Variable Algorithm To Maximize, Jaeden Lovin, Calvin Bina, Jeremy Straub, Eunjin Kim

Jeremy Straub

For this constraint satisfaction problem we needed to schedule a series of tasks to run in a certain order. Each task has a set duration that it must run for and a domain of times during which it can run during. Each task had a value and the goal of the problem was to pick times for the tasks to run in or-der to maximize the total value. We thought of multiple ways to potentially approach this problem, and decided to use some form of the least constraining variable. We would choose the task with the least constraints on other …

Medical Rate Setting Problem: Using The Hill-Climbing Search To Maximize Health Care Provider Profit, Calvin Bina, Jaeden Lovin, Jeremy Straub, Eunjin Kim

Jeremy Straub

Our program for calculating the optimal price for a service is relatively simple, but it gets great results. We make use of quadratic regres-sion. Quadratic regression has a very similar concept to linear regression. Given a set of data points, we find the equation that is the best fit to represent those data points. With linear re-gression, our resulting equation is linear. How-ever, with quadratic regression, our end result is a quadratic equation. We have two quadratic equations to come up with. One is our cost function and the other is our units sold func-tion. Both of these equations are …

Characterization Of Extended And Simplified Intelligent Water Drop (Siwd) Approaches And Their Comparison To The Intelligent Water Drop (Iwd) Approach, Jeremy Straub, Eunjin Kim

Jeremy Straub

This paper presents a simplified approach to performing the Intelligent Water Drops (IWD) process. This approach is designed to be comparatively lightweight while approximating the results of the full IWD process. The Simplified Intelligent Water Drops (SIWD) approach is specifically designed for applications where IWD must be run in a computationally limited environment (such as on a robot, UAV or small spacecraft) or where performance speed must be maximized for time sensitive applications. The SWID approach is described and compared and contracted to the base IWD approach.