Query: Phishing Website Detection based on Supervised Machine Learning with Wrapper Features Selection

Relevant passages:
A Hybrid Model to Detect Phishing-Sites Using Supervised Learning Algorithms <=SEP=> Since last decades, online technologies have revolutionized the modern computing world. However, as a result, security threats are increasing rapidly. A huge community is using the online services even from chatting to banking is done via online transactions. Customers of web technologies face various security threats and phishing is one of the most important threat that needs to be address. Therefore, the security mechanism must be enhanced. The attacker uses phishing attack to get victims credential information like bank account number, passwords or any other information by mimicking a website of an enterprise, and the victim is unaware of phishing website. In literature, several approaches have been proposed for detection and filtering phishing attack. However, researchers are still searching for such a solution that can provide better results to secure users from phishing attack. Phishing websites have certain characteristics and patterns and to identify those features can help us to detect phishing. To identify such features is a classification task and can be solved using data mining techniques. In this paper, we are presenting a hybrid model for classification to overcome phishing-sites problem. To evaluate this model, we have used the dataset from UCI repository which contains 30 attributes and 11055 instances. The experimental results showed that our proposed hybrid model outperforms in terms of high accuracy and less error rate.

Top 10 algorithms in data mining <=SEP=> This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, PageRank, AdaBoost, kNN, Naive Bayes, and CART. These top 10 algorithms are among the most influential data mining algorithms in the research community. With each algorithm, we provide a description of the algorithm, discuss the impact of the algorithm, and review current and further research on the algorithm. These 10 algorithms cover classification, clustering, statistical learning, association analysis, and link mining, which are all among the most important topics in data mining research and development.

Rapid Object Detection using a Boosted Cascade of Simple Features <=SEP=> This paper describes a machine learning approach for visual object detection which is capable of processing images extremely rapidly and achieving high detection rates. This work is distinguished by three key contributions. The first is the introduction of a new image representation called the “Integral Image” which allows the features used by our detector to be computed very quickly. The second is a learning algorithm, based on AdaBoost, which selects a small number of critical visual features from a larger set and yields extremely efficient classifiers[6]. The third contribution is a method for combining increasingly more complex classifiers in a “cascade” which allows background regions of the image to be quickly discarded while spending more computation on promising object-like regions. The cascade can be viewed as an object specific focus-of-attention mechanism which unlike previous approaches provides statistical guarantees that discarded regions are unlikely to contain the object of interest. In the domain of face detection the system yields detection rates comparable to the best previous systems. Used in real-time applications, the detector runs at 15 frames per second without resorting to image differencing or skin color detection.

CANTINA+: A Feature-Rich Machine Learning Framework for Detecting Phishing Web Sites <=SEP=> Phishing is a plague in cyberspace. Typically, phish detection methods either use human-verified URL blacklists or exploit Web page features via machine learning techniques. However, the former is frail in terms of new phish, and the latter suffers from the scarcity of effective features and the high false positive rate (FP). To alleviate those problems, we propose a layered anti-phishing solution that aims at (1) exploiting the expressiveness of a rich set of features with machine learning to achieve a high true positive rate (TP) on novel phish, and (2) limiting the FP to a low level via filtering algorithms.
 Specifically, we proposed CANTINA+, the most comprehensive feature-based approach in the literature including eight novel features, which exploits the HTML Document Object Model (DOM), search engines and third party services with machine learning techniques to detect phish. Moreover, we designed two filters to help reduce FP and achieve runtime speedup. The first is a near-duplicate phish detector that uses hashing to catch highly similar phish. The second is a login form filter, which directly classifies Web pages with no identified login form as legitimate.
 We extensively evaluated CANTINA+ with two methods on a diverse spectrum of corpora with 8118 phish and 4883 legitimate Web pages. In the randomized evaluation, CANTINA+ achieved over 92% TP on unique testing phish and over 99% TP on near-duplicate testing phish, and about 0.4% FP with 10% training phish. In the time-based evaluation, CANTINA+ also achieved over 92% TP on unique testing phish, over 99% TP on near-duplicate testing phish, and about 1.4% FP under 20% training phish with a two-week sliding window. Capable of achieving 0.4% FP and over 92% TP, our CANTINA+ has been demonstrated to be a competitive anti-phishing solution.

An Associative Classification Data Mining Approach for Detecting Phishing Websites <=SEP=> Phishing websites are fake websites that are created by dishonest people to mimic webpages of real websites. Victims of phishing attacks may expose their financial sensitive information to the attacker whom might use this information for financial and criminal activities. Various approaches have been proposed to detect phishing websites, among which, approaches that utilize data mining techniques had shown to be more effective. The main goal of data mining is to analyze a large set of data to identify unsuspected relation and extract understandable useful patterns. Associative Classification (AC) is a promising data mining approach that integrates association rule and classification to build classification models (classifiers). This paper, proposes a new AC algorithm called Phishing Associative Classification (PAC), for detecting phishing websites. PAC employed a novel methodology in construction the classifier which results in generating moderate size classifiers. The algorithm improved the effectiveness and efficiency of a known algorithm called MCAR, by introducing a new prediction procedure and adopting a different rule pruning procedure. The conducted experiments compared PAC with 4 well-known data mining algorithms, these are: covering algorithm (Prism), decision tree (C4.5), associative Classification (CBA) and MCAR. Experiments are performed on a dataset that consists of 1010 website. Each Website is represented using 17 features categorized into 4 sets. The features are extracted from the website contents and URL. The results on each features set show that PAC is either equivalent or more effective than the compared algorithms. When all features are considered, PAC outperformed the compared algorithms and correctly identified 99.31% of the tested websites. Furthermore, PAC produced less number of rules than MCAR, and therefore, is more efficient.

Using Stories to Teach Human Values to Artificial Agents <=SEP=> Value alignment is a property of an intelligent agent indicating that it can only pursue goals that are beneficial to humans. Successful value alignment should ensure that an artificial general intelligence cannot intentionally or unintentionally perform behaviors that adversely affect humans. This is problematic in practice since it is difficult to exhaustively enumerated by human programmers. In order for successful value alignment, we argue that values should be learned. In this paper, we hypothesize that an artificial intelligence that can read and understand stories can learn the values tacitly held by the culture from which the stories originate. We describe preliminary work on using stories to generate a value-aligned reward signal for reinforcement learning agents that prevents psychotic-appearing behavior.

Supervised and Unsupervised methods to detect Insider Threat from Enterprise Social and Online Activity Data <=SEP=> Insider threat is a significant security risk for organizations, and detection of insider threat is of paramount concern to organizations. In this paper, we attempt to discover insider threat by analyzing enterprise social and online activity data of employees. To this end, we process and extract relevant features that are possibly indicative of insider threat behavior. This includes features extracted from social data including email communication patterns and content, and online activity data such as web browsing patterns, email frequency, and file and machine access patterns. Subsequently, we take two approaches to detect insider threat: (i) an unsupervised approach where we identify statistically abnormal behavior with respect to these features using state-of-the-art anomaly detection methods, and (ii) a supervised approach where we use labels indicating when employees quit the company as a proxy for insider threat activity to design a classifier. We test our approach on a real world data set with artificially injected insider threat events. We obtain a ROC score of 0.77 for the unsupervised approach, and a classification accuracy of 73.4% for the supervised approach. These results indicate that our proposed approaches are fairly successful in identifying insider threat events. Finally, we build a visualization dashboard that enables managers and HR personnel to quickly identify employees with high threat risk scores which will enable them to take suitable preventive measures and limit security risk.

An analytical framework for data stream mining techniques based on challenges and requirements <=SEP=> A growing number of applications that generate massive streams of data need intelligent data processing and online analysis. Real-time surveillance systems, telecommunication systems, sensor networks and other dynamic environments are such examples. The imminent need for turning such data into useful information and knowledge augments the development of systems, algorithms and frameworks that address streaming challenges. The storage, querying and mining of such data sets are highly computationally challenging tasks. Mining data streams is concerned with extracting knowledge structures represented in models and patterns in non stopping streams of information. Generally, two main challenges are designing fast mining methods for data streams and need to promptly detect changing concepts and data distribution because of highly dynamic nature of data streams. The goal of this article is to analyze and classify the application of diverse data mining techniques in different challenges of data stream mining. In this paper, we present the theoretical foundations of data stream analysis and propose an analytical framework for data stream mining techniques.

BLIS: A Framework for Rapidly Instantiating BLAS Functionality <=SEP=> The BLAS-like Library Instantiation Software (BLIS) framework is a new infrastructure for rapidly instantiating Basic Linear Algebra Subprograms (BLAS) functionality. Its fundamental innovation is that virtually all computation within level-2 (matrix-vector) and level-3 (matrix-matrix) BLAS operations can be expressed and optimized in terms of very simple kernels. While others have had similar insights, BLIS reduces the necessary kernels to what we believe is the simplest set that still supports the high performance that the computational science community demands. Higher-level framework code is generalized and implemented in ISO C99 so that it can be reused and/or reparameterized for different operations (and different architectures) with little to no modification. Inserting high-performance kernels into the framework facilitates the immediate optimization of any BLAS-like operations which are cast in terms of these kernels, and thus the framework acts as a productivity multiplier. Users of BLAS-dependent applications are given a choice of using the traditional Fortran-77 BLAS interface, a generalized C interface, or any other higher level interface that builds upon this latter API. Preliminary performance of level-2 and level-3 operations is observed to be competitive with two mature open source libraries (OpenBLAS and ATLAS) as well as an established commercial product (Intel MKL).
 Replicated Computational Results Certified: This article was subjected to an optional supplementary review process in which the computational results leading to the main conclusions of the paper were independently replicated. A separate report with the results of this process is published in this issue (see: http://dx.doi.org/10.1145/2738033). The certification process is described in Michael Heroux's editorial: http://dx.doi.org/10.1145/2743015.

Video2GIF: Automatic Generation of Animated GIFs from Video <=SEP=> We introduce the novel problem of automatically generating animated GIFs from video. GIFs are short looping video with no sound, and a perfect combination between image and video that really capture our attention. GIFs tell a story, express emotion, turn events into humorous moments, and are the new wave of photojournalism. We pose the question: Can we automate the entirely manual and elaborate process of GIF creation by leveraging the plethora of user generated GIF content? We propose a Robust Deep RankNet that, given a video, generates a ranked list of its segments according to their suitability as GIF. We train our model to learn what visual content is often selected for GIFs by using over 100K user generated GIFs and their corresponding video sources. We effectively deal with the noisy web data by proposing a novel adaptive Huber loss in the ranking formulation. We show that our approach is robust to outliers and picks up several patterns that are frequently present in popular animated GIFs. On our new large-scale benchmark dataset, we show the advantage of our approach over several state-of-the-art methods.

SoilJ : An ImageJ Plugin for the Semiautomatic Processing of Three-Dimensional X-ray Images of Soils <=SEP=> Noninvasive threeand four-dimensional X-ray imaging approaches have proved to be valuable analysis tools for vadose zone research. One of the main bottlenecks for applying X-ray imaging to data sets with a large number of soil samples is the relatively large amount of time and expertise needed to extract quantitative data from the respective images. SoilJ is a plugin for the free and open imaging software ImageJ that aims at automating the corresponding processing steps for cylindrical soil columns. It includes modules for automatic column outline recognition, correction of image intensity bias, image segmentation, extraction of particulate organic matter and roots, soil surface topography detection, as well as morphology and percolation analyses. In this study, the functionality and precision of some key SoilJ features were demonstrated on five different image data sets of soils. SoilJ has proved to be useful for strongly decreasing the amount of time required for image processing of large image data sets. At the same time, it allows researchers with little experience in image processing to make use of X-ray imaging methods. The SoilJ source code is freely available and may be modified and extended at will by its users. It is intended to stimulate further community-driven development of this software.

DTC-SVM Scheme for Induction Motors Fedwith a Three-level Inverter <=SEP=> Direct Torque Control is a control technique in AC drive systems to obtain high performance torque control. The conventional DTC drive contains a pair of hysteresis comparators. DTC drives utilizing hysteresis comparators suffer from high torque ripple and variable switching frequency. The most common solution to those problems is to use the space vector depends on the reference torque and flux. In this Paper The space vector modulation technique (SVPWM) is applied to 2 level inverter control in the proposed DTC-based induction motor drive system, thereby dramatically reducing the torque ripple. Then the controller based on space vector modulation is designed to be applied in the control of Induction Motor (IM) with a three-level Inverter. This type of Inverter has several advantages over the standard two-level VSI, such as a greater number of levels in the output voltage waveforms, Lower dV/dt, less harmonic distortion in voltage and current waveforms and lower switching frequencies. This paper proposes a general SVPWM algorithm for three-level based on standard two-level SVPWM. The proposed scheme is described clearly and simulation results are reported to demonstrate its effectiveness. The entire control scheme is implemented with Matlab/Simulink. Keywords—Direct torque control, space vector Pulsewidth modulation(SVPWM), neutral point clamped(NPC), two-level inverter.

Trade-Offs in PMU Deployment for State Estimation in Active Distribution Grids <=SEP=> Monitoring systems are expected to play a major role in active distribution grids, and the design of the measurement infrastructure is a critical element for an effective operation. The use of any available and newly installed, though heterogeneous, metering device providing more accurate and real-time measurement data offers a new paradigm for the distribution grid monitoring system. In this paper the authors study the meter placement problem for the measurement infrastructure of an active distribution network, where heterogeneous measurements provided by Phasor Measurement Units (PMUs) and other advanced measurement systems such as Smart Metering systems are used in addition to measurements that are typical of distribution networks, in particular substation measurements and a-priori knowledge. This work aims at defining a design approach for finding the optimal measurement infrastructure for an active distribution grid. The design problem is posed in terms of a stochastic optimization with the goal of bounding the overall uncertainty of the state estimation using heterogeneous measurements while minimizing the investment cost. The proposed method is also designed for computational efficiency so to cover a wide set of scenarios.

Relative clustering validity criteria: A comparative overview <=SEP=> Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criteria have still been proposed from time to time. These criteria are endowed with particular features that may make each of them able to outperform others in specific classes of problems. In addition, they may have completely different computational requirements. Then, it is a hard task for the user to choose a specific criterion when he or she faces such a variety of possibilities. For this reason, a relevant issue within the field of clustering analysis consists of comparing the performances of existing validity criteria and, eventually, that of a new criterion to be proposed. In spite of this, the comparison paradigm traditionally adopted in the literature is subject to some conceptual limitations. The present paper describes an alternative, possibly complementary methodology for comparing clustering validity criteria and uses it to make an extensive comparison of the performances of 40 criteria over a collection of 962,928 partitions derived from five well-known clustering algorithms and 1080 different data sets of a given class of interest. A detailed review of the relative criteria under investigation is also provided that includes an original comparative asymptotic analysis of their computational complexities. This work is intended to be a complement of the classic study reported in 1985 by Milligan and Cooper as well as a thorough extension of a preliminary paper by the authors themselves.  2010 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 3:

A multi-resonant gate driver for Very-High-Frequency (VHF) resonant converters <=SEP=> This paper presents the design and implementation of a Very-High-Frequency (VHF) multi-resonant gate drive circuit. The design procedure is greatly simplified compared with some VHF self-oscillating multi-resonant gate drivers presented in previous works. The proposed circuit has the potential to reduce long start-up time required in a self-oscillating resonant gate drive circuit and to better utilize fast transient capability of VHF converters. A prototype resonant gate driver is demonstrated and able to reduce 60 % of the gate driving loss of a 20 MHz 32 W Class-E power amplifier with Si MOSFET.

Automated segmentation of cell nuclei in PAP smear images <=SEP=> In this paper an automated method for cell nucleus segmentation in PAP smear images is presented. The method combines the global knowledge about the cells and nuclei appearance and the local characteristics of the area of the nuclei, in order to achieve an accurate nucleus boundary. Filters and morphological operators in all three channels of a color image result in the determination of the locations of nuclei in the image, even in cases where cell overlapping occurs. The nucleus boundary is determined by a deformable model. The results are very promising, even when images with high degree of overlapping are used.

Two-Stream Neural Networks for Tampered Face Detection <=SEP=> We propose a two-stream network for face tampering detection. We train GoogLeNet to detect tampering artifacts in a face classification stream, and train a patch based triplet network to leverage features capturing local noise residuals and camera characteristics as a second stream. In addition, we use two different online face swaping applications to create a new dataset that consists of 2010 tampered images, each of which contains a tampered face. We evaluate the proposed two-stream network on our newly collected dataset. Experimental results demonstrate the effectness of our method.

Orestes: A scalable Database-as-a-Service architecture for low latency <=SEP=> Today, the applicability of database systems in cloud environments is considerably restricted because of three major problems: I) high network latencies for remote/mobile clients, II) lack of elastic horizontal scalability mechanisms, and III) missing abstraction of storage and data models. In this paper, we propose an architecture, a REST/HTTP protocol and a set of algorithms to solve these problems through a Database-as-a-Service middleware called Orestes (Objects RESTfully Encapsulated in Standard Formats). Orestes exposes cloud-hosted NoSQL database systems through a scalable tier of REST servers. These provide database-independent, object-oriented schema design, a client-independent REST-API for database operations, globally distributed caching, cache consistency mechanisms and optimistic ACID transactions. By comparative evaluations we offer empirical evidence that the proposed Database-as-a-Service architecture indeed solves common latency, scalability and abstraction problems encountered in modern cloud-based applications.

Estimating Continuous Distributions in Bayesian Classifiers <=SEP=> When modeling a probability distribution with a Bayesian network, we are faced with the problem of how to handle continuous vari­ ables. Most previous work has either solved the problem by discretizing, or assumed that the data are generated by a single Gaussian. In this paper we abandon the normality as­ sumption and instead use statistical methods for nonparametric density estimation. For a naive Bayesian classifier, we present experi­ mental results on a variety of natural and ar­ tificial domains, comparing two methods of density estimation: assuming normality and modeling each conditional distribution with a single Gaussian; and using nonparamet­ ric kernel density estimation. We observe large reductions in error on several natural and artificial data sets, which suggests that kernel estimation is a useful tool for learning Bayesian models.

Semantic web-mining and deep vision for lifelong object discovery <=SEP=> Autonomous robots that are to assist humans in their daily lives must recognize and understand the meaning of objects in their environment. However, the open nature of the world means robots must be able to learn and extend their knowledge about previously unknown objects on-line. In this work we investigate the problem of unknown object hypotheses generation, and employ a semantic web-mining framework along with deep-learning-based object detectors. This allows us to make use of both visual and semantic features in combined hypotheses generation. Experiments on data from mobile robots in real world application deployments show that this combination improves performance over the use of either method in isolation.

TDParse: Multi-target-specific sentiment recognition on Twitter <=SEP=> Existing target-specific sentiment recognition methods consider only a single target per tweet, and have been shown to miss nearly half of the actual targets mentioned. We present a corpus of UK election tweets, with an average of 3.09 entities per tweet and more than one type of sentiment in half of the tweets. This requires a method for multi-target specific sentiment recognition, which we develop by using the context around a target as well as syntactic dependencies involving the target. We present results of our method on both a benchmark corpus of single targets and the multi-target election corpus, showing state-of-the art performance in both corpora and outperforming previous approaches to multi-target sentiment task as well as deep learning models for singletarget sentiment.

Understanding the Factors Driving NFC-Enabled Mobile Payment Adoption: an Empirical Investigation <=SEP=> Though NFC mobile payment offers both convenience and benefits to consumers, its adoption rate is still very low. This study aims to explore the factors determining consumers’ adoption of NFC mobile payment. In this study, building on TAM, an extended adoption intention model is developed by incorporating three sorts of variables into it, namely mobile payment system factors (compatibility and perceived complementarity), user characteristics (mobile payment knowledge), and a risk-related factor (perceived risk). The model is empirically tested with a sample of 377 validated respondents. Compatibility, perceived ease of use and mobile payment knowledge are found to be the factors determining individuals’ intention to use NFC mobile payment. Against our expectations, perceived usefulness and perceived risk do not affect use intention significantly in adopting NFC mobile payments among consumers. We discuss the theoretical and practical implications of these findings, and point out the limitations and need for future research.

Development of a 4-joint 3-DOF robotic arm with anti-reaction force mechanism for a multicopter <=SEP=> In this paper, we propose a design method for the mechanism of a robotic arm suitable for a multicopter. The motion of an arm attached to a multicopter can possibly disturb the multicopter attitude. Our aim is to suppress this attitude disturbance by mechanical methods. In the proposed design method, the arm has the following features for suppressing the disturbance of the multicopter attitude. 1. The robotic arm can adjust its center of gravity (COG). 2. In the simplified model, the sum of the angular momentum of the rotating parts constituting the robot arm is equal to zero. These features can compensate for both the displacement of the COG of the arm and the counter torque generated from rotating parts, which cause the disturbance to the multicopter attitude. Since the disturbance of the multicopter attitude can be suppressed mechanically, the robotic arm does not require a special flight control law. In other words, this robotic arm has the advantage of being attached to a multicopter using a common, off-the-shelf, multipurpose flight controller. Furthermore, we discuss the mass distribution, power transmission method, and the moment of inertia of rotating parts, such as the speed reducer, motor, and arm. Additionally, we fabricate a prototype robotic arm with four joints and three degrees of freedom (DOFs), based on the proposed design method. Finally, the experiments showed that the robotic arm suppressed the disturbance of the multicopter attitude caused by the arm motion.

Operations for Learning with Graphical Models <=SEP=> This paper is a multidisciplinary review of empirical, statistical learning from a graph-ical model perspective. Well-known examples of graphical models include Bayesian networks , directed graphs representing a Markov chain, and undirected networks representing a Markov eld. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, diierentiation, and the manipulation of probability models from the exponential family. Two standard algorithm schemas for learning are reviewed in a graphical framework: Gibbs sampling and the expectation max-imization algorithm. Using these operations and schemas, some popular algorithms can be synthesized from their graphical speciication. This includes versions of linear regression , techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing how some popular algorithms fall within the framework presented. The main original contributions here are the decomposition techniques and the demonstration that graphical models provide a framework for understanding and developing complex learning algorithms.

The Q-CHAT (Quantitative CHecklist for Autism in Toddlers): a normally distributed quantitative measure of autistic traits at 18-24 months of age: preliminary report. <=SEP=> We report a major revision of the CHecklist for Autism in Toddlers (CHAT). This quantitative CHAT (Q-CHAT) contains 25 items, scored on a 5 point scale (0-4). The Q-CHAT was completed by parents of n = 779 unselected toddlers (mean age 21 months) and n = 160 toddlers and preschoolers (mean age 44 months) with an Autism Spectrum Condition (ASC). The ASC group (mean (SD) = 51.8 (14.3)) scored higher on the Q-CHAT than controls (26.7 (7.8)). Boys in the control group (27.5 (7.8)) scored higher than girls (25.8 (7.7)). The intraclass correlation for test-retest reliability was 0.82 (n = 330). The distribution in the control group was close to normal. Full examination of the clinical validity of the Q-CHAT and test properties is underway.

Leakage Current Elimination of Four-Leg Inverter for Transformerless Three-Phase PV Systems <=SEP=> Eliminating the leakage current is one of the most important issues for transformerless three-phase photovoltaic (PV) systems. In this paper, the leakage current elimination of a three-phase four-leg PV inverter is investigated. With the common-mode loop model established, the generation mechanism of the leakage current is clearly identified. Different typical carrier-based modulation methods and their corresponding common-mode voltages are discussed. A new modulation strategy with Boolean logic function is proposed to achieve the constant common-mode voltage for the leakage current reduction. Finally, the different modulation methods are implemented and tested on the TMS320F28335 DSP +XC3S400 FPGA digital control platform. The experimental results verify the effectiveness of the proposed solution.

Hybrid cryptography mechanism for securing self-organized wireless networks <=SEP=> Nowadays use of wireless technologies tremendously increased due to the continuous development of these technologies in various applications. One of the development in wireless technologies leads to deployment of the networks in which all mobile nodes will communicate via wireless links directly without use of any base station or predefined infrastructural support. These networks are self-organized networks called mobile ad hoc networks (MANETs) and architecture used for these networks will be either stand alone with one or few nodes communicating with base station or distributed. As communication is done through wireless links, these types of networks are more prone to several kinds of attacks. Authentication and encryption acts as first line of defense while an intrusion detection system (IDS) acts as a second line of defense. One of the intrusion detection system used in MANET is Enhanced Adaptive Acknowledgement (EAACK) which is based on acknowledgement packets for detection of malicious activities. This system increases the overhead of network significantly relative to other system such as watchdog. So, in this paper we adopt the hybrid cryptography to reduce the network overhead and enhance the security of networks significantly.

Amazigh Isolated-Word speech recognition system using Hidden Markov Model toolkit (HTK) <=SEP=> This paper aims to build a speaker-independent automatic Amazigh Isolated-Word speech recognition system. Hidden Markov Model toolkit (HTK) that uses hidden Markov Models has been used to develop the system. The recognition vocabulary consists on the Amazigh Letters and Digits. The system has been trained to recognize the Amazigh 10 first digits and 33 alphabets. Mel frequency spectral coefficients (MFCCs) have been used to extract the feature. The training data has been collected from 60 speakers including both males and females. The test-data used for evaluating the system-performance has been collected from 20 speakers. The experimental results show that the presented system provides the overall word-accuracy 80%. The initial results obtained are very satisfactory in comparison with the training database's size, this encourages us to increase system performance to achieve a higher recognition rate.

Identification of Flux Linkage Map of Permanent Magnet Synchronous Machines Under Uncertain Circuit Resistance and Inverter Nonlinearity <=SEP=> This paper proposes a novel scheme for the identification of the whole flux linkage map of permanent magnet synchronous machines, by which the map of dq-axis flux linkages at different load or saturation conditions can be identified by the minimization of a proposed estimation model. The proposed method works on a conventional three-phase inverter based vector control system and the immune clonal based quantum genetic algorithm is employed for the global searching of minimal point. Besides, it is also noteworthy that the influence of uncertain inverter nonlinearity and circuit resistance are cancelled during the modeling process. The proposed method is subsequently tested on two PMSMs and shows quite good performance compared with the finite element prediction results.

Simple and strong : Twisted silver painted nylon artificial muscle actuated by Joule heating <=SEP=> Highly oriented nylon and polyethylene fibres shrink in length when heated and expand in diameter. By twisting and then coiling monofilaments of these materials to form helical springs, the anisotropic thermal expansion has recently been shown to enable tensile actuation of up to 49% upon heating. Joule heating, by passing a current through a conductive coating on the surface of the filament, is a convenient method of controlling actuation. In previously reported work this has been done using highly flexible carbon nanotube sheets or commercially available silver coated fibres. In this work silver paint is used as the Joule heating element at the surface of the muscle. Up to 29% linear actuation is observed with energy and power densities reaching 840 kJ m (528 J kg) and 1.1 kW kg (operating at 0.1 Hz, 4% strain, 1.4 kg load). This simple coating method is readily accessible and can be applied to any polymer filament. Effective use of this technique relies on uniform coating to avoid temperature gradients.