HelloWorld! An Instructive Case for the Transformation Tool Contest

This case comprises several primitive tasks that can be solved straight away with most transformation tools. The aim is to cover the most important kinds of primitive operations on models, i.e. create, read, update and delete (CRUD). To this end, tasks such as a constant transformation, a model-to-text transformation, a very basic migration transformation or diverse simple queries or in-place operations on graphs have to be solved. The motivation for this case is that the results expectedly will be very instructive for beginners. Also, it is really hard to compare transformation languages along complex cases, because the complexity of the respective case might hide the basic language concepts and constructs.Comment: In Proceedings TTC 2011, arXiv:1111.440

Saying Hello World with GReTL - A Solution to the TTC 2011 Instructive Case

This paper discusses the GReTL solution of the TTC 2011 Hello World case. The submitted solution covers all tasks including the optional ones.Comment: In Proceedings TTC 2011, arXiv:1111.440

Saying Hello World with GROOVE - A Solution to the TTC 2011 Instructive Case

This report presents a solution to the Hello World case study of TTC 2011 using GROOVE. We provide and explain the grammar that we used to solve the case study. Every requested question of the case study was solved by a single rule application.Comment: In Proceedings TTC 2011, arXiv:1111.440

Effects of Parkinson’s disease on motor asymmetry

Introduction: Persons with Parkinson’s disease (PD) experience changes cortically, subcortically and behaviorally. This dissertation examines the asymmetry of motor behavior to explore the role of asymmetry in persons with PD and its connection to clinical symptoms. Purpose: Project 1: To assess the hand asymmetry difference in young adults versus older adults. Project 2: To investigate the difference in hand asymmetry in older adults and persons with PD. Project 3: To explore the correlation between function and clinical symptoms of persons with PD. Methods: 55 right-handed participants [Young Adults (YA) = 20, Female = 10; Older Adults (OA) = 20, Female = 10; Persons with PD = 15, Female = 5] were recruited and performed motor tasks: Purdue Pegboard test, grip strength test, response task, thumb opposition task, tapping task, three variations of timed-up-and-go test (TUG), single leg stance task (SLS), Weight Distribution test and Limits of Stability test. The two-way ANOVA was conducted to examine a variance between YA and OA. A separate two-way ANOVA was conducted comparing variance between OA and persons with PD. The purpose was to explore asymmetries, characterized by a significant difference between groups’ left and right sides. Pearson’s correlation was implemented to examine connection of clinical symptoms and motor behavior. Statistics: IBM SPSS 24 software was used. Two 2-way ANOVAs with the between group factor of group (Young vs. Older in Project 1; Older vs. PD in project 2), and within group factor of hand (Right vs. Left in Study 1 & Study 2) were used to examine if age (or PD) changes hand asymmetry. Pearson’s correlation coefficient was used to determine correlations between Unified Parkinson’s Disease Rating Scale (UPDRS) and motor tasks in PD patients (Study 3). Results: Project 1: Results indicate asymmetry reduces with age in fine motor tasks containing speed, dexterity and strength components. Project 2: The basal ganglia dysfunction does not overall further exacerbate the reduced asymmetry with age. Project 3: Clinical symptoms of PD measured by the UPDRS are generally not associated with fine motor tasks of this study

Solving the TTC 2011 Compiler Optimization Task with metatools

The authors' "metatools" are a collection of tools for generic programming. This includes generating Java sources from mathematically well-founded specifications, as well as the creation of strictly typed document object models for XML encoded texts. In this context, almost every computer-internal structure is treated as a "model", and every computation is a kind of model transformation. This concept differs significantly from "classical model transformation" executed by specialized tools and languages. Therefore it seemed promising to the organizers of the TTC 2011, as well as to the authors, to apply metatools to one of the challenges, namely to the "compiler optimization task". This is a report on the resulting experiences.Comment: In Proceedings TTC 2011, arXiv:1111.440

Wireless Power Transmission for Power Supply: State of Art

The wireless power supply is motivated by simple and comfortable use of many small electric appliances with low power input. This paper reviews the concepts which are suitable for wireless power transmission with respect to power supply of such appliances in small areas. The categorization of the concepts is made. The efficiency of the concepts is discussed on general base. The reference levels for exposure to electric and magnetic fields are mentioned, and maximal power delivered to an appliance by fulfillment of these levels is considered

Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators

Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domain of string languages so-called parser combinators are very popular for writing efficient parsers. Inspired by this approach, we have proposed graph parser combinators in a recent paper, a framework for the rapid development of special-purpose graph parsers. Our basic idea has been to define primitive graph parsers for elementary graph components and a set of combinators for the flexible construction of more advanced graph parsers. Following this approach, a declarative, but also more operational description of a graph language can be given that is a parser at the same time. In this paper we address the question how the process of writing correct parsers on top of our framework can be simplified by demonstrating the translation of hyperedge replacement grammars into graph parsers. The result are recursive descent parsers as known from string parsing with some additional nondeterminism

Generating Correctness-Preserving Editing Operations for Diagram Editors

In previous work it has already been shown that syntax-directed and free-hand editing can be gainfully integrated into a single diagram editor. That way, the user can arrange diagram components on the screen without any restrictions in free-hand editing mode, whereas syntax-directed editing operations provide powerful assistance. So far, editing operations had to be specified or programmed by the editor developer. In contrast, this paper proposes an approach where diagram-specific editing operations are generated on the fly during the editing process and without any additional specification effort. These operations provably preserve the correctness of the diagram. The proposed approach requires a specification of the visual language by a hypergraph grammar