The use of COOP/WONCA charts as a screen for mental disorders in the immigrant community in primary care in primary care

Aim. To evaluate the usefulness of COOP/WONCA charts as a screening tool for mental disorders in primary care in the immigrant healthcare users in Salt. To measure self-rated health of Salt immigration population using the COOP / WONCA charts and to assess its associated factorsDesign. Descriptive and transversal studyParticipants. 370 non-EU immigrants seniors selected by consecutive sampling stratified by sexMain measures. Personal information will be collected (age, sex, country of origin, years of residency in Spain, number of people living in the household and associated comorbidities). Each participant will complete the COOP/WONCA charts. An analysis of the validity of the diagnostic test will be done: sensibility, specificity, positive predictive value, negative predictive value, ROC curve and area under the curve (AUC). All variables will be subjected to descriptive analysis. Bivariate and multivariate analysis between the variables collected (sex, years of residency in Spain... ) and the results of COOP / WONCA charts will be performedResults. Preliminary results are available on a pilot test with 30 patients. The mental disorder prevalence is around 30%. Sensibility (0,89), specificity (0,89), VPP (0,80), VPN (0,94) cutoff score (3.5) and AUC (0,941). Women, people with 10 or more years of residency in Spain and unemployed people have worse self-rated healthConclusions. Based on the preliminary results, is possible to conclude that COOP/WONCA charts could be an useful, valid and applicable screening test for mental disorders in primary care with immigrant population

The use of COOP/WONCA charts as a screen for mental disorders in the immigrant community in primary care in primary care

Aim. To evaluate the usefulness of COOP/WONCA charts as a screening tool for mental disorders in primary care in the immigrant healthcare users in Salt. To measure self-rated health of Salt immigration population using the COOP / WONCA charts and to assess its associated factorsDesign. Descriptive and transversal study, Participants. 370 non-EU immigrants seniors selected by consecutive sampling stratified by sexMain measures. Personal information will be collected (age, sex, country of origin, years of residency in Spain, number of people living in the household and associated comorbidities). Each participant will complete the COOP/WONCA charts. An analysis of the validity of the diagnostic test will be done: sensibility, specificity, positive predictive value, negative predictive value, ROC curve and area under the curve (AUC). All variables will be subjected to descriptive analysis. Bivariate and multivariate analysis between the variables collected (sex, years of residency in Spain... ) and the results of COOP / WONCA charts will be performedResults. Preliminary results are available on a pilot test with 30 patients. The mental disorder prevalence is around 30%. Sensibility (0,89), specificity (0,89), VPP (0,80), VPN (0,94) cutoff score (3.5) and AUC (0,941). Women, people with 10 or more years of residency in Spain and unemployed people have worse self-rated healthConclusions. Based on the preliminary results, is possible to conclude that COOP/WONCA charts could be an useful, valid and applicable screening test for mental disorders in primary care with immigrant population

Approximating subtree distances between Phylogenies

We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between two phylogenies, which was recently shown to be NP-complete by Bordewich and Semple [5]. This paper presents the first approximation result for this important tree distance. The algorithm follows a standard format for tree distances such as Rodrigues et al. [24] and Hein et al. [13]. The novel ideas are in the analysis. In the analysis, the cost of the algorithm uses a \cascading" scheme that accounts for possible wrong moves. This accounting is missing from previous analysis of tree distance approximation algorithms. Further, we show how all algorithms of this type can be implemented in linear time and give experimental results.

Effects of Bilingualism on Multi-Word Production

It has been shown that bilinguals are disadvantaged on some language production tasks when compared to monolinguals. The present study investigated the effects of bilingualism on lexical retrieval in single and multi-word utterances. To this purpose, we tested three groups of 35 participants each (Spanish monolinguals, highly proficient Spanish-Catalan and Catalan-Spanish bilinguals) in two sets of picture naming experiments. In the first one, participants were asked to name black-and-white object drawings by single words. In the second one, participants had to name colored pictures with determiner adjectival noun phrases (NP) like “the red car”. In both sets of experiments, bilinguals were slower than monolinguals, even when naming in their dominant language. We also examined the articulatory durations of both single word and NP productions for this bilingual disadvantage. Furthermore, response onset times and durations of all groups in both experiments were affected by lexical variables of the picture names. These results are consistent with previous studies (Ivanova & Costa, 2008, Gollan et al., 2005) showing a bilingual disadvantage in single word production and extend these findings to multiword-utterances and response durations. They also support the claim that articulatory processes are influenced by lexical variables.

Institucions polítiques de Catalunya : creació de materials docents en suport digital que fomentin la interacció amb l'estudiant a partir de la visualització de conceptes

Amb una plantilla, hem elaborat uns materials docents -l'objecte d'estudi dels quals és l’Estatut d'Autonomia de Catalunya de 2006, des d'una perspectiva jurídica -, que corresponen fonamentalment a l’assignatura “Institucions Polítiques de Catalunya” de 4rt. curs de la llicenciatura de Dret de la UAB. Els materials s’han penjat al web http://www.institucionspolitiques.com. L' objectiu de l’acció docent ha estat consolidar una eina interactiva, que fomenti la creativitat i el treball cooperatiu de l’estudiant, que permeti un rol més actiu del professorat, i finalment, es faciliti l’adaptació docent a l’espai europeu d’educació superior. L’experiència s'ha completat amb l’ús del mètode bimodal -campus virtual de la UAB -, amb visites a institucions públiques i amb l’assistència periòdica com a públic a programes de televisió de continguts relacionats amb la matèria. La plantilla per a desenvolupar els diversos temes del programa ha estat la següent: 1.- Redacció del tema; 2.- Visualització de conceptes: quadres sinòptics, esquemes, gràfics; 3.-Bibliografia bàsica. 4.-Legislació i jurisprudència. 5.-Text reproduït. 6.-Qüestions.7.-Temes per al debat. 8.-Test. 9.-Materials complementaris audiovisuals. 10.-Enllaços útils a la xarxa. L'experiència s’ha desenvolupat els dos darrers cursos acadèmics: 2006/07 i 2007/08, i ha girat entorn de l'elaboració i aplicació dels materials elaborats. Ha estat teòrica i pràctica a la vegada. S'ha prestat especial atenció a la feina de l'alumnat fora de l'aula, amb el conseqüent estudi previ i col·laboració en l’elaboració de materials. Cal destacar també que hem aconseguit augmentar la participació de l'alumnat a l’aula, i d'aquesta manera el rol del professor ha esdevingut més dinàmic. Els materials han permès un fàcil i ràpid accés dels estudiants, amb l’objectiu de gaudir d’unes sessions presencials més interactives, i s'ha connectat la Universitat amb la societat, a més de desenvolupar actituds cíviques o de consciència de país en una matèria tan sensible com és l'estudi del dret públic de Catalunya.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

In a seminal paper [10], Weitz gave a deterministic fully polynomial approximation scheme for counting exponentially weighted independent sets (which is the same as approximating the partition function of the hard-core model from statistical physics) in graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the innite d-regular tree. ore recently Sly [8] (see also [1]) showed that this is optimal in the sense that if here is an FPRAS for the hard-core partition function on graphs of maximum egree d for activities larger than the critical activity on the innite d-regular ree then NP = RP. In this paper we extend Weitz's approach to derive a deterministic fully polynomial approximation scheme for the partition function of general two-state anti-ferromagnetic spin systems on graphs of maximum degree d, up to the corresponding critical point on the d-regular tree. The main ingredient of our result is a proof that for two-state anti-ferromagnetic spin systems on the d-regular tree, weak spatial mixing implies strong spatial mixing. his in turn uses a message-decay argument which extends a similar approach proposed recently for the hard-core model by Restrepo et al [7] to the case of general two-state anti-ferromagnetic spin systems.

Nocardiosi pulmonar en pacients amb malaltia pulmonar obstructiva crònica: característiques i factors pronòstics

La Nocardiosi pulmonar és una infecció que afecta principalment a indivius amb immunosupressió. En els darrers anys s’ha identificat un major número de casos de NP en pacients amb Malaltia pulmonar obstructiva crònica. En l’actual treball es pretén analitzar els factors que s’associen a la presència de NP en indivius amb diagnòstic de MPOC i estudiar-ne el pronòstic. S’ha realitzat un estudi restrospectiu en el qual s’han inclòs tots els pacients amb diagnòstic de MPOC i amb aïllament de Nocardia spp. en mostra respiratòria entre els anys 1997-2009. S’han recollit dades demogràfiques, clíniques, microbiològiques, el tractament rebut i la mortalitat als 30, 90 dies i a l’any.

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Clustering algorithms for anti-money laundering using graph theory and social network analysis

HEMOLIA (a project under European community’s 7th framework programme) is a new generation Anti-Money Laundering (AML) intelligent multi-agent alert and investigation system which in addition to the traditional financial data makes extensive use of modern society’s huge telecom data source, thereby opening up a new dimension of capabilities to all Money Laundering fighters (FIUs, LEAs) and Financial Institutes (Banks, Insurance Companies, etc.). This Master-Thesis project is done at AIA, one of the partners for the HEMOLIA project in Barcelona. The objective of this thesis is to find the clusters in a network drawn by using the financial data. An extensive literature survey has been carried out and several standard algorithms related to networks have been studied and implemented. The clustering problem is a NP-hard problem and several algorithms like K-Means and Hierarchical clustering are being implemented for studying several problems relating to sociology, evolution, anthropology etc. However, these algorithms have certain drawbacks which make them very difficult to implement. The thesis suggests (a) a possible improvement to the K-Means algorithm, (b) a novel approach to the clustering problem using the Genetic Algorithms and (c) a new algorithm for finding the cluster of a node using the Genetic Algorithm.

Fills i fills de famílies immigrades als països rics. Informe 2010 sobre el cas de Catalunya al context de la Unió Europea

Aquest projecte ha consistit en la realització d'un informe actualitzat i ampli sobre la situació dels fills i filles de famílies immigrades a Catalunya en dos grups d’edat (0-17 i 18-29) i s'ha centrat en els àmbits socio-demogràfic, educatiu i jurídic, des d’una perspectiva comparativa internacional proporcionada pel projecte UNICEF Innocenti Children of Immigrant Families in 8 Affluent Countries (2009). S’ha treballat amb dades quantitatives, qualitatives i bibliogràfiques de diverses fonts primàries i secundàries. Per realitzar aquest informe, s’han ampliat els indicadors d’Innocenti en dos sentits: a) afegint, quan ha estat possible, els ja elaborats i experimentats per l’equip investigador al I i II Informes sobre Infància i Immigració a Catalunya en el marc del CIIMU els anys 2002 i 2005, així com els desenvolupats als capítols “Infancia e Inmigración” dels dos volums La Infancia en Cifras en España (Ministerio de Trabajo y Asuntos Sociales) els anys 2006 i el 2007 sobre una mostra del padró 2005 i amb projecció pel conjunt de l’estat; b) afegint una anàlisi jurídica transversal dels diferents marcs que regulen la situació dels fills i filles de famílies immigrades a la Unió Europea, Espanya, Catalunya i les cartes de drets internacionals, i s’ha contrastat aquestes regulacions amb l’anàlisi de casos obtinguts amb treball de camp etnogràfic a dues comarques (de Barcelona i Girona) que han permès il•lustrar les contradiccions de la seva aplicació. D’altra banda, seguint amb la perspectiva aplicada en estudis i informes precedents, l’abordatge ha permès analitzar comparativament la situació dels fills i filles de famílies immigrades amb els seus coetanis d’origen autòcton, pel que fa a les condicions de vida i les oportunitats socials en un sentit ampli. La Memòria que s’annexa consta de 4 grans apartats: 1) Sociodemografia, 2) Educació, 3) Marc jurídic, 4) Joves de famílies immigrades.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

A tractable consideration set structure for network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing from an offerset, have recently become popular in assortment optimization and revenue management. The dynamicprogram for these models is intractable and approximated by a deterministic linear program called theCDLP which has an exponential number of columns. When there are products that are being consideredfor purchase by more than one customer segment, CDLP is difficult to solve since column generationis known to be NP-hard. However, recent research indicates that a formulation based on segments withcuts imposing consistency (SDCP+) is tractable and approximates the CDLP value very closely. In thispaper we investigate the structure of the consideration sets that make the two formulations exactly equal.We show that if the segment consideration sets follow a tree structure, CDLP = SDCP+. We give acounterexample to show that cycles can induce a gap between the CDLP and the SDCP+ relaxation.We derive two classes of valid inequalities called flow and synchronization inequalities to further improve(SDCP+), based on cycles in the consideration set structure. We give a numeric study showing theperformance of these cycle-based cuts.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.