Many discrete time anti-windup schemes for input saturated stable systems to achieve certain stability and performance criteria have been proposed in the literature. It has been shown as well that an anti-windup schem...
详细信息
We report a microfluidic-based Surface Plasmon Resonance (SPR) biosensor for rapid, real-time detection of Thyroglobulin (Tg, a sensitive indicator of persistent or recurrent differentiated thyroid cancer with abnorma...
详细信息
In this paper, we present an efficient complex event processing system tailored toward monitoring a large-scale setup of manufacturing equipment. In particular, the key challenge in the equipment monitoring is to deve...
详细信息
The Lovász Local Lemma (LLL) is a powerful tool that can be used to prove that an object having none of a set of bad properties exists, using the probabilistic method. In many applications of the LLL it is also d...
详细信息
This paper investigates the impact of on-body channel modeling on the accurate estimation of BAN system performance. Channel capacity is used as a measure of the on-body system performance. The actual channel capacity...
详细信息
In this paper we compare performance results of different implementations of join operation in Hadoop in a scenario where right side (of the join) is within single node memory size. We present results for several impl...
详细信息
Cloud has become a promising service model for mobile devices. Using cloud services, mobile devices can outsource its computationally intensive operations to the cloud, such as searching, data mining, and multimedia p...
详细信息
This paper proposes a method for segmenting an unstructured dirt road in color space images using color and texture analysis. A support vector machine (SVM) classifier was trained on samples of on and off road patches...
详细信息
Background: Large-scale protein structure alignment, an indispensable tool to structural bioinformatics, poses a tremendous challenge on computational resources. To ensure structure alignment accuracy and efficiency, ...
详细信息
We propose a natural process for allocating n balls into n bins that are organized as the vertices of an undirected graph G. Each ball first chooses a vertex u in G uniformly at random. Then the ball performs a local ...
详细信息
ISBN:
(纸本)9781627484855
We propose a natural process for allocating n balls into n bins that are organized as the vertices of an undirected graph G. Each ball first chooses a vertex u in G uniformly at random. Then the ball performs a local search in G starting from u until it reaches a vertex with local minimum load, where the ball is finally placed on. In our main result, we prove that this process yields a maximum load of only Θ (log log n) on expander graphs. In addition, we show that for d-dimensional grids the maximum load is Θ((log n/log log n)~(1/d+1)). Finally, for almost regular graphs with minimum degree Θ (logn), we prove that the maximum load is constant and also reveal a fundamental difference between random and arbitrary tie-breaking rules.
暂无评论