Universitätspublikationen
634 search hits
-
Mehr Markt für mehr soziale Sicherheit : Starökonom Robert J. Shiller stellt neue Ideen in Frankfurt vor
(2003)
-
Ulrike Lexis
- Die neue Finanzordnung / Robert J. Shiller. - Frankfurt : Campus Verlag, 2003 450 S., ISBN 3-593-37327-0. 34,90 Euro.
-
Skandale und das Schattenreich der Inoffizialität : der Soziologe Karl Otto Hondrich zu Phänomenen der Gegenwartsgesellschaft
(2003)
-
Gerhard Preyer
- Rezensionen zu: Enthüllung und Entrüstung / Karl Otto Hondrich. - Frankfurt am Main : Suhrkamp Verl., 2002. - 166 S., ISBN 3-518-12270-3, 9 Euro. Der Neue Mensch / Karl Otto Hondrich. - Frankfurt am Main : Suhrkamp Verlag, 2001. - 222 S., ISBN 3-518-1227-8, 10 Euro. Wieder Krieg / Karl Otto Hondrich. - Frankfurt am Main : Suhrkamp Verlag, 2002. - 192 S., ISBN 3-518-12297-5, 9 Euro.
-
"Hegemoniale Revolution" : Harald Müller über die letzte unangefochtene Supermacht und die Weltordnung
(2003)
-
Claudia Baumgart
- Amerika schlägt zurück : die Weltordnung nach dem 11. September / Harald Müller. Frankfurt : Fischer Taschenbuch Verl., 2003. - 288 S., ISBN 3-596-15774-9, 12,90 Euro.
-
Wege durch den Wagner-Dschungel
(2003)
-
Ulrike Kienzle
- Rezensionen zu: Richard Wagners politische Theologie : Kunst zwischen Revolution und Religion / Peter Hofmann. - Paderborn : Verl. Ferdinand Schöningh, 2003. - 320 S., ISBN 3-506-73929-8, 39,80 Euro Richard Wagner : Ahasvers Wandlungen / Dieter Borchmeyer. - Frankfurt am Main [u.a.] : Insel Verl., 2002. - 647 S., ISBN 3-458-17135-5, 44,90 Euro.
-
Noch weit vom Mainstream entfernt : Geschlechterperspektiven im Verbraucherschutz
(2003)
-
Irmgard Schultz
- Geschlechtliche Gleichstellung ist eine Querschnittsaufgabe für alle Politikfelder, auch für Verbraucherpolitik. Aber warum sollten Geschlechterperspektiven im Verbraucherschutz berücksichtigt werden? In welcher Hinsicht sind sie relevant für eine geteilte Verantwortung?
-
Mean anisotropy of homogeneous Gaussian random fields and anisotropic norms of linear translation-invariant operators on multidimensional integer lattices
(2003)
-
Phil Diamond
Peter E. Kloeden
Igor Vladimirov
- Sensitivity of output of a linear operator to its input can be quantified in various ways. In Control Theory, the input is usually interpreted as disturbance and the output is to be minimized in some sense. In stochastic worst-case design settings, the disturbance is considered random with imprecisely known probability distribution. The prior set of probability measures can be chosen so as to quantify how far the disturbance deviates from the white-noise hypothesis of Linear Quadratic Gaussian control. Such deviation can be measured by the minimal Kullback-Leibler informational divergence from the Gaussian distributions with zero mean and scalar covariance matrices. The resulting anisotropy functional is defined for finite power random vectors. Originally, anisotropy was introduced for directionally generic random vectors as the relative entropy of the normalized vector with respect to the uniform distribution on the unit sphere. The associated a-anisotropic norm of a matrix is then its maximum root mean square or average energy gain with respect to finite power or directionally generic inputs whose anisotropy is bounded above by a >= 0. We give a systematic comparison of the anisotropy functionals and the associated norms. These are considered for unboundedly growing fragments of homogeneous Gaussian random fields on multidimensional integer lattice to yield mean anisotropy. Correspondingly, the anisotropic norms of finite matrices are extended to bounded linear translation invariant operators over such fields.
-
Jugendliche - AdressatInnen von Coaching? : Ansatzpunkte für Coachingprozesse in der beruflichen Qualifizierung benachteiligter Jugendlicher im Übergang Schule/Beruf
(2003)
-
Alexandra Roth
Marco Vorberger
- In der Arbeit werden neue Aspekte beleuchtet, die das Beratungsinstrument Coaching im Übergang Schule/Beruf für benachteiligte Jugendliche eröffnen kann und wie Implementierungsmöglichkeiten aussehen können.
-
On one-way cellular automata with a fixed number of cells
(2003)
-
Andreas Malcher
- We investigate a restricted one-way cellular automaton (OCA) model where the number of cells is bounded by a constant number k, so-called kC-OCAs. In contrast to the general model, the generative capacity of the restricted model is reduced to the set of regular languages. A kC-OCA can be algorithmically converted to a deterministic finite automaton (DFA). The blow-up in the number of states is bounded by a polynomial of degree k. We can exhibit a family of unary languages which shows that this upper bound is tight in order of magnitude. We then study upper and lower bounds for the trade-off when converting DFAs to kC-OCAs. We show that there are regular languages where the use of kC-OCAs cannot reduce the number of states when compared to DFAs. We then investigate trade-offs between kC-OCAs with different numbers of cells and finally treat the problem of minimizing a given kC-OCA.
-
On two-way communication in cellular automata with a fixed number of cells
(2003)
-
Andreas Malcher
- The effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on their size of description is studied. kC-OCAs are a parallel model for the regular languages that consists of an array of k identical deterministic finite automata (DFAs), called cells, operating in parallel. Each cell gets information from its right neighbor only. In this paper, two models with different amounts of two-way communication are investigated. Both models always achieve quadratic savings when compared to DFAs. When compared to a one-way cellular model, the result is that minimum two-way communication can achieve at most quadratic savings whereas maximum two-way communication may provide savings bounded by a polynomial of degree k.
-
On the descriptional complexity of iterative arrays
(2003)
-
Andreas Malcher
- The descriptional complexity of iterative arrays (lAs) is studied. Iterative arrays are a parallel computational model with a sequential processing of the input. It is shown that lAs when compared to deterministic finite automata or pushdown automata may provide savings in size which are not bounded by any recursive function, so-called non-recursive trade-offs. Additional non-recursive trade-offs are proven to exist between lAs working in linear time and lAs working in real time. Furthermore, the descriptional complexity of lAs is compared with cellular automata (CAs) and non-recursive trade-offs are proven between two restricted classes. Finally, it is shown that many decidability questions for lAs are undecidable and not semidecidable.
