Thesis (M.Mus.)--Chinese University of Hong Kong, 1995. / Chapter 1. --- STRING QUARTET NO.1 / Chapter 2. --- SEA INTERLUDE / Chapter 3. --- TRAGEDY

This work outlines the design and implementation of an algorithm to simulate two-polarisation bowed string motion, for the purpose of realistic sound synthesis. The algorithm is based on a physical model of a linear string, coupled with a bow, stopping fi ngers, and a rigid, distributed fingerboard. In one polarisation, the normal interaction forces are based on a nonlinear impact model. In the other polarisation, the tangential forces between the string and the bow, fingers, and fingerboard are based on a force-velocity friction curve model, also nonlinear. The linear string model includes accurate time-domain reproduction of frequency-dependent decay times. The equations of motion for the full system are discretised with an energy-balanced finite difference scheme, and integrated in the discrete time domain. Control parameters are dynamically updated, allowing for the simulation of a wide range of bowed string gestures. The playability range of the proposed algorithm is explored, and example synthesised gestures are demonstrated.

Composed for the JACK Quartet during their Spring residency at BU during the week of Febuary 19-23, 2018. Recorded at the BU Concert Hall on Febuary 21, 2018. Composed between September 2016 - February 2018. duration: approx. 30 min. “ ccidentall , r’s finger touches Ch e’s, their feet, under the table, happen to against each other. W might be eng by the mean of these accidents; e might concentrate ph on these slight zones of contact and d l t in this fragm nt of inert finger or f , fet i tically, without concern for the re- sponse (like od——as t etym y of the word t lls us——the Fe does not reply). But in fact erthe is not pe e, he is in lov : h creates meaning, al ays and ev ry here, out of nothing, a it is meaning wh th ll im: is in crucible of meaning. Every contact, f r t lover, raises qu st on of n answer: the skin s asked to reply. “ Quand mon doigt par mégarde… ” (A squeeze of the hand——enormous documentation——a tiny gesture within the palm, a knee which doesn’t move away, an arm extended, as if quite naturally, along the back of a sofa and against which the other’s head gradu- ally comes to rest——this is the paradisiac realm of subtle and clandestine signs: a kind of festival not of the senses but of meaning.) ” Roland Barthes, A Lover’s Discourse: Fragments

In the present thesis, we offer an introduction to type IIB string compactifications on $\mathbb{T}^{d}/\Gamma$ toroidal orbifolds. We first describe the technical method to construct these spaces and reduce the string background on it. We will have (non)-geometrical fluxes arising from these spaces which decorate with discrete deformations our four $\mathcal{N}=1$ dimensional supergravity theory. Solving its equations of motion, we find several families of supersymmetric AdS vacua with fixed moduli, which can be related through a set of  $SL(2,\mathbb{Z})$ symmetries.

by Hui Cheung Wai. / Thesis (M.Mus.)--Chinese University of Hong Kong, 1997. / Chapter 1. --- String Quartet No2 / Chapter a) --- programme notes --- p.I. i -ii / Chapter b) --- music score / Chapter ´Ø --- 1st movement --- p.1-15 / Chapter ´Ø --- 2nd movement --- p.16 -25 / Chapter ´Ø --- 3rd movement --- p.26-51 / Chapter 2. --- """Disappearance"" for orchestra" / Chapter a) --- programme notes --- p.II. i -iv / Chapter b) --- music score --- p.1-46 / Chapter 3. --- """Wu Wu"" (Sorcery Dance) for piano" / Chapter a) --- programme notes --- p.III. i -ii / Chapter b) --- music score --- p.1-12

Quintet for winds and piano -- Preludes and fugues for piano solo -- Variation for string quartet. / Wong Kong Yu. / Thesis submitted in: December 2002. / Thesis (M.Mus.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves ). / Abstracts in English and Chinese. / Abstract --- p.1 Page / Scores with Notes: / Chapter 1. --- Quintet for Winds and Piano / Note --- p.2 Pages / Score --- p.30 Pages / Chapter 2. --- Preludes and Fugues for Piano Solo / Note --- p.2 Pages / Score --- p.31 Pages / Chapter 3. --- Variations for String Quartet / Note --- p.2 Pages / Score --- p.9 Pages / Total Duration: 38 minutes

O reconhecimento aproximado de cadeias de texto é um problema recorrente em diversas aplicações onde o computador é utilizado como meio de processamento de uma massa de dados sujeita a imprecisões, erros e distorções. Existem inúmeras metodologias, técnicas e métricas criadas e empregadas na resolução deste tipo de problema, mas a maioria delas é inflexível em pelo menos um dos seguintes pontos: arquitetura, métrica utilizada para aferir o erro encontrado ou especificidade na aplicação. Esse trabalho propõe e analisa a utilização dos Autômatos Finitos Nebulosos para a resolução desse tipo de problema. A teoria nebulosa oferece uma base teórica sólida para o tratamento de informações inexatas ou sujeita a erros, enquanto o modelo matemático dos autômatos finitos é uma ferramenta consolidada para o problema de reconhecimento de cadeias de texto. Um modelo híbrido não só oferece uma solução flexível para a resolução do problema proposto, como serve de base para a resolução de inúmeros outros problemas que dependem do tratamento de informações imprecisas. / The approximate string matching problem is recurring in many applications where computer is used to process imprecise, fuzzy or spurious data. An uncountable number of methods, techniques and metrics to solve this class of problem are available, but many of them are inflexible at least in one of following: architecture, metric or application specifics. This work proposes and analyzes the use of Fuzzy Finite State Automata to solve this class of problems. The fuzzy theory grants a solid base to handle imprecise or fuzzy information; the finite state automata is a classic tool in string matching problems. A hybrid model offers a flexible solution for this class of problem and can be a base for other problems related with imprecise data processing.

Apresentamos uma revisão dos elementos básicos do estudo da teoria clássica das supercordas em backgrounds planos e curvos, dando ênfase ao caso importante em que o background e a variedade AdS5 S5. Nós inclumos um estudo da corda bosonica para revisarmos alguns conceitos básicos da teoria de campos conforme em duas dimensões. Em seguida estudamos a teoria das supercordas em um espaço plano onde apresentamos uma introdução pedagógica ao formalismo de espinores puros. A ultima parte e dedicada a generalização da ação de Green-Schwarz para o caso de AdS5 S5 e uma apresentação do modelo sigma do formalismo de espinores puros no mesmo background. / We present a review of the basic elements of the study of classical superstring theory in at and curved backgrounds, giving emphasis to the very important case of the AdS5S5 background. We include a study of the bosonic string to review some basic concepts of two dimensional conformal eld theory. We then move on to the superstring in at space where we present a pedagogical introduction to the pure spinor formalism of superstrings. The last part is devoted to the generalization of the Green-Schwarz action to AdS5 S5 and a presentation of the pure spinor sigma model in the same background.

O reconhecimento aproximado de cadeias de texto é um problema recorrente em diversas aplicações onde o computador é utilizado como meio de processamento de uma massa de dados sujeita a imprecisões, erros e distorções. Existem inúmeras metodologias, técnicas e métricas criadas e empregadas na resolução deste tipo de problema, mas a maioria delas é inflexível em pelo menos um dos seguintes pontos: arquitetura, métrica utilizada para aferir o erro encontrado ou especificidade na aplicação. Esse trabalho propõe e analisa a utilização dos Autômatos Finitos Nebulosos para a resolução desse tipo de problema. A teoria nebulosa oferece uma base teórica sólida para o tratamento de informações inexatas ou sujeita a erros, enquanto o modelo matemático dos autômatos finitos é uma ferramenta consolidada para o problema de reconhecimento de cadeias de texto. Um modelo híbrido não só oferece uma solução flexível para a resolução do problema proposto, como serve de base para a resolução de inúmeros outros problemas que dependem do tratamento de informações imprecisas. / The approximate string matching problem is recurring in many applications where computer is used to process imprecise, fuzzy or spurious data. An uncountable number of methods, techniques and metrics to solve this class of problem are available, but many of them are inflexible at least in one of following: architecture, metric or application specifics. This work proposes and analyzes the use of Fuzzy Finite State Automata to solve this class of problems. The fuzzy theory grants a solid base to handle imprecise or fuzzy information; the finite state automata is a classic tool in string matching problems. A hybrid model offers a flexible solution for this class of problem and can be a base for other problems related with imprecise data processing.

No description available.