Skeleton based visual pattern recognition. Applications to tabletop interaction

211 p. :il.

Adaptive Scalable SVD Unit for Fast Processing of Large LSE Problems

Singular Value Decomposition (SVD) is a key linear algebraic operation in many scientific and engineering applications. In particular, many computational intelligence systems rely on machine learning methods involving high dimensionality datasets that have to be fast processed for real-time adaptability. In this paper we describe a practical FPGA (Field Programmable Gate Array) implementation of a SVD processor for accelerating the solution of large LSE problems. The design approach has been comprehensive, from the algorithmic refinement to the numerical analysis to the customization for an efficient hardware realization. The processing scheme rests on an adaptive vector rotation evaluator for error regularization that enhances convergence speed with no penalty on the solution accuracy. The proposed architecture, which follows a data transfer scheme, is scalable and based on the interconnection of simple rotations units, which allows for a trade-off between occupied area and processing acceleration in the final implementation. This permits the SVD processor to be implemented both on low-cost and highend FPGAs, according to the final application requirements.

Treewidth: theory and applications to computer science

This report is an introduction to the concept of treewidth, a property of graphs that has important implications in algorithms. Some basic concepts of graph theory are presented in the first chapter for those readers that are not familiar with the notation. In Chapter 2, the definition of treewidth and some different ways of characterizing it are explained. The last two chapters focus on the algorithmic implications of treewidth, which are very relevant in Computer Science. An algorithm to compute the treewidth of a graph is presented and its result can be later applied to many other problems in graph theory, like those introduced in the last chapter.

Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction

We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether or not the sentence is true on the structure. We present a proof system for certifying the falsity of QCSP instances and develop its basic theory; for instance, we provide an algorithmic interpretation of its behavior. Our proof system places the established Q-resolution proof system in a broader context, and also allows us to derive QCSP tractability results.

Estimacion de sexo y edad a nivel esqueletico: aplicacion forense y antropologica

[ES] La estimación del sexo y la edad son esenciales para la identificación individual de restos humanos y para el conocimiento e interpretación de la variabilidad biológica del pasado. El objetivo de este trabajo es la elaboración de un protocolo metodológico de análisis morfológico y morfométrico, para la estimación del sexo en adultos y de la edad en subadultos y adultos. Las principales metodologías incluidas en este trabajo pueden emplearse en restos esqueléticos de procedencia europea. Se realizó una revisión bibliográfica en revistas de ámbito forense y antropológico a fin de reunir un conjunto de metodologías aplicables tanto a esqueletos completos como parciales. Finalmente, en la elección de los métodos incluidos en este protocolo se tuvieron en cuenta dos criterios: la bondad de ajuste y el grado de complejidad del método.