Rebecca Rasmussen (22086324), Katherine B. Gibney (10276976), Timothy P. Stinear (143097) et al. · Figshare · 2025
Compartment model diagram depicting the frequency of compartments in reviewed models and transition/transmission pathways. Compartments are susceptible (<i>S</i>), exposed (<i>E</i>), infectious (<i>I</i>), treated (<i>T</i>) and removed (<i>R</i>) with subscripts <i>H</i> for humans, <i>R</i> for reservoirs, <i>V</i> for vectors and compartment <i>U</i> for environmental <i>M. ulcerans</i>. <i>S</i><sub><i>Low</i></sub> and <i>S</i><sub><i>High</i></sub> represent susceptible individuals at low and high risk, respectively. <i>I</i><sub><i>S</i></sub> and <i>I</i><sub><i>NS</i></sub> represent infectious individuals seeking treatment or not seeking treatment. <i>R</i><sub><i>Dis</i></sub> represents individuals who acquire a disability as a result of having Buruli ulcer. <i>U</i><sub><i>R</i></sub> and represent reservoir and vector associated bacteria. Compartment box sizes represent the relative frequency of these compartments in the reviewed models. Black arrows indicate transitions of individuals between compartments, red dashed arrows represent <i>M. ulcerans</i> transmission routes and green arrows represent shedding of <i>M. ulcerans</i> from infectious compartments into the environment. Thickness of the arrows represent the relative frequency of pathways in the reviewed models. To see the IDs for the models (listed in <a href="http://www.plosntds.org/article/info:doi/10.1371/journal.pntd.0013376#pntd.0013376.t001" target="_blank">Table 1</a>) containing each pathway and compartment, see <a href="http://www.plosntds.org/article/info:doi/10.1371/journal.pntd.0013376#pntd.0013376.s003" target="_blank">S3 Appendix</a>.
Cited by 0Open access
2019
This chapter builds on open model compilation presented in the last chapter, discussing topics such as: optimizing application code; building a new open model compiler on an existing rule interpreter; generating output other than application source code; building a new production rule interpreter; and weaknesses in UML semantics. One alternate use of an open model compiler is as a document production facility to publish formal, formatted specification documentation. Simply, define production rules that output model content interspersed with appropriate formatting directives (e.g., HTML or other formatting tags). Another non-code use of an open model compiler can be to mechanically translate a semantic model into natural language. Open model compilation may even set a path for job specialization in future software organizations: those who know semantic modeling; those who know platform independent model overlay language(s); and those who know model compilers.
Cited by 0
Steven Smyth · 2021
There is a growing tendency for using domain-specific languages, which help domain experts to stay focussed on abstract problem solutions. It is important to carefully design these languages and tools, which fundamentally perform model-to-model transformations. The quality of both usually decides the effectiveness of the subsequent development and therefore the quality of the final applications. However, as the complexity and safety requirements of modern systems grow, it becomes increasingly burdensome to create highly customized languages and difficult to provide reasonable overviews within these tools. This thesis introduces a new interactive model-based compilation methodology. Compilations for arbitrary model-to-model transformations are themselves described as models. They can be instantiated for particular inputs, e. g. a program, to create concrete compilation runs, which return the result of that compilation. The compilation instance is interactively observable. Intermediate results serve as new inputs and as documentation. They can be used to create highly customized views and facilitate understandability. This methodology guides modellers from the start of the compilation to the final result so that they can interactively refine their models. The methodology has been implemented and validated as the KIELER Compiler (KiCo) and is available as part of the KIELER open-source project. It is used to implement the current reference compiler for the SCCharts language, a statecharts dialect designed for specifying safety-critical reactive systems based on a synchronous model of computation. The interactive model-based compilation approach was key to the rapid prototyping of three different compilation strategies, as well as new language extensions, variations and closely related languages. The results are verified with benchmarks, which are again modelled using the same approach and technology. The usability of the SCCharts language and the KiCo tooling is documented with long-term surveys and real-life industrial, academic and teaching examples.
Cited by 1Open access
Heribert Schütz, Tim Geisler · Lecture notes in computer science · 1996
Cited by 10
Литвиненко, Д., Доценко, О., Стельмах, Н. et al. · ELARTU (Ternopil National Technical University) · 2018
Cited by 0
Heribert Schütz, Tim Geisler · Information and Computation · 2000
Cited by 6
Thomas, Samuel · theses.fr (ABES) · 2016
Le comptage de modèles (i.e., des affectations de valeurs aux variables qui satisfont toutes les contraintes) constitue un traitement clé pour divers problèmes d'intelligence artificielle dans lesquels la programmation par contraintes est employée. La compilation de connaissances est l'une des approches possibles permettant de réaliser efficacement une telle requête de comptage. Dans cette thèse, nous introduisons plusieurs nouveaux langages de compilation de formules propositionnelles, basés sur un connecteur peu utilisé jusqu'ici dans les langages cibles pour la compilation, le ou exclusif. Nous définissons en particulier le langage des arbres de décision affine (ADT) et le langage des arbres de décisions affine étendus (EADT). Nous proposons également un compilateur CNF vers EADT que nous avons évalué et nous présentons les résultats expérimentaux obtenus. Ces résultats montrent qu'une approche basée sur le langage EADT concurrence, et est parfois même plus performante, que des algorithmes directs (sans compilation) de l'état de l'art pour le comptage de modèles. Nous nous sommes également intéressés à la compilation de réseaux de contraintes. En effet, il existe jusqu'ici peu de méthodes permettant de compter le nombre de modèles d'un réseau de contraintes. Nous avons introduit et étudié le langage cible des graphes de décision décomposables multivalués (MDDG). Nous avons développé un compilateur de réseaux de contraintes vers MDDG dans lequel plusieurs ingrédients originaux ont été testés, comme l'utilisation d'une heuristique de choix de variables basée sur la centralité d'intermédiarité ou encore la détection et la prise en compte des contraintes universelles.
Cited by 0Open access
Richard M. Keller, Catherine Baudin, Yumi Iwasaki et al. · NASA Technical Reports Server (NASA)
An approach is introduced to automated model derivation for knowledge based systems. The approach, model compilation, involves procedurally generating the set of domain models used by a knowledge based system. With an implemented example, how this approach can be used to derive models of different precision and abstraction is illustrated, and models are tailored to different tasks, from a given set of base domain models. In particular, two implemented model compilers are described, each of which takes as input a base model that describes the structure and behavior of a simple electromechanical device, the Reaction Wheel Assembly of NASA's Hubble Space Telescope. The compilers transform this relatively general base model into simple task specific models for troubleshooting and redesign, respectively, by applying a sequence of model transformations. Each transformation in this sequence produces an increasingly more specialized model. The compilation approach lessens the burden of updating and maintaining consistency among models by enabling their automatic regeneration.
Cited by 4Open access
Zhanxiang Chai, Jennifer M. Wu, Guoyong Cai · 2002
The authors explain their knowledge compilation model and discuss its implementation. The most important issues are examined. Despite the immaturity of the model, knowledge compilation has proven to be a useful tool. Research into the model continues.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 1
T.L. McCluskey, Julie Porteous · University of Huddersfield Repository (University of Huddersfield) · 1996
Cited by 6
Gregory M. Provan · 2008
The use of embedded technology has become widespread. Many complex engineered systems comprise embedded fea-tures to perform self-diagnosis or self-reconfiguration. These features require fast response times in order to be useful in domains where embedded systems are typically deployed. Researchers often advocate the use of compilation-based ap-proaches to store the set of environments (resp. solutions) to a diagnosis (resp. reconfiguration) problem, in some compact representation. However, the size of a compiled representa-tion may be exponential in the treewidth of the problem. In this paper we propose a novel method for compiling the most preferred environments in order to reduce the large space re-quirements of our compiled representation. We show that ap-proximate compilation is an effective means of generating the highest-valued environments, while obtaining a representa-tion whose size can be tailored to any embedded application. The method also provides a graceful way to tradeoff space requirements with the completeness of our coverage of the environment space.
Cited by 0
Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 2013
A new inter-component compilation model for nesC by Yu Chenkan thesis 2013 viii, 50 pages : illustrations ; 30 cm To balance the bias against flexibility in trade for efficiency from the initial design principles of TinyOS as well as…Read more ›
Cited by 0
S. Schulz, J. W. Rozenblit · 2008
The model-based design process has established itself in the domain of hardware/software codesign. It has been applied to many complex embedded systems. Nevertheless we still observe a discontinuity in the design process when the system model evolves into its eventual implementation. We present here the concepts for a model compiler which addresses this model continuity problem. In addition, a candidate tool is evaluated for our proposed design approach. 1
Cited by 0
C. M. Perey, F.G. Perey · Atomic Data and Nuclear Data Tables · 1972
Cited by 88
Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2013
International audience
Cited by 21
Ali Raza (3558965), Hafeez Ur Rehman Siddiqui (14093892), Kashif Munir (6182237) et al. · Figshare · 2022
Cited by 0Open access
F. Koriche, et al. · 2013
Counting the models of a propositional formula is a key issue for a number of AI problems, but few propositional languages offer the possibility to count models efficiently. In order to fill the gap, we introduce the language EADT of (extended) affine decision trees. An extended affine decision tree simply is a tree with affine decision nodes and some specific decomposable conjunction or disjunction nodes. Unlike standard decision trees, the decision nodes of an EADT formula are not labeled by variables but by affine clauses. We study EADT, and several subsets of it along the lines of the knowledge compilation map. We also describe a CNF-to-EADT compiler and present some experimental results. Those results show that the EADT compilation-based approach is competitive with (and in some cases is able to outperform) the model counter Cachet and the d-DNNF compilationbased approach to model counting.
Cited by 0
Karl Lermer, Colin Fidge · Theoretical Computer Science · 2002
Cited by 9
Decision Support Systems · 1987
Cited by 0
Éric Piel, Philippe Marquet, Jean‐Luc Dekeyser · Dialnet (Universidad de la Rioja) · 2007
Cited by 0