[pt] A teoria de Bardin, Cooper e Schrieffer (BSC) teve enorme sucesso na explicação das propriedades da maior parte dos materiais supercondutores. Esses materiais, onde a teoria BCS se aplica, são denominados supercondutores convencionais. A observação do aparecimento de supercondutividade não-convencional em diversos materiais reabriu as discussões sobre o fenômeno. Enquanto a transição para fase supercondutora em materiais convencionais envolve apenas a quebra da simetria de calibre, no caso dos materiais não-convencionais, a mesma é caracterizada pela quebra de diversas simetrias adicionais. O mecanismo microscópico da supercondutividade nessas novas classes de materiais ainda é uma questão em aberto. no entanto, muitas propriedades físicas podem ser extraídas apenas de conciderações sobre as simetrias do parâmetro de ordem supercondutor, que está intimamente ligadoá função de onda do par de Cooper. Neste trabalho são analisadas algumas propriedades destes novos supercondutores baseadas em critérios de simetria. Um enfoque especial é dado à classe dos supercondutores não-convencionais onde há uma quebra de simetria de reversão temporal. Para estes materiais são previstas algumas propriedade bem pouco usuais. Quando a estrutura cristalina tiver alta simetria, é possível o surgimento de uma polarização de um spin no condensado. Nestes casos, a magnetização intrínseca pode levar à formação de uma fase espontânea de vórtices. Ocorre também uma forte anisotropia na resposta do supercondutor frente à aplicação de campos magnéticos externos. / [en] The theory of Bardeen, Cooper and Schrieffer (BCS) had great success in explaining most properties of superconducting materials. These materials, where BCS applies, are denominated conventional superconductors. the experimental evidence of unconventional superconductivity in several materials reopened discussions about the phenomenon. While, in conventional materials, the superconducting phase involves only the breaking of gauge symmetry, in the unconventional materials the phase is characterized by several additional broken symmetries. The microscope mechanism of superconductivity in this new classes of materials is still an open question. However, many phisical properties can be understood considering only symmetries of the superconducting order parameter, which is intimately linked to Cooper pair wave function. In this work some properties of these new superconductors are analyzed based symmetry criteria. Special emphasis is given to the class of unconventional superconductors where time- reversal symmetry is broken. For these materials, some unusual properties are predicted. When the crystal structure has high symmetry, the appearence of a spin polarization in the condensate is possible. In these cases, an intrinsic magnetization can lead to the information of a spontanous vortex phase. A strong anisotropic response to an externally applied magnetic field also occurs.

Cette thèse est le point d’intersection entre deux facettes de l’étude des arrangements de droites : la combinatoire et la topologie. Dans une première partie nous avons étudié l’inclusion de la variété bord dans le complémentaire d’un arrangement. Nous avons ainsi généralisé le résultat d’E. Hironaka au cas de tous les arrangements complexes. Pour contourner les problèmes provenant des arrangements non réels, nous avons étudié le diagramme de câblage, dit wiring diagram, qui code la monodromie de tresses sous forme de tresse singulière. Pour pouvoir l'utiliser, nous avons implémenté un programme sur Sage permettant de calculer ce diagramme en fonction des équations de l’arrangement. Cela nous a permis de d’obtenir deux descriptions explicites de l’application induite par l’inclusion de la variété bord dans le complémentaire sur les groupes fondamentaux. Nous obtenons ainsi deux nouvelles présentations du groupe fondamental du complémentaire d’un arrangement. L’une d’entre elle généralise le théorème de R. Randell au cas des arrangements complexes. Pour continuer ces travaux, nous avons étudié l’application induite par l’inclusion sur le premier groupe d’homologie. Nous obtenons deux descriptions simples de cette application. En s’inspirant des travaux de J.I. Cogolludo, nous décrivons une décomposition canonique du premier groupe d’homologie de la variété bord comme produit de la 1-homologie et de la 2-cohomologie du complémentaire, ainsi qu'un isomorphisme entre la 2-cohomologie du complémentaire et la 1-homologie du graphe d’incidence. Dans la seconde partie de notre travail nous nous sommes intéressés à l’étude des caractères du groupe fondamental du complémentaire. Nous partons des résultats obtenus par E. Artal sur le calcul de la profondeur d’un caractère. Cette profondeur peut être décomposée en un terme projectif et un terme quasi-projectif. Un algorithme pour calculer la partie projective a été donné par A. Libgober. Les travaux de E. Artal concernent la partie quasi-projective. Il a obtenu une méthode pour la calculer en fonction de l’image de certains cycles particuliers du complémentaire par le caractère. En utilisant les résultats obtenus dans la première partie, nous avons obtenu un algorithme complet permettant le calcul de la profondeur quasi-projective d’un caractère. A travers l’étude de cet algorithme, nous avons obtenu une condition combinatoire pour admettre une profondeur quasi-projective potentiellement non combinatoire. Nous avons ainsi défini la notion de caractère inner-cyclic . Cette notion nous a permis de formuler des conditions fortes sur la combinatoire pour qu’un arrangement n’ait que des caractères de profondeur quasi-projective nulle. Enfin pour diminuer le nombre d’exemples à considérer nous avons introduit la notion de combinatoire première. Si une combinatoire ne l’est pas, alors les variétés caractéristiques de ses réalisations sont définies par celles d’un arrangement avec moins de droites. En parallèle à cette étude, nous avons observé que la composition de l’application induite par l’inclusion sur le premier groupe d’homologie avec un caractère nous fournit un invariant topologique de l'arrangement obtenu en désingularisant les points multiples (blow-up). De plus, nous montrons que cet invariant n’est pas de nature combinatoire. Il nous a ainsi permis de découvrir deux nouvelles nc-paires de Zariski. / This thesis is the intersection point between the two facets of the study of line arrangements: combinatorics and topology. In the first part, we study the inclusion of the boundary manifold in the complement of an arrangement. We generalize the results of E. Hironaka to the case of any complex line arrangement. To get around the problems due to the case of non complexified real arrangement, we study the braided wiring diagram. We develop a Sage program to compute it from the equation of the complex line arrangement. This diagram allows to give two explicit descriptions of the map induced by the inclusion on the fundamental groups. From theses descriptions, we obtain two new presentations of the fundamental group of the complement. One of them is a generalization of the R. Randell Theorem to any complex line arrangement. In the next step of this work, we study the map induced by the inclusion on the first homology group. Then we obtain two simple descriptions of this map. Inspired by ideas of J.I. Cogolludo, we give a canonical description of the homology of the boundary manifold as the product of the 1-homology with the 2-cohomology of the complement. Finally, we obtain an isomorphism between the 2-cohomology of the complement with the 1-homology of the incidence graph of the arrangement. In the second part, we are interested by the study of character on the group of the complement. We start from the results of E. Artal on the computation of the depth of a character. This depth can be decomposed into a projective term and a quasi-projective term, vanishing for characters that ramify along all the lines. An algorithm to compute the projective part is given by A. Libgober. E. Artal focuses on the quasi-projective part and gives a method to compute it from the image by the character of certain cycles of the complement. We use our results on the inclusion map of the boundary manifold to determine these cycles explicitly. Combined with the work of E. Artal we obtain an algorithm to compute the quasi-projective depth of any character. From the study of this algorithm, we obtain a strong combinatorial condition on characters to admit a quasi-projective depth potentially not determined by the combinatorics. With this property, we define the inner-cyclic characters. From their study, we observe a strong condition on the combinatorics of an arrangement to have only characters with null quasi-projective depth. Related to this, in order to reduce the number of computations, we introduce the notion of prime combinatorics. If a combinatorics is not prime, then the characteristics varieties of its realizations are completely determined by realization of a prime combinatorics with less line. In parallel, we observe that the composition of the map induced by the inclusion with specific characters provide topological invariants of the blow-up of arrangements. We show that the invariant captures more than combinatorial information. Thereby, we detect two new examples of nc-Zariski pairs.

Submitted by Luanna Matias (lua_matias@yahoo.com.br) on 2015-02-05T10:05:56Z No. of bitstreams: 2 Dissertaçao - Mónica Andrea Celis Cerón - 2014.pdf: 566862 bytes, checksum: b41da2ec2c63c537f6b78488d3d8c179 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-02-05T10:59:19Z (GMT) No. of bitstreams: 2 Dissertaçao - Mónica Andrea Celis Cerón - 2014.pdf: 566862 bytes, checksum: b41da2ec2c63c537f6b78488d3d8c179 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2015-02-05T10:59:19Z (GMT). No. of bitstreams: 2 Dissertaçao - Mónica Andrea Celis Cerón - 2014.pdf: 566862 bytes, checksum: b41da2ec2c63c537f6b78488d3d8c179 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-04-25 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Celis Cerón, Mónica Andrea. Artin’s conjecture for pairs of additive sextic forms. Goiânia, 2014. 62p. MSc. Dissertation. Instituto de Matemática e Estatística, Universidade Federal de Goiás. Consider the system of equations a1xk1+ a2xk2+ + asxks= 0; b1xk1+ b2xk2+ + bsxks= 0; where a1; a2; ; as; b1; b2; ; bs 2 Z A special case of Artin’s conjecture states that the above system must have nontrivial solutions in every p-adic field, Qp, provided only that s 2k2+ 1. In this text we show that the conjecture is true when k = 6. / Celis Cerón, Mónica Andrea. Conjectura de Artin para pares de formas aditivas de grau 6. Goiânia, 2014. 62p. Dissertação de Mestrado. Instituto de Matemática e Estatística, Universidade Federal de Goiás. Consideremos o sistema de equações a1xk1+ a2xk2+...+ asxks= 0; b1xk1+ b2xk2+ + bsxks= 0; onde, a 1; a 2; ; as; b1; b2; ; bs 2 Z. Um caso especial da conjectura de Artin nos diz que o sistema anterior tem solução não trivial em todo corpo p-ádico, Qp, sempre que s 2k2+ 1. Neste trabalho mostraremos que a conjectura é válida quando k = 6.

A Formação Continuada de Professores pode ser analisada por diferentes perspectivas. Esta investigação discutiu questões relacionadas ao impacto na pós-formação de um programa de informática educativa. Seu objetivo consistiu em identificar as transformações na prática docente e nas relações que se estabeleceram entre professores-pares em um curso de formação continuada para uso das tecnologias digitais de informação e comunicação, sob a ótica dos participantes. Investigou as variáveis responsáveis pelos índices de permanência e sustentabilidade do curso de formação após a saída de seus coordenadores. A pesquisa foi realizada com professores da Educação Básica da rede estadual de ensino do estado da Paraíba, participantes do Programa Aprender em Parceria. A pesquisa se deu por meio da análise de questionários e entrevistas, sobre a continuidade de uso de tecnologias digitais nas estratégias de ensino aprendizagem, por meio do trabalho entre pares de professores e aprendizagem dialógica. Foram analisadas também as características desta rede de ensino e de seus professores, como um conjunto de dados coletados na pré e pós-formação. Foi planejada a aplicação de um novo questionário três anos após o término dos trabalhos, cujos indicadores para análise relacionaram os objetivos da formação aos critérios de sustentabilidade. Os resultados revelaram que o programa se mostrou mais eficaz no desenvolvimento de habilidades pessoais em relação ao uso das tecnologias, alavancando a carreira de muitos participantes. Sinalizaram para a necessidade de aprimoramento e desenvolvimento das competências requeridas pelos professores quanto ao uso da linguagem digital nas práticas pedagógicas em sala de aula e necessidade de criação de espaços de diálogo, articulados institucionalmente entre os pares de professores, na promoção de projetos educativos interdisciplinares com os alunos. Tais resultados apontaram ainda para a necessidade de investimentos em infraestrutura de suportes tecnológicos, com finalidade pedagógica. Todas as variáveis analisadas indicam que qualquer projeto de formação de professores requer apoio estratégico da instituição de ensino; uma política pública de desenvolvimento educacional de médio e longo prazo e infraestrutura adequada para que o programa possa ter sustentabilidade. / The continuous training of teachers can be analyzed under different perspectives. This investigation discussed issues related to the post-training impact of an educational information technology program. Its goal consisted of identifying transformations in the teaching practice and in the interactions established among teacher pairs in a continuous training course for the use of digital information and communication technology from the participants perspective. Variables responsible for the training course sustainability and permanence rates once their coordinators had left were studied. The research was carried out with Primary School teachers of the Paraiba state network, and the partnership of the Peer Coaching Program participants. The research was developed through the analysis of questionnaires and interviews on the continuity of the use of digital technologies in teaching-learning strategies through the work of teacher pairs and dialogic learning. The main characteristics of this teaching network and their teachers were also analyzed as an array of data collected in pre and post- training. The application of a new questionnaire three years after the end of the works was also planned. Its indicators were analyzed relating training goals with sustainability criteria. Results revealed that the program proved to be more efficient in the development of personal skills related to the use of technologies, boosting the careers of many participants. The need to improve and optimize the knowledge required by teachers with regards to the use of digital vocabulary in pedagogical practical lessons in the classroom and the need to create dialogue opportunities institutionally articulated between teachers in the promotion of interdisciplinary educational projects with the students were also remarked. Such results also suggested the need to invest in technological support infrastructure with a pedagogic aim. All variables analyzed demonstrate that any teacher training project requires the strategic support of the teaching institution, a medium and long term public policy for educational development and adequate infrastructure, seeking that the implemented program can be sustainable.

In order for assistive robots to collaborate effectively with humans for completing everyday tasks, they must be endowed with the ability to effectively perceive scenes and more importantly, recognize human intentions. As a result, we present in this dissertation a novel scene-dependent human-robot collaborative system capable of recognizing and learning human intentions based on scene objects, the actions that can be performed on them, and human interaction history. The aim of this system is to reduce the amount of human interactions necessary for communicating tasks to a robot. Accordingly, the system is partitioned into scene understanding and intention recognition modules. For scene understanding, the system is responsible for segmenting objects from captured RGB-D data, determining their positions and orientations in space, and acquiring their category labels. This information is fed into our intention recognition component where the most likely object and action pair that the user desires is determined. Our contributions to the state of the art are manifold. We propose an intention recognition framework that is appropriate for persons with limited physical capabilities, whereby we do not observe human physical actions for inferring intentions as is commonplace, but rather we only observe the scene. At the core of this framework is our novel probabilistic graphical model formulation entitled Object-Action Intention Networks. These networks are undirected graphical models where the nodes are comprised of object, action, and object feature variables, and the links between them indicate some form of direct probabilistic interaction. This setup, in tandem with a recursive Bayesian learning paradigm, enables our system to adapt to a user's preferences. We also propose an algorithm for the rapid estimation of position and orientation values of scene objects from single-view 3D point cloud data using a multi-scale superquadric fitting approach. Additionally, we leverage recent advances in computer vision for an RGB-D object categorization procedure that balances discrimination and generalization as well as a depth segmentation procedure that acquires candidate objects from tabletops. We demonstrate the feasibility of the collaborative system presented herein by conducting evaluations on multiple scenes comprised of objects from 11 categories, along with 7 possible actions, and 36 possible intentions. We achieve approximately 81% reduction in interactions overall after learning despite changes to scene structure.

Physically Unclonable Functions (PUFs) are now widely being used to uniquely identify Integrated Circuits (ICs). In this work, we propose a novel Set-Reset (SR) Flip-flop based PUF design. For a NAND gate based SR flip-flop, the input condition S (Set) = 1 and R (Reset) = 1 must be avoided as it is an inconsistent condition. When S=R=1 is applied followed by S=R=0, then the outputs Q and Q' undergo race condition and depending on the delays of the NAND gates in the feedback path, the output Q can settle at either 0 or 1. Because of process variations in an IC, the NAND delays are statistical in nature. Thus, for a given SR FF based $n$-bit register implemented in an IC, when we apply S=R=1 to all flip-flops followed by S=R=0, then we obtain an $n$ bit string that can be interpreted as a signature of the chip. Due to process variations, the signature is highly likely to be unique for an IC. We validated the proposed idea by SPICE-level simulations for 90nm, 45nm, and 32nm designs for both intra- and inter-chip variations to establish the robustness of the proposed PUF. Experimental results for 16-, 32-, 64-, and 128-bit registers based on Monte-Carlo simulations demonstrate that the proposed PUF is robust. The main advantage of the proposed PUF is that there is very little area overhead as we can reuse existing registers in the design.

在實務上，複選題分析一直處於觀察樣本情形的階段；至於進行檢定以推估母體情形的過程，則幾乎沒有人考慮到。就算曾經試圖想作類似檢定，卻也常常找不到可供參考的文獻或是使用了不適當的分析方法。 本研究的主要目的在於探討各式各樣離散型態相關資料的分析方法，其中亦包含許多複選題的分析方法。幾乎每個方法皆附上範例來說明程式撰寫及分析過程，希望對有此需求的人能有所幫助。 / Problems with multiple responses are usually analyzed by observing only the sample proportions. People don't bother to make any inferences based on the sample information mostly because they do not know how to do it. Even for those who do go beyond the stage of descriptive statistics might not work it out correctly. In the study, we review statistical methods for analyzing dependent proportions, including multiple responses. Almost every method is supplemented with an example which explains the way a related SAS program is written and the way the output is analyzed and explained. We hope that the results presented here will be helpful to those who are engaged in any analysis of multiple responses.

Cette thèse aborde la notion de style et de variation intra-locuteur, dans le cadre d'enquêtes sociolinguistiques menées auprès d'enfants âgés de 5 à 11 ans. Plusieurs approches méthodologiques, tant quantitatives que qualitatives, sont convoquées afin d'appréhender les représentations et les pratiques stylistiques d'enfants de l'école primaire. Plusieurs types de données ont été recueillis et analysés, notamment des discours sur la variation, des productions langagières au cours de jeux parodiques et des conversations ordinaires. L'influence conjointe du milieu social et des réseaux de socialisation scolaire est envisagée, dans une dynamique à la fois macro- et microsociale. Le processus de construction des représentations de la variation stylistique chez l'enfant est interrogé, ainsi que le phénomène de souplesse stylistique en tant que capacité, en partie consciente, à moduler son style au cours de l'interaction, à des fins à la fois adaptatives et proactives. Ces observations et réflexions sont mises en perspective avec des problématiques socio-éducatives liées à la mixité sociale des établissements scolaires et à la prise en compte de la variation en didactique du français.

<p>This study examined the idea that each mathematical operation (addition, subtraction, multiplication and division) is mainly linked to one of the components of working memory as proposed by Baddeley. The phonological loop, visual-spatial sketchpad and central executive have been studied using a dual-task methodology with 7 different secondary tasks. 35 undergraduate and graduate students were timed in their response time for mental calculation and error rates were calculated. Results show clear differences of operations and of number pairs. Interaction between conditions and operations was just approaching significance. Results did not give support to the idea that operations can be linked to a certain working memory component. Several factors, such as language, problem size, lack for detail in the working memory model, difficulty of the secondary tasks, and internal validity problems are discussed with regard to the results and mental arithmetic.</p>

<p>Det är viktigt med ett effektivt samarbete och en välfungerande kommunikation i dynamiska miljöer, till exempel vid släckningsarbetet av en brand. Bristande kommunikation i en sådan miljö skulle kunna få förödande konsekvenser.</p><p>Denna uppsats bygger på material från studien ”Bridging Cultural Barriers to Collaborative Decision Making in On-Site Operations Coordination Centers”, där 32 svenskar samarbetade i olika lagkonstellationer med att släcka simulerade eldar i mikrovärlden C3Fire.</p><p>Kommunikationsteorier visar på att personer samtalar med varandra efter en viss struktur; deras yttranden tenderar att komma i par, så kallade närhetspar. Denna studie syftade till att undersöka närhetspar i beställningssekvenser, i form av en beställning av vatten och/eller bränsle följd av en bekräftelse. Till sin hjälp hade försöksdeltagarna en datorskärm med en karta samt tillgång till ett e-postverktyg för att kommunicera inom laget. Varje person genomgick åtta spelomgångar, vilket resulterade i totalt 64 spelomgångar. De lag som lyckades släcka elden antogs ha större andel närhetspar i beställningssekvenserna, vilket innebar att de skulle bekräfta varandras beställningar mer kontinuerligt än de lag som inte lyckades släcka elden. För studiet av närhetsparen kategoriserades e-postmeddelandena från samtliga spelomgångar, för att se hur strukturen i kommunikationen såg ut.</p><p>Resultatet visade på att något annat måste ha påverkat de medverkandes prestation, eftersom det inte fanns någon påtaglig skillnad i andelen närhetspar i beställningssekvenserna mellan de olika lagen. Det uppmärksammades att de inte bekräftade varandras beställningar endast genom e-postmeddelanden utan även genom direkta manipulationer. Anledningen till detta antas vara att alla lagmedlemmar blev presenterade samma information på sina datorskärmar, vilket frambringade en mer implicit kommunikation.</p> / <p>Efficient communication and cooperation is important in dynamic environments, for instance in fire-fighting teamwork. A lack of communication in this environment could cause devastating consequences.</p><p>This Master’s thesis is based on material from ”Bridging Cultural Barriers to Collaborative Decision Making in On-Site Operations Coordination Centers”, a study where 32 Swedes collaborated in teams conducting fire-fighting exercises in the micro-world C3Fire.</p><p>Communication theories propose that people talk with each other after a certain structure; their utterances tend to come in pairs, so-called adjacency pairs. The purpose of this study was to examine adjacency pairs in request sequences, in form of a request for water and/or fuel followed by a confirmation. The participants had access to a computer screen with a map together with an e-mail tool, to communicate within the team. Every person participated in eight rounds of the game, which resulted in 64 rounds of the game altogether. The teams who managed to extinguish the fire were assumed to have a larger amount of adjacency pairs in their request sequences than the teams who did not extinguish the fire. For the study of the adjacency pairs, the e-mails were categorized, to see what the structure of the communication looked like.</p><p>The result showed that some other factor must have influenced the participants’ performance, since there was no obvious difference in the amount of the adjacency pairs in the request sequence between the teams. It was observed that the team members did not confirm each other’s requests just by sending e-mail, but also by direct manipulations. The reason for this is assumed to be that every member of the team was shown the same information on his computer screen, which gave rise to a more implicit communication.</p>