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.
SQL injection attack (SQLIA) is a technique through which attackers gain access over back-end databases by inserting the malicious codes through front-end. In recent times SQL injection attacks (SQLIAs) have emerged as a major threat to database security. Flaws in designing, improper coding practices, configuration errors, improper validation of user input etc. makes the web application vulnerable...
The association rule mining algorithm Apriori need to repeatedly scan the transaction database and a lot of I/O loads, moreover it may generate huge candidate sets, the complexity of time and space is relatively high. Aiming at the limitation of the algorithm, an algorithm is proposed for association rule mining based on matching array. The algorithm only needs to scan the database once, screens out...
An effective electrocardiogram (ECG) signal compression method based on two-dimensional wavelet transform which employs set partitioning in hierarchical trees (SPIHT) and beat reordering technique is presented. This method utilizes the redundancy between adjacent samples and adjacent beats. Beat reordering rearranges beat order in 2D ECG array based on the similarity between adjacent beats. This rearrangement...
In this paper, we describe a versioned database storage manager we are developing for the SciDB scientific database. The system is designed to efficiently store and retrieve array-oriented data, exposing a ``no-overwrite'' storage model in which each update creates a new ``version'' of an array. This makes it possible to perform comparisons of versions produced at different times or by different algorithms,...
Genetic Algorithm and Association Rules both are commonly used methods in data mining. In this paper, a brief overview of Genetic Algorithm and Association Rules has been given, and this paper has presented an improved extract method of association rules of genetic algorithm based on their respective advantages and disadvantages. It also did some research on designing encoding methods, structuring...
Personalized learning is one of the main problems associated with the online remedial education (ORE) for e_learning systems. The current composition approaches fail to take into consideration the difference in individual learning-competency and the background knowledge of the individual learners and thus don't provide the adequate teaching sequence that exactly meets the demands of the individual...
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decompression. Additionally, it permits fast searches over the compressed text using Boyer-Moore type algorithms. Such compressors are based on processing fixed source symbols (words) and assigning them variable-byte-length codewords,...
In recent years, hardware based packet classification has became an essential component in many networking devices. Ternary Content-Addressable Memories (TCAMs) are one of the most popular solutions in this domain, allowing to compare in parallel the packet header against a large set of rules, and to retrieve the first match. However, using TCAM to match a range of values is much more problematic...
Genetic algorithm is an important algorithm of association rule mining. However, there is some issues that genetic algorithm easy to lead prematuring convergence and into the plight of local optimum, or convergence too much time and consume a large amount of time to search. For resolving this issues, the paper improves the algorithm through adopting an adaptive mutation rate and improving the methods...
In signature based IDS (intrusion detection systems), if incoming packet header matches a certain set of rules, its payload is scrutinized against a set of known patterns (also called signatures). As the number of patterns could range up to thousands, pattern matching consumes not only the storage but also the most of the CPU cycles to execute the complex pattern matching algorithms. Therefore, so...
With the rapidly increasing popularity of XML as a data format, there is a large demand for efficient techniques in storing and querying XML documents. However XML is by nature verbose, due to repeatedly used tags that describe data. For this reason the storage requirements of XML can be excessive and lead to increased costs for data manipulation. Therefore, it seems natural to use compression techniques...
We have investigated a technique for recognising faces invariant of facial expressions. We apply multi-linear tensor algebra, which subsumes linear algebra, to analyse and recognise 3D face surfaces. This potent framework possesses a remarkable ability to deal with the shortcomings of principle component analysis in less constrained situations. A set of vector spaces can be used to represent the variation...
Dynamic IP router table schemes, which have recently been proposed in the literature, perform an IP lookup or an online prefix update in O(log2|T|) memory accesses (MAs). In terms of lookup time, they are still slower than the full expansion/compression (FEC) scheme (compressed next-hop array/code word array (CNHA/CWA)), which requires exactly (at most) three MAs, irrespective of the number of prefixes...
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.