Medžių tipo duomenų struktūras transformuojantys įrankiai naudojami išspręsti gausybę įvairaus tipo problemų: kompiliatorių, kodo optimizatorių, dokumentacijos ir kodo generavimo įrankių kūrimo ir pan. Bet nei vienas iš šių egzistuojančių įrankių nėra specialiai skirtas abstrakčios sintaksės medžių transformacijoms į nuo kalbos nepriklausomą formą, ar iš jo. Šis magistro darbas aprašo sistemą, kuri pateiktą konkretų abstrakčios sintaksės medį (abstrakčios sintaksės medį, kuris išreiškia realios programavimo kalbos – C#, Java, Ruby ar pan. – programinio kodo struktūrą) transformuoja į nuo kalbos nepriklausomą abstrakčios sintaksės medį, bei atvirkščiai. Taisyklės, aprašančios vieno medžio transformavimą į kitą, yra aprašytos XML formatu paremtuose failuose, kurių struktūra aiški ir paprasta. Sistemą galima naudoti kaip nepriklausomą komponentą arba kaip įrankį trečiųjų šalių programinėje įrangoje. Tiek sistemos pagrindinės bibliotekos, tiek jas naudojantys įrankiai yra parašyti Java programavimo kalba. Sistemos tyrimu siekta įrodyti du dalykus: kad sistema gali teisingai transformuoti pateiktąjį konkretų abstrakčios sintaksės medį į jį atitinkantį bendrinį medį, ir atvirkščiai; ir kad transformavimo vykdymo laikas yra leistinose ribose. Abiejų tikslų buvo pasiekta. Remiantis šiais rezultatais prieita išvados, jog sistema yra tinkamas kandidatas tapti pagrindu trečiųjų šalių įrankiams, atliekantiems programinio kodo migravimą, pertvarkymus (angl. „refactoring“), modelių... [toliau žr. visą tekstą] / Tools for transforming tree-like data structures are used for solving a range of different problems, such as creation of compilers, code optimizers, documentation and code generation tools, etc. But none of these existing tools seem to be specialized in transforming abstract syntax trees to a language-independent format or from it. This master‘s thesis describes a system that takes concrete abstract syntax trees (ASTs that represent the structure of code written in a real programming language, such a C#, Java, Ruby, etc.) and transforms them into language-independent abstract syntax trees, and vice versa. Rules for mapping one AST to the other are defined in XML-based configuration files that have a simple and clear structure. The system can be used as a stand-alone tool or used as component in third party software. Both the system’s core libraries and tools are written in Java. The purpose of the system’s investigation was to prove two things: that the system can correctly transform a given specific AST to an equivalent generic AST, and vise versa; and that the transformation execution time is within an acceptable range. Both goals were met. This led to a conclusion that the system is a suitable candidate for use by third party tools that handle code migration, refactoring, model transformation and other types of similar tasks.

This thesis presents a series of experiments where endorsement rates, latencies and measures of cognitive ability were collected, to investigate the extent to which people search for counterexamples under necessity instructions, and alternative models under possibility instructions. The research was motivated by a syllogistic reasoning study carried out by Evans, Handley, Harper, and Johnson-Laird (1999), and predictions were derived from mental model theory (Johnson-Laird, 1983; Johnson-Laird & Byrne, 1991). With regard to the endorsement rate data: Experiment 1 failed to find evidence that a search for counterexamples or alternative models took place. In contrast experiment 2 (transitive inference) found some evidence to support the search for alternative models under possibility instructions, and following an improved training session, experiment 3 produced strong evidence to suggest that people searched for other models; which was mediated by cognitive ability. There was also strong evidence from experiments 4, 5 and 6 (abstract and everyday conditionals) to support the search for counterexamples and alternative models. Furthermore it was also found that people were more likely to find alternative causes when there were many that could be retrieved from their everyday knowledge, and that people carried out a search for counterexamples with many alternative causes under necessity instructions, and across few and many causal groups under possibility instructions. .The evidence from the latency data was limited and inconsistent, although people with higher cognitive ability were generally quicker in completing the tasks.

Operatorless Prolog text is LL(1) in nature and any standard LL parser generator tool can be used to parse it. However, the Prolog text that conforms to the ISO Prolog standard allows the definition of dynamic operators. Since Prolog operators can be defined at run-time, operator symbols are not present in the grammar rules of the language. Unless the parser generator allows for some flexibility in the specification of the grammar rules, it is very difficult to generate a parser for such text. In this thesis we discuss the existing parsing methods and their modified versions to parse languages with dynamic operator capabilities. Implementation details of a parser using Javacc as a parser generator tool to parse standard Prolog text is provided. The output of the parser is an “Abstract Syntax Tree” that reflects the correct precedence and associativity rules among the various operators (static and dynamic) of the language. Empirical results are provided that show that a Prolog parser that is generated by the parser generator like Javacc is comparable in efficiency to a hand-coded parser.

The Teaching Abstract Algebra for Understanding (TAAFU) project was centered on an innovative abstract algebra curriculum and was designed to accomplish three main objectives: to produce a set of multi-media support materials for instructors, to understand the challenges faced by mathematicians as they implemented this curriculum, and to study how this curriculum supports student learning of abstract algebra. Throughout the course of the project I took the lead investigating the teaching and learning in classrooms using the TAAFU curriculum. My dissertation is composed of three components of this research. First, I will report on a study that aimed to describe the experiences of mathematicians implementing the curriculum from their perspective. Second. I will describe a study that explores the mathematical work done by teachers as they respond to the mathematical activity of their students. Finally, I will discuss a theoretical paper in which I synthesize aspects of the instructional theory underlying the TAAFU curriculum in order to develop an analytic framework for analyzing student learning. This dissertation will serve as a foundation for my future research focused on the relationship between teachers' mathematical work and the learning of their students.

Faceted browsing (also called faceted search or faceted navigation) is an exploratory search model where facets assist in the interactive navigation of search results. Facets are attributes that have been assigned to describe resources being explored; a faceted taxonomy is a collection of facets provided by the interface and is often organized as sets, hierarchies, or graphs. Faceted browsing has become ubiquitous with modern digital libraries and online search engines, yet the process is still difficult to abstractly model in a manner that supports the development of interoperable and reusable interfaces. We propose category theory as a theoretical foundation for faceted browsing and demonstrate how the interactive process can be mathematically abstracted in order to support the development of reusable and interoperable faceted systems. Existing efforts in facet modeling are based upon set theory, formal concept analysis, and light-weight ontologies, but in many regards they are implementations of faceted browsing rather than a specification of the basic, underlying structures and interactions. We will demonstrate that category theory allows us to specify faceted objects and study the relationships and interactions within a faceted browsing system. Resulting implementations can then be constructed through a category-theoretic lens using these models, allowing abstract comparison and communication that naturally support interoperability and reuse. In this context, reuse and interoperability are at two levels: between discrete systems and within a single system. Our model works at both levels by leveraging category theory as a common language for representation and computation. We will establish facets and faceted taxonomies as categories and will demonstrate how the computational elements of category theory, including products, merges, pushouts, and pullbacks, extend the usefulness of our model. More specifically, we demonstrate that categorical constructions such as the pullback and pushout operations can help organize and reorganize facets; these operations in particular can produce faceted views containing relationships not found in the original source taxonomy. We show how our category-theoretic model of facets relates to database schemas and discuss how this relationship assists in implementing the abstractions presented. We give examples of interactive interfaces from the biomedical domain to help illustrate how our abstractions relate to real-world requirements while enabling systematic reuse and interoperability. We introduce DELVE (Document ExpLoration and Visualization Engine), our framework for developing interactive visualizations as modular Web-applications in order to assist researchers with exploratory literature search. We show how facets relate to and control visualizations; we give three examples of text visualizations that either contain or interact with facets. We show how each of these visualizations can be represented with our model and demonstrate how our model directly informs implementation. With our general framework for communicating consistently about facets at a high level of abstraction, we enable the construction of interoperable interfaces and enable the intelligent reuse of both existing and future efforts.

This paper is about a confessional painting series, which appropriates Abstract Expressionist techniques, and is on geometric canvas reliefs. The main focus through out the series is the process of my recovery from a traumatic event and the process of the creation of a language through abstraction.

Zusammenfassung zur 1998 von der Universität Vilnius angenommenen Dissertation von Inga Jankauskienė

Zusammenfassung der Autorin von Muzyka na dworze Augusta II w Warszawie, erschienen 1997 in Warszawa

Zusammenfassung der Autorin zur 1998 an der Universität von Vilnius eingereichten Dissertation

I've always considered myself a serious person who understood the meaning of labor. I am determined to labor over my ideas, and to labor seriously. The problem, and by "problem," I mean, "best thing" about this is that no one takes me seriously. Ever. They seem to like my work anyway. Apparently, I'm more funny than I am serious. But that's okay, because, secretly, I think I've always tried to be serious because I never thought I was smart enough to be funny. I often misunderstand things. Sometimes I mishear or wrongly attribute or think that facts are a metaphors or that metaphors are facts. Then I take this (mis)information back to my studio and playing Cosmic Matchmaker, yoking together seeming disparate elements to create a visual vocabulary. And then I labor over it. Very seriously.