Multi-module caches consist of multiple parallel caches. Their goal is to increase level 1 data cache hit ratios by allowing more freedom in placing blocks in the cache. Balancing multi-module caches provide the opportunity to reorganise blocks by moving them between the cache modules, in an attempt to balance the amount of data stored in each module. This capability allows for even higher hit ...

We present an algorithm for end to end declipping, which includes clipping detection and the replacement of clipped samples. To detect regions of clipping, we analyze the signal’s amplitude histogram and the shape of the signal in the time-domain. The sample replacement algorithm uses a two-pass approach: short regions of clipping are replaced in the time-domain and long regions of clipping are...

For the problem of model choice in linear regression, we introduce a Bayesian adaptive sampling algorithm (BAS), that samples models without replacement from the space of models. For problems that permit enumeration of all models BAS is guaranteed to enumerate the model space in 2p iterations where p is the number of potential variables under consideration. For larger problems where sampling is...

concomitant coronary artery bypass surgery (cabg) in patients undergoing mitral valve replacement (mvr) has been shown to be an important risk factor for hospital mortality. we evaluated preoperative characteristics, postoperative complications, in-hospital mortality rate, and length of stay in hospital for patients undergoing concurrent cabg with mvr. preoperative and postoperative clinical da...

A general algorithm for the decomposition of differences between two values of an aggregate demographic measure of age and other dimensions is realized as Excel/VBA. It assumes that the aggregate measure is computed from similar matrices of discrete demographic data for two populations under comparison. The algorithm estimates the effects of replacement for each elementary cell of one matrix by...

In this article we improve the known Kazhdan constant for SLn(Z) with respect to the generating set of the elementary matrices. We prove that the Kazhdan constant is bounded from below by [42 √ n + 860], which gives the exact asymptotic behavior of the Kazhdan constant, as n goes to infinity, since √ 2/n is an upper bound. We can use this bound to improve the bounds for the spectral gap of the ...

This paper proposes two types of new auziliary ory. The first t y p e of the auxiliary matching store achieves high matching rate b y combining the LRU replacement algorithm and a simple match structure together. The second one achieves high match rate b y controlling strictly the number of active processes with an explicit hardware. Owing to some special characteristics of dynamic dataflow com...

The product replacement algorithm is a commonly used heuristic to generate random group elements in a finite group G, by running a random walk on generating k-tuples of G. While experiments showed outstanding performance, until recently there was little theoretical explanation. We give an extensive review of both positive and negative theoretical results in the analysis of the algorithm.

An increasing number of sensors on mobile, Internet of things (IoT), and wearable devices generate time-series measurements of physical activities. Though access to the sensory data is critical to the success of many beneficial applications such as health monitoring or activity recognition, a wide range of potentially sensitive information about the individuals can also be discovered through ac...