Priority frequency maptable for query optimization using materialized views

In this paper query optimization using materialized views has been analyzed and a comprehensive and efficient technique has been proposed to create Map-table. Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, a number of existing techniques have been considered regarding the problem of maintaining materialized views as well as optimal searching time and memory overhead. Keeping this in mind, an optimal algorithm has been proposed in this paper for query optimization. It has been demonstrated that the proposed algorithm reduces the searching time substantially and reducing the memory size as well.

Spam filtering using ML algorithms

Spam is commonly defined as unsolicited email messages, and the goal of spam categorization is to distinguish between spam and legitimate email messages. Spam used to be considered a mere nuisance, but due to the abundant amounts of spam being sent today, it has progressed from being a nuisance to becoming a major problem. Spam filtering is able to control the problem in a variety of ways. Many researches in spam filtering has been centred on the more sophisticated classifier-related issues. Currently,  machine learning for spam classification is an important research issue at present. Support Vector Machines (SVMs) are a new learning method and achieve substantial improvements over the currently preferred methods, and behave robustly whilst tackling a variety of different learning tasks. Due to its high dimensional input, fewer irrelevant features and high accuracy, the  SVMs are more important to researchers for categorizing spam. This paper explores and identifies the use of different learning algorithms for classifying spam and legitimate messages from e-mail. A comparative analysis among the filtering techniques has also been presented in this paper.

An innovative spam filtering model based on support vector machine

Spam is commonly defined as unsolicited email messages and the goal of spam categorization is to distinguish between spam and legitimate email messages. Many researchers have been trying to separate spam from legitimate emails using machine learning algorithms based on statistical learning methods. In this paper, an innovative and intelligent spam filtering model has been proposed based on support vector machine (SVM). This model combines both linear and nonlinear SVM techniques where linear SVM performs better for text based spam classification that share similar characteristics. The proposed model considers both text and image based email messages for classification by selecting an appropriate kernel function for information transformation.

Lease based addressing for event-driven wireless sensor networks

Sensor Networks have applications in diverse fields. They can be deployed for habitat modeling, temperature monitoring and industrial sensing. They also find applications in battlefield awareness and emergency (first) response situations. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose an addressing mechanism for event-driven wireless sensor networks. The proposed scheme eliminates the need for network wide Duplicate Address Detection (DAD) and enables reuse of addresses.

Address reuse in wireless sensor networks

Sensor Networks have applications in diverse fields. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks, it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose a dynamic addressing mechanism for wireless sensor networks. The scheme enables successful reuse of addresses in event-driven wireless sensor networks. It also eliminates the need for network-wide Duplicate Address Detection (DAD) to ensure uniqueness of network level addresses.

Topology based packet marking for IP traceback

IP source address spoofing exploits a fundamental weakness in the Internet Protocol. It is exploited in many types of network-based attacks such as session hijacking and Denial of Service (DoS). Ingress and egress filtering is aimed at preventing IP spoofing. Techniques such as History based filtering are being used during DoS attacks to filter out attack packets. Packet marking techniques are being used to trace IP packets to a point that is close as possible to their actual source. Present IP spoofing  countermeasures are hindered by compatibility issues between IPv4 and IPv6, implementation issues and their effectiveness under different types of attacks. We propose a topology based packet marking method that builds on the flexibility of packet marking as an IP trace back method while overcoming most of the shortcomings of present packet marking techniques.

Energy efficient on-demand addressing for wireless sensor networks

Conserving of battery power is a critical requirement in WSNs. Past studies have shown that the transceiving process consumes more energy than the internal processing. This work focuses on eliminating overhead messages used for address allocation by employing multiple base-stations. In this context we explore address allocation without Duplicate Address Detection (DAD). We present an alternative approach to Duplicate address detection using the sink as an address pool to maintain and systematize available addresses. Experimental results show that this approach eliminates overhead messages generated by DAD; resulting in energy savings when used in conjunction with an on-demand address allocation mechanism.

Dynamic feature selection for spam filtering using support vector machine

Spam is commonly defined as unsolicited email messages and the goal of spam filtering is to differentiate spam from legitimate email. Much work have been done to filter spam from legitimate emails using machine learning algorithm and substantial performance has been achieved with some amount of false positive (FP) tradeoffs. In this paper, architecture of spam filtering has been proposed based on support vector machine (SVM,) which will get better accuracy by reducing FP problems. In this architecture an innovative technique for feature selection called dynamic feature selection (DFS) has been proposed which is enhanced the overall performance of the architecture with reduction of FP problems. The experimental result shows that the proposed technique gives better performance compare to similar existing techniques.

Finding motifs in miRNA sequences

Recently, the emergence of non-coding miRNA has attracted biology and computer researchers. miRNA plays an important role in regulation of genes. Finding motifs in RNA is one of important topics. In our work, we attempt to find motifs in mature miRNA from combinations ranging from two to ten nucleotides. Interestingly, we have found several motifs only appear in mature miRNA but not appear in other regions of primary miRNA sequences taken from latest miRNA datasets. The findings of our investigation may help in the building model to predict all possible miRNAs in genomes

Acoustic features extraction for emotion recognition

In the last decade, the efforts of spoken language processing have achieved significant advances, however, the work with emotional recognition has not progressed so far, and can only achieve 50% to 60% in accuracy. This is because a majority of researchers in this field have focused on the synthesis of emotional speech rather than focusing on automating human emotion recognition. Many research groups have focused on how to improve the performance of the classifier they used for emotion recognition, and few work has been done on data pre-processing, such as the extraction and selection of a set of specifying acoustic features instead of using all the possible ones they had in hand. To work with well-selected acoustic features does not mean to delay the whole job, but this will save much time and resources by removing the irrelative information and reducing the high-dimension data calculation. In this paper, we developed an automatic feature selector based on a RF2TREE algorithm and the traditional C4.5 algorithm. RF2TREE applied here helped us to solve the problems that did not have enough data examples. The ensemble learning technique was applied to enlarge the original data set by building a bagged random forest to generate many virtual examples, and then the new data set was used to train a single decision tree, which selects the most efficient features to represent the speech signals for the emotion recognition. Finally, the output of the selector was a set of specifying acoustic features, produced by RF2TREE and a single decision tree.

A composite descriptor for shape retrieval

In this paper, a composite descriptor for shape retrieval has been proposed. The proposed descriptor is obtained from Generic Fourier Descriptors (GFD) for the shape region and the shape contour. A composite descriptor derived from GFD of the shape region and the shape contour is used for indexing and retrieval of shapes. Difference between two images is computed as the Euclidean distance between their composite descriptors. Experiments are performed to test the effectiveness of the proposed descriptor for retrieval of 2d images. Sets of composite descriptors, obtained by assigning different weights to the region component and the contour component, are also evaluated. Item S8 within the MPEG-7 Still Images Content Set is used for performing experiments; this dataset consists of 3621 still images. Experimental results show that the proposed descriptor is effective.

Fast scene change detection based histogram

This work presents a new approach to detecting the scene change in the successive capture of photographs of a place within equal time interval. This method is based on a gray level histogram of every image. In this method the histogram of an image is processed to modify it for matching with the processed histogram of a reference image. The coefficient of correlation is taken as the measure of matching. As the method does not do any heavy signal processing, and the images are taken successively with a multi-shot digital still camera, it can be applied for real-time processing of such pictures for detection of a scene change. A multi-camera in multi-position approach is also shown to evaluate the change in scene simultaneously from different angles. Both multi-camera and single-camera approaches are compared in detecting a scene change.

Fingerprint recognition system using hybrid matching techniques

With an increasing emphasis on the emerging automatic person identification application, biometrics based, especially fingerprint-based identification, is receiving a lot of attention. This research developed an automatic fingerprint recognition system (AFRS) based on a hybrid between minutiae and correlation based techniques to represent and to match fingerprint; it improved each technique individually. It was noticed that, in the hybrid approach, as a result of an improvement of minutiae extraction algorithm in post-process phase that combines the two algorithms, the performance of the minutia algorithm improved. An improvement in the ridge algorithm that used centre point in fingerprint instead of reference point was also observed. Experiments indicate that the hybrid technique performs much better than each algorithm individually.