bluuebunny/crossref_metadata_2025_split huggingface dataset:
Application of the FTA and ETA Method for Gas Hazard Identification for the Performance of Safety Systems in the Industrial Department
Authors: Ignac-Nowicka Jolanta 
Published: January 2018

Abstract
The paper analyzes the conditions of safe use of industrial gas systems and factors influencing gas hazards. Typical gas installation and its basic features have been characterized. The results of gas threat analysis in an industrial enterprise using FTA error tree method and ETA event tree method are presented. Compares selected methods of identifying hazards gas industry with respect to the scope of their use. The paper presents an analysis of two exemplary hazards: an industrial gas catastrophe (FTA) and an explosive gas explosion (ETA). In both cases, technical risks and human errors (human factor) were taken into account. The cause-effect relationships of hazards and their causes are presented in the form of diagrams in the drawings.
Quality Assurance in Environmental Technology Verification (ETV): Analysis and Impact on the EU ETV Pilot Programme Performance
Authors: Molenda Michał , Ratman-Kłosińska Izabela 
Published: January 2018

Abstract
Many innovative environmental technologies never reach the market because they are new and cannot demonstrate a successful track record of previous applications. This fact is a serious obstacle on their way to the market. Lack of credible data on the performance of a technology causes mistrust of investors in innovations, especially from public sector, who seek effective solutions however without compromising the technical and financial risks associated with their implementation. Environmental technology verification (ETV) offers a credible, robust and transparent process that results in a third party confirmation of the claims made by the providers about the performance of the novel environmental technologies. Verifications of performance are supported by high quality, independent test data. In that way ETV as a tool helps establish vendor credibility and buyer confidence. Several countries across the world have implemented ETV in the form of national or regional programmes. ETV in the European Union was implemented as a voluntary scheme if a form of a pilot programme. The European Commission launched the Environmental Technology Pilot Programme of the European Union (EU ETV) in 2011. The paper describes the European model of ETV set up and put to operation under the Pilot Programme of Environmental Technologies Verification of the European Union. The goal, objectives, technological scope, involved entities are presented. An attempt has been made to summarise the results of the EU ETV scheme performance available for the period of 2012 when the programme has become fully operational until the first half of 2016. The study was aimed at analysing the overall organisation and efficiency of the EU ETV Pilot Programme. The study was based on the analysis of the documents the operation of the EU ETV system. For this purpose, a relevant statistical analysis of the data on the performance of the EU ETV system provided by the European Commission was carried out.
Using Authentic Medication Errors to Promote Pharmacy Student Critical Thinking and Active Learning
Authors: Karimi Reza , Fortner Jeff , Rao Deepa , Su Joe 
Published: January 2018

Objective: To promote first year (P1) pharmacy students’ awareness of medication error prevention and to support student learning in biomedical and pharmaceutical sciences.
Innovation: A novel curricular activity was created and referred to as “Medication Errors and Sciences Applications (MESA)”. The MESA activity encouraged discussions of patient safety among students and faculty to link medication errors to biomedical and pharmaceutical sciences, which ultimately reinforced student learning in P1 curricular topics.
Critical Analysis: Three P1 cohorts implemented the MESA activity and approximately 75% of students from each cohort completed a reliable assessment instrument. Each P1 cohort had at least 14 student teams who generated professional reports analyzing authentic medication errors. The quantitative assessment results indicated that 70-85% of students believed that the MESA activity improved student learning in biomedical and pharmaceutical sciences. More than 95% of students agreed that the MESA activity introduced them to medication errors. Approximately 90% of students agreed that the MESA activity integrated the knowledge and skills they developed through the P1 curriculum, promoted active learning and critical thinking, and encouraged students to be self-directed learners. Furthermore, our data indicated that approximately 90% of students stated that the achievement of Bloom’s taxonomy's six learning objectives was promoted by completing the MESA activity.
Next Steps: Pharmacy students’ awareness of medication errors is a critical component of pharmacy education, which pharmacy educators can integrate with biomedical and pharmaceutical sciences to enhance student learning in the P1 year.
Treatment of Human Subjects: IRB exemption granted

Type: Note
A COMPARATIVE STUDY OF POETRY’S STRUCTURE: ‘NIGHT’ BY BLAKE AND ‘SHE WALKS IN BEUATY’ BY BYRON
Authors: Rosida Ana 
Published: January 2018

This research presented the comparative study about the structure in two poetries; they are Night and She Walks in Beauty. It focused the theme, the figure of speech and the imagery. It used the qualitative research. It is analyzed the structure by reading the poetry carefully and giving the note for each line that contains theme, figure of speech and imagery. It used the theory of comparative study and structural approach.The result of this research shows that the poet of those poetries use theme, figure of speech and imagery. There are many kinds of figure of speech and imagery in the poetry. In Night, there are only four figure of speeches namely (a) Simile, (b) Personification, (c) Metaphor and (d) Hyperbole and uses (1) Visual, (2) Auditory, (3) Tactile and (4) Kinesthetic as the imagery. In She Walks in Beauty, Byron uses (a) simile, (b) personification and (c) litotes as figure of speech and its imagery are (1) Visual and (2) Kinesthetic.The poetry Night and She Walks in Beauty appear both differences and similarities with regard to its poet’s writing style. Blake is subjective whereas Byron is objective in writing. Both poets use the nature in different ways to build the theme, the figure of speech and the imagery. Blake uses the nature to describe two contrast place and Byron used the nature to describe a woman character. AbstrakPenelitian ini membahas studi perbandingan tentang struktur dalam dua puisi, yaitu Night dan She Walks in Beauty. Penelitian ini berfokus pada Theme, Figure of Speech dan Imagery. Penelitian ini menggunakan penelitian kualitatif. Pada penelitian ini, struktur dianalisa dengan membaca puisi dengan seksama dan memberikan catatan untuk setiap baris yang berisi Tema, Majas dan Pencitraan. Penelitian ini mengunakan teori Comparative Study dan pendekatan Structural.Hasil penelitian ini menunjukkan bahwa penyair pada kedua puisi ini menggunakan Tema, Majas dan Pencitraan. Ada banyak jenis majas dan pencitraan dalam puisi tersebut. Pada puisi Night, Majas hanya ada empat yaitu (a) Simile, (b) Personification, (c) Metaphor dan (d) Hiperbole dan menggunakan (1) Visual, (2) Auditory, (3) Tictile dan (4) Kinestethic sebagai pencitraan. Pada puisi She Walks in Beauty, Byron menggunakan (a) Simile, (b) Personification dan (c) Litotes sebagai majas dan pencitraannya adalah (1) Visual dan (2) Kinestethic.Puisi Night dan She Walks in Beauty tampak perbedaan dan persamaan yang berkaitan dengan gaya penulisan penyairnya. Blake adalah penyair yang subjektif sedangkan Byron adalah penyair yang objectif dalam menulis. Kedua penyair tersebut menggunakan alam dengan cara yang berbeda untuk membangun Tema, Majas dan Pencitraan. Blake menggunakan alam untuk menggambarkan dua tempat yang dan Byron menggunakan alam untuk menggambarkan karakter wanita.
VARIASI LEKSIKAL TIGA ISOLEK DALAM KELUARGA BAHASA MELAYU RIAU
Authors: Syahrir Elvina 
Published: January 2018

Topik penelitian ini adalah variasi leksikal dalam keluarga bahasa Melayu Riau. Penelitian ini bertujuan untuk mendeskripsikan penghitungan atau penentuan persentase variasi kebahasaan yang terdapat dalam bahasa Melayu Riau di tiga isolek (Tualang, Kesumbo Ampai, dan Pelalawan) dan variasi leksikal yang terdapat dalam bahasa Melayu Riau di tiga isolek itu. Ketiga isolek itu berada pada kabupaten yang bertetangga yaitu Kabupaten Siak, Bengkalis, dan Pelalawan. Penelitian ini menggunakan metode dialektometri dengan pendekatan kuantitatif dan kualitatif. Pendekatan kuantitatif melihat persentase variasi kebahasaan, sedangkan pendekatan kualitatif mendeskripsikan variasi leksikonnya. Dari penghitungan dialektometri jarak kosakata tiga isolek dalam keluarga bahasa Melayu Riau menunjukkan bahwa (1) antarisolek Tualang dan isolek Pelalawan dianggap tidak ada perbedaan, (2) antarisolek Kesumbo Ampai dan isolek Pelalawan dianggap memiliki perbedaan wicara, dan (3) antarisolek Tualang dan isolek Kesumbo Ampai dianggap memiliki perbedaan wicara. Sementara itu, variasi leksikon dalam keluarga bahasa Melayu Riau dalam tiga isolek tersebut dari 200 glos terdapat 64 glos yang bervariasi.
A Report of ARCADE 2017
Authors: Reger Giles , Traytel Dmitriy 
Published: January 2018

The ARCADE workshop took place on the 6th August 2017 in Gothenburg, colocated with CADE-26. ARCADE stands for Automated Reasoning: Challenges, Applications, Directions, Exemplary achievements. The goal of this workshop was to bring together key people from various sub-communities of automated reasoning—such as SAT/SMT, resolution, tableaux, theory-specific calculi (e.g. for description logic, arithmetic, set theory), interactive theorem proving—to discuss the present, past, and future of the field.The workshop was attended by 45 people and consisted of 14 short presentations and 5 discussion sessions. The format was informal and highly interactive. This report gives a general overview of the presentations and summarizes the discussion sessions.
Using Vampire in Soundness Proofs of Type Systems
Authors: Grewe Sylvia , Erdweg Sebastian , Mezini Mira 
Published: January 2018

Type systems for programming languages shall detect type errors in programs before runtime. To ensure that a type system meets this requirement, its soundness must be formally verified. We aim at automating soundness proofs of type systems to facilitate the development of sound type systems for domain-specific languages.Soundness proofs for type systems typically require induction. However, many of the proofs of individual induction cases only require first-order reasoning. For the development of our workbench Veritas, we build on this observation by combining automated first-order theorem provers such as Vampire with automated proof strategies specific to type systems. In this paper, we describe how we encode type soundness proofs in first-order logic using TPTP. We show how we use Vampire to prove the soundness of type systems for the simply-typed lambda calculus and for parts of a typed SQL. We report on which parts of the proofs are handled well by Vampire, and what parts work less well with our current approach.
qbf2epr: A Tool for Generating EPR Formulas from QBF
Authors: Seidl Martina , Lonsing Florian , Biere Armin 
Published: January 2018

We present the tool qbf2epr which translates quantified Boolean formulas (QBF) toformulas in effectively propositional logic (EPR). The decision problem of QBF is theprototypical problem for PSPACE, whereas EPR is NEXPTIME-complete. Thus QBF isembedded in a formalism, which is potentially more succinct. The motivation for this workis twofold. On the one hand, our tool generates challenging benchmarks for EPR solvers.On the other hand, we are interested in how EPR solvers perform compared to QBF solvers and if there are techniques implemented in EPR solvers which would also be valuable in QBF solvers and vice versa.
Verification of Security Protocols
Authors: Cortier Vèronique 
Published: January 2018

Security protocols are short programs aiming at securing communications over a network. They are widely used in our everyday life. Their verification using symbolic models has shown its interest for detecting attacks and proving security properties. In particular, several automatic tools have been developed and are used to efficiently detect flaws.In this talk, we will first review results and techniques that allow automatic analysis of security protocols. In a second part, we will present recent results that demonstrate that formal abstract models used for verification are actually sound with respect to much richer models that considers issues of complexity and probability. As a consequence, it is possible to derive strong, clear security guarantees still keeping the simplicity of reasoning in symbolic models.
HipSpec : Automating Inductive Proofs of Program Properties
Authors: Claessen Koen , Johansson Moa , Rosen Dan , Smallbone Nick 
Published: January 2018

We present ongoing work on HipSpec, a system for automaticallyderiving and proving properties about functional programs. HipSpec usesa combination of theory formation, counter example testing andinductive theorem proving to automatically generate a set ofequational theorems about recursive functions in a program, which are laterused as a background theory for proving stated properties about a program.Initial experiments are encouraging; our initial HipSpec prototype already performs comparably to other, similar systems, even being able to deal with some properties other systems cannot handle.
Modeling Organic Chemistry and Planning Organic Synthesis
Authors: Masoumi Arman , Antoniazzi Megan , Soutchanski Mikhail 
Published: January 2018

Organic Synthesis is a computationally challenging practical problem concerned with constructing a target molecule from a set of initially available molecules via chemical reactions. This paper demonstrates how organic synthesis can be formulated as a planning problem in Artificial Intelligence, and how it can be explored using the state-of-the-art domain independent planners.To this end, we develop a methodology to represent chemical molecules and generic reactions in PDDL 2.2, a version of the standardized Planning Domain Definition Language popular in AI. In our model, derived predicates define common functional groups and chemical classes in chemistry, and actionscorrespond to generic chemical reactions. We develop a set of benchmark problems. Since PDDL is supported as an input language by many modern planners, our benchmark can be subsequently useful forempirical assessment of the performance of various state-of-the-art planners.
The Uses of SAT Solvers in Vampire
Authors: Reger Giles , Suda Martin 
Published: January 2018

Reasoning in a saturation-based first-order theorem prover is generally expensive involving complex term-indexing data structures and inferences such as subsumption resolution whose (worst case) running time is exponential in the length of the clause. In contrast, SAT solvers are very cheap, being able to solve large problems quickly and with relatively little memory overhead.Consequently, utilising this cheap power within Vampire to carry out certain tasks has proven highly successful. We give an overview of the different ways that SAT solvers are utilisedwithin Vampire and discuss further ways in which this usage could be extended
Cuts for circular proofs
Authors: Fortier Jérôme , Santocanale Luigi 
Published: January 2018

One of the authors introduced in [1] a calculus ofcircular proofs for studying the computability arising from thefollowing categorical operations: finite products and coproducts,initial algebras, final coalgebras. The calculus of[1] is cut-free; yet, even if sound and complete forprovability, it lacks an important property for the semantics ofproofs, namely fullness w.r.t. the class of natural categorical modelscalled μ-bicomplete category in [2].We fix, with this work, this problem by adding the cut rule to thecalculus. To this goal, we need to modifying the syntacticalconstraints on the cycles of proofs so to ensure soundness of thecalculus and at same time local termination of cut-elimination. Theenhanced proof system fully represents arrows of the intended model, afree μ-bicomplete category. We also describe a cut-eliminationprocedure as a model of computation arising from the above mentionedcategorical operations. The procedure constructs a cut-freeproof-tree with infinite branches out of a finite circular proof withcuts.[1] Luigi Santocanale. A calculus of circular proofs and its categorical semantics. In Mogens Nielsen and Uffe Engberg, editors, FoSSaCS, volume 2303 of Lecture Notes in Computer Science, pages 357–371. Springer, 2002.[2] Luigi Santocanale. μ-bicomplete categories and parity games. Theoretical Informatics and Applications, 36:195–227, September 2002.
Automating Proof Steps of Progress Proofs: Comparing Vampire and Dafny
Authors: Grewe Sylvia , Erdweg Sebastian , Mezini Mira 
Published: January 2018

\noindent Developing provably sound type systems is a non-trivial task which, as of today, typically requires expert skills in formal methods and a considerable amount of time. Our Veritas~\cite{GreweErdwegWittmannMezini15} project aims at providing support for the development of soundness proofs of type systems and efficient type checker implementations from specifications of type systems. To this end, we investigate how to best automate typical steps within type soundness proofs.\noindent In this paper, we focus on progress proofs for type systems of domain-specific languages. As a running example for such a type system, we model a subset SQL and augment it with a type system. We compare two different approaches for automating proof steps of the progress proofs for this type system against each other: firstly, our own tool Veritas, which translates proof goals and specifications automatically to TPTP~\cite{Sutcliffe98} and calls Vampire~\cite{KovacsV13} on them, and secondly, the programming language Dafny~\cite{Leino2010}, which translates proof goals and specifications to the intermediate verification language Boogie 2~\cite{Leino2008} and calls the SMT solver Z3~\cite{DeMoura2008} on them. We find that Vampire and Dafny are equally well-suited for automatically proving simple steps within progress proofs.
On Conditionals
Authors: Dietz Emmanuelle-Anna , Hölldobler Steffen , Pereira Luís Moniz 
Published: January 2018

We discuss the evaluation of conditionals. Under classical logic a conditional of the form "A implies B" is semantically equivalent to "not A or B". However, psychological experiments have repeatedly shown that this is not how humans understand and use conditionals.We introduce an innovative abstract reduction system under the three-valued Łukasiewicz logic and the weak completion semantics, that allows us to reason abductively and by revision with respect to conditionals, in three values. We discuss the strategy of minimal revision followed by abduction and discuss two notions of relevance.Psychological experiments will need to ascertain if these strategies and notions, or a variant of them, correspond to how humans reason with conditionals.
Anemic Status Prediction using Multilayer Perceptron Neural Network Model
Authors: Yu Ching Hao , Bhatnagar Manas , Hogen Rachel , Mao Dilin , Farzindar Atefeh , Dhanireddy Kiran 
Published: January 2018

Artificial Neural Network (ANN) has been well recognized as an effective tool in medical science. Medical data is complex, and currently collected data does not flow in a standardized way. Data complexity makes the outcomes associated with intra- operative blood management difficult to assess. Reliable evidence is needed to selectively define areas that can be improved and establish standard protocols across healthcare service lines to substantiate best practice in blood product utilization. The ANN is able to provide this evidence using automatic learning techniques to mine the hidden information under the medical data and come to conclusions.Blood transfusions can be lifesaving and are used commonly in complex surgical cases. Blood transfusions come with associated risks and are costly. Anemia and clinical symptoms are currently used to determine whether a packed red blood cell transfusion is necessary. In this paper, we worked with unique datasets of intra- operative blood management collected from the electronic medical record of the Keck Medical Center of USC. We apply Multilayer Perceptron Neural Network to estimate missing values and predict the degree of post-operative anemia. Successful predictions of postoperative anemia may help inform medical practitioners whether there is a need for a further packed red blood cell transfusion.
Deep Network Guided Proof Search
Authors: Loos Sarah , Irving Geoffrey , Szegedy Christian , Kaliszyk Cezary 
Published: January 2018

Deep learning techniques lie at the heart of several significant AI advances in recent years including object recognition and detection, image captioning, machine translation, speech recognition and synthesis, and playing the game of Go.Automated first-order theorem provers can aid in the formalization and verification of mathematical theorems and play a crucial role in program analysis, theory reasoning, security, interpolation, and system verification.Here we suggest deep learning based guidance in the proof search of the theorem prover E. We train and compare several deep neural network models on the traces of existing ATP proofs of Mizar statements and use them to select processed clauses during proof search. We give experimental evidence that with a hybrid, two-phase approach, deep learning based guidance can significantly reduce the average number of proof search steps while increasing the number of theorems proved.Using a few proof guidance strategies that leverage deep neural networks, we have found first-order proofs of 7.36% of the first-order logic translations of the Mizar Mathematical Library theorems that did not previously have ATP generated proofs. This increases the ratio of statements in the corpus with ATP generated proofs from 56% to 59%.
Compass-free Navigation of Mazes
Authors: Scott Phil , Fleuriot Jacques 
Published: January 2018

If you find yourself in a corridor of a standard maze, a sure and easy way to escapeis to simply pick the left (or right) wall, and then follow it along its twists andturns and around the dead-ends till you eventually arrive at the exit. But whathappens when you cannot tell left from right? What if you cannot tell North fromSouth? What if you cannot judge distances, and have no idea what it means to followa wall in a given direction?The possibility of escape in these circumstances is suggested in the statement of anunproven theorem given in David Hilbert's celebrated /Foundations of Geometry/, inwhich he effectively claimed that a standard maze could be fully navigated usingaxioms and concepts based /solely/ on the relations of points lying on lines in aspecified order.We discuss our algorithm for this surprisingly challenging version of the mazenavigation problem, and our HOL Light verification of its correctness from Hilbert'saxioms.
A Model Guided Instantiation Heuristic for the Superposition Calculus with Theories
Authors: Bax Joshua 
Published: January 2018

Generalised Model Finding (GMF) is a quantifier instantiation heuristic for the superposition calculus in the presence of interpreted theories with arbitrarily quantified free function symbols ranging into theory sorts.The free function symbols are approximated by finite partial function graphs along with some simplifying assumptions which are iteratively refined.Here we present an outline of the GMF approach, give an improvementthat addresses some of these and then present someideas for extending it with concepts from instantiation based theorem proving.