BabeLO : an extensible converter of programming exercises formats

In the last two decades, there was a proliferation of programming exercise formats that hinders interoperability in automatic assessment. In the lack of a widely accepted standard, a pragmatic solution is to convert content among the existing formats. BabeLO is a programming exercise converter providing services to a network of heterogeneous e-learning systems such as contest management systems, programming exercise authoring tools, evaluation engines and repositories of learning objects. Its main feature is the use of a pivotal format to achieve greater extensibility. This approach simplifies the extension to other formats, just requiring the conversion to and from the pivotal format. This paper starts with an analysis of programming exercise formats representative of the existing diversity. This analysis sets the context for the proposed approach to exercise conversion and to the description of the pivotal data format. The abstract service definition is the basis for the design of BabeLO, its components and web service interface. This paper includes a report on the use of BabeLO in two concrete scenarios: to relocate exercises to a different repository, and to use an evaluation engine in a network of heterogeneous systems.

Orchestration of e-learning services for automatic evaluation of programming exercises

Managing programming exercises require several heterogeneous systems such as evaluation engines, learning objects repositories and exercise resolution environments. The coordination of networks of such disparate systems is rather complex. These tools would be too specific to incorporate in an e-Learning platform. Even if they could be provided as pluggable components, the burden of maintaining them would be prohibitive to institutions with few courses in those domains. This work presents a standard based approach for the coordination of a network of e-Learning systems participating on the automatic evaluation of programming exercises. The proposed approach uses a pivot component to orchestrate the interaction among all the systems using communication standards. This approach was validated through its effective use on classroom and we present some preliminary results.

A study of risk-aware program transformation

In the trend towards tolerating hardware unreliability, accuracy is exchanged for cost savings. Running on less reliable machines, functionally correct code becomes risky and one needs to know how risk propagates so as to mitigate it. Risk estimation, however, seems to live outside the average programmer’s technical competence and core practice. In this paper we propose that program design by source-to-source transformation be risk-aware in the sense of making probabilistic faults visible and supporting equational reasoning on the probabilistic behaviour of programs caused by faults. This reasoning is carried out in a linear algebra extension to the standard, `a la Bird-Moor algebra of programming. This paper studies, in particular, the propagation of faults across standard program transformation techniques known as tupling and fusion, enabling the fault of the whole to be expressed in terms of the faults of its parts.

Metaphorisms in programming

This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant information while at the same time some intended optimization takes place. Text processing, sorting, representation changers, etc., are examples of metaphorisms. The kind of metaphorism refinement proposed in this paper is a strategy known as change of virtual data structure. It gives sufficient conditions for such implementations to be calculated using relation algebra and illustrates the strategy with the derivation of quicksort as example.

When is the second local multiplier algebra of a C*-algebra equal to the first?

We discuss necessary as well as sufficient conditions for the second iterated local multiplier algebra of a separable C*-algebra to agree with the first.

CURRENT-ALGEBRA OF SUPER WZNW MODELS

We derive the current algebra of supersymmetric principal chiral models with a Wess-Zumino term. At the critical point one obtains two commuting super-affine Lie algebras as expected, but, in general, them are intertwining fields connecting both right and left sectors, analogously to the bosonic case. Moreover, in the present supersymmetric extension we have a quadratic algebra, rather than an affine Lie algebra, due to the mixing between bosonic and fermionic fields; the purely fermionic sector displays an affine Lie algebra as well.

THE ALGEBRA OF NONLOCAL CHARGES IN NONLINEAR SIGMA-MODELS

We obtain the exact classical algebra obeyed by the conserved non-local charges in bosonic non-linear sigma models. Part of the computation is specialized for a symmetry group O(N). As it turns out the algebra corresponds to a cubic deformation of the Kac-Moody algebra. We generalize the results for the presence of a Wess-Zumino term. The algebra is very similar to the previous one, now containing a calculable correction of order one unit lower. The relation with Yangians and the role of the results in the context of Lie-Poisson algebras are also discussed.

Further on the current algebra of WZNW models at and away from criticality

We comment on the off-critical perturbations of WZNW models by a mass term as well as by another descendent operator, when we can compare the results with further algebra obtained from the Dirac quantization of the model, in such a way that a more general class of models be included. We discover, in both cases, hidden Kac-Moody algebras obeyed by some currents in the off-critical case, which in several cases are enough to completely fix the correlation functions.

Ramond-ramond central charges in the supersymmetry algebra of the superstring

The free action for the massless sector of the type II superstring was recently constructed using closed Ramond-Neveo-Schwarz superstring field theory. The supersymmetry transformations of this action are shown to satisfy an N = 2 D = 10 supersymmetry algebra with Ramond-Ramond central charges.

Challenges of programming apprentice

The present article describes the challenges programming apprentices face and identifies the elements and processes that set them apart from experienced programmers. And also explains why a conventional programming languages teaching approach fails to map the programming mental model. The purpose of this discussion is to benefit from ideas and cognitive philosophies to be embedded in programming learning tools. Cognitive components are modeled as elements to be handled by the apprentices in tutoring systems while performing a programming task. In this process a mental level solution (the mental model of the program) and an implementation level solution (the program) are created. The mapping between these representations is a path followed by the student explicitly in this approach. © 2011 IEEE.

Introducción a la técnica de programación = Introduction to the technique of programming

Incluye Bibliografía

Estudio preliminar sobre la técnica de programación del desarrollo económico = Preliminary study of the technique of programming economic development

Incluye Bibliografía