bluuebunny/crossref_metadata_2025_split huggingface dataset:
Deciphering extreme rainfall and historical floods at Easkey on the west coast of Ireland
Authors: Kettle A. J. , Murphy C. 
Published: September 2023

AbstractA written account of two flood events in 1844 and 1877 at Easkey in Co. Sligo on the west coast of Ireland is explored with several meteorological datasets and historical newspaper accounts. Gridded daily precipitation fields for Ireland for the late twentieth century are analysed to assess rainfall extremes and most probable month of the annual maximum. Historic rainfall datasets are analysed to corroborate the account of the floods. A lot of rainfall data have survived from the nineteenth century, but there is still an imperfect match between the written account and the old weather records.
Teacher Feedback Tools
Authors: Anson Chris M. 
Published: September 2023

AbstractBefore digital technology, students submitted handwritten or typed papers to their instructor, who responded with handwritten marginal and end comments, often with the infamous “red pen” (Dukes & Albenisi, 2013). After the introduction of word processing, students typically printed out and submitted hard copies of their final drafts, on which the instructor would handwrite comments. Today, most instructors (and all who teach online) ask students to send their (digitally produced) writing as email attachments or upload them to a learning management site or other cloud-based repository, allowing them, in turn, to provide digital feedback. Tools for such feedback have enabled instructors to comment with greater efficiency, clarity (avoiding the longstanding problem of students having to decipher scribbled remarks), and support. After a brief historical introduction, this chapter will describe four types of digital tools for teacher feedback: digital annotation tools, text expansion tools, voice-to-text tools, and tools for audio and audio-visual feedback.
Digital Student Peer Review Programs
Authors: Anson Chris M. 
Published: September 2023

AbstractStudent peer review of drafts in progress was a staple of writing instruction for decades before computers: students exchange and discussed typed or handwritten drafts in small groups of three or four. With the advent of digital connectivity, students could circulate electronic versions of their texts, then read and annotate drafts online. Simultaneously, digital peer review systems were developed that not only facilitated student response but included learning analytics as well as features such as repositories of comments to prompt student response, badges, sticky notes, and feedback mechanisms that evaluated the quality of the response; anonymous response also became possible (see Lu & Bol, 2007). After a brief historical introduction, this chapter focuses primarily on digital peer review systems and peer review systems built into LMSs such as Canvas. The chapter describes the nature and range of digital peer review systems and includes a summary of research on their effectiveness.
Writing Processes in the Digital Age: A Networked Interpretation
Authors: Cummings Lance 
Published: September 2023

AbstractThe concept of writing processes is clearly useful for the study of digital writing when we see writing as a complex, integrated set of actions that are organized in time and integrated into both digital and physical spaces. With the increased digitalization of writing, the processes of writing are becoming more integrated into a variety of tools, workspaces, and platforms, adding new layers to how we perform writing. This chapter explores how writers and researchers can conceptualize digital writing activities as new platforms and software continue to evolve, changing the way writers adapt processes to complex writing situations. The proliferation of digital spaces and tools also raises the visibility of writing processes formerly difficult to assess and evaluate due to their cognitive nature. This chapter will summarize primary approaches to writing processes and several heuristics currently used to understand and analyze writing as a dynamic and networked activity. These tools are useful for examining the new ways digital technologies make writing processes visible for both research and reflection. The chapter will also discuss some implications for theory, pedagogy, and research.
An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL
Authors: Möhle Sibylle 
Published: September 2023

AbstractWe presentAbstract CNF2dDNNF, a calculus describing an approach for compiling a formula in conjunctive normal form (CNF) into deterministic negation normal form (d-DNNF). It combines component-based reasoning with a model enumeration approach based on conflict-driven clause learning (CDCL) with chronological backtracking. Its properties, such as soundness and termination, carry over to implementations which can be modeled by it. We provide a correctness proof and a detailed example. The main conceptual differences to currently available tools targeting d-DNNF compilation are discussed and future research directions presented. The aim of this work is to lay the theoretical foundation for a novel method for d-DNNF compilation. To the best of our knowledge, our approach is the first knowledge compilation method using CDCL with chronological backtracking.
Hammering Floating-Point Arithmetic
Authors: Torstensson Olle , Weber Tjark 
Published: September 2023

AbstractSledgehammer, a component of the interactive proof assistant Isabelle/HOL, aims to increase proof automation by automatically discharging proof goals with the help of external provers. Among these provers are a group of satisfiability modulo theories (SMT) solvers with support for the SMT-LIB input language. Despite existing formalizations of IEEE floating-point arithmetic in both Isabelle/HOL and SMT-LIB, Sledgehammer employs an abstract translation of floating-point types and constants, depriving the SMT solvers of the opportunity to make use of their dedicated decision procedures for floating-point arithmetic.We show that, by extending Sledgehammer’s translation from the language of Isabelle/HOL into SMT-LIB with an interpretation of floating-point types and constants, floating-point reasoning in SMT solvers can be made available to Isabelle/HOL. Our main contribution is a description and implementation of such an extension. An evaluation of the extended translation shows a significant increase of Sledgehammer’s success rate on proof goals involving floating-point arithmetic.
Translating SUMO-K to Higher-Order Set Theory
Authors: Brown Chad E. , Pease Adam , Urban Josef 
Published: September 2023

AbstractWe describe a translation from a fragment of SUMO (SUMO-K) into higher-order set theory. The translation provides a formal semantics for portions of SUMO which are beyond first-order and which have previously only had an informal interpretation. It also for the first time embeds a large common-sense ontology into an interactive theorem proving system. We further extend our previous work in finding contradictions in SUMO from first-order constructs to include a portion of SUMO’s higher-order constructs. Finally, using the translation, we can create problems that can be proven using higher-order interactive and automated theorem provers. This is tested in several systems and used to form a corpus of higher-order common-sense reasoning problems.
Recurrence-Driven Summations in Automated Deduction
Authors: Nummelin Visa , Blanchette Jasmin , Dahmen Sander R. 
Published: September 2023

AbstractMany problems in mathematics and computer science involve summations. We present a procedure that automatically proves equations involving finite summations, inspired by the theory of holonomic sequences. The procedure is designed to be interleaved with the activities of a higher-order automatic theorem prover. It performs an induction and automatically solves the induction step, leaving the base cases to the theorem prover.
Formal Verification of Bit-Vector Invertibility Conditions in Coq
Authors: Ekici Burak , Viswanathan Arjun , Zohar Yoni , Tinelli Cesare , Barrett Clark 
Published: September 2023

AbstractWe prove the correctness of invertibility conditions for the theory of fixed-width bit-vectors—used to solve quantified bit-vector formulas in the Satisfiability Modulo Theories (SMT) solver cvc5— in the Coq proof assistant. Previous work proved many of these in a completely automatic fashion for arbitrary bit-width; however, some were only proved for bit-widths up to 65, even though they are being used to solve formulas over larger bit-widths. In this paper we describe the process of proving a representative subset of these invertibility conditions in Coq. In particular, we describe the library for bit-vectors in Coq, our extensions to it, and proofs of the invertibility conditions.
KBO Constraint Solving Revisited
Authors: Briefs Yasmine , Leidinger Hendrik , Weidenbach Christoph 
Published: September 2023

AbstractKBO constraint solving is very well-known to be an NP-complete problem. Motivated by the needs of the family of SCL calculi, we consider the particular case where all terms occurring in a constraint are bound by a (single) ground term. We show that this problem and variants of this problem remain NP-complete even if the form of atoms in the constraint is further restricted. In addition, for a non-strict, partial term ordering solely based on symbol counting constraint solving remains NP-complete. Nevertheless, we provide a new simple algorithm testing KBO constraint solvability that performs well on benchmark examples.
A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
Authors: Haga Ryota , Kagaya Yuki , Aoto Takahito 
Published: September 2023

AbstractThe rewrite relation of a conditional term rewriting system (CTRS) can be divided into a hierarchy of rewrite relations of term rewriting systems (TRSs) by the depth of the recursive use of rewrite relation in conditions; a CTRS is said to be level-confluent if each of these TRSs are confluent, and level-confluence implies confluence. We introduce level-commutation of CTRSs that extends the notion of level-confluence, in a way similar to extending confluence to commutation, and give a critical pair criterion for level-commutation of oriented CTRSs with extra variables (3-CTRSs). Our result generalizes a criterion for commutation of TRSs of (Toyama, 1987), and properly extends a criterion for level-confluence of orthogonal oriented 3-CTRSs (Suzuki et al., 1995). We also present criteria for level-confluence and commutation of join and semi-equational 3-CTRSs that may have overlaps.
Logic of Communication Interpretation: How to Not Get Lost in Translation
Authors: Cignarale Giorgio , Kuznets Roman , Rincon Galeana Hugo , Schmid Ulrich 
Published: September 2023

AbstractByzantine fault-tolerant distributed systems are designed to provide resiliency despite arbitrary faults, i.e., even in the presence of agents who do not follow the common protocol and/or despite compromised communication. It is, therefore, common to focus on the perspective of correct agents, to the point that the epistemic state of byzantine agents is completely ignored. Since this view relies on the assumption that faulty agents may behave arbitrarily adversarially, it is overly conservative in many cases. In blockchain settings, for example, dishonest players are usually not malicious, but rather selfish, and thus just follow some “hidden” protocol that is different from the protocol of the honest players. Similarly, in high-availability large-scale distributed systems, software updates cannot be globally instantaneous, but are rather performed node-by-node. Consequently, updated and non-updated nodes may simultaneously be involved in a protocol for solving a distributed task like consensus or transaction commit. Clearly, the usual assumption of common knowledge of the protocol is inappropriate in such a setting. On the other hand, joint protocol execution and, sometimes, even basic communication becomes problematic without this assumption: How are agents supposed to interpret each other’s messages without knowing their mutual communication protocols? We propose a novel epistemic modality creed for epistemic reasoning in heterogeneous distributed systems with agents that are uncertain of the actual communication protocol used by their peers. We show that the resulting logic is quite closely related to modal logic $$\textsf{S5}$$, the standard logic of epistemic reasoning in distributed systems. We demonstrate the utility of our approach by several examples
.
Symbolic Model Construction for Saturated Constrained Horn Clauses
Authors: Bromberger Martin , Leutgeb Lorenz , Weidenbach Christoph 
Published: September 2023

AbstractClause sets saturated by hierarchic ordered resolution do not offer a model representation that can be effectively queried, in general. They only offer the guarantee of the existence of a model. We present an effective symbolic model construction for saturated constrained Horn clauses. Constraints are in linear arithmetic, the first-order part is restricted to a function-free language. The model is constructed in finite time, and non-ground clauses can be effectively evaluated with respect to the model. Furthermore, we prove that our model construction produces the least model.
Combining Finite Combination Properties: Finite Models and Busy Beavers
Authors: Toledo Guilherme V. , Zohar Yoni , Barrett Clark 
Published: September 2023

AbstractThis work is a part of an ongoing effort to understand the relationships between properties used in theory combination. We here focus on including two properties that are related to shiny theories: the finite model property and stable finiteness. For any combination of properties, we consider the question of whether there exists a theory that exhibits it. When there is, we provide an example with the simplest possible signature. One particular class of interest includes theories with the finite model property that are not finitely witnessable. To construct such theories, we utilize the Busy Beaver function.
Effect of simultaneous integrated boost concepts on photoneutron and distant out-of-field doses in VMAT for prostate cancer
Authors: Gauter-Fleckenstein Benjamin , Schönig Sebastian , Mertens Lena , Oppitz Hans , Siebenlist Kerstin , Ehmann Michael , Fleckenstein Jens 
Published: September 2023

Abstract
Background
A simultaneous integrated boost (SIB) may result in increased out-of-field (DOOF) and photoneutron (HPN) doses in volumetric modulated arc therapy (VMAT) for prostate cancer (PCA). This work therefore aimed to compare DOOF and HPN in flattened (FLAT) and flattening filter-free (FFF) 6‑MV and 10-MV VMAT treatment plans with and without SIB.

Methods
Eight groups of 30 VMAT plans for PCA with 6 MV or 10 MV, with or without FF and with uniform (2 Gy) or SIB target dose (2.5/3.0 Gy) prescriptions (CONV, SIB), were generated. All 240 plans were delivered on a slab-phantom and compared with respect to measured DOOF and HPN in 61.8 cm distance from the isocenter. The 6‑ and 10-MV flattened VMAT plans with conventional fractionation (6- and 10-MV FLAT CONV) served as standard reference groups. Doses were analyzed as a function of delivered monitor units (MU) and weighted equivalent square field size Aeq. Pearson’s correlation coefficients between the presented quantities were determined.

Results
The SIB plans resulted in decreased HPN over an entire prostate RT treatment course (10-MV SIB vs. CONV −38.2%). Omission of the flattening filter yielded less HPN (10-MV CONV −17.2%; 10-MV SIB −22.5%). The SIB decreased DOOF likewise by 39% for all given scenarios, while the FFF mode reduced DOOF on average by 60%. A strong Pearson correlation was found between MU and HPN (r > 0.9) as well as DOOF (0.7 < r < 0.9).

Conclusion
For a complete treatment, SIB reduces both photoneutron and OOF doses to almost the same extent as FFF deliveries. It is recommended to apply moderately hypofractionated 6‑MV SIB FFF-VMAT when considering photoneutron or OOF doses.
Neodymium isotope variations in the Flatreef on Macalacaskop, northern limb, Bushveld Complex
Authors: Keet J. J. , Roelofse F. , Gauert C. D. K. , Iaccheri L. M. , Grobler D. F. , Ueckermann H. 
Published: September 2023

AbstractThe origin of the recently discovered Flatreef remains debated due to the pronounced interaction of the magmatic rocks with sedimentary floor rocks, resulting in a complex intrusive stratigraphy. In this study, we report new Nd isotopic compositions of Flatreef lithologies intersected by borehole UMT-393 on the farm Macalacaskop in order to improve our understanding of the magmatic history of the deposit and to further test the putative correlation between the Flatreef/Platreef and the Upper Critical Zone of the remainder of the Bushveld Complex. The initial epsilon Nd (εNdi) values for the Flatreef range between −5.2 and −7.6, overlapping with εNdi values of the Upper Critical Zone from the eastern (ranging between − 4.8 and − 8.5) and the Upper Critical Zone and Main Zone from the western limb (−6.3 and −7.6, and −6.3 and −7.4 respectively) of the Bushveld Complex. The Flatreef εNdi values also overlap with those of the Platreef; however, due to the varying footwall lithologies of the Platreef along strike, Platreef rocks display a wider variation in isotopic composition. Our findings support the correlation of the Flatreef with the Upper Critical Zone — Main Zone transition interval in the remainder of the Bushveld Complex, which includes the Merensky and Bastard reefs. Due to significant overlap between the εNdi values of the Flatreef and local potential contaminants occurring at the base of the Northern Limb, we propose that the Sr–Nd isotopic composition of the magmas that gave rise to the Flatreef are most likely attributable to the interaction of mantle-derived magma with upper and lower crustal rocks of the Kaapvaal Craton within a sub-Bushveld staging chamber, with possible syn- to post-emplacement modification as a result of interaction with dolomitic footwall rocks.
3D Mirror Symmetry for Instanton Moduli Spaces
Authors: Koroteev Peter , Zeitlin Anton M. 
Published: September 2023

AbstractWe prove that the Hilbert scheme of k points on $${\mathbb {C}}^2$$

C

2

($$\hbox {Hilb}^k[{\mathbb {C}}^2]$$

Hilb
k

[

C

2

]

) is self-dual under three-dimensional mirror symmetry using methods of geometry and integrability. Namely, we demonstrate that the corresponding quantum equivariant K-theory is invariant upon interchanging its Kähler and equivariant parameters as well as inverting the weight of the $${\mathbb {C}}^\times _\hbar $$

C

ħ
×

-action. First, we find a two-parameter family $$X_{k,l}$$

X

k
,
l

of self-mirror quiver varieties of type A and study their quantum K-theory algebras. The desired quantum K-theory of $$\hbox {Hilb}^k[{\mathbb {C}}^2]$$

Hilb
k

[

C

2

]

is obtained via direct limit $$l\longrightarrow \infty $$

l
⟶
∞

and by imposing certain periodic boundary conditions on the quiver data. Throughout the proof, we employ the quantum/classical (q-Langlands) correspondence between XXZ Bethe Ansatz equations and spaces of twisted $$\hbar $$
ħ
-opers. In the end, we propose the 3d mirror dual for the moduli spaces of torsion-free rank-N sheaves on $${\mathbb {P}}^2$$

P

2

with the help of a different (three-parametric) family of type A quiver varieties with known mirror dual.
Discovering workflow nets of concurrent iterative processes
Authors: Tapia-Flores Tonatiuh , López-Mellado Ernesto 
Published: September 2023

AbstractA novel and efficient method for discovering concurrent workflow processes is presented. It allows building a suitable workflow net (WFN) from a large event log$$\lambda $$λ, which represents the behaviour of complex iterative processes involving concurrency. First, thet-invariants are determined from$$\lambda $$λ; this allows computing the causal and concurrent relations between the events and the implicit causal relations between events that do not appear consecutively in$$\lambda $$λ. Then a 1-bounded WFN is built, which could be eventually adjusted if itst-invariants do not match with those computed from$$\lambda $$λ. The discovered model allows firing all the traces in$$\lambda $$λ. The procedures derived from the method are polynomial time on$$|\lambda |$$|λ|; they have been implemented and tested on artificial logs.
Applying the Hybrid Concept as a Bridge to Transplantation in Infants Without Hypoplastic Left Heart Syndrome
Authors: Frandsen Erik L. , Schauer Jenna S. , Morray Brian H. , Mauchley David C. , McMullan David M. , Friedland-Little Joshua M. , Kemna Mariska S. 
Published: September 2023

AbstractTherapies to support small infants in decompensated heart failure that are failing medical management are limited. We have used the hybrid approach, classically reserved for high-risk infants with single ventricle physiology, in patients with biventricular physiology with left ventricular failure. This approach secures systemic circulation, relieves left atrial hypertension, protects the pulmonary vasculature, and allows the right ventricle to support cardiac output. This approach can be used as a bridge to transplantation in select individuals. Infants without single ventricle congenital heart disease who were treated with the hybrid approach between 2008 and 2021 were included in analysis. Eight patients were identified. At the time of hybrid procedure, the median weight was 3.2 kg (range 2.4–3.6 kg) and the median age was 18 days (range 1–153 days). Seventy five percent were mechanically ventilated and 88% were on inotropic support. The median duration from hybrid procedure to transplant was 63 days (range 4–116 days). All patients experienced a good outcome (delisted for improvement or transplanted). The hybrid procedure is an appropriate therapeutic bridge to transplantation in a carefully selected subset of critically ill infants without single ventricle congenital heart disease in whom alternate therapies may confer increased risk for morbidity and mortality.
Moderne Hornhautdiagnostik als Schlüssel für die korrekte Einordnung der Erkrankung und optimale Therapieentscheidung
Authors: Berger Tim , Flockerzi Elias , Daas Loay , Hamon Loïc , Khattabi Zaynab , Berger Maximilian , Seitz Berthold 
Published: September 2023

ZusammenfassungHornhauterkrankungen umfassen ein breites Spektrum unterschiedlicher Erscheinungsformen (entzündlich/nichtentzündlich), die für eine präzise Diagnose und gezielte Behandlung genau klassifiziert werden müssen. Neben der Anamnese und der Spaltlampenbiomikroskopie können zur Eingrenzung der Diagnose weitere gerätegestützte Untersuchungen durchgeführt werden. Die moderne Hornhautbildgebung bietet heute eine Vielzahl von Technologien wie Topographie, Tomographie, In-vivo-Konfokalmikroskopie und die Analyse der Biomechanik, mit denen sich verschiedene Pathologien zuverlässig klassifizieren lassen. Darüber hinaus hilft die Kenntnis der verfügbaren Untersuchungsmodalitäten bei differenzialdiagnostischen Überlegungen und erleichtert die Indikationsstellung für einen stadiengerechten mikrochirurgischen Eingriff.