Under the shade of escalating violence and fundamentalism, our epoch's diffused aura of liberalism supposedly tolerates difference, by exorcising the evil phantasms of totalitarianism, in favour of a liberal and humane post-modem order. Consequently, behind contemporary versions of evil, one demonises modem 'fascists', 'totalitarian threats', and 'Hitlers'. As if not obscure enough, fascist evil has been equivocally linked with perversion. Considering this link a tenebrous enigma, my thesis suggests that psychoanalysis can successfully elucidate its problematic and feeble basis, by reappraising previous narratives from a number of different discourses that inscribe the liaison between fascism and perversion in their representational stage. In a first approach, the present study dissects texts as heterogeneous, as film, social theory, political philosophy, and psychoanalysis. This is to show that, despite the divergent speculative angle that each discourse espouses, perversion is a common exegetic thread, intertextually sewing their narratives. The objective of my criticism that goes through psychoanalysis, without, however, exempting it from this criticism, is to reveal that both fascism and perversion implicate the non-symbolisable kernel in politics, which becomes the source of their mystification. My thesis argues that the fascist does not take the same discursive position, as the pervert does, regarding this symbolic gap. The first is interested in domination, drawn from the superiority of his ideology's master signifier, whereas the latter is interested in excavating the emptiness of any master signifier and in constantly provoking prefabricated knowledge, similarly to the hysteric. Apart from the level of discourse, on the ethical level, I disengage the view that sees Sade and the Nazi officer, as emblematic figures of a Kantian ethical gesture. Considering the imaginary hypostasis of their ethical performance, I argue that personal interests, fantasies and desires, determine the austerity of their ethical duty. Yet, the fantasies of Sade and Nazism are incongruent, insomuch as they are organised by antithetical ideals. Finally, I develop a new rhetoric, de-pathologised and de-ideologised, regarding the structure of the so-called pervert, introducing new vocabularies and directions for psychoanalytic research that further distance the pervert, or whom I call the extra-ordinary subject, from fascist politics and, instead, expose his diachronic "fascist" isolation from the social edifice. This reveals the fruitful alternatives that can stem from a 'return to Freud cum Lacan, which supports a flexible on-going reformulation of psychoanalytic knowledge.

The residue number system (RNS) is an integer number representation system, which is capable of supporting parallel, high-speed arithmetic. This system also offers some useful properties for error detection, error correction and fault tolerance. It has numerous applications in computation-intensive digital signal processing (DSP) operations, like digital filtering, convolution, correlation, Discrete Fourier Transform, Fast Fourier Transform, direct digital frequency synthesis, etc. The residue to binary conversion is based on Chinese Remainder Theorem (CRT) and Mixed Radix Conversion (MRC). However, the CRT requires a slow large modulo operation while the MRC requires finding the mixed radix digits which is a slow process. The new Chinese Remainder Theorems (CRT I, CRT II and CRT III) make the computations faster and efficient without any extra overheads. But, New CRTs are hardware intensive as they require many inverse modulus operators, modulus operators, multipliers and dividers. Dividers and inverse modulus operators in turn needs many half and full adders and subtractors. So, some kind of optimization is necessary to implement these theorems practically. In this research, for the optimization, new both co-prime and non co-prime multi modulus sets are proposed that simplify the new Chinese Remainder theorems by eliminating the huge summations, inverse modulo operators, and dividers. Furthermore, the proposed hardware optimization removes the multiplication terms in the theorems, which further simplifies the implementation.

The Riemann zeta function, Ϛ(s) with complex argument s, is a widely used special function in mathematics. This thesis is motivated by the need of a cost reducing algorithm for the computation of Ϛ (s) using its Euler-Maclaurin series. The difficulty lies in finding small upper bounds, call them n and k, for the two sums in the Euler-Maclaurin series of Ϛ (s) which will compute Ϛ (s) to within any given accuracy for any complex argument s, and provide optimal computational cost in the use of the Euler-Maclaurin series. This work is based on Backlund’s remainder estimate for the Euler-Maclaurin remain- der, since it provides a close enough relationship between n, k, s, and е. We assumed that the cost of computing the Bernoulli numbers, which appear in the series, is fixed, and briefly discuss how this may influence high precision calculation. Based on our study of the behavior of Backlund’s remainder estimate, we define the ‘best’ pair (n, k), and present a reliable method of computing the best pair. Furthermore, based on a compu- tational analysis, we conjecture that there is a relationship between n and k which does not depend on s. We present two algorithms, one based on our method and the other on the conjecture, and compare their costs of finding n and k as well as computing the Euler-Maclaurin series with an algorithm presented by Cohen and Olivier. We conclude that our algorithm reduces the cost of computing Ϛ(s) drastically, and that good numerical techniques need to be applied to our method and conjecture for finding n and k in order to keep this computational cost low as well.

Thesis (M.S.)--University of Wisconsin--Madison, 1981. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves).

No description available.

The Riemann zeta function, Ϛ(s) with complex argument s, is a widely used special function in mathematics. This thesis is motivated by the need of a cost reducing algorithm for the computation of Ϛ (s) using its Euler-Maclaurin series. The difficulty lies in finding small upper bounds, call them n and k, for the two sums in the Euler-Maclaurin series of Ϛ (s) which will compute Ϛ (s) to within any given accuracy for any complex argument s, and provide optimal computational cost in the use of the Euler-Maclaurin series. This work is based on Backlund’s remainder estimate for the Euler-Maclaurin remain- der, since it provides a close enough relationship between n, k, s, and е. We assumed that the cost of computing the Bernoulli numbers, which appear in the series, is fixed, and briefly discuss how this may influence high precision calculation. Based on our study of the behavior of Backlund’s remainder estimate, we define the ‘best’ pair (n, k), and present a reliable method of computing the best pair. Furthermore, based on a compu- tational analysis, we conjecture that there is a relationship between n and k which does not depend on s. We present two algorithms, one based on our method and the other on the conjecture, and compare their costs of finding n and k as well as computing the Euler-Maclaurin series with an algorithm presented by Cohen and Olivier. We conclude that our algorithm reduces the cost of computing Ϛ(s) drastically, and that good numerical techniques need to be applied to our method and conjecture for finding n and k in order to keep this computational cost low as well. / Science, Faculty of / Mathematics, Department of / Graduate

No description available.

No description available.

No description available.

This thesis analyzes the differences in social domination for test subjects treated with epinephrine, norepinephrine, and non-injection.