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: Computer science & Context (language use). The organization has 6684 authors who have published 16929 publications receiving 323154 citations.
Topics: Computer science, Context (language use), Software, Control reconfiguration, Nonlinear system
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this article, a new k-means clustering algorithm for data streams of points from a Euclidean space is proposed, which computes a small weighted sample of the data stream and solves the problem on the sample using the kmeans++ algorithm of Arthur and Vassilvitskii (SODA '07).
Abstract: We develop a new k-means clustering algorithm for data streams of points from a Euclidean space. We call this algorithm StreamKM++. Our algorithm computes a small weighted sample of the data stream and solves the problem on the sample using the k-means++ algorithm of Arthur and Vassilvitskii (SODA '07). To compute the small sample, we propose two new techniques. First, we use an adaptive, nonuniform sampling approach similar to the k-means++ seeding procedure to obtain small coresets from the data stream. This construction is rather easy to implement and, unlike other coreset constructions, its running time has only a small dependency on the dimensionality of the data. Second, we propose a new data structure, which we call coreset tree. The use of these coreset trees significantly speeds up the time necessary for the adaptive, nonuniform sampling during our coreset construction.We compare our algorithm experimentally with two well-known streaming implementations: BIRCH [Zhang et al. 1997] and StreamLS [Guha et al. 2003]. In terms of quality (sum of squared errors), our algorithm is comparable with StreamLS and significantly better than BIRCH (up to a factor of 2). Besides, BIRCH requires significant effort to tune its parameters. In terms of running time, our algorithm is slower than BIRCH. Comparing the running time with StreamLS, it turns out that our algorithm scalesmuch better with increasing number of centers. We conclude that, if the first priority is the quality of the clustering, then our algorithm provides a good alternative to BIRCH and StreamLS, in particular, if the number of cluster centers is large. We also give a theoretical justification of our approach by proving that our sample set is a small coreset in low-dimensional spaces.
285 citations
••
TL;DR: The picture shows the orange-red electroluminescence of a light-emitting diode containing the perylene 3,4,9,10-tetracarboxylic acid ethyl ester.
Abstract: Simple ester derivatives of polycyclic arenes offer access to light-emitting diodes of nearly any visible color by making use of the good charge-transport properties of the columnar liquid crystals of these derivatives. The picture shows the orange-red electroluminescence of a light-emitting diode containing the perylene 3,4,9,10-tetracarboxylic acid ethyl ester (structure shown, R=Et). Through use of multiple layers of different esters light-emitting diodes with almost white luminescence can be obtained.
283 citations
••
TL;DR: In this paper, it was shown that for arbitrarily large initial data, this problem admits at least one global weak solution for which there exists T > 0 such that ( u, v ) is bounded and smooth in Ω × (T, ∞ ).
283 citations
••
TL;DR: In this paper, the authors give an affirmative answer to the question of global solvability in the following sense: under mild assumptions on the initial data, and under modest structural assumptions on $f$ and $\chi$, inter alia allowing for the prototypical case when the corresponding initial-boundary value problem is shown to possess a globally defined weak solution.
Abstract: The chemotaxis-Navier-Stokes system linking the chemotaxis equations \[ n_t + u\cdot
abla n = \Delta n -
abla \cdot (n\chi(c)
abla c) \] and \[ c_t + u\cdot
abla c = \Delta c-nf(c) \] to the incompressible Navier-Stokes equations, \[ u_t + (u\cdot
abla)u = \Delta u +
abla P + n
abla \Phi, \qquad
abla \cdot u = 0, \] is considered under homogeneous boundary conditions of Neumann type for $n$ and $c$, and of Dirichlet type for $u$, in a bounded convex domain $\Omega\subset R^3$ with smooth boundary, where $\Phi\in W^{1,\infty}(\Omega)$, and where $f\in C^1([0,\infty))$ and $\chi\in C^2([0,\infty))$ are nonnegative with $f(0)=0$. Problems of this type have been used to describe the mutual interaction of populations of swimming aerobic bacteria with the surrounding fluid. Up to now, however, global existence results seem to be available only for certain simplified variants such as e.g.the two-dimensional analogue, or the associated chemotaxis-Stokes system obtained on neglecting the nonlinear convective term in the fluid equation. The present work gives an affirmative answer to the question of global solvability in the following sense: Under mild assumptions on the initial data, and under modest structural assumptions on $f$ and $\chi$, inter alia allowing for the prototypical case when \[ f(s)=s \quad {for all} s\ge 0 \qquad {and} \qquad \chi \equiv const., \] the corresponding initial-boundary value problem is shown to possess a globally defined weak solution.
282 citations
••
TL;DR: In this article, the mixing characteristics of a T-shaped micro-reactor with rectangular cross sections are studied for three different flow regimes, and a measure of the scale of segregation which employs the concept of specific contact area is defined.
282 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 |