The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents and characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies of Chip-Multiprocessors (CMPs). Previous available benchmarks for multiprocessors have focused on high-performance computing applications and used a limited number of synchronization methods. PARSEC includes emerging applications in recognition, mining and...
Nowadays, in order to guarantee both system performance and power efficiency, the resistance of nonlinear distortion produced by power amplifier (PA) has been a key issue in the wireless communication research. The traditional predistortion methods require prior knowledge of the amplitude, phase or bandwidth of the input signal, which is not very practical in the real world. To overcome it, we put...
Sparse unmixing is based on the assumption that each mixed pixel in the hyperspectral image can be expressed in the form of linear combinations of a number of pure spectral signatures that are known in advance. Despite the success of sparse unmixing based on the L0 or L1 regularizer, the limitation of this approach on its computational complexity or sparsity affects the efficiency and accuracy. In...
The calculation of small-scale data is commonly used in scientific computing and application domain, and the high-efficiency method of small calculation can give play to the potency of many calculation and application. In this paper, a novel self-adaptive parallel computing method based on the graphics processing unit (GPU) architecture for batches of small scale computing tasks is proposed herein...
This paper proposed a low-complexity algorithm and of analysis and synthesis quadrature mirror filter banks (AQMF, SQMF) on the spectral band replication (SBR) for digital radio mondiale (DRM). Based on recent Lai et al.'s concept, an extended issue is addressed form the view point of recursively computing the AQMF and SQMF coefficients. The proposed recursively computational method not only combines...
This paper proposed a novel fast algorithm and common structure design of analysis and synthesis quadrature mirror filterbanks (AQMF, SQMF) on the spectral band replication (SBR) in digital radio mondiale (DRM). Based on recent Lai et al.'s concept, an extended issue is addressed from the view point of recursively computing the AQMF and SQMF coefficients. The proposed method also combines with the...
As search engine is leading the revenue growth in online marketing field, the competition of search engine marketing between paid search marketing (PSM) by search engine providers (SEPs), and search engine optimization (SEO) provided by search engine optimization firms, is white-hot. While PSM is simply for advertisers to buy the top ranks in sponsored links, SEO tries to optimize advertisers' websites...
This brief presents a novel fast algorithm derivation and structure design of analysis and synthesis quadrature mirror filterbanks (SQMFs) on the spectral band replication in Digital Radio Mondiale (DRM). After the preprocedure and postprocedure, a Fourier-transform-based computational kernel was required to construct two types of fast algorithms that offered certain advantages. The Proposed-I method...
With the development of digital technology, gird technology is rapidly developing. Grid computing, as a key technology for the next generation Internet, becomes one of the hot areas of current research at domestic and international. Resource management and scheduling algorithm are the two fundamental problems in grid computing. Firstly, the conception of gird is introduced and grid resource algorithm...
Simulation optimization has received a great deal of attention over the decades, which probably can be attributed to its generality and solvability in many practical problems. On the other hand, simulation optimization is well-recognized as a difficult problem, especially when the problem dimensionality grows. STRONG is a newly-developed method built upon the traditional response surface methodology...
In order to analyze the impact on the security of cryptographic algorithm produced by the linear approximations of addition modulo 2n with XOR, this paper firstly translates the operation of addition modulo 2n into vector Boolean function with dimension of n. The component functions can be obtained through a recurrence formula which does not require a recall of the carry function. Then we explore...
This study considers the uniform parallel machine scheduling problem with tails to minimize the maximal completion time. In this scheduling problem, all the machines are intelligent industrial robots and hence agent technology is introduced to realize the intelligence of the robots. The scheduling problem is described and analyzed and then an agent-based heuristic algorithm ABHA is presented, in which...
DBSCAN is a typical density-based clustering algorithm, but it is time-consuming to ascertain the parameter Eps and it does not perform well on multi-density datasets because of the global parameter Eps. In this paper, we use must-link constraints to ascertain the parameter Eps for each density distribution effectively and automatically, which will be used to deal with multi-density data sets for...
There are many complicated data in real world, clustering analysis should be able to find the clusters of different shapes and densities. The existing typical clustering algorithms do not perform well on multi-density data. A semi-supervised clustering algorithm for multi-density dataset SCMD is proposed. The pairwise constraints: must-link and cannot-link that reflect the distribution of multi-density...
This paper considers the problem of uniform parallel machine scheduling with unequal release dates so as to minimize makespan. This problem is proved to an NP-hard problem. Heuristics in existence for the problem are analyzed, and then we present an improved algorithm. The performance of the algorithms by experiment is also analyzed. The heuristic is further extended by applying the method of variable...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.