On group strategy-proof mechanisms for a many-to-one matching model

For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of preferences (which contains the domain of responsive preferences of the college admissions problem) the workers-optimal stable matching is weakly Pareto optimal for the workers and the Blocking Lemma holds as well. We exhibit an example showing that none of these three results remain true if the preferences of firms are substitutable but not quota q-separable.

Regulación del proceso de secado de embutidos crudos-curados mediante la aplicación de lógica borrosa (fuzzy logic)

El presente proyecto tenía como objetivo final el desarrollo de un sistema de control basado en Lógica Fuzzy que permita que el proceso de secado tenga una regulación continua y con una menor dependencia de la experiencia del personal experto, evitando además la formación de encostrado. Asimismo, se plantearon una serie de objetivos parciales, cuya consecución permitiría, además de alcanzar el objetivo final descrito, obtener un conocimiento científico adicional. Por ello, a continuación se resumen los resultados en relación con los objetivos parciales propuestos. Como paso previo, antes de abordar los objetivos planteados se diseñó y construyó un equipo experimental de secado, donde se controló de forma precisa la temperatura, la humedad relativa y la velocidad del aire.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

Continuity of set-valued maps revisited in the light of tame geometry

Continuity of set-valued maps is hereby revisited: after recalling some basic concepts of variational analysis and a short description of the State-of-the-Art, we obtain as by-product two Sard type results concerning local minima of scalar and vector valued functions. Our main result though, is inscribed in the framework of tame geometry, stating that a closed-valued semialgebraic set-valued map is almost everywhere continuous (in both topological and measure-theoretic sense). The result –depending on stratification techniques– holds true in a more general setting of o-minimal (or tame) set-valued maps. Some applications are briefly discussed at the end.

L'aprenentatge basat en problemes (PBL) en la regulació del metabolisme. Desenvolupament del portal per a l'intercanvi d'experiències en PBL en ciències biomèdiques

L’aprenentatge basat en problemes està en fase experimental en tot el món i és objecte d’anàlisi i reflexió en moltes reunions internacionals. Tanmateix, no hi ha massa feina feta en aquesta direcció en el nostre camp més proper. Hem elaborat problemes per l’aprenentatge de la Regulació del Metabolisme i els hem incorporat a un porta virtual (http://www.ub.edu/GID-BBM). La finalitat d’aquesta estratègia és que mitjançant l’aprenentatge basat en problemes reals o simulacions de problemes reals s’aconsegueixi motivar l’alumnat a treballar de forma continuada durant tot el curs. La millora dels resultats acadèmics haurà de ser la conseqüència lògica d’aquest treball. La finalitat última del projecte que hem desenvolupat és preparar l’alumnat per la seva futura activitat professional a on serà molt important i valorat la seva capacitat de resposta davant de diferents problemes

Les communautés bulu contre la plantation industrielle HEVECAM au Cameroun

In 1975 the Kribi region (Southern Cameroon) became host of the rubber plantation HEVECAM, the third largest employer in Cameroon. The establishment of the plantation has been preceded by the expropriation of customary land and by the destruction of the rainforest used by local populations. As a result, conflicts – mostly latent – pitting neighbouring Bulu communities against the plantation have occurred, especially during the last few years. Drawing on fieldwork data as well as on anthropological, economic and historical materials, I try to explore a new way of looking at such environmental conflicts by arguing that they reflect the struggle between two distinct institutional logics with different impacts on the environment, i.e. the logic of property versus the one of possession. In short, the logic of possession corresponds to a multi-functional community-based forest management, while the logic of property gave birth to the commercial monoculture model, the highest stage of the transformation of an ecosystem in order to match the requirements of property. It is argued that the conflict between the logic of possession and the logic of property is at the heart of many cases of “environmentalisms of the poor” that arise in reaction to “development”.

A Many-to-many 'rural hospital theorem'

We show that the full version of the so-called 'rural hospital theorem' (Roth, 1986) generalizes to many-to-many matching where agents on both sides of the market have separable and substitutable preferences.

Optimització d'una aplicació bioinformàtica d'aliniament de seqüències executada en processadors many-core (GPUs)

Las herramientas de análisis de secuencias genómicas permiten a los biólogos identificar y entender regiones fundamentales que tienen implicación en enfermedades genéticas. Actualmente existe una necesidad de dotar al ámbito científico de herramientas de análisis eficientes. Este proyecto lleva a cabo una caracterización y análisis del rendimiento de algoritmos utilizados en la comparación de secuencias genómicas completas, y ejecutadas en arquitecturas MultiCore y ManyCore. A partir del análisis se evalúa la idoneidad de este tipo de arquitecturas para resolver el problema de comparar secuencias genómicas. Finalmente se propone una serie de modificaciones en las implementaciones de estos algoritmos con el objetivo de mejorar el rendimiento.

Optimització d'una aplicacio bioinformàtica d'alineament de seqüències executada en processadors multi-core i many-core (GPUs)

Las aplicaciones de alineamiento de secuencias son una herramienta importante para la comunidad científica. Estas aplicaciones bioinformáticas son usadas en muchos campos distintos como pueden ser la medicina, la biología, la farmacología, la genética, etc. A día de hoy los algoritmos de alineamiento de secuencias tienen una complejidad elevada y cada día tienen que manejar un volumen de datos más grande. Por esta razón se deben buscar alternativas para que estas aplicaciones sean capaces de manejar el aumento de tamaño que los bancos de secuencias están sufriendo día a día. En este proyecto se estudian y se investigan mejoras en este tipo de aplicaciones como puede ser el uso de sistemas paralelos que pueden mejorar el rendimiento notablemente.

Anàlisi. Disseny i implementació d'una utilitat de Workflow aplicat a una web de gestió d'un centre de Reclamacions i Queixes mitjançant J2EE : una solució amb Struts i EJBs

El treball final de carrera està compost de l¿anàlisi, disseny i implementació d'una utilitat de Workflow que dóna servei a una web per gestionar les reclamacions i queixes d'una empresa. La part del Workflow s'ha pensat per ser totalment configurable a les particularitats d'un determinat aplicatiu i per donar servei a tantes aplicacions com faci falta simultàniament.L'anàlisi i el disseny s'han basat en la metodologia UML dins el paradigma de l'Orientació a Objectes juntament amb diversos patrons de disseny com pot ser el MVC que ha permès separar completament la lògica de negoci (Workflow) de la presentació (Web). Per les 2 parts: Workflow i web s¿ha fet ús d'una arquitectura distribuïda.

A Classification of Tools for Learning Logic

A table showing a comparison and classification of tools (intelligent tutoring systems) for e-learning of Logic at a college level.

A genealogical conceptual model using ontologies

Roughly fifteen years ago, the Church of Jesus Christ of Latter-day Saints published a new proposed standard file format. They call it GEDCOM. It was designed to allow different genealogy programs to exchange data.Five years later, in may 2000, appeared the GENTECH Data Modeling Project, with the support of the Federation of Genealogical Societies (FGS) and other American genealogical societies. They attempted to define a genealogical logic data model to facilitate data exchange between different genealogical programs. Although genealogists deal with an enormous variety of data sources, one of the central concepts of this data model was that all genealogical data could be broken down into a series of short, formal genealogical statements. It was something more versatile than only export/import data records on a predefined fields. This project was finally absorbed in 2004 by the National Genealogical Society (NGS).Despite being a genealogical reference in many applications, these models have serious drawbacks to adapt to different cultural and social environments. At the present time we have no formal proposal for a recognized standard to represent the family domain.Here we propose an alternative conceptual model, largely inherited from aforementioned models. The design is intended to overcome their limitations. However, its major innovation lies in applying the ontological paradigm when modeling statements and entities.

The Decision on Turkish EU accession in December 2002: The logic of anarchy, collective action problems and rhetorical action

Studies of the EU accession of the East and Central European Countries have stressed the importance of neo-liberal institutionalism as an explanation for Member State preferences. In this paper it is argued that Member States’ preferences over Turkish EU accession are better explained by power politics and neo-realism. It seems therefore that Turkey’s way to the EU follows another path than the East and Central Countries. Turkish accession raises the question of the EU’s role in a uni-polar world order – whether the EU should develop into an independent actor on the world stage or not. However, when it comes to the interaction among the Member States in order to decide on when to open accession negotiations with Turkey the constitutive values of the EU seriously modify the outcome that pure power politics would have let to.