Collaboration entre médecin de famille et psychiatre pour les problèmes de santé mentale [Family physicians and psychiatrists' collaborative care for mental health problems].

The burden of disease linked to mental disorders represents more than one-fifth of years lived with disability in the world. Less than half of people suffering from mental disorders are adequately treated. Three quarter of those who receive treatment are followed by primary care. Collaborative care aims to increase the efficiency of direct general practitioner's treatment. Main components are sustainable and individualized consultation-liaison relationship (1/2 day of psychiatrist by 15 days for 10-15 general practitioners), and support of a clinical case manager for complex situations. Collaboration is bidirectional: early or crisis access to specialist care and long-term followup by general practitioner. This model is a challenge for the doctor-patient dual relationship and requires incentives in a public health perspective.

Prise en charge des patients avec des problèmes d'alcool: quelle efficacité? Quelques éléments de réponse à partir d'une revue de la littérature [Management of patients with alcohol problems: how effective? Several response factors based on a review of the literature]

What do we know about the effectiveness of various treatments of alcoholism? This review of literature shows that lack--or weaknesses--of published studies make it impossible to draw definite conclusions. Rigorous controlled studies show high rates of spontaneous remission and important uncertainties about specialised treatments of alcoholism. However, except for severe dependence that may well require a different approach, brief interventions conducted by non-specialists have proved highly effective for at-risk alcohol drinkers: based on minimal medical advice, they increase the chances of lowering alcohol consumption. General practitioners may thus represent on important link in the therapeutic chain.

Computational problems in perfect phylogeny haplotyping: Typing without calling the allele

A haplotype is an m-long binary vector. The XOR-genotype of two haplotypes is the m-vector of their coordinate-wise XOR. We study the following problem: Given a set of XOR-genotypes, reconstruct their haplotypes so that the set of resulting haplotypes can be mapped onto a perfect phylogeny (PP) tree. The question is motivated by studying population evolution in human genetics and is a variant of the PP haplotyping problem that has received intensive attention recently. Unlike the latter problem, in which the input is '' full '' genotypes, here, we assume less informative input and so may be more economical to obtain experimentally. Building on ideas of Gusfield, we show how to solve the problem in polynomial time by a reduction to the graph realization problem. The actual haplotypes are not uniquely determined by the tree they map onto and the tree itself may or may not be unique. We show that tree uniqueness implies uniquely determined haplotypes, up to inherent degrees of freedom, and give a sufficient condition for the uniqueness. To actually determine the haplotypes given the tree, additional information is necessary. We show that two or three full genotypes suffice to reconstruct all the haplotypes and present a linear algorithm for identifying those genotypes.

Pediatric drug-related problems: a multicenter study in four French-speaking countries.

BACKGROUND: Pediatric intensive care patients represent a population at high risk for drug-related problems. There are few studies that compare the activity of clinical pharmacists between countries. OBJECTIVE: To describe the drug-related problems identified and interventions by four pharmacists in a pediatric cardiac and intensive care unit. SETTING: Four pediatric centers in France, Quebec, Switzerland and Belgium. METHOD: This was a six-month multicenter, descriptive and prospective study conducted from August 1, 2009 to January 31, 2010. Drug-related problems and clinical interventions were compiled from four pediatric centers in France, Quebec, Switzerland and Belgium. Data on patients, drugs, intervention, documentation, approval and estimated impact were compiled. MAIN OUTCOME MEASURE: Number and type of drug-related problems encountered in a large pediatric inpatient population. RESULTS: A total of 996 interventions were recorded: 238 (24 %) in France, 278 (28 %) in Quebec, 351 (35 %) in Switzerland and 129 (13 %) in Belgium. These interventions targeted 270 patients (median 21 months old, 53 % male): 88 (33 %) in France, 56 (21 %) in Quebec, 57 (21 %) in Switzerland and 69 (26 %) in Belgium. The main drug-related problems were inappropriate administration technique (29 %), untreated indication (25 %) and supra-therapeutic dose (11 %). The pharmacists' interventions were mostly optimizing the mode of administration (22 %), dose adjustment (20 %) and therapeutic monitoring (16 %). The two major drug classes that led to interventions were anti-infectives for systemic use (23 %) and digestive system and metabolism drugs (22 %). Interventions mainly involved residents and all clinical staff (21 %). Among the 878 (88 %) proposed interventions requiring physician approval, 860 (98 %) were accepted. CONCLUSION: This descriptive study illustrates drug-related problems and the ability of clinical pharmacists to identify and resolve them in pediatric intensive care units in four French-speaking countries.

Odorant binding proteins of the red imported fire ant, Solenopsis invicta: an example of the problems facing the analysis of widely divergent proteins.

We describe the odorant binding proteins (OBPs) of the red imported fire ant, Solenopsis invicta, obtained from analyses of an EST library and separate 454 sequencing runs of two normalized cDNA libraries. We identified a total of 18 putative functional OBPs in this ant. A third of the fire ant OBPs are orthologs to honey bee OBPs. Another third of the OBPs belong to a lineage-specific expansion, which is a common feature of insect OBP evolution. Like other OBPs, the different fire ant OBPs share little sequence similarity (∼ 20%), rendering evolutionary analyses difficult. We discuss the resulting problems with sequence alignment, phylogenetic analysis, and tests of selection. As previously suggested, our results underscore the importance for careful exploration of the sensitivity to the effects of alignment methods for data comprising widely divergent sequences.

More Money, Fewer Problems? Cross-Level Effects of Economic Deprivation on Political Representation

While equal political representation of all citizens is a fundamental democratic goal, it is hampered empirically in a multitude of ways. This study examines how the societal level of economic inequality affects the representation of relatively poor citizens by parties and governments. Using CSES survey data for citizens' policy preferences and expert placements of political parties, empirical evidence is found that in economically more unequal societies, the party system represents the preferences of relatively poor citizens worse than in more equal societies. This moderating effect of economic equality is also found for policy congruence between citizens and governments, albeit slightly less clear-cut.

Problèmes dus aux fistules d'hémodialyse: un réseau régional de prise en charge [Problems related to haemodialysis vascular accesses: a regional network of care]

The number of patients treated by haemodialysis (HD) is continuously increasing. The complications associated with vascular accesses represent the first cause of hospitalisation in these patients. Since 2001 nephrologists, surgeons, angiologists and radiologists at the CHUV are working to develop a multidisciplinary model that includes planning and monitoring of HD accesses. In this setting the echo-Doppler represents an important tool of investigation. Every patient is discussed and decisions are taken during a weekly multidisciplinary meeting. A network has been created with nephrologists of peripheral centres and other specialists. This model allows to centralize investigational information and coordinate patient care while keeping and even developing some investigational activities and treatment in peripheral centres.

Problems of allometric scaling analysis: examples from mammalian reproductive biology.

Biological scaling analyses employing the widely used bivariate allometric model are beset by at least four interacting problems: (1) choice of an appropriate best-fit line with due attention to the influence of outliers; (2) objective recognition of divergent subsets in the data (allometric grades); (3) potential restrictions on statistical independence resulting from phylogenetic inertia; and (4) the need for extreme caution in inferring causation from correlation. A new non-parametric line-fitting technique has been developed that eliminates requirements for normality of distribution, greatly reduces the influence of outliers and permits objective recognition of grade shifts in substantial datasets. This technique is applied in scaling analyses of mammalian gestation periods and of neonatal body mass in primates. These analyses feed into a re-examination, conducted with partial correlation analysis, of the maternal energy hypothesis relating to mammalian brain evolution, which suggests links between body size and brain size in neonates and adults, gestation period and basal metabolic rate. Much has been made of the potential problem of phylogenetic inertia as a confounding factor in scaling analyses. However, this problem may be less severe than suspected earlier because nested analyses of variance conducted on residual variation (rather than on raw values) reveals that there is considerable variance at low taxonomic levels. In fact, limited divergence in body size between closely related species is one of the prime examples of phylogenetic inertia. One common approach to eliminating perceived problems of phylogenetic inertia in allometric analyses has been calculation of 'independent contrast values'. It is demonstrated that the reasoning behind this approach is flawed in several ways. Calculation of contrast values for closely related species of similar body size is, in fact, highly questionable, particularly when there are major deviations from the best-fit line for the scaling relationship under scrutiny.

Ruin problems under IBNR Dynamics

In this paper, we consider a discrete-time risk process allowing for delay in claim settlement, which introduces a certain type of dependence in the process. From martingale theory, an expression for the ultimate ruin probability is obtained, and Lundberg-type inequalities are derived. The impact of delay in claim settlement is then investigated. To this end, a convex order comparison of the aggregate claim amounts is performed with the corresponding non-delayed risk model, and numerical simulations are carried out with Belgian market data.

On solving fair exchange and related distributed problems in Byzantine environments

Abstract The solvability of the problem of fair exchange in a synchronous system subject to Byzantine failures is investigated in this work. The fair exchange problem arises when a group of processes are required to exchange digital items in a fair manner, which means that either each process obtains the item it was expecting or no process obtains any information on, the inputs of others. After introducing a novel specification of fair exchange that clearly separates safety and liveness, we give an overview of the difficulty of solving such a problem in the context of a fully-connected topology. On one hand, we show that no solution to fair exchange exists in the absence of an identified process that every process can trust a priori; on the other, a well-known solution to fair exchange relying on a trusted third party is recalled. These two results lead us to complete our system model with a flexible representation of the notion of trust. We then show that fair exchange is solvable if and only if a connectivity condition, named the reachable majority condition, is satisfied. The necessity of the condition is proven by an impossibility result and its sufficiency by presenting a general solution to fair exchange relying on a set of trusted processes. The focus is then turned towards a specific network topology in order to provide a fully decentralized, yet realistic, solution to fair exchange. The general solution mentioned above is optimized by reducing the computational load assumed by trusted processes as far as possible. Accordingly, our fair exchange protocol relies on trusted tamperproof modules that have limited communication abilities and are only required in key steps of the algorithm. This modular solution is then implemented in the context of a pedagogical application developed for illustrating and apprehending the complexity of fair exchange. This application, which also includes the implementation of a wide range of Byzantine behaviors, allows executions of the algorithm to be set up and monitored through a graphical display. Surprisingly, some of our results on fair exchange seem contradictory with those found in the literature of secure multiparty computation, a problem from the field of modern cryptography, although the two problems have much in common. Both problems are closely related to the notion of trusted third party, but their approaches and descriptions differ greatly. By introducing a common specification framework, a comparison is proposed in order to clarify their differences and the possible origins of the confusion between them. This leads us to introduce the problem of generalized fair computation, a generalization of fair exchange. Finally, a solution to this new problem is given by generalizing our modular solution to fair exchange