Linear Hashing is a dynamically updateable diskbased index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e., find the record with a given key. Compared with the BC-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected query cost O(1)...

Traac reshaping and its impact on providing deter-ministic guarantees of timely data delivery in a packet-switched virtual-circuit xed-packet network are investigated. Two types of traac smoothing are considered: global reshaping (when traac on all network connections is smoothed) and local reshaping (when the traac speciication is changed only for a single connection). The conditions when resh...

DEFINITION Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e. find the record with a given key. Compared with the B+-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected quer...

The token protocols in FDDI and FDDI-M support synchronous and asynchronous traffic. However, FDDI suffers from a token-lateness problem, and FDDI-M may starve asynchronous traffic. To remove these two weaknesses, we propose the timely-token protocol. The main feature of this protocol is the addition of information to the token so that each station may determine the reason of an early token arr...

The aim of the present work is to carry out free surface flow in a Pelton turbine bucket. Steady state numerical simulation has been done for single bucket, this fixed configuration bucket considered. dimensions are be varied same conditions discharge, head, and inclination jet. analysis performed with FLUENT code. results provided by compared two profiles buckets. patterns buckets analyzed fro...

The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R-tree spatial data structures is compared. The studied operations are data structure build, polygonization, and spatial join in an application domain consisting of planar line segment data (i.e., Bureau of the Census TIGER/Line les). The algorithms are impleme...

O way to organize workers that lies between traditional assembly lines, where workers are specialists, and craft assembly, where workers are generalists, are “bucket brigades.” We describe how one firm used bucket brigades as an intermediate strategy to migrate from craft assembly to assembly lines. The adoption of bucket brigades led to a narrowing of tasks for each worker and thus accelerated...

In rats, sucking milk reduces anxiety and promotes non-rapid eye movement (NREM) sleep, and in calves it induces resting but the effect on sleep is unknown. Here, we investigated how calves’ sleep was affected by colostrum feeding methods. Forty-one calves were blocked by birth date and randomly allotted within blocks to the experimental treatments. Calves were housed for four days either with ...

The effect of time bucket length on the choice of a lot-splitting approach is studied. Due to the continuing pressure to reduce throughput times and increase efficiency, managers apply various measures, such as lot splitting and cycle time reduction programmes, that change the length of the time bucket in their planning systems. It is shown that the choice for a suitable lot-splitting approach ...

We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture. Our implementation employs render-to-texture to enable scatter operation. Linked lists of elements in each bucket are build and stored directly in video memory. We show also the use of this sorting method in a particle-based simulation. Dissipative Particle Dynamics is the physical model of choi...