A Combinatorial classification of postcritically fixed Newton maps

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental ingredient is the proof that for every Newton map (postcritically finite or not) every connected component of the basin of an attracting fixed point can be connected to $\infty$ through a finite chain of such components.Comment: 37 pages, 5 figures, published in Ergodic Theory and Dynamical Systems (2018). This is the final author file before publication. Text overlap with earlier arxiv file observed by arxiv system relates to an earlier version that was erroneously uploaded separately. arXiv admin note: text overlap with arXiv:math/070117

PreprintResolver: Improving Citation Quality by Resolving Published Versions of ArXiv Preprints using Literature Databases

The growing impact of preprint servers enables the rapid sharing of time-sensitive research. Likewise, it is becoming increasingly difficult to distinguish high-quality, peer-reviewed research from preprints. Although preprints are often later published in peer-reviewed journals, this information is often missing from preprint servers. To overcome this problem, the PreprintResolver was developed, which uses four literature databases (DBLP, SemanticScholar, OpenAlex, and CrossRef / CrossCite) to identify preprint-publication pairs for the arXiv preprint server. The target audience focuses on, but is not limited to inexperienced researchers and students, especially from the field of computer science. The tool is based on a fuzzy matching of author surnames, titles, and DOIs. Experiments were performed on a sample of 1,000 arXiv-preprints from the research field of computer science and without any publication information. With 77.94 %, computer science is highly affected by missing publication information in arXiv. The results show that the PreprintResolver was able to resolve 603 out of 1,000 (60.3 %) arXiv-preprints from the research field of computer science and without any publication information. All four literature databases contributed to the final result. In a manual validation, a random sample of 100 resolved preprints was checked. For all preprints, at least one result is plausible. For nine preprints, more than one result was identified, three of which are partially invalid. In conclusion the PreprintResolver is suitable for individual, manually reviewed requests, but less suitable for bulk requests. The PreprintResolver tool (https://preprintresolver.eu, Available from 2023-08-01) and source code (https://gitlab.com/ippolis_wp3/preprint-resolver, Accessed: 2023-07-19) is available online.Comment: Accepted for International Conference on Theory and Practice of Digital Libraries (TPDL 2023

Survey of FPGA applications in the period 2000 – 2015 (Technical Report)

Romoth J, Porrmann M, Rückert U. Survey of FPGA applications in the period 2000 – 2015 (Technical Report).; 2017.Since their introduction, FPGAs can be seen in more and more different fields of applications. The key advantage is the combination of software-like flexibility with the performance otherwise common to hardware. Nevertheless, every application field introduces special requirements to the used computational architecture. This paper provides an overview of the different topics FPGAs have been used for in the last 15 years of research and why they have been chosen over other processing units like e.g. CPUs

Development of Energy Models for Design Space Exploration of Embedded Many-Core Systems

This paper introduces a methodology to develop energy models for the design space exploration of embedded many-core systems. The design process of such systems can benefit from sophisticated models. Software and hardware can be specifically optimized based on comprehensive knowledge about application scenario and hardware behavior. The contribution of our work is an automated framework to estimate the energy consumption at an arbitrary abstraction level without the need to provide further information about the system. We validated our framework with the configurable many-core system CoreVA-MPSoC. Compared to a simulation of the CoreVA-MPSoC on gate level in a 28nm FD-SOI standard cell technology, our framework shows an average estimation error of about 4%.Comment: Presented at HIP3ES, 201

Fine‐tuned photochromic sulfonylureas for optical control of beta cell Ca ²⁺ fluxes

We previously developed, synthesized and tested light-activated sulfonylureas for optical control of KATP channels and pancreatic beta cell activity in vitro and in vivo. Such technology relies on installation of azobenzene photoswitches onto the sulfonylurea backbone, affording light-dependent isomerization, alteration in ligand affinity for SUR1 and hence KATP channel conductance. Inspired by molecular dynamics simulations and to further improve photoswitching characteristics, we set out to develop a novel push-pull closed ring azobenzene unit, before installing this on the sulfonylurea glimepiride as a small molecule recipient. Three fine-tuned, light-activated sulfonylureas were synthesized, encompassing azetidine, pyrrolidine and piperidine closed rings. Azetidine-, pyrrolidine- and piperidine-based sulfonylureas all increased beta cell Ca2+ -spiking activity upon continuous blue light illumination, similarly to first generation JB253. Notably, the pyrrolidine-based sulfonylurea showed superior switch OFF performance to JB253. As such, third generation sulfonylureas afford more precise optical control over primary pancreatic beta cells, and showcase the potential of pyrrolidine-azobenzenes as chemical photoswitches across drug classes

A pattern of unspecific somatic symptoms as long-term premonitory signs of type 2 diabetes: findings from the population-based MONICA/KORA cohort study, 1984-2009

BACKGROUND: Unspecific symptoms often proceed a serious chronic disease condition long before the onset of the disease. The role of an unspecific premonitory symptom (UPMS) pattern as premonitory signs of subsequent type 2 diabetes mellitus (T2DM) diagnosis independent of established cardio-metabolic risk factors is unclear and therefore was examined in the present study. METHODS: The study population consisted of 10,566 participants aged 25-74 years at baseline drawn from the population-based MONICA/KORA Cohort Study conducted in 1984-2009 in the Augsburg region (Germany). Unspecific premonitory symptoms were assessed following the Somatic Symptom Scale-8 (SSS-8). The impact of the score on T2DM risk within a mean follow-up time of 16 years was estimated by Cox regression. RESULTS: Within follow-up, 974 newly diagnosed T2DM cases were observed. The risk for T2DM increased by a hazard ratio (HR) of 1.03 (95% CI 1.01-1.04, p value < 0.001) for a one unit increase of the UPMS score in a Cox model adjusted for age, sex and survey. Additional adjustment for cardio-metabolic risk factors attenuated this effect (HR = 1.02) but significance remained (p value = 0.01). CONCLUSIONS: Suffering from an elevated burden of unspecific somatic symptoms is associated with T2DM long before the onset and independent of established cardio-metabolic risk factors. Further research is needed to obtain insight in potential underlying pathophysiological mechanisms

On the Security of the Winternitz One-Time Signature Scheme

We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random functions. Compared to previous results, which require a collision resistant hash function, our result provides significantly smaller signatures at the same security level. We also consider security in the strong sense and show that the Winternitz one-time signature scheme is strongly unforgeable assuming additional properties of the pseudo random function. In this context we formally define several key-based security notions for function families and investigate their relation to pseudorandomness. All our reductions are exact and in the standard model and can directly be used to estimate the output length of the hash function required to meet a certain security level

CoreVA-MPSoC: A Many-core Architecture with Tightly Coupled Shared and Local Data Memories

Ax J, Sievers G, Daberkow J, et al. CoreVA-MPSoC: A Many-core Architecture with Tightly Coupled Shared and Local Data Memories. IEEE Transactions on Parallel and Distributed Systems. 2018;29(5):1030-1043