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

Andreas Noack 0001

dblp:n/AndreasNoack · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0003-3726-1039ORCID · verified

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

Theory of computation · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 3Systems, architecture and hardware · 2Computer networks · 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.

Software engineering, system software, and programming languages
1 paper
Program analysis · 50% Software maintenance and evolution · 50%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 100%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › reverse engineering
design pattern detection
0.112005
Efficient Relational Calculation for Software Analysis · IEEE Trans. Software Eng. 2005
Automated reasoning and model checking › model checking › symbolic model checking
BDD-based verification
0.012003
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems · CAV 2003
Automated reasoning and model checking
real-time verification
0.012003
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems · CAV 2003
Data models and query languages › query language design
relational query languages
0.012005
Efficient Relational Calculation for Software Analysis · IEEE Trans. Software Eng. 2005

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

predicate calculus · 0.1binary decision diagrams · 0.1binary decision diagram · 0.1
YearPublicationVenuePosition
2019 Cataloging the visible universe through Bayesian inference in Julia at petascale
Jeffrey Regier, Keno Fischer, Kiran Pamnany, Andreas Noack 0001, Jarrett Revels, Maximilian Lam, Steve Howard, Ryan Giordano, David Schlegel, Jon D. McAuliffe, Rollin C. Thomas, Prabhat
J. Parallel Distributed Comput.4
2018 Cataloging the Visible Universe Through Bayesian Inference at Petascale
abstract
Astronomical catalogs derived from wide-field imaging surveys are an important tool for understanding the Universe. We construct an astronomical catalog from 55 TB of imaging data using Celeste, a Bayesian variational inference code written entirely in the high-productivity programming language Julia. Using over 1.3 million threads on 650,000 Intel Xeon Phi cores of the Cori Phase II supercomputer, Celeste achieves a peak rate of 1.54 DP PFLOP/s. Celeste is able to jointly optimize parameters for 188M stars and galaxies, loading and processing 178 TB across 8192 nodes in 14.6 minutes. To achieve this, Celeste exploits parallelism at multiple levels (cluster, node, and thread) and accelerates I/O through Cori's Burst Buffer. Julia's native performance enables Celeste to employ high-level constructs without resorting to hand-written or generated low-level code (C/C++/Fortran), and yet achieve petascale performance.
Jeffrey Regier, Kiran Pamnany, Keno Fischer, Andreas Noack 0001, Maximilian Lam, Jarrett Revels, Steve Howard, Ryan Giordano, David Schlegel, Jon D. McAuliffe, Rollin C. Thomas, Prabhat
IPDPS4
2009 Multi-level Algorithms for Modularity Clustering
Andreas Noack 0001, Randolf Rotta
SEA1
2005 Energy-Based Clustering of Graphs with Nonuniform Degrees
Andreas Noack 0001
GD1
2005 Efficient Relational Calculation for Software Analysis
abstract
Calculating with graphs and relations has many applications in the analysis of software systems, for example, the detection of design patterns or patterns of problematic design and the computation of design metrics. These applications require an expressive query language, in particular, for the detection of graph patterns, and an efficient evaluation of the queries even for large graphs. In this paper, we introduce RML, a simple language for querying and manipulating relations based on predicate calculus, and CrocoPat, an interpreter for RML programs. RML is general because it enables the manipulation not only of graphs (i.e., binary relations), but of relations of arbitrary arity. CrocoPat executes RML programs efficiently because it internally represents relations as binary decision diagrams, a data structure that is well-known as a compact representation of large relations in computer-aided verification. We evaluate RML by giving example programs for several software analyses and CrocoPat by comparing its performance with calculators for binary relations, a Prolog system, and a relational database management system.
Dirk Beyer 0001, Andreas Noack 0001, Claus Lewerentz
IEEE Trans. Software Eng.2
2003 Rabbit: A Tool for BDD-Based Verification of Real-Time Systems
Dirk Beyer 0001, Claus Lewerentz, Andreas Noack 0001
CAV3
2003 Can Decision Diagrams Overcome State Space Explosion in Real-Time Verification?
Dirk Beyer 0001, Andreas Noack 0001
FORTE2
2003 An Energy Model for Visual Graph Clustering
Andreas Noack 0001
GD1