This paper is part of a wide debate and critical reflection on the use of ICT in nursery schools, and focuses on the use of station KidSmart in the classroom to enhance scientific learning within the logical-mathematic field. The study is organized as follows: after presenting the institutional setting within which ICT has been introduced in Italian nursery schools, some considerations are made...

This paper considers the popular but questionable technique of ‘round-trip translation’ (RTT) as a means of evaluating free on-line Machine Translation systems. Two experiments are reported, both relating to common requirements of lay-users of MT on the web. In the first we see whether RTT can accurately predict the overall quality of the MT system. In the second, we ask whether RTT can predict...

Network virtualisation has been recently presented as a mean to overcome the saturation of the current Internet by sharing the same infrastructure by different network operators. This work considers virtualisation of the wireless medium, a way to share common network physical resources by different Virtual Operators based on a Time Division Multiple Access technique. We propose an Adaptive Weig...

Previous downlink scheduling algorithms of WiMAX (Worldwide Interoperability for Microwave Access), like DRR (Deficit Round-Robin) and WRR (Weighted Round-Robin), usually reserve minimum rate to each type of traffic and cannot consider the status of queue length of each connection, thus making it unsuitable for VoIP on-off traffic model. One well-designed scheduling algorithm is expected to coo...

Researchers have argued against deficit-based explanations of students’ troubles with mathematical sense-making, pointing instead to factors such as epistemology: students’ beliefs about the nature of knowledge and learning can hinder them from activating and integrating productive knowledge they have. But such explanations run the risk of substituting an epistemological deficit for a concepts/...

We investigate brother avoiding round robin doubles tournaments and construct several infinite families. We show that there is a BARRDT(n) that is not a SAMDRR(n) for all n > 4.

We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is present and each team present plays a fixed number (m) of matches in this round. In the tournament each match between two teams is either played once or twice, in the latter case in different rounds. We give necessary combinatorial conditions on the triples (n, g,m) for which such round-robin tourna...

A lonesum matrix is a (0, 1)-matrix uniquely determined by its column and row sums, and the sum of its all entries is called the “weight” of it. The generating function of numbers of weighted lonesum matrices of each weight is given. A certain explicit formula for the number of weighted lonesum matrices is also proved.