The Swiss board directors network in 2009

We study the networks formed by the directors of the most important Swiss boards and the boards themselves for the year 2009. The networks are obtained by projection from the original bipartite graph. We highlight a number of important statistical features of those networks such as degree distribution, weight distribution, and several centrality measures as well as their interrelationships. While similar statistics were already known for other board systems, and are comparable here, we have extended the study with a careful investigation of director and board centrality, a k-core analysis, and a simulation of the speed of information propagation and its relationships with the topological aspects of the network such as clustering and link weight and betweenness. The overall picture that emerges is one in which the topological structure of the Swiss board and director networks has evolved in such a way that special actors and links between actors play a fundamental role in the flow of information among distant parts of the network. This is shown in particular by the centrality measures and by the simulation of a simple epidemic process on the directors networ

Critical Cooperation Range to Improve Spatial Network Robustness

A robust worldwide air-transportation network (WAN) is one that minimizes the number of stranded passengers under a sequence of airport closures. Building on top of this realistic example, here we address how spatial network robustness can profit from cooperation between local actors. We swap a series of links within a certain distance, a cooperation range, while following typical constraints of spatially embedded networks. We find that the network robustness is only improved above a critical cooperation range. Such improvement can be described in the framework of a continuum transition, where the critical exponents depend on the spatial correlation of connected nodes. For the WAN we show that, except for Australia, all continental networks fall into the same universality class. Practical implications of this result are also discussed

Visualising the Search Landscape of the Triangle Program

High order mutation analysis of a software engineering benchmark, including schema and local optima networks, suggests program improvements may not be as hard to find as is often assumed. 1) Bit-wise genetic building blocks are not deceptive and can lead to all global optima. 2) There are many neutral networks, plateaux and local optima, nevertheless in most cases near the human written C source code there are hill climbing routes including neutral moves to solutions

The Swiss Board Directors Network in 2009

We study the networks formed by the directors of the most important Swiss boards and the boards themselves for the year 2009. The networks are obtained by projection from the original bipartite graph. We highlight a number of important statistical features of those networks such as degree distribution, weight distribution, and several centrality measures as well as their interrelationships. While similar statistics were already known for other board systems, and are comparable here, we have extended the study with a careful investigation of director and board centrality, a k-core analysis, and a simulation of the speed of information propagation and its relationships with the topological aspects of the network such as clustering and link weight and betweenness. The overall picture that emerges is one in which the topological structure of the Swiss board and director networks has evolved in such a way that special actors and links between actors play a fundamental role in the flow of information among distant parts of the network. This is shown in particular by the centrality measures and by the simulation of a simple epidemic process on the directors network.Comment: Submitted to The European Physical Journal

Hydroxylation of a hederagenin derived saponin by a Xylareaceous fungus found in fruits of Sapindus saponaria

During our screening of tropical plants for endophyte microorganisms, a Xylareaceous fungus was found living on the internal part of Sapindus saponaria fruits. The fruits of S. saponaria accumulate great amounts of triterpenoidal and sesquiterpenoidal saponins. The saponin 3-O-(β-D-xylopyranosyl)-(1→3)-α-L-rhamnopyranosyl-(1→2)-α-L-arabinopyranosyl-hederagenin was isolated using chromatographic methods, after alkaline hydrolysis of the crude extract obtained from S. saponaria fruits and added to the culture medium used to grows the fungus. A new saponin was isolated from this experiment by preparative scale HPLC and characterized as a 22α-hydroxy derivative. The structure of this hydroxylated saponin was elucidated based on interpretation of MS/MS data and NMR spectra

Production of 5-hydroxy-7-methoxy-4-methylphthalide in a culture of Penicillium crustosum.

The chemical reactions carried out by microorganisms have been used as a tool in modern chemistry. This paper reports the production of mycophenolic acid and a new phthalide by the endophytic fungus Penicillium crustosum obtained from coffee seeds. The fungus was cultivated in a liquid medium for a period of seven days and after that the culture medium was divided into four treatments: A, B, C and D, to which different organic substances were added. Treatment A was maintained as the control to evaluate the occurrence of biotransformation. Organic acids were added to the culture media of treatments B (ferulic and quinic acids) and C [cinnamic and 3,4-(methylenedioxy) cinnamic acids], and caffeine was added in the treatment D. All these organic compounds were dissolved in DMSO, and the fermentation was maintained for more 13 days, totalizing 20 days. Mycophenolic acid was isolated from the culture with no added acids (treatment A). Mycophenolic acid and a new phthalide, 5-hydroxy-7-methoxy-4-methylphthalide were isolated from treatments B and C, and mycophenolic acid and caffeine (added to the culture medium) were isolated from treatment D. The structures were determined by NMR techniques and confi rmed by MS and MS/MS technique

Pareto Local Optima of Multiobjective NK-Landscapes with Correlated Objectives

International audienceIn this paper, we conduct a fitness landscape analysis for multiobjective combinatorial optimization, based on the local optima of multiobjective NK-landscapes with objective correlation. In single-objective optimization, it has become clear that local optima have a strong impact on the performance of metaheuristics. Here, we propose an extension to the multiobjective case, based on the Pareto dominance. We study the co-influence of the problem dimension, the degree of non-linearity, the number of objectives and the correlation degree between objective functions on the number of Pareto local optima

The Local Optima Level in Chemotherapy Schedule Optimisation

In this paper a multi-drug Chemotherapy Schedule Optimisation Problem (CSOP) is subject to Local Optima Network (LON) analysis. LONs capture global patterns in fitness landscapes. CSOPs have not previously been subject to fitness landscape analysis. We fill this gap: LONs are constructed and studied for meaningful structure. The CSOP formulation presents novel challenges and questions for the LON model because there are infeasible regions in the fitness landscape and an unknown global optimum; it also brings a topic from healthcare to LON analysis. Two LON Construction algorithms are proposed for sampling CSOP fitness landscapes: a Markov-Chain Construction Algorithm and a Hybrid Construction Algorithm. The results provide new insight into LONs of highly-constrained spaces, and into the proficiency of search operators on the CSOP. Iterated Local Search and Memetic Search, which are the foundations for the LON algorithms, are found to markedly out-perform a Genetic Algorithm from the literature

How do we estimate survival? External validation of a tool for survival estimation in patients with metastatic bone disease-decision analysis and comparison of three international patient populations.

Abstract BACKGROUND: We recently developed a clinical decision support tool, capable of estimating the likelihood of survival at 3 and 12 months following surgery for patients with operable skeletal metastases. After making it publicly available on www.PATHFx.org , we attempted to externally validate it using independent, international data. METHODS: We collected data from patients treated at 13 Italian orthopaedic oncology referral centers between 2010 and 2013, then applied to PATHFx, which generated a probability of survival at three and 12-months for each patient. We assessed accuracy using the area under the receiver-operating characteristic curve (AUC), clinical utility using Decision Curve Analysis (DCA), and compared the Italian patient data to the training set (United States) and first external validation set (Scandinavia). RESULTS: The Italian dataset contained 287 records with at least 12 months follow-up information. The AUCs for the three-month and 12-month estimates was 0.80 and 0.77, respectively. There were missing data, including the surgeon's estimate of survival that was missing in the majority of records. Physiologically, Italian patients were similar to patients in the training and first validation sets. However notable differences were observed in the proportion of those surviving three and 12-months, suggesting differences in referral patterns and perhaps indications for surgery. CONCLUSIONS: PATHFx was successfully validated in an Italian dataset containing missing data. This study demonstrates its broad applicability to European patients, even in centers with differing treatment philosophies from those previously studied

Coarse-Grained Barrier Trees of Fitness Landscapes

Recent literature suggests that local optima in fitness landscapes are clustered, which offers an explanation of why perturbation-based metaheuristics often fail to find the global optimum: they become trapped in a sub-optimal cluster. We introduce a method to extract and visualize the global organization of these clusters in form of a barrier tree. Barrier trees have been used to visualize the barriers between local optima basins in fitness landscapes. Our method computes a more coarsely grained tree to reveal the barriers between clusters of local optima. The core element is a new variant of the flooding algorithm, applicable to local optima networks, a compressed representation of fitness landscapes. To identify the clusters, we apply a community detection algorithm. A sample of 200 NK fitness landscapes suggests that the depth of their coarse-grained barrier tree is related to their search difficulty