Made available in DSpace on 2016-04-27T16:57:50Z (GMT). No. of bitstreams: 1 EDM - Vera Lucia da Silva.pdf: 1384460 bytes, checksum: 3234ebd8c11c96412594a6df13e184cf (MD5) Previous issue date: 2006-11-16 / Secretaria da Educação do Estado de São Paulo / This research is about a teaching project aiming at mastering abilities and concepts related to the solution of problems of Cartesian product. The selected population were students of 4th Grade from a State School in the eastern region of the city of São Paulo. Our reference is the G. Vergnaud Conceptual Fields Theory and we took in consideration theoretical elements from researchers interested in studying the multiplicative reasoning. Data were collected from continuous observation and evaluation of the students performance, from the analyses of the materials produced by them and from interviews. The activities were designed with the intent of establishing connections between adding and multiplying processes and the processes involved in the determination of all the pairs of the Cartesian product. These connections become evident when represented by means of spatial relations promoting the evolution of non-conventional representations, produced by the students, to conventional representations, in Cartesian graphics and tree diagrams. The major contributions of this research for understanding the cognitive operations involved in solving Cartesian product problems are the repertory of non-conventional processes, employed by the selected group of participants, and their justification, and the analyses of the phenomena that occur in the passage from one to the other of the different representations of the Cartesian product. This research also offers contribution for the training of elementary education teachers / Nesta pesquisa, desenvolvemos uma proposta de ensino voltada ao domínio de competências e conceitos, relativos à resolução de problemas de multiplicação cartesiana. A população selecionada foi constituída por alunos de uma classe de 4a série do Ensino Fundamental, de uma Escola Estadual localizada da zona leste do Estado de São Paulo. Tomamos como referência a Teoria dos Campos Conceituais, de G. Vergnaud, e consideramos elementos teóricos de pesquisadores que desenvolvem pesquisas sobre o pensamento multiplicativo. Os dados foram obtidos por meio de registro e avaliação contínua do comportamento dos alunos no desenvolvimento das atividades, da análise do material produzido por eles e de entrevistas, entre outros. No desenvolvimento das atividades, buscamos estabelecer conexões entre procedimentos aditivos e multiplicativos e os processos envolvidos na determinação de todos os pares do produto cartesiano. Essas conexões foram ressaltadas ao serem representadas por meio de relações espaciais, promovendo a evolução de representações não convencionais, produzidas pelos alunos, para representações convencionais, em gráficos cartesianos e de árvore . Como principais contribuições desta pesquisa para a compreensão das operações cognitivas envolvidas na resolução de problemas de produto cartesiano, ressalte-se: o levantamento de um repertório de procedimentos não convencionais empregados pela classe selecionada e suas justificativas, a análise de fenômenos ocorridos na passagem de uma para outra das diferentes representações do produto cartesiano. A pesquisa oferece, igualmente, contribuições para a formação de professores do ensino fundamental

Made available in DSpace on 2016-04-27T17:27:02Z (GMT). No. of bitstreams: 1 Claudia Maria Martins.pdf: 910708 bytes, checksum: f7146708aa23e2c46a6a8a8805df7f46 (MD5) Previous issue date: 2012-08-31 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The purpose of our thesis was to reconstruct fundamental aspects of Michel Foucault's philosophy from a problematic cell inscribed within Histoire de la Folie à l'âge classique. It concerns the thesis which claims that the impossibility of being mad is the first qualification acquired by the Cartesian subject, even before Cogito statement. Foucault's polemical stance gives raise to the episode known by the Foucault-Derrida dispute. In the text Mon corps, ce papier, ce feu , written in 1972, Foucault explicits such reading by identifying in Descartes's Meditations a double weft: a demonstrative discourse guided by the order of reasons and an ascetic discourse guided by the performatic exercise of creating the subject of knowledge. The present research has showed that, in such a rare moment when Foucault puts himself in the role of a commentator of a philosophical text, the highlighted aspects in the Cartesian text are equally emblematic of his own philosophical method. Characterized by pointing out the visible and the enunciable, Foucault's histories also make up a double weft and encourage a kind of ascesis / O objetivo da tese foi reconstituir aspectos fundamentais da filosofia de Michel Foucault a partir de uma célula problemática inscrita em Histoire de la Folie à l'âge classique. Trata-se da tese que afirma que a impossibilidade de ser louco é a primeira qualificação adquirida pelo sujeito cartesiano, antes mesmo da enunciação do cogito. A polêmica posição de Foucault dá origem ao episódio que veio a ser conhecido como querela Foucault-Derrida. No texto Mon corps, ce papier, ce feu , de 1972, Foucault explicita esta leitura identificando no texto das Meditações uma dupla trama: um discurso demonstrativo guiado pela ordem das razões e um discurso ascético orientado pelo exercício performativo de criação do sujeito de conhecimento. A pesquisa mostrou que, neste raro momento em que Foucault se colocou no papel de comentador de um texto filosófico, os aspectos realçados no texto cartesiano são igualmente emblemáticos de seu próprio método filosófico. Particularizando-se pelo apontamento de visíveis e enunciáveis, as histórias foucaultianas também perfazem uma dupla trama e incitam uma espécie de ascese

L'acide rétinoïque (AR) est un morphogène dérivé de la vitamine A, qui intervient dans le contrôle de l'organogenèse, de la prolifération et de la différenciation cellulaires chez les Chordés. Dans ce contexte, nous avons étudié les régulations spatio-temporelles de la voie de signalisation de l’AR au cours du développement de l’amphioxus, en mettant l'accent sur l’espèce européenne Branchiostoma lanceolatum.Nous avons tout d'abord inhibé ou activé la voie de signalisation de l’AR lors du développement embryonnaire en traitant des embryons d’amphioxus à des doses variables de composés pharmacologiques interférant avec le métabolisme des rétinoïdes. Grâce à l’utilisation d’outils mathématiques spécifiques, nous avons établi un schéma détaillé des effets des traitements effectués sur le développement du système nerveux central (SNC) et du pharynx chez l’amphioxus en nous basant sur l’expression de gènes marqueurs de tissus spécifiques. À l’issue de cette première analyse, nous avons par la suite étudié les effets d’une perturbation de la signalisation de l’AR à des points clés du développement chez l’amphioxus lors de la régionalisation du SNC et du pharynx. Nous avons ainsi montré que la voie de signalisation de l’AR intervient dans la régionalisation de l’axe antéro-postérieur via le contrôle des gènes hox dès le stade gastrula et jusqu’aux stades larvaires. En outre, nous avons réalisé l'étude préliminaire du gène homologue chez l’amphioxus du gène aldh1a2 des Vertébrés, et avons démontré que la régulation du niveau de synthèse de l’AR au cour du développement est conservée entre l’amphioxus et les Vertébrés. Finalement, nous avons montré que la voie de l’AR participe également à la morphogenèse caudale chez l’amphioxus, et que le mécanisme impliqué semble différent de celui proposé chez les Vertébrés où l’AR contrôle la structuration de la nageoire caudale par le ciblage des tissus mésenchymateux. / Retinoic acid (RA) is an endogenous vitamin A-derived morphogen. In this context, we studied the spatiotemporal roles of RA signaling in amphioxus development, focusing on the European amphioxus species: Branchiostoma lanceolatum. We first created excess and insufficiency models of RA signaling by exposing amphioxus embryos to series of doses of different pharmacological compounds targeting either the RA receptors or the RA metabolism machinery. By introducing the important mathematical concept of a Cartesian coordinate system founded by René Descartes, we created detailed diagrams of the concentration-dependent defects caused by RA signaling in the central nervous system (CNS) and pharynx of amphioxus by evaluating the statistical significances of tissue-specific marker gene expression in labeled embryos. This analysis yielded a very detailed description of the sensitivities of the developing amphioxus CNS and pharynx to altered RA signaling levels. Following this initial challenge, we correlated the effects of altered RA signaling levels with key amphioxus developmental stages characterized by structural transitions in CNS and pharynx. We show that hox-mediated RA signaling in axial patterning is active beyond the gastrula stage and might be maintained until at least early larval stage, with possible roles in more regionalized axis formation and organ induction. In addition, we carried out a preliminary study on a RA synthesizing gene in amphioxus, called aldh1a, a possible homolog of the vertebrate aldh1a2 gene, demonstrating that the feedback between RA signaling and RA synthesizing levels has emerged before the split of the cephalochordate and vertebrate lineages. Moreover, we are able to show that RA signaling also participates in tail fin morphogenesis in amphioxus by a mechanism that is probably not comparable to that in vertebrates, where RA modulates caudal fin patterning through targeting mesenchymal derivatives.

La simulation haute-fidélité des coeurs de réacteurs nucléaires nécessite une évaluation précise du flux neutronique dans le coeur du réacteur. Ce flux est modélisé par l’équation de Boltzmann ou équation du transport neutronique. Dans cette thèse, on s’intéresse à la résolution de cette équation par la méthode des ordonnées discrètes (SN) sur des géométries cartésiennes. Cette méthode fait intervenir un schéma d’itérations à source, incluant un algorithme de balayage sur le domaine spatial qui regroupe l’essentiel des calculs effectués. Compte tenu du très grand volume de calcul requis par la résolution de l’équation de Boltzmann, de nombreux travaux antérieurs ont été consacrés à l’utilisation du calcul parallèle pour la résolution de cette équation. Jusqu’ici, ces algorithmes de résolution parallèles de l’équation du transport neutronique ont été conçus en considérant la machine cible comme une collection de processeurs mono-coeurs indépendants, et ne tirent donc pas explicitement profit de la hiérarchie mémoire et du parallélisme multi-niveaux présents sur les super-calculateurs modernes. Ainsi, la première contribution de cette thèse concerne l’étude et la mise en oeuvre de l’algorithme de balayage sur les super-calculateurs massivement parallèles modernes. Notre approche combine à la fois la vectorisation par des techniques de la programmation générique en C++, et la programmation hybride par l’utilisation d’un support d’exécution à base de tâches: PaRSEC. Nous avons démontré l’intérêt de cette approche grâce à des modèles de performances théoriques, permettant également de prédire le partitionnement optimal. Par ailleurs, dans le cas de la simulation des milieux très diffusifs tels que le coeur d’un REP, la convergence du schéma d’itérations à source est très lente. Afin d’accélérer sa convergence, nous avons implémenté un nouvel algorithme (PDSA), adapté à notre implémentation hybride. La combinaison de ces techniques nous a permis de concevoir une version massivement parallèle du solveur SN Domino. Les performances de la partie Sweep du solveur atteignent 33.9% de la performance crête théorique d’un super-calculateur à 768 cores. De plus, un calcul critique d’un réacteur de type REP 900MW à 26 groupes d’énergie mettant en jeu 1012 DDLs a été résolu en 46 minutes sur 1536 coeurs. / High-fidelity nuclear reactor core simulations require a precise knowledge of the neutron flux inside the reactor core. This flux is modeled by the linear Boltzmann equation also called neutron transport equation. In this thesis, we focus on solving this equation using the discrete ordinates method (SN) on Cartesian mesh. This method involves a source iteration scheme including a sweep over the spatial mesh and gathering the vast majority of computations in the SN method. Due to the large amount of computations performed in the resolution of the Boltzmann equation, numerous research works were focused on the optimization of the time to solution by developing parallel algorithms for solving the transport equation. However, these algorithms were designed by considering a super-computer as a collection of independent cores, and therefore do not explicitly take into account the memory hierarchy and multi-level parallelism available inside modern super-computers. Therefore, we first proposed a strategy for designing an efficient parallel implementation of the sweep operation on modern architectures by combining the use of the SIMD paradigm thanks to C++ generic programming techniques and an emerging task-based runtime system: PaRSEC. We demonstrated the need for such an approach using theoretical performance models predicting optimal partitionings. Then we studied the challenge of converging the source iterations scheme in highly diffusive media such as the PWR cores. We have implemented and studied the convergence of a new acceleration scheme (PDSA) that naturally suits our Hybrid parallel implementation. The combination of all these techniques have enabled us to develop a massively parallel version of the SN Domino solver. It is capable of tackling the challenges posed by the neutron transport simulations and compares favorably with state-of-the-art solvers such as Denovo. The performance of the PaRSEC implementation of the sweep operation reaches 6.1 Tflop/s on 768 cores corresponding to 33.9% of the theoretical peak performance of this set of computational resources. For a typical 26-group PWR calculations involving 1.02×1012 DoFs, the time to solution required by the Domino solver is 46 min using 1536 cores.

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2018-03-16T10:48:35Z No. of bitstreams: 2 Dissertação - Juliana Paula Félix - 2018.pdf: 1739140 bytes, checksum: 14e7528cefac5d3322e49131936f3c86 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-03-16T10:49:04Z (GMT) No. of bitstreams: 2 Dissertação - Juliana Paula Félix - 2018.pdf: 1739140 bytes, checksum: 14e7528cefac5d3322e49131936f3c86 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-03-16T10:49:04Z (GMT). No. of bitstreams: 2 Dissertação - Juliana Paula Félix - 2018.pdf: 1739140 bytes, checksum: 14e7528cefac5d3322e49131936f3c86 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-02-19 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work, we investigate the problem of finding identifying codes of minimum size in a variety of graph classes, such as trees corona products, Cartesian products and complementary prisms. For caterpillar trees, we show the minimum size of an identifying code on complete caterpillars, brooms and double brooms. We also prove a sharp upper bound for the general case. For coronas $K_n \circ \overline{K}_m$, we prove what is the minimum size of an identifying code. We demonstrate a sharp upper bound for an identifying code of the Cartesian product of a star and a path $K_{1,n} \square P_m$ and, when $n=3$, we conjecture that the limit proposed is minimum. We also find the minimum cardinality of an identifying code in the complementary prism of complete bipartite graphs and complete split graphs, among with other results: we demonstrate that the complementary prism graph $G\overline{G}$ is identifiable if, and only if, $G$ has at least two vertices; we find what is the smallest size possible of an identifying code of complementary prisms; we prove a sharp upper bound for an identifying code of the complementary prism $G\overline{G}$ of a connected graph $G$, showing that the set $C = V(G)$ is an identifying code with the size proposed and, finally, we determine the size of a minimum identifying code of the complementary prism of a complete bipartite graph, showing that it is an example of a graph that attains our upper bound. / Neste trabalho, investigamos o problema de se encontrar códigos identificadores de cardinalidade mínima em diversas classes de grafos, tais como árvores, produtos coronas, produtos Cartesianos e prismas complementares. Para árvores caterpillar, determinamos a cardinalidade mínima de um código identificador em caterpillars completo, grafos broom e broom duplo, e provamos um limite superior justo para caterpillars gerais. Para coronas, determinamos a cardinalidade mínima de um código identificador em $K_n \circ \overline{K}_m$. Para produtos Cartesianos, investigamos códigos identificadores em grafos $K_{1,n} \square P_m$, definimos um limite superior justo para o caso em que $n=3$ e um limite superior mais abrangente para o caso em que $n \geq 3$. Quando $n=3$, conjecturamos que o limite proposto é mínimo. Para prismas complementares de grafos, encontramos o tamanho de um código identificador mínimo em grafos bipartidos completos e grafos split completos. Para prismas complementares, obtivemos ainda outros resultados: demonstramos que um grafo prisma complementar $G\overline{G}$ é identificável se, e somente se, a ordem de $G$ é pelo menos dois; definimos o menor tamanho possível de um código identificador em um grafo $G\overline{G}$; determinamos um limite superior justo para o código identificador de um grafo conexo, mostrando também que seu conjunto de vértices é um conjunto identificador com o tamanho proposto e, finalmente, mostramos que o grafo bipartido completo é um exemplo de grafo que atinge a igualdade do limite superior apresentado.

Neste trabalho abordaremos alguns assuntos relacionados Ãs SeÃÃes CÃnicas: elipse, parÃbola e hipÃrbole. O trabalho està dividido em cinco capÃtulos: IntroduÃÃo; Origem das CÃnicas; EquaÃÃes das CÃnicas; Propriedades de ReflexÃo das CÃnicas; Construindo CÃnicas. No segundo capÃtulo, falaremos sobre o problema da duplicaÃÃo do cubo que, segundo a HistÃria da MatemÃtica, deu origem as cÃnicas e citaremos alguns matemÃticos cujos trabalhos contribuÃram para o desenvolvimento do estudo dessas curvas. No terceiro capÃtulo, estudaremos as equaÃÃes cartesianas das cÃnicas, bem como as suas representaÃÃes grÃficas e os principais elementos da cada cÃnica. No quarto capÃtulo, apresentaremos as propriedades de reflexÃo das cÃnicas e algumas aplicaÃÃes muito interessantes dessas propriedades. No Ãltimo capÃtulo, demonstraremos alguns mÃtodos para construir cÃnicas e em seguida faremos essas construÃÃes na prÃtica atravÃs de materiais concretos e por meio de um programa de Geometria DinÃmica, chamado Geogebra. / In this paper we discuss some issues related to Conic Sections: ellipse, parabola and hyperbole. The work is divided into five chapters: Introduction; Origin of Conic Sections; Equations of Conic Sections; Reflection Properties of Conic Sections; Building Conic Sections. In the second chapter, weâll talk about doubling the cube problem that, according to the History of Mathematics, originated the conic sections and talk about some mathematicians whose work contributed to the study of these curves. In the third chapter, we will study the Cartesian equations of conic sections, as well as their graphical representations and the main elements of each curve. In the fourth chapter, we presented the reflection properties of conic sections and some very interesting applications of these properties. In the last chapter, we will show some methods to construct conic sections and then we will make these constructs in practice through concrete materials and through a dynamic geometry program, called Geogebra.

Submitted by Cássia Santos (cassia.bcufg@gmail.com) on 2016-08-10T13:40:03Z No. of bitstreams: 2 Dissertação - Vanessa Ribeiro Soares - 2016.pdf: 11844437 bytes, checksum: 03d509603ea96f2647ea2764aea87d17 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-08-10T13:42:09Z (GMT) No. of bitstreams: 2 Dissertação - Vanessa Ribeiro Soares - 2016.pdf: 11844437 bytes, checksum: 03d509603ea96f2647ea2764aea87d17 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2016-08-10T13:42:09Z (GMT). No. of bitstreams: 2 Dissertação - Vanessa Ribeiro Soares - 2016.pdf: 11844437 bytes, checksum: 03d509603ea96f2647ea2764aea87d17 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-05-30 / This work has the purpose contribute to the improvement in some teaching contents of analytic geometry and trigonometry in high school . The content work was based on the National Curriculum Parameters, highlighting de nitions, theorems and properties necessary for the development of student learning. The theme was chosen after a practical experience involving the Naval Battle game in order to reduce the students' di culties. The playful work, as the game, has a practical application that does the student become familiar with the content. That's an interesting way to propose problems and solutions involving the content. Thus becomes something attractive to the student and encourages creativity in nding problems solutions. / O trabalho tem como objetivo contribuir para o aprimoramento no ensino de alguns conteúdos de Geometria Analítica e Trigonometria no Ensino Médio. Dentro dos Parâmetros Curriculares Nacionais, trabalhamos o conteúdo destacando de nições, teoremas e propriedades necessárias para o desenvolvimento de aprendizagem do aluno. O tema foi escolhido depois de uma experiência prática envolvendo o jogo Batalha Naval a m de diminuir as di culdades dos alunos. O trabalho lúdico, como o jogo, tem uma aplicação prática que faz o aluno se familiarizar com os conceitos. É uma forma interessante de propor problemas e soluções envolvendo o conceitos. Assim se torna algo atrativo para o aluno e favorece a criatividade na busca de soluções para os problemas.

My thesis is about functions, like linear functions, quadratic functions, goniometric functions etc. Goal of my work ist to design appropriate tasks with focus on function links. Students can with help of matematic program GeoGebra discover and adopt needed properties of functions. In this work you can find Cartesian coordinates and overview of basic properties of functions too.

La perméabilisation des cellules à l’aide d’impulsions électriques intenses, appelée électroperméabilisation, est un phénomène biologique impliqué dans des thérapies anticancéreuses récentes. Elle permet, par exemple, d’améliorer l’efficacité d’une chimiothérapie en diminuant les effets secondaires, d’effectuer des transferts de gènes, ou encore de procéder à l’ablation de tumeurs. Les mécanismes de l’électroperméabilisation restent cependant encore méconnus, et l’hypothèse majoritairement admise par la communauté de formation de pores à la surface des membranes cellulaires est en contradiction avec certains résultats expérimentaux.Le travail de modélisation proposé dans cette thèse est basé sur une approche différente des modèles d’électroporation existants. Au lieu de proposer des lois sur les propriétés des membranes à partir d’hypothèses à l’échelle moléculaire, nous établissons des lois ad hoc pour les décrire, en se basant uniquement sur les informations expérimentales disponibles. Aussi, afin de rester au plus prèsde ces dernières et faciliter la phase de calibration à venir, nous avons ajouté un modèle de transport et de diffusion de molécules dans la cellule. Une autre spécificité de notre modèle est que nous faisons la distinction entre l’état conducteur et l’état perméable des membranes.Des méthodes numériques spécifiques ainsi qu’un code en 3D et parallèle en C++ ont été écrits et validés pour résoudre les équations aux dérivées partielles de ces différents modèles. Nous validons le travail de modélisation en montrant que les simulations reproduisent qualitativement les comportements observés in vitro. / Cell permeabilization by intense electric pulses, called electropermeabilization, is a biological phenomenon involved in recent anticancer therapies. It allows, for example, to increase the efficacy of chemotherapies still reducing their side effects, to improve gene transfer, or to proceed tumor ablation. However, mechanisms of electropermeabilization are not clearly explained yet, and the mostly adopted hypothesis of the formation of pores at the membrane surface is in contradiction with several experimental results.This thesis modeling work is based on a different approach than existing electroporation models. Instead of deriving equations on membranes properties from hypothesis at the molecular scale, we prefer to write ad hoc laws to describe them, based on available experimental data only. Moreover, to be as close as possible to these data, and to ease the forthcoming work of parameter calibration, we added to our model equations of transport and diffusion of molecules in the cell. Another important feature of our model is that we differentiate the conductive state of membranes from their permeable state.Numerical methods, as well as a 3D parallel C++ code were written and validated in order to solve the partial differential equations of our models. The modeling work was validated by showing qualitative match between our simulations and the behaviours that are observed in vitro

This thesis presents TransLucid, a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid programs define arbitrary dimensional infinite data structures, which are then queried to produce results. The formal foundations of TransLucid come from the work in intensional logic by Montague and Scott. The background chapters give a history of intensional logic and its predecessors in the Western world, as well as a history of intensional programming and Lucid, the first intensional programming language. The semantics of TransLucid are fully specified in the form of operational semantics. Three levels of semantics are given, in increasing order of efficiency, with the sequential warehouse semantics, the most efficient, being presented together with a proof that any expression will be evaluated by only examining relevant dimensions in the current context. The language is then extended in three important ways, by adding versioned identifiers, (declarative) side-effects and timestamped equations and demands. Adding versioned identifiers to TransLucid enriches the expressiveness of the language and allows the encoding of a variety of programming paradigms, ranging from manipulating large data-cubes to pattern-matching. Adding side-effects supports one of the main reasons for TransLucid: namely, to provide a target language, together with a methodology, for translating the main programming paradigms, thus creating a uniform end platform that can be the focus for optimisation and program verification. A translation of imperative programs into TransLucid is given. Timestamped equations and demands enable TransLucid to become a language for synchronous programming in real-time systems, as well as allowing runtime updates to a program's equations. The language TransLucid represents a decisive advance in declarative programming. It has applications in many fields of computer science and opens up exciting new avenues of research.