This paper deals with the modelling of a particular class of manufacturing lines, governed by a rule imposing the self-balancing. Bucket brigades were first studied as stochastic dynamic systems. Thus, a sufficient condition for self-balancing was proved. Under some particular conditions, bucket brigades may be regarded as nonlinear dynamic systems. Simulations have shown that their state traje...

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...

In this paper, we develop an algorithm for avoidance of earth obstacles using model-reference impedance control for autonomous excavator. There have been many research in the past regarding autonomous excavation, which were only concerned about position control, force control and path generation. However in order to apply the control system or algorithm to the actual autonomous excavation, it i...

This paper elaborates on a new composite bucket foundation (CBF) structural system for offshore wind turbines. The proposed CBF consists of a special force transition section, a beam system structure upper steel bucket cover and a large-scale steel bucket with honeycomb structure rooms. It can be prefabricated onshore, self-floated on the sea and then towed to the appointed sea area before sink...

Most of the existing generation of general circulation models (GCMs) use so-called bucket algorithms to represent land-surface hydrology. Biosphere-atmosphere models that include the transfer of energy, mass, and momentum between the atmosphere and the land surface are a recent alternative to this highly simplified representation of the land surface in GCMs. These models require estimation of a...

The objective of this paper is to develop a high performance hash-based access method for main memory database systems. Chained bucket hashing is known to provide the fastest random access to a static file stored in main memory. For a dynamic file, however, chained bucket hashing is inappropriate because its address space cannot be adapted to the file size without total reorganization. Extendib...

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...

Several researchers have suggested employing two-stage entry monitors for high-speed networks-the rst stage enforcing a long term rate, the second stage enforcing a peak rate over a shorter time scale. In spite of this interest, little work on analyzing such systems has appeared. Not only is the analysis hard because of the the correlation between the stages, but for the most popular policing s...

Although much research has been conducted in the area of multidimensional range queries, we examine this problem from a new perspective. In particular, our goal is to support the processing of incremental multidimensional range queries specified via our temporal visual query language (TVQL), a direct manipulation visual query interface. In this paper, we describe the details and context of our ...