Computer Sciences Commons^™

Workshop | Body Worn Video Recorders: The Socio-Technical Implications Of Gathering Direct Evidence, Katina Michael, Alexander Hayes

Alexander Hayes Mr.

- From in-car video recording to body-worn video recording

- Exploring available technologies: how do they work, pros and cons

- Storing direct evidence in secure storage: factors to consider

- Citizens “shooting” back with POV tech – what are their rights?

- Crowdsourced sousveillance- harnessing public data for forensic profiling

- Police force policies and practices on the application of new media

The Applicability Of Greulich And Pyle Atlas To Assess Skeletal Age For Four Ethnic Groups, Sameem Abdul Kareem

Sameem Abdul Kareem

Background: Recently, determination of skeletal age, defined as the assessment of bone age, has rapidly become an important task between forensic experts and radiologists. The GreulichePyle (GP) atlas is one of the most frequently used methods for the assessment of skeletal age around the world. After presentation of the GP approach for the estimation of the bone age, much research has been conducted to examine the usability of this method in various geographic or ethnic categories. This study investigates on a small-scale and compares the reliability of the GP atlas for assessment of the bone age for four ethnic groups …

Scheduling For A Small Satellite For Remote Sensed Data Collection, Donovan Torgerson, Christoffer Korvalnd, Jeremy Straub, Ronald Marsh

Jeremy Straub

Small satellites, such as CubeSats, serve as excellent platforms for the collection of data that can be supplied to a geographic information system. To serve this need, they require a robust and lightweight task scheduler due to their limited onboard power production capabilities as well as internal space restrictions. Because of these constraints, schedules must be optimized; however, the scheduling optimization process must be performed using limited processing (CPU) power.

Several considerations must be taken into account in order to make a scheduler for these systems. This poster highlights requirements such as inter-dependency of onboard systems, and limited windows of …

Roofsat: Teaching Students Skills For Software Development For Gis Data Collection And Other Activities, Jeremy Straub, Ronald Marsh, Donovan Torgerson, Christoffer Korvald

Jeremy Straub

Small Spacecraft provide an excellent platform for the collection of geospatial data. In order to enable the low-cost creation of small remote sensing space-craft in a university environment, a training pathway for students is required. The Realistic Operational Ob-ject for Facilitating Software Assessment and Testing (RoofSat) serves to provide students with experience developing software for a small satellite platform typi-cal of those used for remote sensing missions. It al-lows software to be tested with hardware that re-sponds in a similar manner to that found on the satel-lite for a fraction of the cost of development. This poster details the goals …

Openorbiter Ground Station Software, Alexander Lewis, Jacob Huhn, Jeremy Straub, Travis Desell, Scott Kerlin

Jeremy Straub

OpenOrbiter is a student project at the University of North Dakota to design and build a low cost1 and open-hardware / open-source software CubeSat2. The Ground Station is the user interface for operators of the satellite. The ground station software must manage spacecraft communications, track its orbital location , manage task assignment, provide security and retrieve the data from the spacecraft. This will be presented via a graphical user interface that allows a user to easily perform these tasks.

Testing And Integration Team Project Management, Tyler Leben, Jeremy Straub, Scott Kerlin

Jeremy Straub

The Testing and Integration Team plays an integral role in the development of the open source CubeSat known as Open Orbiter. Like any project, the Testing Team’s project can benefit from structure and management to effectively utilize it’s time and resources. CSCI 297 teaches the skills needed to turn a good idea into successful endeavor. By applying skills such as effective planning, setting milestones, dealing with changes and supervising to an actual project, Open Orbiter has transformed from a pipe dream to a real, obtainable goal. Doing this has turned learning about project management into more that just power points …

Openorbiter Payload Software, Tim Whitney, Kyle Goehner, Jeremy Straub, Scott Kerlin

Jeremy Straub

The Payload Software team is responsible for developing the image processing and task decomposition systems on the Open Orbiter satellite1. The image processing software performs operations to enhance the quality of the images collected by the onboard camera, specifically, mosaicking, which takes multiple images and stitches them together to make a larger image and super resolution, which takes multiple low resolution images of the same area to produce a higher resolution image2,3,4. The task decomposition part of the system decomposes tasks defined by the user into jobs that then get sent to the operating system to be performed. This system …

Project Management For The Openorbiter Operating Software Team, Kelton Karboviak, Dayln Limesand, Michael Hlas, Eric Berg, Christoffer Korvald, Jeremy Straub, Ronald Marsh, Scott Kerlin

Jeremy Straub

OpenOrbiter is producing a 1-U CubeSat spacecraft1 to facilitate the construction of low-cost2 spacecraft by others in the future. The Operating Software team is in charge of designing and creating the software that controls most of the CubeSat’s operations such as image capturing, storage management, and temperature sensing. The project management deliverables that we have worked on as a team are the Project Definition, Work Breakdown Structure, and the Project Schedule. The Project Definition defines exactly what our project team will be developing including, but not limited to, what the team is in charge of developing, what its not in …

Ground Station Software Team Project Management, Zach Maguire, Marshall Mattingly, Christoffer Korvald, Jeremy Straub, Scott Kerlin

Jeremy Straub

In CSCI 297 class we partake in learning the roles of software team leads and developers. With hands on activities that get us involved in what a real manager of a software team may do such as: defining a project, planning a project, developing a work breakdown structure, estimating the work, developing a project schedule, etc. This work is performed in the context of the OpenOrbiter project which seeks to build a low-cost spacecraft1 that can be produced with a parts budget of approxi-mately $5,0002 by schools worldwide. The ground station software team’s purpose within Open Orbiter project is to …

Software For Openorbiter, Christoffer Korvald, Jeremy Straub, Scott Kerlin, Ronald Marsh

Jeremy Straub

The software development effort for the OpenOrbiter project consists of four teams: operating software development, payload software development, ground station software development and testing. These teams are designing and developing the software required to create a turn-key spacecraft design1 which can be produced at a price point of under USD $5,000 by faculty, students and researchers world-wide2. Through this process, students are gaining valuable real-world experience3,4 in areas of indicated interest5. Each team is headed by a team lead who is responsible for conducting weekly meetings and organizing the activities of the team. During the Fall, 2013 semester, team leads …

Payload Software Design And Development For A Remote Sensing Small Spacecraft, Kyle Goehner, Christoffer Korvald, Jeremy Straub, Ronald Marsh

Jeremy Straub

Scheduling for a Small Satellite for Remote Sensed Data Collection

Cyber In Waffle House Land, Jan Kallberg

Jan Kallberg

The epicenter of cyber is Washington, D.C., and the discourse radiates from the national capital outward. The question is how far from the Beltway it reaches. Does the rest of this nation care about the national security threat that is embedded in future adversarial cyber operations?

Abstract Modular Systems And Solvers, Yuliya Lierler, Miroslaw Truszczyński

Yuliya Lierler

Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce concepts of abstract modules and abstract modular systems to study general principles behind the design and analysis of modelfinding programs, or solvers, for integrated heterogeneous multi-logic systems. We show how abstract modules and abstract modular systems give rise to transition systems, which are a natural and convenient representation of solvers pioneered by the SAT community. We illustrate our approach by showing how it applies to answer set programming and propositional logic, and to multi-logic systems based on these two formalisms.

Asp-Based Problem Solving With Cutting-Edge Tools, Marcello Balduccini, Yuliya Lierler

Yuliya Lierler

In the development of practical applications of answer set programming (ASP), encodings that use well-established solvers such as CLASP and DLV are sometimes affected by scalability issues. In those situations, one can resort to more sophisticated ASP tools exploiting, for instance, incremental and constraint ASP. However, today there is no specific methodology for the selection or use of such tools. In this paper we describe how we used such cutting-edge ASP tools on challenging problems from the Third Answer Set Programming Competition, and outline the methodology we followed. We view this paper as a first step in the development of …

A Transition System For Ac Language Algorithms, Yuliya Lierler, Yaunlin Zhang

Yuliya Lierler

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. In a similar vein, Gebser et al. (2009) proposed a CLINGCON language integrating ASP and finite domain constraints. A distinguishing feature of these languages is their capacity to allow new efficient inference algorithms that combine traditional ASP procedures and other efficient methods in constraint programming. In this paper we show that a transition system introduced by Nieuwenhuis et al. (2006) can be extended to model the “hybrid” ACSOLVER algorithm, by Mellarkod et al., designed for processing a …

Hybrid Automated Reasoning Tools: From Black-Box To Clear-Box Integration, Marcello Balduccini, Yuliya Lierler

Yuliya Lierler

Recently, researchers in answer set programming and constraint programming spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. These efforts resulted in a new research area: constraint answer set programming (CASP). CASP languages and systems proved to be largely successful at providing efficient solutions to problems involving hybrid reasoning tasks, such as scheduling problems with elements of planning. Yet, the development of CASP systems is difficult, requiring non-trivial expertise in multiple areas. This suggests a need for a study identifying general development principles of hybrid systems. Once these principles …

Representing Synonymity In Causal Logic And In Logic Programming, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz, Fangkai Yang

Yuliya Lierler

We investigate the relationship between rules representing synonymity in nonmonotonic causal logic and in answer set programming. This question is of interest in connection with current work on modular languages for describing actions.

A Sat-Based Polynomial Space Algorithm For Answer Set Programming, Enrico Giunchiglia, Marco Maratea, Yuliya Lierler

Yuliya Lierler

The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the models of its completion. Unfortunately, these results only work for specific classes of problems. In this paper we present a SAT-Based decision procedure for …

Fages' Theorem And Answer Set Programming, Yuliya Lierler, Esta Erdem, Vladimir Lifschitz

Yuliya Lierler

We generalize a theorem by François Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negotiation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as SMODELS and DLV is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelä is discussed as an example.

Does Your Wireless Lan Have Criminal Intent?, Michael Crowley, Andrew Woodward

Michael Crowley

All of the literature relating to wireless network security has focused on the flaws, newer alternatives and suggestions for securing the network. There is much speculation and anecdotal statements in relation to what can happen if a breach occurs, but this is mostly from a computer security perspective, and mostly expressed in terms of potential for financial loss. This paper examines the potential legal ramifications of failing to properly secure a wireless network. Several scenarios are examined within based on usage of wireless on the various category of attack. Legal opinion, backed up with case law, is provided for each …

Nanohub - Crystal Viewer 2.0, Kevin Margatan, Gerhard Klimeck

Gerhard Klimeck

nanoHUB is an online compilation of tools for simulations. Equipped with 3-D simulations and a capability to solve very complex calculations, nanoHUB provides its users worldwide with various tools to help them finish their assignments. One of the tools available is called a Crystal Viewer Tool, an advanced crystal visualization tool. This tool allows users to generate various crystal types including their every single detail. Currently, a newer version, called Crystal Viewer 2.0, is being tested prior to its release. However, this tool is lacking some important features and a GUI that is not as user friendly as expected. The …

Next Generation Crystal Viewing Tool, Zach Schaffter, Gerhard Klimeck

Gerhard Klimeck

The science and engineering community is limited when it comes to crystal viewing software tools. Each tool lacks in a different area such as customization of structures or visual output. Crystal Viewer 2.0 was created to have all of these features in one program. This one tool simulates virtually any crystal structure with any possible material. The vtkvis widget offers users advanced visual options not seen in any other crystal viewing software. In addition, the powerful engine behind Crystal Viewer 2.0, nanoelectronic modeling 5 or (NEMO5), performs intensive atomic calculations depending on user input. A graphical user interface, or GUI, …

Probabilistic Verification Of Coordinated Multi-Robot Missions, Sagar J. Chaki, Joseph A. Giampapa

Joseph Andrew Giampapa

Robots are increasingly used to perform a wide variety of tasks, especially those involving dangerous or inaccessible locations. As the complexity of such tasks grow, robots are being deployed in teams, with complex coordination schemes aimed at maximizing the chance of mission success. Such teams operate under inherently uncertain conditions -- the robots themselves fail, and have to continuously adapt to changing environmental conditions. A key challenge facing robotic mission designers is therefore to construct a mission -- i.e., specify number and type of robots, number and size of teams, coordination and planning mechanisms etc. -- so as to maximize …

Integration Schemas For Constraint Answer Set Programming: A Case Study, Marcello Balduccini, Yuliya Lierler

Yuliya Lierler

Recently, researchers in answer set programming and constraint programming spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. These efforts resulted in a new research area: constraint answer set programming (CASP). CASP languages and systems proved to be largely successful at providing efficient solutions to problems involving hybrid reasoning tasks, such as scheduling problems with elements of planning. Yet, the development of CASP systems is difficult, requiring non-trivial expertise in multiple areas. This suggests a need for a study identifying general development principles of hybrid systems. Once these principles …

Answer Set Programming Based On Propositional Satisfiability, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea

Yuliya Lierler

Answer set programming (ASP) emerged in the late 1990s as a new logic programming paradigm that has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SAT were introduced. All these reductions, however, are limited to a subclass of logic programs or introduce new variables or may produce exponentially bigger propositional formulas. In this paper, we present a SAT-based procedure, called ASPSAT, that (1) deals with any (nondisjunctive) logic program, (2) works on a propositional formula without additional variables (except for those possibly introduced …

Abstract Answer Set Solvers, Yuliya Lierler

Yuliya Lierler

Nieuwenhuis, Oliveras, and Tinelli showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for three algorithms that generate answer sets for logic programs: SMODELS, ASP-SAT with Backtracking, and a newly designed and implemented algorithm SUP. This approach to describing answer set solvers makes it easier to prove their correctness, to compare them, and to design new systems.

Cmodels For Tight Disjunctive Logic Programs, Yuliya Lierler

Yuliya Lierler

Disjunctive logic programming under the stable model semantics [GL91] is a new answer set programming (ASP) methodology for solving combinatorial search problems. It is a form of declarative programming related to logic programming languages, such as Prolog, where the solutions to a problem are represented by answer sets, and not by answer substitutions produced in response to a query as in convential logic programming. Instead of Prolog systems, this programming method uses answer set solvers, such as smodels1, smodelscc2, cmodels3, dlv4, and gnt1. These systems made it possible for ASP to be successfully applied in such areas as planning, bounded …

Relating Constraint Answer Set Programming Languages And Algorithms, Yuliya Lierler

Yuliya Lierler

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming and constraint logic programming. Soon after that, a CLINGCON language integrating answer set programming and finite domain constraints, as well as an EZCSP language integrating answer set programming and constraint logic programming were introduced. The development of these languages and systems constitutes the appearance of a new AI subarea called constraint answer set programming. All these languages have something in common. In particular, they aim at developing new efficient inference algorithms that combine traditional answer set programming procedures and other methods in …

Practical And Methodological Aspects Of The Use Of Cutting-Edge Asp Tools, Marcello Balduccini, Yuliya Lierler

Yuliya Lierler

In the development of practical applications of answer set programming (ASP), encodings that use well-established solvers such as CLASP and DLV are sometimes affected by scalability issues. In those situations, one can resort to more sophisticated ASP tools exploiting, for instance, incremental and constraint ASP. However, today there is no specific methodology for the selection or use of such tools. In this paper we describe how we used such cutting-edge ASP tools on challenging problems from the Third Answer Set Programming Competition. We view this paper as a first step in the development of a general methodology for the use …

On The Relation Of Constraint Answer Set Programming Languages And Algorithms, Yuliya Lierler

Yuliya Lierler

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. Similarly, Gebser et al. (2009) proposed a CLINGCON language integrating ASP and finite domain constraints. These languages allow new efficient inference algorithms that combine traditional ASP procedures and other methods in constraint programming. In this paper we show that a transition system introduced by Nieuwenhuis et al. (2006) to model SAT solvers can be extended to model the “hybrid” ACSOLVER algorithm by Mellarkod et al. developed for simple AC programs and the CLINGCON algorithm by Gebser et …