## Report

### Refine

#### Year of publication

#### Document Type

- Report (95) (remove)

#### Language

- English (95) (remove)

#### Keywords

- Ordoliberalism (4)
- Walter Eucken (4)
- Contagion (2)
- European Monetary Union (2)
- Friedrich August von Hayek (2)
- Neoliberalism (2)
- capital regulation (2)
- complexity (2)
- contagion (2)
- forecasting (2)

#### Institute

- Wirtschaftswissenschaften (49)
- Center for Financial Studies (CFS) (36)
- House of Finance (HoF) (26)
- Sustainable Architecture for Finance in Europe (SAFE) (24)
- Extern (7)
- Exzellenzcluster Die Herausbildung normativer Ordnungen (7)
- Informatik (7)
- Institute for Monetary and Financial Stability (IMFS) (4)
- Mathematik (4)
- Universitätsbibliothek (3)

- The real effects of reserve requirements (1998)
- We review arguments for and against reserve requirements and conclude that the main question is whether a distinction between money creation and intermediation can be made. We argue that such a distinction can be made in a money-in-advance economy and show that if the money-in-advance constraint is universally binding then reserve requirements on checkable accounts have no effect on intermediation. We then proceed to show that in a model in which trade is uncertain and sequential, a fractional reserve banking system gives rise to endogenous monetary shocks. These endogenous monetary shocks lead to fluctuations in capacity utilisation and waste. When the money-in-advance constraint is universally binding, a 100% reserve requirement on checkable accounts can eliminate this waste.

- Economic impact of the spread of alien species in Germany : research report 20186211 (2003)
- The European Strategy on Invasive Alien Species T-PWS(2002) 8 mandates intensified research by member nations on invasive species. This research will not be restricted solely to the biology and remediation of invasive species, but will also evaluate their adverse health effects and economic impact. Previous studies of these issues have only been carried out in the Unites States of America, or in a limited, regional manner. Consequently, 20 plant and animal species from various problem areas (species which pose a threat to public health; losses to agriculture, fisheries, and forestry; damage to public roads and waterways; costs associated with the protection of native species threatened by non-native species as mandated by Recommendation 77 of the Bern Convention were assessed in Germany nation-wide. The accruing costs were sorted into 3 categories: a) direct economic losses, such as those caused by destructive pest species; b) ecological costs, in the form of extra care and protection of native taxa, biotopes, or ecosystems threatened by invasive species; c) costs of measures to combat invasive species. Because of the nature of available data, as well as the different biology and ecology of the invasive species, each had to be treated individually, and the associated costs vary greatly from species to species. Moreover, not all of the species investigated cause economic losses. Accordingly, a nuanced approach to alien species is essential. Cost assessment of losses deriving from ecological damage was only possible in a few cases. Ongoing, multi-year studies incorporating cost/benefit analysis will be necessary to resolve remaining issues.

- SmartBlaster - a realtime multiplayer game for mobile ad-hoc networks (2004)
- Multiplayer games have become very popular in the PC market. Almost none of the current games are shipped without some support for multiplayer gaming. At the same time mobile devices are becoming more powerful and popularity of games on these platforms increases. However, there are almost no games that support multiplayer gaming despite the multiple options of these devices to connect with each other and build mobile ad hoc networks. Reasons for this lack of multiplayer support are the high diversity of mobile devices as well as the different protocols and their properties that these devices support. With “SmartBlaster” we developed a multiplayer game for several different platforms that is using several different channels (Bluetooth, IrDa, 802.11 and other networks supporting TCP/IP) to communicate between them.

- Econometric analysis of financial trade processes by discrete mixture duration models (2004)
- We propose a new framework for modelling the time dependence in duration processes being in force on financial markets. The pioneering ACD model introduced by Engle and Russell (1998) will be extended in a manner that the duration process will be accompanied by an unobservable stochastic process. The Discrete Mixture ACD framework provides us with a general methodology which puts the idea into practice. It is established by introducing a discrete-valued latent regime variable which can be justified in the light of recent market microstructure theories. The empirical application demonstrates its ability to capture specific characteristics of intraday transaction durations while alternative approaches fail. JEL classification: C41, C22, C25, C51, G14.

- Energy Propagation through the TESLA Channel: Measurements with Two Waveguides Modes (1996)
- A new method for the determination of S-matrices of devices in multimoded waveguides and first experimental experiences are presented. The theoretical foundations are given. The scattering matrix of a TESLA copper cavity at a frequency above the cut-off of the second waveguide mode has been measured.

- Factoring via strong lattice reduction algorithm : technical report (1997)
- We address to the problem to factor a large composite number by lattice reduction algorithms. Schnorr has shown that under a reasonable number theoretic assumptions this problem can be reduced to a simultaneous diophantine approximation problem. The latter in turn can be solved by finding sufficiently many l_1--short vectors in a suitably defined lattice. Using lattice basis reduction algorithms Schnorr and Euchner applied Schnorrs reduction technique to 40--bit long integers. Their implementation needed several hours to compute a 5% fraction of the solution, i.e., 6 out of 125 congruences which are necessary to factorize the composite. In this report we describe a more efficient implementation using stronger lattice basis reduction techniques incorporating ideas of Schnorr, Hoerner and Ritter. For 60--bit long integers our algorithm yields a complete factorization in less than 3 hours.

- Black Box Cryptanalysis of Hash Networks based on Multipermutations (1994)
- Black box cryptanalysis applies to hash algorithms consisting of many small boxes, connected by a known graph structure, so that the boxes can be evaluated forward and backwards by given oracles. We study attacks that work for any choice of the black boxes, i.e. we scrutinize the given graph structure. For example we analyze the graph of the fast Fourier transform (FFT). We present optimal black box inversions of FFT-compression functions and black box constructions of collisions. This determines the minimal depth of FFT-compression networks for collision-resistant hashing. We propose the concept of multipermutation, which is a pair of orthogonal latin squares, as a new cryptographic primitive that generalizes the boxes of the FFT. Our examples of multipermutations are based on the operations circular rotation, bitwise xor, addition and multiplication.

- A Stable Integer Relation Algorithm (1994)
- We study the following problem: given x element Rn either find a short integer relation m element Zn, so that =0 holds for the inner product <.,.>, or prove that no short integer relation exists for x. Hastad, Just Lagarias and Schnorr (1989) give a polynomial time algorithm for the problem. We present a stable variation of the HJLS--algorithm that preserves lower bounds on lambda(x) for infinitesimal changes of x. Given x \in {\RR}^n and \alpha \in \NN this algorithm finds a nearby point x' and a short integer relation m for x'. The nearby point x' is 'good' in the sense that no very short relation exists for points \bar{x} within half the x'--distance from x. On the other hand if x'=x then m is, up to a factor 2^{n/2}, a shortest integer relation for \mbox{x.} Our algorithm uses, for arbitrary real input x, at most \mbox{O(n^4(n+\log \alpha))} many arithmetical operations on real numbers. If x is rational the algorithm operates on integers having at most \mbox{O(n^5+n^3 (\log \alpha)^2 + \log (\|q x\|^2))} many bits where q is the common denominator for x.

- Algebraic values of Schwarz triangle functions (2005)
- We consider Schwarz maps for triangles whose angles are rather general rational multiples of pi. Under which conditions can they have algebraic values at algebraic arguments? The answer is based mainly on considerations of complex multiplication of certain Prym varieties in Jacobians of hypergeometric curves. The paper can serve as an introduction to transcendence techniques for hypergeometric functions, but contains also new results and examples.