An important research area in computer vision is parameter estimation. Given a mathematical model and a sample of image measurement data, key parameters are sought to encapsulate geometric properties of a relevant entity. An optimisation problem is often formulated in order to find these parameters. This thesis presents an elaboration of fundamental numerical algorithms for estimating parameters of multi-objective models of importance in computer vision applications. The work examines ways to solve unconstrained and constrained minimisation problems from the view points of theory, computational methods, and numerical performance. The research starts by considering a particular form of multi-equation constraint function that characterises a wide class of unconstrained optimisation tasks. Increasingly sophisticated cost functions are developed within a consistent framework, ultimately resulting in the creation of a new iterative estimation method. The scheme operates in a maximum likelihood setting and yields near-optimal estimate of the parameters. Salient features of themethod are that it has simple update rules and exhibits fast convergence. Then, to accommodate models with functional dependencies, two variant of this initial algorithm are proposed. These methods are improved again by reshaping the objective function in a way that presents the original estimation problem in a reduced form. This procedure leads to a novel algorithm with enhanced stability and convergence properties. To extend the capacity of these schemes to deal with constrained optimisation problems, several a posteriori correction techniques are proposed to impose the so-called ancillary constraints. This work culminates by giving two methods which can tackle ill-conditioned constrained functions. The combination of the previous unconstrained methods with these post-hoc correction schemes provides an array of powerful constrained algorithms. The practicality and performance of themethods are evaluated on two specific applications. One is planar homography matrix computation and the other trifocal tensor estimation. In the case of fitting a homography to image data, only the unconstrained algorithms are necessary. For the problem of estimating a trifocal tensor, significant work is done first on expressing sets of usable constraints, especially the ancillary constraints which are critical to ensure that the computed object conforms to the underlying geometry. Evidently here, the post-correction schemes must be incorporated in the computational mechanism. For both of these example problems, the performance of the unconstrained and constrained algorithms is compared to existing methods. Experiments reveal that the new methods perform with high accuracy to match a state-of-the-art technique but surpass it in execution speed. / Thesis (Ph.D.) - University of Adelaide, School of Mathemtical Sciences, Discipline of Pure Mathematics, 2008

In recent years, attempts to simplify the grammatical mechanisms used in syntax have led to proposals to reduce the relationships between elements in a sentence to relations between heads and complements, doing away with free adjunction. For the analysis of modifying relations one consequence has been the rise of analyses that use the properties of selecting heads to stipulate unexpected syntactic behaviour, such as the use of light verbs to derive transparency in complex verb constructions. This thesis shows that such accounts are empirically inadequate and argues that the relationship between heads and adjuncts provides a more empirically-satisfactory model of modifying relations, such as complex verb constructions, than one restricted to the selection relation between heads and complements in the syntax. In support of the adjunct relation, I show how a modular approach to adjuncts in which the position of adjunction is licensed in the semantics and long-distance dependencies are licensed in the syntax can provide a more unified account of subextraction from two separate types of island configurations, viz. asymmetric subextraction from coordination and subextraction from participial adjuncts, either than analyses involving complementation in the syntax (Borgonovo and Neeleman, 2000; Fabregas and Jiménez-Fernández, 2016; Wiklund, 2007), or hybrid analyses mixing processing filters with syntactic licensing of long-distance dependencies (Truswell, 2009, 2011). The first part of the thesis shows that Chomsky’s (2000; 2001) phase theory gives rise to blackholes in the specifier positions of phases from which movement cannot take place. I provide a theoretical account in terms of feature-licensing, where blackholes are formed by the impossibility of licensing at least one unlicensed feature on a phase head, and show how this account derives the distinction between canonical adjuncts from which subextraction is not permitted and subextraction from single event constructions in which subextraction is permitted. The section speculatively concludes with a demonstration of how blackholes might provide a unified analysis of islandhood in general. The second part of the thesis concentrates on the empirical phenomenon of subextraction from coordination and participial adjuncts. I report the results of a series of judgement experiments run in parallel across two sets of constructions, coordination and participial adjuncts, in three languages, English, German and Norwegian. The aim was to test whether acceptability of subextraction from within coordination and participial adjuncts varied depending on the aspectual or grammatical type of matrix predicate. The results show that acceptability of subextraction does depend on the type of matrix predicate. The crucial factor is intransitivity, partially confirming the bias towards unaccusatives in subextraction from participial adjuncts observed informally in Borgonovo and Neeleman (2000); Fabregas and Jiménez-Fernández (2016); Truswell (2011) whilst providing evidence against theoretical accounts that rely primarily on unaccusativity (Borgonovo and Neeleman, 2000; Fabregas and Jiménez-Fernández, 2016), primarily on aspectual distinctions (Truswell, 2007b) or primarily on agentivity (Truswell, 2009, 2011). Interestingly, the hierarchy in acceptability between the four types of matrix predicates stays constant across all three languages, despite both pseudocoordination and subextraction from within participials being ungrammatical in German.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In a collaborative risk management environment, which the project stakeholders are involved in risk management activities, the identification and analysis of dependencies often is not a simple process to be performed, although to be necessary for more efficient and concise risk management. This work propose an approach for the identification and analysis of direct and causal dependencies between the risks identified in software projects, being this analysis supported by a probabilistic model of Bayesian networks to assist participants during the process. Thus, collaborative risks discussions of software projects can be conducted through an existing discussion system, the RD System. This research includes the adaptation made in the protocol used by the RD System wherein these modifications by making possible the identification and the analysis of risk dependencies collaboratively. As a way to assist and support the process of analyzing the dependencies once identified, a probabilistic model of Bayesian networks is proposed, enabling the participants simulate different scenarios and discuss starts from the results obtained in a collaborative way with the aim of improve the strategies for the treatment of risks of software projects. In order to validate the proposed approach, we present and discuss a case study involving experts in the area and a practical experiment carried out with students from the computing area. The results show clear evidence of acceptance and applicability of the developed approach for to resolve the identification and analysis of risks dependencies in collaborative environments for risk management of software project. / Em um ambiente de gerenciamento colaborativo de riscos, em que as partes interessadas de um projeto estão envolvidas nas atividades de gestão de riscos, muitas vezes a identificação e análise de dependências não é um processo simples de ser realizado, apesar de ser necessário para um gerenciamento de riscos mais eficiente e conciso. Este trabalho propõe uma abordagem para a identificação e análise de dependências causais entre os riscos e causas identificados em projetos de software, sendo esta análise apoiada por um modelo probabilístico de redes Bayesianas para auxiliar os participantes durante o processo. Desta forma, discussões colaborativas de riscos de projetos de software podem ser realizadas por meio de um sistema de discussão já existente, o RD System. Esta pesquisa abrange a adaptação realizada no protocolo utilizado pelo RD System, sendo que estas modificações possibilitam que a identificação e a análise das dependências dos riscos sejam realizadas de forma colaborativa. Como forma de auxiliar e apoiar o processo de análise das dependências uma vez identificadas, um modelo probabilístico de redes Bayesianas é proposto, possibilitando que os participantes simulem diferentes cenários e discutam, a partir dos resultados obtidos de forma colaborativa, com o objetivo de aprimorar as estratégias de tratamento para os riscos de projetos de software. A fim de validar a abordagem proposta, é apresentado e discutido um estudo de caso envolvendo especialistas na área e um experimento prático realizado com alunos da área de computação. Os resultados obtidos apresentam claras evidências de aceitação e aplicabilidade da abordagem desenvolvida para a solução da identificação e análise de dependências de riscos em ambientes colaborativos para gestão de riscos de projetos de software.

The dissertation in general describes the characteristic of socialy pathological phenomene that pupils encounter both at school and at their prevention. The dissertation includes an empirial survey carried out at two select primary schools. The surveyed values have been processed and evaluated. The focus of the survey was to establish the awareness of the pupils and their experience with socially pathological phenomen. The empirial survey further deals with the effects of prevention at the sekond degrese of primary school.

Dans cette thèse , nous proposons d’étudier des questions sur le parallélism de tâche avec dépendance de données dans le cadre de machines multicoeur avec des accélérateurs. La solution proposée a été développée en utilisant l’interface de programmation haute niveau XKaapi du projet MOAIS de l’INRIA Rhône-Alpes. D’abord nous avons étudié des questions liés à une approche d’exécution totalement asyncrone et l’ordonnancement par vol de travail sur des architectures multi-GPU. Le vol de travail avec localité de données a montré des résultats significatifs, mais il ne prend pas en compte des différents ressources de calcul. Ensuite nous avons conçu une interface et une modèle de coût qui permettent d’écrire des politiques d’ordonnancement sur XKaapi. Finalement on a évalué XKaapi sur un coprocesseur Intel Xeon Phi en mode natif. Notre conclusion est double. D’abord nous avons montré que le modèle de programmation data-flow peut être efficace sur des accélérateurs tels que des GPUs ou des coprocesseurs Intel Xeon Phi. Ensuite, le support à des différents politiques d’ordonnancement est indispensable. Les modèles de coût permettent d’obtenir de performance significatifs sur des calculs très réguliers, tandis que le vol de travail permet de redistribuer la charge en cours d’exécution. / Esta tese investiga os desafios no uso de paralelismo de tarefas com dependências de dados em arquiteturas multi-CPU com aceleradores. Para tanto, o XKaapi, desenvolvido no grupo de pesquisa MOAIS (INRIA Rhône-Alpes), é a ferramenta de programação base deste trabalho. Em um primeiro momento, este trabalho propôs extensões ao XKaapi a fim de sobrepor transferência de dados com execução através de operações concorrentes em GPU, em conjunto com escalonamento por roubo de tarefas em multi-GPU. Os resultados experimentais sugerem que o suporte a asincronismo é importante à escalabilidade e desempenho em multi-GPU. Apesar da localidade de dados, o roubo de tarefas não pondera a capacidade de processamento das unidades de processamento disponíveis. Nós estudamos estratégias de escalonamento com predição de desempenho em tempo de execução através de modelos de custo de execução. Desenvolveu-se um framework sobre o XKaapi de escalonamento que proporciona a implementação de diferentes algoritmos de escalonamento. Esta tese também avaliou o XKaapi em coprocessodores Intel Xeon Phi para execução nativa. A conclusão desta tese é dupla. Primeiramente, nós concluímos que um modelo de programação com dependências de dados pode ser eficiente em aceleradores, tais como GPUs e coprocessadores Intel Xeon Phi. Não obstante, uma ferramenta de programação com suporte a diferentes estratégias de escalonamento é essencial. Modelos de custo podem ser usados no contexto de algoritmos paralelos regulares, enquanto que o roubo de tarefas poder reagir a desbalanceamentos em tempo de execução. / In this thesis, we propose to study the issues of task parallelism with data dependencies on multicore architectures with accelerators. We target those architectures with the XKaapi runtime system developed by the MOAIS team (INRIA Rhône-Alpes). We first studied the issues on multi-GPU architectures for asynchronous execution and scheduling. Work stealing with heuristics showed significant performance results, but did not consider the computing power of different resources. Next, we designed a scheduling framework and a performance model to support scheduling strategies over XKaapi runtime. Finally, we performed experimental evaluations over the Intel Xeon Phi coprocessor in native execution. Our conclusion is twofold. First we concluded that data-flow task programming can be efficient on accelerators, which may be GPUs or Intel Xeon Phi coprocessors. Second, the runtime support of different scheduling strategies is essential. Cost models provide significant performance results over very regular computations, while work stealing can react to imbalances at runtime.

Dans cette thèse , nous proposons d’étudier des questions sur le parallélism de tâche avec dépendance de données dans le cadre de machines multicoeur avec des accélérateurs. La solution proposée a été développée en utilisant l’interface de programmation haute niveau XKaapi du projet MOAIS de l’INRIA Rhône-Alpes. D’abord nous avons étudié des questions liés à une approche d’exécution totalement asyncrone et l’ordonnancement par vol de travail sur des architectures multi-GPU. Le vol de travail avec localité de données a montré des résultats significatifs, mais il ne prend pas en compte des différents ressources de calcul. Ensuite nous avons conçu une interface et une modèle de coût qui permettent d’écrire des politiques d’ordonnancement sur XKaapi. Finalement on a évalué XKaapi sur un coprocesseur Intel Xeon Phi en mode natif. Notre conclusion est double. D’abord nous avons montré que le modèle de programmation data-flow peut être efficace sur des accélérateurs tels que des GPUs ou des coprocesseurs Intel Xeon Phi. Ensuite, le support à des différents politiques d’ordonnancement est indispensable. Les modèles de coût permettent d’obtenir de performance significatifs sur des calculs très réguliers, tandis que le vol de travail permet de redistribuer la charge en cours d’exécution. / Esta tese investiga os desafios no uso de paralelismo de tarefas com dependências de dados em arquiteturas multi-CPU com aceleradores. Para tanto, o XKaapi, desenvolvido no grupo de pesquisa MOAIS (INRIA Rhône-Alpes), é a ferramenta de programação base deste trabalho. Em um primeiro momento, este trabalho propôs extensões ao XKaapi a fim de sobrepor transferência de dados com execução através de operações concorrentes em GPU, em conjunto com escalonamento por roubo de tarefas em multi-GPU. Os resultados experimentais sugerem que o suporte a asincronismo é importante à escalabilidade e desempenho em multi-GPU. Apesar da localidade de dados, o roubo de tarefas não pondera a capacidade de processamento das unidades de processamento disponíveis. Nós estudamos estratégias de escalonamento com predição de desempenho em tempo de execução através de modelos de custo de execução. Desenvolveu-se um framework sobre o XKaapi de escalonamento que proporciona a implementação de diferentes algoritmos de escalonamento. Esta tese também avaliou o XKaapi em coprocessodores Intel Xeon Phi para execução nativa. A conclusão desta tese é dupla. Primeiramente, nós concluímos que um modelo de programação com dependências de dados pode ser eficiente em aceleradores, tais como GPUs e coprocessadores Intel Xeon Phi. Não obstante, uma ferramenta de programação com suporte a diferentes estratégias de escalonamento é essencial. Modelos de custo podem ser usados no contexto de algoritmos paralelos regulares, enquanto que o roubo de tarefas poder reagir a desbalanceamentos em tempo de execução. / In this thesis, we propose to study the issues of task parallelism with data dependencies on multicore architectures with accelerators. We target those architectures with the XKaapi runtime system developed by the MOAIS team (INRIA Rhône-Alpes). We first studied the issues on multi-GPU architectures for asynchronous execution and scheduling. Work stealing with heuristics showed significant performance results, but did not consider the computing power of different resources. Next, we designed a scheduling framework and a performance model to support scheduling strategies over XKaapi runtime. Finally, we performed experimental evaluations over the Intel Xeon Phi coprocessor in native execution. Our conclusion is twofold. First we concluded that data-flow task programming can be efficient on accelerators, which may be GPUs or Intel Xeon Phi coprocessors. Second, the runtime support of different scheduling strategies is essential. Cost models provide significant performance results over very regular computations, while work stealing can react to imbalances at runtime.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-05-15T13:55:22Z No. of bitstreams: 1 milenecristinedecastroteixeiralaguardia.pdf: 2174544 bytes, checksum: 2efb54d1db55344c6cc5db2a04382473 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-05-17T15:59:07Z (GMT) No. of bitstreams: 1 milenecristinedecastroteixeiralaguardia.pdf: 2174544 bytes, checksum: 2efb54d1db55344c6cc5db2a04382473 (MD5) / Made available in DSpace on 2017-05-17T15:59:07Z (GMT). No. of bitstreams: 1 milenecristinedecastroteixeiralaguardia.pdf: 2174544 bytes, checksum: 2efb54d1db55344c6cc5db2a04382473 (MD5) Previous issue date: 2016-11-03 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Este estudo diz respeito às etapas iniciais da aquisição lexical, focalizando a capacidade de o bebê identificar, abstrair e generalizar padrões de dependências não-adjacentes (DNAs) nos enunciados linguísticos e de usá-los na categorização inicial de elementos do léxico. Nossa tese é que o estabelecimento de relações entre elementos de DNAs é parte da etapa inicial de aquisição lexical e que, para tal estabelecimento, além de habilidades perceptuais, faz-se necessário o uso de habilidades computacionais – de manipulação de símbolos através de algoritmos – que torne possíveis (i) o reconhecimento e a identificação de elementos interrelacionados, que se apresentam em configuração de DNAs, e (ii) a abstração e generalização desses padrões a novos estímulos. DNAs são definidas como a co-ocorrência de marcadores morfossintáticos e/ou fonológicos, com material interveniente. Elegeram-se as DNAs como objeto de estudo por serem altamente frequentes nas línguas naturais e expressarem relações morfossintáticas (p.ex., concordância verbal, nominal de gênero e/ou de número etc.). Trabalhos com línguas artificiais (SAFFRAN et al 1996; GOMEZ et al. 2006; GOMEZ & MAYE, 2005; GOMEZ & LAKUSTA, 2004; LANGUS et al 2012 ; VAN DEN BOS et al 2012) sustentam que habilidades estatísticas e probabilísticas, de domínio geral, subjazem ao tratamento de DNAs por bebês e adultos. Nossa hipótese, em consonância com Marcus et al. (1999) e Peña et al. (2002), é que tais habilidades, sozinhas, não dão conta do tratamento de DNAs em língua natural e, portanto, bebês recorrem tanto a mecanismos gerais quanto a mecanismos computacionais/simbólicos, especificamente linguísticos, na aquisição de uma língua. Duas atividades experimentais foram desenvolvidas, com os seguintes objetivos específicos: (i) investigar se em ambiente prosódico determinado – alinhadas à fronteiras de sintagmas fonológicos – DNAs seriam mais facilmente percebidas por bebês do que em ambientes em que estão distantes de fronteiras fonológicas (Experimento 1 – participantes: bebês canadenses e bebês brasileiros, com média de idade de 11 meses); (ii) investigar se bebês são capazes de categorizar linguisticamente os elementos do léxico a partir do reconhecimento, abstração e generalização de DNAs (Experimento 2- participantes: bebês brasileiros, com média de idade de 11 meses). Nossos resultados são discutidos a partir de uma abordagem mista/integrada, que assume habilidades gerais e especificamente linguísticas no tratamento de enunciados pelo bebê durante o processo inicial de aquisição (GERVAIN & MEHLER, 2010; ENDRESS, NESPOR & MEHLER, 2009) e na hipótese do Bootstrapping prosódico (MORGAN & DEMUTH, 1996; CHRISTOPHE et al., 1997, 2008) e indicam que um ambiente prosódico específico (presença de fronteiras de sintagmas fonológicos) favorece o reconhecimento, abstração e generalização de DNAs e que estas favorecem a categorização inicial de itens do léxico. / This study investigates the initial stages of language acquisition by focusing on infant’s ability to identify, abstract and generalize non adjacent dependency (NAD) patterns in linguistic stimuli and also use them in initial word categorization. NAD is defined as the cooccurrence of morphosyntactic and/or phonological markers over one (or more) intervening element. Our thesis is that the identification of NAD relationships is part of initial lexical acquisition. Infants use perceptual and computational abilities in order to (i) recognize the related terms which appears in NAD configuration, and (ii) abstract and generalize these patterns to new stimuli. NAD was chosen as focus of this study since they are highly frequent elements in natural languages and they express morphosyntactic agreement ( verbal and noun ones). Research on NAD learning using artificial languages argue that statistical and probabilistic abilities, which belong to general cognitive domains, underlie the NAD treatment by infants and adults (SAFFRAN et al 1996; GOMEZ et al. 2006; GOMEZ & MAYE, 2005; GOMEZ & LAKUSTA, 2004; LANGUS et al 2012 ; VAN DEN BOS et al 2012). Our hypothesis, according to Marcus et al. (1999) e Peña et al. (2002), is that infants use as domain general mechanisms as well computational/symbolic, domain specific mechanisms are also necessary to NAD learning. Two experiments were conducted in order to: (i) explore if NAD in a specific prosodic context – aligned to phonological phrase boundary – are better perceived by 11-month-old infants than when they are far from a phonological phrase boundary (Experiment 1 – Canadian and Brazilian infants; (ii) to explore if 11-month-old infants can track and represent NAD at an abstract level and use them to categorize novel content words (Experiment 2 – Brazilian infants. Our results suggest that NAD aligned to prosodic phrase boundaries facilitate its recognition, abstraction and generalization and that abstract level representation of NAD promotes the initial word categorization. Taken together, our results are consistent with the prosodic bootstrapping hypothesis (MORGAN & DEMUTH, 1996; CHRISTOPHE et al., 1997, 2008) and lend support to an integrated approach with assumes that general and specific domain abilities are necessary for language acquisition (GERVAIN & MEHLER, 2010; ENDRESS, NESPOR & MEHLER, 2009).

Dynamic analysis of binary files is an area of computer science that has many purposes. It is useful when it comes to debugging software in a development environment and the developer needs to know which statements affected the value of a specific variable. But it is also useful when analyzing a software for potential vulnerabilities, where data controlled by a malicious user could potentially result in the software executing adverse commands or executing malicious code. In this thesis a tool has been developed to perform dynamic analysis of x86 binaries in order to generate dynamic control-dependence graphs over the execution. These graphs can be used to determine which conditional statements that resulted in a certain outcome. The tool has been developed for x86 Linux systems using the dynamic binary instrumentation framework PIN, developed and maintained by Intel. Techniques for utilizing the additional information about the control flow for a program available during the dynamic analysis in order to improve the control flow information have been implemented and tested. The basic theory of dynamic analysis as well as dynamic slicing is discussed, and a basic overview of the implementation of a dynamic analysis tool is presented. The impact on the performance of the dynamic analysis tool for the techniques used to improve the control flow graph is significant, but approaches to improving the performance are discussed.

Software systems in the automotive domain are generally safety critical and subject to strict timing requirements. Systems of this character are often constructed utilizing periodically executed tasks, that have a hard deadline. In addition, these systems may have additional deadlines that can be specified on cause-effect chains, or simply task chains. They are defined by existing tasks in the system, hence the chains are not stand alone additions to the system. Each chain provide an end-to-end timing constraint targeting the propagation of data through the chain of tasks. These constraints specify the additional timing requirements that need to be fulfilled, when searching for a valid schedule. In this thesis, an offline non-preemptive scheduling method is presented, designed for single core systems. The scheduling problem is defined and formulated utilizing Constraint Programming. In addition, to ensure that end-to-end timing requirements are met, job-level dependencies are considered during the schedule generation. Utilizing this approach can guarantee that individual task periods along with end-to-end timing requirements are always met, if a schedule exists. The results show a good increase in schedulability ratio when utilizing job-level dependencies compared to the case where job-level dependencies are not specified. When the system utilization increases this improvement is even greater. Depending on the system size and complexity the improvement can vary, but in many cases it is more than double. The scheduling generation is also performed within a reasonable time frame. This would be a good benefit during the development process of a system, since it allows fast verification when changes are made to the system. Further, the thesis provide an overview of the entire process, starting from a system model and ending at a fully functional schedule executing on a hardware platform.

Les maladies auto-immunes et systémiques sont des maladies sur lequel le champ de la recherche pose son œil de façon appuyée depuis 15 ans, du fait de l’émergence de thérapies biologiques ciblées. Ces pathologies sont volontiers hétérogènes, au mieux de fréquence ou caractéristiques particulières dans les populations d’origine Africaine. La connaissance de l’épidémiologie, et des caractéristiques de ces maladies est un préalable essentiel à la mise en place de recherche plus fondamentale pour aider à décomposer leurs physiopathologies souvent extrêmement complexes. En effet, la comparaison de différences marquées entre deux expressions dans des populations différentes d’une même maladie peut permettre d’aider à en dénouer le fil. Nous proposons dans ce travail une estimation des caractéristiques du lupus cutané et du lupus systémique en Guyane Française qui retrouve une faible fréquence de la maladie, la plus faible jamais retrouvée dans une population subsaharienne. Nous décrivons en Martinique sur le plan épidémiologique comme clinique une forme rare de myosite appelée syndrome des anti-synthétases semblant très particulière, l’épidémiologie et la description de la maladie de Kikuchi-Fujimoto pour la première fois dans la littérature, l’épidémiologie et les caractéristiques à base de population de la maladie de Behcet, des principales vascularites (périartérite noueuse, micropolyangéite, granulomatose éosinophile avec polyangéite, granulomatose avec polyangéite), de l’hypertension pulmonaire des connectivites qui semblent plus fréquentes que chez les Européens. Les néphropathies du lupus systémiques sont décrites dans la population Guadeloupéenne montrant une grande fréquence des néphropathies prolifératives. Le protocole EUROLUPUS qui permet le traitement de ces néphropathies prolifératives du lupus systémique avec de faibles doses de cyclophosphamide et de corticoïdes, est évalué en Martinique sur 30 patients alors qu’il ne l’a jamais été dans une population d’origine Africaine. Il semble y être aussi efficace que chez les patients d’origine Européenne, alors que les néphropathies y ont un pronostic meilleur. La maladie de Sjögren primaire est décrite en Martinique très proche de ce qu’on trouve en Europe sur le plan du tableau clinique et évolutif alors que cela n’est l’objet d’aucune étude dans une population d’origine noire Africaine. Nous avons par ailleurs montré en Martinique l’amélioration de la prise en charge du lupus systémique en Martinique au travers de la régression au fil du temps d’une des complications de la corticothérapie les plus pénibles pour les patients, l’ostéonécrose aseptique. La sclérodermie systémique est décrite à base de population avec épidémiologie dans les deux départements de Guadeloupe et Martinique, montrant des caractéristiques proches de celles retrouvées chez les AfroAméricains. Nous avons aussi montré la fréquence et la gravité des atteintes ORL des myopathies inflammatoires sur ces 2 départements avec une fréquence inhabituelle de certaines maladies auto-immunes dont le lupus systémique et les myosites inflammatoires associées aux anticorps anti-SRP, et l’absence de myosite à inclusion. Au total, nous apportons une somme de connaissance descriptive de ces maladies auto-immunes et systémiques permettant la mise en place de recherches plus fondamentales avec des bases solides par rapport aux profils hétérogènes de ces maladies. / Auto-immunes and systemic diseases are priorities for researchers since 15 years. This is related to the emergence of biological therapies, associated to great efficacy. Although, these diseases are heterogeneous, depending of different parameters such as ethnicity or geography. In the African descent population, we encounter unusual or particular manifestations of these diseases. Also, the knowledge of epidemiology and population based descriptions are crucial to properly initiate works on these populations, but also to understand a particularly complex physiopathology by using differences between populations. We describe in this work the population based characteristics of pure cutaneous lupus and systemic lupus, including an epidemiology of the incidence of the lowest incidence ever found in a population of African heritage. We also describe a population based series of anti-synthetase syndrome, confirming that the presentation is totally different compared to caucasians, and allows in Martinique the incidence, never explored before. We also provide the first evaluation of Kikuchi-Fujimoto disease in a population of African origin, and the first incidence ever realized. We do the same evaluation of the epidemiology of Behcet’s disease in a black origin population that shows that this disease was at a similar frequency in Martinique and in Europe. Micropolyangeitis, polyarteritis, eosinophilic granulomatosis with polyangeitis and Granulomatosis with polyangeitis were evaluated in an epidemiologic study in Martinique, with addition of some cases from other French American region for a more powerful characteristics description. These diseases seem less frequent than in Europe, associated with less severity except for micropolyangeitis. EUROLUPUS, a protocol with low dose IV cyclophosphamide and low dose steroids, used to treat proliferative nephritis of systemic lupus is shown to have the same efficacy in Martinique than in patients of European origin. Primary Sjögren syndrome, evaluated in Martinique, is very similar in expression than what is found in Europe. The decrease overtime of aseptic osteonecrosis, a steroid side effect, is a witness of better control of systemic lupus activity with less usage permitted by protocols and new immunosuppressive drugs such as mycophenolate. Systemic sclerosis is described as very close to African American in a population based study in Martinique and Guadeloupe. We finally show that the rare ENT involvement of idiopathic inflammatory myositis is frequent in our population, associated with poor outcome, and surprisingly frequently related to systemic lupus and necrotizing myositis associated to SRP antibody but not to inclusion body myositis. To conclude, we allow an amount of description of these diseases in our region, including pioneer studies. This works tends to be the basis for studies to be continued in a more fundamental way in our countries.