With the advent of the Semantic Web and Semantic Technologies, ontologies have become one of the most prominent paradigms for knowledge representation and reasoning. The popular ontology language OWL, based on description logics, became a W3C recommendation in 2004 and a standard for modelling ontologies on the Web. In the meantime, many studies and applications using OWL have been reported in research and industrial environments, many of which go beyond Internet usage and employ the power of ontological modelling in other fields such as biology, medicine, software engineering, knowledge management, and cognitive systems. However, recent progress in the field faces a lack of well-structured ontologies with large amounts of instance data due to the fact that engineering such ontologies requires a considerable investment of resources. Nowadays, knowledge bases often provide large volumes of data without sophisticated schemata. Hence, methods for automated schema acquisition and maintenance are sought. Schema acquisition is closely related to solving typical classification problems in machine learning, e.g. the detection of chemical compounds causing cancer. In this work, we investigate both, the underlying machine learning techniques and their application to knowledge acquisition in the Semantic Web. In order to leverage machine-learning approaches for solving these tasks, it is required to develop methods and tools for learning concepts in description logics or, equivalently, class expressions in OWL. In this thesis, it is shown that methods from Inductive Logic Programming (ILP) are applicable to learning in description logic knowledge bases. The results provide foundations for the semi-automatic creation and maintenance of OWL ontologies, in particular in cases when extensional information (i.e. facts, instance data) is abundantly available, while corresponding intensional information (schema) is missing or not expressive enough to allow powerful reasoning over the ontology in a useful way. Such situations often occur when extracting knowledge from different sources, e.g. databases, or in collaborative knowledge engineering scenarios, e.g. using semantic wikis. It can be argued that being able to learn OWL class expressions is a step towards enriching OWL knowledge bases in order to enable powerful reasoning, consistency checking, and improved querying possibilities. In particular, plugins for OWL ontology editors based on learning methods are developed and evaluated in this work. The developed algorithms are not restricted to ontology engineering and can handle other learning problems. Indeed, they lend themselves to generic use in machine learning in the same way as ILP systems do. The main difference, however, is the employed knowledge representation paradigm: ILP traditionally uses logic programs for knowledge representation, whereas this work rests on description logics and OWL. This difference is crucial when considering Semantic Web applications as target use cases, as such applications hinge centrally on the chosen knowledge representation format for knowledge interchange and integration. The work in this thesis can be understood as a broadening of the scope of research and applications of ILP methods. This goal is particularly important since the number of OWL-based systems is already increasing rapidly and can be expected to grow further in the future. The thesis starts by establishing the necessary theoretical basis and continues with the specification of algorithms. It also contains their evaluation and, finally, presents a number of application scenarios. The research contributions of this work are threefold: The first contribution is a complete analysis of desirable properties of refinement operators in description logics. Refinement operators are used to traverse the target search space and are, therefore, a crucial element in many learning algorithms. Their properties (completeness, weak completeness, properness, redundancy, infinity, minimality) indicate whether a refinement operator is suitable for being employed in a learning algorithm. The key research question is which of those properties can be combined. It is shown that there is no ideal, i.e. complete, proper, and finite, refinement operator for expressive description logics, which indicates that learning in description logics is a challenging machine learning task. A number of other new results for different property combinations are also proven. The need for these investigations has already been expressed in several articles prior to this PhD work. The theoretical limitations, which were shown as a result of these investigations, provide clear criteria for the design of refinement operators. In the analysis, as few assumptions as possible were made regarding the used description language. The second contribution is the development of two refinement operators. The first operator supports a wide range of concept constructors and it is shown that it is complete and can be extended to a proper operator. It is the most expressive operator designed for a description language so far. The second operator uses the light-weight language EL and is weakly complete, proper, and finite. It is straightforward to extend it to an ideal operator, if required. It is the first published ideal refinement operator in description logics. While the two operators differ a lot in their technical details, they both use background knowledge efficiently. The third contribution is the actual learning algorithms using the introduced operators. New redundancy elimination and infinity-handling techniques are introduced in these algorithms. According to the evaluation, the algorithms produce very readable solutions, while their accuracy is competitive with the state-of-the-art in machine learning. Several optimisations for achieving scalability of the introduced algorithms are described, including a knowledge base fragment selection approach, a dedicated reasoning procedure, and a stochastic coverage computation approach. The research contributions are evaluated on benchmark problems and in use cases. Standard statistical measurements such as cross validation and significance tests show that the approaches are very competitive. Furthermore, the ontology engineering case study provides evidence that the described algorithms can solve the target problems in practice. A major outcome of the doctoral work is the DL-Learner framework. It provides the source code for all algorithms and examples as open-source and has been incorporated in other projects.

Submitted by Ronildo Prado (ronisp@ufscar.br) on 2017-08-08T20:30:11Z No. of bitstreams: 1 DissMVRL.pdf: 2179441 bytes, checksum: 3c4089c4b24a3d98521f8561c6f2c515 (MD5) / Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-08-08T20:30:33Z (GMT) No. of bitstreams: 1 DissMVRL.pdf: 2179441 bytes, checksum: 3c4089c4b24a3d98521f8561c6f2c515 (MD5) / Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-08-08T20:30:39Z (GMT) No. of bitstreams: 1 DissMVRL.pdf: 2179441 bytes, checksum: 3c4089c4b24a3d98521f8561c6f2c515 (MD5) / Made available in DSpace on 2017-08-08T20:31:24Z (GMT). No. of bitstreams: 1 DissMVRL.pdf: 2179441 bytes, checksum: 3c4089c4b24a3d98521f8561c6f2c515 (MD5) Previous issue date: 2016-03-03 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Inductive Decision Trees (DT) are mechanisms based on the symbolic paradigm of machine learning which main characteristics are easy interpretability and low computational cost. Though they are widely used, the DTs can represent problems with just discrete or continuous variables. However, for some problems, the variables are not well represented in this way. In order to improve DTs, the Fuzzy Decision Trees (FDT) were developed, adding the ability to deal with fuzzy variables to the Inductive Decision Trees, making them capable to deal with imprecise knowledge. In this text, it is presented a new algorithm for fuzzy decision trees induction. Its fuzification method is applied during the induction and it is inspired by the C4.5’s partitioning method for continuous attributes. The proposed algorithm was tested with 20 datasets from UCI repository (LICHMAN, 2013). It was compared with other three algorithms that implement different solutions to classification problem: C4.5, which induces an Inductive Decision Tree, FURIA, that induces a Rule-based Fuzzy System and FuzzyDT, which induces a Fuzzy Decision Tree where the fuzification is done before tree’s induction is performed. The results are presented in Chapter 4. / As Árvores de Decisão Indutivas (AD) são um mecanismo baseado no paradigma simbólico do Aprendizado de Máquina que tem como principais características a fácil interpretabilidade e baixo custo computacional. Ainda que sejam amplamente utilizadas, as ADs são limitadas à representação de problemas cujas variáveis são do tipo discreto ou contínuo. No entanto, para alguns tipos de problemas, pode haver variáveis que não são bem representadas por estes formatos. Diante deste contexto, foram criadas as Árvores de Decisão Fuzzy (ADF), que adicionam à interpretabilidade das Árvores de Decisão Indutivas, a capacidade de lidar com variáveis fuzzy, as quais representam adequadamente conhecimentos imprecisos. Neste texto, apresentamos o trabalho desenvolvido durante o mestrado, que tem como principal resultado um novo algoritmo para indução de Árvores de Decisão Fuzzy, cujo método de fuzificação dos atributos contínuos é realizado durante a indução da árvore e foi inspirado no método de particionamento de atributos contínuos adotado pelo C4.5. Para validação do algoritmo, foram realizados testes com 20 conjuntos de dados do repositório UCI (LICHMAN, 2013) e o algoritmo foi comparado com outros três algoritmos que abordam o problema de classificação por meio de técnicas diferentes: o C4.5 que induz uma Árvore de Decisão Indutiva, o FURIA, que induz um Sistema Fuzzy Baseado em Regras, porém não segue a estrutura de árvore e o FuzzyDT que induz uma Árvore de Decisão fuzzy realizando a fuzificação dos atributos contínuos antes da indução da árvore. Os resultados dos experimentos realizados são apresentados e discutidos no Capítulo 4 deste texto.

Afin d’améliorer les performances électriques dans les circuits intégrés en 3D, une large modélisation électromagnétique et une caractérisation haute fréquence sont requises. Cela a pour but de quantifier et prédire les phénomènes de couplage par le substrat qui peuvent survenir dans ces circuits intégrés. Ces couplages sont principalement dus aux nombreuses interconnexions verticales par unité de volume qui traversent le silicium et que l’on nomme « Through Silicon Vias » (TSV).L’objectif de cette thèse est de proposer des règles d’optimisation des performances, à savoir la minimisation des effets de couplage par les substrats en RF. Pour cela, différentes configurations de structures de test utilisées pour analyser le couplage sont caractérisées.Les caractérisations sont effectuées sur un très large spectre de fréquence. Les paramètres d’analyse sont les épaisseurs du substrat, les architectures des vias traversant (diamètres, densités, types de barrières), ainsi que la nature des matériaux utilisés. Des modèles électriques permettant de prédire les phénomènes de couplage sont extraits. Différents outils pour l’analyse de ces effets, sont développés dans notre laboratoire. Parallèlement un important travail de modélisation 3D est mené de façon à confronter mesure et simulation et valider nos résultats. Des stratégies d’optimisation pour réduire ces phénomènes dans les circuits 3D ont été proposées, ce qui a permis de fournir de riches informations aux designers. / In order to improve the electrical performance in 3D integrated circuits, a large electromagnetic modeling and a high frequency characterization are required. This has for goal to quantifiy and predicts the substrate coupling phenomena that can occur in these integrated circuits. These couplings are mainly due to the numerous vertical interconnections existing in a small volume and passing through the silicon, and so called “Through Silicon Vias” (TSV). The objective of this thesis is to propose rules for electrical performance optimization, in order to minimize the coupling effects in RF substrates. For this reason, different test structures configurations used to analyze the coupling are characterized.The characterizations are performed on a very wide frequency spectrum. The analysis parameters are the thicknesses of the substrate, the TSV architectures (diameters, densities, types of barriers), and the nature of the used materials. Electrical models for predicting the coupling phenomena are extracted. Different tools for the analysis of these effects are developed in our laboratory. At the same time, a considerable amount of 3D modeling is conducted to compare measurements with simulations and validate our results. Optimization strategies to reduce coupling phenomena in 3D circuits have been proposed; this has provided a wealth of information to designers.

Summary in German and English / Die Arbeit untersucht aus interdisziplinärer Perspektive, wie das christliche Profil der (Gemeinwesen-) Diakonie dargestellt wird, welche Herausforderungen sich daraus ergeben und in welchem Bezug Mission dazu steht. Hierzu dienen die geschichtlichen Entwicklungen von Diakonie und Mission innerhalb Deutschlands und die Ausführung des ganzheitlichen Missionsverständnisses nach David J. Bosch als Grundlage. Die Arbeit zeigt, dass in der Verbindung von Theologie, Diakonie und der Sozialen Arbeit wesentliche Grundannahmen und -spannungen gegeben sind, die Parallelen zur Missionstheologie aufzeigen, welche aber nicht als ‚Mission’ benannt oder anerkannt werden.Das Ergebnis dieser Forschungsarbeit lautet, dass die missionarisch ganzheitlich verstandene Gemeinwesendiakonie einen Ausweg aus der mangelnden Praxisrelevanz theologischer Leitbilder darstellt und somit einen Beitrag zur Stärkung des christlichen Profils diakonischer Einrichtungen liefern kann. / Using an interdisciplinary perspective, this piece of work examines how the Christian profile of diaconal community work is portrayed, the challenges that emerge and how missionary work relates to the debate. The historical developments of social work and missionary work in Germany, as well as David J. Bosch’s holistic understanding of mission serve as a foundation for the analysis. The study will show that the relationship between theology, diaconal community work and social work reveals major assumptions and tensions which show parallel elements to a theology of mission but are not named or acknowledged as such. The conclusion of this study will state that diaconal community work, understood as holistic mission, can offer a solution to the decreasing relevance of theological mission statements and therefore contribute to strengthening the Christian profile of diaconal institutions. / Christian Spirituality, Church History and Missiology / M. Th. (Missiology)

The author strongly holds- in the thesis- that the Theology of liberation can inspi re the poor of South Africa to uproot the post-1994 socio-economic and political evil structures which continue unabated to impoverish them. The introductory chapter studies the reasons which motivated the author to write the thesis. It further discusses the method, the format and the limitations of the thesis. Chapter one focuses on the author's understanding of the Theology of liberation, and its historical background. Chapter two discusses the relationship between the Theology of Liberation and black theology, while chapter three contemplates on the possibility of the creation of what the author calls, An African Theology of Liberation. Chapter four studies the relationship between the Theology of liberation and the Social Teachings of the Catholic Church as taught by the pope and his council. The study of this relationship is extremely difficult because of the on-going, and seemingly insurmountable ideological differences between the two parties. The author suggests, as a solutio n, that each party seriously considers and recognizes the contextual limitations of its theology. Chapter five focuses on the implementation of the Theology of Liberat ion into the South African situation. The author highly recommends the inclusion of the veneration of the ancestors of Africa, as a perfect instrument by means of which the Theology of Liberation can succeed in achieving one of its major aims, which is to convert the poor to be leaders of their own liberation. The concluding chapter suggests concrete ways through which the Theology of Liberation can be kept alive and relevant within the South African situation. / Philosophy, Practical and Systematic Theology / D. Th. (Theological Ethics)

Made available in DSpace on 2014-06-11T19:22:31Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-05-24Bitstream added on 2014-06-13T19:27:59Z : No. of bitstreams: 1 raniel_t_me_ilha.pdf: 1815527 bytes, checksum: 2b9558bcbd56601c8cbb627feda891cf (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / A automação de esteiras rolantes é algo comum e importante em sistemas industriais, mas problemas práticos ainda representam desafios. Um dos desses desafios é manter a precisão em sistemas que exigem paradas sistemáticas, pois folgas mecânicas tendem a provocar variações nas posições de paradas ao longo do tempo. A aplicação de motores de indução têm se tornado comum e soluções eficientes e de baixo custo têm sido pesquisadas. Neste trabalho foi desenvolvido e implementado um sistema de controle de posição e velocidade aplicado em esteiras transportadoras utilizando inversor de frequência, microcontrolador, encoder óptico incremental e sensor indutivo. O movimento da esteira transportadora é efetuado por um motor de indução trifásico, que é acionado pelo conjunto microcontrolador – inversor de frequência. Este conjunto impõe uma frequência no estator do motor através de uma troca de mensagens entre microcontrolador e inversor de frequência (Sistema Mestre-Escravo). Para o envio e recebimento das mensagens, utilizou-se o protocolo de comunicação serial USS® (Universal Serial Interface Protocol) através do padrão RS-485. Os controles de posição e velocidade de rotação do eixo do motor fundamentam-se no sinal gerado pelo encoder óptico incremental, responsável por informar a posição do eixo do motor ao longo da trajetória, e no sensor indutivo que determina uma referência externa importante para a esteira transportadora. Para o funcionamento automático da esteira, elaborou-se um software em linguagem de programação C. Como resultado obteve-se um sistema de controle de posição e velocidade do eixo do motor de indução trifásico que apresenta bons resultados / Automated conveyors system have been largely used in industrial applications. However, there are still practical issues to be overcome. One of them is due to the system mechanical limitation which can lead to low accuracy for applications based on “stop-and-go” movements. Induction motors have been largely used in such applications and low costs solutions have been searched. In this work it was developed and implemented a system of positioning and velocity control applied to conveyors which is based on frequency inverter, microcontroller, optical incremental encoder and inductive sensor. The conveyor’s movement is made by means of a three-phase induction motor, which is driven by the couple microcontroller–frequency inverter. There are messages exchange between the microcontroller and the frequency inverter (Master – Slave configuration) which is based on the communication serial protocol USS through the RS-485 standard. The position and velocity of the motor spindle are controlled using an optical incremental encoder, which is responsible to provide the position of the trajectory, and an inductive sensor which determines the initial reference to the conveyor. The software used to control the system was developed in C language. The results show a low cost system with good results

Submitted by Nayara Passos (nayara.passos@ufpe.br) on 2015-03-13T12:33:46Z No. of bitstreams: 2 TESE Rinaldo José de Lima.pdf: 8678943 bytes, checksum: e88c290e414329ee00d2d6a35a466de0 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Approved for entry into archive by Daniella Sodre (daniella.sodre@ufpe.br) on 2015-03-13T13:16:54Z (GMT) No. of bitstreams: 2 TESE Rinaldo José de Lima.pdf: 8678943 bytes, checksum: e88c290e414329ee00d2d6a35a466de0 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Made available in DSpace on 2015-03-13T13:16:54Z (GMT). No. of bitstreams: 2 TESE Rinaldo José de Lima.pdf: 8678943 bytes, checksum: e88c290e414329ee00d2d6a35a466de0 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2014 / CNPq, CAPES. / Information Extraction (IE) consists in the task of discovering and structuring information found in a semi-structured or unstructured textual corpus. Named Entity Recognition (NER) and Relation Extraction (RE) are two important subtasks in IE. The former aims at finding named entities, including the name of people, locations, among others, whereas the latter consists in detecting and characterizing relations involving such named entities in text. Since the approach of manually creating extraction rules for performing NER and RE is an intensive and time-consuming task, researchers have turned their attention to how machine learning techniques can be applied to IE in order to make IE systems more adaptive to domain changes. As a result, a myriad of state-of-the-art methods for NER and RE relying on statistical machine learning techniques have been proposed in the literature. Such systems typically use a propositional hypothesis space for representing examples, i.e., an attribute-value representation. In machine learning, the propositional representation of examples presents some limitations, particularly in the extraction of binary relations, which mainly demands not only contextual and relational information about the involving instances, but also more expressive semantic resources as background knowledge. This thesis attempts to mitigate the aforementioned limitations based on the hypothesis that, to be efficient and more adaptable to domain changes, an IE system should exploit ontologies and semantic resources in a framework for IE that enables the automatic induction of extraction rules by employing machine learning techniques. In this context, this thesis proposes a supervised method to extract both entity and relation instances from textual corpora based on Inductive Logic Programming, a symbolic machine learning technique. The proposed method, called OntoILPER, benefits not only from ontologies and semantic resources, but also relies on a highly expressive relational hypothesis space, in the form of logical predicates, for representing examples whose structure is relevant to the information extraction task. OntoILPER automatically induces symbolic extraction rules that subsume examples of entity and relation instances from a tailored graph-based model of sentence representation, another contribution of this thesis. Moreover, this graph-based model for representing sentences also enables the exploitation of domain ontologies and additional background knowledge in the form of a condensed set of features including lexical, syntactic, semantic, and relational ones. Differently from most of the IE methods (a comprehensive survey is presented in this thesis, including the ones that also apply ILP), OntoILPER takes advantage of a rich text preprocessing stage which encompasses various shallow and deep natural language processing subtasks, including dependency parsing, coreference resolution, word sense disambiguation, and semantic role labeling. Further mappings of nouns and verbs to (formal) semantic resources are also considered. OntoILPER Framework, the OntoILPER implementation, was experimentally evaluated on both NER and RE tasks. This thesis reports the results of several assessments conducted using six standard evaluationcorpora from two distinct domains: news and biomedical. The obtained results demonstrated the effectiveness of OntoILPER on both NER and RE tasks. Actually, the proposed framework outperforms some of the state-of-the-art IE systems compared in this thesis. / A área de Extração de Informação (IE) visa descobrir e estruturar informações dispostas em documentos semi-estruturados ou desestruturados. O Reconhecimento de Entidades Nomeadas (REN) e a Extração de Relações (ER) são duas subtarefas importantes em EI. A primeira visa encontrar entidades nomeadas, incluindo nome de pessoas e lugares, entre outros; enquanto que a segunda, consiste na detecção e caracterização de relações que envolvem as entidades nomeadas presentes no texto. Como a tarefa de criar manualmente as regras de extração para realizar REN e ER é muito trabalhosa e onerosa, pesquisadores têm voltado suas atenções na investigação de como as técnicas de aprendizado de máquina podem ser aplicadas à EI a fim de tornar os sistemas de ER mais adaptáveis às mudanças de domínios. Como resultado, muitos métodos do estado-da-arte em REN e ER, baseados em técnicas estatísticas de aprendizado de máquina, têm sido propostos na literatura. Tais sistemas normalmente empregam um espaço de hipóteses com expressividade propositional para representar os exemplos, ou seja, eles são baseado na tradicional representação atributo-valor. Em aprendizado de máquina, a representação proposicional apresenta algums fatores limitantes, principalmente na extração de relações binárias que exigem não somente informações contextuais e estruturais (relacionais) sobre as instâncias, mas também outras formas de como adicionar conhecimento prévio do problema durante o processo de aprendizado. Esta tese visa atenuar as limitações acima mencionadas, tendo como hipótese de trabalho que, para ser eficiente e mais facilmente adaptável às mudanças de domínio, os sistemas de EI devem explorar ontologias e recursos semânticos no contexto de um arcabouço para EI que permita a indução automática de regras de extração de informação através do emprego de técnicas de aprendizado de máquina. Neste contexto, a presente tese propõe um método supervisionado capaz de extrair instâncias de entidades (ou classes de ontologias) e de relações a partir de textos apoiando-se na Programação em Lógica Indutiva (PLI), uma técnica de aprendizado de máquina supervisionada capaz de induzir regras simbólicas de classificação. O método proposto, chamado OntoILPER, não só se beneficia de ontologias e recursos semânticos, mas também se baseia em um expressivo espaço de hipóteses, sob a forma de predicados lógicos, capaz de representar exemplos cuja estrutura é relevante para a tarefa de EI consideradas nesta tese. OntoILPER automaticamente induz regras simbólicas para classificar exemplos de instâncias de entidades e relações a partir de um modelo de representação de frases baseado em grafos. Tal modelo de representação é uma das constribuições desta tese. Além disso, o modelo baseado em grafos para representação de frases e exemplos (instâncias de classes e relações) favorece a integração de conhecimento prévio do problema na forma de um conjunto reduzido de atributos léxicos, sintáticos, semânticos e estruturais. Diferentemente da maioria dos métodos de EI (uma pesquisa abrangente é apresentada nesta tese, incluindo aqueles que também se aplicam a PLI), OntoILPER faz uso de várias subtarefas do Processamento de Linguagem

Depuis ces dernières années, parmi tous les composants de puissance, l’IGBT (Transistor Bipolaire à Grille Isolée) occupe une place prépondérante, On le retrouve dans une multitude d’applications et il est devenu un composant de référence de l’électronique de puissance. Dans cette thèse, nous nous intéresserons au fonctionnement de l’IGBT en conditions thermiques et électriques extrêmes. À l'aide de la simulation physique bidimensionnelle d'un modèle d'IGBT de type Punch Through à structure de grille en tranchée, on s'intéressera plus particulièrement aux limites des aires de sécurité, et plus précisément aux mécanismes qui peuvent amener à la défaillance du composant. Une étude expérimentale présentera le comportement de différentes structures d’IGBT dans différents modes de fonctionnement, on traitera plus particulièrement l’influence de la température et de la résistance de grille sur ces modes de fonctionnement. Enfin, une proposition d’amélioration d’IGBT sera développée en simulation mettant en œuvre une couche tampon SiGe. / For these last years, the IGBT (Insulated Gate Bipolar Transistor) has occupied a dominating place comparing to other power components. Used in a multitude of applications, it became the component of reference in power electronics domain. In this thesis, I will be interested in operation of the IGBT in extreme thermal and electrical conditions. Using the simulation of a bi-dimensional physical model of a Punch Through Trench IGBT, I will be interested more particularly in the limits of the SOA (Safe Operating Area), and more precisely in the mechanisms which can lead to the failure of the component. An experimental study will present the behaviour of various structures of IGBT in various electrical and thermal operating conditions, more particularly the influence of the temperature and the gate resistance. Lastly, a proposal for an improvement of IGBT will be developed in simulation by implementing a layer SiGe in the N+ buffer layer of the IGBT.

Este estudio investiga la enseñanza del pretérito perfecto compuesto en el aula de españolcomo lengua extranjera a nivel escolar en Suecia. El objetivo de esta monografía es ver sipuede ser beneficioso enseñar el pretérito perfecto compuesto mediante canciones en español,que incluyen el pretérito perfecto compuesto en sus versos, como recurso didáctico. Losparticipantes son treinta y cuatro alumnos, divididos en dos grupos, de ELE en el octavo yocho profesores de español. Este estudio se realiza mediante observaciones en clase, dospruebas para los alumnos y una encuesta entre los profesores.Los resultados del estudio muestran que los profesores que participan en el estudio consideranque la mayoría de sus alumnos tienen problemas para aprender el pretérito perfectocompuesto. Los resultados de las pruebas indican que los alumnos que hacen parte del primergrupo de estudio, que tuvieron una enseñanza inductiva con canciones en español,aumentaron su destreza para utilizar el pretérito perfecto compuesto tanto con los verbosregulares como con los irregulares. Los alumnos que hicieron parte del segundo grupo,quienes recibieron una enseñanza deductiva, aumentaron su destreza en usar/aplicar elpretérito perfecto compuesto menos que el primer grupo cuando trata de los verbosirregulares. Sin embargo, estos alumnos aprendieron utilizar el pretérito perfecto compuestocon los verbos regulares mejor que los del primer grupo.Además, nos indigamos si se presentaba una posible diferencia en relación con el interés y lamotivación para aprender entre chicos y chicas dado el tema romántico de las canciones. Losresultados muestran una ligera mayoría en los resultados de las alumnas. / This study investigates the teaching of the past perfect tense in the Swedish classroom ofSpanish as a foreign language. The purpose of this essay is to see if it is profitable to teach thepast perfect tense with songs in Spanish, which include the past perfect tense in the lyrics, asan educational resource. The participants are thirtyfour students, divided into two groups, inthe eight grade who study Spanish as a foreign language, and eight Spanish teachers. Thestudy was made through observations in class, two tests by the students and a survey with theteachers.The results of the study show that the teachers who participated in the study consider that themajority of their students have problems learning the past perfect tense. Furthermore, theresults show that the students who were part of the first group, who received an inductiveeducation including Spanish music, increased their abilities of using the past perfect tenseboth with regular and irregular verbs. The students who were part of the second group andwho learnt/were taught by means of the deductive approach increased their abilities to use thepast perfect tense less than the first group when it came to the irregular verbs. However, theylearnt to use the past perfect tense with regular verbs better than the first group.Furthermore, we also investigated if there were any differences according to the interest andthe motivation to learn between the boys and the girls. The results were slightly higher amongthe girls.

<p align="justify">Many different active control techniques can be used to control the vibrations of a mechanical structure: they however require at least a sensitive signal amplifier (for the sensor), a power amplifier (for the actuator) and an analog or digital filter (for the controller). The use of all these electronic devices may be impractical in many applications and has motivated the use of the so-called shunt circuits, in which an electrical circuit is directly connected to a transducer embedded in the structure. The transducer acts as an energy converter: it transforms mechanical (vibrational) energy into electrical energy, which is in turn dissipated in the shunt circuit. No separate sensor is required, and only one, generally simple electronic circuit is used. The stability of the shunted structure is guaranteed if the electric circuit is passive, i.e. if it is made of passive components such as resistors and inductors.</p><p><p><p align="justify">This thesis compares the performances of the electric shunt circuits with those of classical active control systems. It successively considers the use of piezoelectric transducers and that of electromagnetic (moving-coil) transducers.</p><p><p><p align="justify">In a first part, the different damping techniques are applied on a benchmark truss structure equipped with a piezoelectric stack transducer. A unified formulation is found and experimentally verified for an active control law, the Integral Force Feedback (IFF), and for various passive shunt circuits (resistive and resistive-inductive). The use of an active shunt, namely the negative capacitance, is also investigated in detail. Two different implementations are discussed: they are shown to have very different stability limits and performances.</p><p><p><p align="justify">In a second part, vibration isolation with electromagnetic (moving-coil) transducers is introduced. The effects of an inductive-resistive shunt circuit are studied in detail; an equivalent mechanical representation is found. The performances are compared with that of resonant shunts and with that of active isolation with IFF. Next, the construction of a six-axis isolator based on a Stewart Platform is presented: the key parameters and the main limitations of the system are highlighted.</p> / Doctorat en Sciences de l'ingénieur / info:eu-repo/semantics/nonPublished