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.

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

Policy gradient based Reinforcement Learning for real autonomous underwater cable tracking

This paper proposes a field application of a high-level reinforcement learning (RL) control system for solving the action selection problem of an autonomous robot in cable tracking task. The learning system is characterized by using a direct policy search method for learning the internal state/action mapping. Policy only algorithms may suffer from long convergence times when dealing with real robotics. In order to speed up the process, the learning phase has been carried out in a simulated environment and, in a second step, the policy has been transferred and tested successfully on a real robot. Future steps plan to continue the learning process on-line while on the real robot while performing the mentioned task. We demonstrate its feasibility with real experiments on the underwater robot ICTINEU AUV

Autonomous underwater vehicle control using reinforcement learning policy search methods

Autonomous underwater vehicles (AUV) represent a challenging control problem with complex, noisy, dynamics. Nowadays, not only the continuous scientific advances in underwater robotics but the increasing number of subsea missions and its complexity ask for an automatization of submarine processes. This paper proposes a high-level control system for solving the action selection problem of an autonomous robot. The system is characterized by the use of reinforcement learning direct policy search methods (RLDPS) for learning the internal state/action mapping of some behaviors. We demonstrate its feasibility with simulated experiments using the model of our underwater robot URIS in a target following task

Towards Direct Policy Search Reinforcement Learning for Robot Control

This paper proposes a high-level reinforcement learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, when using RL, has been to apply value function based algorithms, the system here detailed is characterized by the use of direct policy search methods. Rather than approximating a value function, these methodologies approximate a policy using an independent function approximator with its own parameters, trying to maximize the future expected reward. The policy based algorithm presented in this paper is used for learning the internal state/action mapping of a behavior. In this preliminary work, we demonstrate its feasibility with simulated experiments using the underwater robot GARBI in a target reaching task

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.

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

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.