In this paper we present a general derivation of kinetic models for traffic flows including different kind of interaction rules. We show that most kinetic models previously derived can be cast in the actual formulation. The development of Monte Carlo methods for direct simulation of the kinetic models is considered as an initial step towards realistic and efficient computations of traffic pheno...

Let M be a triangulated, orientable 2-manifold of genus g without boundary, and let h be a height function over M that is linear within each triangle. We present a kinetic data structure (KDS) for maintaining the Reeb graph R of h as the heights of M’s vertices vary continuously with time. Assuming the heights of two vertices of M become equal only O(1) times, the KDS processes O((κ + g)n polyl...

242 words, Introduction647 words, Discussion1499 words. 17 Disclosures / Conflict of Interests 18 The authors declare that no competing interests exist. BR, JG, and KMC performed 19 experiments and data analysis, and BR and KMC wrote the paper. 20

We review the state-of-the-art in the modelling of the aggregation and collective behavior of interacting agents of similar size and body type, typically called swarming. Starting with individual-based models based on “particle”-like assumptions, we connect to hydrodynamic/macroscopic descriptions of collective motion via kinetic theory. We emphasize the role of the kinetic viewpoint in the mod...

The Web allows self-regulated learning through interaction with large amounts of learning resources. While enjoying the flexibility of learning, learners may suffer from cognitive overload and conceptual and navigational disorientation when faced with various information resources under disparate topics and complex knowledge structures. This study proposed a knowledge visualization (KV) approac...

Motion in depth and/or zooming cause defocus blur. We show how the defocus blur in an image can be recovered simultaneously with affine motion. We introduce the theory, develop a solution method and demonstrate the validity of the theory and the solution by conducting experiments with real scenery.

The most natural kinetic data structure for maintaining the maximum of a collection of continuously changing numbers is the kinetic heap. Basch, Guibas, and Ramkumar proved that the maximum number of events processed by a kinetic heap with n numbers changing as linear functions of time is O(n log n) and Ω(n log n). We prove that this number is actually Θ(n log n). In the kinetic heap, a linear ...