scispace - formally typeset
Search or ask a question
Institution

University of Paderborn

EducationPaderborn, Nordrhein-Westfalen, Germany
About: University of Paderborn is a education organization based out in Paderborn, Nordrhein-Westfalen, Germany. It is known for research contribution in the topics: Control reconfiguration & Software. The organization has 6684 authors who have published 16929 publications receiving 323154 citations.


Papers
More filters
Journal ArticleDOI
28 Aug 1998
TL;DR: An extension of Valiant's BSP model, BSP*, is defined that rewards blockwise communication, and uses Valiant's notion of c-optimality, and presents a randomized BSP* algorithm that is (1 + δ)-optimal for arbitrary δ>0, m ≤ 2p and n=Ω(p log2p).
Abstract: In this paper we design and analyse parallel algorithms with the goal to get exact bounds on their speed-ups on real machines. For this purpose we define an extension of Valiant's BSP model, BSP*, that rewards blockwise communication, and uses Valiant's notion of c-optimality. Intuitively a c-optimal parallel algorithm for p processors achieves speed-up close to p/c. We consider the Multisearch problem: Assume a strip in 2D to be partitioned into m segments. Given n query points in the strip, the task is to locate, for each query, its segment. For m ≤ n we present a deterministic BSP* algorithm that is 1-optimal, if n = Ω(p log2p). For m > n, we present a randomized BSP* algorithm that is (1 + δ)-optimal for arbitrary δ>0, m ≤ 2p and n=Ω(p log2p). Both results hold for a wide range of BSP* parameters where the range becomes larger with growing input sizes m and n. We further report on implementation work in progress. Previous parallel algorithms for Multisearch were far away from being c-optimal in our model and do not consider blockwise communication.

75 citations

Journal ArticleDOI
TL;DR: The system design of the SIL-ICON compiler is presented and the icon system G, the icon dictionary ID, the operator dictionary OD, and the extended task action grammar ETAG are described.
Abstract: The SIL-ICON compiler is a software system for the specification, interpretation, prototyping, and generation of icon-oriented systems. The system design of the SIL-ICON compiler is presented. The icon system G, the icon dictionary ID, the operator dictionary OD, and the extended task action grammar ETAG are described. An application example to design a text editor using the Heidelberg icon set is also presented in detail. >

75 citations

Journal ArticleDOI
TL;DR: In this article, a sensor application of a resonance-induced extraordinary transmission through a regular phononic crystal consisting of a metal plate with a periodic arrangement of holes in a square lattice at normal incidence of sound is presented.
Abstract: The contribution presents the sensor application of a resonance-induced extraordinary transmission through a regular phononic crystal consisting of a metal plate with a periodic arrangement of holes in a square lattice at normal incidence of sound. The characteristic transmission peak has been found to strongly depend on sound velocity of the liquid the plate is immersed in. The respective peak maximum frequency can serve as measure for the concentration of a component in the liquid mixture, if a beneficial relation to the speed of sound of the liquid exists. Experimental verification has been performed with mixtures of water and propanol as model system. Here we especially pay attention to numerical calculations based on EFIT and COMSOL which reveal more insides to the wave propagation characteristics. Experimental investigations with Schlieren method and laser interferometry support the theoretical findings.

75 citations

Journal ArticleDOI
TL;DR: In this article, a comprehensive theoretical investigation of paraelectric (cubic) and ferroelectric (tetragonal) BaTiO${}_{3}$ is presented, where the atomic and electronic structure, piezoelectric tensor, Debye temperature, zone center phonon frequencies, and optical absorption are calculated for both phases from first principles.
Abstract: We present a comprehensive theoretical investigation of paraelectric (cubic) and ferroelectric (tetragonal) BaTiO${}_{3}$. The atomic and electronic structure, piezoelectric tensor, Debye temperature, zone center phonon frequencies, and optical absorption are calculated for both phases from first principles. The structural and vibrational properties predicted from density functional theory are in good agreement with experiment and earlier theoretical work. The electronic structure and optical response are found to be very sensitive to quasiparticle and electron-hole attraction effects, which are accounted for by using the GW approach and by solving the Bethe-Salpeter equation, respectively. Electronic self-energy effects are found to open the band gap substantially, to 3.7 and 3.9 eV for the cubic and tetragonal phases, respectively. In contrast to earlier calculations, good agreement with the measured optical data is achieved. The ab initiothermodynamics predicts that the ferroelectric ordering will disappear at 419 K. It is shown that the phase transition is driven by the vibrational entropy of a variety of modes.

75 citations

Book ChapterDOI
30 Apr 2017
TL;DR: In this paper, the authors propose a 0-RTT key exchange protocol, which allows a client to send cryptographically protected payload in zero round-trip time along with the first KE protocol message, thereby minimizing latency.
Abstract: Reducing latency overhead while maintaining critical security guarantees like forward secrecy has become a major design goal for key exchange (KE) protocols, both in academia and industry. Of particular interest in this regard are 0-RTT protocols, a class of KE protocols which allow a client to send cryptographically protected payload in zero round-trip time (0-RTT) along with the very first KE protocol message, thereby minimizing latency. Prominent examples are Google’s QUIC protocol and the upcoming TLS protocol version 1.3. Intrinsically, the main challenge in a 0-RTT key exchange is to achieve forward secrecy and security against replay attacks for the very first payload message sent in the protocol. According to cryptographic folklore, it is impossible to achieve forward secrecy for this message, because the session key used to protect it must depend on a non-ephemeral secret of the receiver. If this secret is later leaked to an attacker, it should intuitively be possible for the attacker to compute the session key by performing the same computations as the receiver in the actual session.

75 citations


Authors

Showing all 6872 results

NameH-indexPapersCitations
Martin Karplus163831138492
Marco Dorigo10565791418
Robert W. Boyd98116137321
Thomas Heine8442324210
Satoru Miyano8481138723
Wen-Xiu Ma8342020702
Jörg Neugebauer8149130909
Thomas Lengauer8047734430
Gotthard Seifert8044526136
Reshef Tenne7452924717
Tim Meyer7454824784
Qiang Cui7129220655
Thomas Frauenheim7045117887
Walter Richtering6733214866
Marcus Elstner6720918960
Network Information
Related Institutions (5)
Eindhoven University of Technology
52.9K papers, 1.5M citations

95% related

Royal Institute of Technology
68.4K papers, 1.9M citations

93% related

Karlsruhe Institute of Technology
82.1K papers, 2.1M citations

93% related

École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

91% related

Carnegie Mellon University
104.3K papers, 5.9M citations

91% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023131
2022242
20211,030
20201,010
2019948
2018967