Based on the assumptions of ＂information transfer＂ and ＂information creation＂, this paper educes the multiplied growth mechanism of network information： that the gross quantity of network information （Im） is ab...Based on the assumptions of ＂information transfer＂ and ＂information creation＂, this paper educes the multiplied growth mechanism of network information： that the gross quantity of network information （Im） is about n times as much as the quantity of real network information （Ir）. According to this theoretical model, we give a uniform explanation to all kinds of information growth models in existence, and put forward some proposals, such as ＂forbidding information transfer＂ and ＂building up the central information base＂, to control the repeated information flooding on the network and facilitate the full use of network information.展开更多
In this paper,we describe a numerical technique for the solution of macroscopic traffic flow models on networks of roads.On individual roads,we consider the standard Lighthill-Whitham-Richards model which is discretiz...In this paper,we describe a numerical technique for the solution of macroscopic traffic flow models on networks of roads.On individual roads,we consider the standard Lighthill-Whitham-Richards model which is discretized using the discontinuous Galerkin method along with suitable limiters.To solve traffic flows on networks,we construct suitable numerical fluxes at junctions based on preferences of the drivers.We prove basic properties of the constructed numerical flux and the resulting scheme and present numerical experiments,including a junction with complicated traffic light patterns with multiple phases.Differences with the approach to numerical fluxes at junctions fromČanićet al.(J Sci Comput 63:233-255,2015)are discussed and demonstrated numerically on a simple network.展开更多
基金This work was supported by the National Natural Science Foundation of China （Grant No. 70273032）.
文摘Based on the assumptions of ＂information transfer＂ and ＂information creation＂, this paper educes the multiplied growth mechanism of network information： that the gross quantity of network information （Im） is about n times as much as the quantity of real network information （Ir）. According to this theoretical model, we give a uniform explanation to all kinds of information growth models in existence, and put forward some proposals, such as ＂forbidding information transfer＂ and ＂building up the central information base＂, to control the repeated information flooding on the network and facilitate the full use of network information.
基金The work of L.Vacek is supported by the Charles University,project GA UK No.1114119The work of V.Kučera is supported by the Czech Science Foundation,project No.20-01074S.
文摘In this paper,we describe a numerical technique for the solution of macroscopic traffic flow models on networks of roads.On individual roads,we consider the standard Lighthill-Whitham-Richards model which is discretized using the discontinuous Galerkin method along with suitable limiters.To solve traffic flows on networks,we construct suitable numerical fluxes at junctions based on preferences of the drivers.We prove basic properties of the constructed numerical flux and the resulting scheme and present numerical experiments,including a junction with complicated traffic light patterns with multiple phases.Differences with the approach to numerical fluxes at junctions fromČanićet al.(J Sci Comput 63:233-255,2015)are discussed and demonstrated numerically on a simple network.
