PCN46 EPOIETIN ALPHA TREATMENT FOR CANCER PATIENTS WITH CHEMOTHERAPY INDUCED ANAEMIA–A COSTEFFECTIVENESS ANALYSIS FOR SWEDEN

Saturday, 5th June 1920

A Sparse Stress Model

Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding but transfers the idea from the layout space into a preprocessing phase. An initial experimental study informs a method to select representatives, and subsequent more extensive experiments indicate that our method yields better approximations of minimum-stress layouts in less time than related methods.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs

This paper presents a novel method for layout of undirected graphs, where nodes (vertices) are constrained to lie on a set of nested, simple, closed curves. Such a layout is useful to simultaneously display the structural centrality and vertex distance information for graphs in many domains, including social networks. Closed curves are a more general constraint than the previously proposed circles, and afford our method more flexibility to preserve vertex relationships compared to existing radial layout methods. The proposed approach modifies the multidimensional scaling (MDS) stress to include the estimation of a vertex depth or centrality field as well as a term that penalizes discord between structural centrality of vertices and their alignment with this carefully estimated field. We also propose a visualization strategy for the proposed layout and demonstrate its effectiveness using three social network datasets.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

A Regularized Graph Layout Framework for Dynamic Network Visualization

Many real-world networks, including social and information networks, are dynamic structures that evolve over time. Such dynamic networks are typically visualized using a sequence of static graph layouts. In addition to providing a visual representation of the network structure at each time step, the sequence should preserve the mental map between layouts of consecutive time steps to allow a human to interpret the temporal evolution of the network. In this paper, we propose a framework for dynamic network visualization in the on-line setting where only present and past graph snapshots are available to create the present layout. The proposed framework creates regularized graph layouts by augmenting the cost function of a static graph layout algorithm with a grouping penalty, which discourages nodes from deviating too far from other nodes belonging to the same group, and a temporal penalty, which discourages large node movements between consecutive time steps. The penalties increase the stability of the layout sequence, thus preserving the mental map. We introduce two dynamic layout algorithms within the proposed framework, namely dynamic multidimensional scaling (DMDS) and dynamic graph Laplacian layout (DGLL). We apply these algorithms on several data sets to illustrate the importance of both grouping and temporal regularization for producing interpretable visualizations of dynamic networks.Comment: To appear in Data Mining and Knowledge Discovery, supporting material (animations and MATLAB toolbox) available at http://tbayes.eecs.umich.edu/xukevin/visualization_dmkd_201

Three different mechanisms of energy dissipation of a desiccation-tolerant moss serve one common purpose: to protect reaction centres against photo-oxidation*

Three different types of non-photochemical de-excitation of absorbed light energy protect photosystem II of the sun- and desiccation-tolerant moss Rhytidium rugosum against photo-oxidation. The first mechanism, which is light-induced in hydrated thalli, is sensitive to inhibition by dithiothreitol. It is controlled by the protonation of a thylakoid protein. Other mechanisms are activated by desiccation. One of them permits exciton migration towards a far-red band in the antenna pigments where fast thermal deactivation takes place. This mechanism appears to be similar to a mechanism detected before in desiccated lichens. A third mechanism is based on the reversible photo-accumulation of a radical that acts as a quencher of excitation energy in reaction centres of photosystem II. On the basis of absorption changes around 800 nm, the quencher is suggested to be an oxidized chlorophyll. The data show that desiccated moss is better protected against photo-oxidative damage than hydrated moss. Slow drying of moss thalli in the light increases photo-protection more than slow drying in darkness