Jacket structures mounted on suction buckets carry potential as cost-efficient foundations for next-generation 10 MW+ offshore wind turbines located in transitional water depths. Given this foundation method, resistance to overturning moment relies mainly the axial response of buckets. In practice, bucket can be modelled “Beams Non-Linear Winkler Foundation” where soil is idealised non-linear s...

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

For a martingale (Xn) converging almost surely to a random variable X , the sequence (Xn − X) is called martingale tail sum. Recently, Neininger [Random Structures Algorithms, 46 (2015), 346-361] proved a central limit theorem for the martingale tail sum of Régnier’s martingale for the path length in random binary search trees. Grübel and Kabluchko [2014, preprint, arXiv 1410.0469] gave an alte...

The token bucket characterization provides a deterministic yet concise representation of a traf®c source. In this paper, we study the impact of the long-range dependence (LRD) property of traf®c generated by today's multimedia applications on the optimal dimensioning of token bucket parameters. To this aim, we empirically illustrate the difference between the token bucket characteristics of tra...

Ternary Content-Addressable Memories (TCAMs) provide a fast mechanism for IP lookups and a simple management for route updates. The high power consumption problem can be resolved by providing a TCAM partitioning technique that selectively addresses smaller portions of a TCAM. This paper proposes a 2-level TCAM architecture using prefix comparison rule to partition the routing table into a numbe...

The dramatic differences in time and space efficiency of various data structures used to represent truecolor image histograms are visually explored in 3D. Spatial subdivisions use buckets to store colors in a portion of the RGB cube. Linked lists are the typical data structure used for buckets; we propose using red-black trees and treaps. Our visualizations highlight the clustering property of ...

DEFINITION Extendible Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme utilizing a directory. 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), Extendible Hashing has better expected query cost O(1) I/O. C...

A file of fixed-length records in auxiliary storage using a key-to-address transformation to assign records to addresses is considered. The file is assumed to be in steady state, that is that the rates of additions to and of deletions from the file are equal. The loading factors that minimize file maintenance costs in terms of storage space and additional accesses are computed for different buc...

The paper study of the vibrating bucket manipulator as an excavator or tunnelling shield, with energy-saving adaptation to aspects working environment for use in construction and mining industry. buckets vibro-impact devices automated operation allows a reduction energy consumption destruction rocks hard soils their properties. article proposes algorithm optimal control element - device using r...