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.
The paper introduces the existing multi-pattern matching algorithms implemented by software, and analyses the Wu-Manber Algorithm in emphases. According to the analysis, the paper points out that we will gain different performance when we adopt different hash function or domain. This conclusion is proved by experiments, which show that we shall adopt appropriate hash functions or domain to improve...
The current skill evaluation of GMDSS certification is mainly carried out by human being, which involves many man-made factors, and is hard to test the real level of personnel being assessed. Due to this fact, the present study designs an automatic evaluation system. Based on a B/S structure, the system realizes an automatic assessment content algorithm according to category and area. It simulates...
The K-NN query algorithm is a widely used algorithm in the spatial database, effectively carrying on K-NN query algorithm has become the focus problem of the spatial database, the traditional query algorithm will adopt the measurement distance and pruning strategy to improve the query performance by using the tree index, it needs to carry on a large amount of distance calculation to exclude the unnecessary...
Because the number of data objects is large in the spatial database, generally speaking, the cost of spatial database query is larger than that of the relational database, the traditional R-tree index structure allows the overlapping and coverage among the sibling nodes, resulting in the duplicate storage of the spatial objects and multiple query paths, the inquiry and search efficiency are low, in...
The growing problem of spectrum scarcity and the inefficient spectrum utilization in the licensed bands, are addressed by the emerging Cognitive Radio (CR) paradigm. It is seen that the choice of the spectrum bands, called as spectrum decision, must be organized carefully by considering the challenges in the spectrum availability over time, the short term fluctuations in the availability, and the...
In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end-to-end deadline. Each task of the chain is bound to execute on a particular processing element. The complexity of designing and analyzing a DRE can be reduced by applying a component-based methodology: each pipeline can be...
An improved and colony algorithm was proposed. Genetic algorithm was utilized to optimize the parameters of ant colony algorithm. The improved algorithm was used to solve the optimization routing of the basic vehicle routing problem. The algorithm possesses some characteristics such as strong total researching ability. The experimental results show that the improved ant colony algorithm possesses...
In the design of time-critical applications, schedulability analysis can be used to define the feasibility region of tasks so that optimization techniques can find the best design solution that satisfies the deadlines. This method has been applied to obtain the optimal task implementation, priority assignment or placement of tasks onto CPUs in previous work. The definition of the feasibility region...
In the implementation of Software as a Service (SaaS), Universal Table and Column Store have become the two most typical data storage architecture. However, they both have obvious drawbacks. Microsoft proposed the schema based on Basic-Table combined with Extension-Table (BT & ET) ,in which some of the tenants' common fields are stored into the basic table to improve the processing efficiency...
To enhance the security and reliability of the widely-used stream ciphers, a 2-D and a 3-D mesh-knight Algorithm Based Fault Tolerant (ABFT) schemes for stream ciphers are developed which can be universally applied to RC4 and other stream ciphers. Based on the ready-made arithmetic unit in stream ciphers, the proposed 2-D ABFT scheme is able to detect and correct any simple error, and the 3-D mesh-knight...
Web services are self-describing, platform independent applications that can be accessed over the Internet. Web services enable us to dynamically find, bind and consume the needed functionality. Semantic Web services are being developed with the vision of automating this process and to facilitate interoperable machine to machine interaction with no/minimal human intervention. Semantic descriptions...
Counting sort is a simple, stable and efficient sort algorithm with linear running time, which is a fundamental building block for many applications. This paper depicts the design issues of a data parallel implementation of the count sort algorithm on a commodity multiprocessor GPU using the Compute Unified Device Architecture (CUDA) platform, both from NVIDIA Corporation. The full parallel version...
Packet classification is one of the most critical techniques in many network devices such as firewall, IDS and IPS, etc. In order to meet the performance requirement for high speed Internet (even higher than 10 Gbps), practical algorithms must keep better spatial and temporal performance. Moreover, as the size of rule set is increasing to tens of thousands, novel packet classification algorithms must...
We propose a new approach to tackle the well known fuzzy c-means (FCM) initialization problem. Our approach uses a metaheuristic search method called Harmony Search (HS) algorithm to produce near-optimal initial cluster centers for the FCM algorithm. We then demonstrate the effectiveness of our approach in a MRI segmentation problem. In order to dramatically reduce the computation time to find near-optimal...
It is now well understood that l1 minimization algorithm is able to recover sparse signals from incomplete measurements and sharp recoverable sparsity thresholds have also been obtained for the l1 minimization algorithm. In this paper, we investigate a new iterative reweighted l1 minimization algorithm and showed that the new algorithm can increase the sparsity recovery threshold of l1 minimization...
Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rate-distortion (R-D) approach to analyze these multiple-decoding algorithms for RS codes. This approach is first used to understand the asymptotic performance-versus-complexity trade-off of multiple error-and-erasure decoding...
An m-dimensional top-k query (with m search conditions) is primarily processed by scanning the corresponding m index lists in descending score orders in an interleaved manner (and by making judicious random accesses to look up index entries of specific data items). In this paper a new algorithm is proposed that makes use of a data structure that facilitates multidimensional range search. An m-dimensional...
Clustering is popular used in customer value segmentation in business research. Compared with other clustering methods, the objective clustering analysis can automatically and objectively determine the number of clusters and find out the optimal clustering scheme. This investigation discussed the reasonable evaluation system of value-driven customer segmentation, identified customer behavior using...
Clustering is used to find out the objects that resemble each other and compose different groups, cluster analysis is an important job in data mining. This article brings the rough set into fuzzy cluster, by using the methods of attributes contracted in the rough set theory to improve the FCM algorithm; the improved algorithm had been proved a high precise ratio.
The asset valuation is the specialized work, and it requests the certified public valuer (CPV) to have the very strong specialized competent ability. With the rapid development of the market economic, the reform of stock system, the tax reform, and the application of fair value in new enterprise accounting standards, the new evaluation domain develops unceasingly, and which sets the new request to...
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.