L'évolution continue des architectures des processeurs a été un moteur important de la recherche en compilation. Une tendance dans cette évolution qui existe depuis l'avènement des ordinateurs modernes est le rapport grandissant entre la puissance de calcul disponible (IPS, FLOPS, ...) et la bande-passante correspondante qui est disponible entre les différents niveaux de la hiérarchie mémoire (registres, cache, mémoire vive). En conséquence la réduction du nombre de communications mémoire requis par un code donnée a constitué un sujet de recherche important. Un principe de base en la matière est l'amélioration de la localité temporelle des données: regrouper dans le temps l'ensemble des accès à une donnée précise pour qu'elle ne soit requise que pendant peu de temps et pour qu'elle puisse ensuite être transféré vers de la mémoire lointaine (mémoire vive) sans communications supplémentaires.Une toute autre évolution architecturale a été l'arrivée de l'ère des multicoeurs et au cours des dernières années les premières générations de processeurs manycoeurs. Ces architectures ont considérablement accru la quantité de parallélisme à la disposition des programmes et algorithmes mais ceci est à nouveau limité par la bande-passante disponible pour les communications entres coeurs. Ceci a amené dans le monde de la compilation et des techniques d'optimisation des problèmes qui étaient jusqu'à là uniquement connus en calcul distribué.Dans ce texte nous présentons les premiers travaux sur une nouvelle technique d'optimisation, le pavage généralisé qui a l'avantage d'utiliser un modèle abstrait pour la réutilisation des données et d'être en même temps utilisable dans un grand nombre de contextes. Cette technique trouve son origine dans le pavage de boucles, une techniques déjà bien connue et qui a été utilisée avec succès pour l'amélioration de la localité des données dans les boucles imbriquées que ce soit pour les registres ou pour le cache. Cette nouvelle variante du pavage suit une vision beaucoup plus large et ne se limite pas au cas des boucles imbriquées. Elle se base sur une nouvelle représentation, le graphe d'utilisation mémoire, qui est étroitement lié à un nouveau modèle de besoins en termes de mémoire et de communications et qui s'applique à toute forme de code exécuté itérativement. Le pavage généralisé exprime la localité des données comme un problème d'optimisation pour lequel plusieurs solutions sont proposées. L'abstraction faite par le graphe d'utilisation mémoire permet la résolution du problème d'optimisation dans différents contextes. Pour l'évaluation expérimentale nous montrons comment utiliser cette nouvelle technique dans le cadre des boucles, imbriquées ou non, ainsi que dans le cas des programmes exprimés dans un langage à flot-de-données. En anticipant le fait d'utiliser le pavage généralisé pour la distribution des calculs entre les cœurs d'une architecture manycoeurs nous donnons aussi des éléments de réponse pour modéliser les communications et leurs caractéristiques sur ce genre d'architectures. En guise de point final, et pour montrer l'étendue de l'expressivité du graphe d'utilisation mémoire et le modèle de besoins en mémoire et communications sous-jacent, nous aborderons le sujet du débogage de performances et l'analyse des traces d'exécution. Notre but est de fournir un retour sur le potentiel d'amélioration en termes de localité des données du code évalué. Ce genre de traces peut contenir des informations au sujet des communications mémoire durant l'exécution et a de grandes similitudes avec le problème d'optimisation précédemment étudié. Ceci nous amène à une brève introduction dans le monde de l'algorithmique des graphes dirigés et la mise-au-point de quelques nouvelles heuristiques pour le problème connu de joignabilité mais aussi pour celui bien moins étudié du partitionnement convexe. / The continuous evolution of computer architectures has been an important driver of research in code optimization and compiler technologies. A trend in this evolution that can be traced back over decades is the growing ratio between the available computational power (IPS, FLOPS, ...) and the corresponding bandwidth between the various levels of the memory hierarchy (registers, cache, DRAM). As a result the reduction of the amount of memory communications that a given code requires has been an important topic in compiler research. A basic principle for such optimizations is the improvement of temporal data locality: grouping all references to a single data-point as close together as possible so that it is only required for a short duration and can be quickly moved to distant memory (DRAM) without any further memory communications.Yet another architectural evolution has been the advent of the multicore era and in the most recent years the first generation of manycore designs. These architectures have considerably raised the bar of the amount of parallelism that is available to programs and algorithms but this is again limited by the available bandwidth for communications between the cores. This brings some issues thatpreviously were the sole preoccupation of distributed computing to the world of compiling and code optimization techniques.In this document we present a first dive into a new optimization technique which has the promise of offering both a high-level model for data reuses and a large field of potential applications, a technique which we refer to as generalized tiling. It finds its source in the already well-known loop tiling technique which has been applied with success to improve data locality for both register and cache-memory in the case of nested loops. This new "flavor" of tiling has a much broader perspective and is not limited to the case of nested loops. It is build on a new representation, the memory-use graph, which is tightly linked to a new model for both memory usage and communication requirements and which can be used for all forms of iterate code.Generalized tiling expresses data locality as an optimization problem for which multiple solutions are proposed. With the abstraction introduced by the memory-use graph it is possible to solve this optimization problem in different environments. For experimental evaluations we show how this new technique can be applied in the contexts of loops, nested or not, as well as for computer programs expressed within a dataflow language. With the anticipation of using generalized tiling also to distributed computations over the cores of a manycore architecture we also provide some insight into the methods that can be used to model communications and their characteristics on such architectures.As a final point, and in order to show the full expressiveness of the memory-use graph and even more the underlying memory usage and communication model, we turn towards the topic of performance debugging and the analysis of execution traces. Our goal is to provide feedback on the evaluated code and its potential for further improvement of data locality. Such traces may contain information about memory communications during an execution and show strong similarities with the previously studied optimization problem. This brings us to a short introduction to the algorithmics of directed graphs and the formulation of some new heuristics for the well-studied topic of reachability and the much less known problem of convex partitioning.

La quête de performance a été une constante à travers l’histoire des systèmes informatiques. Il y a plus d’une décennie maintenant, le modèle de traitement séquentiel montrait ses premiers signes d’épuisement pour satisfaire les exigences de performance. Les barrières du calcul séquentiel ont poussé à un changement de paradigme et ont établi le traitement parallèle comme standard dans les systèmes informatiques modernes. Avec l’adoption généralisée d’ordinateurs parallèles, de nombreux algorithmes et applications ont été développés pour s’adapter à ces nouvelles architectures. Cependant, dans des applications non conventionnelles, avec des exigences d’interactivité et de temps réel, la parallélisation efficace est encore un défi majeur. L’exigence de performance en temps réel apparaît, par exemple, dans les simulations interactives où le système doit prendre en compte l’entrée de l’utilisateur dans une itération de calcul de la boucle de simulation. Le même type de contrainte apparaît dans les applications d’analyse de données en continu. Par exemple, lorsque des donnes issues de capteurs de trafic ou de messages de réseaux sociaux sont produites en flux continu, le système d’analyse doit être capable de traiter ces données à la volée rapidement sur ce flux tout en conservant un budget de mémoire contrôlé La caractéristique dynamique des données soulève plusieurs problèmes de performance tel que la décomposition du problème pour le traitement en parallèle et la maintenance de la localité mémoire pour une utilisation efficace du cache. Les optimisations classiques qui reposent sur des modèles pré-calculés ou sur l’indexation statique des données ne conduisent pas aux performances souhaitées. Dans cette thèse, nous abordons les problèmes dépendants de données sur deux applications différentes : la première dans le domaine de la simulation physique interactive et la seconde sur l’analyse des données en continu. Pour le problème de simulation, nous présentons un algorithme GPU parallèle pour calculer les multiples plus courts chemins et des diagrammes de Voronoi sur un graphe en forme de grille. Pour le problème d’analyse de données en continu, nous présentons une structure de données parallélisable, basée sur des Packed Memory Arrays, pour indexer des données dynamiques géo-référencées tout en conservant une bonne localité de mémoire. / A busca por desempenho tem sido uma constante na história dos sistemas computacionais. Ha mais de uma década, o modelo de processamento sequencial já mostrava seus primeiro sinais de exaustão pare suprir a crescente exigência por performance. Houveram "barreiras"para a computação sequencial que levaram a uma mudança de paradigma e estabeleceram o processamento paralelo como padrão nos sistemas computacionais modernos. Com a adoção generalizada de computadores paralelos, novos algoritmos foram desenvolvidos e aplicações reprojetadas para se adequar às características dessas novas arquiteturas. No entanto, em aplicações menos convencionais, com características de interatividade e tempo real, alcançar paralelizações eficientes ainda representa um grande desafio. O requisito por desempenho de tempo real apresenta-se, por exemplo, em simulações interativas onde o sistema deve ser capaz de reagir às entradas do usuário dentro do tempo de uma iteração da simulação. O mesmo tipo de exigência aparece em aplicações de monitoramento de fluxos contínuos de dados (streams). Por exemplo, quando dados provenientes de sensores de tráfego ou postagens em redes sociais são produzidos em fluxo contínuo, o sistema de análise on-line deve ser capaz de processar essas informações em tempo real e ao mesmo tempo manter um consumo de memória controlada A natureza dinâmica desses dados traz diversos problemas de performance, tais como a decomposição do problema para processamento em paralelo e a manutenção da localidade de dados para uma utilização eficiente da memória cache. As estratégias de otimização tradicionais, que dependem de modelos pré-computados ou de índices estáticos sobre os dados, não atendem às exigências de performance necessárias nesses cenários. Nesta tese, abordamos os problemas dependentes de dados em dois contextos diferentes: um na área de simulações baseada em física e outro em análise de dados em fluxo contínuo. Para o problema de simulação, apresentamos um algoritmo paralelo, em GPU, para computar múltiplos caminhos mínimos e diagramas de Voronoi em um grafo com topologia de grade. Para o problema de análise de fluxos de dados, apresentamos uma estrutura de dados paralelizável, baseada em Packed Memory Arrays, para indexar dados dinâmicos geo-localizados ao passo que mantém uma boa localidade de memória. / The quest for performance has been a constant through the history of computing systems. It has been more than a decade now since the sequential processing model had shown its first signs of exhaustion to keep performance improvements. Walls to the sequential computation pushed a paradigm shift and established the parallel processing as the standard in modern computing systems. With the widespread adoption of parallel computers, many algorithms and applications have been ported to fit these new architectures. However, in unconventional applications, with interactivity and real-time requirements, achieving efficient parallelizations is still a major challenge. Real-time performance requirement shows up, for instance, in user-interactive simulations where the system must be able to react to the user’s input within a computation time-step of the simulation loop. The same kind of constraint appears in streaming data monitoring applications. For instance, when an external source of data, such as traffic sensors or social media posts, provides a continuous flow of information to be consumed by an online analysis system. The consumer system has to keep a controlled memory budget and deliver a fast processed information about the stream Common optimizations relying on pre-computed models or static index of data are not possible in these highly dynamic scenarios. The dynamic nature of the data brings up several performance issues originated from the problem decomposition for parallel processing and from the data locality maintenance for efficient cache utilization. In this thesis we address data-dependent problems on two different applications: one on physically based simulations and another on streaming data analysis. To deal with the simulation problem, we present a parallel GPU algorithm for computing multiple shortest paths and Voronoi diagrams on a grid-like graph. Our contribution to the streaming data analysis problem is a parallelizable data structure, based on packed memory arrays, for indexing dynamic geo-located data while keeping good memory locality.

Pendant ce travail de thèse, j'ai tout d'abord finalisé le développement d'un système expérimental unique dédié aux études de transport électronique de nanostructures multi-terminaux de faible impédance. Ce dispositif permet des mesures de conductance et de bruit à très basse température (30 mK), avec une résolution du pico-ampère en utilisant des SQUIDs comme amplificateurs de courant. Dans le chapitre 5, je fournis une description du fonctionnement de la mesure. De plus, je décris la calibration du dispositif et la manière de déduire des quantités physiques à partir des mesures.Au Chapitre 6, je décris des mesures de transport avec des jonctions diffusives à trois terminaux (trijonctions). Dans une géométrie, que l'on appelle T-shape, des électrodes supraconductrices d'Aluminium sont connectées entre-elles par une partie centrale métallique non-supraconductrice de Cuivre. Pour ces nanostructures, on observe des anomalies de conductance à basse tension qui n'ont jamais été observées expérimentalement. Ces anomalies de résistance/conductance ressemblant fortement à l'effet Josephson apparaissant lorsque deux des potentiels appliqués à la trijonction ont une somme nulle. Les anomalies sont présentes sur une large échelle de tension sans perte d'amplitude. De-même, elles montrent une grande robustesse en température. Des expériences sous champ magnétique appliqué montrent une forte suppression des anomalies pour un champ magnétique correspondant à flux magnétique dans la partie normale de l'ordre d'un quantum de flux. Ceci indique qu'un mécanisme cohérent de phase doit être à l'origine des anomalies. Dans la littérature, deux mécanismes sont proposés pour expliquer ces effets.Le premier, nommé "mode-locking", est un accrochage dynamique des courants Josephson ac, qui est induit par l'environnement expérimental (circuit). Cette situation a été étudiée dans les années soixante sur des microstructures Josephson couplées à base de liens faibles. Pour tester cette explication, nous avons mesuré un échantillon composé de deux jonctions Josephson spatialement séparées. Les anomalies n'apparaissent pas dans une telle géométrie, pas même avec une amplitude réduite. Ceci indique qu'une synchronisation par l'environnement expérimental ne peut pas être à l'origine des anomalies observées. Le deuxième mécanisme théorique évoqué est nommé "mode de quartet" et a été proposé récemment par Freyn et collaborateurs. L'une des électrodes supraconductrices distribue alors des doublets de paires de Cooper. Chacune de ces deux paires se scindent alors en deux quasiparticles se propageant chacune vers deux contacts supraconducteurs différents. Dans un tel mécanisme deux quasiparticules, issues de deux paires de Cooper différentes, arrivent sur chacun des deux contacts supraconducteurs. Lorsque les tensions appliquées entre le contact supraconducteurs émetteur et les deux autres contacts sont exactement opposés, les phases des fonctions d'ondes électroniques des quasiparticules arrivant sur un même contact supraconducteur sont telles que ces deux quasiparticules peuvent se recombiner pour former une paire de Cooper. Par ce mécanisme le doublet de paires de Copper émis se distribue de manière cohérente en deux paires de Cooper chacune dans un contact supraconducteur différent.Ce mécanisme est favorable, car il est robuste envers le désordre et peut ainsi exister sur une large échelle de tensions.Au cours de cette thèse, j'ai montré que ces anomalies sont effectivement présentes pour des tensions appliquées correspondant à des énergies bien supérieures à l'énergie de Thouless. A contrario, les effets cohérents responsables de l'effet Josephson ac doivent être fortement atténués sur cette même échelle d'énergie, ce qui rend peu probable le mécanisme de mode-locking. / During this PhD, I have first finished the development of a unique experimental set-up, dedicated for studies of electronic transport of low impedance multi-terminal nanostructures. This set-up allows conductance and noise measurements at very low temperature (30 mK), with a resolution of a few pico-ampere by using SQUIDs as current amplifiers. In chapter 5, I give some explanation of the measurement working principle. Furthermore, I explain the calibration of the experimental set-up as well as how to extract physical quantities from the measurements.In chapter6, I explain transport measurements on diffusive tri-terminal junctions (tri-junction). In a T-shape called geometry, the superconducting Al-electrodes are connected via a common metallic, non-superconducting part of Copper. For these nanostructures, we observe features in the conductance at low voltage, which have been never observed yet experimentally. These features in conductance/resistance have a striking resemblance with a dc-Josephson effect, appearing when two applied potentials on the tri-junction compensate exactly each other.In literature, two mechanisms are proposed to explain this effect.The first mechanism, called "mode-locking", corresponds to a dynamic locking of ac-Josephson currents, which is induced by the experimental environment (circuit). This situation has been extensively studied in the 60's on coupled microstructures, based on weak links. In order to test this explanation, we have measured a junction, which is composed of two spatially separated Josephson junctions. The anomalies does not show up in such a geometry, even not with strongly reduced amplitude. This indicates, that synchronization via the experimental environment can't be the origin of the observed features. The second theoretical mechanism is named "quartet-mode" and has been recently proposed by Freyn and Co-workers. In this process, one superconducting electrode emits doublets of Cooper-pairs. Each of the two pairs splits into two quasi particles propagating toward different superconducting contacts. In such a mechanism, two quasi-particles originating of two different Cooper-pairs, arrive each in the two superconducting contacts. If the applied voltage between the emitting superconducting contact and the two other contacts is exactly opposite, the phase of the electronic wave functions of the arriving quasi-particles on the same superconducting contact are such, that these two quasi-particles can recombine by forming a Cooper-pair. Due to this mechanism, the emitted doublet of Cooper-pairs is coherently distributed as two Cooper-pairs, each of them in a different superconducting contact. This mechanism is favored, since it is robust with respect to disorder and can hence also exist over a large range of voltage. During this PhD, I have shown that these anomalies are indeed present for applied voltage corresponding to energies well above the Thouless energy. Argumentum a contrario, the coherent effects responsible for the ac Josephson-effect have to be strongly attenuated over the same range of energy, which makes low probable the effect of mode-locking.

La quête de performance a été une constante à travers l'histoire des systèmes informatiques.Il y a plus d'une décennie maintenant, le modèle de traitement séquentiel montrait ses premiers signes d'épuisement pour satisfaire les exigences de performance.Les barrières du calcul séquentiel ont poussé à un changement de paradigme et ont établi le traitement parallèle comme standard dans les systèmes informatiques modernes.Avec l'adoption généralisée d'ordinateurs parallèles, de nombreux algorithmes et applications ont été développés pour s'adapter à ces nouvelles architectures.Cependant, dans des applications non conventionnelles, avec des exigences d'interactivité et de temps réel, la parallélisation efficace est encore un défi majeur.L'exigence de performance en temps réel apparaît, par exemple, dans les simulations interactives où le système doit prendre en compte l'entrée de l'utilisateur dans une itération de calcul de la boucle de simulation.Le même type de contrainte apparaît dans les applications d'analyse de données en continu.Par exemple, lorsque des donnes issues de capteurs de trafic ou de messages de réseaux sociaux sont produites en flux continu, le système d'analyse doit être capable de traiter ces données à la volée rapidement sur ce flux tout en conservant un budget de mémoire contrôlé.La caractéristique dynamique des données soulève plusieurs problèmes de performance tel que la décomposition du problème pour le traitement en parallèle et la maintenance de la localité mémoire pour une utilisation efficace du cache.Les optimisations classiques qui reposent sur des modèles pré-calculés ou sur l'indexation statique des données ne conduisent pas aux performances souhaitées.Dans cette thèse, nous abordons les problèmes dépendants de données sur deux applications différentes: la première dans le domaine de la simulation physique interactive et la seconde sur l'analyse des données en continu.Pour le problème de simulation, nous présentons un algorithme GPU parallèle pour calculer les multiples plus courts chemins et des diagrammes de Voronoi sur un graphe en forme de grille.Pour le problème d'analyse de données en continu, nous présentons une structure de données parallélisable, basée sur des Packed Memory Arrays, pour indexer des données dynamiques géo-référencées tout en conservant une bonne localité de mémoire. / The quest for performance has been a constant through the history of computing systems. It has been more than a decade now since the sequential processing model had shown its first signs of exhaustion to keep performance improvements.Walls to the sequential computation pushed a paradigm shift and established the parallel processing as the standard in modern computing systems. With the widespread adoption of parallel computers, many algorithms and applications have been ported to fit these new architectures. However, in unconventional applications, with interactivity and real-time requirements, achieving efficient parallelizations is still a major challenge.Real-time performance requirement shows-up, for instance, in user-interactive simulations where the system must be able to react to the user's input within a computation time-step of the simulation loop. The same kind of constraint appears in streaming data monitoring applications. For instance, when an external source of data, such as traffic sensors or social media posts, provides a continuous flow of information to be consumed by an on-line analysis system. The consumer system has to keep a controlled memory budget and delivery fast processed information about the stream.Common optimizations relying on pre-computed models or static index of data are not possible in these highly dynamic scenarios. The dynamic nature of the data brings up several performance issues originated from the problem decomposition for parallel processing and from the data locality maintenance for efficient cache utilization.In this thesis we address data-dependent problems on two different application: one in physics-based simulation and other on streaming data analysis. To the simulation problem, we present a parallel GPU algorithm for computing multiple shortest paths and Voronoi diagrams on a grid-like graph. To the streaming data analysis problem we present a parallelizable data structure, based on packed memory arrays, for indexing dynamic geo-located data while keeping good memory locality.

Drawing mainly on Lefebvre’s, Soja’s and Smith’s theorizations of space in order to understand the spatial dynamics of social inequality, this study investigates how a low-income Syrian refugee community negotiates its precarious location in a neighborhood on the periphery of one of Cairo’s desert ‘New Towns’. It also examines the way in which urban spatiality shapes the everyday lived reality of this particular community of Syrians. Through an ethnographic focus, I explore how Syrian people living in Cairo are marginalized through broader processes of neoliberal capitalist development which in turn give rise to socio-spatial disparities within cityspace. By developing the concept of socio-spatial exclusion imbued with defiant (hyper)locality, I argue that although these Syrian refugees lack access to transportation and other types of social services, they nevertheless manage to disrupt the spatial status-quo by devising creative solutions to problems concerning amenity availability in the neighborhood where they live. The investigation of these urban trajectories are guided by the notion that spatiality is at once a social product as well as a force in shaping social life. Research for this project draws on multiple sources, including conversations with neighborhood residents, interviews with NGOs and Cairo-based specialists on refugees and urban development, as well as ethnographic observation, an online questionnaire, satellite imagery and social media content.

Cette thèse couvre le sujet des systèmes de traitement de données àgrande échelle, et plus précisément trois approches complémentaires :la conception d'un système pour prédir des défaillances de serveursgrâce à l'analyse de leurs données de supervision; l'acheminement dedonnées dans un système à temps réel en étudiant les corrélationsentre les champs des messages pour favoriser la localité; etfinalement un environnement de développement innovateur pour concevoirdes transformations de donées en utilisant des graphes orientés deblocs.À travers le projet Smart Support Center, nous concevons unearchitecture qui passe à l'échelle, afin de stocker des sériestemporelles rapportées par des moteurs de supervision, qui vérifienten permanence la santé des systèmes informatiques. Nous utilisons cesdonnées pour effectuer des prédictions, et détecter de potentielsproblèmes avant qu'ils ne ne produisent.Nous nous plongeons ensuite dans les algorithmes d'acheminement pourles sytèmes de traitement de données en temps réel, et développons unecouche pour acheminer les messages plus efficacement, en évitant lesrebonds entre machines. Dans ce but, nous identifions en temps réelles corrélations qui apparaissent entre les champs de ces messages,tels les mots-clics et leur localisation géographique, par exempledans le cas de micromessages. Nous utilisons ces corrélations pourcréer des tables d'acheminement qui favorisent la colocation desacteurs traitant ces messages.Pour finir, nous présentons λ-blocks, un environnement dedéveloppement pour effectuer des tâches de transformations de donnéessans écrire de code source, mais en créant des graphes de blocs decode. L'environnement est rapide, et est distribué avec des pilesincluses: libraries de blocs, modules d'extension, et interfaces deprogrammation pour l'étendre. Il est également capable de manipulerdes graphes d'exécution, pour optimisation, analyse, vérification, outout autre but. / This thesis covers the topic of large-scale data processing systems,and more precisely three complementary approaches: the design of asystem to perform prediction about computer failures through theanalysis of monitoring data; the routing of data in a real-time systemlooking at correlations between message fields to favor locality; andfinally a novel framework to design data transformations usingdirected graphs of blocks.Through the lenses of the Smart Support Center project, we design ascalable architecture, to store time series reported by monitoringengines, which constantly check the health of computer systems. We usethis data to perform predictions, and detect potential problems beforethey arise.We then dive in routing algorithms for stream processing systems, anddevelop a layer to route messages more efficiently, by avoiding hopsbetween machines. For that purpose, we identify in real-time thecorrelations which appear in the fields of these messages, such ashashtags and their geolocation, for example in the case of tweets. Weuse these correlations to create routing tables which favor theco-location of actors handling these messages.Finally, we present λ-blocks, a novel programming framework to computedata processing jobs without writing code, but rather by creatinggraphs of blocks of code. The framework is fast, and comes withbatteries included: block libraries, plugins, and APIs to extendit. It is also able to manipulate computation graphs, foroptimization, analyzis, verification, or any other purposes.

The main goal of this thesis is to analyze the syntactic structure of determiner phrases in Brazilian Portuguese (BP), under the Principles and Parameters approach in its minimalist version (CHOMSKY, 1995 and subsequent works), focusing on the extraction of arguments and adjuncts introduced by de (of) preposition (de-phrases). The analysis to be developed takes into account Abney s (1987) DP hypothesis and the theoretical perspective that assumes the nominal construction as the reflex of the architecture of the clause structure. The de-phrases are going to be analyzed into two different groups: those which are true genitive constructions (arguments) and those which we are going to refer to as typical adjuncts. As we will make clear throughout the thesis, the group of genitives is generated in argument positions and the second group is generated in adjunction configuration. In what regards the restrictions imposed on extraction of de-phrases, we are going to propose that it can be captured by the unique constraint of Locality, as discussed in Manzini (1994). We are also going to argue that in BP the locus of phi-features (at least in what concerns number features) is the head D (MAGALHÃES, 2004; COSTA & FIGUEIREDOSILVA, 2006) and, once D is the locus for number in this language, this head is responsible for the Case properties of genitives (following similar analysis showed in AVELAR, 2006). Another crucial point of the proposal is the projection of a category FP, above DP, in BP nominal constructions, which plays similar role of the projection TopP proposed in Haegeman (2004). [Spec, FP] is an escape hatch position, not [Spec, DP], the last one an A position, related to Case properties. In relation to adjunction phenomenon, we will assume Hornstein & Nunes s (2008) proposal that adjunction occurs without obligatory labeling, in a similar way that Avelar (2006) proposes adjunction in DPs of BP. Instead of being adjoined in the DP periphery, as stated in Avelar, true nominal adjuncts are adjoined in a projection below DP, fact that explains why typical adjuncts can t be extracted in this language. / Conselho Nacional de Desenvolvimento Científico e Tecnológico / O principal objetivo desta tese é analisar a estrutura sintática dos sintagmas de determinante no Português Brasileiro (PB), dentro do quadro teórico da Teoria de Princípios e Parâmetros, na sua versão Minimalista (CHOMSKY, 1995 e trabalhos subseqüentes), centrando-se no fenômeno da extração de argumentos e adjuntos de nome introduzidos pela preposição de (de-phrases), como um fenômeno submetido a restrições de ordem estrutural. A análise a ser apresentada assume a hipótese DP como proposta em Abney (1987), bem como a perspectiva teórica que tem tratado a arquitetura do sintagma nominal como uma arquitetura que reflete a da sentença. Os de-phrases em contextos nominais serão analisados separadamente em dois grupos: o grupo dos sintagmas genuinamente genitivos e que são manipulados na sintaxe como verdadeiros DPs, aos quais iremos nos referir como sintagmas argumentais, e o grupo a que iremos nos referir como típicos adjuntos adnominais. Conforme iremos mostrar ao longo desta tese, enquanto que os sintagmas do primeiro grupo são licenciados em posições argumentais, o segundo grupo é licenciado em configuração de adjunção. No que concerne às restrições impostas para a extração dos de-phrases, iremos propor que as restrições a serem verificadas podem ser capturadas unicamente pela noção da condição de Localidade, como proposto em Manzini (1994). Ainda, iremos argumentar que, no PB, os traços de concordância (pelo menos no que se refere à concordância de número) parecem estar localizados em D (MAGALHÃES, 2004; COSTA & FIGUEIREDO-SILVA, 2006) e, uma vez que D é lócus de número no PB, esta categoria licencia genitivos em relação a Caso, idéia já presente em Avelar (2006). Em termos de estrutura do DP, outro ponto crucial da análise é a proposta de projeção de uma categoria funcional acima da projeção DP, a qual denominaremos FP, nos moldes em que TopP é uma categoria proposta em Haegeman (2004) no domínio nominal. Conforme iremos discutir, a posição [Spec, FP] é a posição de válvula de escape para de-phrases no PB e não a posição [Spec, DP], esta última, uma posição A, relacionada a propriedades de Caso (genitivo). No que tange ao fenômeno da adjunção dentro de sintagmas de determinante, iremos assumir a proposta de Hornstein & Nunes (2008) de que a adjunção é uma operação que ocorre sem rotulação obrigatória, seguindo a proposta de adjunção de de-phrases no sintagma nominal como apresentada em Avelar (2006), para o PB. A diferença em relação à proposta de Avelar é a de que em vez de serem licenciados na periferia da construção nominal, os típicos adjuntos adnominais são gerados abaixo da projeção DP, o que explica a resistência desses constituintes para extração.

Made available in DSpace on 2016-08-02T21:42:57Z (GMT). No. of bitstreams: 1 Vicente de Paula Candido.pdf: 1880516 bytes, checksum: df70cd0489222b22a51db4181e154cb5 (MD5) Previous issue date: 2009-11-05 / This report brings an analysis of the survival capacity of three small and micro enterprises (SMEs) from the food industry of banana sweets, set in the Metropolitan Region of Baixada Santista, specifically in Itanhaém and Mongaguá cities. These capacities are built based on two assumptions: administration effect and locality effect, which may be crucial for the survival and performance of the SMEs. This research aims to identify the administrative and locality characteristics that influence the survival of the three SMEs studied. To achieve the main target, the following specific objectives were outlined: to identify the administrative characteristics that were propelling for the survival of the three SMEs studied; identifying the locality resources that were propelling for the survival of the three SMEs; verify the existence of other administrative and locality factors that may have influenced for the survival of SMEs in a long term. This study has the expectation of contributing for a further reflection on the issue concerning the survival capacity of small businesses. The bibliographic research was focused in the sequence of theoretical topics in order to build necessary basis about the administrative and locality influences for the survival of small businesses, necessary concepts to achieve the general objective. To achieve the proposed objectives, the research, in descriptive and inductive nature, was developed through a multicase study using documentary and observation researches; semi-structured, preliminary and detailed interviews; having the managers, employees, suppliers and customers from the three SMEs as participants in these processes. The results indicated that there are important factors of the administrative and locality effects influencing the survival of the locus research. Results showed factors such as access to large markets, attitude to technology, the presence of a strong and weak bond and others, considered important influences for the survival of the companies studied. The results open up the perspectives for further studies that could provide and create other alternatives and programs to improve the performance and survival of the SMEs.(AU) / O presente trabalho traz uma análise das capacidades de sobrevivência de três micro e pequenas empresas (MPEs) do ramo alimentício de doces de banana, estabelecidas na Região Metropolitana da Baixada Santista, especificamente nas cidades de Itanhaém e Mongaguá. Essas capacidades se construíram fundamentadas em dois pressupostos: efeito do gestor e o efeito da localidade, que podem ser determinantes para a sobrevivência e o desempenho de MPEs. A pesquisa tem por objetivo geral identificar as características do gestor e os fatores da localidade que influenciam a sobrevivência das três MPEs estudadas. Para alcançar o objetivo geral foram traçados os seguintes objetivos específicos: identificar as características da gestão que foram propulsoras da sobrevivência das três MPEs estudadas; identificar os recursos da localidade que foram propulsores à sobrevivência das três MPEs; verificar a existência de outros fatores da gestão e da localidade que possam ter influenciado a sobrevivência das MPEs no longo prazo. O estudo teve como expectativa contribuir para o aprofundamento da reflexão sobre o tema concernente às capacidades de sobrevivência dos pequenos negócios. A pesquisa bibliográfica esteve centrada no encadeamento de tópicos teóricos de forma a construir fundamentos necessários sobre as influências do gestor e da localidade na sobrevivência das pequenas empresas, noções necessárias para se atingir o objetivo geral. Para alcançar os objetivos propostos, a investigação, de caráter descritivo e indutivo, foi desenvolvida por meio de estudo multicaso, compreendendo pesquisa documental, observações e entrevistas semi-estruturadas, preliminar e de profundidade, tendo como sujeitos os gestores, os funcionários, os fornecedores e os clientes das três MPEs. Os resultados indicam que há fatores importantes do efeito gestor e do efeito localidade influenciando a sobrevivência das empresas locus da pesquisa. Os resultados apontaram fatores como acesso ao amplo mercado, atitude frente à tecnologia, a presença de laço forte e laço fraco, entre outros considerados importantes influenciadores na sobrevivência das empresas estudadas. Os resultados abrem perspectivas de estudos mais aprofundados que possam proporcionar e criar alternativas e programas para melhorar o desempenho e a sobrevivência das MPEs.(AU)

This work is focused at the unemployment analysis in Prachatice and Čestký Krumlov districts in 2010 and considering of the locality impact on active labour market policy efficiency. The work should provide comprehensive view of ways and possibilities to solve unemployment at local labour markets. It should examine suitability of used tools of active labour market policy for particular groups of job applicants and confirm their importance for unemployment cutting, mainly at monitored groups of job applicants which are most endangered in labour market.

Made available in DSpace on 2014-12-17T13:54:47Z (GMT). No. of bitstreams: 1 ElisaPA_DISSERT.pdf: 8387577 bytes, checksum: 26a06cdcefc1eb76b37d5baa53826537 (MD5) Previous issue date: 2010-12-13 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / Since the middle 80 s from the 20th century, some musical genres associated to the Brazilian Northeastern region notably the forr?, coco de embolada and repente de viola have been gradually incorporated to the musical production of south France linked to the occitanista trend, currently linking many musicians and groups from those regions in both countries. This paper is engaged in reflecting on the particular experience of the groups formed by the Escambiar Association, located on the city of Toulouse, and specially the duet Fabulous Trobadors, whose compositions are mostly made in the coco de embolada form. Watching the motivations and the processes that led to the creation of the groups from this association and it s current operation, this study investigates the transcultural phenomenon, that allow to cross two symbolic universes through rationalizing speeches about music, considering the locality s production in the midst of a political debate that involve questions about cultural identity and tradition / A partir de meados da d?cada de 80 do s?c. XX, g?neros atribu?dos ? m?sica do Nordeste brasileiro notadamente o forr?, o coco de embolada e o repente de viola v?m sendo gradativamente incorporados ? produ??o musical de artistas do sul da Fran?a ligados ao movimento occitanista, conectando atualmente v?rios m?sicos e grupos das regi?es referidas dos dois pa?ses. Este trabalho se dedica a refletir sobre a experi?ncia particular dos grupos formados pela Associa??o Escambiar, localizada na cidade de Toulouse, e especialmente a da dupla Fabulous Trobadors, cujas composi??es s?o feitas em grande parte sob forma de cocos de embolada. Observando as motiva??es e os processos que levaram ? cria??o dos grupos desta associa??o e ? sua atua??o no presente, este estudo investiga o fen?meno transcultural que permite cruzar dois universos simb?licos atrav?s de discursos racionalizadores a respeito da m?sica, e leva em conta a produ??o da localidade em meio a um debate pol?tico que envolve quest?es sobre identidade cultural e tradi??o