Collaborative trails in e-learning environments

This deliverable focuses on collaboration within groups of learners, and hence collaborative trails. We begin by reviewing the theoretical background to collaborative learning and looking at the kinds of support that computers can give to groups of learners working collaboratively, and then look more deeply at some of the issues in designing environments to support collaborative learning trails and at tools and techniques, including collaborative filtering, that can be used for analysing collaborative trails. We then review the state-of-the-art in supporting collaborative learning in three different areas – experimental academic systems, systems using mobile technology (which are also generally academic), and commercially available systems. The final part of the deliverable presents three scenarios that show where technology that supports groups working collaboratively and producing collaborative trails may be heading in the near future

Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination

This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic properties. The theory of real algebraic numbers and more generally of semi-algebraic varieties is at the core of a number of effective methods in real analysis, including decision procedures for non linear arithmetic or optimization methods for real valued functions. After defining an abstract structure of discrete real closed field and the elementary theory of real roots of polynomials, we describe the formalization of an algebraic proof of quantifier elimination based on pseudo-remainder sequences following the standard computer algebra literature on the topic. This formalization covers a large part of the theory which underlies the efficient algorithms implemented in practice in computer algebra. The success of this work paves the way for formal certification of these efficient methods.Comment: 40 pages, 4 figure

A Dynamic Model of Final Service Competition in fixed Electronic Communications under a Capacity Interconnection Regime

Recientemente el regulador español ha implementado un nuevo modelo de interconexión en redes fijas de telecomunicaciones basado en la compra de capacidad que podrá ser utilizado en combinación con el modelo habitual de interconexión por tiempo. Se propone un modelo dinámico de competencia en duopolio en el cual el entrante puede comprar ex ante un cierto nivel de capacidad al incumbente paraluego ambos operadores competir en precios. Se introduce la posibilidad de que el entrante pueda asignar eficientemente el tráfico entre distintas franjas horarias. Los resultados muestran que el uso simultáneo de ambos modelos genera una competencia más agresiva en precios y puede llegar a producir significativas ganancias de eficiencia (asignativa y otras internas a la firma). De cualquier forma, el entrante necesita alcanzar una masa crítica antes de que el nuevo modelo pueda representar una alternativa para él. Además, una vez alcanzado este nivel, su conveniencia para el entrante dependerá de determinadas condiciones.The Spanish regulatory authority recently implemented a new interconnection regime based on capacity (and not per time) payments in fixed telecommunications. We propose a dynamic duopolistic model of final service competition in which the entrant first acquires a certain capacity at the local loop (at a fixed payment) from the incumbent and then both operators compete in prices for the final services. We introduce the entrant’s possibility to assign efficiently the traffic he offer between different hours along the day as well as the possibility for him to use the capacity based model as well as the per-unit-oftime interconnection regime vis à vis the incumbent. The results show that, the simultaneous use of both interconnection models (instead of only the one based on time) leads always to tougher competition (more aggressive pricing) in the final service market and efficiency (internal to the firm and allocative) gains. Nevertheless, the entrant needs a minimum scale before this new model can be a viable alternative. In addition, once reached this scale, its convenience for the entrant will depend on certain conditions.Interconnection per time, Interconnection by capacity, Dynamics of the competition, Regulation, Network dimension.

Supplementary Computer Generated Cueing to Enhance Air Traffic Controller Efficiency

Air traffic controllers are often required to simultaneously communicate with several aircraft over multiple radio frequencies. As a result, during peak loading, it is common for the controller to receive multiple concurrent communications, each from a different aircraft, making it difficult to discern audio messages received from multiple pilots simultaneously. To address this problem, a modified air traffic control (ATC) interface was prototyped with the goal of increasing controller-to-pilot communication efficiency. This prototype included supplementary text cueing which was provided by a hypothetical automated text to speech system in an on-screen text box for controller reference in the event of an obscured or indiscernible radio call. The prototype was then evaluated by a group of 35 participants, all with ATC experience including 12 students and 23 instructors at the Air Force controllers\u27 school house Keesler AFB, MS. The text cueing improved controllers\u27 comprehension of pilots\u27 transmissions

Extracting proofs from documents

Often, theorem checkers like PVS are used to check an existing proof, which is part of some document. Since there is a large difference between the notations used in the documents and the notations used in the theorem checkers, it is usually a laborious task to convert an existing proof into a format which can be checked by a machine. In the system that we propose, the author is assisted in the process of converting an existing proof into the PVS language and having it checked by PVS. 1 Introduction The now-classic ALGOL 60 report [5] recognized three different levels of language: a reference language, a publication language and several hardware representations, whereby the publication language was intended to admit variations on the reference language and was to be used for stating and communicating processes. The importance of publication language ---often referred to nowadays as "pseudo-code"--- is difficult to exaggerate since a publication language is the most effective way..