• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 98
  • 40
  • 5
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 179
  • 179
  • 55
  • 45
  • 39
  • 37
  • 25
  • 23
  • 23
  • 20
  • 19
  • 16
  • 16
  • 15
  • 15
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
91

Autocorrelation and decomposition methods in combinational logic design

Tomczuk, Randal Wade 19 July 2018 (has links)
This dissertation shows that the autocorrelation of switching functions can be effectively utilized in combinational logic optimization and synthesis. The procedures developed exploit information contained in the autocorrelation of switching functions to perform optimization of Programmable Logic Arrays (PLAs) and to aid in a multi-level logic synthesis approach called two-place decomposition. A new optimization technique is presented, based on the autocorrelation of switching functions, to find near-optimal variable pairings for decoded PLAs. The results of this approach compare favourably to those of other researchers’ techniques. The key advantages of the new approach are its simplicity and its efficiency. The basic two-place decomposition approach is augmented with various enhancements. These include an improved decomposition merge procedure, the addition of alternate mapping functions for complex disjunctive decompositions, and the incorporation of linearization using the autocorrelation to handle functions that are non-two-place decomposable. A robust implementation of the enhanced method is presented and is used to generate function realizations for comparison with other synthesis methods. The enhanced two-place decomposition method is shown to perform particularly well for functions exhibiting high degrees of symmetry. The dissertation also presents a new synthesis technique that utilizes a particular representation of a switching function called a Reduced Ordered Binary Decision Diagram (ROBDD) and is targeted to two-place decomposition. This new technique allows the two-place decomposition approach to synthesize a much broader range of functions. Although, in comparison to one other synthesis method, the new approach does not perform as well in most cases, it has considerable promise and several enhancements are proposed for improvement. This dissertation also shows that there is a strong connection among autocorrelation, two-place decomposition, and good variable orders in an ROBDD. A first attempt to formally analyze the relationship between autocorrelation and two-place decomposition is presented. Relationships are identified between certain autocorrelation coefficients when particular two-place decompositions exist in a function. These relationships are also connected to the heuristics used in the above mentioned PLA optimization technique. Variable order can have a substantial impact on the size of an ROBDD. This dissertation shows that a good variable order is related to the two-place decompositions that are exhibited in a function. Thus, variable order is also related to the autocorrelation and this relationship can lead to an autocorrelation-based technique for determining good variable orders for ROBDDs. / Graduate
92

Jogos em uma sequência didática para o ensino de análise combinatória

Ambrozi, Luiz 13 December 2017 (has links)
Neste trabalho desenvolve-se uma proposta de ensino para aprimorar o raciocínio combinatório, através da utilização de jogos no planejamento, na aplicação e avaliação de uma sequência didática inspirada nas orientações de Zabala, para subsidiar a prática docente no ensino de Análise Combinatória. A dissertação relata uma pesquisa que teve o intuito de explorar conceitos combinatórios por meio de atividades diversificadas, envolvendo recursos digitais, jogos e estudos orientados, a fim de fortalecer e diversificar o ensino e a aprendizagem deste conteúdo, procurando tornar as aulas mais atrativas e dinâmicas. Alguns dos jogos utilizados para a criação da sequência didática não são originais, outros já foram aplicados por pesquisadores ou professores, porém, aqui, foram reorganizados, ajustados ou adaptados de modo a adequar e potencializar a sua utilização, no contexto da prática elaborada. As várias atividades, promovidas para a realização dos jogos ou as de etapa posterior, foram planejadas de modo a explorar o raciocínio combinatório. A pesquisa é fundamentada na visão construtivista do fazer e compreender, de Piaget, e resultou como produto deste trabalho uma sequência didática denominada Dinâmica Combinatória, que integra as atividades dinamizadas numa sequência de ensino que envolve ações, direcionadas para a compreensão dos conceitos combinatórios. Juntamente com este processo de compreensão, construiu-se um espaço para os alunos explorarem, com orientação do professor, toda a simbologia que contempla o conteúdo de Análise Combinatória, a fim de que conhecessem as fórmulas que integram as técnicas de contagem. Por fim, faz-se uma avaliação da aprendizagem, com a utilização do Jogo Trilha Combinatória, criado especialmente para a aplicação dos conhecimentos construídos, por meio das ações que constituem as jogadas, verificando se ocorreu aprendizagem. A análise dos dados obtidos com a pesquisa foi qualitativa, e avaliou formulários, diários de anotações, registros fotográficos, entre outros e revelou aprendizagens e envolvimento dos estudantes para além das expectativas do pesquisador. Conclui-se que a Dinâmica Combinatória tornou-se um recurso didático potencial para a aprendizagem e o desenvolvimento do raciocínio combinatório, propiciando um processo de ensino e aprendizagem de Análise Combinatória dinâmico e atrativo. / Submitted by cmquadros@ucs.br (cmquadros@ucs.br) on 2018-02-15T13:28:13Z No. of bitstreams: 1 Dissertacao Luiz Ambrozi.pdf: 3064720 bytes, checksum: fe1edd8c7258cb7e11b71ceb23d3928c (MD5) / Made available in DSpace on 2018-02-15T13:28:13Z (GMT). No. of bitstreams: 1 Dissertacao Luiz Ambrozi.pdf: 3064720 bytes, checksum: fe1edd8c7258cb7e11b71ceb23d3928c (MD5) Previous issue date: 2018-02-15 / In this paper, a teaching proposal is developed to improve the combinatorial reasoning through the use of games in the planning, application and assessment of a didactic sequence, inspired by Zabala guidelines, to subsidize the teaching practice in Combinatorial Analysis teaching. The dissertation reports a research that aims to explore combinatorial concepts through diversified activities, involving digital resources, games and guided studies, in order to strengthen and diversify the teaching- learning process of this content, trying to make classes more attractive and dynamic. Some of the games used to create the didactic sequence are not original and some of them have already been applied by other researchers or teachers, but in this paper they have been reorganized, adapted and tailored to make them suitable and enhance their use in the practice context. The several activities, promoted for the accomplishment of the games or those of a later stage, were planned aiming to explore the combinatorial reasoning. The research is based on Piaget 's constructivist view of ” the doing and the understanding “ and resulted in a didactic sequence called Combinatorial Dynamics, which integrates the energized activities in a teaching sequence involving actions directed towards the understanding of the combinatorial concepts. Together with this process of comprehension, a space was built for students to explore, with the teacher's guidance, all the symbology that contemplates the content of Combinatorial Analysis, getting them to know the formulas which integrate the counting techniques. Finally, an evaluation of learning is made, using the Combination Track Game, created specially for the application of the constructed knowledge through games, verifying if the learning process was achieved. The research results are from a qualitative analysis that evaluated forms, journals, photographic records, among others and revealed students' learning and involvement beyond the researcher's expectations. It is concluded that Combinatorial Dynamics has become a potential didactic resource for the learning process and for the development of combinatorial reasoning, providing a dynamic and attractive Combinatorial Analysis Teaching and Learning process.
93

Jogos em uma sequência didática para o ensino de análise combinatória

Ambrozi, Luiz 13 December 2017 (has links)
Neste trabalho desenvolve-se uma proposta de ensino para aprimorar o raciocínio combinatório, através da utilização de jogos no planejamento, na aplicação e avaliação de uma sequência didática inspirada nas orientações de Zabala, para subsidiar a prática docente no ensino de Análise Combinatória. A dissertação relata uma pesquisa que teve o intuito de explorar conceitos combinatórios por meio de atividades diversificadas, envolvendo recursos digitais, jogos e estudos orientados, a fim de fortalecer e diversificar o ensino e a aprendizagem deste conteúdo, procurando tornar as aulas mais atrativas e dinâmicas. Alguns dos jogos utilizados para a criação da sequência didática não são originais, outros já foram aplicados por pesquisadores ou professores, porém, aqui, foram reorganizados, ajustados ou adaptados de modo a adequar e potencializar a sua utilização, no contexto da prática elaborada. As várias atividades, promovidas para a realização dos jogos ou as de etapa posterior, foram planejadas de modo a explorar o raciocínio combinatório. A pesquisa é fundamentada na visão construtivista do fazer e compreender, de Piaget, e resultou como produto deste trabalho uma sequência didática denominada Dinâmica Combinatória, que integra as atividades dinamizadas numa sequência de ensino que envolve ações, direcionadas para a compreensão dos conceitos combinatórios. Juntamente com este processo de compreensão, construiu-se um espaço para os alunos explorarem, com orientação do professor, toda a simbologia que contempla o conteúdo de Análise Combinatória, a fim de que conhecessem as fórmulas que integram as técnicas de contagem. Por fim, faz-se uma avaliação da aprendizagem, com a utilização do Jogo Trilha Combinatória, criado especialmente para a aplicação dos conhecimentos construídos, por meio das ações que constituem as jogadas, verificando se ocorreu aprendizagem. A análise dos dados obtidos com a pesquisa foi qualitativa, e avaliou formulários, diários de anotações, registros fotográficos, entre outros e revelou aprendizagens e envolvimento dos estudantes para além das expectativas do pesquisador. Conclui-se que a Dinâmica Combinatória tornou-se um recurso didático potencial para a aprendizagem e o desenvolvimento do raciocínio combinatório, propiciando um processo de ensino e aprendizagem de Análise Combinatória dinâmico e atrativo. / In this paper, a teaching proposal is developed to improve the combinatorial reasoning through the use of games in the planning, application and assessment of a didactic sequence, inspired by Zabala guidelines, to subsidize the teaching practice in Combinatorial Analysis teaching. The dissertation reports a research that aims to explore combinatorial concepts through diversified activities, involving digital resources, games and guided studies, in order to strengthen and diversify the teaching- learning process of this content, trying to make classes more attractive and dynamic. Some of the games used to create the didactic sequence are not original and some of them have already been applied by other researchers or teachers, but in this paper they have been reorganized, adapted and tailored to make them suitable and enhance their use in the practice context. The several activities, promoted for the accomplishment of the games or those of a later stage, were planned aiming to explore the combinatorial reasoning. The research is based on Piaget 's constructivist view of ” the doing and the understanding “ and resulted in a didactic sequence called Combinatorial Dynamics, which integrates the energized activities in a teaching sequence involving actions directed towards the understanding of the combinatorial concepts. Together with this process of comprehension, a space was built for students to explore, with the teacher's guidance, all the symbology that contemplates the content of Combinatorial Analysis, getting them to know the formulas which integrate the counting techniques. Finally, an evaluation of learning is made, using the Combination Track Game, created specially for the application of the constructed knowledge through games, verifying if the learning process was achieved. The research results are from a qualitative analysis that evaluated forms, journals, photographic records, among others and revealed students' learning and involvement beyond the researcher's expectations. It is concluded that Combinatorial Dynamics has become a potential didactic resource for the learning process and for the development of combinatorial reasoning, providing a dynamic and attractive Combinatorial Analysis Teaching and Learning process.
94

Aplicações do principio da inclusão e exclusão / Applications of the inclusion and exclusion principle

Assis, Luciana Mafalda Elias de 24 November 2006 (has links)
Orientador: Andreia Cristina Ribeiro / Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica / Made available in DSpace on 2018-08-11T11:28:46Z (GMT). No. of bitstreams: 1 Assis_LucianaMafaldaEliasde_M.pdf: 10126493 bytes, checksum: bb2628e76f90df6deb24a9011e535714 (MD5) Previous issue date: 2008 / Resumo: Neste trabalho são apresentados vários resultados importantes da Análise Combinatória com destaque para o Princípio da Inclusão e Exclusão. Relevantes aplicações deste princípio são abordadas / Abstract: In this work we present important results from enumerative combinatorics, with an emphasis on the Principle of Inclusion and Exclusion. Relevant applications of this principle are presented to illustrate its use / Mestrado / Mestre em Matemática
95

Combinatorial design via association scheme

Zhang, Yonglin 01 January 2004 (has links)
No description available.
96

Semisimplicity for Hopf algebras

Stutsman, Michelle Diane 01 January 1996 (has links)
No description available.
97

Webs and Foams of Simple Lie Algebras

Thatte, Mrudul Madhav January 2023 (has links)
In the first part of the dissertation, we construct two-dimensional TQFTs which categorify the evaluations of circles in Kuperberg’s 𝐵₂ spider. We give a purely combinatorial evaluation formula for these TQFTs and show that it is compatible with the trace map on the corresponding commutative Frobenius algebras. Furthermore, we develop a theory of Θ-foams and their combinatorial evaluations to lift the ungraded evaluation of the Θ-web, thus paving a way for categorifying 𝐵₂ webs to 𝐵₂ foams. In the second part of the dissertation, we study the calculus of unoriented 𝔰𝔩₃ webs and foams. We focus on webs with a small number of boundary points. We obtain reducible collections and consider bilinear forms on these collections given by pairings of webs. We give web categories stable under the action of certain endofunctors and derive relations between compositions of these endofunctors.
98

The Difficulty and Accessibility of Combinatorics Problems: Evidence from Large-scale Assessments and Student Interviews

Carnauba, Fernando January 2024 (has links)
The objective of this dissertation was to explore the paradoxical nature of Combinatorics as both a difficult and accessible domain in Mathematics, particularly for K-12 students. This paradox in Combinatorics' nature raised questions about how students interact with problems in this domain and the factors influencing their understanding and engagement with mathematics. To investigate these aspects, the study utilized a mixed-methods approach. Quantitative data was derived from the Exame Nacional do Ensino Médio (ENEM), a large-scale nationwide assessment in Brazil. The analysis focused on 28 Combinatorics problems identified across 12 years of the exam, comparing them with non-Combinatorics problems. The study also involved qualitative methods, specifically task-based interviews with Brazilian students, primarily from disadvantaged school backgrounds. These interviews aimed to provide deeper insights into how students approach, understand, and engage with Combinatorics problems. The findings revealed that while the combinatorial domain is notably accessible in the sense that it allows students with varied backgrounds to understand what problems ask, this accessibility does not necessarily translate into students consistently arriving at correct solutions. The study also found that achievement gaps between students of private and public schools in Brazil are smaller in Combinatorics is than in other mathematical domains. Together, these findings point to Combinatorics as a domain that can contribute to issues of equity in mathematics teaching and learning. Furthermore, the research underscored the importance of considering both the 'product' (correct answers) and 'process' (mathematical thinking) aspects in mathematics education, especially in contexts aiming to promote equitable learning opportunities.
99

Partially ordered sets with hooklengths : an algorithmic approach.

Sagan, Bruce Eli. January 1979 (has links)
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 1979 / Vita. / Bibliography: leaves 96-98. / Ph. D. / Ph. D. Massachusetts Institute of Technology, Department of Mathematics
100

Ensinando matemática por meio de situações potencialmente adidáticas: estudo de casos envolvendo análise combinatória / Teaching mathematics through potentially adidactic situations: case studies involving combinatorial analysis.

Lima, Wanessa Aparecida Trevizan de 23 February 2015 (has links)
Diante de um cenário de contradições do atual ensino da Matemática, no qual a prática tem se revelado insatisfatória para se alcançar os objetivos declarados para tal disciplina em documentos oficiais, sugerimos a situação adidática, um conceito da Teoria das Situações de Brousseau (1933-), como ferramenta para uma aprendizagem matemática mais autônoma, ou seja, uma aprendizagem que possibilite o desenvolvimento de habilidades investigativas, interpretativas, críticas e criativas. A Teoria das Situações, elaborada pelo pesquisador francês Brousseau, é uma ferramenta de análise. Desse modo, a situação adidática é um conceito que permite modelar determinadas situações de aprendizagem a serem analisadas. O objetivo do presente trabalho é mostrar que este conceito também serve como instrumento metodológico, à medida que o docente, de posse dele, pode planejar situações potencialmente adidáticas em sala de aula. Baseada nesta teoria e em outras da Didática Francesa, bem como nas concepções de aprendizagem e desenvolvimento de Vigotski (1896-1934), buscamos analisar a aplicação de uma Sequência Didática em três momentos diferentes, os quais revelam três cenários escolares também distintos e três passagens da minha experiência como pesquisadora e docente. A Sequência Didática, planejada visando potencializar uma situação adidática, aborda o tema Análise Combinatória através de uma narrativa ficcional com desafios voltados para o Ensino Médio. Ao longo desse estudo, pudemos alcançar muito mais do que pretendíamos: percebemos que há fatores presentes na escola (independente de ser pública ou privada) que favorecem e fatores que desfavorecem o surgimento de uma situação adidática. No entanto, prosseguimos acreditando que planejar as aulas visando promover situações adidáticas, com todas as limitações presentes em nossa realidade educacional, é o melhor caminho para se chegar aos objetivos pretendidos para o ensino de Matemática, levando-se em conta as concepções de aprendizagem por nós adotadas. / Facing a background of dramatic contradictions of the current mathematics teaching, in which the practice has been insufficient to achieve the stated objectives for such discipline in official documents, we suggest adidactic situation, a concept of Brousseaus (1933-)Theory of Situations, as a tool for learning mathematics more autonomous, ie, a learning that enables the development of investigative, interpretive, critical and creative skills. The Theory of Situations, prepared by the French researcher Brousseau, is an analysis tool. Thus, adidactic situation is a concept that allows to model certain learning situations to be analyzed. The objective of this paper is to show that this concept also serves as a methodological tool, as the teacher, holding it, can plan potentially adidactic situations in the classroom. Based on this theory and others of the French didactics, as well as in the conceptions of learning and development of Vygotsky (1896-1934), we analyze the application of a Teaching Sequence in three different moments, which also reveal three different school settings and three passes from my experience as a researcher and teacher. The Didactic Sequence, planned aiming at intensifying one adidactic situation, addresses the topic of Combinatorial Analysis through a fictional narrative with challenges facing High School. Throughout this study, we could achieve far more than we wanted: we realized that there are factors present in school (whether it be public or private) that favor and factors that disfavor the emergence of anadidactic situation. However, we continue to believe that planning lessons to promote adidactic situations, with all the limitations present in our educational reality is the best way to reach the objectives intended to mathematics teaching, taking into account the conceptions of learning we adopted.

Page generated in 0.0806 seconds