990 resultados para transfer problem
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2010
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2013
Resumo:
Magdeburg, Univ., Fak. für Humanwiss., Diss., 2013
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Diss., 2015
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2015
Resumo:
Since the specific heat transfer coefficient (UA) and the volumetric mass transfer coefficient (kLa) play an important role for the design of biotechnological processes, different techniques were developed in the past for the determination of these parameters. However, these approaches often use imprecise dynamic methods for the description of stationary processes and are limited towards scale and geometry of the bioreactor. Therefore, the aim of this thesis was to develop a new method, which overcomes these restrictions. This new approach is based on a permanent production of heat and oxygen by the constant decomposition of hydrogen peroxide in continuous mode. Since the degradation of H2O2 at standard conditions only takes place by the support of a catalyst, different candidates were investigated for their potential (regarding safety issues and reaction kinetic). Manganese-(IV)-oxide was found to be suitable. To compensate the inactivation of MnO2, a continuous process with repeated feeds of fresh MnO2 was established. Subsequently, a scale-up was successfully carried out from 100 mL to a 5 litre glass bioreactor (UniVessel®)To show the applicability of this new method for the characterisation of bioreactors, it was compared with common approaches. With the newly established technique as well as with a conventional procedure, which is based on an electrical heat source, specific heat transfer coefficients were measured in the range of 17.1 – 24.8 W/K for power inputs of about 50 – 70 W/L. However, a first proof of concept regarding the mass transfer showed no constant kLa for different dilution rates up to 0.04 h-1.Based on this, consecutive studies concerning the mass transfer should be made with higher volume flows, due to more even inflow rates. In addition, further experiments are advisable, to analyse the heat transfer in single-use bioreactors and in larger common systems.
Resumo:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Masterarbeit, 2016
Resumo:
It is known that, in a locally presentable category, localization exists with respect to every set of morphisms, while the statement that localization with respect to every (possibly proper) class of morphisms exists in locally presentable categories is equivalent to a large-cardinal axiom from set theory. One proves similarly, on one hand, that homotopy localization exists with respect to sets of maps in every cofibrantly generated, left proper, simplicial model category M whose underlying category is locally presentable. On the other hand, as we show in this article, the existence of localization with respect to possibly proper classes of maps in a model category M satisfying the above assumptions is implied by a large-cardinal axiom called Vopënka's principle, although we do not know if the reverse implication holds. We also show that, under the same assumptions on M, every endofunctor of M that is idempotent up to homotopy is equivalent to localization with respect to some class S of maps, and if Vopënka's principle holds then S can be chosen to be a set. There are examples showing that the latter need not be true if M is not cofibrantly generated. The above assumptions on M are satisfied by simplicial sets and symmetric spectra over simplicial sets, among many other model categories.
Resumo:
Using the continuation method we prove that the circular and the elliptic symmetric periodic orbits of the planar rotating Kepler problem can be continued into periodic orbits of the planar collision restricted 3–body problem. Additionally, we also continue to this restricted problem the so called “comets orbits”.
Resumo:
We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.
Resumo:
The paper is devoted to the study of a type of differential systems which appear usually in the study of some Hamiltonian systems with 2 degrees of freedom. We prove the existence of infinitely many periodic orbits on each negative energy level. All these periodic orbits pass near the total collision. Finally we apply these results to study the existence of periodic orbits in the charged collinear 3–body problem.
Resumo:
The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a strictly preferred share. We characterize all bribe-proof rules as the class of efficient, strategy-proof, and weak replacement monotonic rules. In addition, we identify the functional form of all bribe-proof and tops-only rules.
Resumo:
The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest domain, for all possible values of M, admitting a rule (the extended uniform rule) satisfying strategy-proofness, efficiency and symmetry. We identify, for each M and n, a maximal domain of preferences under which the extended uniform rule also satisfies the properties of strategy-proofness, efficiency, continuity, and "tops-onlyness". These domains (called weakly single-plateaued) are strictly larger than the set of single-plateaued preferences. However, their intersection, when M varies from zero to infinity, coincides with the set of single-plateaued preferences.