Prof. W.H. Steeb

La thèse consiste en une mise en rapport aux plans notionnel et empirique de la valeur saussurienne et de l’archétype jungien. L’intérêt d’établir une telle corrélation est d’étudier les valeurs archétypales dans une perspective néo-saussurienne. Pour ce faire, la notion de valeur dans les manuscrits saussuriens De l'essence double du langage est traitée dans son aspect double, différentiel et réflexif à la fois : cela permet aux différences articulées de se charger d’une expression métalinguistique. Les valeurs archétypales héritent alors de cette propriété double. La notion de valeur archétypale entre ainsi en interdépendance avec d’autres notions : celles de différenciation, de postélaboration, d’association, de catégorie, de niveau. Les valeurs archétypales héritent de deux particularités des archétypes jungiens : elles se présentent comme des conventions collectives sociales et comme des élaborations langagières systémiques à la fois. Pour assurer le cadre méthodologique de l’analyse, une division aristotélicienne est appliquée. Cela permet d’abord aux valeurs de s’articuler en valeurs génériques, spécifiques et numériques. Cela permet ensuite aux qualités archétypales d’assurer les différenciations. Dans la mesure où valeur et sens sont inséparables, cette étude des valeurs archétypales est aussi une étude sémantique qui se donne pour l’objectif d’étudier les représentations qualitatives du sens. / The thesis represents empirical and notional relationships between Saussure’s values and Jung’s archetypes. The aim is to study the archetypal values in a neo-Saussurean perspective. In order to achieve this aim, the notion of value in Saussure’s On the dual essence of language is presented as a dual phenomenon with a differential nature and a reflexive meta-linguistic nature at the same time. Thus, the archetypal values inherit this dual aspect. The notion of archetypal value appears as a complex one that enters interdependence with other notions, (differentiation and post-elaboration, association and category, generic, specific and numeric identities and levels). The archetypal values inherit two particular properties from Jung’s archetype. Therefore, the archetypal values appear as social and collective conventions, as well as language system elaborations. To provide relevant methodological framework for the analysis, the Aristotelian division is applied. In this way the values are generically, specifically and numerically differentiated. Then this method allows archetypal qualities to make the differentiation of the three types of values. Since the value and the meaning are inseparable, this study of the archetypal values also has a semantic aspect and aims to study the qualitative representations of the meaning.

This work is concerned with two different problems in harmonic analysis, one on the Heisenberg group and other on Rn, as described in the following two paragraphs respectively. Let Hn be the (2n + 1)-dimensional Heisenberg group, and let K be a compact subgroup of U(n), such that (K, Hn) is a Gelfand pair. Also assume that the K-action on Cn is polar. We prove a Hecke-Bochner identity associated to the Gelfand pair (K, Hn). For the special case K = U(n), this was proved by Geller, giving a formula for the Weyl transform of a function f of the type f = Pg, where g is a radial function, and P a bigraded solid U(n)-harmonic polynomial. Using our general Hecke-Bochner identity we also characterize (under some conditions) joint eigenfunctions of all differential operators on Hn that are invariant under the action of K and the left action of Hn . We consider convolution equations of the type f * T = g, where f, g ε Lp(Rn) and T is a compactly supported distribution. Under natural assumptions on the zero set of the Fourier transform of T , we show that f is compactly supported, provided g is.

京都大学 / 新制・課程博士 / 博士(情報学) / 甲第24980号 / 情博第853号 / 新制||情||143(附属図書館) / 京都大学大学院情報学研究科システム科学専攻 / (主査)教授 田中 利幸, 教授 下平 英寿, 准教授 本多 淳也 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

Communication can be divied into two broad areas namely, the verbal and nonverbal levels. While attention has been paid to nonverbal communication in the literature, few studies address the nonverbal communication that takes place in the natural setting of a therapeutic session. The present study provides such a naturalistic study, where the verbal content of actual therapy sessions are integrated with the nonverbal content to yield a holistic view of the session. An ecosystemic epistemology is adopted in this study, and represents a move away from more traditional approaches to nonverbal behaviour which are largely confined to a positivistic framework of thought and design. Symlog Interaction Scoring is employed as a practical method of assisting observers in distinguishing nonverbal behaviours, which are usually perceived unconsciously, and lifting them into consciousness, allowing this infonnation to be integrated with the meanings and hypotheses generated during therapy. By deliberately including descriptions of nonverbal behaviour, the descriptions of therapy were broadened, thereby providing a more holistic approach to therapy. / Psychology / M.A. (Clinical Psychology)

Text in Afrikaans / Die komplementariteit tussen afstand en intimiteit in die terapeutiese verhouding word ge"illustreer en bespreek aan die hand van 'n enkeie gevallestudie. Die klem is op rekursiewe en selfverwysende prosesse wat tussen die terapeut en kiient plaasvind, sodat die vvyse waarop intiemer en meer afstandelike interaksies ge-kokreer is, uitgelig word. Die terapeutiese proses word binne die raamwerk van die ekosistemiese en sosiale konstruksionistiese epistomologie bespreek. Navorsing word uitgevoer volgens die naturalistiese navorsingsparadigma en raakpunte tussen die navorsingsparadigma en epistomologie wat bespreek is, word aan die hand van die gevaliestudie ge"illustreer. In die studie word daar ook verwys na verwante kwessies, soos aanraking en grense in die terapeutiese verhouding, terapie as 'n a-sosiale konteks, terapie as 'n paradoksale situasie en die neutraliteit van die terapeut, wat aansluit by die tema van hierdie studie. Hierdie temas word geintegreer tydens die bespreking van die gevallestudie. / An individual case study is used in this study, to discuss the complementarity between distance and intimacy in the therapeutic relationship. The focus is on recursive and selfreflective processes between the therapist and the client in order to explain the way in which intimate and distant interactions were coconstructed. The therapeutic process was discussed in the context of ecosystemic and social constructionist epistemologies. Research was done according to the principles of the naturalistic research paradigm and overlaps between this research paradigm and epistemologies that were discussed are brought forward through the discussion of the case study. There are also references in this study to related issues, such as touching and boundaries in the therapeutic relationship, therapy as an a-social and paradoxical context, and the neutrality of the therapist, which connect with the theme of this study. These themes are integrated in the discussion of the case study. / Psychology / M.A. (Kliniese Sielkunde)

Numerical algorithms for efficiently solving optimal control problems are important for commonly used advanced control strategies, such as model predictive control (MPC), but can also be useful for advanced estimation techniques, such as moving horizon estimation (MHE). In MPC, the control input is computed by solving a constrained finite-time optimal control (CFTOC) problem on-line, and in MHE the estimated states are obtained by solving an optimization problem that often can be formulated as a CFTOC problem. Common types of optimization methods for solving CFTOC problems are interior-point (IP) methods, sequential quadratic programming (SQP) methods and active-set (AS) methods. In these types of methods, the main computational effort is often the computation of the second-order search directions. This boils down to solving a sequence of systems of equations that correspond to unconstrained finite-time optimal control (UFTOC) problems. Hence, high-performing second-order methods for CFTOC problems rely on efficient numerical algorithms for solving UFTOC problems. Developing such algorithms is one of the main focuses in this thesis. When the solution to a CFTOC problem is computed using an AS type method, the aforementioned system of equations is only changed by a low-rank modification between two AS iterations. In this thesis, it is shown how to exploit these structured modifications while still exploiting structure in the UFTOC problem using the Riccati recursion. Furthermore, direct (non-iterative) parallel algorithms for computing the search directions in IP, SQP and AS methods are proposed in the thesis. These algorithms exploit, and retain, the sparse structure of the UFTOC problem such that no dense system of equations needs to be solved serially as in many other algorithms. The proposed algorithms can be applied recursively to obtain logarithmic computational complexity growth in the prediction horizon length. For the case with linear MPC problems, an alternative approach to solving the CFTOC problem on-line is to use multiparametric quadratic programming (mp-QP), where the corresponding CFTOC problem can be solved explicitly off-line. This is referred to as explicit MPC. One of the main limitations with mp-QP is the amount of memory that is required to store the parametric solution. In this thesis, an algorithm for decreasing the required amount of memory is proposed. The aim is to make mp-QP and explicit MPC more useful in practical applications, such as embedded systems with limited memory resources. The proposed algorithm exploits the structure from the QP problem in the parametric solution in order to reduce the memory footprint of general mp-QP solutions, and in particular, of explicit MPC solutions. The algorithm can be used directly in mp-QP solvers, or as a post-processing step to an existing solution. / Numeriska algoritmer för att effektivt lösa optimala styrningsproblem är en viktig komponent i avancerade regler- och estimeringsstrategier som exempelvis modellprediktiv reglering (eng. model predictive control (MPC)) och glidande horisont estimering (eng. moving horizon estimation (MHE)). MPC är en reglerstrategi som kan användas för att styra system med flera styrsignaler och/eller utsignaler samt ta hänsyn till exempelvis begränsningar i styrdon. Den grundläggande principen för MPC och MHE är att styrsignalen och de estimerade variablerna kan beräknas genom att lösa ett optimalt styrningsproblem. Detta optimeringsproblem måste lösas inom en kort tidsram varje gång som en styrsignal ska beräknas eller som variabler ska estimeras, och således är det viktigt att det finns effektiva algoritmer för att lösa denna typ av problem. Två vanliga sådana är inrepunkts-metoder (eng. interior-point (IP)) och aktivmängd-metoder (eng. active-set (AS)), där optimeringsproblemet löses genom att lösa ett antal enklare delproblem. Ett av huvudfokusen i denna avhandling är att beräkna lösningen till dessa delproblem på ett tidseffektivt sätt genom att utnyttja strukturen i delproblemen. Lösningen till ett delproblem beräknas genom att lösa ett linjärt ekvationssystem. Detta ekvationssystem kan man exempelvis lösa med generella metoder eller med så kallade Riccatirekursioner som utnyttjar strukturen i problemet. När man använder en AS-metod för att lösa MPC-problemet så görs endast små strukturerade ändringar av ekvationssystemet mellan varje delproblem, vilket inte har utnyttjats tidigare tillsammans med Riccatirekursionen. I denna avhandling presenteras ett sätt att utnyttja detta genom att bara göra små förändringar av Riccatirekursionen för att minska beräkningstiden för att lösa delproblemet. Idag har behovet av  parallella algoritmer för att lösa MPC och MHE problem ökat. Att algoritmerna är parallella innebär att beräkningar kan ske på olika delar av problemet samtidigt med syftet att minska den totala verkliga beräkningstiden för att lösa optimeringsproblemet. I denna avhandling presenteras parallella algoritmer som kan användas i både IP- och AS-metoder. Algoritmerna beräknar lösningen till delproblemen parallellt med ett förutbestämt antal steg, till skillnad från många andra parallella algoritmer där ett okänt (ofta stort) antal steg krävs. De parallella algoritmerna utnyttjar problemstrukturen för att lösa delproblemen effektivt, och en av dem har utvärderats på parallell hårdvara. Linjära MPC problem kan också lösas genom att utnyttja teori från multiparametrisk kvadratisk programmering (eng. multiparametric quadratic programming (mp-QP)) där den optimala lösningen beräknas i förhand och lagras i en tabell, vilket benämns explicit MPC. I detta fall behöver inte MPC problemet lösas varje gång en styrsignal beräknas, utan istället kan den förberäknade optimala styrsignalen slås upp. En nackdel med mp-QP är att det krävs mycket plats i minnet för att spara lösningen. I denna avhandling presenteras en strukturutnyttjande algoritm som kan minska behovet av minne för att spara lösningen, vilket kan öka det praktiska användningsområdet för mp-QP och explicit MPC.

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal.

[pt] Nesta tese, investiga-se a hipótese de que a aquisição de um traço sintático de Ponto de Vista (PoV) e sua codificação em CPs de orações completivas subcategorizadas por verbos de crença seja condição necessária para o desenvolvimento pleno de Teoria da Mente (TM), caracterizado pelo domínio da habilidade de raciocinar e prever ações de indivíduos que possuem uma Crença Falsa (CF), atingido por crianças aproximadamente aos quatro anos de idade (cf. DE VILLIERS E DE VILLIERS, 2009) (doravante, Hipótese PoV-CF). Especificamente, esta pesquisa visou a: averiguar em que medida a HPoV-CF pode ser sustentada; avaliar a possibilidade de se incorporar um traço PoV a um modelo online de computação sintática baseado nos pressupostos minimalistas (CORRÊA E AUGUSTO, 2007; 2011); e caracterizar o processo de aquisição do conhecimento relativo a esse traço à luz de uma teoria procedimental de aquisição da linguagem (CORRÊA, 2009). São apresentadas três possíveis análises de PoV codificado como traço formal ou semântico em completivas. Argumenta-se que, independentemente da caracterização desse traço, a aquisição do conhecimento que este representa dependeria inevitavelmente de um bootstrapping semântico, o que pressupõe a habilidade cognitiva de distinguir pontos de vista. No que concerne à investigação empírica, oito experimentos foram conduzidos. Os experimentos 1 a 6 visavam a investigar a habilidade de crianças de 3;3-3;5 anos em lidar com diferentes demandas requeridas à realização das tarefas tradicionais de CF e de Memória para Complementos (cujos resultados corroboram a HPoVCF), como a habilidade em lidar com interrogativas QU de objeto, a factividade de verbos mentais e factualidade. Foi também investigada a habilidade dessas crianças em lidar com tarefas linguísticas que incluem uma situação de CF. No Experimento 7, foi avaliada a habilidade das crianças em atribuir valores-verdade a completivas e a ambas as orações da sentença complexa. No experimento 8, o papel da recursividade linguística para o raciocínio sobre CFs de primeira e segunda ordem foi investigado, com crianças de 6;2 anos. De um modo geral, os resultados sugerem que i) as crianças não dominam demandas inerentes às tarefas tradicionais, indicando que seu insucesso nessas tarefas pode não refletir uma dificuldade em lidar com completivas ou com CFs; ii) as crianças atribuem corretamente valores-verdade a completivas, embora a atribuição de valor-verdade à oração principal (sentença completa) independentemente do valor da completiva seja mais custosa; iii) o raciocínio de CFs de primeira e segunda ordem pode ser conduzido por meio de estruturas não recursivas, embora estruturas recursivas pareçam facilitá-lo. Tendo-se em vista os resultados obtidos e à luz do possível processo de aquisição assumido, considera-se que a HPoV-CF não pode ser sustentada. Habilidades metacognitivas parecem ser requeridas para que a criança ignore o valor-verdade da completiva ao atribuir um valor-verdade à sentença completa. Argumenta-se que um possível papel para as completivas no desenvolvimento de TM seria o de prover uma representação que pode ser usada como recurso para facilitar (não sustentar) o raciocínio sobre CFs. / [en] This dissertation investigates the hypothesis that acquiring knowledge concerning the syntactic feature Point-of-View (PoV) in CPs of complement clauses (CCs) subcategorized by verbs of belief is a necessary condition for children to achieve a fully developed Theory of Mind (ToM) – the ability to ascribe false beliefs (FBs) to others and to predict their reasoning and action based on it (usually achieved by 4 years of age) (cf. DE VILLIERS AND DE VILLIERS, 2009) (henceforth, PoV-FBHypothesis). In particular, this study aimed to verify the extent to which PoV-FBH can be maintained; to evaluate the possibility of incorporating a PoV feature in an on-line model of syntactic computation grounded in minimalist assumptions (Corrêa & Augusto, 2007; 2011) and to characterize the developmental course of the acquisition of knowledge concerning this feature in the light of a procedural theory of language acquisition (Corrêa, 2009). The possibility of PoV being represented as a formal feature or as a semantic feature was considered in three analyses of CCs. It is argued that no matter how this feature is characterized, the acquisition of the knowledge it represents would inevitably rely on semantic bootstrapping, which presupposes the cognitive ability of distinguishing points of view. As for the empirical investigation, 8 experiments were conducted. Experiments 1-6 aimed at assessing 3;3-3;5 year olds ability to cope with a number of the demands of the traditional FB and Memory for Complements (MC) tasks, which supports PoVFBH, such as the ability to cope with object WH, the factivity of mental verbs and factuality. The production of CCs and childrens ability to cope with a linguistic task that includes a FB situation were also investigated. In experiment 7, childrens ability to assign truth-values to CCs and for both clauses of the complex sentence was evaluated. In Experiment 8 the role of language recursion for first- and second-order FB reasoning was investigated with 6;2 year-old children. In general, the results suggested that i) childrens failure on the traditional FB and MC tasks does not necessarily mean difficulty in dealing with CCs or FBs, insofar as they do not cope with most of the demands these tasks presuppose; ii) 3 year olds correctly assign truth-values to CCs, though assigning the truth-value for the main clause (the whole sentence) independently of the truth-value of the CC is particularly costly; iii) first- and second-order FB reasoning can be undertaken on the basis of non-recursive structures, although recursive structures seem to facilitate it. In sum, both in the light of the possible developmental courses of acquisition considered here and on the basis of the results obtained, it would be hard for the PoV-FBH to be maintained, as it stands. Metacognitive abilities may be required for children to be able to ignore the truthvalue of the CC when assigning a truth-value for the complex sentence. It is argued that the possible role of CCs in the development of ToM is to provide a representation that can be used to facilitate FB reasoning, not to support it.

This thesis deals with the important problem of parallelising sequential code. Despite the importance of parallelism in modern computing, writing parallel software still relies on many low-level and often error-prone approaches. These low-level approaches can lead to serious execution problems such as deadlocks and race conditions. Due to the non-deterministic behaviour of most parallel programs, testing parallel software can be both tedious and time-consuming. A way of providing guarantees of correctness for parallel programs would therefore provide significant benefit. Moreover, even if we ignore the problem of correctness, achieving good speedups is not straightforward, since this generally involves rewriting a program to consider a (possibly large) number of alternative parallelisations. This thesis argues that new languages and frameworks are needed. These language and frameworks must not only support high-level parallel programming constructs, but must also provide predictable cost models for these parallel constructs. Moreover, they need to be built around solid, well-understood theories that ensure that: (a) changes to the source code will not change the functional behaviour of a program, and (b) the speedup obtained by doing the necessary changes is predictable. Algorithmic skeletons are parametric implementations of common patterns of parallelism that provide good abstractions for creating new high-level languages, and also support frameworks for parallel computing that satisfy the correctness and predictability requirements that we require. This thesis presents a new type-based framework, based on the connection between structured parallelism and structured patterns of recursion, that provides parallel structures as type abstractions that can be used to statically parallelise a program. Specifically, this thesis exploits hylomorphisms as a single, unifying construct to represent the functional behaviour of parallel programs, and to perform correct code rewritings between alternative parallel implementations, represented as algorithmic skeletons. This thesis also defines a mechanism for deriving cost models for parallel constructs from a queue-based operational semantics. In this way, we can provide strong static guarantees about the correctness of a parallel program, while simultaneously achieving predictable speedups.