Graph theory reveals dysconnected hubs in 22q11DS and altered nodal efficiency in patients with hallucinations.

Schizophrenia is postulated to be the prototypical dysconnection disorder, in which hallucinations are the core symptom. Due to high heterogeneity in methodology across studies and the clinical phenotype, it remains unclear whether the structural brain dysconnection is global or focal and if clinical symptoms result from this dysconnection. In the present work, we attempt to clarify this issue by studying a population considered as a homogeneous genetic sub-type of schizophrenia, namely the 22q11.2 deletion syndrome (22q11.2DS). Cerebral MRIs were acquired for 46 patients and 48 age and gender matched controls (aged 6-26, respectively mean age = 15.20 ± 4.53 and 15.28 ± 4.35 years old). Using the Connectome mapper pipeline (connectomics.org) that combines structural and diffusion MRI, we created a whole brain network for each individual. Graph theory was used to quantify the global and local properties of the brain network organization for each participant. A global degree loss of 6% was found in patients' networks along with an increased Characteristic Path Length. After identifying and comparing hubs, a significant loss of degree in patients' hubs was found in 58% of the hubs. Based on Allen's brain network model for hallucinations, we explored the association between local efficiency and symptom severity. Negative correlations were found in the Broca's area (p < 0.004), the Wernicke area (p < 0.023) and a positive correlation was found in the dorsolateral prefrontal cortex (DLPFC) (p < 0.014). In line with the dysconnection findings in schizophrenia, our results provide preliminary evidence for a targeted alteration in the brain network hubs' organization in individuals with a genetic risk for schizophrenia. The study of specific disorganization in language, speech and thought regulation networks sharing similar network properties may help to understand their role in the hallucination mechanism.

Satisfaction survey of Directed Experiential Learning (DEL)

The aim of this questionnaire is to assess your experience of the DEL learning process as developed by your university. The questionnaire is anonymous and it should not take more than fifteen minutes to complete.

Characterization of HbpR binding by site-directed mutagenesis of its DNA-binding site and by deletion of the effector domain.

In the presence of 2-hydroxybiphenyl, the enhancer binding protein, HbpR, activates the sigma54-dependent P(hbpC) promoter and controls the initial steps of 2-hydroxybiphenyl degradation in Pseudomonas azelaica. In the activation process, an oligomeric HbpR complex of unknown subunit composition binds to an operator region containing two imperfect palindromic sequences. Here, the HbpR-DNA binding interactions were investigated by site-directed mutagenesis of the operator region and by DNA-binding assays using purified HbpR. Mutations that disrupted the twofold symmetry in the palindromes did not affect the binding affinity of HbpR, but various mutations along a 60 bp region, and also outside the direct palindromic sequences, decreased the binding affinity. Footprints of HbpR on mutant operator fragments showed that a partial loss of binding contacts occurs, suggesting that the binding of one HbpR 'protomer' in the oligomeric complex is impaired whilst leaving the other contacts intact. An HbpR variant, devoid of its N-terminal sensing A-domain, was unable to activate transcription from the hbpC promoter while maintaining protection of the operator DNA in footprints. Wild-type HbpR was unable to activate transcription from the hbpC promoter when delta A-HbpR was expressed in the same cell, suggesting the formation of (repressing) hetero-oligomers. This model implies that HbpR can self-associate on its operator DNA without effector recognition or ATP binding. Furthermore, our findings suggest that the N-terminal sensing domain of HbpR is needed to activate the central ATPase domain rather than to repress a constitutively active C domain, as is the case for the related regulatory protein XylR.

Ultrasound-assisted versus conventional catheter-directed thrombolysis for acute iliofemoral deep vein thrombosis.

BACKGROUND: For patients with acute iliofemoral deep vein thrombosis, it remains unclear whether the addition of intravascular high-frequency, low-power ultrasound energy facilitates the resolution of thrombosis during catheter-directed thrombolysis. METHODS AND RESULTS: In a controlled clinical trial, 48 patients (mean age 50 ± 21 years, 52% women) with acute iliofemoral deep vein thrombosis were randomized to receive ultrasound-assisted catheter-directed thrombolysis (N = 24) or conventional catheter-directed thrombolysis (N = 24). Thrombolysis regimen (20 mg r-tPA over 15 hours) was identical in all patients. The primary efficacy end point was the percentage of thrombus load reduction from baseline to 15 hours according to the length-adjusted thrombus score, obtained from standardized venograms and evaluated by a core laboratory blinded to group assignment. The percentage of thrombus load reduction was 55% ± 27% in the ultrasound-assisted catheter-directed thrombolysis group and 54% ± 27% in the conventional catheter-directed thrombolysis group (P = 0.91). Adjunctive angioplasty and stenting was performed in 19 (80%) patients and in 20 (83%) patients, respectively (P > 0.99). Treatment-related complications occurred in 3 (12%) and 2 (8%) patients, respectively (P > 0.99). At 3-month follow-up, primary venous patency was 100% in the ultrasound-assisted catheter-directed thrombolysis group and 96% in the conventional catheter-directed thrombolysis group (P = 0.33), and there was no difference in the severity of the post-thrombotic syndrome (mean Villalta score: 3.0 ± 3.9 [range 0-15] versus 1.9 ± 1.9 [range 0-7]; P=0.21), respectively. CONCLUSIONS: In this randomized controlled clinical trial of patients with acute iliofemoral deep vein thrombosis treated with a fixed-dose catheter thrombolysis regimen, the addition of intravascular ultrasound did not facilitate thrombus resolution. CLINICAL TRIAL REGISTRATION URL: http://www.clinicaltrials.gov. Unique identifier: NCT01482273.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Characterisation of the putative effector interaction site of the regulatory HbpR protein from Pseudomonas azelaica by site-directed mutagenesis.

Bacterial transcription activators of the XylR/DmpR subfamily exert their expression control via σ(54)-dependent RNA polymerase upon stimulation by a chemical effector, typically an aromatic compound. Where the chemical effector interacts with the transcription regulator protein to achieve activation is still largely unknown. Here we focus on the HbpR protein from Pseudomonas azelaica, which is a member of the XylR/DmpR subfamily and responds to biaromatic effectors such as 2-hydroxybiphenyl. We use protein structure modeling to predict folding of the effector recognition domain of HbpR and molecular docking to identify the region where 2-hydroxybiphenyl may interact with HbpR. A large number of site-directed HbpR mutants of residues in- and outside the predicted interaction area was created and their potential to induce reporter gene expression in Escherichia coli from the cognate P(C) promoter upon activation with 2-hydroxybiphenyl was studied. Mutant proteins were purified to study their conformation. Critical residues for effector stimulation indeed grouped near the predicted area, some of which are conserved among XylR/DmpR subfamily members in spite of displaying different effector specificities. This suggests that they are important for the process of effector activation, but not necessarily for effector specificity recognition.

Tumor targeting with newly designed biparatopic antibodies directed against two different epitopes of the carcinoembryonic antigen (CEA).

In an attempt to improve tumor targeting and tumor retention time of monoclonal antibodies (MAbs), we prepared biparatopic antibodies (BpAbs) having the capability of binding 2 different non-overlapping epitopes on the same target antigen molecule, namely, the carcinoembryonic antigen (CEA). Six BpAbs were constructed by coupling 2 different Fab' fragments from 4 different specific anti-CEA MAbs recognizing 4 CEA epitopes (Gold 1-4). Demonstration of the double paratopic binding of these antibodies for CEA was confirmed in vitro by inhibition radioimmunoassay and cross-inhibition analysis by surface plasmon resonance (SPR; BIACORE) technology. Using the latter technique, the affinity constants for CEA immobilized onto the sensor chip were found to range from 0.37 to 1.54 x 10(9) M(-1) for the 4 parental F(ab')2 fragments and from 1.88 to 10.14 x 10(9) M(-1) for the BpAbs, demonstrating the advantage of biparatopic binding over conventional F(ab')2 binding. The Ka improvement was particularly high for BpAb F6/35A7 and BpAb F6/B17 with a 9.5- and 8.1-fold increase, respectively, as compared with the parental F(ab')2. In vivo, the 6 BpAbs were compared with their 2 respective parental F(ab')2 by injection of 131I-BpAb/125I-F(ab')2 parental fragments into nude mice xenografted with the human colon carcinoma T380. Dissection 72 hr post-injection demonstrated that BpAb B17/CE25 and BpAb F6/B17 gave higher tumor uptake than that of their parental F(ab')2. This finding is particularly interesting for BpAb F6/B17, which compared favorably with the F6 F(ab')2, one of the best parental F(ab')2 fragments used in our study.

Local optima networks of hard combinatorial landscapes

Combinatorial optimization involves finding an optimal solution in a finite set of options; many everyday life problems are of this kind. However, the number of options grows exponentially with the size of the problem, such that an exhaustive search for the best solution is practically infeasible beyond a certain problem size. When efficient algorithms are not available, a practical approach to obtain an approximate solution to the problem at hand, is to start with an educated guess and gradually refine it until we have a good-enough solution. Roughly speaking, this is how local search heuristics work. These stochastic algorithms navigate the problem search space by iteratively turning the current solution into new candidate solutions, guiding the search towards better solutions. The search performance, therefore, depends on structural aspects of the search space, which in turn depend on the move operator being used to modify solutions. A common way to characterize the search space of a problem is through the study of its fitness landscape, a mathematical object comprising the space of all possible solutions, their value with respect to the optimization objective, and a relationship of neighborhood defined by the move operator. The landscape metaphor is used to explain the search dynamics as a sort of potential function. The concept is indeed similar to that of potential energy surfaces in physical chemistry. Borrowing ideas from that field, we propose to extend to combinatorial landscapes the notion of the inherent network formed by energy minima in energy landscapes. In our case, energy minima are the local optima of the combinatorial problem, and we explore several definitions for the network edges. At first, we perform an exhaustive sampling of local optima basins of attraction, and define weighted transitions between basins by accounting for all the possible ways of crossing the basins frontier via one random move. Then, we reduce the computational burden by only counting the chances of escaping a given basin via random kick moves that start at the local optimum. Finally, we approximate network edges from the search trajectory of simple search heuristics, mining the frequency and inter-arrival time with which the heuristic visits local optima. Through these methodologies, we build a weighted directed graph that provides a synthetic view of the whole landscape, and that we can characterize using the tools of complex networks science. We argue that the network characterization can advance our understanding of the structural and dynamical properties of hard combinatorial landscapes. We apply our approach to prototypical problems such as the Quadratic Assignment Problem, the NK model of rugged landscapes, and the Permutation Flow-shop Scheduling Problem. We show that some network metrics can differentiate problem classes, correlate with problem non-linearity, and predict problem hardness as measured from the performances of trajectory-based local search heuristics.

Scheduling an European basketball competition. An application of graph theory

The object of this project is to schedule a ctitious European basketball competition with many teams situated a long distances. The schedule must be fair, feasible and economical, which means that the total distance trav- eled by every team must be the minimal possible. First, we de ne the sport competition terminology and study di erent competition systems, focusing on the NBA and the Euroleague systems. Then we de ne concepts of graph theory and spherical distance that will be needed. Next we propose a com- petition system, explaining where will be allocated the teams and how will be the scheduling. Then there is a description of the programs that have been implemented, and, nally, the complete schedule is displayed, and some possible improvements are mentioned.

An open source browser-based software tool for graph drawing and visualisation

In this research work we searched for open source libraries which supports graph drawing and visualisation and can run in a browser. Subsequent these libraries were evaluated to find out which one is the best for this task. The result was the d3.js is that library which has the greatest functionality, flexibility and customisability. Afterwards we developed an open source software tool where d3.js was included and which was written in JavaScript so that it can run browser-based.

WebGraphEd, an open source graph drawing editor for the web

WebGraphEd is an open source software for graph visualization and manipulation. It is especially designed to work for the web platform through a web browser. The web application has been written in JavaScript and compacted later, which makes it a very lightweight software. There is no need of additional software, and the only requirement is to have an HTML5 compliant browser. WebGraphEd works with scalable vector graphics (SVG), which it makes possible to create lossless graph drawings.

A note on the periodic orbits and topological entropy of graph maps

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits.