908 research outputs found
Taylor University Catalog 2023-2024
The 2023-2024 academic catalog of Taylor University in Upland, Indiana.https://pillars.taylor.edu/catalogs/1128/thumbnail.jp
Measuring the impact of COVID-19 on hospital care pathways
Care pathways in hospitals around the world reported significant disruption during the recent COVID-19 pandemic but measuring the actual impact is more problematic. Process mining can be useful for hospital management to measure the conformance of real-life care to what might be considered normal operations. In this study, we aim to demonstrate that process mining can be used to investigate process changes associated with complex disruptive events. We studied perturbations to accident and emergency (A &E) and maternity pathways in a UK public hospital during the COVID-19 pandemic. Co-incidentally the hospital had implemented a Command Centre approach for patient-flow management affording an opportunity to study both the planned improvement and the disruption due to the pandemic. Our study proposes and demonstrates a method for measuring and investigating the impact of such planned and unplanned disruptions affecting hospital care pathways. We found that during the pandemic, both A &E and maternity pathways had measurable reductions in the mean length of stay and a measurable drop in the percentage of pathways conforming to normative models. There were no distinctive patterns of monthly mean values of length of stay nor conformance throughout the phases of the installation of the hospital’s new Command Centre approach. Due to a deficit in the available A &E data, the findings for A &E pathways could not be interpreted
Musiktheorie als interdisziplinäres Fach: 8. Kongress der Gesellschaft für Musiktheorie Graz 2008
Im Oktober 2008 fand an der Universität für Musik und darstellende Kunst Graz (KUG) der 8. Kongress der Gesellschaft für Musiktheorie (GMTH) zum Thema »Musiktheorie als interdisziplinäres Fach« statt. Die hier vorgelegten gesammelten Beiträge akzentuieren Musiktheorie als multiperspektivische wissenschaftliche Disziplin in den Spannungsfeldern Theorie/Praxis, Kunst/Wissenschaft und Historik/Systematik. Die sechs Kapitel ergründen dabei die Grenzbereiche zur Musikgeschichte, Musikästhetik, zur Praxis musikalischer Interpretation, zur kompositorischen Praxis im 20. und 21. Jahrhundert, zur Ethnomusikologie sowie zur Systematischen Musikwissenschaft. Insgesamt 45 Aufsätze, davon 28 in deutscher, 17 in englischer Sprache, sowie die Dokumentation einer Podiumsdiskussion zeichnen in ihrer Gesamtheit einen höchst lebendigen und gegenwartsbezogenen Diskurs, der eine einzigartige Standortbestimmung des Fachs Musiktheorie bietet.The 8th congress of the Gesellschaft für Musiktheorie (GMTH) took place in October 2008 at the University for Music and Dramatic Arts Graz (KUG) on the topic »Music Theory and Interdisciplinarity«. The collected contributions characterize music theory as a multi-faceted scholarly discipline at the intersection of theory/practice, art/science and history/system. The six chapters explore commonalties with music history, music aesthetics, musical performance, compositional practice in twentieth- and twenty-first-century music, ethnomusicology and systematic musicology. A total of 45 essays (28 in German, 17 in English) and the documentation of a panel discussion form a vital discourse informed by contemporaneous issues of research in a broad number of fields, providing a unique overview of music theory today. A comprehensive English summary appears at the beginning of all contributions
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Incremental Model Transformations with Triple Graph Grammars for Multi-version Models
Like conventional software projects, projects in model-driven software
engineering require adequate management of multiple versions of development
artifacts, importantly allowing living with temporary inconsistencies. In
previous work, multi-version models for model-driven software engineering have
been introduced, which allow checking well-formedness and finding merge
conflicts for multiple versions of a model at once. However, also for
multi-version models, situations where different artifacts, that is, different
models, are linked via automatic model transformations have to be handled.
In this paper, we propose a technique for jointly handling the transformation
of multiple versions of a source model into corresponding versions of a target
model, which enables the use of a more compact representation that may afford
improved execution time of both the transformation and further analysis
operations. Our approach is based on the well-known formalism of triple graph
grammars and the aforementioned encoding of model version histories called
multi-version models. In addition to batch transformation of an entire model
version history, the technique also covers incremental synchronization of
changes in the framework of multi-version models.
We show the correctness of our approach with respect to the standard
semantics of triple graph grammars and conduct an empirical evaluation to
investigate the performance of our technique regarding execution time and
memory consumption. Our results indicate that the proposed technique affords
lower memory consumption and may improve execution time for batch
transformation of large version histories, but can also come with computational
overhead in unfavorable cases.Comment: arXiv admin note: substantial text overlap with arXiv:2301.0062
A unifying mathematical definition enables the theoretical study of the algorithmic class of particle methods.
Mathematical definitions provide a precise, unambiguous way to formulate concepts. They also provide a common language between disciplines. Thus, they are the basis for a well-founded scientific discussion. In addition, mathematical definitions allow for deeper insights into the defined subject based on mathematical theorems that are incontrovertible under the given definition. Besides their value in mathematics, mathematical definitions are indispensable in other sciences like physics, chemistry, and computer science. In computer science, they help to derive the expected behavior of a computer program and provide guidance for the design and testing of software. Therefore, mathematical definitions can be used to design and implement advanced algorithms.
One class of widely used algorithms in computer science is the class of particle-based algorithms, also known as particle methods. Particle methods can solve complex problems in various fields, such as fluid dynamics, plasma physics, or granular flows, using diverse simulation methods, including Discrete Element Methods (DEM), Molecular Dynamics (MD), Reproducing Kernel Particle Methods (RKPM), Particle Strength Exchange (PSE), and Smoothed Particle Hydrodynamics (SPH). Despite the increasing use of particle methods driven by improved computing performance, the relation between these algorithms remains formally unclear. In particular, particle methods lack a unifying mathematical definition and precisely defined terminology. This prevents the determination of whether an algorithm belongs to the class and what distinguishes the class.
Here we present a rigorous mathematical definition for determining particle methods and demonstrate its importance by applying it to several canonical algorithms and those not previously recognized as particle methods. Furthermore, we base proofs of theorems about parallelizability and computational power on it and use it to develop scientific computing software.
Our definition unified, for the first time, the so far loosely connected notion of particle methods. Thus, it marks the necessary starting point for a broad range of joint formal investigations and applications across fields.:1 Introduction
1.1 The Role of Mathematical Definitions
1.2 Particle Methods
1.3 Scope and Contributions of this Thesis
2 Terminology and Notation
3 A Formal Definition of Particle Methods
3.1 Introduction
3.2 Definition of Particle Methods
3.2.1 Particle Method Algorithm
3.2.2 Particle Method Instance
3.2.3 Particle State Transition Function
3.3 Explanation of the Definition of Particle Methods
3.3.1 Illustrative Example
3.3.2 Explanation of the Particle Method Algorithm
3.3.3 Explanation of the Particle Method Instance
3.3.4 Explanation of the State Transition Function
3.4 Conclusion
4 Algorithms as Particle Methods
4.1 Introduction
4.2 Perfectly Elastic Collision in Arbitrary Dimensions
4.3 Particle Strength Exchange
4.4 Smoothed Particle Hydrodynamics
4.5 Lennard-Jones Molecular Dynamics
4.6 Triangulation refinement
4.7 Conway's Game of Life
4.8 Gaussian Elimination
4.9 Conclusion
5 Parallelizability of Particle Methods
5.1 Introduction
5.2 Particle Methods on Shared Memory Systems
5.2.1 Parallelization Scheme
5.2.2 Lemmata
5.2.3 Parallelizability
5.2.4 Time Complexity
5.2.5 Application
5.3 Particle Methods on Distributed Memory Systems
5.3.1 Parallelization Scheme
5.3.2 Lemmata
5.3.3 Parallelizability
5.3.4 Bounds on Time Complexity and Parallel Scalability
5.4 Conclusion
6 Turing Powerfulness and Halting Decidability
6.1 Introduction
6.2 Turing Machine
6.3 Turing Powerfulness of Particle Methods Under a First Set of Constraints
6.4 Turing Powerfulness of Particle Methods Under a Second Set of Constraints
6.5 Halting Decidability of Particle Methods
6.6 Conclusion
7 Particle Methods as a Basis for Scientific Software Engineering
7.1 Introduction
7.2 Design of the Prototype
7.3 Applications, Comparisons, Convergence Study, and Run-time Evaluations
7.4 Conclusion
8 Results, Discussion, Outlook, and Conclusion
8.1 Problem
8.2 Results
8.3 Discussion
8.4 Outlook
8.5 Conclusio
Lessons from Formally Verified Deployed Software Systems (Extended version)
The technology of formal software verification has made spectacular advances,
but how much does it actually benefit the development of practical software?
Considerable disagreement remains about the practicality of building systems
with mechanically-checked proofs of correctness. Is this prospect confined to a
few expensive, life-critical projects, or can the idea be applied to a wide
segment of the software industry?
To help answer this question, the present survey examines a range of
projects, in various application areas, that have produced formally verified
systems and deployed them for actual use. It considers the technologies used,
the form of verification applied, the results obtained, and the lessons that
can be drawn for the software industry at large and its ability to benefit from
formal verification techniques and tools.
Note: a short version of this paper is also available, covering in detail
only a subset of the considered systems. The present version is intended for
full reference.Comment: arXiv admin note: text overlap with arXiv:1211.6186 by other author
2022-2023 Xavier University Undergraduate and Graduate University Catalog
https://www.exhibit.xavier.edu/coursecatalog/1275/thumbnail.jp
- …