Income maintenance programs and multidimensional screening

This paper examines properties of optimal poverty assistance programs under different informational environments using an income maintenanceframework. To that end, we make both the income generating ability andthe disutility of labor of individuals unobservable, and compare theresulting benefit schedules with those of programs found in the UnitedStates since Welfare Reform (1996). We find that optimal programs closelyresemble a Negative Income Tax with a Benefit Reduction rate that dependson the distribution of population characteristics. A policy of workfare(unpaid public sector work) is inefficient when disutility of labor isunobservable, but minimum work requirements (for paid work) may be usedin that same environment. The distortions to work incentives and thepresence of minimum work requirements depend on the observability andrelative importance of the population's characteristics.

The social value of health programs: Is age a relevant factor?

In cost-effectiveness analysis (CEA) it is usually assumed that a QALY is of equal value to everybody, irrespective of the patient's age. However, it is possible that society assigns different social values to a QALY according to who gets it. In this paper we discuss the possibility of weighting health benefits for age in CEA. We also examinethe possibility that age-related preferences depend on the size of the health gain. An experiment was performedto test these hypotheses. The results assessing suggest that the patient's age is a relevant factor when assessing health gains.

Elaboració d'indicadors sobre SAGE Logic Class

El treball desenvolupat ha consistit en analitzar el sistema d'informació Logic Class sota la perspectiva de la necessitat de construir un sistema d'indicadors (quadre de comandament operatiu) que integri informació de les diferents fonts de dades.

Escacs, un sistema intel·ligent

Des dels inicis dels ordinadors com a màquines programables, l’home ha intentat dotar-los de certa intel•ligència per tal de pensar o raonar el més semblant possible als humans. Un d’aquests intents ha sigut fer que la màquina sigui capaç de pensar de tal manera que estudiï jugades i guanyi partides d’escacs. En l’actualitat amb els actuals sistemes multi tasca, orientat a objectes i accés a memòria i gràcies al potent hardware del que disposem, comptem amb una gran varietat de programes que es dediquen a jugar a escacs. Però no hi ha només programes petits, hi ha fins i tot màquines senceres dedicades a calcular i estudiar jugades per tal de guanyar als millors jugadors del món. L’objectiu del meu treball és dur a terme un estudi i implementació d’un d’aquests programes, per això es divideix en dues parts. La part teòrica o de l’estudi, consta d’un estudi dels sistemes d’intel•ligència artificial que es dediquen a jugar a escacs, estudi i cerca d’una funció d’avaluació vàlida i estudi dels algorismes de cerca. La part pràctica del treball es basa en la implementació d’un sistema intel•ligent capaç de jugar a escacs amb certa lògica. Aquesta implementació es porta a terme amb l’ajuda de les llibreries SDL, utilitzant l’algorisme minimax amb poda alfa-beta i codi c++. Com a conclusió del projecte m’agradaria remarcar que l’estudi realitzat m’ha deixat veure que crear un joc d’escacs no era tan fàcil com jo pensava però m’ha aportat la satisfacció d’aplicar tot el que he après durant la carrera i de descobrir moltes altres coses noves.

PGC-1α induces mitochondrial and myokine transcriptional programs and lipid droplet and glycogen accumulation in cultured human skeletal muscle cells

The transcriptional coactivator peroxisome proliferator-activated receptor-gamma coactivator 1 alpha (PGC-1α) is a chief activator of mitochondrial and metabolic programs and protects against atrophy in skeletal muscle (skm). Here we tested whether PGC-1α overexpression could restructure the transcriptome and metabolism of primary cultured human skm cells, which display a phenotype that resembles the atrophic phenotype. An oligonucleotide microarray analysis was used to reveal the effects of PGC-1α on the whole transcriptome. Fifty-three different genes showed altered expression in response to PGC-1α: 42 upregulated and 11 downregulated. The main gene ontologies (GO) associated with the upregulated genes were mitochondrial components and processes and this was linked with an increase in COX activity, an indicator of mitochondrial content. Furthermore, PGC-1α enhanced mitochondrial oxidation of palmitate and lactate to CO2, but not glucose oxidation. The other most significantly associated GOs for the upregulated genes were chemotaxis and cytokine activity, and several cytokines, including IL-8/CXCL8, CXCL6, CCL5 and CCL8, were within the most highly induced genes. Indeed, PGC-1α highly increased IL-8 cell protein content. The most upregulated gene was PVALB, which is related to calcium signaling. Potential metabolic regulators of fatty acid and glucose storage were among mainly regulated genes. The mRNA and protein level of FITM1/FIT1, which enhances the formation of lipid droplets, was raised by PGC-1α, while in oleate-incubated cells PGC-1α increased the number of smaller lipid droplets and modestly triglyceride levels, compared to controls. CALM1, the calcium-modulated δ subunit of phosphorylase kinase, was downregulated by PGC-1α, while glycogen phosphorylase was inactivated and glycogen storage was increased by PGC-1α. In conclusion, of the metabolic transcriptome deficiencies of cultured skm cells, PGC-1α rescued the expression of genes encoding mitochondrial proteins and FITM1. Several myokine genes, including IL-8 and CCL5, which are known to be constitutively expressed in human skm cells, were induced by PGC-1α.

The burnout syndrome and associated personality disturbances. The study in three graduate programs in Dentistry at the University of Barcelona

Objective: Determine the presence of"burnout" syndrome and characteristic personality patterns in the students and faculty of three graduate programs in Dentistry at the University of Barcelona: Department of Oral Surgery and Implantology, Department of Orthodontics and Department of Integrated Dentistry. Materials and Methods: The study was carried out in 78 dentists. The level of"burnout" was evaluated using the Maslach Burnout Inventory, socio-demographic variables and, finally, the personality test. Results: Oral surgeons constituted the group of highlevel"burnout". The profile of an individual with a propensity to"burn out" is a single man, with a median age of 27, that is in the first years of the graduate program and that combines studies with 30 hours of clinical practice and/or other work (p<0,05). Narcissistic and borderline are the types of personality most frequently found in the individuals that present"burnout" syndrome (p<0,05). Conclusions: In general, no high levels of"burnout" were registered in the studied population, only 2-3%, if applying strict definition of"burnout", and 10% if these criteria were amplified. We believe it is necessary to identify the individuals with a tendency towards"burnout", in order to establish preventive measures and avoid future negative behaviour at work as well as at the personal level.

Implantació d'un sistema SCADA en una cèl·lula flexible de fabricació

La Universitat de Vic disposa, entre altres equips, d’una cèl·lula flexible de fabricació, del fabricant Festo, que simula un procés de formació de palets amb els productes que es disposen en un magatzem intermedi. Aquesta cèl·lula està composta de quatre estacions de muntatge diferenciades (càrrega de palets, càrrega de plaques, magatzem intermedi i transport). Cada una disposa d'un PLC SIEMENS S7-300 per la seva automatització, i tots aquests es troben interconnectats amb una xarxa industrial Profibus. L'objectiu d'aquest projecte és implantar el sistema SCADA Vijeo Citect pel control i supervisió de l'estació magatzem d'aquesta cèl·lula flexible de fabricació, establint també un intercanvi de dades entre l'SCADA i el Microsoft Access, per poder ser utilitzat per la docència. Aquest projecte s'ha desenvolupat en cinc fases diferents: 1. La primera fase s'ha dedicat a l'automatització pròpiament de l'estació magatzem a partir de l'autòmat programable Siemens S7-300 i complint amb les necessitats plantejades. 2. En la segona fase s'ha programat i establert la comunicació per l'intercanvi de dades (lectura i escriptura) entre el sistema SCADA Vijeo Citect i la base de dades de Microsoft Access. 3. En la tercera fase s'ha elaborat i programat l'entorn gràfic de supervisió i control del procés a partir del sistema SCADA Vijeo Citect. 4. En la quarta fase s'ha instal·lat un OPC Server en el PC i s'ha establert la comunicació entre el PLC i el sistema SCADA. 5. Finalment s'ha anat revisant i depurant les diferents programacions i comunicacions per tal de que el sistema funcioni com a un conjunt.

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.

Power supply noise and logic error probability

Voltage fluctuations caused by parasitic impedances in the power supply rails of modern ICs are a major concern in nowadays ICs. The voltage fluctuations are spread out to the diverse nodes of the internal sections causing two effects: a degradation of performances mainly impacting gate delays anda noisy contamination of the quiescent levels of the logic that drives the node. Both effects are presented together, in thispaper, showing than both are a cause of errors in modern and future digital circuits. The paper groups both error mechanismsand shows how the global error rate is related with the voltage deviation and the period of the clock of the digital system.

Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants

PLFC is a first-order possibilistic logic dealing with fuzzy constants and fuzzily restricted quantifiers. The refutation proof method in PLFC is mainly based on a generalized resolution rule which allows an implicit graded unification among fuzzy constants. However, unification for precise object constants is classical. In order to use PLFC for similarity-based reasoning, in this paper we extend a Horn-rule sublogic of PLFC with similarity-based unification of object constants. The Horn-rule sublogic of PLFC we consider deals only with disjunctive fuzzy constants and it is equipped with a simple and efficient version of PLFC proof method. At the semantic level, it is extended by equipping each sort with a fuzzy similarity relation, and at the syntactic level, by fuzzily “enlarging” each non-fuzzy object constant in the antecedent of a Horn-rule by means of a fuzzy similarity relation.

Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One interesting alternative for solving this limitation is the use of PGL+, a possibilistic logic over Gödel logic extended with fuzzy constants. Fuzzy constants in PGL+ allow expressing disjunctive information about the unknown value of a variable, in the sense of a magnitude, modelled as a (unary) predicate. The aim of this article is twofold: firstly, we formalize DePGL+, a possibilistic defeasible logic programming language that extends P-DeLP through the use of PGL+ in order to incorporate fuzzy constants and a fuzzy unification mechanism for them. Secondly, we propose a way to handle conflicting arguments in the context of the extended framework.

A logic programming framework for possibilistic argumentation: formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied

Optimización y aproximación al problema de la regresión simbólica a través de Straight Line Programs (SLP's) y algoritmos genéticos : Entrenamiento genético de SLP's

El problema de la regresión simbólica consiste en el aprendizaje, a partir de un conjunto muestra de datos obtenidos experimentalmente, de una función desconocida. Los métodos evolutivos han demostrado su eficiencia en la resolución de instancias de dicho problema. En este proyecto se propone una nueva estrategia evolutiva, a través de algoritmos genéticos, basada en una nueva estructura de datos denominada Straight Line Program (SLP) y que representa en este caso expresiones simbólicas. A partir de un SLP universal, que depende de una serie de parámetros cuya especialización proporciona SLP's concretos del espacio de búsqueda, la estrategia trata de encontrar los parámetros óptimos para que el SLP universal represente la función que mejor se aproxime al conjunto de puntos muestra. De manera conceptual, este proyecto consiste en un entrenamiento genético del SLP universal, utilizando los puntos muestra como conjunto de entrenamiento, para resolver el problema de la regresión simbólica.