## Autotuning Benchmarking Techniques A Roofline Model Case Study

New tool autotunes the benchmarks for the target architecture by deciding the optimal parameters through state space reductions and exhaustive search . Tool produces the same benchmarking result with an error of less than 2% for each of the optimizationtechniques we apply, while providing a great reduction in search time .…

## Cost aware Integration Process Modeling in Multiclouds

Integration as a service (INTaaS) is the centrepiece of current corporate,cloud and device integration processes . We propose a design-time placement for processes in multicloudsthat is cost-optimal for INTaaS problem sizes . The process modeler’s perspective is investigated based on a new cost-aware modeling process, featuring the interaction between the user and the INTaa’s vendor through ad-hoc cost calculation and correctness-preserving, process cost reduction proposals .…

## Approximation metatheorem for fractionally treewidth fragile graphs

Baker’s technique is a powerful tool for designing polynomial-timeapproximation schemes . However, it can only be used in rather restricted graph classes . We show that maximization problems expressible inmonotone first-order logic admit PTAS under a much weaker assumption offractional treewidth-fragility .…

## Constant congestion brambles in directed graphs

The Directed Grid Theorem was a conjecture for nearly 20 years . Kawarabayashi and Kreutzer proved it in 2015 . The function $f$ obtained in the proof is very fast growing . In this work, we show that if one relaxes directed grid to bramble of congestion, one can obtain a polynomial bound .…

## Counting and Sampling Perfect Matchings in Regular Expanding Non Bipartite Graphs

We show that the ratio of the number of near perfect matchings in $d$-regular strong expander (non-bipartite) graphs,with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markovchain [JS89] mixes in polynnomine time and generates an (almost) uniformlyrandom perfect matching .…

## UrbanVCA a vector based cellular automata framework to simulate the urban land use change at the land parcel level

The UrbanVCAsimulates multiple types of urban land-use changes at the land-parcel level have achieved a high accuracy (FoM=0.243) and the landscape index similarityreaches 87.3% . The simulation results in 2030 show that the eco-protectionscenario can promote urban agglomeration and reduce ecological aggression and loss of arable land by at least 60% .…

## Electronic Structure in a Fixed Basis is QMA complete

Finding the ground state energy of electrons subject to an external electricfield is a fundamental problem in computational chemistry . Schuch and Verstraete haveshown hardness for the electronic-structure problem with an additionalsite-specific external magnetic field, but without the restriction to a fixedbasis .…

## A novel approach for the efficient modeling of material dissolution in electrochemical machining

This work presents a novel approach to efficiently model anodic dissolution in electrochemical machining . Earlier modeling approaches employ a strict spacediscretization of the anodic surface that is associated with a remeshingprocedure at every time step . This inner variable allows the modeling of the complex dissolution process without the necessity of computationally expensiveremeshing by controlling the effective material parameters .…

## Online Learning with Radial Basis Function Networks

We investigate the benefits of feature selection, nonlinear modelling and online learning with forecasting in financial time series . We also find that, in the subset of models we use,sequential learning in time with online Ridge regression, provides the best multi-step ahead forecasts, and continual learning with an online radial basisfunction network .…

## An FE DMN method for the multiscale analysis of fiber reinforced plastic components

Each Gauss point of themacroscopic finite element model is equipped with a deep material network (DMN) The DMN is capable of accelerating two-scale simulations significantly, providing possible speed-ups of several magnitudes . Wediscuss how to extend direct direct DMNs to account for varying fiber orientation, and propose a simplified sampling strategy which significantly speeds up the training process .…

## Enclosing Depth and other Depth Measures

We study families of depth measures defined by natural sets of axioms . Weshow that any such depth measure is a constant factor approximation of Tukeydepth . We further investigate the dimensions of depth regions, showing that theCascade conjecture, introduced by Kalai for Tverberg depth, holds for all depthmeasures .…

## Recognition of Unit Disk Graphs for Caterpillars Embedded Trees and Outerplanar Graphs

Unit disk graphs are graphs that have a unit disk intersection representation . Recognition of unit disk graphs is NP-hard for outerplanar graphs and for embedded trees . We also show that givena caterpillar graph, we can decide in linear time whether it is a unit diskgraph .…

## Rectilinear Steiner Trees in Narrow Strips

A rectilinear Steiner tree for a set $P$ of points in $mathbb{R}^2$ is atree that connects the points using horizontal and vertical linesegments . We present an algorithm with running time $n^{O(\sqrt{\delta) n$ for sparse point sets, that is, point sets where each$1\times\delta$ rectangle inside the strip contains $O(1)$ points .…

## Get Your Vitamin C Robust Fact Verification with Contrastive Evidence

Typical fact verification models use retrieved written evidence to verify claims . Evidence sources often change over time as more information is gathered and revised . In order to adapt, models must be sensitive to subtledifferences in supporting evidence . We present VitaminC, a benchmark infused with challenging cases that require models to discern and adjust to slight factual changes .…