Accuracy vs. simplicity: a complex trade-off

Inductive learning aims at finding general rules that hold true in a database. Targeted learning seeks rules for the predictions of the value of a variable based on the values of others, as in the case of linear or non-parametric regression analysis. Non-targeted learning finds regularities without a specific prediction goal. We model the product of non-targeted learning as rules that state that a certain phenomenon never happens, or that certain conditions necessitate another. For all types of rules, there is a trade-off between the rule's accuracy and its simplicity. Thus rule selection can be viewed as a choice problem, among pairs of degree of accuracy and degree of complexity. However, one cannot in general tell what is the feasible set in the accuracy-complexity space. Formally, we show that finding out whether a point belongs to this set is computationally hard. In particular, in the context of linear regression, finding a small set of variables that obtain a certain value of R2 is computationally hard. Computational complexity may explain why a person is not always aware of rules that, if asked, she would find valid. This, in turn, may explain why one can change other people's minds (opinions, beliefs) without providing new information.

A Thomason model structure on the category of small n-fold categories

We construct a cofibrantly generated Thomason model structure on the category of small n-fold categories and prove that it is Quillen equivalent to the standard model structure on the category of simplicial sets. An n-fold functor is a weak equivalence if and only if the diagonal of its n-fold nerve is a weak equivalence of simplicial sets. We introduce an n-fold Grothendieck construction for multisimplicial sets, and prove that it is a homotopy inverse to the n-fold nerve. As a consequence, the unit and counit of the adjunction between simplicial sets and n-fold categories are natural weak equivalences.

Improving the accuracy of heat balance integral methods applied to thermal problems with time dependent boundary conditions

In this paper the two main drawbacks of the heat balance integral methods are examined. Firstly we investigate the choice of approximating function. For a standard polynomial form it is shown that combining the Heat Balance and Refined Integral methods to determine the power of the highest order term will either lead to the same, or more often, greatly improved accuracy on standard methods. Secondly we examine thermal problems with a time-dependent boundary condition. In doing so we develop a logarithmic approximating function. This new function allows us to model moving peaks in the temperature profile, a feature that previous heat balance methods cannot capture. If the boundary temperature varies so that at some time t & 0 it equals the far-field temperature, then standard methods predict that the temperature is everywhere at this constant value. The new method predicts the correct behaviour. It is also shown that this function provides even more accurate results, when coupled with the new CIM, than the polynomial profile. Analysis primarily focuses on a specified constant boundary temperature and is then extended to constant flux, Newton cooling and time dependent boundary conditions.

An approximation algorithm for #k-SAT

"Vegeu el resum a l'inici del document del fitxer adjunt"

On the system of the functions x (s) / (s-r)k

"Vegeu el resum a l'inici del document del fitxer adjunt."

Textural classification of land cover using support vector machines: an empirical comparison with parametric, non parametric and hybrid classifiers in the Bolivian Amazon

Land cover classification is a key research field in remote sensing and land change science as thematic maps derived from remotely sensed data have become the basis for analyzing many socio-ecological issues. However, land cover classification remains a difficult task and it is especially challenging in heterogeneous tropical landscapes where nonetheless such maps are of great importance. The present study aims to establish an efficient classification approach to accurately map all broad land cover classes in a large, heterogeneous tropical area of Bolivia, as a basis for further studies (e.g., land cover-land use change). Specifically, we compare the performance of parametric (maximum likelihood), non-parametric (k-nearest neighbour and four different support vector machines - SVM), and hybrid classifiers, using both hard and soft (fuzzy) accuracy assessments. In addition, we test whether the inclusion of a textural index (homogeneity) in the classifications improves their performance. We classified Landsat imagery for two dates corresponding to dry and wet seasons and found that non-parametric, and particularly SVM classifiers, outperformed both parametric and hybrid classifiers. We also found that the use of the homogeneity index along with reflectance bands significantly increased the overall accuracy of all the classifications, but particularly of SVM algorithms. We observed that improvements in producer’s and user’s accuracies through the inclusion of the homogeneity index were different depending on land cover classes. Earlygrowth/degraded forests, pastures, grasslands and savanna were the classes most improved, especially with the SVM radial basis function and SVM sigmoid classifiers, though with both classifiers all land cover classes were mapped with producer’s and user’s accuracies of around 90%. Our approach seems very well suited to accurately map land cover in tropical regions, thus having the potential to contribute to conservation initiatives, climate change mitigation schemes such as REDD+, and rural development policies.

Síntesi de siRNAs (short interfering RNAs) modificats amb nucleobases 5-metil i 5-propinil pirimidíniques i avaluació de la seva activitat in vitro en cultius cel•lulars i de la seva estabilitat en sèrum humà. Disseny de siRNAs dirigits a la inhibició de l'expressió de mutacions de l'oncogen K-ras.

Projecte de recerca elaborat a partir d’una estada a la Stanford University, EEUU, entre 2007 i 2009. El present projecte es basa 1) en la síntesi de cadenes d'ARN dirigides a la inhibició de l'expressió gènica per un mecanisme d'ARN d'interferència (siRNAs o short interefering RNAs) i 2) en l'avaluació de l'activitat in vitro d'aquests oligonucleòtids en cultius cel•lulars. Concretament, la meva recerca ha estat enfocada principalment a l'estudi de cadenes de siRNA modificades amb nucleobases 5-metil i 5-propinil pirimidíniques. Es tractava d'avaluar l'efecte que exerceixen els factors estèrics en el major groove (solc major) dels siRNAs sobre la seva activitat biològica. En aquest sentit, he dut aterme síntesi de fosforamidits de nucleòsis pirimidínics modificats a la posició C-5 de la nucleobase. A continuació he incorporat aquestes unitats nucleosídiques en cadenes d'ARN emprant un sintetitzador d’ADN/ARN i he estudiat l'estabilitat dels corresponents dúplexs d'ARN mitjançant experiments de desnaturalització tèrmica. Finalment he dut a terme experiments d'inhibició de l'expressió gènica en cèl.lules HeLa per tal d'avaluar l'activitat biològia d'aquests siRNAs modificats. Els resultats d'aquests estudis han posat de manifest que la presència de grups voluminosos com el propinil a l'extrem 5' del dúplex de siRNA (definit per la cadena guia o antisense) influeix de forma molt negativa en la seva activitat biològica. En canvi, grups menys voluminosos com el metil hi influeixen positivament, de manera que algunes de les cadenes sintetitzades han resultat ser més actives que els corresponents siRNAs naturals (wild type siRNAs). A més, aquest tipus de modificació contribueix positivament en l'estabilitat de cadenes de siRNA en sèrum humà. Aquest treball ha estat publicat (Terrazas, M.; Kool, E.T. "Major Groove Modifications Improve siRNA Stability and Biological Activity" Nucleic Acids Res. 2009, in press).

WEB Cas Pràctic boo-k : Gestió d'una Botiga Virtual

L'objectiu d'aquest treball és especificar, dissenyar i implementar una aplicació web que permeti l'operativa real dels serveis de gestió d'una botiga virtual d'Internet, amb el suport d'un sistema de gestió de bases de dades.

A system to evaluate the accuracy of a visual mosaicking methodology

When underwater vehicles navigate close to the ocean floor, computer vision techniques can be applied to obtain motion estimates. A complete system to create visual mosaics of the seabed is described in this paper. Unfortunately, the accuracy of the constructed mosaic is difficult to evaluate. The use of a laboratory setup to obtain an accurate error measurement is proposed. The system consists on a robot arm carrying a downward looking camera. A pattern formed by a white background and a matrix of black dots uniformly distributed along the surveyed scene is used to find the exact image registration parameters. When the robot executes a trajectory (simulating the motion of a submersible), an image sequence is acquired by the camera. The estimated motion computed from the encoders of the robot is refined by detecting, to subpixel accuracy, the black dots of the image sequence, and computing the 2D projective transform which relates two consecutive images. The pattern is then substituted by a poster of the sea floor and the trajectory is executed again, acquiring the image sequence used to test the accuracy of the mosaicking system

Accuracy estimation of a new omnidirectional 3D vision sensor

We present a computer vision system that associates omnidirectional vision with structured light with the aim of obtaining depth information for a 360 degrees field of view. The approach proposed in this article combines an omnidirectional camera with a panoramic laser projector. The article shows how the sensor is modelled and its accuracy is proved by means of experimental results. The proposed sensor provides useful information for robot navigation applications, pipe inspection, 3D scene modelling etc

K.O. Apel: transcendentalisme i praxi de la veritat.

L'objectiu d'aquest treball és explicar i fer la crítica de la Teoria de la Veritat recentment defensada per Apel. En primer lloc, el consens i pragmàtica de la Teoria de la Veritat d'Apel es presenta en relació amb el projecte de la Teoria Crítica de la Societat de Habermas i el problema dels fonaments en el raonament ètic. En segon lloc, la seva versió idealitzada i transcendental de la Veritat que invoca la noció de convergència en una comunitat ideal d'investigadors lliures és analitzada. Finalment, les entranyes de l'esperit wingensteinià i després de l'últim anàlisi de Putnam, s’ha intentat fer una avaluació crítica. El resultat de tot això serà una més modesta concepció de la Veritat com a tan sols una qualitat de la praxi lingüística humana, però no la seva primera pedra

Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories

The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way,one can mimick the presymplectic constraint algorithm to obtain a constraint algorithmthat can be applied to k-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations offield theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.

Videojocs educatius : configuració del perfil del jugador en la plataforma de videojocs educatius K-Pax

Aquest treball presenta una forma de gestionar el perfil dels usuaris de l'aplicació gestora de videojocs educatius en xarxa k-Pax. Paral·lelament al desenvolupament del codi es realitza la documentació de gran part de la plataforma existent, de les accions necessàries per poder tenir-la en mode local i es mostren algunes guies per futurs desenvolupaments.

Programa de gestión de juegos para la plataforma k-PAX

Este proyecto es una mejora sobre la plataforma k-Pax para tratar de realizar búsquedas avanzadas sobre los juegos educativos alojados en la misma.

Mejoras de funcionalidades en la gestión de usuariosde la plataforma K-PAX

Esta memoria trata de las mejoras propuestas en la plataforma educativa kPax de la UOC referentes a la gestión de usuarios.