Approximate weighted matching on emerging manycore and multithreaded architectures

2012 ◽  
Vol 26 (4) ◽  
pp. 413-430 ◽  
Author(s):  
Mahantesh Halappanavar ◽  
John Feo ◽  
Oreste Villa ◽  
Antonino Tumeo ◽  
Alex Pothen
Keyword(s):  
Approximation Algorithms ◽  
Large Scale ◽  
Scientific Computing ◽  
Graph Matching ◽  
Combinatorial Problem ◽  
Fine Tuning ◽  
Matching Problem ◽  
Weighted Matching ◽  
Wide Range ◽  
The Impact

Graph matching is a prototypical combinatorial problem with many applications in high-performance scientific computing. Optimal algorithms for computing matchings are challenging to parallelize. Approximation algorithms are amenable to parallelization and are therefore important to compute matchings for large-scale problems. Approximation algorithms also generate nearly optimal solutions that are sufficient for many applications. In this paper we present multithreaded algorithms for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi), and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first uses shared work queues and is suited for all platforms; and the second implementation, based on dataflow principles, exploits special features available on the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of about [Formula: see text] on [Formula: see text] cores of an AMD Magny-Cours, [Formula: see text] on [Formula: see text] cores of Intel Nehalem, [Formula: see text] on Nvidia Tesla and [Formula: see text] on Nvidia Fermi relative to one core of Intel Nehalem, and [Formula: see text] on [Formula: see text] processors of Cray XMT. We demonstrate strong as well as weak scaling for graphs with up to a billion edges using up to 12,800 threads. We avoid excessive fine-tuning for each platform and retain the basic structure of the algorithm uniformly across platforms. An exception is the dataflow algorithm designed specifically for the Cray XMT. To the best of the authors' knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on multithreaded platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

scholarly journals Large-scale Semantic Parsing without Question-Answer Pairs

2014 ◽  
Vol 2 ◽  
pp. 377-392 ◽  
Author(s):  
Siva Reddy ◽  
Mirella Lapata ◽  
Mark Steedman
Keyword(s):  
Natural Language ◽  
Large Scale ◽  
Graph Matching ◽  
State Of The Art ◽  
The State ◽  
Semantic Parsing ◽  
Matching Problem ◽  
Weak Supervision ◽  
Benchmark Datasets

In this paper we introduce a novel semantic parsing approach to query Freebase in natural language without requiring manual annotations or question-answer pairs. Our key insight is to represent natural language via semantic graphs whose topology shares many commonalities with Freebase. Given this representation, we conceptualize semantic parsing as a graph matching problem. Our model converts sentences to semantic graphs using CCG and subsequently grounds them to Freebase guided by denotations as a form of weak supervision. Evaluation experiments on a subset of the Free917 and WebQuestions benchmark datasets show our semantic parser improves over the state of the art.

scholarly journals Self-Supervised Pre-Training of Transformers for Satellite Image Time Series Classification

2020 ◽  
Author(s):  
Yuan Yuan ◽  
Lei Lin
Keyword(s):  
Time Series ◽  
Deep Learning ◽  
Large Scale ◽  
Temporal Structure ◽  
Satellite Image ◽  
Fine Tuning ◽  
Small Scale ◽  
Model Parameters ◽  
Learning Approaches ◽  
Wide Range

Satellite image time series (SITS) classification is a major research topic in remote sensing and is relevant for a wide range of applications. Deep learning approaches have been commonly employed for SITS classification and have provided state-of-the-art performance. However, deep learning methods suffer from overfitting when labeled data is scarce. To address this problem, we propose a novel self-supervised pre-training scheme to initialize a Transformer-based network by utilizing large-scale unlabeled data. In detail, the model is asked to predict randomly contaminated observations given an entire time series of a pixel. The main idea of our proposal is to leverage the inherent temporal structure of satellite time series to learn general-purpose spectral-temporal representations related to land cover semantics. Once pre-training is completed, the pre-trained network can be further adapted to various SITS classification tasks by fine-tuning all the model parameters on small-scale task-related labeled data. In this way, the general knowledge and representations about SITS can be transferred to a label-scarce task, thereby improving the generalization performance of the model as well as reducing the risk of overfitting. Comprehensive experiments have been carried out on three benchmark datasets over large study areas. Experimental results demonstrate the effectiveness of the proposed method, leading to a classification accuracy increment up to 1.91% to 6.69%. <div><b>This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.</b></div>

scholarly journals OncoThreads: Visualization of Large Scale Longitudinal Cancer Molecular Data

2021 ◽  
Author(s):  
Theresa A Harbig ◽  
Sabrina Nusrat ◽  
Tali Mazor ◽  
Qianwen Wang ◽  
Alexander Thomson ◽  
...  
Keyword(s):  
Longitudinal Data ◽  
Large Scale ◽  
Cancer Genomics ◽  
Temporal Patterns ◽  
Molecular Data ◽  
Liquid Biopsies ◽  
Sequencing Technologies ◽  
Molecular Features ◽  
Wide Range ◽  
The Impact

Molecular profiling of patient tumors and liquid biopsies over time with next-generation sequencing technologies and new immuno-profile assays are becoming part of standard research and clinical practice. With the wealth of new longitudinal data, there is a critical need for visualizations for cancer researchers to explore and interpret temporal patterns not just in a single patient but across cohorts. To address this need we developed OncoThreads, a tool for the visualization of longitudinal clinical and cancer genomics and other molecular data in patient cohorts. The tool visualizes patient cohorts as temporal heatmaps and Sankey diagrams that support the interactive exploration and ranking of a wide range of clinical and molecular features. This allows analysts to discover temporal patterns in longitudinal data, such as the impact of mutations on response to a treatment, e.g. emergence of resistant clones. We demonstrate the functionality of OncoThreads using a cohort of 23 glioma patients sampled at 2-4 timepoints. OncoThreads is freely available at http://oncothreads.gehlenborglab.org and implemented in Javascript using the cBioPortal web API as a backend.

Ivan Kavaleridze`s dramaturgy on the Sumy stage

2021 ◽  
Author(s):  
D.V. Budianskyi
Keyword(s):  
Large Scale ◽  
Musical Comedy ◽  
Historical Figures ◽  
Wide Range ◽  
Socialist Realist ◽  
History Of ◽  
Characteristic Features ◽  
Old Men ◽  
The Impact ◽  
First Time

The characteristic features of I. Kavaleridze’s drama is considered in the article. It is noted that there are signs of the artist’s individuality, attraction to expressionist forms, artistic techniques characteristic for the art of sculpture: symbolism, monumentality, hyperbole. I. Kavaleridze was well versed in the drama laws, understood the specifics of the stage events construction, had a large arsenal of literary means, thanks to which the characters’ monologues and dialogues were extremely expressive and colorful. In his work, he implemented original solutions that were ahead of time. Therefore, many of the artist’s ideas and achievements received due recognition only after his death. I. Kavaleridze’s creative heritage covers a wide range of both purely artistic and general philosophical problems. Among them the formation of the era of modernism and its features in the Ukrainian art of the early XX century, the impact of revolutionary ideas on the work of the 1920s, the role of spiritual leaders of the Ukrainian people T. Shevchenko and G. Skovoroda in the formation of national consciousness, political and ideological pressure on figurative art language and the formation of a socialist-realist canon, etc. The analysis of the productions of I. Kavalerizde’s plays “The First Furrow” and “Gregory and Paraskeva” on the stage of the Mykhailo Shchepkin Sumy Theater of Drama and Musical Comedy in 1970-1972. The article notes that these plays were staged in Sumy for the first time in the history of Ukrainian theater. The premiere of “The First Furrow” (the play was called “Old Men”) took place on March 19, 1970. The figure of the national genius Hryhoriy Skov oroda was als o embodied for the first time on t he stage in Sumy in th e play “Hryhoriy and Paraskeva”. It premiered on October 21, 1972. I. Rybchynsky, Honored Artist of the USSR, performed the production. Creating generalized historical outlines of people’s life, features of life at that time, depicting psychological portraits of people in various, sometimes-dramatic collisions, in the productions of I. Kavaleridze’s plays on the Sumy stage the emphasis was on universal values such as virtue, love. The main character was the Ukrainian people, who nurtured such large-scale historical figures, gave them strength and wisdom for great achievements. Based on publications in periodicals of that time, memoirs of Ukrainian directors, the peculiarities of the director’s interpretation, stenographic and musical design of these plays on the Sumy stage are considered. Considerable attention is paid to the analysis of acting works in I. Kavaleridze’s plays. In particular, the peculiarities of the actor’s embodiment of the image of the national genius Hryhoriy Skovoroda on the stage are presented. It is noted that I. Kavaleridze’s plays, created in a difficult political, social and ideological context, are rightly considered to be highly artistic works of Ukrainian drama. Their staging was carried out on various theatrical stages, including Mykhailo Shchepkin Sumy Theater of Drama and Musical Comedy is an important page of national theatrical art.

Cloud in Science

2014 ◽  
pp. 165-191
Keyword(s):  
Cloud Computing ◽  
Large Scale ◽  
Scientific Computing ◽  
Scientific Discovery ◽  
Software Environment ◽  
Access To Resources ◽  
On Demand ◽  
Service Models ◽  
New Models ◽  
The Impact

Cloud computing technologies and service models are attractive to scientific computing users due to the ability to get on-demand access to resources as well as the ability to control the software environment. Scientific computing researchers and resource providers servicing these users are considering the impact of new models and technologies. SaaS solutions like Globus Online and IaaS solutions such as Nimbus Infrastructure and OpenNebula accelerate the discovery of science by helping scientists to conduct advanced and large-scale science. This chapter describes how cloud is helping researchers to accelerate scientific discovery by transforming manual and difficult tasks into the cloud.

scholarly journals Economics of the disintegration of the Greenland ice sheet

2019 ◽  
Vol 116 (25) ◽  
pp. 12261-12269 ◽  
Author(s):  
William Nordhaus
Keyword(s):  
Climate Change ◽  
Large Scale ◽  
Social Cost ◽  
Climate Models ◽  
Ice Sheet ◽  
Greenland Ice Sheet ◽  
Reduced Form ◽  
Small Contribution ◽  
Wide Range ◽  
The Impact

Concerns about the impact on large-scale earth systems have taken center stage in the scientific and economic analysis of climate change. The present study analyzes the economic impact of a potential disintegration of the Greenland ice sheet (GIS). The study introduces an approach that combines long-run economic growth models, climate models, and reduced-form GIS models. The study demonstrates that social cost–benefit analysis and damage-limiting strategies can be usefully extended to illuminate issues with major long-term consequences, as well as concerns such as potential tipping points, irreversibility, and hysteresis. A key finding is that, under a wide range of assumptions, the risk of GIS disintegration makes a small contribution to the optimal stringency of current policy or to the overall social cost of climate change. It finds that the cost of GIS disintegration adds less than 5% to the social cost of carbon (SCC) under alternative discount rates and estimates of the GIS dynamics.

scholarly journals InSAR Greece with Parallelized Persistent Scatterer Interferometry: A National Ground Motion Service for Big Copernicus Sentinel-1 Data

2020 ◽  
Vol 12 (19) ◽  
pp. 3207
Author(s):  
Ioannis Papoutsis ◽  
Charalampos Kontoes ◽  
Stavroula Alatza ◽  
Alexis Apostolakis ◽  
Constantinos Loupasakis
Keyword(s):  
Time Series ◽  
Ground Motion ◽  
Large Scale ◽  
Persistent Scatterer Interferometry ◽  
Persistent Scatterers ◽  
Processing Chain ◽  
Persistent Scatterer ◽  
Basin Scale ◽  
Wide Range ◽  
The Impact

Advances in synthetic aperture radar (SAR) interferometry have enabled the seamless monitoring of the Earth’s crust deformation. The dense archive of the Sentinel-1 Copernicus mission provides unprecedented spatial and temporal coverage; however, time-series analysis of such big data volumes requires high computational efficiency. We present a parallelized-PSI (P-PSI), a novel, parallelized, and end-to-end processing chain for the fully automated assessment of line-of-sight ground velocities through persistent scatterer interferometry (PSI), tailored to scale to the vast multitemporal archive of Sentinel-1 data. P-PSI is designed to transparently access different and complementary Sentinel-1 repositories, and download the appropriate datasets for PSI. To make it efficient for large-scale applications, we re-engineered and parallelized interferogram creation and multitemporal interferometric processing, and introduced distributed implementations to best use computing cores and provide resourceful storage management. We propose a new algorithm to further enhance the processing efficiency, which establishes a non-uniform patch grid considering land use, based on the expected number of persistent scatterers. P-PSI achieves an overall speed-up by a factor of five for a full Sentinel-1 frame for processing in a 20-core server. The processing chain is tested on a large-scale project to calculate and monitor deformation patterns over the entire extent of the Greek territory—our own Interferometric SAR (InSAR) Greece project. Time-series InSAR analysis was performed on volumes of about 12 TB input data corresponding to more than 760 Single Look Complex Sentinel-1A and B images mostly covering mainland Greece in the period of 2015–2019. InSAR Greece provides detailed ground motion information on more than 12 million distinct locations, providing completely new insights into the impact of geophysical and anthropogenic activities at this geographic scale. This new information is critical to enhancing our understanding of the underlying mechanisms, providing valuable input into risk assessment models. We showcase this through the identification of various characteristic geohazard locations in Greece and discuss their criticality. The selected geohazard locations, among a thousand, cover a wide range of catastrophic events including landslides, land subsidence, and structural failures of various scales, ranging from a few hundredths of square meters up to the basin scale. The study enriches the large catalog of geophysical related phenomena maintained by the GeObservatory portal of the Center of Earth Observation Research and Satellite Remote Sensing BEYOND of the National Observatory of Athens for the opening of new knowledge to the wider scientific community.

scholarly journals Activity-dependent myelination: A glial mechanism of oscillatory self-organization in large-scale brain networks

2020 ◽  
Vol 117 (24) ◽  
pp. 13227-13237 ◽  
Author(s):  
Rabiya Noori ◽  
Daniel Park ◽  
John D. Griffiths ◽  
Sonya Bells ◽  
Paul W. Frankland ◽  
...  
Keyword(s):  
White Matter ◽  
Large Scale ◽  
Phase Synchronization ◽  
Brain Networks ◽  
Self Organization ◽  
Conduction Delay ◽  
Neural Communication ◽  
Wide Range ◽  
The Impact ◽  
Activity Dependent

Communication and oscillatory synchrony between distributed neural populations are believed to play a key role in multiple cognitive and neural functions. These interactions are mediated by long-range myelinated axonal fiber bundles, collectively termed as white matter. While traditionally considered to be static after development, white matter properties have been shown to change in an activity-dependent way through learning and behavior—a phenomenon known as white matter plasticity. In the central nervous system, this plasticity stems from oligodendroglia, which form myelin sheaths to regulate the conduction of nerve impulses across the brain, hence critically impacting neural communication. We here shift the focus from neural to glial contribution to brain synchronization and examine the impact of adaptive, activity-dependent changes in conduction velocity on the large-scale phase synchronization of neural oscillators. Using a network model based on primate large-scale white matter neuroanatomy, our computational and mathematical results show that such plasticity endows white matter with self-organizing properties, where conduction delay statistics are autonomously adjusted to ensure efficient neural communication. Our analysis shows that this mechanism stabilizes oscillatory neural activity across a wide range of connectivity gain and frequency bands, making phase-locked states more resilient to damage as reflected by diffuse decreases in connectivity. Critically, our work suggests that adaptive myelination may be a mechanism that enables brain networks with a means of temporal self-organization, resilience, and homeostasis.

Motion Simulation Experiments for Driver Behavior and Road Vehicle Dynamics

2011 ◽  
Vol 11 (4) ◽  
Author(s):  
Kemper Lewis ◽  
Kevin Hulme ◽  
Edward Kasprzak ◽  
Deborah Moore-Russo ◽  
Gregory Fabiano
Keyword(s):  
Vehicle Dynamics ◽  
Large Scale ◽  
Driving Simulation ◽  
Vehicle Design ◽  
Simulation Environment ◽  
Learning Mechanisms ◽  
Road Vehicle ◽  
Wide Range ◽  
Traffic Systems ◽  
The Impact

This paper discusses the design and development of a motion-based driving simulation and its integration into driving simulation research. The integration of the simulation environment into a road vehicle dynamics curriculum is also presented. The simulation environment provides an immersive experience to conduct a wide range of research on driving behavior, vehicle design and intelligent traffic systems. From an education perspective, the environment is designed to promote hands-on student participation in real-world engineering experiences that enhance conventional learning mechanisms for road vehicle dynamics and engineering systems analysis. The paper assesses the impact of the environment on student learning objectives in an upper level vehicle dynamics course and presents results from research involving teenage drivers. The paper presents an integrated framework for the use of real-time simulation and large-scale visualization to both study driving behaviors and to discover the impact that design decisions have on vehicle design using a realistic simulated driving interface.

scholarly journals Approximation algorithms in combinatorial scientific computing

Acta Numerica ◽  
2019 ◽  
Vol 28 ◽  
pp. 541-633 ◽  
Author(s):  
Alex Pothen ◽  
S. M. Ferdous ◽  
Fredrik Manne
Keyword(s):  
Approximation Algorithms ◽  
Scientific Computing ◽  
Linear Time ◽  
Exact Algorithms ◽  
Edge Cover ◽  
Weighted Matching ◽  
Practical Algorithms ◽  
Modern Computer ◽  
Massive Graphs ◽  
Multiple Threads

We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of cardinality matching, edge-weighted matching, vertex-weighted matching and edge-weighted $b$-matching, and minimization versions of weighted edge cover and $b$-edge cover. Exact algorithms for these problems are impractical for massive graphs with several millions of edges. For each problem we discuss theoretical foundations, the design of several linear or near-linear time approximation algorithms, their implementations on serial and parallel computers, and applications. Our focus is on practical algorithms that yield good performance on modern computer architectures with multiple threads and interconnected processors. We also include information about the software available for these problems.

Sign in / Sign up

Export Citation Format

Share Document