Individual versus group strategy-proofness: when do they coincide?

A social choice function is group strategy-proof on a domain if no group of agents can manipulate its final outcome to their own benefit by declaring false preferences on that domain. Group strategy-proofness is a very attractive requirement of incentive compatibility. But in many cases it is hard or impossible to find nontrivial social choice functions satisfying even the weakest condition of individual strategy-proofness. However, there are a number of economically significant domains where interesting rules satisfying individual strategy-proofness can be defined, and for some of them, all these rules turn out to also satisfy the stronger requirement of group strategy-proofness. This is the case, for example, when preferences are single-peaked or single-dipped. In other cases, this equivalence does not hold. We provide sufficient conditions defining domains of preferences guaranteeing that individual and group strategy-proofness are equivalent for all rules defined on the

Dynamics in Thompson's group F

We describe an explicit relationship between strand diagrams and piecewise-linear functions for elements of Thompson’s group F. Using this correspondence, we investigate the dynamics of elements of F, and we show that conjugacy of one-bump functions can be described by a Mather-type invariant.

The loop group and the cobar construction

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

Singular integrals on Ahlfors-David regular subsets of the Heisenberg group

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

An irreducibility criterion for group representations, with arithmetic applications

We prove a criterion for the irreducibility of an integral group representation p over the fraction field of a noetherian domain R in terms of suitably defined reductions of p at prime ideals of R. As applications, we give irreducibility results for universal deformations of residual representations, with a special attention to universal deformations of residual Galois representations associated with modular forms of weight at least 2.

Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results

We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges consist of two alternatives, in terms of two types of basic properties.

Segmentació d'imatge de ressonància magnètica de pit utilitzant atlas probabilístic

La localització d'òrgans és un tòpic important en l'àmbit de la imatge mèdica per l'ajuda del tractament i diagnosi del càncer. Un exemple es pot trobar en la cal•libració de models farmacoquinètics. Aquesta pot ésser realitzada utilitzant un teixit de referència, on, per exemple en imatges de ressonància magnètica de pit, una correcta segmentació del múscul pectoral és necessària per a la detecció de signes de malignitat. Els mètodes de segmentació basat en atlas han estat altament avaluats en imatge de ressonància magnètica de cervell, obtenint resultats satisfactoris. En aquest projecte, en col•laboració amb el el Diagnostic Image Analysis Group de la Radboud University Nijmegen Medical Centre i la supervisió del Dr. N.Karssemeijer, es presenta la primera aproximació d'un mètode de segmentació basat en atlas per segmentar els diferents teixits visibles en imatges de ressonància magnètica (T1) del pit femení. L'atlas consisteix en 5 estructures (teixit greixòs, teixit dens, cor, pulmons i múscul pectoral) i ha estat utilitzat en un algorisme de segmentació Bayesià per tal de delinear les esmentades estructures. A més a més, s'ha dut a terme una comparació entre un mètode de registre global i un de local, utilitzats tant en la construcció de l'atlas com en la fase de segmentació, essent el primer el que ha presentat millors resultats en termes d'eficiència i precisió. Per a l'avaluació, s'ha dut a terme una comparació visual i numèrica entre les segmentacions obtingudes i les realitzades manualment pels experts col•laboradors. Pel que fa a la numèrica, s'ha emprat el coeficient de similitud de Dice ( mesura que dóna valors entre 0 i 1, on 0 significa no similitud i 1 similitud màxima) i s'ha obtingut una mitjana general de 0.8. Aquest resultat confirma la validesa del mètode presentat per a la segmentació d'imatges de ressonància magnètica del pit.

Improving Clustering Algorithms for Image Segmentation using Contour and Region Information

In image segmentation, clustering algorithms are very popular because they are intuitive and, some of them, easy to implement. For instance, the k-means is one of the most used in the literature, and many authors successfully compare their new proposal with the results achieved by the k-means. However, it is well known that clustering image segmentation has many problems. For instance, the number of regions of the image has to be known a priori, as well as different initial seed placement (initial clusters) could produce different segmentation results. Most of these algorithms could be slightly improved by considering the coordinates of the image as features in the clustering process (to take spatial region information into account). In this paper we propose a significant improvement of clustering algorithms for image segmentation. The method is qualitatively and quantitative evaluated over a set of synthetic and real images, and compared with classical clustering approaches. Results demonstrate the validity of this new approach

An information theoretic framework for image segmentation

In this paper, an information theoretic framework for image segmentation is presented. This approach is based on the information channel that goes from the image intensity histogram to the regions of the partitioned image. It allows us to define a new family of segmentation methods which maximize the mutual information of the channel. Firstly, a greedy top-down algorithm which partitions an image into homogeneous regions is introduced. Secondly, a histogram quantization algorithm which clusters color bins in a greedy bottom-up way is defined. Finally, the resulting regions in the partitioning algorithm can optionally be merged using the quantized histogram

Rank estimation of trajectory matrix in motion segmentation

A novel technique for estimating the rank of the trajectory matrix in the local subspace affinity (LSA) motion segmentation framework is presented. This new rank estimation is based on the relationship between the estimated rank of the trajectory matrix and the affinity matrix built with LSA. The result is an enhanced model selection technique for trajectory matrix rank estimation by which it is possible to automate LSA, without requiring any a priori knowledge, and to improve the final segmentation

Enhanced Model Selection for motion segmentation

In this paper a novel rank estimation technique for trajectories motion segmentation within the Local Subspace Affinity (LSA) framework is presented. This technique, called Enhanced Model Selection (EMS), is based on the relationship between the estimated rank of the trajectory matrix and the affinity matrix built by LSA. The results on synthetic and real data show that without any a priori knowledge, EMS automatically provides an accurate and robust rank estimation, improving the accuracy of the final motion segmentation

Sistema de votació electrònica sobre corbes el·líptques amb mescla de vots mitjançant Random Group Full Checking

L'objectiu del treball és dissenyar i implementar un sistema de simulació de votació electrònica, emprant una adaptació sobre corbes el·líptiques del criptosistema ElGamal, per tal d'estudiar-ne la viabilitat, centrant l'atenció en temes de seguretat, especialment en el procés de mescla de vots per tal de desvincular un vot de la persona que l'ha emès.

Internal test sets studies in a group of antimalarials

Topological indices have been applied to build QSAR models for a set of 20 antimalarial cyclic peroxy cetals. In order to evaluate the reliability of the proposed linear models leave-n-out and Internal Test Sets (ITS) approaches have been considered. The proposed procedure resulted in a robust and consensued prediction equation and here it is shown why it is superior to the employed standard cross-validation algorithms involving multilinear regression models

Multi-scale label interaction to improve object detection and segmentation

The project aims at advancing the state of the art in the use of context information for classification of image and video data. The use of context in the classification of images has been showed of great importance to improve the performance of actual object recognition systems. In our project we proposed the concept of Multi-scale Feature Labels as a general and compact method to exploit the local and global context. The feature extraction from the discriminative probability or classification confidence label field is of great novelty. Moreover the use of a multi-scale representation of the feature labels lead to a compact and efficient description of the context. The goal of the project has been also to provide a general-purpose method and prove its suitability in different image/video analysis problem. The two-year project generated 5 journal publications (plus 2 under submission), 10 conference publications (plus 2 under submission) and one patent (plus 1 pending). Of these publications, a relevant number make use of the main result of this project to improve the results in detection and/or segmentation of objects.