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

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

Multi-Amalgamation in M-Adhesive Categories : Long Version

Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalization of the operational semantics of statecharts and other visual modeling languages, where typed attributed graphs are used for multiple rules with general application conditions. However, the theory of amalgamation for the double pushout approach has been developed up to now only on a set-theoretical basis for pairs of standard graph rules without any application conditions. For this reason, we present the theory of amalgamation in this paper in the framework of M-adhesive categories, short for weak adhesive HLR categories, for a bundle of rules with (nested) application conditions. The main result is the Multi-Amalgamation Theorem, which generalizes the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronized parallelism. The constructions are illustrated by a small running example. A more complex case study for the operational semantics of statecharts based on multi-amalgamation is presented in a separate paper

Duck, Duck, Bilski: Searching for a Law-Progress Equipoise

Moore\u27s Law generally asserts that the transistor capacity on a computer processing unit increases exponentially over time. To exemplify, in 1971, Intel\u27s first microprocessor contained 2,300 transistors and was used in simple electronic pocket calculators and by 2007 Intel was manufacturing microprocessors containing 820,000,000 transistors used in personal computers capable of near-instantaneous worldwide communication over the Internet. When the framers of the Constitution drafted the empowering words, “To promote the Progress of Science and useful Arts,” could they foresee such a blistering pace of innovation? Have courts been able to maintain the balance between progress and limited monopolies? The history supporting modern principles aimed at spurring useful inventions is discussed in Part II of this note. Then, in Parts III and IV, the facts surrounding a business method patent are described and a decision from the United States Court of Appeals for the Federal Circuit confronting fundamental questions pertinent to the successful maintenance of the United States patent system is explained. Next, the impact of that decision is analyzed in Part V. Lastly, the conclusion is set out in Part VI

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

On Some Turkish Auxiliary Verbs In Giovanni Molino’s Dittionario Della Lingua Italiana, Turchesca (1641)

Türkçe bazı fiillerin temel fonksiyonlarının yanı sıra isim kalıplarıyla birleşik fiiller oluşturan yardımcı bir görevi de vardır. Bu görev sadece modern Türkçede değil aynı zamanda Osmanlı Türkçesinde de bilinmektedir. Bu makalenin amacı etmek, olmak, eylemek, kılmak fiillerinin bu görevdeki kullanımlarına örnek göstermektir. Giovanni Molino’nun 17. yy İtalyanca-Türkçe Sözlük’ünden alınan sözcük örnekleri incelemenin temelini oluşturmaktadır. Örnekleri incelediğimizde, Osmanlı Türkçesinde bilhassa etmek fiilinin, nispeten daha az da olmak fiilinin birleşik fiillerin oluşumu sürecinde sıklıkla yer aldığını, bununla birlikte eylemek ve kılmak fiillerinin nadiren bu fonksiyonu yerine getirdiğini belirtebiliriz. Aslında, etmek ve olmak fiillerinin modern Türkçede hâlâ bu fonksiyonu yerine getirdiği; ancak bunun Osmanlı Türkçesinde aynı ölçüde olmadığı gözlemlenebilir.Some Turkish verbs, besides their basic function, have an auxiliary function, forming compound verbs with nominal forms. This function is known not only in modern Turkish but also in Ottoman-Turkish. The purpose of this paper is to present the verbs etmek, olmak, eylemek, kılmak as examples of this function. The lexical material excerpted from Giovanni Molino’s seventeenth-century Italian- Turkish Dictionary constitutes the basis for the analysis. When analysing the material we can ascertain that in Ottoman-Turkish the verb etmek especially was frequently involved in the process of forming compound verbs, olmak rather less so, with eylemek and kılmak rarely performing this function. Indeed, the verbs etmek and olmak can still be observed to perform this function in modern Turkish, however, not on the same scale as in Ottoman-Turkish

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