Traffic shaping in high speed networks, including VDSL networks, occurs when congestion builds up in the outgoing VDSL network. Shaping mechanisms want smooth traffic. We used a leaky bucket too achieve traffic shaping. But leaky buckets still have a lot of non-conforming frames. However, as one way to solving this problem, we purpose a double-leaky bucket as the traffic shaping mechanism that ...

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...

Field experiments were conducted to determine the effectiveness of different colored pheromone-baited traps in capture of Fall Armyworm, Spodoptera frugiperda , males and nontarget Hymenoptera. Plastic Universal Moth Traps (Unitraps) of different colors were baited with commercial sex pheromone and were placed in peanut and corn fields in northern Florida. In one study, standard-colored (green ...

Many tasks in computer systems could be abstracted as distributing items into buckets, so that the allocation of items across buckets is as balanced as possible, and furthermore, given an item’s identifier it is possible to determine quickly into which bucket it was assigned. A canonical example is a dictionary data structure, where ‘items’ stands for key-value pairs and ‘buckets’ for memory lo...

This paper deals with the dimensioning of token buckets. Two related problems are formulated and solved. The first is the token bucket allocation problem (TBAP) which is finding the cost-minimal token bucket for the transmission of a given VBR traffic stream, e.g. an MPEG movie, from the user's point of view. This problem has been treated in literature before but as we will show not completely....

Locality-Sensitive Hashing (LSH) and its variants are the well-known indexing schemes for the c-Approximate Nearest Neighbor (c-ANN) search problem in high-dimensional Euclidean space. Traditionally, LSH functions are constructed in a query-oblivious manner in the sense that buckets are partitioned before any query arrives. However, objects closer to a query may be partitioned into different bu...

The paper addresses the problem of computing lower bounds on the optimal costs associated with each unary assignment of a value to a variable in combinatorial optimization problems. This task is instrumental in probabilistic reasoning and is also important for the development of admissible heuristic functions that can guide search algorithms for optimal solutions. The paper presents UD-MB, a ne...

BACKGROUND Unintentional drowning is the leading cause of death for children younger than 5 years old. A bucket is one of the most common water container in which children can drown. The objective of this work was to evaluate the base diameter of a bucket and the necessary force to shed it. METHODS This was an experimental study. We used six galvanized buckets of different diameters. Each sel...

We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small number of buckets; xor the contents of each bucket; then collect up all the buckets' contents. Used in the context of Wegman{Carter authentication, this style of hash function provides a fast approach for software message...

The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b. In this paper, we present a 2-approximation algorithm for the Bandwidth problem that takes worstcase O(1.9797n) = O(30.6217n) time and uses polynomial space. This improves both the previous best 2and 3-appro...