The objective of this multiple case study was to examine how three pairs of high school students from a northern Vermont high school approached quadratic functions through traditional and multiple representation tasks. Four research questions were examined: 1) How do students think about the quadratic function as they work on a series of tasks? 2) What mathematical strategies do students employ when they work on a series of tasks related to the quadratic function? 3) How does the type of task, traditional versus multiple representation, impact students' understanding of the quadratic function? 4) What kinds of knowledge (procedural or conceptual) do students utilize when completing a series of tasks about the quadratic function? Qualitative research methods that utilized think-aloud protocols while students were engaged in four tasks pertaining to the quadratic function were employed in this study. Results suggested that students tend to think about isolated parts of the problem when solving quadratic problems. Early on in their learning about quadratics, students primarily relied on procedural strategies such as think-alouds, gestures, algebraic formulas, converting equation forms, process of elimination, dissecting problems, backtracking, and drawing pictures. In addition, students preferred the standard form to the vertex form when solving quadratics and often confused the y-intercept of the standard form with the y-coordinate of the vertex when the function was in vertex form. Results also indicated that students preferred to algebraically solve a problem versus tabular or graphical strategies. By exploring how students approach the quadratic function through their own voices, this study offers some insight into the conceptions and strategies that students use for solving problems that involve the quadratic function as well as possibilities for how quadratics may be taught in high school.

Les calculs numériques ont été effectués à l'aide du logiciel SAGE. / En 1993, Conway et Schneeberger fournirent un critère simple permettant de déterminer si une forme quadratique donnée représente tous les entiers positifs ; le théorème des 15. Dans ce mémoire, nous nous intéressons à un problème analogue, soit la recherche d’un critère similaire permettant de détecter si une forme quadratique en trois variables représente tous les entiers impairs. On débute donc par une introduction générale à la théorie des formes quadratiques, notamment en deux variables, puis on expose différents points de vue sous lesquels on peut les considérer. On décrit ensuite le théorème des 15 et ses généralisations, en soulignant les techniques utilisées dans la preuve de Bhargava. Enfin, on démontre deux théorèmes qui fournissent des critères permettant de déterminer si une forme quadratique ternaire représente tous les entiers impairs. / In 1993, Conway and Schneeberger gave a simple criterion allowing one to determine whether a given quadratic form represents all positive integers ; the 15-theorem. In this thesis, we investigate an analogous problem, that is the search for a similar criterion allowing one to detect if a quadratic form in three variables represents all odd integers. We start with a general introduction to the theory of quadratic forms, namely in two variables, then, we expose different points of view under which quadratic forms can be considered. We then describe the 15-theorem and its generalizations, with a particular emphasis on the techniques used in Bhargava’s proof of the theorem. Finally, we give a proof of two theorems which provide a criteria to determine whether a ternary quadratic form represents all odd integers.

This thesis deals with the description of constructive approach to teaching mathematics in the third grade of primary school. Teaching mathematics is focused on geometry, specifically on one way of introducing the area of the scalene triangle which describes the relation between a side and its height and corresponding area. In the thesis I describe six particular lessons, their preparation, process of their realization and my own reflections. In these lessons, I analyse some cognitive phenomena as well as social relationships among pupils. Furthermore, I present a detailed examination of tasks from the final diagnostic test, in which I aim towards proving success of this method of teaching mathematics. After four years, I attempt to verify the permanency of the knowledge pupils gained in these particular lessons. I illustrate this by presenting analysis of additional exercises. The whole experimental process was led within the method of releasing parameter. Individual lessons were in accordance with given stages of this method, as described in specialised literature. I verified that the above mentioned method is applicable in teaching mathematics even in the third grade of the primary school. KEYWORDS teachingstyles, perimeter and area, square grid, polygon, method of releasing parameter

<p>Utilizing action research as the methodology, this study was developed with the ultimate goal of describing and reflecting on my implementation of one aspect of the <i>Common Core State Standards for Mathematics (</i><i>CCSSM)</i> in an algebra classroom. This implementation focused on the Problem-Solving Standard of Mathematical Practice (SMP) as described in <i>CCSSM </i>(Making sense of problems and persevere in solving them). The research question that guided my work was the following: How is the <i>Common Core State Standards for Mathematics </i>(<i>CCSSM</i>) Problem-Solving Mathematical Standard enacted in an algebra class while using a <i>Standards-</i>based curriculum to teach a quadratics unit?</p> <p>I explored this by focusing on the following sub-questions:</p> <ul> <li>Q1. What opportunities to enact the components of the Problem-Solving Mathematical Standard are provided by the written curriculum? </li> <li>Q2. In what way does the teacher’s implementation of the quadratics unit diminish or enhance the opportunities to enact the components of the Problem-Solving Mathematical Standard provided by the written curriculum? </li> <li>Q3. In what ways does the teacher’s enactment of problem-solving opportunities change over the course of the unit? </li> </ul> <p>Reviewing the literature related to the relevant learning theories (sociocultural theory, the situated perspective, and communities of practice), I outlined the history of <i>CCSSM, </i>National Council of Teachers of Mathematics <i>(</i>NCTM), National Research Council (NRC), and the <i>No Child Left Behind Act of 2001</i>. Exploring the details of <i>CCSSM</i>’s Standards of Mathematical Content (SMCs) and Standards of Mathematical Practice (SMPs), I discussed problem solving, the Problem Solving Components (PSCs) listed in the Problem-Solving SMP of <i>CCSSM</i>, teaching through problem solving, and <i>Standards-</i>based curricula, such as <i>College Preparatory Mathematics (CPM)</i> which is the algebra curricula I chose for this study. </p> <p>There are many definitions of the construct problem solving. <i>CCSSM </i>describes this construct in unique ways specifically related to student engagement. The challenge for teachers is to not only make sense of <i>CCSSM</i>’s definition of problem solving and its components, but also to enact it in the classroom so that mathematical understanding is enhanced. For this reason, studies revealing how classroom teachers implemented <i>CCSSM</i>, especially in terms of problem solving, are necessary. </p> <p>The Critical Theoretic/Action Research Paradigm is often utilized by researchers trying to improve their own practice; thus, I opted for an action research methodology because it could be conducted by the practitioner. These methods of data collection and analysis were employed in order to capture the nature of changes made in the classroom involving my teaching practice. I chose action research because this study met the key tenets of research in action, namely, a collaborative partnership concurrent with action, and a problem-solving approach. </p> <p>While I knew how I wanted to change my classroom teaching style, implementing the change was harder than anticipated. From the onset, I never thought of myself as an absolute classroom authority, because I always maintained a relaxed classroom atmosphere where students were made to feel comfortable. However, this study showed me that students did view my presence as the authority and looked to me for correct answers, for approval, and/or for reassurance that they were on the right track. My own insecurities of not knowing how to respond to students in a way to get them to interact more with their group and stop looking to me for answers, while not being comfortable forcing students to talk in front of their peers, complicated this study. While it was easy to anticipate how I would handle situations in the classroom, it was hard to change in the moment. </p> <p>The research revealed the following salient findings: while the written curriculum contained numerous opportunities for students to engage with the Focal PSCs, the teacher plays a crucial role in enacting the written curriculum. Through the teacher’s enactment of this curriculum, opportunities for students to engage with the Focal<i> </i>PSCs can be taken away, enacted as written, or enhanced all by the teacher. Additionally, change was gradual and difficult due to the complexities of teaching. Reflection and constant adapting are crucial when it comes to changing my practice. </p> As a classroom teacher, I value the importance of the changes that need to be made in the classroom to align with <i>CCSSM</i>. I feel that by being both a teacher and a researcher, my work can bridge the gap between research and classroom practice.

Orientador: Carlos Roberto Padovani / Banca: Adriano Wagner Ballarin / Banca: Flávio Fekkari Aragon / Banca: José Carlos Martinez / Banca: Marie Oshiiwa / Resumo: Aspectos teóricos relacionados à Análise Discriminante Multivariada - Linear e Quadrática - foram discutidos, por meio de um extenso levantamento histórico da função discriminante, com seus primórdios no trabalho de Fisher e sua posterior evolução, enfocando o intenso desenvolvimento das técnicas classificatórias discriminantes com o advento dos computadores. Foi dada ênfase aos softwares estatísticos desenvolvidos para PC, que realizam a análise discriminante, e que representam uma grande contribuição para pesquisadores e usuários desta técnica. Considerando a dificuldade existente quanto a aplicativos computacionais acessíveis a pesquisadores da área de ciências agrárias, elaborou-se um programa que realiza a análise discriminante quadrática com as respectivas freqüências de classificação correta, bem como o manual explicativo do usuário. Verificou-se que a função discriminante quadrática trata de um procedimento bastante útil nas ciências agrárias, como, por exemplo, em estudos nas áreas de solos, cultivos diversos (soja, milho, cana de açúcar, pupunha, braquiária, frutas), criação de animais e classificação e seleção de madeiras; porém, subutilizada frente à dificuldade de programas computacionais de fácil manuseio e acesso a pesquisadores das áreas aplicadas. Os procedimentos estudados e discutidos foram ilustrados com exemplos de aplicação, utilizando dados experimentais agronômicos de espécies de Girassóis e Eucalyptus, submetidos ao aplicativo desenvolvido. / Abstract: A large historical study of the discriminant function has allowed a discussion on theoretical aspects related to the Multivaried Discriminant Analysis - Linear and Quadratic, showing its past in the work of Fisher and its later evolution, emphasizing the wide development of classificatory discriminant techniques with the happening of the computers, and specific statistic softwares which practice the discriminant analysis, representing a big contribution to researches and users of this technique. Considering the difficulty in relation to accessible softwares to researches of the agrarian area, a software which performs a linear and quadratic discriminant analysis was built with its frequencies of correct classification, as well as an explicative manual to users. The quadratic discriminant was studied as being a very useful process in agrarian sciences. Some examples of this usefulness is in studies of the ground, diversified cultivation (soybean, corn, sugarcane, pejibaye, brachiaria decumbens fruits), animal creation and wood selection, and classification; however, misused in relation to the difficulties of easy handing and access to researchers of applied areas. The studied and discussed procedures were illustrated with applications, using agronomic experimental data of Sunflower and Eucalyptus, submitted to developed software. / Doutor

Redes de sensores sem fio (RSSF) tipicamente consistem de nós sensores com limitação de energia, processamento, comunicação e memória. A segurança em RSSF está se tornando fundamental com o surgimento de aplicações que necessitam de mecanismos que permitam autenticidade, integridade e confidencialidade. Devido a limitações de recursos em RSSF, adequar criptossistemas de chaves públicas (PKC) para estas redes é um problema de pesquisa em aberto. Meados de 2008, Danilo Gligoroski et al. propuseram um novo PKC baseado em quase-grupos multivariados quadráticos (MQQ). Experimentos feitos por Gligoroski na plataforma FPGA mostram que MQQ executou em tempo menor que principais PKC (DH, RSA e ECC) existentes, tanto que alguns artigos afirmam que MQQ possui velocidade de uma típica cifra de bloco simétrica. Além disto, o MQQ exibiu o mesmo nível de segurança que outros PKC (DH, RSA e ECC) necessitando chaves menores. Outra propriedade que chama atenção no MQQ é o uso das operações básicas XOR, AND e deslocamento de bits nos processos de encriptação e decriptação, fato importante considerando que uma RSSF possui processamento limitado. Estas características tornam o MQQ promissor a levar um novo caminho na difícil tarefa de dotar redes de sensores sem fio de criptossistemas de chaves públicas. Neste contexto se insere este trabalho que analisa a viabilidade de implementar o algoritmo MQQ em uma plataforma de RSSF. Sendo importante considerar que este trabalho inova na proposta de levar para RSSF este novo PKC baseado quase-grupos multivariados quadráticos, além de contribuir com um método para reduzir o tamanho da chave pública utilizada pelo MQQ. Foram feitos testes com MQQ nas plataformas TelosB e MICAz, sendo que o MQQexibiu os tempos de 825; 1 ms para encriptar e 116; 6 ms para decriptar no TelosB e 445 ms para encriptar no MICAz. / Wireless sensor networks (WSN) typically consist of sensor nodes with limited energy, processing, communication and memory. Security in WSN is becoming critical with the emergence of applications that require mechanisms for authenticity, integrity and confidentiality. Due to resource constraints in sensor networks, public key cryptosystems suit (PKC) for these networks is an open research problem. In 2008 Danilo Gligoroski et al. proposed a new PKC based on quasi-groups multivariate quadratic (MQQ). Experiments by Gligoroski on FPGA platform show that MQQ performed in less time than most popular PKC (DH, RSA and ECC), so that some papers say MQQ has a typical speed of symmetric block cipher. Moreover, the MQQ exhibited same level of security that other PKC (DH, RSA and ECC) requiring keys minors. Another property that draws attention in MQQ is the use of basic operations XOR, AND, and bit shifting in the processes of encryption and decryption, important fact considering that a WSN has limited processing. These features make the MQQ promising to take a new path in the difficult task of providing wireless sensor networks in public key cryptosystems. Appears in this context that this study examines the feasibility of implementing MQQ a platform for WSN. Is important to consider this innovative work in the proposal to bring this new PKC for WSN based multivariate quadratic quasigroups, and contribute a method to reduce the size public key used by MQQ. Tests with MQQ on platforms TelosB and MICAz, the MQQ exhibited 825ms to encrypt and 116ms to decrypt on TelosB and 445 ms to encrypt on MICAz.

O objetivo do trabalho é apresentar dois algoritmos para a solução de problemas de controle ótimo quadrático robusto com restrições, dentro de um contexto de controladores preditivos (MPC do inglês Model Predictive Control). Inicialmente apresentamos uma breve introdução aos algoritmos MPC, com ênfase na abordagem do controlador linear quadrático. Em seguida são apresentados os dois algoritmos de interesse, que utilizam técnicas de otimização LMI. Dessa forma as restrições e as incertezas podem ser colocadas em formas computacionalmente tratáveis. Por fim são realizadas simulações e comparações entre esses algoritmos, bem como com técnicas de MPC encontradas na literatura atual. / The goal of the work is to present two algorithms for the solution of robust quadratic optimal control problems with restrictions, within a model predictive control (MPC) setup. Initially we present a brief introduction of the MPC algorithms, emphasizing the linear quadratic controller approach. Next the two algorithms of interest, using LMI optimization techniques, are presented. By using this technique the restrictions and uncertainties can be written in a computational way. Finally some simulations and comparisons between these algorithms, as well as with MPC techniques found in the current literature, are performed.

O problema de minimização com restrições lineares e importante, não apenas pelo problema em si, que surge em várias áreas, mas também por ser utilizado como subproblema para resolver problemas mais gerais de programação não-linear. GENLIN e um método eficiente para minimização com restrições lineares para problemas de pequeno e médio porte. Para que seja possível a implementação de um método similar para grande porte, é necessário ter um método eficiente, também para grande porte, para projeção de pontos no conjunto de restrições lineares. O problema de projeção em um conjunto de restrições lineares pode ser escrito como um problema de programação quadrática convexa. Neste trabalho, estudamos e implementamos métodos esparsos para resolução de problemas de programação quadrática convexa apenas com restrições de caixa, em particular o clássico método Moré-Toraldo e o \"método\" NQC. O método Moré-Toraldo usa o método dos Gradientes Conjugados para explorar a face da região factível definida pela iteração atual, e o método do Gradiente Projetado para mudar de face. O \"método\" NQC usa o método do Gradiente Espectral Projetado para definir em que face trabalhar, e o método de Newton para calcular o minimizador da quadrática reduzida a esta face. Utilizamos os métodos esparsos Moré-Toraldo e NQC para resolver o problema de projeção de GENLIN e comparamos seus desempenhos / The linearly constrained minimization problem is important, not only for the problem itself, that arises in several areas, but because it is used as a subproblem in order to solve more general nonlinear programming problems. GENLIN is an efficient method for solving small and medium scaled linearly constrained minimization problems. To implement a similar method to solve large scale problems, it is necessary to have an efficient method to solve sparse projection problems onto linear constraints. The problem of projecting a point onto a set of linear constraints can be written as a convex quadratic programming problem. In this work, we study and implement sparse methods to solve box constrained convex quadratic programming problems, in particular the classical Moré-Toraldo method and the NQC \"method\". The Moré-Toraldo method uses the Conjugate Gradient method to explore the face of the feasible region defined by the current iterate, and the Projected Gradient method to move to a different face. The NQC \"method\" uses the Spectral Projected Gradient method to define the face in which it is going to work, and the Newton method to calculate the minimizer of the quadratic function reduced to this face. We used the sparse methods Moré-Toraldo and NQC to solve the projection problem of GENLIN and we compared their performances

Redes de sensores sem fio (RSSF) tipicamente consistem de nós sensores com limitação de energia, processamento, comunicação e memória. A segurança em RSSF está se tornando fundamental com o surgimento de aplicações que necessitam de mecanismos que permitam autenticidade, integridade e confidencialidade. Devido a limitações de recursos em RSSF, adequar criptossistemas de chaves públicas (PKC) para estas redes é um problema de pesquisa em aberto. Meados de 2008, Danilo Gligoroski et al. propuseram um novo PKC baseado em quase-grupos multivariados quadráticos (MQQ). Experimentos feitos por Gligoroski na plataforma FPGA mostram que MQQ executou em tempo menor que principais PKC (DH, RSA e ECC) existentes, tanto que alguns artigos afirmam que MQQ possui velocidade de uma típica cifra de bloco simétrica. Além disto, o MQQ exibiu o mesmo nível de segurança que outros PKC (DH, RSA e ECC) necessitando chaves menores. Outra propriedade que chama atenção no MQQ é o uso das operações básicas XOR, AND e deslocamento de bits nos processos de encriptação e decriptação, fato importante considerando que uma RSSF possui processamento limitado. Estas características tornam o MQQ promissor a levar um novo caminho na difícil tarefa de dotar redes de sensores sem fio de criptossistemas de chaves públicas. Neste contexto se insere este trabalho que analisa a viabilidade de implementar o algoritmo MQQ em uma plataforma de RSSF. Sendo importante considerar que este trabalho inova na proposta de levar para RSSF este novo PKC baseado quase-grupos multivariados quadráticos, além de contribuir com um método para reduzir o tamanho da chave pública utilizada pelo MQQ. Foram feitos testes com MQQ nas plataformas TelosB e MICAz, sendo que o MQQexibiu os tempos de 825; 1 ms para encriptar e 116; 6 ms para decriptar no TelosB e 445 ms para encriptar no MICAz. / Wireless sensor networks (WSN) typically consist of sensor nodes with limited energy, processing, communication and memory. Security in WSN is becoming critical with the emergence of applications that require mechanisms for authenticity, integrity and confidentiality. Due to resource constraints in sensor networks, public key cryptosystems suit (PKC) for these networks is an open research problem. In 2008 Danilo Gligoroski et al. proposed a new PKC based on quasi-groups multivariate quadratic (MQQ). Experiments by Gligoroski on FPGA platform show that MQQ performed in less time than most popular PKC (DH, RSA and ECC), so that some papers say MQQ has a typical speed of symmetric block cipher. Moreover, the MQQ exhibited same level of security that other PKC (DH, RSA and ECC) requiring keys minors. Another property that draws attention in MQQ is the use of basic operations XOR, AND, and bit shifting in the processes of encryption and decryption, important fact considering that a WSN has limited processing. These features make the MQQ promising to take a new path in the difficult task of providing wireless sensor networks in public key cryptosystems. Appears in this context that this study examines the feasibility of implementing MQQ a platform for WSN. Is important to consider this innovative work in the proposal to bring this new PKC for WSN based multivariate quadratic quasigroups, and contribute a method to reduce the size public key used by MQQ. Tests with MQQ on platforms TelosB and MICAz, the MQQ exhibited 825ms to encrypt and 116ms to decrypt on TelosB and 445 ms to encrypt on MICAz.

Um dos principais problemas na teoria qualitativa das equações diferenciais em dimensão dois é apresentar, para uma dada família de sistemas diferenciais, uma classificação topológica dos retratos de fase de todos os sistemas dessa família. A proposta deste trabalho é estudar a técnica utilizada na classificação dos retratos de fase globais de sistemas diferenciais polinomiais da forma \'dx SUP dt\' = P(x,y) \'dy SUP dt = Q(x,y) onde P e Q são polinômios nas variáveis x e y e o máximo entre os graus de P e Q é 2. Para esse fim optamos pelo estudo da referência de Cairó e Llibre [5]. Na presente referência os autores obtém a classificação de todos os retratos de fase globais dos sistemas diferenciais polinomiais que possuem uma integral primeira racional, H, de grau 2. Esse estudo foi dividido em duas etapas. Na primeira, caracterizamos a função H através de seus coeficientes. Na segunda, encontramos todos os retratos de fase globais no disco de Poincaré. Para tais sistemas, existem exatamente 18 retratos de fase no disco de Poincaré, exceto pela reversão do sentido de todas as órbitas ou equivalência topológica / One of the main problems in the qualitative theory of 2-dimensional differential equations is, for a concrete family of differential systems, to describe a topological classification of the phase portraits for all the systems in this family. The purpose of this work is to study a technique used in the classification of global phase portraits of the planar polynomial diferential systems or simply quadratic systems of the form \'dx SUP. dt\' = P(x,y) \'dy SUP. dt\' = Q(x,y) where P and Q are real polynomials in x and y the maximum degree of P and Q is 2. Our basic reference is the paper of Cairó and Llibre [5]. In that work the authors give the classification of all global phase portraits of the planar quadratic differential systems having a rational first integral H of degree 2. Our work is divided in two parts. In the first part, we characterize the first integral H through its coeficients. In the second one, we describe all global phase portraits in the Poincaré disk. For such systems, there are exactly 18 different phase portraits in the Poincaré disk, up to a reversal of sense of all orbits or topological equivalence