Social network measures for "nosduocentered" networks, their predictive power on performance

Our purpose in this article is to define a network structure which is based on two egos instead of the egocentered (one ego) or the complete network (n egos). We describe the characteristics and properties for this kind of network which we call “nosduocentered network”, comparing it with complete and egocentered networks. The key point for this kind of network is that relations exist between the two main egos and all alters, but relations among others are not observed. After that, we use new social network measures adapted to the nosduocentered network, some of which are based on measures for complete networks such as degree, betweenness, closeness centrality or density, while some others are tailormade for nosduocentered networks. We specify three regression models to predict research performance of PhD students based on these social network measures for different networks such as advice, collaboration, emotional support and trust. Data used are from Slovenian PhD students and their s

Brain network analysis of patients with Temporal Lobe Epilepsy

Patients with Temporal Lobe Epilepsy (TLE) suffer from widespread subtle white matter abnormalities and abnormal functional connectivity extending beyond the affected lobe, as revealed by Diffusion Tensor MR Imaging, volumetric and functional MRI studies. Diffusion Spectrum Imaging (DSI) is a diffusion imaging technique with high angular resolution for improving the mapping of white matter pathways. In this study, we used DSI, connectivity matrices and topological measures to investigate how the alteration in structural connectivity influences whole brain structural networks. Eleven patients with right-sided TLE and hippocampal sclerosis and 18 controls underwent our DSI protocol at 3T. The cortical and subcortical grey matters were parcellated into 86 regions of interest and the connectivity between every region pair was estimated using global tractography and a connectivity matrix (the adjacency matrix of the structural network). We then compared the networks of patients and controls using topological measures. In patients, we found a higher characteristic path length and a lower clustering coefficient compared to controls. Local measures at node level of the clustering and efficiency showed a significant difference after a multiple comparison correction (Bonferroni). These significant nodes were located within as well outside the temporal lobe, and the localisation of most of them was consistent with regions known to be part of epileptic networks in TLE. Our results show altered connectivity patterns that are concordant with the mapping of functional epileptic networks in patients with TLE. Further studies are needed to establish the relevance of these findings for the propagation of epileptic activity, cognitive deficits in medial TLE and outcome of epilepsy surgery in individual patients.

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.

Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates

TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes

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

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

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’un sistema experimental de telefonia IP per a la Unitat de Tecnologies de la Informació i Comunicació de l’Institut Català de la Salut a Girona

L'objectiu d'aquest projecte és dissenyar i implementar un servei de telefonia IP per a la Unitat de Tecnologies de la Informació i Comunicació (UTIC) de l'Institut Català de la Salut (ICS) a Girona. En primer lloc, es descriu el funcionament actual del servei de telefonia de l'ICS a Girona i la seva infraestructura de xarxa. A continuació s’estudia els fonaments de la VoIP. Es segueix amb el disseny, les eines escollides i la implementació realitzada, per acabar amb les conclusions

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