[PDF] Top 20 Las WebQuests de Ciencias Sociales : un instrumento para formar ciudadanos en primaria

... Current Key Range Key Next Key Range IS S IX X S none S on read none SIX on modify X Insert IX X IX instant SIX if next range locked with S or SIX Delete SIX instant X SIX Table 4: Locki[r] ... See full document

... The shared memory size is 32Kx24 bits, with the memory appearing on the upper three bytes on the TURBOchannel data-bus. Read data on the low byte is unpre- dictable. The shared RAM is indexed by TURBOchannel address bits ... See full document

... This paper introduces the rst formal complexity model for contention in multiprocessors. We focus on the standard multiprocessor architecture in which n asynchronous processes communicate by applying read , write , and ... See full document

... An oversaturated network represents a full pipeline, hence its throughput is dominated by the per-balancer contention, not by the network depth. If a balancer with S tokens makes a transition in time (S), then approxi- ... See full document

... by the user through a dialog box created by xforward. The dialog box is shown in Figure 2. This makes the establishment of each connection an intrusive action and ensures that the user is aware of all connections ... See full document

... a 2-D environment (a mobile robot moving horizontally in a room) and a 1-D retina, and use the Levenberg-Marquardt algorithm to compute the locally optimal solution starting with motion estimates based on ... See full document

... Our paper is structured as follows. We begin in Section 2 with a description of our edge detection, contour linking, and edge tracking algorithms. In Section 3, we discuss the estimation of the epipolar plane for ... See full document

... If the split node is not the root, an index term is generated containing the new node's address as a child pointer, and an index posting operation is scheduled for the parent of the curr[r] ... See full document

... The study of incremental shape from rotation is becoming particularly interesting be- cause of the dramatic increase in computer processing speed, both through the availability of massively parallel architectures ... See full document

... 1. CURRENT: A version of a BLOCK is CURRENT if all updates that have been performed on the BLOCK are reflected in the version. A BLOCK having a CURRENT version after a failure does not need any recovery. When dealing ... See full document

... In addition, our methodology has a self-contained measure that indicates when the process should stop: when the validation model contains all the probes needed to encode the existing cas[r] ... See full document

... The major goals for X11 included: • Redesign of the basic protocol encoding to increase efficiency and reduce server round trips • Support for deep frame buffers more than 16 bits per pi[r] ... See full document

... Our algorithm is an incremental copying garbage collector in the style of Baker 2] as extended to multiprocessing by Halstead 12]. Each region is divided into multiple contiguous spaces: a single to space, zero or ... See full document

... Figure 2, input values arrive on the network's input lines one after the ...line 2 and leaves on line 1, the second leaves on line 2, and in general, the Nth value will leave on line N mod ...+ ... See full document

... More precisely, each projected cube is converted into a bounding square. This allows us to do the inclusion and exclusion tests using a single lookup into two distance maps constructed from the silhouette and its ... See full document

... However, through the simple example, we illustrate sequential and parallel control flow of activities and transactions, nested subactivities and subtransactions, simple data flow, critic[r] ... See full document

... Our prototype system currently features a digital "blink comparator" for section registration, "snakes," or active deformable contours, for semi-automated cell segmentation, and voxel-ba[r] ... See full document

... Each operation both queries and updates is assigned a timestamp by the client node by advancing the client part of the timestamp, and a server must know about all operations with smaller[r] ... See full document

... A read-modify-write operation 19] is dened as follows. Let x be an object, v its current value, and f a function from values to values. The operation RMW (x f) atomically replaces the value of x with f(v), and returns v ... See full document

... asynchronous PRAM cannot be used to construct a non-blocking implemen- tation of any object that solves two-process consensus, a class of objects that includes many common data types. It is natural to ask whether the ... See full document