918 resultados para Stormwater pollutant processes
Resumo:
Quenching process, TRIP, J2-plasticity theory, phase transition, distortion
Resumo:
Passive trip system, reactor trip, runaway reaction, batch reactor
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Diss., 2009
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2009
Resumo:
Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2012
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2012
Resumo:
Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2013
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2012
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2014
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2014
Resumo:
Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2015
Resumo:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Naturwissenschaften, Univ., Dissertation, 2015
Resumo:
We address the question of how a third-party payer (e.g. an insurer) decides what providers to contract with. Three different mechanisms are studied and their properties compared. A first mechanism consists in the third-party payer setting up a bargaining procedure with both providers jointly and simultaneously. A second mechanism envisages the outcome of the same simultaneous bargaining but independently with every provider. Finally, the last mechanism is of different nature. It is the so-called "any willing provider" where the third-party payer announces a contract and every provider freely decides to sign it or not. The main finding is that the decision of the third-party payer depends on the surplus to be shared. When it is relatively high the third-party payer prefers the any willing provider system. When, on the contrary, the surplus is relatively low, the third-party payer will select one of the other two systems accor ing to how bargaining power is distributed.
Resumo:
The main purpose of this work is to give a survey of main monotonicity properties of queueing processes based on the coupling method. The literature on this topic is quite extensive, and we do not consider all aspects of this topic. Our more concrete goal is to select the most interesting basic monotonicity results and give simple and elegant proofs. Also we give a few new (or revised) proofs of a few important monotonicity properties for the queue-size and workload processes both in single-server and multi- server systems. The paper is organized as follows. In Section 1, the basic notions and results on coupling method are given. Section 2 contains known coupling results for renewal processes with focus on construction of synchronized renewal instants for a superposition of independent renewal processes. In Section 3, we present basic monotonicity results for the queue-size and workload processes. We consider both discrete-and continuous-time queueing systems with single and multi servers. Less known results on monotonicity of queueing processes with dependent service times and interarrival times are also presented. Section 4 is devoted to monotonicity of general Jackson-type queueing networks with Markovian routing. This section is based on the notable paper [17]. Finally, Section 5 contains elements of stability analysis of regenerative queues and networks, where coupling and monotonicity results play a crucial role to establish minimal suficient stability conditions. Besides, we present some new monotonicity results for tandem networks.