Institution
University of Paderborn
Education•Paderborn, 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 published on a yearly basis
Papers
More filters
••
11 Jul 2016TL;DR: A universal shape formation algorithm which takes an arbitrary shape composed of a constant number of equilateral triangles of unit size and lets the particles build that shape at a scale depending on the number of particles in the system, and requires only a constant-size memory per particle.
Abstract: We envision programmable matter consisting of systems of computationally limited devices (which we call particles) that are able to self-organize in order to achieve a desired collective goal without the need for central control or external intervention. Central problems for these particle systems are shape formation and coating problems. In this paper, we present a universal shape formation algorithm which takes an arbitrary shape composed of a constant number of equilateral triangles of unit size and lets the particles build that shape at a scale depending on the number of particles in the system. Our algorithm runs in O(√n) asynchronous execution rounds, where $n$ is the number of particles in the system, provided we start from a well-initialized configuration of the particles. This is optimal in a sense that for any shape deviating from the initial configuration, any movement strategy would require Ω(√n) rounds in the worst case (over all asynchronous activations of the particles). Our algorithm relies only on local information (e.g., particles do not have ids, nor do they know n, or have any sort of global coordinate system), and requires only a constant-size memory per particle.
92 citations
••
TL;DR: The Chemistry Development Kit (CDK) as mentioned in this paper is an open-source Java library for Structural Chemo- and Bioinformatics that provides methods for many common tasks in molecular informatics, including 2D and 3D rendering of chemical structures.
Abstract: The Chemistry Development Kit (CDK) is a freely available open-source Java library for Structural Chemo- and Bioinformatics. Its architecture and capabilities as well as the development as an open-source project by a team of international collaborators from academic and industrial institutions is described. The CDK provides methods for many common tasks in molecular informatics, including 2D and 3D rendering of chemical structures, I/O routines, SMILES parsing and generation, ring searches, isomorphism checking, structure diagram generation, etc. Application scenarios as well as access information for interested users and potential contributors are given.
92 citations
••
06 Jun 2007TL;DR: This paper describes how model checking can be employed for formal verification of business processes against such patterns and presents an automated transformation of the business process and the corresponding patterns into a transition system and temporal logic, respectively.
Abstract: Business processes usually have to consider certain constraints like domain specific and quality requirements. The automated formal verification of these constraints is desirable, but requires the user to provide an unambiguous formal specification. In particular since the notations for business process modeling are usually visual flow-oriented languages, the notational gap to the languages usually employed for the formal specification of constraints, e.g., temporal logic, is significant and hard to bridge. Thus, our approach relies on UML Activities as a single language for the specification of both business processes and the corresponding constraints. For the expression of such constraints, we have provided a process pattern definition language based on specialized Activities. In this paper, we describe how model checking can be employed for formal verification of business processes against such patterns. For this, we present an automated transformation of the business process and the corresponding patterns into a transition system and temporal logic, respectively.
92 citations
••
08 Mar 2010TL;DR: This paper has integrated remote hypervisor management facilities into the libvirt driver infrastructure for VMware ESX and Microsoft Hyper-V and presents the resulting architecture as well as experiences gained during the implementation process.
Abstract: The success of server virtualization has let to the deployment of a huge number of virtual machines in today's data centers, making a manual virtualization management very labor-intensive. The development of appropriate management solutions is hindered by the various management interfaces of different hypervisors. Therefore, a uniform management can be simplified by a layer abstracting from these dedicated hypervisor interfaces. The libvirt management library provides such an interface to different hypervisors. Unfortunately, remote hypervisor management using libvirt has not been possible without altering the managed servers. To overcome this limitation, we have integrated remote hypervisor management facilities into the libvirt driver infrastructure for VMware ESX and Microsoft Hyper-V. This paper presents the resulting architecture as well as experiences gained during the implementation process.
92 citations
••
TL;DR: In this article, a linear homotopy algorithm was proposed to solve the 17th problem of the 21st century, which asks for the existence of a deterministic algorithm computing an approximate solution of a system of n complex polynomials in n unknowns in time polynomial, on the average, in the size N of the input system.
Abstract: The 17th of the problems proposed by Steve Smale for the 21st century asks for the existence of a deterministic algorithm computing an approximate solution of a system of n complex polynomials in n unknowns in time polynomial, on the average, in the size N of the input system. A partial solution to this problem was given by Carlos Beltr an and Luis Miguel Pardo who exhibited a randomized algorithm doing so. In this paper we further extend this result in several directions. Firstly, we exhibit a linear homotopy algorithm that eciently implements a nonconstructive idea of
92 citations
Authors
Showing all 6872 results
Name | H-index | Papers | Citations |
---|---|---|---|
Martin Karplus | 163 | 831 | 138492 |
Marco Dorigo | 105 | 657 | 91418 |
Robert W. Boyd | 98 | 1161 | 37321 |
Thomas Heine | 84 | 423 | 24210 |
Satoru Miyano | 84 | 811 | 38723 |
Wen-Xiu Ma | 83 | 420 | 20702 |
Jörg Neugebauer | 81 | 491 | 30909 |
Thomas Lengauer | 80 | 477 | 34430 |
Gotthard Seifert | 80 | 445 | 26136 |
Reshef Tenne | 74 | 529 | 24717 |
Tim Meyer | 74 | 548 | 24784 |
Qiang Cui | 71 | 292 | 20655 |
Thomas Frauenheim | 70 | 451 | 17887 |
Walter Richtering | 67 | 332 | 14866 |
Marcus Elstner | 67 | 209 | 18960 |