A genome-wide significant linkage for severe depression on chromosome 3: the depression network study.

Objective: The purpose of this study was to find loci for major depression via linkage analysis of a large sibling pair sample. Method: The authors conducted a genome-wide linkage analysis of 839 families consisting of 971 affected sibling pairs with severe recurrent major depression, comprising waves I and II of the Depression Network Study cohort. In addition to examining affected status, linkage analyses in the full data set were performed using diagnoses restricted by impairment severity, and association mapping of hits in a large case-control data set was attempted. Results: The authors identified genome-wide significant linkage to chromosome 3p25-26 when the diagnoses were restricted by severity, which was a maximum LOD score of 4.0 centered at the linkage marker D3S1515. The linkage signal identified was genome-wide significant after correction for the multiple phenotypes tested, although subsequent association mapping of the region in a genome-wide association study of a U.K. depression sample did not provide significant results. Conclusions: The authors report a genome-wide significant locus for depression that implicates genes that are highly plausible for involvement in the etiology of recurrent depression. Despite the fact that association mapping in the region was negative, the linkage finding was replicated by another group who found genome-wide-significant linkage for depression in the same region. This suggests that 3p25-26 is a new locus for severe recurrent depression. This represents the first report of a genome-wide significant locus for depression that also has an independent genome-wide significant replication.

Testing of Diagnostic Methods for Detection of Influenza Virusfor Optimal Performance in the Context of an Influenza Surveillance Network

Influenza surveillance networks must detect early the viruses that will cause the forthcoming annual epidemics and isolate the strains for further characterization. We obtained the highest sensitivity (95.4%) with a diagnostic tool that combined a shell-vial assay and reverse transcription-PCR on cell culture supernatants at 48 h, and indeed, recovered the strain

A Bayesian network approach to the database serch problem in criminal proceedings

Background The 'database search problem', that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions. The method's graphical environment, along with its computational and probabilistic architectures, represents a rich package that offers analysts and discussants with additional modes of interaction, concise representation, and coherent communication.

Evaluating the probability and the impact of a failure in GMPLS based networks

In this paper, we define a new scheme to develop and evaluate protection strategies for building reliable GMPLS networks. This is based on what we have called the network protection degree (NPD). The NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability, and an a posteriori evaluation, the failure impact degree (FID), which determines the impact on the network in case of failure, in terms of packet loss and recovery time. Having mathematical formulated these components, experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms in order to offer a certain degree of protection

Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm

IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability and an a posteriori evaluation, the failure impact degree (FID), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection

Improvement of antibiotic prescription in outpatient care: a cluster-randomized intervention study using a sentinel surveillance network of physicians.

OBJECTIVES: To assess the effectiveness of implementing guidelines, coupled with individual feedback, on antibiotic prescribing behaviour of primary care physicians in Switzerland. METHODS: One hundred and forty general practices from a representative Swiss sentinel network of primary care physicians participated in this cluster-randomized prospective intervention study. The intervention consisted of providing guidelines on treatment of respiratory tract infections (RTIs) and uncomplicated lower urinary tract infections (UTIs), coupled with sustained, regular feedback on individual antibiotic prescription behaviour during 2 years. The main aims were: (i) to increase the percentage of prescriptions of penicillins for all RTIs treated with antibiotics; (ii) to increase the percentage of trimethoprim/sulfamethoxazole prescriptions for all uncomplicated lower UTIs treated with antibiotics; (iii) to decrease the percentage of quinolone prescriptions for all cases of exacerbated COPD (eCOPD) treated with antibiotics; and (iv) to decrease the proportion of sinusitis and other upper RTIs treated with antibiotics. The study was registered at ClinicalTrials.gov (NCT01358916). RESULTS: While the percentage of antibiotics prescribed for sinusitis or other upper RTIs and the percentage of quinolones prescribed for eCOPD did not differ between the intervention group and the control group, there was a significant increase in the percentage of prescriptions of penicillins for all RTIs treated with antibiotics [57% versus 49%, OR=1.42 (95% CI 1.08-1.89), P=0.01] and in the percentage of trimethoprim/sulfamethoxazole prescriptions for all uncomplicated lower UTIs treated with antibiotics [35% versus 19%, OR=2.16 (95% CI 1.19-3.91), P=0.01] in the intervention group. CONCLUSIONS: In our setting, implementing guidelines, coupled with sustained individual feedback, was not able to reduce the proportion of sinusitis and other upper RTIs treated with antibiotics, but increased the use of recommended antibiotics for RTIs and UTIs, as defined by the guidelines.

Adding QoS protection in order to enhance MPLS QoS routing

In this paper, a method for enhancing current QoS routing methods by means of QoS protection is presented. In an MPLS network, the segments (links) to be protected are predefined and an LSP request involves, apart from establishing a working path, creating a specific type of backup path (local, reverse or global). Different QoS parameters, such as network load balancing, resource optimization and minimization of LSP request rejection should be considered. QoS protection is defined as a function of QoS parameters, such as packet loss, restoration time, and resource optimization. A framework to add QoS protection to many of the current QoS routing algorithms is introduced. A backup decision module to select the most suitable protection method is formulated and different case studies are analyzed

Automatic self-configuration of the logical network using distributed software agents

We present a system for dynamic network resource configuration in environments with bandwidth reservation. The proposed system is completely distributed and automates the mechanisms for adapting the logical network to the offered load. The system is able to manage dynamically a logical network such as a virtual path network in ATM or a label switched path network in MPLS or GMPLS. The system design and implementation is based on a multi-agent system (MAS) which make the decisions of when and how to change a logical path. Despite the lack of a centralised global network view, results show that MAS manages the network resources effectively, reducing the connection blocking probability and, therefore, achieving better utilisation of network resources. We also include details of its architecture and implementation

An ATM distributed simulator for network management research

Due to the high cost of a large ATM network working up to full strength to apply our ideas about network management, i.e., dynamic virtual path (VP) management and fault restoration, we developed a distributed simulation platform for performing our experiments. This platform also had to be capable of other sorts of tests, such as connection admission control (CAC) algorithms, routing algorithms, and accounting and charging methods. The platform was posed as a very simple, event-oriented and scalable simulation. The main goal was the simulation of a working ATM backbone network with a potentially large number of nodes (hundreds). As research into control algorithms and low-level, or rather cell-level methods, was beyond the scope of this study, the simulation took place at a connection level, i.e., there was no real traffic of cells. The simulated network behaved like a real network accepting and rejecting SNMP ones, or experimental tools using the API node

Availability analysis of GMPLS connections based on physical network topology

This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics

Partial disjoint path for multi-layer protection in GMPLS networks

In this paper, different recovery methods applied at different network layers and time scales are used in order to enhance the network reliability. Each layer deploys its own fault management methods. However, current recovery methods are applied to only a specific layer. New protection schemes, based on the proposed partial disjoint path algorithm, are defined in order to avoid protection duplications in a multi-layer scenario. The new protection schemes also encompass shared segment backup computation and shared risk link group identification. A complete set of experiments proves the efficiency of the proposed methods in relation with previous ones, in terms of resources used to protect the network, the failure recovery time and the request rejection ratio

Dynamic bandwidth management as part of an integrated network management system based on distributed agents

We present a system for dynamic network resource configuration in environments with bandwidth reservation and path restoration mechanisms. Our focus is on the dynamic bandwidth management results, although the main goal of the system is the integration of the different mechanisms that manage the reserved paths (bandwidth, restoration, and spare capacity planning). The objective is to avoid conflicts between these mechanisms. The system is able to dynamically manage a logical network such as a virtual path network in ATM or a label switch path network in MPLS. This system has been designed to be modular in the sense that in can be activated or deactivated, and it can be applied only in a sub-network. The system design and implementation is based on a multi-agent system (MAS). We also included details of its architecture and implementation

Parental influences on pathogen resistance in brown trout embryos and effects of outcrossing within a river network.

Phenotypic plasticity can increase tolerance to heterogeneous environments but the elevations and slopes of reaction norms are often population specific. Disruption of locally adapted reaction norms through outcrossing can lower individual viability. Here, we sampled five genetically distinct populations of brown trout (Salmo trutta) from within a river network, crossed them in a full-factorial design, and challenged the embryos with the opportunistic pathogen Pseudomonas fluorescens. By virtue of our design, we were able to disentangle effects of genetic crossing distance from sire and dam effects on early life-history traits. While pathogen infection did not increase mortality, it was associated with delayed hatching of smaller larvae with reduced yolk sac reserves. We found no evidence of a relationship between genetic distance (W, FST) and the expression of early-life history traits. Moreover, hybrids did not differ in phenotypic means or reaction norms in comparison to offspring from within-population crosses. Heritable variation in early life-history traits was found to remain stable across the control and pathogen environments. Our findings show that outcrossing within a rather narrow geographical scale can have neutral effects on F1 hybrid viability at the embryonic stage, i.e. at a stage when environmental and genetic effects on phenotypes are usually large.

Disseny i implementació d’una “Storage Area Network”

El següent projecte consisteix en analitzar com funciona un sistema SAN, per tal de veure comes pot obtenir un millor rendiment. L’objectiu principal es saber com es comportarà la nostra SAN muntada amb iSCSI a través de la xarxa, volem veure quines són les operacions, les dades i els resultats que comporta crear una RAID a través de discos no locals d’un ordinador i a través d’una xarxa LAN

Topics in public finance: social security and taxation

Summary The field of public finance focuses on the spending and taxing activities of governments and their influence on the allocation of resources and distribution of income. This work covers in three parts different topics related to public finance which are currently widely discussed in media and politics. The first two parts deal with issues on social security, which is in general one of the biggest spending shares of governments. The third part looks at the main income source of governments by analyzing the perceived value of tax competition. Part one deals with the current problem of increased early retirement by focusing on Switzerland as a special case. Early retirement is predominantly considered to be the result of incentives set by social security and the tax system. But the Swiss example demonstrates that the incidence of early retirement has dramatically increased even in the absence of institutional changes. We argue that the wealth effect also plays an important role in the retirement decision for middle and high income earners. An actuarially fair, but mandatory funded system with a relatively high replacement rate may thus contribute to a low labor market participation rate of elderly workers. We provide evidence using a unique dataset on individual retirement decisions in Swiss pension funds, allowing us to perfectly control for pension scheme details. Our findings suggest that affordability is a key determinant in the retirement decisions. The higher the accumulated pension capital, the earlier men, and to a smaller extent women, tend to leave the workforce. The fact that early retirement has become much more prevalent in the last 15 years is a further indicator of the importance of a wealth effect, as the maturing of the Swiss mandatory funded pension system over that period has led to an increase in the effective replacement rates for middle and high income earners. Part two covers the theoretical side of social security. Theories analyzing optimal social security benefits provide important qualitative results, by mainly using one general type of an economy. Economies are however very diverse concerning numerous aspects, one of the most important being the wealth level. This can lead to significant quantitative benefit differences that imply differences in replacement rates and levels of labor supply. We focus on several aspects related to this fact. In a within cohort social security model, we introduce disability insurance with an imperfect screening mechanism. We then vary the wealth level of the model economy and analyze how the optimal social security benefit structure or equivalently, the optimal replacement rates, changes depending on the wealth level of the economy, and if the introduction of disability insurance into a social security system is preferable for all economies. Second, the screening mechanism of disability insurance and the threshold level at which people are defined as disabled can differ. For economies with different wealth levels, we determine for different thresholds the screening level that maximizes social welfare. Finally, part three turns to the income of governments, by adding an element to the controversy on tax competition versus tax harmonization.2 Inter-jurisdictional tax competition can generate at least two potential benefits or costs: On a public level, tax competition may result in a lower or higher efficiency in the production of public services. But there is also a more private benefit in the form of an option for individuals to move to a community with a lower tax rate in the future. To explore the value citizens attach to tax competition we analyze a unique popular vote for a complete tax harmonization between communities in the third largest Swiss canton, Vaud. Although a majority of voters would have seemingly benefited from replacing the current tax rate by a revenue-neutral average tax rate, the proposal was rejected by a large margin. Our estimates suggest that the estimated combined perceived benefit from tax competition is in the range of 10%.