Physical Sciences and Mathematics Commons^™

Method Development For The Analysis Of Smokeless Powders And Organic Gunshot Residue By Ultra Performance Liquid Chromatography With Tandem Mass Spectrometry, Jennifer L. Thomas

FIU Electronic Theses and Dissertations

The goal of this project was to develop a rapid separation and detection method for analyzing organic compounds in smokeless powders and then test its applicability on gunshot residue (GSR) samples. In this project, a total of 20 common smokeless powder additives and their decomposition products were separated by ultra performance liquid chromatography (UPLC) and confirmed by tandem mass spectrometry (MS/MS) using multiple reaction monitoring mode (MRM). Some of the targeted compounds included diphenylamines, centralites, nitrotoluenes, nitroglycerin, and various phthalates. The compounds were ionized in the MS source using simultaneous positive and negative electrospray ionization (ESI) with negative atmospheric pressure …

Cosm News, Georgia Southern University

College of Science and Mathematics News (2012-2019)

• Dr. James H. Oliver, Jr., featured in Discover Magazine On-line

Adaptive Regret Minimization In Bounded-Memory Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha

Research Collection School Of Computing and Information Systems

Organizations that collect and use large volumes of personal information often use security audits to protect data subjects from inappropriate uses of this information by authorized insiders. In face of unknown incentives of employees, a reasonable audit strategy for the organization is one that minimizes its regret. While regret minimization has been extensively studied in repeated games, the standard notion of regret for repeated games cannot capture the complexity of the interaction between the organization (defender) and an adversary, which arises from dependence of rewards and actions on history. To account for this generality, we introduce a richer class of …

Polyphase Laramide Structures And Possible Folded Tertiary(?) Sills At Dagger Mountain, Big Bend National Park, Texas, Jeff Cullen, Nathan K. Knox, Jacob Crouch, Joseph I. Satterfield

The Compass: Earth Science Journal of Sigma Gamma Epsilon

Dagger Mountain, in Sierra del Carmen within Big Bend National Park, Texas, is a 5 km-long, doubly-plunging, southwest-vergent anticline adjacent to a doubly plunging syncline. Dagger Mountain lies near the eastern margins of the Cordilleran orogen and the Basin and Range province. Mapping at 1:12,000 scale reveals details about three phases of Laramide and Basin and Range structures. Mapping and descriptive structural analysis complement previous mapping at 1:12,000 – 1:75,000 scales (Poth, 1979; Moustafa, 1988; Cooper and others, 2011; Turner and others, 2011; Maxwell and others, 1967). Four distinctive formations of Cretaceous age crop out on Dagger Mountain: Santa Elena …

Showcasing The Geology Of American’S National Parks And Monuments, Larry E. Davis

The Compass: Earth Science Journal of Sigma Gamma Epsilon

Among America’s great treasures are its national parks, monuments, nature preserves, and historical sites. Many of America’s national parks feature unique and spectacular geology. Sigma Gamma Epsilon chapters, geology clubs, and individuals are encouraged to organize and submit a photo array featuring the geology of a particular national park or monument.

Timing Of Thermal Overprints In The Silvermines Granite And Associated Diabase Intrusions, St. Francois Mountains, Missouri, Renee C. Rohs

The Compass: Earth Science Journal of Sigma Gamma Epsilon

Igneous rocks exposed in the St. Francois Mountains record the geologic history of volcanic activity and plutonic intrusions contributing to the growth and stabilization of the continental crust during the Precambrian. These igneous rocks also contain evidence of thermal overprinting both in the isotope chemistry and the crystalline structures. This study presents new isotopic, mineral and petrologic data to support the timing of dike emplacement and thermal overprinting in the host rock. The study area for this research is along the East Fork of the St. Francis River at the Silver Mines Recreation Area where diabase dikes intrude the surrounding …

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, …

Create A Simple Predictive Analytics Classification Model In Java With Weka, James Howard

James Howard

Get an overview of the Weka classification engine and learn how to create a simple classifier for programmatic use. Understand how to store and load models, manipulate them, and use them to evaluate data. Consider applications and implementation strategies suitable for the enterprise environment so you turn a collection of training data into a functioning model for real- time prediction.

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 …

Constraint Answer Set Programming, Yuliya Lierler

Yuliya Lierler

Constraint answer set programming (CASP) is a novel, promising direction of research whose roots go back to propositional satisfiability (SAT). SAT solvers are efficient tools for solving boolean constraint satisfaction problems that arise in different areas of computer science, including software and hardware verification. Some constraints are more naturally expressed by non-boolean constructs. Satisfiability modulo theories (SMT) extends boolean satisfiability by the integration of non-boolean symbols defined by a background theory in another formalism, such as a constraint processing language. Answer set programming (ASP) extends computational methods of SAT in yet another way, inspired by ideas from knowledge representation, logic …

When Are Behaviour Networks Well-Behaved?, Bernhard Nebel, Yuliya Lierler

Yuliya Lierler

Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions quickly. This problem is addressed by a number of action-selection mechanisms. Behaviour networks as proposed by Maes are one such mechanism, which is quite popular. In general, it seems not possible to predict when behaviour networks are well-behaved. However, they perform quite well in the robotic soccer context. In this paper, we analyse the reason for this success by identifying conditions that make behaviour networks goal converging, i.e., force them to reach the goals …

Modular Answer Set Solving, Yuliya Lierler, Miroslaw Truszczyński

Yuliya Lierler

Modularity is essential for modeling large-scale practical applications.We propose modular logic programs as a modular version of answer set programming and study the relationship of our formalism to an earlier concept of lp-modules.

Weighted-Sequence Problem: Asp Vs Casp And Declarative Vs Problem-Oriented Solving, Yuliya Lierler, Shaden Smith

Yuliya Lierler

Search problems with large variable domains pose a challenge to current answer-set programming (ASP) systems as large variable domains make grounding take a long time, and lead to large ground theories that may make solving infeasible. To circumvent the “grounding bottleneck” researchers proposed to integrate constraint solving techniques with ASP in an approach called constraint ASP (CASP). In the paper, we evaluate an ASP system clingo and a CASP system clingcon on a handcrafted problem involving large integer domains that is patterned after the database task of determining the optimal join order. We find that search methods used by clingo …

Experiments With Sat-Based Answer Set Programming, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea, A. Tacchella

Yuliya Lierler

Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Propositional satisfiability (SAT) is one of the most studied problems in Computer Science. ASP and SAT are closely related: Recent works have studied their relation, and efficient SAT-based ASP solvers (like assat and Cmodels) exist. In this paper we report about (i) the extension of the basic procedures in Cmodels in order to incorporate the most popular SAT reasoning strategies, and (ii) an extensive comparative analysis involving also other state-of-the-art answer set solvers. The experimental analysis …

Model Generation For Generalized Quantifiers Via Answer Set Programming, Yuliya Lierler, Günther Görz

Yuliya Lierler

For the semantic evaluation of natural language sentences, in particular those containing generalized quantifiers, we subscribe to the generate and test methodology to produce models of such sentences. These models are considered as means by which the sentences can be interpreted within a natural language processing system. The goal of this paper is to demonstrate that answer set programming is a simple, efficient and particularly well suited model generation technique for this purpose, leading to a straightforward implementation.

Cmodels – Sat-Based Disjunctive Answer Set Solver, Yuliya Lierler

Yuliya Lierler

Disjunctive logic programming under the stable model semantics [GL91] is a new methodology called answer set programming (ASP) for solving combinatorial search problems. This programming method uses answer set solvers, such as DLV [Lea05], GNT [Jea05], SMODELS [SS05], ASSAT [LZ02], CMODELS [Lie05a]. Systems DLV and GNT are more general as they work with the class of disjunctive logic programs, while other systems cover only normal programs. DLV is uniquely designed to find the answer sets for disjunctive logic programs. On the other hand, GNT first generates possible stable model candidates and then tests the candidate on the minimality using system …

Sat-Based Answer Set Programming, Yuliya Lierler

Yuliya Lierler

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 …

Computing Answer Sets Of A Logic Program Via-Enumeration Of Sat Certificates, Yuliya Lierler, Marco Maratea

Yuliya Lierler

Answer set programming is a new programming paradigm proposed based on the answer set semantics of Prolog. It is well known that an answer set for a logic program is also a model of the program's completion. The converse is true when the logic program is "tight". Lin and Zhao showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called "loop formulas". Nevertheless, their solver ASSAT 1 has some disadvantages: it can work only with basic rules, and it can compute only one …

Cmodels: Sat-Based Answer Set Programming System, Yuliya Lierler, Marco Maratea

Yuliya Lierler

CMODELS [1, 2] is an answer set programming [3] system that uses the same frontend LPARSE as answer set solver SMODELS (http://www.tcs.hut.fi/Software/smodels/). CMODELS main computational characteristics is that it computes answer sets using a SAT solver for search. The use of SAT solvers for generating answer sets is based on the fact that for logic programs satisfying syntactic condition, tightness, the answer set semantics is equivalent to the Clark’s completion semantics. In addition, [4] introduced concept of a loop formula, and demonstrated that the answer sets of a logic program are exactly the models of its completion that satisfy the …

Abstract Answer Set Solvers With Backjumping And Learning, Yuliya Lierler

Yuliya Lierler

Nieuwenhuis et al. (2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937977 showed how to describe enhancements of the Davis–Putnam–Logemann–Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for several algorithms that generate answer sets for logic programs: SMODELS, SMODELS_cc, asp-sat with Learning (CMODELS), and a newly designed and implemented algorithm sup. This approach to describe answer set solvers makes it easier to prove their correctness, to compare them, and to design new systems.

Cmodels-2: Sat-Based Answer Set Solver Enhanced To Non-Tight Programs, Yuliya Lierler, Marco Maratea

Yuliya Lierler

Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program’s completion [4]. The converse is true when the logic program is “tight” [6, 5]. Lin and Zhao [7] showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called “loop formulas”. Nevertheless, their solver ASSAT1 has some disadvantages: it can work only …

Surviving Solver Sensitivity: An Asp Practitioner’S Guide, Bryan Silverthorn, Yuliya Lierler, Marius Schneider

Yuliya Lierler

Answer set programming (ASP) is a declarative programming formalism that allows a practitioner to specify a problem without describing an algorithm for solving it. In ASP, the tools for processing problem specifications are called answer set solvers. Because specified problems are often NP complete, these systems often require significant computational effort to succeed. Furthermore, they offer different heuristics, expose numerous parameters, and their running time is sensitive to the configuration used. Portfolio solvers and automatic algorithm configuration systems are recent attempts to automate the problem of manual parameter tuning, and to mitigate the burden of identifying the right solver configuration. …