--- _id: '17288' author: - first_name: Katharina full_name: Rohlfing, Katharina id: '50352' last_name: Rohlfing - first_name: D. full_name: Loehr, D. last_name: Loehr - first_name: S. full_name: Duncan, S. last_name: Duncan - first_name: A. full_name: Brown, A. last_name: Brown - first_name: A. full_name: Franklin, A. last_name: Franklin - first_name: I. full_name: Kimbara, I. last_name: Kimbara - first_name: J.-T. full_name: Milde, J.-T. last_name: Milde - first_name: F. full_name: Parrill, F. last_name: Parrill - first_name: T. full_name: Rose, T. last_name: Rose - first_name: T. full_name: Schmidt, T. last_name: Schmidt - first_name: H. full_name: Sloetjes, H. last_name: Sloetjes - first_name: A. full_name: Thies, A. last_name: Thies - first_name: S. full_name: Wellinghoff, S. last_name: Wellinghoff citation: ama: 'Rohlfing K, Loehr D, Duncan S, et al. Comparison of multimodal annotation tools: Workshop report. Gesprächsforschung. 2006;7.' apa: 'Rohlfing, K., Loehr, D., Duncan, S., Brown, A., Franklin, A., Kimbara, I., Milde, J.-T., Parrill, F., Rose, T., Schmidt, T., Sloetjes, H., Thies, A., & Wellinghoff, S. (2006). Comparison of multimodal annotation tools: Workshop report. Gesprächsforschung, 7.' bibtex: '@article{Rohlfing_Loehr_Duncan_Brown_Franklin_Kimbara_Milde_Parrill_Rose_Schmidt_et al._2006, title={Comparison of multimodal annotation tools: Workshop report}, volume={7}, journal={Gesprächsforschung}, 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 et al.}, year={2006} }' chicago: 'Rohlfing, Katharina, D. Loehr, S. Duncan, A. Brown, A. Franklin, I. Kimbara, J.-T. Milde, et al. “Comparison of Multimodal Annotation Tools: Workshop Report.” Gesprächsforschung 7 (2006).' ieee: 'K. Rohlfing et al., “Comparison of multimodal annotation tools: Workshop report,” Gesprächsforschung, vol. 7, 2006.' mla: 'Rohlfing, Katharina, et al. “Comparison of Multimodal Annotation Tools: Workshop Report.” Gesprächsforschung, vol. 7, 2006.' short: K. Rohlfing, D. Loehr, S. Duncan, A. Brown, A. Franklin, I. Kimbara, J.-T. Milde, F. Parrill, T. Rose, T. Schmidt, H. Sloetjes, A. Thies, S. Wellinghoff, Gesprächsforschung 7 (2006). date_created: 2020-06-24T13:03:01Z date_updated: 2023-02-01T13:11:34Z department: - _id: '749' intvolume: ' 7' language: - iso: eng publication: Gesprächsforschung status: public title: 'Comparison of multimodal annotation tools: Workshop report' type: journal_article user_id: '14931' volume: 7 year: '2006' ... --- _id: '31754' author: - first_name: P full_name: Felleiter, P last_name: Felleiter - first_name: Claus full_name: Reinsberger, Claus id: '48978' last_name: Reinsberger - first_name: D full_name: Springe, D last_name: Springe - first_name: H full_name: Plunien, H last_name: Plunien - first_name: M full_name: Baumberger, M last_name: Baumberger citation: ama: Felleiter P, Reinsberger C, Springe D, Plunien H, Baumberger M. Preclinical diagnosis of traumatic paraplegia or tetraplegia - a prospective study in 100 patients. Anasthesiol Intensivmed Notfallmed Schmerzther. 2006;41(1):9-13. apa: Felleiter, P., Reinsberger, C., Springe, D., Plunien, H., & Baumberger, M. (2006). Preclinical diagnosis of traumatic paraplegia or tetraplegia - a prospective study in 100 patients. Anasthesiol Intensivmed Notfallmed Schmerzther, 41(1), 9–13. bibtex: '@article{Felleiter_Reinsberger_Springe_Plunien_Baumberger_2006, title={Preclinical diagnosis of traumatic paraplegia or tetraplegia - a prospective study in 100 patients.}, volume={41}, number={1}, journal={Anasthesiol Intensivmed Notfallmed Schmerzther}, author={Felleiter, P and Reinsberger, Claus and Springe, D and Plunien, H and Baumberger, M}, year={2006}, pages={9–13} }' chicago: 'Felleiter, P, Claus Reinsberger, D Springe, H Plunien, and M Baumberger. “Preclinical Diagnosis of Traumatic Paraplegia or Tetraplegia - a Prospective Study in 100 Patients.” Anasthesiol Intensivmed Notfallmed Schmerzther 41, no. 1 (2006): 9–13.' ieee: P. Felleiter, C. Reinsberger, D. Springe, H. Plunien, and M. Baumberger, “Preclinical diagnosis of traumatic paraplegia or tetraplegia - a prospective study in 100 patients.,” Anasthesiol Intensivmed Notfallmed Schmerzther, vol. 41, no. 1, pp. 9–13, 2006. mla: Felleiter, P., et al. “Preclinical Diagnosis of Traumatic Paraplegia or Tetraplegia - a Prospective Study in 100 Patients.” Anasthesiol Intensivmed Notfallmed Schmerzther, vol. 41, no. 1, 2006, pp. 9–13. short: P. Felleiter, C. Reinsberger, D. Springe, H. Plunien, M. Baumberger, Anasthesiol Intensivmed Notfallmed Schmerzther 41 (2006) 9–13. date_created: 2022-06-07T09:36:23Z date_updated: 2023-02-06T13:55:35Z department: - _id: '35' - _id: '176' - _id: '17' external_id: pmid: - '16440253' intvolume: ' 41' issue: '1' language: - iso: eng page: 9-13 pmid: '1' publication: Anasthesiol Intensivmed Notfallmed Schmerzther publication_identifier: issn: - 0939-2661 - 1439-1074 status: public title: Preclinical diagnosis of traumatic paraplegia or tetraplegia - a prospective study in 100 patients. type: journal_article user_id: '33213' volume: 41 year: '2006' ... --- _id: '34892' abstract: - lang: eng text: '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: - first_name: Jürgen full_name: Klüners, Jürgen id: '21202' last_name: Klüners citation: ama: Klüners J. The number of S₄-fields with given discriminant. Acta Arithmetica. 2006;122(2):185-194. doi:10.4064/aa122-2-3 apa: Klüners, J. (2006). The number of S₄-fields with given discriminant. Acta Arithmetica, 122(2), 185–194. https://doi.org/10.4064/aa122-2-3 bibtex: '@article{Klüners_2006, title={The number of S₄-fields with given discriminant}, volume={122}, DOI={10.4064/aa122-2-3}, number={2}, journal={Acta Arithmetica}, publisher={Institute of Mathematics, Polish Academy of Sciences}, author={Klüners, Jürgen}, year={2006}, pages={185–194} }' chicago: 'Klüners, Jürgen. “The Number of S₄-Fields with given Discriminant.” Acta Arithmetica 122, no. 2 (2006): 185–94. https://doi.org/10.4064/aa122-2-3.' ieee: 'J. Klüners, “The number of S₄-fields with given discriminant,” Acta Arithmetica, vol. 122, no. 2, pp. 185–194, 2006, doi: 10.4064/aa122-2-3.' mla: Klüners, Jürgen. “The Number of S₄-Fields with given Discriminant.” Acta Arithmetica, vol. 122, no. 2, Institute of Mathematics, Polish Academy of Sciences, 2006, pp. 185–94, doi:10.4064/aa122-2-3. short: J. Klüners, Acta Arithmetica 122 (2006) 185–194. date_created: 2022-12-23T09:40:25Z date_updated: 2023-03-06T09:52:41Z department: - _id: '102' doi: 10.4064/aa122-2-3 external_id: arxiv: - math/0411484 intvolume: ' 122' issue: '2' keyword: - Algebra and Number Theory language: - iso: eng page: 185-194 publication: Acta Arithmetica publication_identifier: issn: - 0065-1036 - 1730-6264 publication_status: published publisher: Institute of Mathematics, Polish Academy of Sciences status: public title: The number of S₄-fields with given discriminant type: journal_article user_id: '93826' volume: 122 year: '2006' ... --- _id: '43270' abstract: - lang: eng text: 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: - first_name: Torsten full_name: Meier, Torsten id: '344' last_name: Meier orcid: 0000-0001-8864-2072 - first_name: Huynh Thanh full_name: Duc, Huynh Thanh last_name: Duc - first_name: Matthias full_name: Reichelt, Matthias id: '138' last_name: Reichelt - first_name: B. full_name: Pasenow, B. last_name: Pasenow - first_name: T. full_name: Stroucken, T. last_name: Stroucken - first_name: S.W. full_name: Koch, S.W. last_name: Koch citation: ama: 'Meier T, Duc HT, Reichelt M, Pasenow B, Stroucken T, Koch SW. Computational Optoelectronics of Semiconductor Nanostructures including Many-Body Effects. In: Munster G, Wolf D, Kremer M, eds. Germany in NIC Series Vol. 32. NIC Symposium 2006 - Proceedings. John von Neumann Institute for Computing; 2006:219-226.' apa: Meier, T., Duc, H. T., Reichelt, M., Pasenow, B., Stroucken, T., & Koch, S. W. (2006). Computational Optoelectronics of Semiconductor Nanostructures including Many-Body Effects. In G. Munster, D. Wolf, & M. Kremer (Eds.), Germany in NIC Series Vol. 32 (pp. 219–226). John von Neumann Institute for Computing. bibtex: '@inbook{Meier_Duc_Reichelt_Pasenow_Stroucken_Koch_2006, place={Jülich}, series={NIC Symposium 2006 - Proceedings}, title={Computational Optoelectronics of Semiconductor Nanostructures including Many-Body Effects}, booktitle={Germany in NIC Series Vol. 32}, publisher={John von Neumann Institute for Computing}, author={Meier, Torsten and Duc, Huynh Thanh and Reichelt, Matthias and Pasenow, B. and Stroucken, T. and Koch, S.W.}, editor={Munster, G. and Wolf, D. and Kremer, M.}, year={2006}, pages={219–226}, collection={NIC Symposium 2006 - Proceedings} }' chicago: 'Meier, Torsten, Huynh Thanh Duc, Matthias Reichelt, B. Pasenow, T. Stroucken, and S.W. Koch. “Computational Optoelectronics of Semiconductor Nanostructures Including Many-Body Effects.” In Germany in NIC Series Vol. 32, edited by G. Munster, D. Wolf, and M. Kremer, 219–26. NIC Symposium 2006 - Proceedings. Jülich: John von Neumann Institute for Computing, 2006.' ieee: 'T. Meier, H. T. Duc, M. Reichelt, B. Pasenow, T. Stroucken, and S. W. Koch, “Computational Optoelectronics of Semiconductor Nanostructures including Many-Body Effects,” in Germany in NIC Series Vol. 32, G. Munster, D. Wolf, and M. Kremer, Eds. Jülich: John von Neumann Institute for Computing, 2006, pp. 219–226.' mla: Meier, Torsten, et al. “Computational Optoelectronics of Semiconductor Nanostructures Including Many-Body Effects.” Germany in NIC Series Vol. 32, edited by G. Munster et al., John von Neumann Institute for Computing, 2006, pp. 219–26. short: 'T. Meier, H.T. Duc, M. Reichelt, B. Pasenow, T. Stroucken, S.W. Koch, in: G. Munster, D. Wolf, M. Kremer (Eds.), Germany in NIC Series Vol. 32, John von Neumann Institute for Computing, Jülich, 2006, pp. 219–226.' date_created: 2023-04-01T22:57:47Z date_updated: 2023-04-02T13:47:07Z department: - _id: '293' editor: - first_name: G. full_name: Munster, G. last_name: Munster - first_name: D. full_name: Wolf, D. last_name: Wolf - first_name: M. full_name: Kremer, M. last_name: Kremer extern: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=11dbc03d265593db1a75637947a3265ac044782f oa: '1' page: 219-226 place: Jülich publication: Germany in NIC Series Vol. 32 publication_identifier: isbn: - 3-00-017351-X publication_status: published publisher: John von Neumann Institute for Computing series_title: NIC Symposium 2006 - Proceedings status: public title: Computational Optoelectronics of Semiconductor Nanostructures including Many-Body Effects type: book_chapter user_id: '49063' year: '2006' ... --- _id: '45038' author: - first_name: Bardo full_name: Herzig, Bardo id: '217' last_name: Herzig - first_name: A. H. full_name: Hilligus, A. H. last_name: Hilligus - first_name: J. full_name: Langenbacher-Liebgott, J. last_name: Langenbacher-Liebgott - first_name: P. full_name: Reinhold, P. last_name: Reinhold - first_name: H.-D. full_name: Rinkens, H.-D. last_name: Rinkens citation: ama: Herzig B, Hilligus AH, Langenbacher-Liebgott J, Reinhold P, Rinkens H-D. PLAZ-Entwicklungsstrategie – Professional School für Bildungsforschung und Lehrerbildung. PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14. Published online 2006:34. apa: Herzig, B., Hilligus, A. H., Langenbacher-Liebgott, J., Reinhold, P., & Rinkens, H.-D. (2006). PLAZ-Entwicklungsstrategie – Professional School für Bildungsforschung und Lehrerbildung. PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14, 34. bibtex: '@article{Herzig_Hilligus_Langenbacher-Liebgott_Reinhold_Rinkens_2006, title={PLAZ-Entwicklungsstrategie – Professional School für Bildungsforschung und Lehrerbildung}, journal={PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14}, author={Herzig, Bardo and Hilligus, A. H. and Langenbacher-Liebgott, J. and Reinhold, P. and Rinkens, H.-D.}, year={2006}, pages={34} }' chicago: Herzig, Bardo, A. H. Hilligus, J. Langenbacher-Liebgott, P. Reinhold, and H.-D. Rinkens. “PLAZ-Entwicklungsstrategie – Professional School für Bildungsforschung und Lehrerbildung.” PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14, 2006, 34. ieee: B. Herzig, A. H. Hilligus, J. Langenbacher-Liebgott, P. Reinhold, and H.-D. Rinkens, “PLAZ-Entwicklungsstrategie – Professional School für Bildungsforschung und Lehrerbildung,” PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14, p. 34, 2006. mla: Herzig, Bardo, et al. “PLAZ-Entwicklungsstrategie – Professional School für Bildungsforschung und Lehrerbildung.” PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14, 2006, p. 34. short: B. Herzig, A.H. Hilligus, J. Langenbacher-Liebgott, P. Reinhold, H.-D. Rinkens, PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14 (2006) 34. date_created: 2023-05-17T08:57:22Z date_updated: 2023-05-17T08:57:34Z department: - _id: '459' language: - iso: ger page: '34' publication: PLAZ-Forum – Lehrerausbildung und Schule in der Diskussion, Heft 14 status: public title: PLAZ-Entwicklungsstrategie – Professional School für Bildungsforschung und Lehrerbildung type: journal_article user_id: '21240' year: '2006' ... --- _id: '47463' author: - first_name: Rüdiger full_name: Heim, Rüdiger last_name: Heim - first_name: Miriam full_name: Kehne, Miriam id: '129' last_name: Kehne citation: ama: 'Heim R, Kehne M. Forschungsdesign der SPRINT-Studie. In: Miethling W-D, Krieger K, eds. Zum Umgang mit Vielfalt als sportpädagogische Herausforderung. Czwalina; 2006:203-206.' apa: Heim, R., & Kehne, M. (2006). Forschungsdesign der SPRINT-Studie. In W.-D. Miethling & K. Krieger (Eds.), Zum Umgang mit Vielfalt als sportpädagogische Herausforderung (pp. 203–206). Czwalina. bibtex: '@inbook{Heim_Kehne_2006, place={Hamburg}, title={Forschungsdesign der SPRINT-Studie}, booktitle={Zum Umgang mit Vielfalt als sportpädagogische Herausforderung}, publisher={Czwalina}, author={Heim, Rüdiger and Kehne, Miriam}, editor={Miethling, W.-D. and Krieger, Klaus}, year={2006}, pages={203–206} }' chicago: 'Heim, Rüdiger, and Miriam Kehne. “Forschungsdesign der SPRINT-Studie.” In Zum Umgang mit Vielfalt als sportpädagogische Herausforderung, edited by W.-D. Miethling and Klaus Krieger, 203–6. Hamburg: Czwalina, 2006.' ieee: 'R. Heim and M. Kehne, “Forschungsdesign der SPRINT-Studie,” in Zum Umgang mit Vielfalt als sportpädagogische Herausforderung, W.-D. Miethling and K. Krieger, Eds. Hamburg: Czwalina, 2006, pp. 203–206.' mla: Heim, Rüdiger, and Miriam Kehne. “Forschungsdesign der SPRINT-Studie.” Zum Umgang mit Vielfalt als sportpädagogische Herausforderung, edited by W.-D. Miethling and Klaus Krieger, Czwalina, 2006, pp. 203–06. short: 'R. Heim, M. Kehne, in: W.-D. Miethling, K. Krieger (Eds.), Zum Umgang mit Vielfalt als sportpädagogische Herausforderung, Czwalina, Hamburg, 2006, pp. 203–206.' date_created: 2023-09-26T20:25:41Z date_updated: 2023-09-26T20:26:15Z department: - _id: '17' - _id: '318' editor: - first_name: W.-D. full_name: Miethling, W.-D. last_name: Miethling - first_name: Klaus full_name: Krieger, Klaus last_name: Krieger language: - iso: ger page: 203-206 place: Hamburg publication: Zum Umgang mit Vielfalt als sportpädagogische Herausforderung publisher: Czwalina status: public title: Forschungsdesign der SPRINT-Studie type: book_chapter user_id: '129' year: '2006' ... --- _id: '25228' author: - first_name: Carsten full_name: Matysczok, Carsten last_name: Matysczok citation: ama: 'Matysczok C. Dynamische Kantenextraktion: Ein Verfahren zur Generierung von Tracking-Informationen für Augmented Reality-Anwendungen auf Basis von 3D-Referenzmodellen. Vol 165. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005.' apa: 'Matysczok, C. (2005). Dynamische Kantenextraktion: Ein Verfahren zur Generierung von Tracking-Informationen für Augmented Reality-Anwendungen auf Basis von 3D-Referenzmodellen (Vol. 165). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.' bibtex: '@book{Matysczok_2005, series={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}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Matysczok, Carsten}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: 'Matysczok, Carsten. Dynamische Kantenextraktion: Ein Verfahren zur Generierung von Tracking-Informationen für Augmented Reality-Anwendungen auf Basis von 3D-Referenzmodellen. Vol. 165. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.' ieee: 'C. Matysczok, Dynamische Kantenextraktion: Ein Verfahren zur Generierung von Tracking-Informationen für Augmented Reality-Anwendungen auf Basis von 3D-Referenzmodellen, vol. 165. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.' mla: 'Matysczok, Carsten. Dynamische Kantenextraktion: Ein Verfahren zur Generierung von Tracking-Informationen für Augmented Reality-Anwendungen auf Basis von 3D-Referenzmodellen. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.' short: 'C. Matysczok, Dynamische Kantenextraktion: Ein Verfahren zur Generierung von Tracking-Informationen für Augmented Reality-Anwendungen auf Basis von 3D-Referenzmodellen, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.' date_created: 2021-10-01T07:40:20Z date_updated: 2022-01-06T06:56:55Z department: - _id: '26' intvolume: ' 165' language: - iso: ger publication_status: published publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: 'Dynamische Kantenextraktion: Ein Verfahren zur Generierung von Tracking-Informationen für Augmented Reality-Anwendungen auf Basis von 3D-Referenzmodellen' type: dissertation user_id: '60046' volume: 165 year: '2005' ... --- _id: '19827' abstract: - lang: eng text: "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).\r\n\r\nThe 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.\r\n\r\nWe 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: - first_name: Peter full_name: Mahlmann, Peter last_name: Mahlmann - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Mahlmann P, Schindelhauer C. Peer-to-peer networks based on random transformations of connected regular undirected graphs. In: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05. ; 2005. doi:10.1145/1073970.1073992' apa: Mahlmann, P., & Schindelhauer, C. (2005). Peer-to-peer networks based on random transformations of connected regular undirected graphs. In Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05. https://doi.org/10.1145/1073970.1073992 bibtex: '@inproceedings{Mahlmann_Schindelhauer_2005, title={Peer-to-peer networks based on random transformations of connected regular undirected graphs}, DOI={10.1145/1073970.1073992}, booktitle={Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2005} }' chicago: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005. https://doi.org/10.1145/1073970.1073992. ieee: P. Mahlmann and C. Schindelhauer, “Peer-to-peer networks based on random transformations of connected regular undirected graphs,” in Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05, 2005. mla: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005, doi:10.1145/1073970.1073992. short: 'P. Mahlmann, C. Schindelhauer, in: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005.' date_created: 2020-10-01T09:50:59Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1073970.1073992 language: - iso: eng publication: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05 publication_identifier: isbn: - '1581139861' publication_status: published status: public title: Peer-to-peer networks based on random transformations of connected regular undirected graphs type: conference user_id: '15415' year: '2005' ... --- _id: '27763' author: - first_name: A full_name: Kroke, A last_name: Kroke - first_name: S full_name: Hahn, S last_name: Hahn - first_name: Anette full_name: Buyken, Anette id: '65985' last_name: Buyken - first_name: A D full_name: Liese, A D last_name: Liese citation: ama: Kroke A, Hahn S, Buyken A, Liese AD. A comparative evaluation of two different approaches to estimating age at adiposity rebound. International Journal of Obesity. Published online 2005:261-266. doi:10.1038/sj.ijo.0803143 apa: Kroke, A., Hahn, S., Buyken, A., & Liese, A. D. (2005). A comparative evaluation of two different approaches to estimating age at adiposity rebound. International Journal of Obesity, 261–266. https://doi.org/10.1038/sj.ijo.0803143 bibtex: '@article{Kroke_Hahn_Buyken_Liese_2005, title={A comparative evaluation of two different approaches to estimating age at adiposity rebound}, DOI={10.1038/sj.ijo.0803143}, journal={International Journal of Obesity}, author={Kroke, A and Hahn, S and Buyken, Anette and Liese, A D}, year={2005}, pages={261–266} }' chicago: Kroke, A, S Hahn, Anette Buyken, and A D Liese. “A Comparative Evaluation of Two Different Approaches to Estimating Age at Adiposity Rebound.” International Journal of Obesity, 2005, 261–66. https://doi.org/10.1038/sj.ijo.0803143. ieee: 'A. Kroke, S. Hahn, A. Buyken, and A. D. Liese, “A comparative evaluation of two different approaches to estimating age at adiposity rebound,” International Journal of Obesity, pp. 261–266, 2005, doi: 10.1038/sj.ijo.0803143.' mla: Kroke, A., et al. “A Comparative Evaluation of Two Different Approaches to Estimating Age at Adiposity Rebound.” International Journal of Obesity, 2005, pp. 261–66, doi:10.1038/sj.ijo.0803143. short: A. Kroke, S. Hahn, A. Buyken, A.D. Liese, International Journal of Obesity (2005) 261–266. date_created: 2021-11-23T16:47:09Z date_updated: 2022-01-06T06:57:44Z department: - _id: '17' - _id: '22' - _id: '571' doi: 10.1038/sj.ijo.0803143 language: - iso: eng page: 261-266 publication: International Journal of Obesity publication_identifier: issn: - 0307-0565 - 1476-5497 publication_status: published status: public title: A comparative evaluation of two different approaches to estimating age at adiposity rebound type: journal_article user_id: '61597' year: '2005' ... --- _id: '27895' author: - first_name: Kirsten full_name: Schlegel-Matthies, Kirsten id: '459' last_name: Schlegel-Matthies citation: ama: 'Schlegel-Matthies K. Neue Orientierungen der Ernährungs- und Verbraucherbildung . In: Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn. ; 2005:51-55.' apa: Schlegel-Matthies, K. (2005). Neue Orientierungen der Ernährungs- und Verbraucherbildung . Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn, 51–55. bibtex: '@inproceedings{Schlegel-Matthies_2005, place={Bonn}, title={Neue Orientierungen der Ernährungs- und Verbraucherbildung }, booktitle={Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn}, author={Schlegel-Matthies, Kirsten}, year={2005}, pages={51–55} }' chicago: Schlegel-Matthies, Kirsten. “Neue Orientierungen der Ernährungs- und Verbraucherbildung .” In Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn, 51–55. Bonn, 2005. ieee: K. Schlegel-Matthies, “Neue Orientierungen der Ernährungs- und Verbraucherbildung ,” in Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn, 2005, pp. 51–55. mla: Schlegel-Matthies, Kirsten. “Neue Orientierungen der Ernährungs- und Verbraucherbildung .” Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn, 2005, pp. 51–55. short: 'K. Schlegel-Matthies, in: Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn, Bonn, 2005, pp. 51–55.' date_created: 2021-11-25T20:15:10Z date_updated: 2022-01-06T06:57:48Z department: - _id: '35' - _id: '22' - _id: '396' language: - iso: ger page: 51-55 place: Bonn publication: Aktuelle Aspekte in der Ernährungsbildung und -beratung. Tagungsband der DGE-Arbeitstagung am 29. und 30. September in Paderborn publication_status: published status: public title: 'Neue Orientierungen der Ernährungs- und Verbraucherbildung ' type: conference user_id: '49428' year: '2005' ... --- _id: '17414' abstract: - lang: eng text: "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\x97the 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.\r\n\r\nTo overcome these weak points, intuitive and understandable man\x96machine 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: - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jürgen full_name: Gausemeier, Jürgen last_name: Gausemeier - first_name: Michael full_name: Grafe, Michael last_name: Grafe - first_name: Carsten full_name: Matysczok, Carsten last_name: Matysczok - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck citation: ama: Dangelmaier W, Fischer M, Gausemeier J, Grafe M, Matysczok C, Mueck B. Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry. 2005:371-383. doi:10.1016/j.compind.2005.01.007 apa: Dangelmaier, W., Fischer, M., Gausemeier, J., Grafe, M., Matysczok, C., & Mueck, B. (2005). Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry, 371–383. https://doi.org/10.1016/j.compind.2005.01.007 bibtex: '@article{Dangelmaier_Fischer_Gausemeier_Grafe_Matysczok_Mueck_2005, title={Virtual and augmented reality support for discrete manufacturing system simulation}, DOI={10.1016/j.compind.2005.01.007}, journal={Computers in Industry}, author={Dangelmaier, Wilhelm and Fischer, Matthias and Gausemeier, Jürgen and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt}, year={2005}, pages={371–383} }' chicago: Dangelmaier, Wilhelm, Matthias Fischer, Jürgen Gausemeier, Michael Grafe, Carsten Matysczok, and Bengt Mueck. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” Computers in Industry, 2005, 371–83. https://doi.org/10.1016/j.compind.2005.01.007. ieee: W. Dangelmaier, M. Fischer, J. Gausemeier, M. Grafe, C. Matysczok, and B. Mueck, “Virtual and augmented reality support for discrete manufacturing system simulation,” Computers in Industry, pp. 371–383, 2005. mla: Dangelmaier, Wilhelm, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” Computers in Industry, 2005, pp. 371–83, doi:10.1016/j.compind.2005.01.007. short: W. Dangelmaier, M. Fischer, J. Gausemeier, M. Grafe, C. Matysczok, B. Mueck, Computers in Industry (2005) 371–383. date_created: 2020-07-27T12:11:32Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' doi: 10.1016/j.compind.2005.01.007 language: - iso: eng page: 371-383 publication: Computers in Industry publication_identifier: issn: - 0166-3615 publication_status: published status: public title: Virtual and augmented reality support for discrete manufacturing system simulation type: journal_article user_id: '15415' year: '2005' ... --- _id: '17415' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: B. full_name: Mueck, B. last_name: Mueck - first_name: K. full_name: Mahajan, K. last_name: Mahajan - first_name: M. full_name: Kortenjan, M. last_name: Kortenjan - first_name: C. full_name: Laroque, C. last_name: Laroque - first_name: W. full_name: Dangelmaier, W. last_name: Dangelmaier citation: ama: 'Fischer M, Mueck B, Mahajan K, Kortenjan M, Laroque C, Dangelmaier W. Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations. In: Proceedings of the Winter Simulation Conference. ; 2005. doi:10.1109/wsc.2005.1574470' apa: Fischer, M., Mueck, B., Mahajan, K., Kortenjan, M., Laroque, C., & Dangelmaier, W. (2005). Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations. In Proceedings of the Winter Simulation Conference. https://doi.org/10.1109/wsc.2005.1574470 bibtex: '@inproceedings{Fischer_Mueck_Mahajan_Kortenjan_Laroque_Dangelmaier_2005, 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}, booktitle={Proceedings of the Winter Simulation Conference}, author={Fischer, Matthias and Mueck, B. and Mahajan, K. and Kortenjan, M. and Laroque, C. and Dangelmaier, W.}, year={2005} }' chicago: Fischer, Matthias, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, and W. Dangelmaier. “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations.” In Proceedings of the Winter Simulation Conference, 2005. https://doi.org/10.1109/wsc.2005.1574470. ieee: M. Fischer, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, and W. Dangelmaier, “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations,” in Proceedings of the Winter Simulation Conference, 2005. mla: Fischer, Matthias, et al. “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations.” Proceedings of the Winter Simulation Conference, 2005, doi:10.1109/wsc.2005.1574470. short: 'M. Fischer, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, W. Dangelmaier, in: Proceedings of the Winter Simulation Conference, 2005.' date_created: 2020-07-27T12:20:01Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' doi: 10.1109/wsc.2005.1574470 language: - iso: eng publication: Proceedings of the Winter Simulation Conference publication_identifier: isbn: - '0780395190' publication_status: published status: public title: Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations type: conference user_id: '15415' year: '2005' ... --- _id: '17902' author: - first_name: Ilka full_name: Mindt, Ilka id: '32079' last_name: Mindt - first_name: Susan full_name: Hunston, Susan last_name: Hunston citation: ama: "Mindt I, Hunston S. Corpora in Applied Linguistics. In: ICAME Journal 29, Computers in English  \tLinguistics. Cambridge: Cambridge University Press, 2002; 2005:184-188." apa: "Mindt, I., & Hunston, S. (2005). Corpora in Applied Linguistics. In ICAME Journal 29, Computers in English  \tLinguistics (pp. 184–188). Cambridge: Cambridge University Press, 2002." bibtex: "@inbook{Mindt_Hunston_2005, place={Cambridge}, title={Corpora in Applied Linguistics}, booktitle={ICAME Journal 29, Computers in English  \tLinguistics}, publisher={Cambridge University Press, 2002}, author={Mindt, Ilka and Hunston, Susan}, year={2005}, pages={184–188} }" chicago: "Mindt, Ilka, and Susan Hunston. “Corpora in Applied Linguistics.” In ICAME Journal 29, Computers in English  \tLinguistics, 184–88. Cambridge: Cambridge University Press, 2002, 2005." ieee: "I. Mindt and S. Hunston, “Corpora in Applied Linguistics,” in ICAME Journal 29, Computers in English  \tLinguistics, Cambridge: Cambridge University Press, 2002, 2005, pp. 184–188." mla: "Mindt, Ilka, and Susan Hunston. “Corpora in Applied Linguistics.” ICAME Journal 29, Computers in English  \tLinguistics, Cambridge University Press, 2002, 2005, pp. 184–88." short: "I. Mindt, S. Hunston, in: ICAME Journal 29, Computers in English  \tLinguistics, Cambridge University Press, 2002, Cambridge, 2005, pp. 184–188." date_created: 2020-08-13T07:50:46Z date_updated: 2022-01-06T06:53:22Z department: - _id: '384' extern: '1' language: - iso: eng page: 184 - 188 place: Cambridge publication: "ICAME Journal 29, Computers in English \tLinguistics" publisher: Cambridge University Press, 2002 status: public title: Corpora in Applied Linguistics type: book_chapter user_id: '21240' year: '2005' ... --- _id: '18787' abstract: - lang: eng text: 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: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling citation: ama: 'Sohler C, Frahling G. Coresets in Dynamic Geometric Data Streams. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC). ; 2005:209-217.' apa: Sohler, C., & Frahling, G. (2005). Coresets in Dynamic Geometric Data Streams. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) (pp. 209–217). bibtex: '@inproceedings{Sohler_Frahling_2005, title={Coresets in Dynamic Geometric Data Streams}, booktitle={Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)}, author={Sohler, Christian and Frahling, Gereon}, year={2005}, pages={209–217} }' chicago: Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 209–17, 2005. ieee: C. Sohler and G. Frahling, “Coresets in Dynamic Geometric Data Streams,” in Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–217. mla: Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–17. short: 'C. Sohler, G. Frahling, in: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–217.' date_created: 2020-09-01T13:49:23Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' language: - iso: eng page: 209-217 publication: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) status: public title: Coresets in Dynamic Geometric Data Streams type: conference user_id: '15415' year: '2005' ... --- _id: '18855' abstract: - lang: eng text: "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.\r\n\r\n\r\nRead More: https://epubs.siam.org/doi/10.1137/S0097539703435297\r\n" author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Funda full_name: Ergün, Funda last_name: Ergün - first_name: Lance full_name: Fortnow, Lance last_name: Fortnow - first_name: Avner full_name: Magen, Avner last_name: Magen - first_name: Ilan full_name: Newman, Ilan last_name: Newman - first_name: Ronitt full_name: Rubinfeld, Ronitt last_name: Rubinfeld - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: Czumaj A, Ergün F, Fortnow L, et al. Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing. 2005;35(1):91-109. doi:10.1137/s0097539703435297 apa: Czumaj, A., Ergün, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., & Sohler, C. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing, 35(1), 91–109. https://doi.org/10.1137/s0097539703435297 bibtex: '@article{Czumaj_Ergün_Fortnow_Magen_Newman_Rubinfeld_Sohler_2005, title={Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time}, volume={35}, DOI={10.1137/s0097539703435297}, number={1}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian}, year={2005}, pages={91–109} }' chicago: 'Czumaj, Artur, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, and Christian Sohler. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” SIAM Journal on Computing 35, no. 1 (2005): 91–109. https://doi.org/10.1137/s0097539703435297.' ieee: A. Czumaj et al., “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time,” SIAM Journal on Computing, vol. 35, no. 1, pp. 91–109, 2005. mla: Czumaj, Artur, et al. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” SIAM Journal on Computing, vol. 35, no. 1, 2005, pp. 91–109, doi:10.1137/s0097539703435297. short: A. Czumaj, F. Ergün, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, C. Sohler, SIAM Journal on Computing 35 (2005) 91–109. date_created: 2020-09-02T12:13:26Z date_updated: 2022-01-06T06:53:53Z department: - _id: '63' doi: 10.1137/s0097539703435297 intvolume: ' 35' issue: '1' language: - iso: eng page: 91-109 publication: SIAM Journal on Computing publication_identifier: issn: - 0097-5397 - 1095-7111 publication_status: published status: public title: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time type: journal_article user_id: '15415' volume: 35 year: '2005' ... --- _id: '18867' abstract: - lang: eng text: 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: - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Jens full_name: Krokowski, Jens last_name: Krokowski citation: ama: 'Frahling G, Krokowski J. Online Occlusion Culling. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:10.1007/11561071_67' apa: 'Frahling, G., & Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. https://doi.org/10.1007/11561071_67' bibtex: '@inproceedings{Frahling_Krokowski_2005, place={Berlin, Heidelberg}, title={Online Occlusion Culling}, volume={3669}, DOI={10.1007/11561071_67}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer}, author={Frahling, Gereon and Krokowski, Jens}, year={2005}, pages={758–769} }' chicago: 'Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:758–69. Berlin, Heidelberg: Springer, 2005. https://doi.org/10.1007/11561071_67.' ieee: G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769. mla: Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67. short: 'G. Frahling, J. Krokowski, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer, Berlin, Heidelberg, 2005, pp. 758–769.' date_created: 2020-09-02T13:26:52Z date_updated: 2022-01-06T06:53:53Z department: - _id: '63' doi: 10.1007/11561071_67 intvolume: ' 3669' language: - iso: eng page: 758-769 place: Berlin, Heidelberg publication: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) publication_identifier: isbn: - '9783540291183' - '9783540319511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Online Occlusion Culling type: conference user_id: '15415' volume: 3669 year: '2005' ... --- _id: '18912' abstract: - lang: eng text: '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: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski citation: ama: 'Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg; 2005. doi:10.1007/11549468_105' apa: Bienkowski, M., & Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg. https://doi.org/10.1007/11549468_105 bibtex: '@inproceedings{Bienkowski_Korzeniowski_2005, place={Berlin, Heidelberg}, title={Dynamic Page Migration Under Brownian Motion}, DOI={10.1007/11549468_105}, booktitle={Proc. of the European Conference in Parallel Processing (Euro-Par)}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw}, year={2005} }' chicago: Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg, 2005. https://doi.org/10.1007/11549468_105. ieee: M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in Proc. of the European Conference in Parallel Processing (Euro-Par), 2005. mla: Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi:10.1007/11549468_105. short: 'M. Bienkowski, M. Korzeniowski, in: Proc. of the European Conference in Parallel Processing (Euro-Par), Berlin, Heidelberg, 2005.' date_created: 2020-09-03T07:56:58Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/11549468_105 language: - iso: eng place: Berlin, Heidelberg publication: Proc. of the European Conference in Parallel Processing (Euro-Par) publication_identifier: isbn: - '9783540287001' - '9783540319252' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Dynamic Page Migration Under Brownian Motion type: conference user_id: '15415' year: '2005' ... --- _id: '18917' abstract: - lang: eng text: 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: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski citation: ama: 'Bienkowski M. Dynamic Page Migration with Stochastic Requests. In: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005). ACM Press, NY, USA; 2005:270-278.' apa: 'Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.' bibtex: '@inproceedings{Bienkowski_2005, title={Dynamic Page Migration with Stochastic Requests}, booktitle={Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)}, publisher={ACM Press, NY, USA}, author={Bienkowski, Marcin}, year={2005}, pages={270–278} }' chicago: Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), 270–78. ACM Press, NY, USA, 2005. ieee: M. Bienkowski, “Dynamic Page Migration with Stochastic Requests,” in Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), Las Vegas, Nevada, USA, 2005, pp. 270–278. mla: Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–78. short: 'M. Bienkowski, in: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–278.' conference: location: Las Vegas, Nevada, USA date_created: 2020-09-03T08:19:31Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' language: - iso: eng page: 270-278 publication: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) publisher: ACM Press, NY, USA status: public title: Dynamic Page Migration with Stochastic Requests type: conference user_id: '15415' year: '2005' ... --- _id: '18925' abstract: - lang: eng text: 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: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski citation: ama: 'Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science. ; 2005:365-376. doi:10.1007/978-3-540-31856-9_30' apa: Bienkowski, M., Dynia, M., & Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 365–376). https://doi.org/10.1007/978-3-540-31856-9_30 bibtex: '@inproceedings{Bienkowski_Dynia_Korzeniowski_2005, series={Lecture Notes in Computer Science}, title={Improved Algorithms for Dynamic Page Migration}, DOI={10.1007/978-3-540-31856-9_30}, booktitle={Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}, year={2005}, pages={365–376}, collection={Lecture Notes in Computer Science} }' chicago: Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.” In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 365–76. Lecture Notes in Computer Science, 2005. https://doi.org/10.1007/978-3-540-31856-9_30. ieee: M. Bienkowski, M. Dynia, and M. Korzeniowski, “Improved Algorithms for Dynamic Page Migration,” in Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376. mla: Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.” Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30. short: 'M. Bienkowski, M. Dynia, M. Korzeniowski, in: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376.' date_created: 2020-09-03T10:01:03Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/978-3-540-31856-9_30 language: - iso: eng page: 365-376 publication: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) publication_identifier: isbn: - '9783540249986' - '9783540318569' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: Lecture Notes in Computer Science status: public title: Improved Algorithms for Dynamic Page Migration type: conference user_id: '15415' year: '2005' ... --- _id: '23883' abstract: - lang: eng text: 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: - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Piotr full_name: Indyk, Piotr last_name: Indyk - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Frahling G, Indyk P, Sohler C. Sampling in dynamic data streams and applications. In: Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05. ; 2005. doi:10.1145/1064092.1064116' apa: Frahling, G., Indyk, P., & Sohler, C. (2005). Sampling in dynamic data streams and applications. In Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05. https://doi.org/10.1145/1064092.1064116 bibtex: '@inproceedings{Frahling_Indyk_Sohler_2005, title={Sampling in dynamic data streams and applications}, DOI={10.1145/1064092.1064116}, booktitle={Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05}, author={Frahling, Gereon and Indyk, Piotr and Sohler, Christian}, year={2005} }' chicago: Frahling, Gereon, Piotr Indyk, and Christian Sohler. “Sampling in Dynamic Data Streams and Applications.” In Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005. https://doi.org/10.1145/1064092.1064116. ieee: G. Frahling, P. Indyk, and C. Sohler, “Sampling in dynamic data streams and applications,” in Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05, 2005. mla: Frahling, Gereon, et al. “Sampling in Dynamic Data Streams and Applications.” Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005, doi:10.1145/1064092.1064116. short: 'G. Frahling, P. Indyk, C. Sohler, in: Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005.' date_created: 2021-09-07T13:10:15Z date_updated: 2022-01-06T06:56:02Z department: - _id: '63' doi: 10.1145/1064092.1064116 language: - iso: eng publication: Proceedings of the twenty-first annual symposium on Computational geometry - SCG '05 publication_status: published status: public title: Sampling in dynamic data streams and applications type: conference user_id: '15415' year: '2005' ...