1,721,183 research outputs found
Coding in Your Classroom, Now!
No full textCome si realizza un'idea? Come si passa dall'intuizione alla soluzione di un problema? Il pensiero computazionale è proprio questo, la capacità di elaborare procedimenti costruttivi a supporto della fantasia e della creatività. Il coding permette di sviluppare il pensiero computazionale in modo coinvolgente e intuitivo a qualsiasi età. Il coding non è una disciplina, ma una pratica che può essere applicata in ogni ambito.
Questo libro parla in modo appassionato e diretto agli insegnanti per guidarli a introdurre il coding in classe, subito, senza prerequisiti, e con qualsiasi mezzo.
In appendice lo starter kit CodyRoby, un gioco di carte fai da te per fare coding senza computer
Introducing Neutral Access Networks
No full textOpen access networks (OANs) have been recently proposed as a mean for bridging digital divide and enhance nternet penetration by enabling a fair competition among Internet service providers on a shared access infrastructure.his paper introduces the concept of neutral access networks (NANs), which are a special class of OANs conceived to grant positive externality to the shared infrastructure. Externality creates a positive feedback loop among users, service providers, and network operators which increases market penetration, motivates the development of new services, and promotes the deployment of new access networks. NANs are presented and discussed in terms of business models, market penetration, usage patterns, external benefits, technical feasibility, and legal issues
Urbino Wireless Campus: A Wide-Area University Wireless Network to Bridge Digital Divide
No full textrbino Wireless Campus (UWiC) is an open wireless access network promoted and implemented by the University of Urbino, in Italy, to virtually extend the University campus over the Montefeltro region, while providing also a significant contribution to bridge the digital divide and promote the widespread diffusion of online services and applications. UWiC has ranked first among the 82 wireless-campus projects submitted by all Italian universities to the Department of Innovation and Technology of Prime Minister's Office. The project was launched one year ago and most of its targets have already been met. This paper presents the project, discusses its technical, organizational, and economic aspects, and presents early results
A Bottom-Up Approach to On-Chip Signal Integrity
No full textWe present a new approach to accurately evaluate signal integrity in digital integrated circuits while working at the logic level. Our approach makes use of fitting models to represent the key properties of drivers, interconnects and receivers and the effects of all noise sources (supply noise, timing uncertainty, crosstalk). Such models are then combined to evaluate the correctness of each bit sent across the line. The overall result is a parameterized bit-level model of a noisy on-chip communication channel. The model can be used at the logic level to evaluate the transmission-error probability for an arbitrary bit stream, sent at an arbitrary bit rate, under arbitrary noise source assumptions
Parallel Comparison of Run-Length-Encoded Strings on a Linear Systolic Array
No full textThe length of the longest common subsequence (LCS) between two strings of M and N characters can be computed by an O(M × N) dynamic programming algorithm, that can be executed in O(M + N) steps by a linear systolic array. It has been recently shown that the LCS between run-length-encoded (RLE) strings of m and n runs can be computed by an O(nM + Nm − nm) algorithm that could be executed in O(m + n) steps by a parallel hardware. However, the algorithm cannot be directly mapped on a linear systolic array because of its irregular structure.
In this paper, we propose a modified algorithm that exhibits a more regular structure at the cost of a marginal reduction of the efficiency of RLE. We outline the algorithm and we discuss its mapping on a linear systolic array
A faster algorithm for the computation of string convolutions using LZ78 parsing
No full textString convolution between vectors of integers representing a pattern and a text is a widely used computational primitive in string processing. In this paper, we investigate the use of an algorithmic framework which exploits sequence repetitions (identified according to the Lempel-Ziv parsing technique, i.e., the LZ78 algorithm) to speed up conventional algorithms (based on Fast Fourier Transform) for the computation of convolution between a pattern and a text, when the text is long enough and the pattern is sufficiently small. In particular, we present a deterministic algorithm which, given a text T of length n (drawn from a constant size alphabet |SigmaT|) and a pattern P of length m (drawn from a constant size alphabet |SigmaP|), computes the convolution between P and T with time and space complexity O(n + (nm/logn)h), where h is the entropy of text T
- …
