Principles of Pitch Organization in Béla Bartók's 'Duke Bluebeard's Castle'

The topic of my doctoral thesis is to demonstrate the usefulness of incorporating tonal and modal elements into a pitch-web square analysis of Béla Bartók's (1881-1945) opera, 'A kékszakállú herceg vára' ('Duke Bluebeard's Castle'). My specific goal is to demonstrate that different musical materials, which exist as foreground melodies or long-term key progressions, are unified by the unordered pitch set {0,1,4}, which becomes prominent in different sections of Bartók's opera. In Bluebeard's Castle, the set {0,1,4} is also found as a subset of several tetrachords: {0,1,4,7}, {0,1,4,8}, and {0,3,4,7}. My claim is that {0,1,4} serves to link music materials between themes, between sections, and also between scenes. This study develops an analytical method, drawn from various theoretical perspectives, for conceiving superposed diatonic spaces within a hybrid pitch-space comprised of diatonic and chromatic features. The integrity of diatonic melodic lines is retained, which allows for a non-reductive understanding of diatonic superposition, without appealing to pitch centers or specifying complete diatonic collections. Through combining various theoretical insights of the Hungarian scholar Ernő Lendvai, and the American theorists Elliott Antokoletz, Paul Wilson and Allen Forte, as well as the composer himself, this study gives a detailed analysis of the opera's pitch material in a way that combines, complements, and expands upon the studies of those scholars. The analyzed pitch sets are represented on Aarre Joutsenvirta's note-web square, which adds a new aspect to the field of Bartók analysis. Keywords: Bartók, Duke Bluebeard's Castle (Op. 11), Ernő Lendvai, axis system, Elliott Antokoletz, intervallic cycles, intervallic cells, Allen Forte, set theory, interval classes, interval vectors, Aarre Joutsenvirta, pitch-web square, pitch-web analysis.

Si, CdTe and CdZnTe radiation detectors for imaging applications

The structure and operation of CdTe, CdZnTe and Si pixel detectors based on crystalline semiconductors, bump bonding and CMOS technology and developed mainly at Oy Simage Ltd. And Oy Ajat Ltd., Finland for X- and gamma ray imaging are presented. This detector technology evolved from the development of Si strip detectors at the Finnish Research Institute for High Energy Physics (SEFT) which later merged with other physics research units to form the Helsinki Institute of Physics (HIP). General issues of X-ray imaging such as the benefits of the method of direct conversion of X-rays to signal charge in comparison to the indirect method and the pros and cons of photon counting vs. charge integration are discussed. A novel design of Si and CdTe pixel detectors and the analysis of their imaging performance in terms of SNR, MTF, DQE and dynamic range are presented in detail. The analysis shows that directly converting crystalline semiconductor pixel detectors operated in the charge integration mode can be used in X-ray imaging very close to the theoretical performance limits in terms of efficiency and resolution. Examples of the application of the developed imaging technology to dental intra oral and panoramic and to real time X-ray imaging are given. A CdTe photon counting gamma imager is introduced. A physical model to calculate the photo peak efficiency of photon counting CdTe pixel detectors is developed and described in detail. Simulation results indicates that the charge sharing phenomenon due to diffusion of signal charge carriers limits the pixel size of photon counting detectors to about 250 μm. Radiation hardness issues related to gamma and X-ray imaging detectors are discussed.

The Problem of Implementation and its Relation to the Philosophy of Cognitive Science

According to certain arguments, computation is observer-relative either in the sense that many physical systems implement many computations (Hilary Putnam), or in the sense that almost all physical systems implement all computations (John Searle). If sound, these arguments have a potentially devastating consequence for the computational theory of mind: if arbitrary physical systems can be seen to implement arbitrary computations, the notion of computation seems to lose all explanatory power as far as brains and minds are concerned. David Chalmers and B. Jack Copeland have attempted to counter these relativist arguments by placing certain constraints on the definition of implementation. In this thesis, I examine their proposals and find both wanting in some respects. During the course of this examination, I give a formal definition of the class of combinatorial-state automata , upon which Chalmers s account of implementation is based. I show that this definition implies two theorems (one an observation due to Curtis Brown) concerning the computational power of combinatorial-state automata, theorems which speak against founding the theory of implementation upon this formalism. Toward the end of the thesis, I sketch a definition of the implementation of Turing machines in dynamical systems, and offer this as an alternative to Chalmers s and Copeland s accounts of implementation. I demonstrate that the definition does not imply Searle s claim for the universal implementation of computations. However, the definition may support claims that are weaker than Searle s, yet still troubling to the computationalist. There remains a kernel of relativity in implementation at any rate, since the interpretation of physical systems seems itself to be an observer-relative matter, to some degree at least. This observation helps clarify the role the notion of computation can play in cognitive science. Specifically, I will argue that the notion should be conceived as an instrumental rather than as a fundamental or foundational one.