Refine
Year of publication
Document Type
- Report (471) (remove)
Language
- English (471) (remove)
Has Fulltext
- yes (471) (remove)
Is part of the Bibliography
- no (471)
Keywords
- islamic state (13)
- terrorism (13)
- IS (9)
- Egypt (8)
- Syria (8)
- islamism (7)
- Europe (6)
- Germany (6)
- Goethe, Johann Wolfgang von (6)
- USA (6)
Institute
- Gesellschaftswissenschaften (212)
- Exzellenzcluster Die Herausbildung normativer Ordnungen (112)
- Wirtschaftswissenschaften (96)
- Center for Financial Studies (CFS) (42)
- House of Finance (HoF) (30)
- Sustainable Architecture for Finance in Europe (SAFE) (30)
- Informatik (20)
- Mathematik (16)
- Extern (8)
- Physik (7)
This paper surveys the growth and various phases of and influences on the concept of democracy in the Islamic political thought of the last two centuries. Among the thinkers covered in the survey are Rifa'a Tahtawi (1801-73), Khairuddin at-Tunis (1810-99), Jamal ad-Din al-Afghani (1838-97), Muhammad Abduh (1849-1905), Abdurrahman al-Kawakibi (1849-1903), Rashid Rida (1865-1935), Hasan al-Banna (1904-49), Ali Abd Ar-Raziq (1888-1966), Sayyid Qutb (1906-66), Sa'id Hawwa, and Malik Bennabi (1905-73). Reference is made to the influence of Sayyid Mawdudi (1903-79), on the thought of Sayyid Qutb. The paper traces also the bearing of Bennabi's thought on Rachid Ghannouchi and on the Islamic movements of our times.
In Belhare (Sino-Tibetan, Nepal), consonant prothesis at morpheme boundaries and deletion of stem "augments" is found if either metrical or morphological parsing would violate the bimoraic trochee pattern that underlies the stress system of the language. This finding corroborates Dresher & Lahiri’s (1991) "Principle of Metrical Coherence" and provides new evidence for the cross-linguistic applicability of Crowhurst’s (1994) "Tautomorphemic Foot" constraint. The data also support a view of the Prosodic Hierarchy as weakly layered, allowing consonants to be directly dominated by the foot or word node if they are prothetic and do not therefore need feature licensing within the syllable canon.
Central wage bargaining and local wage flexibility : evidence from the entire wage distribution
(1998)
We argue that in labor markets with central wage bargaining wage flexibility varies systematically across the wage distribution: local wage flexibility is more relevant for the upper part of the wage distribution, and flexibility of wages negotiated under central wage bargaining affects the lower part of the wage distribution. Using a random sample of German social-security accounts, we estimate wage flexibility across the wage distribution by means of quantile regressions. The results support our hypothesis, as employees with low wages have significantly lower local wage flexibility than high wage employees. This effect is particularly relevant for the lower educational groups. On the other hand, employees with low wages tend to have a higher wage flexibility with respect to national unemployment.
To preserve the required beam quality in an e+/e- collider it is necessary to have a very precise beam position control at each accelerating cavity. An elegant method to avoid additional length and beam disturbance is the usage of signals from existing HOM-dampers. The magnitude of the displacement is derived from the amplitude of a dipole mode whereas the sign follows from the phase comparison of a dipole and a monopole HOM. To check the performance of the system, a measurement setup has been built with an antenna which can be moved with micrometer resolution to simulate the beam. Furthermore we have developed a signal processing to determine the absolute beam displacement. Measurements on the HOM-damper cell can be done in the frequency domain using a network analyser. Final measurements with the nonlinear time dependent signal processing circuit has to be done with very short electric pulses simulating electron bunches. Thus, we have designed a sub nanosecond pulse generator using a clipping line and the step recovery effect of a diode. The measurement can be done with a resolution of about 10 micrometers. Measurements and numerical calculations concerning the monitor design and the pulse generator are presented.
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.
Given a real vector alpha =(alpha1 ; : : : ; alpha d ) and a real number E > 0 a good Diophantine approximation to alpha is a number Q such that IIQ alpha mod Zk1 ", where k \Delta k1 denotes the 1-norm kxk1 := max 1id jx i j for x = (x1 ; : : : ; xd ). Lagarias [12] proved the NP-completeness of the corresponding decision problem, i.e., given a vector ff 2 Q d , a rational number " ? 0 and a number N 2 N+ , decide whether there exists a number Q with 1 Q N and kQff mod Zk1 ". We prove that, unless ...
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.
A rather disillusioned observation was recently made during a pan-Africa conference: Africa women consider new information and communication technologies as "futuristic" rather than a tool for development to be used today. If initiatives are not taken now to thwart this attitude, activities by women in Africa to promote sustainable development that also benefit them will take event longer. This will be especially true in regions on the continent where English is not the common language.
Korrektur zu: C.P. Schnorr: Security of 2t-Root Identification and Signatures, Proceedings CRYPTO'96, Springer LNCS 1109, (1996), pp. 143-156 page 148, section 3, line 5 of the proof of Theorem 3. Die Korrektur wurde präsentiert als: "Factoring N via proper 2 t-Roots of 1 mod N" at Eurocrypt '97 rump session.
We study the approximability of the following NP-complete (in their feasibility recognition forms) number theoretic optimization problems: 1. Given n numbers a1 ; : : : ; an 2 Z, find a minimum gcd set for a1 ; : : : ; an , i.e., a subset S fa1 ; : : : ; ang with minimum cardinality satisfying gcd(S) = gcd(a1 ; : : : ; an ). 2. Given n numbers a1 ; : : : ; an 2 Z, find a 1-minimum gcd multiplier for a1 ; : : : ; an , i.e., a vector x 2 Z n with minimum max 1in jx i j satisfying P n...
s.a. Deutsche Fassung: Rechtshistorisches Journal 15, 1996, 255-290 und in: Eric Schwarz (Hg.) La théorie des systèmes: une approche inter- et transdisciplinaire. Bösch, Sion 1996, 101-119. Italienische Fassung: La Bukowina globale: il pluralismo giuridico nella società mondiale. Sociologic a politiche sociali 2, 1999, 49-80. Portugiesische Fassung: Bukowina global sobre a emergência de um pluralismo jurídico transnacional. Impulso: Direito e Globalização 14, 2003. Georgische Fassung: Globaluri bukovina: samarTlebrivi pluralizmi msoflio sazogadoebaSi. Journal of the Institute of State and Law of the Georgian Academy of Sciences 2005 (im Erscheinen)
Wunschkonzert
(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.
We generalize the concept of block reduction for lattice bases from l2-norm to arbitrary norms. This extends the results of Schnorr. We give algorithms for block reduction and apply the resulting enumeration concept to solve subset sum problems. The deterministic algorithm solves all subset sum problems. For up to 66 weights it needs in average less then two hours on a HP 715/50 under HP-UX 9.05.
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.