Spacecraft software training needs assessment research

The problems were identified, along with their causes and potential solutions, that the management analysts were encountering in performing their jobs. It was concluded that sophisticated training applications would provide the most effective solution to a substantial portion of the analysts' problems. The remainder could be alleviated through the introduction of tools that could help make retrieval of the needed information from the vast and complex information resources feasible

Statistische Abfragen mit Alma für die Fachreferatsarbeit

Nach der Einführung des cloudbasierten Bibliotheksmanagementsystems Alma an der Universitätsbibliothek der Technischen Universität Berlin mussten die statistische Abfragen im System neu implementiert werden. Dieser Beitrag fokussiert auf die Umsetzung der Wünsche der Fachreferentinnen und Fachreferenten, deren Bedarfe an Ausleih- und Bestandsabfragen durch Experteninterviews evaluiert wurden. Eine Priorisierung der gewünschten Ergebnisse führte zur Auswahl von sechs unterschiedlichen Arten von Abfragen, die anschließend implementiert wurden. Bei der Umsetzung wurden die Möglichkeiten der Business-Intelligence-Umgebung Alma Analytics genutzt. Mit einigen Einschränkungen konnten alle sechs Abfragearten realisiert werden. Die analysierten Daten beschränken sich dabei auf interne Daten aus dem Bibliotheksmanagementsystem Alma.After launching the cloud-based library management system Alma at the university library of the Technische Universität Berlin, all statistical queries had to be reimplemented. This article explains how the requests of the subject librarians were realized after determining their requirements with the help of expert interviews. The ascertained requirements were prioritized and six types of queries were chosen for implementation. For this, the functionalities provided by the Business Intelligence Environment Alma Analytics were used. With few limitations all six query types have been implemented. It should be noted that the data analyzed is confined to internal system data from the library management system Alma

Spacecraft software training needs assessment research, appendices

The appendices to the previously reported study are presented: statistical data from task rating worksheets; SSD references; survey forms; fourth generation language, a powerful, long-term solution to maintenance cost; task list; methodology; SwRI's instructional systems development model; relevant research; and references

Checking bisimilarity for attributed graph transformation

Borrowed context graph transformation is a technique developed by Ehrig and Koenig to define bisimilarity congruences from reduction semantics defined by graph transformation. This means that, for instance, this technique can be used for defining bisimilarity congruences for process calculi whose operational semantics can be defined by graph transformation. Moreover, given a set of graph transformation rules, the technique can be used for checking bisimilarity of two given graphs. Unfortunately, we can not use this ideas to check if attributed graphs are bisimilar, i.e. graphs whose nodes or edges are labelled with values from some given data algebra and where graph transformation involves computation on that algebra. The problem is that, in the case of attributed graphs, borrowed context transformation may be infinitely branching. In this paper, based on borrowed context transformation of what we call symbolic graphs, we present a sound and relatively complete inference system for checking bisimilarity of attributed graphs. In particular, this means that, if using our inference system we are able to prove that two graphs are bisimilar then they are indeed bisimilar. Conversely, two graphs are not bisimilar if and only if we can find a proof saying so, provided that we are able to prove some formulas over the given data algebra. Moreover, since the proof system is complex to use, we also present a tableau method based on the inference system that is also sound and relatively complete.Postprint (published version

Multi-amalgamation of rules with application conditions in M-adhesive categories

Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.Amalgamation is a well-known concept for graph transformations that is used to model synchronised parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalisation of the operational semantics of statecharts and other visual modelling languages, where typed attributed graphs are used for multiple rules with nested application conditions. However, the theory of amalgamation for the double-pushout approach has so far only been developed on a set-theoretical basis for pairs of standard graph rules without any application conditions. For this reason, in the current paper we present the theory of amalgamation for M-adhesive categories, which form a slightly more general framework than (weak) adhesive HLR categories, for a bundle of rules with (nested) application conditions. The two main results are the Complement Rule Theorem, which shows how to construct a minimal complement rule for each subrule, and the Multi-Amalgamation Theorem, which generalises the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronised parallelism. In order to apply the largest amalgamated rule, we use maximal matchings, which are computed according to the actual instance graph. The constructions are illustrated by a small but meaningful running example, while a more complex case study concerning the firing semantics of Petri nets is presented as an introductory example and to provide motivation

Multi-amalgamation of rules with application conditions in M-adhesive categories

Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.Amalgamation is a well-known concept for graph transformations that is used to model synchronised parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalisation of the operational semantics of statecharts and other visual modelling languages, where typed attributed graphs are used for multiple rules with nested application conditions. However, the theory of amalgamation for the double-pushout approach has so far only been developed on a set-theoretical basis for pairs of standard graph rules without any application conditions. For this reason, in the current paper we present the theory of amalgamation for M-adhesive categories, which form a slightly more general framework than (weak) adhesive HLR categories, for a bundle of rules with (nested) application conditions. The two main results are the Complement Rule Theorem, which shows how to construct a minimal complement rule for each subrule, and the Multi-Amalgamation Theorem, which generalises the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronised parallelism. In order to apply the largest amalgamated rule, we use maximal matchings, which are computed according to the actual instance graph. The constructions are illustrated by a small but meaningful running example, while a more complex case study concerning the firing semantics of Petri nets is presented as an introductory example and to provide motivation

M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation

Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church–Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework of M-adhesive categories, where M-adhesive categories are slightly more general than weak adhesive high-level replacement categories. Most of the proofs are based on the corresponding statements for rules without application conditions and two shift lemmas stating that nested application conditions can be shifted over morphisms and rules

Finitary M-adhesive categories

Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.Finitary M-adhesive categories are M-adhesive categories with finite objects only, where M-adhesive categories are a slight generalisation of weak adhesive high-level replacement (HLR) categories. We say an object is finite if it has a finite number of M-subobjects. In this paper, we show that in finitary M-adhesive categories we not only have all the well-known HLR properties of weak adhesive HLR categories, which are already valid for M-adhesive categories, but also all the additional HLR requirements needed to prove classical results including the Local Church-Rosser, Parallelism, Concurrency, Embedding, Extension and Local Confluence Theorems, where the last of these is based on critical pairs. More precisely, we are able to show that finitary M-adhesive categories have a unique ε'-M factorisation and initial pushouts, and the existence of an M-initial object implies we also have finite coproducts and a unique ε' -M pair factorisation. Moreover, we can show that the finitary restriction of each M-adhesive category is a finitary M-adhesive category, and finitarity is preserved under functor and comma category constructions based on M-adhesive categories. This means that all the classical results are also valid for corresponding finitary M-adhesive transformation systems including several kinds of finitary graph and Petri net transformation systems. Finally, we discuss how some of the results can be extended to non-M-adhesive categories