Mixed Negative Binomial Distribution by Weighted Gamma Mixing Distribution

Павел Т. Стойнов - В тази работа се разглежда отрицателно биномното разпределение, известно още като разпределение на Пойа. Предполагаме, че смесващото разпределение е претеглено гама разпределение. Изведени са вероятностите в някои частни случаи. Дадени са рекурентните формули на Панжер.

On the Poisson Process of Order k Space

2010 Mathematics Subject Classification: 60E05, 62P05.

An innovative approach to teaching structural induction for computer science

Proofs by induction are central to many computer science areas such as data structures, theory of computation, programming languages, program efficiency-time complexity, and program correctness. Proofs by induction can also improve students’ understanding and performance of computer science concepts such as programming languages, algorithm design, and recursion, as well as serve as a medium for teaching them. Even though students are exposed to proofs by induction in many courses of their curricula, they still have difficulties understanding and performing them. This impacts the whole course of their studies, since proofs by induction are omnipresent in computer science. Specifically, students do not gain conceptual understanding of induction early in the curriculum and as a result, they have difficulties applying it to more advanced areas later on in their studies. The goal of my dissertation is twofold: (1) identifying sources of computer science students’ difficulties with proofs by induction, and (2) developing a new approach to teaching proofs by induction by way of an interactive and multimodal electronic book (e-book). For the first goal, I undertook a study to identify possible sources of computer science students’ difficulties with proofs by induction. Its results suggest that there is a close correlation between students’ understanding of inductive definitions and their understanding and performance of proofs by induction. For designing and developing my e-book, I took into consideration the results of my study, as well as the drawbacks of the current methodologies of teaching proofs by induction for computer science. I designed my e-book to be used as a standalone and complete educational environment. I also conducted a study on the effectiveness of my e-book in the classroom. The results of my study suggest that, unlike the current methodologies of teaching proofs by induction for computer science, my e-book helped students overcome many of their difficulties and gain conceptual understanding of proofs induction.

An Innovative Approach to Teaching Structural Induction for Computer Science

Proofs by induction are central to many computer science areas such as data structures, theory of computation, programming languages, program efficiency-time complexity, and program correctness. Proofs by induction can also improve students’ understanding of and performance with computer science concepts such as programming languages, algorithm design, and recursion, as well as serve as a medium for teaching them. Even though students are exposed to proofs by induction in many courses of their curricula, they still have difficulties understanding and performing them. This impacts the whole course of their studies, since proofs by induction are omnipresent in computer science. Specifically, students do not gain conceptual understanding of induction early in the curriculum and as a result, they have difficulties applying it to more advanced areas later on in their studies. The goal of my dissertation is twofold: 1. identifying sources of computer science students’ difficulties with proofs by induction, and 2. developing a new approach to teaching proofs by induction by way of an interactive and multimodal electronic book (e-book). For the first goal, I undertook a study to identify possible sources of computer science students’ difficulties with proofs by induction. Its results suggest that there is a close correlation between students’ understanding of inductive definitions and their understanding and performance of proofs by induction. For designing and developing my e-book, I took into consideration the results of my study, as well as the drawbacks of the current methodologies of teaching proofs by induction for computer science. I designed my e-book to be used as a standalone and complete educational environment. I also conducted a study on the effectiveness of my e-book in the classroom. The results of my study suggest that, unlike the current methodologies of teaching proofs by induction for computer science, my e-book helped students overcome many of their difficulties and gain conceptual understanding of proofs induction.

Conteúdos de matemática do ensino médio com abordagem de raciocínio recursivo e questões do ENEM e OBMEP

In this work, we have the purpose of reminding the math teacher of High School the recursive process so that he/she can use this tool to introduce contents, using recursion as an alternative to the teaching of mathematics. For this, we used questions taken from the Exame Nacional do Ensino M´edio (ENEM) [National Examination of High School] and from the Olimp´ıada Brasileira de Matem´atica das Escolas P´ublicas (OBMEP) [Brazilian Mathematics Olympiad of Public Schools], in addition to present some contents of mathematics that are defined by recursion. In this dissertation, we also showed some activities that involved the recursive reasoning and were applied in a 3rd grade class of high school in a public school in Natal / RN.

The stochastic geometric machine model

This paper introduces the stochastic version of the Geometric Machine Model for the modelling of sequential, alternative, parallel (synchronous) and nondeterministic computations with stochastic numbers stored in a (possibly infinite) shared memory. The programming language L(D! 1), induced by the Coherence Space of Processes D! 1, can be applied to sequential and parallel products in order to provide recursive definitions for such processes, together with a domain-theoretic semantics of the Stochastic Arithmetic. We analyze both the spacial (ordinal) recursion, related to spacial modelling of the stochastic memory, and the temporal (structural) recursion, given by the inclusion relation modelling partial objects in the ordered structure of process construction.

O aprender em ambientes de aprendizagem configurando uma cultura escolar

Nesta tese problematizamos o aprender, a partir do olhar dos estudantes do 7º e 8º anos, em uma escola da rede pública de ensino do município do Rio Grande/RS/Brasil. A escola, em 2011, optou por realizar um trabalho coletivo e cooperativo e modificou sua dinâmica de funcionamento transformando as salas de aula convencionais em Ambientes de Aprendizagem, nos quais os estudantes têm acesso a uma maior diversidade de recursos e a interação com os colegas é permanente, possibilitando o desenvolvimento de estratégias diferenciadas motivando o aluno a estabelecer relações entre o conhecimento escolar, a sua vida e o mundo. Nesta escola, são os estudantes que se deslocam de um ambiente para outro, a cada duas horas, os professores permanecem com a sala organizada, conforme as necessidades e materiais pedagógicos e tecnológicos por área de conhecimento. Para conhecer como os estudantes aprendem neste novo ambiente realizamos diversos questionamentos como: o que significa aprender em Ambientes de Aprendizagem, como eram as aulas nas salas de aulas convencionais e como são as aulas nos Ambientes de Aprendizagem. Adotamos o Discurso do Sujeito Coletivo (DSC) como metodologia de análise, buscando a recursividade nos discursos individuais o que permitiu a construção dos discursos coletivos que denominamos Aprender “ontem” nas salas de aula, Aprender “hoje” nos Ambientes de Aprendizagem e Aprender com o material pedagógico. Os discursos evidenciam mudanças no aprender, em decorrência da transformação das salas de aula convencionais em Ambientes de Aprendizagem. Mostram ainda que os estudantes percebem as aulas mais dinâmicas e que agora tem liberdade para levantar e dialogar com os colegas e/ou para usar o material didático disponível no ambiente. Destacam um maior interesse de ambas as partes evidenciando que a ação docente está mais acolhedora e que acreditam em uma grande mudança na educação. A análise dos discursos nos possibilitou compreender que trabalhos realizados em ambientes coletivos e desafiadores modificam o aprender pela liberdade de ação, de expressão e pelo respeito ao outro como legítimo outro na convivência.

A Tutorial on the Universality and Expressiveness of Fold

In functional programming, fold is a standard operator that encapsulates a simple pattern of recursion for processing lists. This article is a tutorial on two key aspects of the fold operator for lists. First of all, we emphasize the use of the universal property of fold both as a proof principle that avoids the need for inductive proofs, and as a definition principle that guides the transformation of recursive functions into definitions using fold. Secondly, we show that even though the pattern of recursion encapsulated by fold is simple, in a language with tuples and functions as first-class values the fold operator has greater expressive power than might first be expected.

Proof Methods for Corecursive Programs

Recursion is a well-known and powerful programming technique, with a wide variety of applications. The dual technique of corecursion is less well-known, but is increasingly proving to be just as useful. This article is a tutorial on the four main methods for proving properties of corecursive programs: fixpoint induction, the approximation (or take) lemma, coinduction, and fusion.

Fold and Unfold for Program Semantics

In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion operator fold can be used to structure denotational semantics, how the dual recursion operator unfold can be used to structure operational semantics, and how algebraic properties of these operators can be used to reason about program semantics. The techniques are explained with the aid of two main examples, the first concerning arithmetic expressions, and the second concerning Milner's concurrent language CCS. The aim of the paper is to give functional programmers new insights into recursion operators, program semantics, and the relationships between them.

Clifford-Hermite polynomials in fractional Clifford analysis

In this paper we generalize radial and standard Clifford-Hermite polynomials to the new framework of fractional Clifford analysis with respect to the Riemann-Liouville derivative in a symbolic way. As main consequence of this approach, one does not require an a priori integration theory. Basic properties such as orthogonality relations, differential equations, and recursion formulas, are proven.