Scientific data services are increasing in usage and scope, and with these increases comes growing need for access to provenance information. Our goal is to design and implement an extensible provenance solution that is deployed at the science data ingest time. In this paper, we describe our work in the setting of a particular set of data services in the area of solar coronal physics. The paper...

Let k be an algebraically closed field of characteristic p > 0, let m, r be integers with m ≥ 1, r ≥ 0 and m ≥ r and let S0(2m, r) be the symplectic Schur algebra over k as introduced by the first author. We introduce the symplectic Schur functor, derive some basic properties of it and relate this to work of Hartmann and Paget. We do the same for the orthogonal Schur algebra. We give a modified...

Large (km-scale) craters have been used for some years to date broad Martian surfaces, giving results subsequently supported by Martian meteorites – a mix of geologically young and old ages [1, 2]. More recently, small (10-20 m) primary craters have been seen forming on Mars [3], and the reported formation rate agrees with our crater-dating system [4, 5, 6]. This opens the door to dating of sma...

André Thess∗1, Dmitry Krasnov1, Thomas Boeck1, Egbert Zienicke1, Oleg Zikanov2, Pablo Moresco3, and Thierry Alboussière4 1 Department of Mechanical Engineering, Ilmenau University of Technology, P.O. Box 100565, 98684 Ilmenau, Germany 2 Department of Mechanical Engineering, University of Michigan Dearborn, Dearborn MI 48128-1491, USA 3 School of Physics and Astronomy, The University of Manchest...

Due to their nature, hard real-time embedded systems (e.g. flight control systems) must be guaranteed to satisfy their time constraints under all operating conditions. The provision of such guarantee relies on safe and precise estimates of the worst-case execution time (WCET) of tasks. As the execution time depends on both the program and the architecture running it, the growing sophistication ...

High Level Synthesis for Packet Processing Pipelines

Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly diminishes for rather long time horizons. By introducing an MILP continuous representation in both time and...