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.
By analyzing the defects of existing task mapping algorithms, this paper proposed a novel fault model based on spare core technology, and a fault-aware low power-dissipation dynamic task mapping algorithm FLDMA is designed based on NoC system fault, power dissipation and system performance. In the algorithm design, this paper presented the minimum mapping area selection method, designed the first-node...
With the growth of Android platform malicious application, the seperation of malicious application from nonmalicious application has become challenging. In recent years, a combination of static analysis and dynamic analysis of the idea is very popular. However, it is very costly for dynamic analysis to achieve high coverage. In this article we present an efficient, lightweight and behavior-based architecture...
Multivariate Pattern Analysis (MVPA) is frequently used to decode cognitive states from brain activities in fMRI study. Due to the discrepancy between sample and feature size, MVPA methods are suffered from the overfitting problem. This paper addresses this issue by introducing sparse modelling along with its advanced decoding method, Compressive Sensing (CS). As brain voxels have highly correlated...
A number of biclustering algorithms have been introduced to discover local gene expression patterns in micro array data. Also, High-throughput biological techniques such as ChIP-seq have generated massive genome-wide data and offered ideal opportunities where biclustering can help unveil underlying biological mechanisms. Chromatin immunoprecipitation with massively parallel sequencing (ChIP-seq) has...
Research on link based object ranking attracts increasing attention these years, which also brings computer science research and business marketing brand-new concepts, opportunities as well as a great deal of challenges. With prosperity of web pages search engine and widely use of social networks, recent graph-theoretic ranking approaches have achieved remarkable successes although most of them are...
A key problem of relational database is to aggregate different values of the same object and find the first k objects with highest overall values. Many sequential algorithms have been proposed to solve this problem. In this paper, we propose a new parallel algorithm using symmetry breaking strategy. New algorithm is proved to be instance optimal. Experiment results on both synthetic and real data...
The DEM of Seabed is the core and foundation in the analysis of chart. In this paper a method of constructing the DEM of seabed based on uncertainty is proposed. Firstly, according to the uncertainty of the soundings data, the distributing law is explained and the interpolation model is constructed. Secondly, according to propagating law of the uncertainty, the DEM of Seabed based on uncertainty of...
Tabu search (TS) algorithm is a powerful local search method. It has been successfully used in many discrete optimization problems, such as TSP, JSP, and QAP, etc. Neighborhood structure and size are key factors for a local search algorithm to get good performance. If hill climbing strategy is used, the bigger the size of a neighborhood is, the better its performance is in the cost of more computing...
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.