Interpretação de textos matemáticos: dificuldades na resolução de problemas de geometria plana

A presente dissertação é o resultado de uma investigação qualitativa que tem como objeto de estudo analisar a interpretação de textos matemáticos e as dificuldades na resolução de problemas de Geometria Plana, a partir de registros produzidos pelos sujeitos pesquisados pertencentes a duas turmas do Curso Técnico Integrado ao Ensino Médio na modalidade de Jovens e Adultos do Instituto Federal de Roraima do ano de 2008; uma turma de Enfermagem e outra de Laboratório. Esta análise foi realizada à luz de teóricos como: Gilles-Gaston Granger e Ludwig Wittgenstein, os quais me fizeram perceber que as "dificuldades" encontradas na aprendizagem da Geometria Plana, segundo os preceitos dos PCNs e observadas nos registros analisados, se dão por meio da complexidade das linguagens apresentadas em sala de aula, tais como: a linguagem natural e a linguagem matemática. Os sujeitos pesquisados apontam "dificuldades" na aprendizagem, quando se deparam com a necessidade de traduzir da linguagem natural para a linguagem matemática, a fim de objetivar por meio da escrita as soluções dos problemas propostos. Essas "dificuldades" podem levá-las ao desestímulo pelo estudo, à desistência e/ou a evasão escolar. Por estes motivos, pretendo com esta pesquisa, encontrar subsídios que possam apontar caminhos para minimizar esta problemática, incentivando-os ao estudo por meio da pesquisa, da leitura diária, de modo que, consigam aprender os conteúdos matemáticos com mais vontade e prazer.

Correlação entre parâmetros estimados pelos testes Colour Assessment and Diagnosis e Cambridge Colour Test na avaliação da discriminação de cores

Os testes Colour Assessment and Diagnosis (CAD) e Cambridge Colour Test (CCT) têm sido amplamente utilizados em pesquisas básicas e clínicas, devido à alta sensibilidade e especificidade de seus resultados. Estes testes utilizam diferentes paradigmas de estimulação para estimar os limiares de discriminação de cor. Pouco se sabe sobre a relação de cada paradigma na avaliação da discriminação de cor nesses testes. Sendo assim, este trabalho objetiva comparar os parâmetros de avaliação da discriminação de cor estimados pelos testes CAD e CCT em sujeitos tricromatas e com discromatopsia congênita. Foram avaliados 59 sujeitos tricromatas e 38 sujeitos discromatópsicos (16 protans, 22 deutans) com idade média de 26,32 ± 8,9 anos. Foram testados 66 sujeitos nos testes CAD e CCT, 29 sujeitos no teste CAD e 2 sujeitos no teste CCT. O fenótipo da visão de cores de todos os sujeitos foi determinado através de uma bateria de testes psicofísicos e a estimativa dos limiares de discriminação de cor foi avaliada pelos testes CAD e CCT. Os dados de limiares de discriminação de cor foram ajustados a funções de elipse. Os critérios analisados para cada sujeito foram: a área da elipse, o ângulo de rotação e tamanho dos vetores protan, deutan e tritan. Para cada um dos parâmetros foi realizada: estatística descritiva, análise da dispersão dos parâmetros entre os testes CAD e CCT e dos parâmetros em conjunto, razão entre os parâmetros, correlação dos parâmetros a três modelos matemáticos e análise de concordância. Os parâmetros de área e tamanho dos vetores deutan e tritan do subgrupo tricromata; área e tamanho do vetor tritan do subgrupo protan; e tamanho dos vetores protan e tritan do subgrupo deutan apresentaram equivalência entre os resultados de ambos os testes. Os parâmetros de área, ângulo de rotação e tamanho dos vetores protan e tritan apresentaram concordância de medidas entre os testes CAD e CCT. Fatores como as localizações distintas das coordenadas centrais dos testes CAD e CCT e a disposição espacial dos vetores no espaço de cor da CIE 1976 no teste CCT podem ter influenciado na determinação de limiares de discriminação cromática de ambos os testes. Apesar de utilizarem paradigmas distintos na configuração da estimulação, os testes CAD e CCT são equiparáveis.

General and oral health-related quality of life among caregivers of Parkinson's disease patients

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Energy decay for the linear Klein-Gordon equation and boundary control

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Formalização em Epistemologia Genética e Digrafos

One of the principal themes of genetic epistemology is the study of the psycho-genetic and historical-critical constitution of knowledge and its necessary structures. A main topic in this area is the relationship between abstract logical-mathematical structures and the epistemological-psychological structures of the epistemic subject. In genetic epistemology, formalizing and axiomatizing epistemological-psychological structures constitute one of the principal methods for showing the correlation between the two types of structures: the formalization of the epistemological-psychological structureresults in an axiomatic formal system which also expresses the abstractlogical-mathematical structure. In this context, it is interesting to note that some epistemological-psychological structures have been resistant to formalization and axiomatization, as in the case of the structure of concrete operational period groupings. Cases like these lead us to ask if there are general methods of formalizing that are consistent with the results and the general basis of genetic epistemology and genetic psychology, especially with regard to the claim that formalizing is a process, not a state, and that such general methods must therefore conform with the possibility of the continuous constitution of epistemological-psychological structures. In this paper we present some reflections, based on the general concepts of genetic epistemology and psychology and on the logical-mathematical structures of digraphs, on proposing a general method of formalization consistent with the results and the general basis of these two areas, including the possibility of the continuous constitution of epistemological-psychological structures.

Simulação e controle de um quadcopter utilizando lógica fuzzy

The present work develops a model to simulate the dynamics of a quadcopter being controlled by a PD fuzzy controller. Initially is presented a brief history of quadcopters an introduction to fuzzy logic and fuzzy control systems. Afterwards is presented an overview of the quadcopter dynamics and the mathematical modelling development applying Newton-Euler method. Then the modelling are implemented in a Simulink model in addition to a PD fuzzy controller. A prototype proposition is made, by describing each necessary component to build up a quadcopter. In the end the results from the simulators are discussed and compared due to the discrepancy between the model using ideal sensor and the model using non-ideal sensors

O jogo de escopa adaptado para o uso em sala de aula

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Minha terra tem palmeiras onde canta o sabiá...: sobre o Projeto Inajá e a formação de professores no médio Araguaia

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

The Importance of Teaching Students How to Read to Comprehend Mathematical Language

In this action research study of my classroom of 8th and 9th grade Algebra I students, I investigated if there are any benefits for the students in my class to learn how to read, translate, use, and understand the mathematical language found daily in their math lessons. I discovered that daily use and practice of the mathematical language in both written and verbal form, by not only me but by my students as well, improved their understanding of the textbook instructions, increased their vocabulary and also increased their understanding of their math lessons. I also found that my students remembered the mathematical material better with constant use of mathematical language and terms. As a result of this research, I plan to continue stressing the use of mathematical language and vocabulary in my classroom and will try to develop new ways to help students to read, understand, and remember mathematical language they find daily in their textbooks.

Connections between the Sznajd model with general confidence rules and graph theory

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

Hydration and anomalous solubility of the Bell-Lavis model as solvent

We address the investigation of the solvation properties of the minimal orientational model for water originally proposed by [Bell and Lavis, J. Phys. A 3, 568 (1970)]. The model presents two liquid phases separated by a critical line. The difference between the two phases is the presence of structure in the liquid of lower density, described through the orientational order of particles. We have considered the effect of a small concentration of inert solute on the solvent thermodynamic phases. Solute stabilizes the structure of solvent by the organization of solvent particles around solute particles at low temperatures. Thus, even at very high densities, the solution presents clusters of structured water particles surrounding solute inert particles, in a region in which pure solvent would be free of structure. Solute intercalates with solvent, a feature which has been suggested by experimental and atomistic simulation data. Examination of solute solubility has yielded a minimum in that property, which may be associated with the minimum found for noble gases. We have obtained a line of minimum solubility (TmS) across the phase diagram, accompanying the line of maximum density. This coincidence is easily explained for noninteracting solute and it is in agreement with earlier results in the literature. We give a simple argument which suggests that interacting solute would dislocate TmS to higher temperatures.

Mapping of risk and susceptibility of shallow-landslide in the city of Sao Paulo, Brazil

In the city of Sao Paulo, where about 11 million people live, landslides and flooding occur frequently, especially during the summer. These landslides cause the destruction of houses and urban equipment, economic damage, and the loss of lives. The number of areas threatened by landslides has been increasing each year. The objective of this article is to analyze the probability of risk and susceptibility to shallow landslides in the Limoeiro River basin, which is located at the head of the Aricanduva River basin, one of the main hydrographic basins in the city of Sao Paulo. To map areas of risk, we created a cadastral survey form to evaluate landslide risk in the field. Risk was categorized into four levels based on natural and anthropogenic factors: R1 (low risk), R2 (average risk), R3 (high risk), and R4 (very high risk). To analyze susceptibility to shallow landslides, we used the SHALSTAB (Shallow Landsliding Stability) mathematical model and calculated the Distribution Frequency (DF) of the susceptibility classes for the entire basin. Finally, we performed a joint analysis of the average Risk Concentration (RC) and Risk Potential (RP). We mapped 14 risk sectors containing approximately 685 at-risk homes, more than half of which presented a high (R3) or very high (R4) probability of risk to the population. In the susceptibility map, 41% of the area was classified as stable and 20% as unconditionally unstable. Although the latter category accounted a smaller proportion of the total area, it contained a concentration (RC) of 41% of the mapped risk areas with a risk potential (RP) of 12%. We found that the locations of areas predicted to be unstable by the model coincided with the risk areas mapped in the field. This combination of methods can be applied to evaluate the risk of shallow landslides in densely populated areas and can assist public managers in defining areas that are unstable and inappropriate for occupation. (C) 2012 Elsevier B.V. All rights reserved.

Average control of Markov decision processes with Feller transition probabilities and general action spaces

This paper studies the average control problem of discrete-time Markov Decision Processes (MDPs for short) with general state space, Feller transition probabilities, and possibly non-compact control constraint sets A(x). Two hypotheses are considered: either the cost function c is strictly unbounded or the multifunctions A(r)(x) = {a is an element of A(x) : c(x, a) <= r} are upper-semicontinuous and compact-valued for each real r. For these two cases we provide new results for the existence of a solution to the average-cost optimality equality and inequality using the vanishing discount approach. We also study the convergence of the policy iteration approach under these conditions. It should be pointed out that we do not make any assumptions regarding the convergence and the continuity of the limit function generated by the sequence of relative difference of the alpha-discounted value functions and the Poisson equations as often encountered in the literature. (C) 2012 Elsevier Inc. All rights reserved.

Existence and concentration of solutions for a class of biharmonic equations

Some superlinear fourth order elliptic equations are considered. A family of solutions is proved to exist and to concentrate at a point in the limit. The proof relies on variational methods and makes use of a weak version of the Ambrosetti-Rabinowitz condition. The existence and concentration of solutions are related to a suitable truncated equation. (C) 2012 Elsevier Inc. All rights reserved.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.