Computing Markov-Perfect Optimal Policies in Business-Cycle Models

Time-inconsistency is an essential feature of many policy problems (Kydland and Prescott, 1977). This paper presents and compares three methods for computing Markov-perfect optimal policies in stochastic nonlinear business cycle models. The methods considered include value function iteration, generalized Euler-equations, and parameterized shadow prices. In the context of a business cycle model in which a scal authority chooses government spending and income taxation optimally, while lacking the ability to commit, we show that the solutions obtained using value function iteration and generalized Euler equations are somewhat more accurate than that obtained using parameterized shadow prices. Among these three methods, we show that value function iteration can be applied easily, even to environments that include a risk-sensitive scal authority and/or inequality constraints on government spending. We show that the risk-sensitive scal authority lowers government spending and income-taxation, reducing the disincentive households face to accumulate wealth.

Monitorització d'alt nivell per a el computing de l'experiment ATLAS (LHC)

Aquest projecte descriu la fusió de les necessitats diaries de monitorització del experiment ATLAS des del punt de vista del cloud. La idea principal es desenvolupar un conjunt de col·lectors que recullin informació de la distribució i processat de les dades i dels test de wlcg (Service Availability Monitoring), emmagatzemant-la en BBDD específiques per tal de mostrar els resultats en una sola pàgina HLM (High Level Monitoring). Un cop aconseguit, l’aplicació ha de permetre investigar més enllà via interacció amb el front-end, el qual estarà alimentat per les estadístiques emmagatzemades a la BBDD.

Evaluation of DNA Recombinant Methodologies for the Diagnosis of Plasmodium falciparum and their Comparison with the Microscopy Assay

Since 1984, DNA tests based on the highly repeated subtelomeric sequences of Plasmodium falciparum (rep 20) have been frequently used in malaria diagnosis. Rep 20 is very specific for this parasite, and is made of 21 bp units, organized in repeated blocks with direct and inverted orientation. Based in this particular organization, we selected a unique consensus oligonucleotide (pf-21) to drive a PCR reaction coupled to hybridization to non-radioactive labeled probes. The pf-21 unique oligo PCR (pf-21-I) assay produced DNA amplification fingerprints when was applied on purified P. falciparum DNA samples (Brazil and Colombia), as well as in patient's blood samples from a large area of Venezuela. The performance of the Pf-21-I assay was compared against Giemsa stained thick blood smears from samples collected at a malaria endemic area of the Bolívar State, Venezuela, at the field station of Malariología in Tumeremo. Coupled to non-radioactive hybridization the pf-21-I performed better than the traditional microscopic method with a r=1.7:1. In the case of mixed infections the r value of P. falciparum detection increased to 2.5:1. The increased diagnostic sensitivity of the test produced with this homologous oligonucleotide could provide an alternative to the epidemiological diagnosis of P. falciparum being currently used in Venezuela endemic areas, where low parasitemia levels and asymptomatic malaria are frequent. In addition, the DNA fingerprint could be tested in molecular population studies

Computing hypergraph width measures exactly

Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tree decompositions of graphs to the case of hypergraphs and obtain fast exact algorithms. As a consequence, we provide algorithms which, given a hypergraph H on n vertices and m hyperedges, compute the generalized hypertree-width of H in time O*(2n) and compute the fractional hypertree-width of H in time O(1.734601n.m).1

The Challenges and Benefits of Using Quantitative Research and Evaluation Methodologies in an Organisational Context

Barnardos supports children whose well-being is under threat, by working with them, their families and communities and by campaigning for the rights of children. Barnardos was established in Ireland in 1962 and is Ireland’s leading independent Children's charity.  

Actualització tecnológica : una evolució cap al Green Computing

El projecte que es presenta a continuació és una planificació de migració de servidors físics a un entorn virtualitzat, allà on sigui possible. A més s'ha plantejat una renovació tecnològica de tot el parc de servidors per estalviar diners en el manteniment i en el consum d'energia.La solució de virtualització es buscarà que sigui programari lliure.

OpenNebula y Hadoop : Cloud Computing con herramientas Open Source

El presente proyecto consiste en una introducción al "cloud computing" y un estudio en profundidad de las herramientas OpenNebula, dentro del modelo IaaS (Infraestructure as a Service), y Hadoop, dentro del modelo PaaS (Platform as a Service). El trabajo también incluye la instalación, integración, configuración y puesta en marcha de una plataforma "cloud computing" utilizando OpenNebula y Hadoop con el objetivo de aplicar los conceptos teóricos en una solución real dentro de un entorno de laboratorio que puede ser extrapolable a una instalación real.

An anonymous reputation mechanism for cloud computing networks using volunteer resources

One of the major problems when using non-dedicated volunteer resources in adistributed network is the high volatility of these hosts since they can go offlineor become unavailable at any time without control. Furthermore, the use ofvolunteer resources implies some security issues due to the fact that they aregenerally anonymous entities which we know nothing about. So, how to trustin someone we do not know?.Over the last years an important number of reputation-based trust solutionshave been designed to evaluate the participants' behavior in a system.However, most of these solutions are addressed to P2P and ad-hoc mobilenetworks that may not fit well with other kinds of distributed systems thatcould take advantage of volunteer resources as recent cloud computinginfrastructures.In this paper we propose a first approach to design an anonymous reputationmechanism for CoDeS [1], a middleware for building fogs where deployingservices using volunteer resources. The participants are reputation clients(RC), a reputation authority (RA) and a certification authority (CA). Users needa valid public key certificate from the CA to register to the RA and obtain thedata needed to participate into the system, as now an opaque identifier thatwe call here pseudonym and an initial reputation value that users provide toother users when interacting together. The mechanism prevents not only themanipulation of the provided reputation values but also any disclosure of theusers' identities to any other users or authorities so the anonymity isguaranteed.

Preventive medicine for epidemic outbreaks and risky behavior through mobile devices and ubiquitous computing

In this work, we have developed the first free software for mobile devices with the Android operating system that can preventively mitigate the number of contagions of sexually transmitted infections (STI), associated with risk behavior. This software runs in two modes. The normal mode allows the user to see the alerts and nearby health centers. The second mode enables the service to work in the background. This software reports the health risks, as well as the location of different test centers.

Evaluación de la disponibilidad de los servicios desplegados sobre Volunteer Computing

Implementación y evaluación de un algoritmo híbrido que selecciona el conjunto de nodos de menor coste que permite desplegar un servicio, con una disponibilidad determinada, en un entorno de computación voluntaria.

Tecnologies de cloud computing Openstack/StackOps

El propòsit d'aquest TFC és investigar i fer una instal·lació des de zero d'un model de negoci basat en l'allotjament web fent servir tecnologies de Cloud Computing. El software open-source que es farà servir per aquesta finalitat serà Openstack el qual es basa en un model de servei com infraestructura (IaaS). La nostra finalitat és poder implementar el model IaaS basat en Openstack. Per duu a terme aquest desplegament es farà servir dos hipervisors (KVM i VMware ESXi) per tal de testejar diferents sistemes d¿hipervisors treballant conjuntament.

Review of Alternative Distribution Methodologies for the Street Construction Fund of the Cities, December 26, 2003

Review of Alternative Distribution Methodologies for the Street Construction Fund of the Cities