@article{17288, author = {{Rohlfing, Katharina and Loehr, D. and Duncan, S. and Brown, A. and Franklin, A. and Kimbara, I. and Milde, J.-T. and Parrill, F. and Rose, T. and Schmidt, T. and Sloetjes, H. and Thies, A. and Wellinghoff, S.}}, journal = {{Gesprächsforschung}}, title = {{{Comparison of multimodal annotation tools: Workshop report}}}, volume = {{7}}, year = {{2006}}, } @article{31754, author = {{Felleiter, P and Reinsberger, Claus and Springe, D and Plunien, H and Baumberger, M}}, issn = {{0939-2661}}, journal = {{Anasthesiol Intensivmed Notfallmed Schmerzther}}, number = {{1}}, pages = {{9--13}}, title = {{{Preclinical diagnosis of traumatic paraplegia or tetraplegia - a prospective study in 100 patients.}}}, volume = {{41}}, year = {{2006}}, } @article{34892, abstract = {{We prove that the number of quartic S4--extensions of the rationals of given discriminant d is $O_\eps(d^{1/2+\eps})$ for all $\eps>0$. For a prime number p we derive that the dimension of the space of octahedral modular forms of weight 1 and conductor p or p² is bounded above by O(p¹/²log(p)²). }}, author = {{Klüners, Jürgen}}, issn = {{0065-1036}}, journal = {{Acta Arithmetica}}, keywords = {{Algebra and Number Theory}}, number = {{2}}, pages = {{185--194}}, publisher = {{Institute of Mathematics, Polish Academy of Sciences}}, title = {{{The number of S₄-fields with given discriminant}}}, doi = {{10.4064/aa122-2-3}}, volume = {{122}}, year = {{2006}}, } @inbook{43270, abstract = {{The linear and nonlinear optical properties of semiconductors are strongly influenced by the Coulomb interaction among the photoexcited carriers. Within the framework of the semiconductor Bloch equations such many-body effects can be described on the basis of a microscopic theory. In this article, we briefly review our recent contributions to two specific topics. First, the coherent optical generation of charge and spin currents and their subsequent decay via scattering processes is discussed. As a second example, the spatially-inhomogeneous optical properties of hybrid structures which consist of photonic crystals and semiconductor nanostructures are described. Many of the numerical results have been obtained using massively parallel computer programs which were run on the IBM p690-Cluster Jump in Jülich.}}, author = {{Meier, Torsten and Duc, Huynh Thanh and Reichelt, Matthias and Pasenow, B. and Stroucken, T. and Koch, S.W.}}, booktitle = {{Germany in NIC Series Vol. 32}}, editor = {{Munster, G. and Wolf, D. and Kremer, M.}}, isbn = {{3-00-017351-X}}, pages = {{219--226}}, publisher = {{John von Neumann Institute for Computing}}, title = {{{Computational Optoelectronics of Semiconductor Nanostructures including Many-Body Effects}}}, year = {{2006}}, } @article{45038, author = {{Herzig, Bardo and Hilligus, A. H. and Langenbacher-Liebgott, J. and Reinhold, P. and Rinkens, H.-D.}}, journal = {{PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14}}, pages = {{34}}, title = {{{PLAZ-Entwicklungsstrategie – Professional School für Bildungsforschung und Lehrerbildung}}}, year = {{2006}}, } @inbook{47463, author = {{Heim, Rüdiger and Kehne, Miriam}}, booktitle = {{Zum Umgang mit Vielfalt als sportpädagogische Herausforderung}}, editor = {{Miethling, W.-D. and Krieger, Klaus}}, pages = {{203--206}}, publisher = {{Czwalina}}, title = {{{Forschungsdesign der SPRINT-Studie}}}, year = {{2006}}, } @phdthesis{25228, author = {{Matysczok, Carsten}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Dynamische Kantenextraktion: Ein Verfahren zur Generierung von Tracking-Informationen für Augmented Reality-Anwendungen auf Basis von 3D-Referenzmodellen}}}, volume = {{165}}, year = {{2005}}, } @inproceedings{19827, abstract = {{We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1). The Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled d-regular graph G to G' is equal to those from G' to G. From this and the reachability property we conclude that in the limit a series of Random 1-Flipper operations converges against an uniform probability distribution over all connected labeled d-regular graphs. For degree d ∈ ω(1) growing with the graph size this implies that iteratively applying Random 1-Flipper transforms any given graph into an expander asymptotically almost surely. We use these operations as a maintenance operation for a peer-to-peer network based on random regular connected graphs that provides high robustness and recovers from degenerate network structures by continuously applying these random graph transformations. For this, we describe how network operations for joining and leaving the network can be designed and how the concurrency of the graph transformations can be handled.}}, author = {{Mahlmann, Peter and Schindelhauer, Christian}}, booktitle = {{Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05}}, isbn = {{1581139861}}, title = {{{Peer-to-peer networks based on random transformations of connected regular undirected graphs}}}, doi = {{10.1145/1073970.1073992}}, year = {{2005}}, } @article{27763, author = {{Kroke, A and Hahn, S and Buyken, Anette and Liese, A D}}, issn = {{0307-0565}}, journal = {{International Journal of Obesity}}, pages = {{261--266}}, title = {{{A comparative evaluation of two different approaches to estimating age at adiposity rebound}}}, doi = {{10.1038/sj.ijo.0803143}}, year = {{2005}}, } @inproceedings{27895, author = {{Schlegel-Matthies, Kirsten}}, booktitle = {{Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn}}, pages = {{51--55}}, title = {{{Neue Orientierungen der Ernährungs- und Verbraucherbildung }}}, year = {{2005}}, } @article{17414, abstract = {{Nowadays companies operate in a difficult environment: the dynamics of innovations increase and product life cycles become shorter. Furthermore products and the corresponding manufacturing processes get more and more complex. Therefore, companies need new methods for the planning of manufacturing systems. One promising approach in this context is digital factory/virtual production—the modeling and analysis of computer models of the planned factory with the objective to reduce time and costs. For the modeling and analysis various simulation methods and programs have been developed. They are a highly valuable support for planning and visualizing the manufacturing system. But there is one major disadvantage: only experienced and long trained experts are able to operate with these programs. The graphical user interface is very complex and not intuitive to use. This results in an extensive and error-prone modeling of complex simulation models and a time-consuming interpretation of the simulation results. To overcome these weak points, intuitive and understandable man–machine interfaces like augmented and virtual reality can be used. This paper describes the architecture of a system which uses the technologies of augmented and virtual reality to support the planning process of complex manufacturing systems. The proposed system assists the user in modeling, the validation of the simulation model, and the subsequent optimization of the production system. A general application of the VR- and AR-technologies and of the simulation is realized by the development of appropriate linking and integration mechanisms. For the visualization of the arising 3D-data within the VR- and AR-environments, a dedicated 3D-rendering library is used.}}, author = {{Dangelmaier, Wilhelm and Fischer, Matthias and Gausemeier, Jürgen and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt}}, issn = {{0166-3615}}, journal = {{Computers in Industry}}, pages = {{371--383}}, title = {{{Virtual and augmented reality support for discrete manufacturing system simulation}}}, doi = {{10.1016/j.compind.2005.01.007}}, year = {{2005}}, } @inproceedings{17415, author = {{Fischer, Matthias and Mueck, B. and Mahajan, K. and Kortenjan, M. and Laroque, C. and Dangelmaier, W.}}, booktitle = {{Proceedings of the Winter Simulation Conference}}, isbn = {{0780395190}}, title = {{{Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations}}}, doi = {{10.1109/wsc.2005.1574470}}, year = {{2005}}, } @inbook{17902, author = {{Mindt, Ilka and Hunston, Susan}}, booktitle = {{ICAME Journal 29, Computers in English Linguistics}}, pages = {{184 -- 188}}, publisher = {{Cambridge University Press, 2002}}, title = {{{Corpora in Applied Linguistics}}}, year = {{2005}}, } @inproceedings{18787, abstract = {{A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1,..., ∆} d [26]. We develop streaming (1 + ɛ)-approximation algorithms for k-median, k-means, MaxCut, maximum weighted matching (MaxWM), maximum travelling salesperson (MaxTSP), maximum spanning tree (MaxST), and average distance over dynamic geometric data streams. Our algorithms maintain a small weighted set of points (a coreset) that approximates with probability 2/3 the current point set with respect to the considered problem during the m insert/delete operations of the data stream. They use poly(ɛ −1, log m, log ∆) space and update time per insert/delete operation for constant k and dimension d. Having a coreset one only needs a fast approximation algorithm for the weighted problem to compute a solution quickly. In fact, even an exponential algorithm is sometimes feasible as its running time may still be polynomial in n. For example one can compute in poly(log n, exp(O((1+log(1/ɛ)/ɛ) d−1))) time a solution to k-median and k-means [21] where n is the size of the current point set and k and d are constants. Finding an implicit solution to MaxCut can be done in poly(log n, exp((1/ɛ) O(1))) time. For MaxST and average distance we require poly(log n, ɛ −1) time and for MaxWM we require O(n 3) time to do this.}}, author = {{Sohler, Christian and Frahling, Gereon}}, booktitle = {{Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)}}, pages = {{209--217}}, title = {{{Coresets in Dynamic Geometric Data Streams}}}, year = {{2005}}, } @article{18855, abstract = {{We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\mathbb R^d$. We focus on the setting where the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within $1 + \eps$ using only $\widetilde{\O}(\sqrt{n} \, \text{poly} (1/\eps))$ queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbor queries. Read More: https://epubs.siam.org/doi/10.1137/S0097539703435297 }}, author = {{Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, number = {{1}}, pages = {{91--109}}, title = {{{Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time}}}, doi = {{10.1137/s0097539703435297}}, volume = {{35}}, year = {{2005}}, } @inproceedings{18867, abstract = {{Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.
We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well.}}, author = {{Frahling, Gereon and Krokowski, Jens}}, booktitle = {{Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}}, isbn = {{9783540291183}}, issn = {{0302-9743}}, pages = {{758--769}}, publisher = {{Springer}}, title = {{{Online Occlusion Culling}}}, doi = {{10.1007/11561071_67}}, volume = {{3669}}, year = {{2005}}, } @inproceedings{18912, abstract = {{We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).}}, author = {{Bienkowski, Marcin and Korzeniowski, Miroslaw}}, booktitle = {{Proc. of the European Conference in Parallel Processing (Euro-Par)}}, isbn = {{9783540287001}}, issn = {{0302-9743}}, title = {{{Dynamic Page Migration Under Brownian Motion}}}, doi = {{10.1007/11549468_105}}, year = {{2005}}, } @inproceedings{18917, abstract = {{The page migration problem is one of subproblems of data management in networks. It occurs
in a distributed network of processors sharing one indivisible memory page of size D. During runtime,
the processors access a unit of data from the page, and the system is allowed to migrate the page
between the processors. The problem is to compute (on-line) a schedule of page movements
to minimize the total communication cost.

The Dynamic Page Migration problem is an extension to the page migration.
It attempts to model the network dynamics, occurring, for example, in mobile networks.
However, the pace of changes is restricted, i.e. the distances between processors can
change only by a constant per round.

The movement of the nodes induce changes in the communication cost between each pair of nodes,
which is proportional to the distance between them raised to some power $alpha$.
This is typical for mobile wireless networks, where nodes can move with a constant speed,
and the cost of communication is measured in terms of energy used for sending the data.
Thus, by setting $alpha$ equal to the propagation exponent of the medium,
cost minimization becomes minimizing the total energy consumption in the system.

However, as proven in citedynamic-page-migration, if both network mobility and
request sequence are created by an adversary, then the competitive ratio is polynomially large in D and
in the number of the nodes. In our search for a reasonable, close-to-reality model, in this paper we
consider a scenario in which the network mobility is adversarial, but the requests are
generated randomly by a stochastic process. We design an algorithm MTFR for this scenario,
and prove that it is O(1)-competitive, on expectation and with high probability.}}, author = {{Bienkowski, Marcin}}, booktitle = {{Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)}}, location = {{Las Vegas, Nevada, USA}}, pages = {{270--278}}, publisher = {{ACM Press, NY, USA}}, title = {{{Dynamic Page Migration with Stochastic Requests}}}, year = {{2005}}, } @inproceedings{18925, abstract = {{The dynamic page migration problem citedynamic-page-migration is defined in
a distributed network of $n$ mobile nodes sharing one indivisible memory page
of size $D$. During runtime, the nodes can both access a unit of data from
the page and move with a constant speed, thus changing the costs of communication.
The problem is to compute online a schedule of page movements
to minimize the total communication cost.

In this paper we construct and analyze the first deterministic algorithm for this problem.
We prove that it achieves an (up to a constant factor) optimal competitive ratio
$O(n cdot sqrtD)$. We show that the randomization of this algorithm
improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary).
This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.
We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem.}}, author = {{Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}}, booktitle = {{Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}}, isbn = {{9783540249986}}, issn = {{0302-9743}}, pages = {{365--376}}, title = {{{Improved Algorithms for Dynamic Page Migration}}}, doi = {{10.1007/978-3-540-31856-9_30}}, year = {{2005}}, } @inproceedings{23883, abstract = {{A dynamic geometric data stream is a sequence of m Add/Remove operations of points from a discrete geometric space (1,...,Δ)d [21]. Add(p) inserts a point p from (1,...,Δ)d into the current point set, Remove(p) deletes p from P. We develop low-storage data structures to (i) maintain ε-approximations of range spaces of P with constant VC-dimension and (ii) maintain an ε-approximation of the weight of the Euclidean minimum spanning tree of P. Our data structures use O(log3ε • log3(1/ε) • log(1/ε)/ε2) and O(log (1/δ) • (log Δ/ε)O(d)) bits of memory, respectively (we assume that the dimension d is a constant), and they are correct with probability 1-δ. These results are based on a new data structure that maintains a set of elements chosen (almost) uniformly at random from P.}}, author = {{Frahling, Gereon and Indyk, Piotr and Sohler, Christian}}, booktitle = {{Proceedings of the twenty-first annual symposium on Computational geometry - SCG '05}}, title = {{{Sampling in dynamic data streams and applications}}}, doi = {{10.1145/1064092.1064116}}, year = {{2005}}, }