Digit recurence division under HUB format

Half-Unit-Biased format is based on shifting the representation line of the binary numbers by half Unit in the Last Place. The main feature of this format is that the round to nearest is carried out by a simple truncation, preventing any carry propagation and saving time and area. Algorithms and architectures have been defined for addition/substraction and multiplication operations under this format. Nevertheless, the division operation has not been confronted yet. In this paper we deal with the floating-point division under HUB format, studying the architecture for the digit recurrence method, including the on-the-fly conversion of the signed digit quotient.

Buscando inspiración musical en el universo computacional

Throughout the history of western music, composers have relied on “outside-of-time” structures which have served as musical “prime matter” until the moment of their temporal inscription. These structures have traditionally been the scales, rhythmic values, formal schemes, harmonic rules, etc., that composers have employed over and over again. They are to the composer what marble is to the sculptor or colors are to the painter. The advent of computer technology has opened new avenues that allow composers to develop new structures and enlarge their creative horizon. I started my musical training at a very early age, and at the same time I had a lot of scientific curiosity. As soon as I had my first computer (a Commodore 64), I started to experiment, to establish relationships between scientific processes and the world of sound. To date, and following the footsteps of I. Xenakis (although from a different aesthetic perspective), my compositions have always been informed, to a lesser or greater degree, by some underlying scientific idea, and this task can hardly be achieved without computation. Furthermore, today, computer-composers open the possibility to access and use an ever-growing repository of musical material goes a step forward in this direction. And this raises many questions, some of them of a deep philosophical ground.

General Game Playing: Análisis del problema. Solución basada en un algoritmo hibrido de inteligencia computacional

El objetivo de este trabajo es presentar unas bases de conocimiento sobre el denominado General Game Playing (GGP) analizando los conceptos relacionados con esta área que ha surgido recientemente, de forma que nuestro trabajo pueda ser usado como base en futuras investigaciones y tesis relacionadas con la materia. Para ello, se hará un estudio de los enfoques que se han empleado para abordar el problema y se profundizará en otras técnicas algorítmicas, tales como por ejemplo la de Montecarlo Tree Search y los algoritmos bio-inspirados que no se han empleado (o se han empleado poco) en este contexto. Adicionalmente, se realiza una propuesta de un agente autónomo (es decir, un resolutor del problema), implementando un algoritmo bio-inspirado mixto, dentro de la plataforma para la General Video Game Artificial Intelligence Competition (GVGAI), analizando sus resultados y extrayendo conclusiones.