Christian Gawron

• Professor
• Professor at South Westphalia University of Applied Sciences

Köln, University, Diss., 1999.

In this paper we describe the methods we used for our submissions to the GermEval 2021 shared task on the identification of toxic, engaging , and fact-claiming comments. For all three subtasks we fine-tuned freely available transformer-based models from the Hugging-face model hub. We evaluated the performance of various pre-trained models after fin...

In this paper we describe the methods we used for our submissions to the GermEval 2021 shared task on the identification of toxic, engaging, and fact-claiming comments. For all three subtasks we fine-tuned freely available transformer-based models from the Huggingface model hub. We evaluated the performance of various pre-trained models after fine-...

In this contribution we summarize work concerned with the simulation of large road networks using a cellular automaton (CA)-model

We discuss topics related to the notion of shortest paths in large street networks. In the first part, we discuss the dynamic traffic assignment problem and describe an algorithm designed to determine user equilibria in simulation-based traffic models. The proposed algorithm is able to find in a reasonable amount of time equilibria in problems that...

In order to simulate the transportation system of a large region dynamically, three things have to be known and modelled: who wants to go where at what departure time (destination choice), which route to the destination is selected (route choice), and finally how the locomotion along this route is performed in time (travelling). This article deals...

It is a well known fact that metastable states of very high throughput and hysteresis effects exist in traffic flow, which the simple cellular automaton model of traffic flow and its continuous generalization fail to reproduce. It is shown that the model can be generalized to give a one-parametric family of models, a part of which reproduces the me...

We present an iterative algorithm to determine the dynamic user equilibrium for link costs given by a traffic simulation model. Each driver's route choice is modelled by a discrete probability distribution which is used to select a route in the simulation. After each simulation run, the probability distribution is adapted to minimize the perceived...

A generalized version of the Nagel-Schreckenberg model of traffic flow is presented that allows for continuous values of the velocities and spatial coordinates. It is shown that this generalization reveals structures of the dynamics that are masked by the discreteness of the original model and thus helps to clarify the physical interpretation of th...

. We present an iterative algorithm to determine the dynamic user equilibrium for link costs given by a traffic simulation model. Each driver's route choice is modelled by a discrete probability distribution which is used to select a route in the simulation. After each simulation run, the probability distribution is adapted to minimize the perceive...

An iterative algorithm to determine the dynamic user equilibrium with respect to Link costs defined by a traffic simulation model is presented. Each driver's route choice is modeled by a discrete probability distribution which is used to select a route in the simulation. After each simulation run, the probability distribution is adapted to minimize...