Propriedades dos sistemas de numeração: uma sequência didática em uma abordagem histórica

This paper aims to describe the construction and validation of a notebook of activities whose content is a didactic sequence that makes use of the study of ancient numbering systems as compared to the object of our decimal positional numbering system Arabic. This is on the assumption that the comparison with a system different from our own might provide a better understanding of our own numbering system, but also help in the process of arithmetic operations of addition, subtraction and multiplication, since it will force us to think in ways that are not routinely object of our attention. The systems covered in the study were the Egyptian hieroglyphic system of numbering, the numbering system Greek alphabet and Roman numbering system, always compared to our numbering system. The following teachung is presented structured in the form of our activities, so-called exercise set and common tasks around a former same numbering system. In its final stage of preparation, the sequence with the participation of 26 primary school teachers of basic education

Memórias das aritméticas da Emília: o ensino de aritmética entre 1920 e 1940

Pós-graduação em Educação Matemática - IGCE

Education pamphlets

A collection of miscellaneous pamphlets.

Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.

Impact of the number of users on error probabilities in multiuser diversity systems

Multiuser diversity gain has been investigated well in terms of a system capacity formulation in the literature. In practice, however, designs on multiuser systems with nonzero error rates require a relationship between the error rates and the number of users within a cell. Considering a best-user scheduling, where the user with the best channel condition is scheduled to transmit per scheduling interval, our focus is on the uplink. We assume that each user communicates with the base station through a single-input multiple-output channel. We derive a closed-form expression for the average BER, and analyze how the average BER goes to zero asymptotically as the number of users increases for a given SNR. Note that the analysis of average BER even in SI SO multiuser diversity systems has not been done with respect to the number of users for a given SNR. Our analysis can be applied to multiuser diversity systems with any number of antennas.

Tightened Lieb-Oxford Bound for Systems of Fixed Particle Number

The Lieb-Oxford bound is a constraint upon approximate exchange-correlation functionals. We explore a nonempirical tightening of that bound in both universal and electron number-dependent form. The test functional is PBE. Regarding both atomization energies (slightly worsened) and bond lengths (slightly improved), we find the PBE functional to be remarkably insensitive to the value of the Lieb-Oxford bound. This both rationalizes the use of the original Lieb-Oxford constant in PBE and suggests that enhancement factors more sensitive to sharpened constraints await discovery.

Fault-tolerant scheduling with dynamic number of replicas in heterogeneous systems

In the existing studies on fault-tolerant scheduling, the active replication schema makes use of ε + 1 replicas for each task to tolerate ε failures. However, in this paper, we show that it does not always lead to a higher reliability with more replicas. Besides, the more replicas implies more resource consumption and higher economic cost. To address this problem, with the target to satisfy the user’s reliability requirement with minimum resources, this paper proposes a new fault tolerant scheduling algorithm: MaxRe. In the algorithm, we incorporate the reliability analysis into the active replication schema and the theoretical analysis and experiments prove that the MaxRe algorithm’s schedule can certainly satisfy user’s reliability requirements. And the MaxRe scheduling algorithm can achieve the corresponding reliability with at most 70% fewer resources than the FTSA algorithm.

A preliminary evaluation of the use of graphic novels in teaching information systems

As a result of declining student numbers, and poor satisfaction ratings, an introductory information systems unit was completely redeveloped. A number of innovative initiatives were designed and implemented and the unit has seen a significant improvement in student satisfaction rates. This paper describes the development of a series of graphic novels as a strategy to both increase student engagement with the unit content and enhance the attainment of learning outcomes. It also discusses how the graphic novels were used in lectures, workshops, and competitions to increase student engagement (with varying degrees of success). Students have generally found the graphic novels to be a valuable learning resource. There is a paucity of studies on the impact of graphic novels as a teaching tool, particularly within the context of higher education, and this research is a contribution to this evident gap in the literature.

Stochastic stability for Markovian jump linear systems associated with a finite number of jump times

This paper deals with a stochastic stability concept for discrete-time Markovian jump linear systems. The random jump parameter is associated to changes between the system operation modes due to failures or repairs, which can be well described by an underlying finite-state Markov chain. In the model studied, a fixed number of failures or repairs is allowed, after which, the system is brought to a halt for maintenance or for replacement. The usual concepts of stochastic stability are related to pure infinite horizon problems, and are not appropriate in this scenario. A new stability concept is introduced, named stochastic tau-stability that is tailored to the present setting. Necessary and sufficient conditions to ensure the stochastic tau-stability are provided, and the almost sure stability concept associated with this class of processes is also addressed. The paper also develops equivalences among second order concepts that parallels the results for infinite horizon problems. (C) 2003 Elsevier B.V. All rights reserved.

Design of a reconfigurable pseudorandom number generator for use in intelligent systems

This paper deals with the design of a network-on-chip reconfigurable pseudorandom number generation unit that can map and execute meta-heuristic algorithms in hardware. The unit can be configured to implement one of the following five linear generator algorithms: a multiplicative congruential, a mixed congruential, a standard multiple recursive, a mixed multiple recursive, and a multiply-with-carry. The generation unit can be used both as a pseudorandom and a message passing-based server, which is able to produce pseudorandom numbers on demand, sending them to the network-on-chip blocks that originate the service request. The generator architecture has been mapped to a field programmable gate array, and showed that millions of numbers in 32-, 64-, 96-, or 128-bit formats can be produced in tens of milliseconds. (C) 2011 Elsevier B.V. All rights reserved.

On the number of critical periods for planar polynomial systems

In this paper we get some lower bounds for the number of critical periods of families of centers which are perturbations of the linear one. We give a method which lets us prove that there are planar polynomial centers of degree l with at least 2[(l - 2)/2] critical periods as well as study concrete families of potential, reversible and Lienard centers. This last case is studied in more detail and we prove that the number of critical periods obtained with our approach does not. increases with the order of the perturbation. (C) 2007 Elsevier Ltd. All rights reserved.

On the number of limit cycles in discontinuous piecewise linear differential systems with two pieces separated by a straight line

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