The LLP/Prolog to Java translator Prolog Café was altered to produce C# instead. New built-in predicates were added to enable the user to exploit the concurrency support in C# from the Prolog side. I now intend to work on optimising the translated code by detecting common programming idioms and by allowing the programmer to add mode annotations to their code. I also intend to add a module syste...

Numerical linear algebra algorithms use the inherent elegance of matrix formulations and are usually implemented using C/C++ floating point representation. The system implementation is faced with practical constraints because these algorithms usually need to run in real time on fixed point digital signal processors (DSPs) to reduce total hardware costs. Converting the simulation model to fixed ...

Locally decodable codes (LDCs) are error correcting codes that allow for decoding of a single message bit using a small number of queries to a corrupted encoding. Despite decades of study, the optimal trade-off between query complexity and codeword length is far from understood. In this work, we give a new characterization of LDCs using distributions over Boolean functions whose expectation is ...

Lossless compression is studied for a countably infinite alphabet source with an unknown, off-centered, two-sided geometric (TSG) distribution, which is a commonly used statistical model for image prediction residuals. In this paper, we demonstrate that arithmetic coding based on a simple strategy of model adaptation, essentially attains the theoretical lower bound to the universal coding redun...

Building interval software interoperability can be a good solution when re-using high-quality legacy code or when accessing functionalities unavailable natively in one of the software. In this work we demonstrate MathLink technology for integrating C-XSC functions into Mathematica and present some of the bene ts this approach could bring to both environments.

• Motivation: – Lots of research in clone detection, but more on algorithms and tools than on case studies and comprehension • What kinds of cloning are there? Why does cloning happen? What kinds are the most/least harmful? Do different clone kinds have different precision / recall numbers? Different algorithms? – Future work: track clone evolution • Do related bugs get fixed? Does cloned code ...

Contrary to popular belief, Lisp code can be very efcient today: it can run as fast as equivalent C code or even faster in some cases. In this paper, we explain how to tune Lisp code for performance by introducing the proper type declarations, using the appropriate data structures and compiler information. We also explain how e ciency is achieved by the compilers. These techniques are applied t...

| The performance of the multilevel pattern matching (MPM) code for lossless image compression is rst analyzed. It is shown that the worst-case redundancy of the MPM code against all nite 2D context arithmetic codes is O(1= p log n), where n is the number of pixels in the image to be compressed. This result is in contrast to the redundancy of O(1= log n) in the case of 1D data and is caused by ...

This paper presents an ongoing research on the behavior and performance of LISP with respect to C in the context of scientific numerical computing. Several simple image processing algorithms are used to evaluate the performance of pixel access and arithmetic operations in both languages. We demonstrate that the behavior of equivalent LISP and C code is similar with respect to the choice of data...