The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing: Extended Survey

Graph processing is becoming increasingly prevalent across many application domains. In spite of this prevalence, there is little research about how graphs are actually used in practice. We performed an extensive study that consisted of an online survey of 89 users, a review of the mailing lists, source repositories, and whitepapers of a large suite of graph software products, and in-person interviews with 6 users and 2 developers of these products. Our online survey aimed at understanding: (i) the types of graphs users have; (ii) the graph computations users run; (iii) the types of graph software users use; and (iv) the major challenges users face when processing their graphs. We describe the participants' responses to our questions highlighting common patterns and challenges. Based on our interviews and survey of the rest of our sources, we were able to answer some new questions that were raised by participants' responses to our online survey and understand the specific applications that use graph data and software. Our study revealed surprising facts about graph processing in practice. In particular, real-world graphs represent a very diverse range of entities and are often very large, scalability and visualization are undeniably the most pressing challenges faced by participants, and data integration, recommendations, and fraud detection are very popular applications supported by existing graph software. We hope these findings can guide future research

Palgol: A High-Level DSL for Vertex-Centric Graph Processing with Remote Data Access

Pregel is a popular distributed computing model for dealing with large-scale graphs. However, it can be tricky to implement graph algorithms correctly and efficiently in Pregel's vertex-centric model, especially when the algorithm has multiple computation stages, complicated data dependencies, or even communication over dynamic internal data structures. Some domain-specific languages (DSLs) have been proposed to provide more intuitive ways to implement graph algorithms, but due to the lack of support for remote access --- reading or writing attributes of other vertices through references --- they cannot handle the above mentioned dynamic communication, causing a class of Pregel algorithms with fast convergence impossible to implement. To address this problem, we design and implement Palgol, a more declarative and powerful DSL which supports remote access. In particular, programmers can use a more declarative syntax called chain access to naturally specify dynamic communication as if directly reading data on arbitrary remote vertices. By analyzing the logic patterns of chain access, we provide a novel algorithm for compiling Palgol programs to efficient Pregel code. We demonstrate the power of Palgol by using it to implement several practical Pregel algorithms, and the evaluation result shows that the efficiency of Palgol is comparable with that of hand-written code.Comment: 12 pages, 10 figures, extended version of APLAS 2017 pape

Dating the Sea of Marmara sediments by a uniform mixing model

The sedimentation rates and Pb-210 fluxes on sediment surfaces were measured in the north, northwestern and southwestern parts of the Sea of Marmara. Each core had varying thickness of constant Pb-210 activity regions followed by a decreasing part with sediment depth. The sedimentation rates of the samples collected from the Bosporus and the Dardanelles could not be analysed due to the homogenization of activity in the strong currents of these straits. A uniform mixing model is proposed for the simultaneous analysis of sedimentation rates, Pb-210 fluxes and mixing depths from the experimental data. In this model, the parameters were obtained by minimizing the multi-dimensional parameter space using a grid search algorithm. The Pb-210 fluxes were found to be about 0.048 Bq cm(-2) year(-1) for all sampling sites. The mass sedimentation rates were 0.19 and 0.073 g cm(-2) year(-1) at the shelves of the Bosporus and the Dardanelles and 0.055 and 0.064 g cm(-2) year(-1) in the northwestern and middle northern basins, respectively, of the Sea of Marmara. Copyright (C) 1996 Elsevier Science Limite

GYM: A Multiround Distributed Join Algorithm

Multiround algorithms are now commonly used in distributed data processing systems, yet the extent to which algorithms can benefit from running more rounds is not well understood. This paper answers this question for several rounds for the problem of computing the equijoin of n relations. Given any query Q with width w, intersection width iw, input size IN, output size OUT, and a cluster of machines with M=Omega(IN frac{1}{epsilon}) memory available per machine, where epsilon > 1 and w ge 1 are constants, we show that: 1. Q can be computed in O(n) rounds with O(n(INw + OUT)2/M) communication cost with high probability. Q can be computed in O(log(n)) rounds with O(n(INmax(w, 3iw) + OUT)2/M) communication cost with high probability. Intersection width is a new notion we introduce for queries and generalized hypertree decompositions (GHDs) of queries that captures how connected the adjacent components of the GHDs are. We achieve our first result by introducing a distributed and generalized version of Yannakakis\u27s algorithm, called GYM. GYM takes as input any GHD of Q with width w and depth d, and computes Q in O(d + log(n)) rounds and O(n (INw + OUT)2/M) communication cost. We achieve our second result by showing how to construct GHDs of Q with width max(w, 3iw) and depth O(log(n)). We describe another technique to construct GHDs with longer widths and lower depths, demonstrating other tradeoffs one can make between communication and the number of rounds

BACE1 inhibition more effectively suppresses initiationthan progression of β-amyloid pathology

International audienc

Electronic and optical properties of 4.2 μm"N" structured superlattice MWIR photodetectors

We report on the development of a new structure for type II superlattice photodiodes that we call the "N" design. In this new design, we insert an electron barrier between InAs and GaSb in the growth direction. The barrier pushes the electron and hole wavefunctions towards the layer edges and under bias, increases the overlap integral by about 25% leading to higher detectivity. InAs/AlSb/GaSb superlattices were studied with density functional theory. Both AlAs and InSb interfaces were taken into account by calculating the heavy hole-light hole (HH-LH) splittings. Experiments were carried out on single pixel photodiodes by measuring electrical and optical performance. With cut-off wavelength of 4.2 μm at 120 K, temperature dependent dark current and detectivity measurements show that the dark current is 2.5 × 10 -9 A under zero bias with corresponding R0A resistance of 1.5 × 104 Ω cm2 for the 500 × 500 μm2 single pixel square photodetectors. Photodetector reaches BLIP condition at 125 K with the BLIP detectivity (DBLIP) of 2.6 × 10 10 Jones under 300 K background and -0.3 V bias voltage. © 2012 Elsevier B.V. All rights reserved

The ocean sampling day consortium

Ocean Sampling Day was initiated by the EU-funded Micro B3 (Marine Microbial Biodiversity, Bioinformatics, Biotechnology) project to obtain a snapshot of the marine microbial biodiversity and function of the world’s oceans. It is a simultaneous global mega-sequencing campaign aiming to generate the largest standardized microbial data set in a single day. This will be achievable only through the coordinated efforts of an Ocean Sampling Day Consortium, supportive partnerships and networks between sites. This commentary outlines the establishment, function and aims of the Consortium and describes our vision for a sustainable study of marine microbial communities and their embedded functional traits

Potential impacts of climate change on the primary production of regional seas: A comparative analysis of five European seas

Regional seas are potentially highly vulnerable to climate change, yet are the most directly societally important regions of the marine environment. The combination of widely varying conditions of mixing, forcing, geography (coastline and bathymetry) and exposure to the open-ocean makes these seas subject to a wide range of physical processes that mediates how large scale climate change impacts on these seas’ ecosystems. In this paper we explore the response of five regional sea areas to potential future climate change, acting via atmospheric, oceanic and terrestrial vectors. These include the Barents Sea, Black Sea, Baltic Sea, North Sea, Celtic Seas, and are contrasted with a region of the Northeast Atlantic. Our aim is to elucidate the controlling dynamical processes and how these vary between and within these seas. We focus on primary production and consider the potential climatic impacts on: long term changes in elemental budgets, seasonal and mesoscale processes that control phytoplankton’s exposure to light and nutrients, and briefly direct temperature response. We draw examples from the MEECE FP7 project and five regional model systems each using a common global Earth System Model as forcing. We consider a common analysis approach, and additional sensitivity experiments. Comparing projections for the end of the 21st century with mean present day conditions, these simulations generally show an increase in seasonal and permanent stratification (where present). However, the first order (low- and mid-latitude) effect in the open ocean projections of increased permanent stratification leading to reduced nutrient levels, and so to reduced primary production, is largely absent, except in the NE Atlantic. Even in the two highly stratified, deep water seas we consider (Black and Baltic Seas) the increase in stratification is not seen as a first order control on primary production. Instead, results show a highly heterogeneous picture of positive and negative change arising from complex combinations of multiple physical drivers, including changes in mixing, circulation and temperature, which act both locally and non-locally through advection

The Future is Big Graphs! A Community View on Graph Processing Systems

Graphs are by nature unifying abstractions that can leverage interconnectedness to represent, explore, predict, and explain real- and digital-world phenomena. Although real users and consumers of graph instances and graph workloads understand these abstractions, future problems will require new abstractions and systems. What needs to happen in the next decade for big graph processing to continue to succeed?Comment: 12 pages, 3 figures, collaboration between the large-scale systems and data management communities, work started at the Dagstuhl Seminar 19491 on Big Graph Processing Systems, to be published in the Communications of the AC