“Can you help me count these pennies?”: Surfacing preschoolers’ understandings of counting

ABSTRACT

Capturing the breadth and variety of children’s understanding is critical if studies of children’s mathematical thinking are to inform policy and practice in early childhood education. This article presents an investigation of young children’s counting. Detailed coding and analyses of assessment interviews with 476 preschoolers revealed understandings that would be overlooked by solely assessing the accuracy of their responses. In particular, many children demonstrated understandings of counting principles on a challenging task that were not captured by other, simpler tasks. We conclude that common approaches to capturing young children’s mathematical understanding are likely underestimating their capabilities. This study contributes to researchers’ understanding of what making sense of counting looks and sounds like for preschool age children (3–5 years), the development and relations among counting principles (one-to-one, cardinal, and patterns of the number sequence), and the affordances of challenging, open-ended tasks. We close by considering the implications of recognizing and building from what children know and can do for researchers, practitioners, and policymakers.     

向量值Nevanlinna理论初探

本文主要讨论定义在复平面取值为无穷维希尔伯特空间上的向量值亚纯函数的Ｎｅｖａｎｌｉｎｎａ理论．给出了推广的Ｐｏｉｓｓｏｎ－Ｊｅｎｓｅｎ－Ｎｅｖａｎｌｉｎｎａ公式以及推广的第一基本定理的证明，并对向量值特征函数的性质予以讨论     

WEIGHTED COMPOSITION OPERATORS ON WEIGHTED DIRICHLET SPACES

We characterize the boundedness and compactness of weighted composition operators on weighted Dirichlet spaces in terms of Nevanlinna counting functions and Caxleson measure.     

Large Deviations for Random Sums on Some Kind of Heavy-tailed Classes in Risk Models

This paper is a further investigation into the large deviations for random sums of heavy-tailed,we extended and improved some results in ref. [1] and [2]. These results can applied to some questions in Insurance and Finance.     

Counting and enumeration complexity with application to multicriteria scheduling

In this paper we tackle an important point of combinatorial optimisation: that of complexity theory when dealing with the counting or enumeration of optimal solutions. Complexity theory has been initially designed for decision problems and evolved over the years, for instance, to tackle particular features in optimisation problems. It has also evolved, more or less recently, towards the complexity of counting and enumeration problems and several complexity classes, which we review in this paper, have emerged in the literature. This kind of problems makes sense, notably, in the case of multicriteria optimisation where the aim is often to enumerate the set of the so-called Pareto optima. In the second part of this paper we review the complexity of multicriteria scheduling problems in the light of the previous complexity results.Received: November 2004 / Received version: March 2005MSC classification: 90B40, 90C29, 68Q15     

Determination/estimation of an optimal replacement interval under minimal repair

In this paper the problem of estimation of an optimal replacement interval for a system which is minimally repaired at failures is studied. The problem is investigated both under a parametric and a nonparametric form of the failure intensity of the system. It is assumed that observational data from n systems are available. Some asymptotic results are shown. A graphical procedure for determining/estimating an optimal replacement interval is presented. The procedure is particularly valuable for sensitivity analyses, for example with respect to the costs involved.     

Approximate counting via random optimization

Let ℱ_n be a family of subsets of {1,…,n}. We propose a simple randomized algorithm to estimate the cardinality of ℱ_n from the maximum weight of a subset X∈ℱ_n in a random weighting of {1,…,n}. The examples include enumeration of perfect matchings in graphs, bases in matroids, and Hamiltonian cycles in graphs. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 11 , 187–198 (1997)     

Moment Solutions for the State Exiting Counting Processes of a Markov Renewal Process

Important performance measures for many Markov renewal processes are the counts of the exits from each state. We present solutions for the conditional first, second, and covariance moments of the state exiting counting processes for a Markov renewal process, and solutions for the unconditional equilibrium versions of the moments. We demonstrate the relationship between the conditional first moments for the state exiting and the state entering counting processes. For analytical and illustrative purposes, we concentrate on the two state case. Two asymptotic expansions for the moment functions are proposed and evaluated both analytically and empirically. The two approximations are shown to be competitive in terms of absolute relative error, but the second approximation has a simpler analytical form which is useful in analyzing more complex stochastic processes having an underlying MRP structure.     

Additive hazards regression with random effects for clustered failure times

Additive hazards model with random effects is proposed for modelling the correlated failure time data when focus is on comparing the failure times within clusters and on estimating the correlation between failure times from the same cluster, as well as the marginal regression parameters. Our model features that, when marginalized over the random effect variable, it still enjoys the structure of the additive hazards model. We develop the estimating equations for inferring the regression parameters. The proposed estimators are shown to be consistent and asymptotically normal under appropriate regularity conditions. Furthermore, the estimator of the baseline hazards function is proposed and its asymptotic properties are also established. We propose a class of diagnostic methods to assess the overall fitting adequacy of the additive hazards model with random effects. We conduct simulation studies to evaluate the finite sample behaviors of the proposed estimators in various scenarios. Analysis of the Diabetic Retinopathy Study is provided as an illustration for the proposed method.