An Open Challenge Problem Repository for Systems Supporting Binders

A variety of logical frameworks support the use of higher-order abstract syntax in representing formal systems; however, each system has its own set of benchmarks. Even worse, general proof assistants that provide special libraries for dealing with binders offer a very limited evaluation of such libraries, and the examples given often do not exercise and stress-test key aspects that arise in the presence of binders. In this paper we design an open repository ORBI (Open challenge problem Repository for systems supporting reasoning with BInders). We believe the field of reasoning about languages with binders has matured, and a common set of benchmarks provides an important basis for evaluation and qualitative comparison of different systems and libraries that support binders, and it will help to advance the field.Comment: In Proceedings LFMTP 2015, arXiv:1507.0759

The utility of a digital simulation language for ecological modeling

Dynamic modeling of ecological phenomena has been greatly facilitated by the recent development of continuous system simulator programs. This paper illustrates the application of one of these programs, S/360 Continuous System Modeling Program (S/360 CSMP), to four systems of graduated complexity. The first is a two species system, with one feeding on the other, using differential equations with constant coefficients. The second and third systems involve two competing plant species in which the coefficients of the differential equations are varying with time. The final example considers the management of a postulated buffalo herd in which the dynamics of the herd population and composition by sex and age is combined with various strategies to control its size and to optimize buffalo production

Computational Mechanism Design: A Call to Arms

Game theory has developed powerful tools for analyzing decision making in systems with multiple autonomous actors. These tools, when tailored to computational settings, provide a foundation for building multiagent software systems. This tailoring gives rise to the field of computational mechanism design, which applies economic principles to computer systems design

Basque-to-Spanish and Spanish-to-Basque machine translation for the health domain

[EU]Master Amaierako Lan honek medikuntza domeinuko euskara eta gaztelera arteko itzulpen automatiko sistema bat garatzeko helburuarekin emandako lehenengo urratsak aurkezten ditu. Corpus elebidun nahikoaren faltan, hainbat esperimentu burutu dira Itzulpen Automatiko Neuronalean erabiltzen diren parametroak domeinuz kanpoko corpusean aztertzeko; medikuntza domeinuan izandako jokaera ebaluatzeko ordea, eskuz itzulitako corpusa erabili da medikuntza domeinuko corpusen presentzia handituz entrenatutako sistema desberdinak probatzeko. Lortutako emaitzek deskribatutako helbururako bidean lehenengo aurrerapausoa suposatzen dute.[EN]This project presents the initial steps towards the objective of developing a Machine Translation system for the health domain between Basque and Spanish. In the absence of a big enough bilingual corpus, several experiments have been carried out to test different Neural Machine Translation parameters on an out-of-domain corpus; while performance on the health domain has been evaluated with a manually translated corpus in different systems trained with increasing presence of health domain corpora. The results obtained represent a first step forward to the described objective

Progressive vowel height harmony in Proto-Kikongo and Proto-Bantu

The systematic comparison of the different types of progressive Vowel Height Harmony (pVHH) attested within the Kikongo Language Cluster (KLC) leads to the conclusion that this common Bantu process of long-distance assimilation cannot be reconstructed to Proto-Kikongo. The ‘(a)symmetric-pVHH’ and ‘back-pVHH’ patterns, the two main and structurally different kinds of pVHH within the KLC, emerged independently and relatively late within two distinct subgroups, viz. South Kikongo and North Kikongo respectively. Moreover, the ‘(a)symmetric-pVHH’ pattern further spread from a South Kikongo focal area coinciding with the heartland of the Kongo kingdom to other parts of the KLC through contact-induced dialectal diffusion. Furthermore, the historical-comparative evidence from the KLC suggests that neither symmetric nor asymmetric pVHH should be reconstructed to Proto-Bantu, the most recent common ancestor of all Bantu languages

Trace-level reuse

Trace-level reuse is based on the observation that some traces (dynamic sequences of instructions) are frequently repeated during the execution of a program, and in many cases, the instructions that make up such traces have the same source operand values. The execution of such traces will obviously produce the same outcome and thus, their execution can be skipped if the processor records the outcome of previous executions. This paper presents an analysis of the performance potential of trace-level reuse and discusses a preliminary realistic implementation. Like instruction-level reuse, trace-level reuse can improve performance by decreasing resource contention and the latency of some instructions. However, we show that trace-level reuse is more effective than instruction-level reuse because the former can avoid fetching the instructions of reused traces. This has two important benefits: it reduces the fetch bandwidth requirements, and it increases the effective instruction window size since these instructions do not occupy window entries. Moreover, trace-level reuse can compute all at once the result of a chain of dependent instructions, which may allow the processor to avoid the serialization caused by data dependences and thus, to potentially exceed the dataflow limit.Peer ReviewedPostprint (published version

A Molecular Biology Database Digest

Computational Biology or Bioinformatics has been defined as the application of mathematical and Computer Science methods to solving problems in Molecular Biology that require large scale data, computation, and analysis [18]. As expected, Molecular Biology databases play an essential role in Computational Biology research and development. This paper introduces into current Molecular Biology databases, stressing data modeling, data acquisition, data retrieval, and the integration of Molecular Biology data from different sources. This paper is primarily intended for an audience of computer scientists with a limited background in Biology

An automatic part-of-speech tagger for Middle Low German

Syntactically annotated corpora are highly important for enabling large-scale diachronic and diatopic language research. Such corpora have recently been developed for a variety of historical languages, or are still under development. One of those under development is the fully tagged and parsed Corpus of Historical Low German (CHLG), which is aimed at facilitating research into the highly under-researched diachronic syntax of Low German. The present paper reports on a crucial step in creating the corpus, viz. the creation of a part-of-speech tagger for Middle Low German (MLG). Having been transmitted in several non-standardised written varieties, MLG poses a challenge to standard POS taggers, which usually rely on normalized spelling. We outline the major issues faced in the creation of the tagger and present our solutions to them