Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

This research develops efficient solution methods for linear systems with scalar and multi-level Toeplitz structure. Toeplitz systems are common in one-dimensional signal-processing applications, and typically correspond to temporal- or spatial-invariance in the underlying physical phenomenon. Over time, a number of algorithms have been developed to solve these systems economically by exploiting their structure. These developments began with the Levinson-Durbin recursion, a classical fast method for solving Toeplitz systems that has become a standard algorithm in signal processing. Over time, more advanced routines known as superfast algorithms were introduced that are capable of solving Toeplitz systems with even lower asymptotic complexity. For multi-dimensional signals, temporally- and spatially-invariant systems have linear-algebraic descriptions characterized by multi-level Toeplitz matrices, which exhibit Toeplitz structure on multiple levels. These matrices lack the same algebraic properties and structural simplicity of their scalar analogs. As a result, it has proven exceedingly difficult to extend the existing scalar Toeplitz algorithms for their treatment. This research presents algorithms to solve scalar and two-level Toeplitz systems through a constructive approach, using methods devised for specialized cases to build more general solution methods. These methods extend known scalar Toeplitz inversion results to more general scalar least-squares problems and to multi-level Toeplitz problems. The resulting algorithms have the potential to provide substantial computational gains for a large class of problems in signal processing, such as image deconvolution, non-uniform resampling, and the reconstruction of spatial volumes from non-uniform Fourier samples.

After reviewing some properties of the two dimensional hyperbolic toral automorphism called Arnold's discrete cat map, including its generalizations with matrices having positive unit determinant, this thesis contains a definition of a novel cat map where the elements of the matrix are found in the sequence of Pell numbers. This mapping is therefore denoted as Pell's cat map. The main result of this thesis is a theorem determining the upper bound for the minimal period of Pell's cat map. From numerical results four conjectures regarding properties of Pell's cat map are also stated. A brief exposition of some applications of Arnold's discrete cat map is found in the last part of the thesis.

Interval arithmetic is a means to compute verified results. However, a naive use of interval arithmetic does not provide accurate enclosures of the exact results. Moreover, interval arithmetic computations can be time-consuming. We propose several accurate algorithms and efficient implementations in verified linear algebra using interval arithmetic. Two fundamental problems are addressed, namely the multiplication of interval matrices and the verification of a floating-point solution of a linear system. For the first problem, we propose two algorithms which offer new tradeoffs between speed and accuracy. For the second problem, which is the verification of the solution of a linear system, our main contributions are twofold. First, we introduce a relaxation technique, which reduces drastically the execution time of the algorithm. Second, we propose to use extended precision for few, well-chosen parts of the computations, to gain accuracy without losing much in term of execution time.

Les ordinateurs équipés d'accélérateurs sont omniprésents parmi les machines de calcul haute performance. Cette évolution a entraîné des efforts de recherche pour concevoir des outils permettant de programmer facilement des applications capables d'utiliser toutes les unités de calcul de ces machines. Le support d'exécution StarPU développé dans l'équipe STORM de INRIA Bordeaux, a été conçu pour servir de cible à des compilateurs de langages parallèles et des bibliothèques spécialisées (algèbre linéaire, développements de Fourier, etc.). Pour proposer la portabilité des codes et des performances aux applications, StarPU ordonnance des graphes dynamiques de tâches de manière efficace sur l’ensemble des ressources hétérogènes de la machine. L’un des aspects les plus difficiles, lors du découpage d’une application en graphe de tâches, est de choisir la granularité de ce découpage, qui va typiquement de pair avec la taille des blocs utilisés pour partitionner les données du problème. Les granularités trop petites ne permettent pas d’exploiter efficacement les accélérateurs de type GPU, qui ont besoin de peu de tâches possédant un parallélisme interne de données massif pour « tourner à plein régime ». À l’inverse, les processeurs traditionnels exhibent souvent des performances optimales à des granularités beaucoup plus fines. Le choix du grain d’un tâche dépend non seulement du type de l'unité de calcul sur lequel elle s’exécutera, mais il a en outre une influence sur la quantité de parallélisme disponible dans le système : trop de petites tâches risque d’inonder le système en introduisant un surcoût inutile, alors que peu de grosses tâches risque d’aboutir à un déficit de parallélisme. Actuellement, la plupart des approches pour solutionner ce problème dépendent de l'utilisation d'une granularité des tâches intermédiaire qui ne permet pas un usage optimal des ressources aussi bien du processeur que des accélérateurs. L'objectif de cette thèse est d'appréhender ce problème de granularité en agrégeant des ressources afin de ne plus considérer de nombreuses ressources séparées mais quelques grosses ressources collaborant à l'exécution de la même tâche. Un modèle théorique existe depuis plusieurs dizaines d'années pour représenter ce procédé : les tâches parallèles. Le travail de cette thèse consiste alors en l'utilisation pratique de ce modèle via l'implantation de mécanismes de gestion de tâches parallèles dans StarPU et l'implantation ainsi que l'évaluation d'ordonnanceurs de tâches parallèles de la littérature. La validation du modèle se fait dans le cadre de l'amélioration de la programmation et de l'optimisation de l'exécution d'applications numériques au dessus de machines de calcul modernes. / Hybrid computing platforms equipped with accelerators are now commonplace in high performance computing platforms. Due to this evolution, researchers concentrated their efforts on conceiving tools aiming to ease the programmation of applications able to use all computing units of such machines. The StarPU runtime system developed in the STORM team at INRIA Bordeaux was conceived to be a target for parallel language compilers and specialized libraries (linear algebra, Fourier transforms,...). To provide the portability of codes and performances to applications, StarPU schedules dynamic task graphs efficiently on all heterogeneous computing units of the machine. One of the most difficult aspects when expressing an application into a graph of task is to choose the granularity of the tasks, which typically goes hand in hand with the size of blocs used to partition the problem's data. Small granularity do not allow to efficiently use accelerators such as GPUs which require a small amount of task with massive inner data-parallelism in order to obtain peak performance. Inversely, processors typically exhibit optimal performances with a big amount of tasks possessing smaller granularities. The choice of the task granularity not only depends on the type of computing units on which it will be executed, but in addition it will influence the quantity of parallelism available in the system: too many small tasks may flood the runtime system by introducing overhead, whereas too many small tasks may create a parallelism deficiency. Currently, most approaches rely on finding a compromise granularity of tasks which does not make optimal use of both CPU and accelerator resources. The objective of this thesis is to solve this granularity problem by aggregating resources in order to view them not as many small resources but fewer larger ones collaborating to the execution of the same task. One theoretical machine and scheduling model allowing to represent this process exists since several decades: the parallel tasks. The main contributions of this thesis are to make practical use of this model by implementing a parallel task mechanism inside StarPU and to implement and study parallel task schedulers of the literature. The validation of the model is made by improving the programmation and optimizing the execution of numerical applications on top of modern computing machines.

FERREIRA, Davi Morais. Integração de bibliotecas científicas de propósito especial em uma plataforma de componentes paralelos. 2010. 145 f. : Dissertação (mestrado) - Universidade Federal do Ceará, Centro de Ciências, Departamento de Computação, Fortaleza-CE, 2010. / Submitted by guaracy araujo (guaraa3355@gmail.com) on 2016-06-16T17:50:44Z No. of bitstreams: 1 2010_dis_dmf.pdf: 1977126 bytes, checksum: 8f6276f7e40d8f3dbdca5deb5a0a8447 (MD5) / Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-16T17:51:57Z (GMT) No. of bitstreams: 1 2010_dis_dmf.pdf: 1977126 bytes, checksum: 8f6276f7e40d8f3dbdca5deb5a0a8447 (MD5) / Made available in DSpace on 2016-06-16T17:51:57Z (GMT). No. of bitstreams: 1 2010_dis_dmf.pdf: 1977126 bytes, checksum: 8f6276f7e40d8f3dbdca5deb5a0a8447 (MD5) Previous issue date: 2010 / The contribution of traditional scienti c libraries shows to be consolidated in the construction of high-performance applications. However, such an artifact of development possesses some limitations in integration, productivity in large-scale applications, and exibility for changes in the context of the problem. On the other hand, the development technology based on components recently proposed a viable alternative for the architecture of High-Performance Computing (HPC) applications, which has provided a means to overcome these challenges. Thus we see that the scienti c libraries and programming orientated at components are complementary techniques in the improvement of the development process of modern HPC applications. Accordingly, this work aims to propose a systematic method for the integration of scienti c libraries on a platform of parallel components, HPE (Hash Programming Environment), to o er additional advantageous aspects for the use of components and scienti c libraries to developers of parallel programs that implement high-performance applications. The purpose of this work goes beyond the construction of a simple encapsulation of the library in a component; it aims to provide the bene ts in integration, productivity in large-scale applications, and the exibility for changes in the context of a problem in the use of scienti c libraries. As a way to illustrate and validate the method, we have incorporated the libraries of linear systems solvers to HPE, electing three signi cant representatives: PETSc, Hypre, e SuperLU. / A contribuição das tradicionais bibliotecas cientí cas mostra-se consolidada na construção de aplicações de alto desempenho. No entanto, tal artefato de desenvolvimento possui algumas limitações de integração, de produtividade em aplicações de larga escala e de exibilidade para mudanças no contexto do problema. Por outro lado, a tecnologia de desenvolvimento baseada em componentes, recentemente proposta como alternativa viável para a arquitetura de aplicações de Computação de Alto Desempenho (CAD), tem fornecido meios para superar esses desa os. Vemos assim, que as bibliotecas cientí cas e a programação orientada a componentes são técnicas complementares na melhoria do processo de desenvolvimento de aplicações modernas de CAD. Dessa forma, este trabalho tem por objetivo propor um método sistemático para integração de bibliotecas cientí cas sobre a plataforma de componentes paralelos HPE (Hash Programming Environment ), buscando oferecer os aspectos vantajosos complementares do uso de componentes e de bibliotecas cientí cas aos desenvolvedores de programas paralelos que implementam aplicações de alto desempenho. A proposta deste trabalho vai além da construção de um simples encapsulamento da biblioteca em um componente, visa proporcionar ao uso das bibliotecas cientí cas os benefícios de integração, de produtividade em aplicações de larga escala e da exibilidade para mudanças no contexto do problema. Como forma de exempli car e validar o método, temos incorporado bibliotecas de resolução de sistemas lineares ao HPE, elegendo três representantes significativos: PETSc, Hypre e SuperLU.

Submitted by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-11-27T11:58:14Z No. of bitstreams: 1 arquivototal.pdf: 8972192 bytes, checksum: e0a82ad433e62b83d048d78778d60dd2 (MD5) / Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2015-11-30T10:51:37Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 8972192 bytes, checksum: e0a82ad433e62b83d048d78778d60dd2 (MD5) / Made available in DSpace on 2015-11-30T10:51:37Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 8972192 bytes, checksum: e0a82ad433e62b83d048d78778d60dd2 (MD5) Previous issue date: 2013-04-12 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Here we present a research about fractals, its history, mathematical concepts and applications. Some constructions were developed using some basic concepts of the Theory of Numbers, Trigonometry and Linear Algebra that can be applied in High School. We presented some activities that can be applied in High School’s classes in order to develop mathematical concepts such as geometric transformations, Geometry, Trigonometry, Logarithm, notions of limit among other topics. Keywords: Fractal Geometry, Geometric Transformation, Logarithm, Pascal Triangle, Arrays, Linear Algebra, High School. / Este trabalho apresenta uma pesquisa sobre os fractais, sua história, conceitos matemáticos utilizados e aplicações. Foram desenvolvidas algumas construções de fractais utilizando-se alguns conceitos básicos de Teoria dos Números, Trigonometria e Álgebra Linear que podem ser explorados no Ensino Médio. Foram apresentadas algumas atividades que podem ser aplicadas em sala de aula do Ensino Médio no desenvolvimento de conceitos matemáticos como Progressão Geométrica, Geometria, Trigonometria, Logaritmo e noções de limite entre outros temas.

Made available in DSpace on 2015-05-15T11:46:13Z (GMT). No. of bitstreams: 0 Previous issue date: 2013-08-15 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This work is a study of linear systems from the perspective of linear algebra. We will use the concepts of matrix, vector, linear combination, linear dependence and independence, vector space, basis and dimension. We will also calculate the determinants and implications. Our aim is to present the rudiments of Linear Algebra as helper tool in solving linear systems and display its geometry. We want it to manufacture a auxiliary text that can be explored by students and high school teachers, and so gently introducing this powerful mathematical tool. Throughout the text will be covered also some historical aspects. / Este trabalho é um estudo de sistemas lineares sob uma perspectiva da Álgebra Linear. Utilizaremos os conceitos de matriz, vetor, combinação linear, dependência e independência linear, espaço vetorial, base e dimensão. Faremos também o cálculo de determinantes e implicações. Nosso intuito é apresentar os rudimentos da álgebra linear como ferramenta auxiliadora na resolução de sistemas lineares e exibir a sua geometria. Queremos com isto confeccionar um texto auxiliar que possa ser explorado por estudantes e professores do Ensino Médio e, assim, suavemente introduzindo esta poderosa ferramenta da matemática. No decorrer do texto serão abordados também alguns aspectos históricos.

La résolution de systèmes d'équations linéaires creux est au cœur de nombreux domaines d'applications. De même que la quantité de ressources de calcul augmente dans les architectures modernes, offrant ainsi de nouvelles perspectives, la taille des problèmes rencontré de nos jours dans les applications de simulations numériques augmente aussi et de façon significative. L'exploitation des architectures modernes pour la résolution efficace de problèmes de très grande taille devient ainsi un défit a relever, aussi bien d'un point de vue théorique que d'un point de vue algorithmique. L'objectif de cette thèse est d'adresser les problèmes de scalabilité des solveurs creux directs basés sur les méthodes multifrontales en environnements parallèles asynchrones. Dans la première partie de la thèse, nous nous intéressons a l'exploitation du parallélisme multicoeur sur les architectures a mémoire partagée. Nous introduisons une variante de l'algorithme Geist-Ng afin de gérer aussi bien un parallélisme a grain fin, a travers l'utilisation de librairies BLAS séquentiel et parallèle optimisées, que d'un parallélisme a plus gros grain, a travers l'utilisation de parallélisme a base de directives OpenMP. Nous considérons aussi des aspects mémoire afin d'améliorer les performances sur des architectures NUMA: (i) d'une part, nous analysons l'influence de la localité mémoire et utilisons des stratégies d'allocation mémoire adaptatives pour gérer les espaces de travail privés et partagés; (ii) d'autre part, nous nous intéressons au problème de partages de ressources sur les architectures multicoeurs, qui induisent des pénalités en termes de performances. Enfin, afin d'éviter que des ressources ne reste inertes a la fin de l'exécution de leurs taches, et ainsi, afin d'exploiter au mieux les ressources disponibles, nous proposons un algorithme conceptuellement proche de l'approche dite de vol de travail, et qui consiste a assigner les ressources de calculs inactives au taches de travail actives de façon dynamique. Dans la deuxième partie de cette thèse, nous nous intéressons aux architectures hybrides, a base de mémoire partagées et de mémoire distribuées, pour lesquels un travail particulier est nécessaire afin d'améliorer la scalabilité du traitement de problèmes de grande taille. Nous étudions et optimisons tout d'abord les noyaux d'algèbre linéaire danse utilisé dans les méthodes multifrontales en environnent distribué asynchrone, en repensant les variantes right-looking et left-looking de la factorisation LU avec pivotage partiel dans notre contexte distribué. De plus, du fait du parallélisme multicoeurs, la proportion des communications relativement aux calculs et plus importante. Nous expliquons comment construire des algorithmes de mapping qui minimisent les communications entres nœuds de l'arbre de dépendances de la méthode multifrontale. Nous montrons aussi que les communications asynchrones collectives deviennent christiques sur grand nombres de processeurs, et que les broadcasts asynchrones a base d'arbres de broadcast doivent être utilisés. Nous montrons ensuite que dans un contexte multifrontale complètement asynchrone, où plusieurs instances de tels communications ont lieux, de nouveaux problèmes de synchronisation apparaissent. Nous analysons et caractérisons les situations de deadlock possibles et établissons formellement des propriétés générales simples afin de résoudre ces problèmes de deadlock. Nous établissons par la suite des propriétés nous permettant de relâcher les synchronisations induites par la solutions précédentes, et ainsi, d'améliorer les performances. Enfin, nous montrons que les synchronisations peuvent être relâchées dans un solveur creux danse et illustrons les gains en performances, sur des problèmes de grande taille issue d'applications réelles, dans notre environnement multifrontale complètement asynchrone. / The solution of sparse systems of linear equations is at the heart of numerous applicationfields. While the amount of computational resources in modern architectures increases and offersnew perspectives, the size of the problems arising in today’s numerical simulation applicationsalso grows very much. Exploiting modern architectures to solve very large problems efficiently isthus a challenge, from both a theoretical and an algorithmic point of view. The aim of this thesisis to address the scalability of sparse direct solvers based on multifrontal methods in parallelasynchronous environments.In the first part of this thesis, we focus on exploiting multi-threaded parallelism on sharedmemoryarchitectures. A variant of the Geist-Ng algorithm is introduced to handle both finegrain parallelism through the use of optimized sequential and multi-threaded BLAS libraries andcoarser grain parallelism through explicit OpenMP based parallelization. Memory aspects arethen considered to further improve performance on NUMA architectures: (i) on the one hand,we analyse the influence of memory locality and exploit adaptive memory allocation strategiesto manage private and shared workspaces; (ii) on the other hand, resource sharing on multicoreprocessors induces performance penalties when many cores are active (machine load effects) thatwe also consider. Finally, in order to avoid resources remaining idle when they have finishedtheir share of the work, and thus, to efficiently exploit all computational resources available, wepropose an algorithm wich is conceptually very close to the work-stealing approach and whichconsists in dynamically assigning idle cores to busy threads/activities.In the second part of this thesis, we target hybrid shared-distributed memory architectures,for which specific work to improve scalability is needed when processing large problems. We firststudy and optimize the dense linear algebra kernels used in distributed asynchronous multifrontalmethods. Simulation, experimentation and profiling have been performed to tune parameterscontrolling the algorithm, in correlation with problem size and computer architecture characteristics.To do so, right-looking and left-looking variants of the LU factorization with partialpivoting in our distributed context have been revisited. Furthermore, when computations are acceleratedwith multiple cores, the relative weight of communication with respect to computationis higher. We explain how to design mapping algorithms minimizing the communication betweennodes of the dependency tree of the multifrontal method, and show that collective asynchronouscommunications become critical on large numbers of processors. We explain why asynchronousbroadcasts using standard tree-based communication algorithms must be used. We then showthat, in a fully asynchronous multifrontal context where several such asynchronous communicationtrees coexist, new synchronization issues must be addressed. We analyse and characterizethe possible deadlock situations and formally establish simple global properties to handle deadlocks.Such properties partially force synchronization and may limit performance. Hence, wedefine properties which enable us to relax synchronization and thus improve performance. Ourapproach is based on the observation that, in our case, as long as memory is available, deadlockscannot occur and, consequently, we just need to keep enough memory to guarantee thata deadlock can always be avoided. Finally, we show that synchronizations can be relaxed in astate-of-the-art solver and illustrate the performance gains on large real problems in our fullyasynchronous multifrontal approach.

Submitted by Franciele Moreira (francielemoreyra@gmail.com) on 2018-11-12T12:12:57Z No. of bitstreams: 2 Dissertação - Luciane Nunes Ribeiro - 2018.pdf: 1973828 bytes, checksum: b219699558677772c9abb1ebe0b5d42f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-11-12T13:10:00Z (GMT) No. of bitstreams: 2 Dissertação - Luciane Nunes Ribeiro - 2018.pdf: 1973828 bytes, checksum: b219699558677772c9abb1ebe0b5d42f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-11-12T13:10:00Z (GMT). No. of bitstreams: 2 Dissertação - Luciane Nunes Ribeiro - 2018.pdf: 1973828 bytes, checksum: b219699558677772c9abb1ebe0b5d42f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-09-20 / This research analyzes the constitution's movements of the University in Europe and in Brazil; the creation of Mathematics’ first course in Brazil; the constitution of the contents which make up the Linear Algebra discipline syllabus and, finally, its current discipline syllabus in the presential courses in Mathematics Degree of the Brazilian Federal Universities. The purpose of the mentioned analysis is to answer the following research question: how did occur the contents' constitution that compose the syllabus of Linear Algebra in Mathematics degrees of Brazilian Federal Universities? In order to reach this objective, the bibliographical and documentary study were used as methodology, especially classical, history and yearbooks, legislation and the syllabus. The theoretical reference is based on Historical-Cultural Theory assumptions, which is scientific, but also political (MOURA, 2017; VYGOTSKI, 1995; CEDRO, 2008; OLIVEIRA, 2002; ZANELLA, 2007), through the study of logical- historical movement – defended by Kopnin, 1978; Sousa, Panossian, Cedro, 2014; Sousa, 2004; Fazenda, 2000 – of Algebra Linear discipline constitution, according to Pires, 2006; Dorier, 2000, Silva, 2003; Moore, 1995. It was necessary to understand the reasons of its inclusion in the university context and its contribution to the professional formation of Mathematics teacher, according to Bastos (1980; 2006), Boyer (1974), Cavalari (2012), Celestino (2000), Garding (1981), Kopnin (1978), Caraça (1959), Ríbnikov (1987), Tubino (1984), Kleiner (2007), among others. It was analyzed 55 Federal Brazilian Universities that offer presential course of Degree in Mathematics. As categories of analysis were stablished the content of syllabus, the workload and the basic bibliographic reference of compulsory discipline of Linear Algebra of these institutions. As more relevant conclusions, it was observed that Linear Algebra began to be developed and taught in Universities to solve practical problems of diverse intellectuals of engineering and exact sciences, and that the transfer of its indexes in an unrelated way may contribute to the difficulties in teaching and learning process present in this discipline. / Matemática das Universidades Federais Brasileiras. O objetivo dessa análise é o de responder à seguinte questão de pesquisa: como se deu a constituição dos conteúdos que compõem a ementa da disciplina de Álgebra Linear nos cursos de Licenciatura em Matemática das Universidades Federais Brasileiras? Para atingir o objetivo, utilizou-se como metodologia o estudo bibliográfico e documental, mormente de obras clássicas, livros de história, anuários, legislação e ementas. O referencial teórico é pautado nos pressupostos da Teoria Histórico-Cultural, que se constitui científica, mas também política (MOURA, 2017; VYGOTSKI, 1995; CEDRO, 2008; OLIVEIRA, 2002; ZANELLA, 2007), mediante o estudo do movimento lógico-histórico – apregoado por Kopnin, 1978; Sousa, Panossian, Cedro, 2014; Sousa, 2004; Fazenda, 2000 – de constituição da disciplina de Álgebra Linear (PIRES, 2006; DORIER, 2000, SILVA, 2003; MOORE, 1995). Fez-se necessário compreender o que motivou a sua inserção no contexto universitário e qual a sua contribuição para a formação do professor de Matemática, com base em Bastos (1980; 2006), Boyer (1974), Cavalari (2012), Celestino (2000), Garding (1981), Kopnin (1978), Caraça (1959), Ríbnikov (1987), Tubino (1984), Kleiner (2007), entre outros. Foram analisadas 55 Universidades Federais Brasileiras que oferecem o curso presencial de Licenciatura em Matemática. Estabeleceram-se como categorias de análise os conteúdos das ementas, a carga horária e a referência bibliográfica básica da disciplina obrigatória de Álgebra Linear oferecida nestas instituições. Como principais conclusões, observou-se que a disciplina de Álgebra Linear começou a ser desenvolvida e ensinada nas Universidades para resolver problemas práticos de diversos intelectuais das engenharias e ciências correlatas, e que o repasse de seus conteúdos de forma desvinculada pode contribuir para as dificuldades do processo de ensino e aprendizagem presentes nessa disciplina.