Oliokielten välikielten optimointi

Javan myötä ohjelmointikielten kääntämisprosessiin on uudelleen esitelty erityisen käsittelyn kohteeksi kelpaava välikieli, tavukoodi. Tavallisesti Java-ohjelmaa suoritettaessa erityinen virtuaalikone lataa tavukoodimuotoisen ohjelman esityksen, jota suoritetaan joko tulkkaamalla tai suoritusaikaisesti suoritusalustan ymmärtämälle kielelle kääntäen. Tässä tutkielmassa tutkitaan välikielen tasolla tapahtuvia optimointimahdollisuuksia. Oliokielten dynaamisen luonteen vuoksi puhtaasti staattinen optimointi on vaikeaa ja siksi usein hedelmätöntä. Tutkielman yhteydessä kuitenkin tunnistettiin mobiiliohjelmointiin soveltuva suljetun maailman oletus, jonka puitteissa tavukoodin tasolla voidaan ohjelmaa parannella turvallisesti. Esimerkkinä tutkielmassa toteutetaan ylimääräisiä rajapintaluokkia poistava optimointi. Koska optimointialgoritmit ovat usein monimutkaisia ja vaikeaselkoisia, tutkitaan työssä myös mahdollisuuksia niiden yksinkertaisempaan esittämiseen. Alunperin Javalla toteutetun luokkahierarkiaa uudelleenjärjestelevän algoritmin esiehtojen tarkastus onnistutaan kuvaamaan ensimmäisen kertaluokan logiikan kaavalla, jolloin esiehtojen tarkastus onnistuu tutkielman puitteissa toteutetulla logiikkakoneella. Logiikkakoneelle kuvataan logiikkakaavojen propositiot Javalla, mutta propositioiden yhdistely tapahtuu ja-konnektiiveja käyttävällä logiikkakielellä. Suorituskyvyltään logiikkakone on joissain tapauksissa Java-toteutusta nopeampi.

Composing New Abstractions From Object Fragments

As object-oriented languages are extended with novel modularization mechanisms, better underlying models are required to implement these high-level features. This paper describes CELL, a language model that builds on delegation-based chains of object fragments. Composition of groups of cells is used: 1) to represent objects, 2) to realize various forms of method lookup, and 3) to keep track of method references. A running prototype of CELL is provided and used to realize the basic kernel of a Smalltalk system. The paper shows, using several examples, how higher-level features such as traits can be supported by the lower-level model.

JSONYA/FN: Functional Computation in JSON

Functional programming has a lot to offer to the developers of global Internet-centric applications, but is often applicable only to a small part of the system or requires major architectural changes. The data model used for functional computation is often simply considered a consequence of the chosen programming style, although inappropriate choice of such model can make integration with imperative parts much harder. In this paper we do the opposite: we start from a data model based on JSON and then derive the functional approach from it. We outline the identified principles and present Jsonya/fn — a low-level functional language that is defined in and operates with the selected data model. We use several Jsonya/fn implementations and the architecture of a recently developed application to show that our approach can improve interoperability and can achieve additional reuse of representations and operations at relatively low cost. ACM Computing Classification System (1998): D.3.2, D.3.4.

Intermediate Macroeconomics : Self-evaluation exercises

This resource can be particularly helpful to students taking the Intermediate Macroeconomics course, which corresponds to the second year of the current Degree in Economics at the University of the Basque Country UPV/ EHU. The precise content of this resource is a collection of eight chapters of multiple-choice questions. For each question the user is asked to guess which the correct answer is. Finally, the tool will return all the correct answers for the whole test, thereby allowing the user to check the validity of his/her answers. A remarkable feature of the tool is that it has been edited in three versions, for the three languages (Spanish, Basque and English) in which the subject is taught at the UPV/EHU.

What secondary English to speakers of other languages (ESOL) teachers know about social and academic language and instructional strategies for limited English proficient students

The purpose of this study was to examine what secondary English to Speakers of Other Languages (ESOL) teachers understand about social and academic language, what instructional strategies they use for Limited English Proficient (LEP) students, and how these concepts are operationalized in their daily practice. ^ This was a mixed method study incorporating both quantitative and qualitative data collection and interpretation. Written questionnaires and individual interviews addressed the questions on teachers' definitions of social and academic language and their strategy use. Classroom observations provided verification of their definitions and their descriptions of instruction for academic language. ^ Findings indicated that teachers' definitions of social and academic language were still developing and that there were ambiguities in identifying examples of social and academic language. The use of graphic organizers or visual supports, groups or peer partners, role play or drama, and modeling were the strategies teachers consistently listed for beginner, intermediate, advanced and multiple level classes. Additionally, teachers' descriptions of their instruction were congruent with what was observed in their classroom practice. ^ It appeared that this population of secondary ESOL teachers was in the process of evolving their definitions of social and academic language and were at different stages in this evolution. Teachers' definitions of language influenced their instruction. Furthermore, those who had clear constructs of language were able to operationalize them in their classroom instruction. ^

Pattern-based analysis of EAI languages : the case of the business modelling language

Enterprise Application Integration (EAI) is a challenging area that is attracting growing attention from the software industry and the research community. A landscape of languages and techniques for EAI has emerged and is continuously being enriched with new proposals from different software vendors and coalitions. However, little or no effort has been dedicated to systematically evaluate and compare these languages and techniques. The work reported in this paper is a first step in this direction. It presents an in-depth analysis of a language, namely the Business Modeling Language, specifically developed for EAI. The framework used for this analysis is based on a number of workflow and communication patterns. This framework provides a basis for evaluating the advantages and drawbacks of EAI languages with respect to recurrent problems and situations.

Synthesis of a heparan sulfate mimetic disaccharide with a conformationally locked residue from a common intermediate

A simple mimetic of a heparan sulfate disaccharide sequence that binds to the growth factors FGF-1 and FGF-2 was synthesized by coupling a 2-azido-2-deoxy-D-glucosyl trichloroacetimidate donor with a 1,6-anhydro-2-azido-2-deoxy--D-glucose acceptor. Both the donor and acceptor were obtained from a common intermediate readily obtained from D-glucal. Molecular docking calculations showed that the predicted locations of the disaccharide sulfo groups in the binding site of FGF-1 and FGF-2 are similar to the positions observed for co-crystallized heparin-derived oligosaccharides obtained from published crystal structures.

Configurable reference modeling languages

This chapter discusses reference modelling languages for business systems analysis and design. In particular, it reports on reference models in the context of the design-for/by-reuse paradigm, explains how traditional modelling techniques fail to provide adequate conceptual expressiveness to allow for easy model reuse by configuration or adaptation and elaborates on the need for reference modelling languages to be configurable. We discuss requirements for and the development of reference modelling languages that reflect the need for configurability. Exemplarily, we report on the development, definition and configuration of configurable event-driven process chains. We further outline how configurable reference modelling languages and the corresponding design principles can be used in future scenarios such as process mining and data modelling.

Recognising and respecting Torres Strait Islander mathematics knowledges and home languages through mainstream mathematics education [Abstract]

This abstract provides a preliminary discussion of the importance of recognising Torres Strait Islander knowledges and home languages of mathematics education. It stems from a project involving Torres Strait Islander Teachers and Teacher Aides and university based researchers who are working together to enhance the mathematics learning of students from Years 4-9. A key focus of the project is that mathematics is relevant and provides students with opportunities for further education, training and employment. Veronica Arbon (2008) questions the assumptions underpinning Western mainstream education as beneficial for Aboriginal and Torres Strait Islander people which assumes that it enables them to better participate in Australian society. She asks “how de we best achieve outcomes for and with Indigenous people conducive to our cultural, physical and economic sustainability as defined by us from Indigenous knowledge positions?” (p. 118). How does a mainstream education written to English conventions provide students with the knowledge and skills to participate in daily life, if it does not recognise the cultural identity of Indigenous students as it should (Priest, 2005; cf. Schnukal, 2003)? Arbon (2008) states that this view is now brought into question with calls for both ways education where mainstream knowledge and practices is blended with Indigenous cultural knowledges of learning. This project considers as crucial that cultural knowledges and experiences of Indigenous people to be valued and respected and given the currency in the same way that non Indigenous knowledge is (Taylor, 2003) for both ways education to work.

An experiment in mixed compilation/interpretation

One of the classic forms of intermediate representation used for communication between compiler front-ends and back-ends are those based on abstract stack machines. It is possible to compile the stack machine instructions into machine code by means of an interpretive code generator, or to simulate the stack machine at runtime using an interpreter. This paper describes an approach intermediate between these two extremes. The front-end for a commercial Modula 2 compiler was ported to the "industry standard PC", and a partially compiling back-end written. The object code runs with the assistance of an interpreter, but may be linked with libraries which are fully compiled. The intent was to provide a programming environment on the PC which is identical to that of the same compilers on 32-bit UNIX machines. This objective has been met, and the compiler is available to educational institutions as free-ware. The design basis of the new compiler is described, and the performance critically evaluated.