No abstract uploaded!

Degree theory has been developed as a tool for checking the solution existence of nonlinear equations. In his classic paper published in 1983, Browder developed a degree theory for mappings of monotone type f+ T, where f is a mapping of class (S)+ from a bounded open set in a reflexive Banach space X into its dual X, and T is a maximal monotone mapping from X into X. This breakthrough paved the way for many applications of degree theoretic techniques to several large classes of nonlinear partial differential equations. In this paper we continue to develop the results of Browder on the degree theory for mappings of monotone type f+ T. By enlarging the class of maximal monotone mappings and pseudo-monotone homotopies we obtain some new results of the degree theory for such mappings.

The initial decay rate of a mixed state is discussed; is shown to be zero for finite energy states. In the previous paper [1] we investigated a general scheme for description of unstable systems. One of our results concerned the initial decay rate. Generalizing the earlier results of Horwitz and Marchand (see [2] and other references contained in [1]) we proved there, that the initial decay rate of any pure state of the unstable system equals to zero, if this state is so called finite energy state. Here we shall be interested in the same problem, assuming now the state of the decaying system to be in general mixed. Such assumption seems to be reasonable: firstly, from the point of view of an experiment it is too restrictive to treat only pure states of unstable systems. In particular, mixed states are generally considered in the recent studies about the influence of measuring devices on the time evolution of the unstable system [3

Let A be an operator ideal on LCSs. A continuous seminorm p of a LCS X is said to be Acontinuous if Qp Ainj (X, Xp), where Xp is the completion of the normed space Xp= X/p 1 (0) and Qp is the canonical map. p is said to be a Groth (A)seminorm if there is a continuous seminorm q of X such that p q and the canonical map Qpq: Xq Xp belongs to A (Xq, Xp). It is well-known that when A is the ideal of absolutely summing (resp. precompact, weakly compact) operators, a LCS X is a nuclear (resp. Schwartz, infraSchwartz) space if and only if every continuous seminorm p of X is Acontinuous if and only if every continuous seminorm p of X is a Groth (A)seminorm. In this paper, we extend this equivalence to arbitrary operator ideals A and discuss several aspects of these constructions which are initiated by A. Grothendieck and D. Randkte, respectively. A bornological version of the theory is obtained, too.

This paper proposes a two-level continuum transportation system approach to modeling a dynamic taxi traffic assignment (DTTA) problem in a dense network with real-time traffic information provision and three types of vehicles, including private cars, occupied taxis, and vacant taxis. The proposed approach treats the dense network as a continuum in the first level, in which private car and occupied taxi drivers are free to choose their paths in a two-dimensional continuous space. The proposed approach also divides the modeling region into many identical squares to form a cell-based network in the second level, in which the cells are classified into two categories: target cell with an acceptable expected rate of return (EROR) to vacant taxi drivers and non-target cell with an unacceptable EROR. The EROR associated with a cell is the ratio of the cumulative expected profit of a taxi driver who successfully picks up a customer during the customer search that starts from that cell to the sum of expected search time for this customer and expected occupied travel time to serve this customer. Based on the cell-based network, we develop a cell-based intervening opportunity model to capture the fact that vacant taxi drivers can meet a customer on the way to their destination zones and estimate the EROR. Each vacant taxi driver has a mixed strategy to determine his/her customer-search direction according to the EROR: Each vacant taxi driver in a target cell selects its neighbor cells with maximum EROR, and each vacant taxi driver in a non-target cell selects the travel time-based shortest path to his/her target cell. Meanwhile, each private car driver chooses the path that minimizes his/her own generalized travel cost, and each occupied taxi driver chooses the path that minimizes his/her customer's generalized in-vehicle travel cost. In our model, traffic density in the system is governed by the conservation law (CL), and the flow directions of different vehicles are determined by the path-choice strategies of their drivers, which are captured by Hamilton–Jacobi (HJ) equations. Both the proposed CL and HJ equations can be solved by the Lax–Friedrichs scheme, which forms the backbone of the developed solution algorithm. Finally, numerical examples and a case study are used to demonstrate the properties of the model, the performance of the solution algorithm, and the value of using our methodology for estimating network performance.