A STUDY OF MACHINE LEARNING APPLICATION IN BLOOD PRESSURE MEASUREMENT

Master'sMASTER OF ENGINEERIN

Lemmas: Generation, Selection, Application

Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates useful lemmas for automated theorem provers, demonstrating improvement for several representative systems and solving a hard problem not solved by any system for twenty years. By focusing on condensed detachment problems we simplify the setting considerably, allowing us to get at the essence of lemmas and their role in proof search

Set of support, demodulation, paramodulation: a historical perspective

This article is a tribute to the scientific legacy of automated reasoning pioneer and JAR founder Lawrence T. (Larry) Wos. Larry's main technical contributions were the set-of-support strategy for resolution theorem proving, and the demodulation and paramodulation inference rules for building equality into resolution. Starting from the original definitions of these concepts in Larry's papers, this survey traces their evolution, unearthing the often forgotten trails that connect Larry's original definitions to those that became standard in the field

Using Automated Reasoning Techniques for Deductive Databasis

This report presents a proposal for a deduction component that supports the query mechanism of relational databases. The query-subquery (QSQ) paradigm is currently very popular in the database community since it focuses the deduction process on the relevant data. We show how to extend the QSQ paradigm from Horn clauses to arbitrary predicate logic formulae such that disjunctions in the consequent of an implication, negation in its logical meaning and arbitrary recursive predicates can be handled without restrictions. Various techniques to improve the search behaviour, such as lemma generation, query generalization etc. can be incorporated. Furthermore we show how to use clause graphs for compile time optimizations in the presence of recursive clauses and to support the run time processing

The Road from Paraprofessional to Certified Teacher: A State, School District, and University Partnership

Over the past few decades thousands of special education teachers have been teaching students with disabilities on emergency or temporary certificates (Barnes, Crow, & Schaefer, 2007). The majority of these teachers entered the field of education with little to no preparation. Most of these under qualified teachers were hired in rural areas. Prior to the establishment of the cohort between the Tennessee Department of Education and East Tennessee State University-Sevier County Schools in 2000, there had been little to no planning in addressing the challenge of teacher shortage, specifically teacher attrition, in East Tennessee for special education teachers (East Tennessee State University, 2009; State of Tennessee, Office of Research and Education Accountability, 2006). The challenge of teacher shortage is secondary to teacher attrition for many school systems. Reasons teachers leave the profession are family or personal reasons, school staffing issues including layoffs, school closings, reorganizations, and retirement (Shakrani, 2008). The cost of high teacher attrition is felt in many ways. Examples include loss of outlays from states and local school districts, the challenge school districts face searching for replacements; and most of all, the cost to the student (Carroll, 2007). This qualitative study investigated the experiences of 12 paraprofessionals who completed the first East Tennessee State University-Sevier County Special Education Cohort to earn special education teaching certification. The 2000 ETSU-Sevier County Cohort started with 16 3 members. Currently 13 are teaching in special education, one cohort member is deceased, and two cohort members moved so that the other members do not know of their status. Cohort members received a 100% grant subsidy to participate in the program of study. The goal of the grant was “to improve the quality of instruction to students with disabilities from birth to 21 by increasing the number of appropriately endorsed special education teachers in Tennessee” (ETSU Special Education Institute, 2010, p. 2). The most dominant findings were the experience and background of paraprofessionals as they made their way to becoming certified teachers. These experiences were helpful in a variety of ways. Examples include completing course work, developing instructional strategies, behavior management, coteaching, and providing training for their paraprofessionals. Another finding and a major theme was group bonding among the cohorts. This bonding provided a support group in meeting the course work demands. Having access to local administrators who were their instructors and mentors was a consistent theme. Members of the cohort were supported by a 100% grant that provided the financial support necessary to make their journey possible; the necessity of that support was a common theme. The increased stress level, additional paper work, and responsibilities of being a certified teacher were other emerging themes. Time management was a prevalent theme throughout their experience. Finally, the support and admiration from their colleges, professors, and family members were major themes in their completing the cohort and becoming certified teachers

Larry Wos - Visions of automated reasoning

This paper celebrates the scientific discoveries and the service to the automated reasoning community of Lawrence (Larry) T. Wos, who passed away in August 2020. The narrative covers Larry's most long-lasting ideas about inference rules and search strategies for theorem proving, his work on applications of theorem proving, and a collection of personal memories and anecdotes that let readers appreciate Larry's personality and enthusiasm for automated reasoning

Don Quixote in Russia in the Eighteenth and Nineteenth Centuries: The Problem of Perception and Interpretation

This study examines the problem of the perception of Don Quixote in Russia in the eighteenth and nineteenth centuries. By using materials inaccessible to English-speaking scholars, I want to demonstrate that this process of appropriation was a long and a complex one, and there were specific reasons for that. The first modern novel, upon arrival in Russia, received minimal attention and was perceived as a simple, comical book; then, gradually, it started to gain significance. The majority of the materials that are used throughout this text are only available in Russian, are kept in the scientific libraries of Saint Petersburg and Moscow, and have never been translated into English. To facilitate reading this article, within the text I use the English translations that I generated myself, but, to preserve the authenticity of the text and give interested readers the opportunity to see or read the information in Russian, I included the original text in the endnotes

PrologPF: Parallel Logic and Functions on the Delphi Machine

PrologPF is a parallelising compiler targeting a distributed system of general purpose workstations connected by a relatively low performance network. The source language extends standard Prolog with the integration of higher-order functions. The execution of a compiled PrologPF program proceeds in a similar manner to standard Prolog, but uses oracles in one of two modes. An oracle represents the sequence of clauses used to reach a given point in the problem search tree, and the same PrologPF executable can be used to build oracles, or follow oracles previously generated. The parallelisation strategy used by PrologPF proceeds in two phases, which this research shows can be interleaved. An initial phase searches the problem tree to a limited depth, recording the discovered incomplete paths. In the second phase these paths are allocated to the available processors in the network. Each processor follows its assigned paths and fully searches the referenced subtree, sending solutions back to a control processor. This research investigates the use of the technique with a one-time partitioning of the problem and no further scheduling communication, and with the recursive application of the partitioning technique to effect dynamic work reassignment. For a problem requiring all solutions to be found, execution completes when all the distributed processors have completed the search of their assigned subtrees. If one solution is required, the execution of all the path processors is terminated when the control processor receives the first solution. The presence of the extra-logical Prolog predicate cut in the user program conflicts with the use of oracles to represent valid open subtrees. PrologPF promotes the use of higher-order functional programming as an alternative to the use of cut. The combined language shows that functional support can be added as a consistent extension to standard Prolog

Evolutionary inference across eukaryotes identifies universal features shaping organelle gene retention

Mitochondria and plastids power complex life. Why some genes and not others are retained in their organelle DNA (oDNA) genomes remains a debated question. Here, we attempt to identify the properties of genes and associated underlying mechanisms that determine oDNA retention. We harness over 15k oDNA sequences and over 300 whole genome sequences across eukaryotes with tools from structural biology, bioinformatics, machine learning, and Bayesian model selection. Previously hypothesized features, including the hydrophobicity of a protein product, and less well-known features, including binding energy centrality within a protein complex, predict oDNA retention across eukaryotes, with additional influences of nucleic acid and amino acid biochemistry. Notably, the same features predict retention in both organelles, and retention models learned from one organelle type quantitatively predict retention in the other, supporting the universality of these features—which also distinguish gene profiles in more recent, independent endosymbiotic relationships. A record of this paper’s transparent peer review process is included in the supplemental information