Quantitative Description of Pedestrian Dynamics with a Force based Model

This paper introduces a space-continuous force-based model for simulating pedestrian dynamics. The main interest of this work is the quantitative description of pedestrian movement through a bottleneck. Measurements of flow and density will be presented and compared with empirical data. The results of the proposed model show a good agreement with empirical data. Furthermore, we emphasize the importance of volume exclusion in force-based models.Comment: 4 pages, 7 figures, 2009 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies (WI-IAT 2009), 15-18 September 2009, in Milano, Italy, 200

Quantitative Verification of a Force-based Model for Pedestrian Dynamics

This paper introduces a spatially continuous force-based model for simulating pedestrian dynamics. The main intention of this work is the quantitative description of pedestrian movement through bottlenecks and in corridors. Measurements of flow and density at bottlenecks will be presented and compared with empirical data. Furthermore the fundamental diagram for the movement in a corridor is reproduced. The results of the proposed model show a good agreement with empirical data.Comment: 8 pages, 7 figures, Proceedings of Traffic and Granular Flow (TGF) 200

Quantitative Verification of a Force-based Model for Pedestrian Dynamics

This paper introduces a spatially continuous force-based model for simulating pedestrian dynamics. The main intention of this work is the quantitative description of pedestrian movement through bottlenecks and in corridors. Measurements of flow and density at bottlenecks will be presented and compared with empirical data. Furthermore the fundamental diagram for the movement in a corridor is reproduced. The results of the proposed model show a good agreement with empirical data

Little lecture on mathematics

Kleine Vor-Lesung zur Mathematik - Prof. Dr. Wolfgang Mackens (Audio-Dateien, mp3) 1. Einleitung: Zum Zusammenhang zwischen Bibliothek und Mathematik (T. Hapke) (knapp 4 min) 2. Übersicht und erster Einstieg: "Mathematik ist mehr als wir in der Schule zu wissen meinen" - 5 Punkte zum Stellenwert der Mathematik - Leben und die Flechten des Bill Bryson (gut 11 min) 3. Sprache als Voraussetzung für Mathematik - "Mathematik ist Weltmuster identifizieren und hardwaremäßig speichern." (gut 11 min) 4. Bibel, Scheibenwelt, Pu der Bär und Mathematik - Bedeutung der Namensgebung und Beispiele für Sprachen und Weltbilder (knapp 20 min) 5. "Die Welt ist nicht das, was wir glauben, das sie ist." Benjamin Whorfs Linguistik und Mathematik - Alice hinter den Spiegeln und der Ungeburtstag - Nach Terry Pratchett ist Bildung "Lügen für Kinder" (gut 14 min) 6. "Warum ist Mathematik aber trotzdem manchmal so richtig richtig?" Descartes' Regeln - Die Menge der Mengen, die sich selbst nicht enthalten - Bibliothek und Wissen: "Google assoziiert mit Mathematik" (knapp 15 min) Diese Veranstaltung am Mittwoch, den 29.10.2008, war ein Beitrag der Technischen Universität Hamburg-Harburg zum Jahr der Mathematik und zur bundesweiten Aktionwoche unter dem Motto "Deutschland liest - Treffpunkt Bibliothek". http://www.jahr-der-mathematik.de/ http://www.treffpunkt-bibliothek.d

A projection method for computing the minimum eigenvalue of a symmetric positive definite Toeplitz matrix

A projection method for computing the minimal eigenvalue of a symmetric and positive definite Toeplitz matrix is presented. It generalizes and accelerates the algorithm considered in [12]. Global and cubic convergence is proved. Randomly generated test problems up to dimension 1024 demonstrate the methods good global behaviour

A Projection Method for Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix

A projection method for computing the minimal eigenvalue of a symmetric and positive definite Toeplitz matrix is presented. It generalizes and accelerates the algorithm considered in [12]. Global and cubic convergence is proved. Randomly generated test problems up to dimension 1024 demonstrate the methods good global behaviour

Computing interior eigenvalues of medium sized generalized symmetric eigenproblems

We present an algorithmic framework to compute approximations to all eigenvalues of a generalized symmetric eigenvalue problem in a prespecified interval together with rigorous error bounds. The method needs the computation of some LU factorizations of the incorporated matrices. The ability to do this excludes the treatment of very large problems