Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aaron Vose

dblp:165/1250 · also Aaron D. Vose · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 87% Parallel and multicore computing · 13%
Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Debugging and program repair › software debugging
relative debugging
0.212015
Relative debugging for a highly parallel hybrid computer system · SC 2015
GPUs and heterogeneous computing
GPU computing
0.212015
Relative debugging for a highly parallel hybrid computer system · SC 2015
GPUs and heterogeneous computing › heterogeneous computing systems
hybrid computer
0.212015
Relative debugging for a highly parallel hybrid computer system · SC 2015
Parallel and multicore computing
parallel programming models
0.112015
Relative debugging for a highly parallel hybrid computer system · SC 2015

Methods — techniques the papers use, named apart from their topics

data model · 0.4case study · 0.4
YearPublicationVenuePosition
2020 Deep Learning Predicts Protein-Ligand Interactions
abstract
This paper presents results from a rapid-response industry-academia collaboration for virtual screening of chemical, natural and virtual drug ligands towards identifying potential therapeutics for COVID-19. Compared to resource-intensive traditional approaches of either conducting high- throughput screening in a lab or in-silico molecular dynamics simulations on supercomputers, we have developed an open- source framework that leverages artificial intelligence (AI) to accurately and quickly predict the binding potential of a drug ligand with a target protein. We have trained a novel molecular-highway graph neural network architecture using the entirety of the BindingDB database to predict the probability of a drug ligand binding to a protein target. Our approach achieves a prodigious 98.3% accuracy with its predictions. Through this paper, we disseminate our source code and use the AI model to screen both public (ChEMBL, DrugBank) and proprietary databases. Compared to other AI-based methods, our approach outperforms the state-of-the-art on the following metrics - (i) number of molecules currently undergoing active clinical trials, (ii) number of antiviral drugs correctly identified, (iii) accuracy despite not needing active-site priors, and (iv) ability to screen more compounds in unit time.
Jacob Balma, Aaron Vose, Yuri K. Peterson, Amar G. Chittiboyina, Pankaj Pandey, Charles R. Yates, Ikhlas A. Khan, Sreenivas R. Sukumar 0001
IEEE BigData2
2015 Relative debugging for a highly parallel hybrid computer system
abstract
Relative debugging traces software errors by comparing two executions of a program concurrently - one code being a reference version and the other faulty. Relative debugging is particularly effective when code is migrated from one platform to another, and this is of significant interest for hybrid computer architectures containing CPUs accelerators or coprocessors. In this paper we extend relative debugging to support porting stencil computation on a hybrid computer. We describe a generic data model that allows programmers to examine the global state across different types of applications, including MPI/OpenMP, MPI/OpenACC, and UPC programs. We present case studies using a hybrid version of the `stellarator' particle simulation DELTA5D, on Titan at ORNL, and the UPC version of Shallow Water Equations on Crystal, an internal supercomputer of Cray. These case studies used up to 5,120 GPUs and 32,768 CPU cores to illustrate that the debugger is effective and practical.
Luiz De Rose, Andrew Gontarek, Aaron Vose, Bob Moench, David Abramson 0001, Minh Ngoc Dinh, Chao Jin 0001
SC3