A neuro-genetic based short-term forecasting framework for network intrusion prediction system

Information systems are one of the most rapidly changing and vulnerable systems, where security is a major issue. The number of security-breaking attempts originating inside organizations is increasing steadily. Attacks made in this way, usually done by ＂authorized＂ users of the system, cannot be immediately traced. Because the idea of filtering the traffic at the entrance door, by using firewalls and the like, is not completely successful, the use of intrusion detection systems should be considered to increase the defense capacity of an information system. An intrusion detection system （IDS） is usually working in a dynamically changing environment, which forces continuous tuning of the intrusion detection model, in order to maintain sufficient performance. The manual tuning process required by current IDS depends on the system operators in working out the tuning solution and in integrating it into the detection model. Furthermore, an extensive effort is required to tackle the newly evolving attacks and a deep study is necessary to categorize it into the respective classes. To reduce this dependence, an automatically evolving anomaly IDS using neuro-genetic algorithm is presented. The proposed system automatically tunes the detection model on the fly according to the feedback provided by the system operator when false predictions are encountered. The system has been evaluated using the Knowledge Discovery in Databases Conference （KDD 2009） intrusion detection dataset. Genetic paradigm is employed to choose the predominant features, which reveal the occurrence of intrusions. The neuro-genetic IDS （NGIDS） involves calculation of weightage value for each of the categorical attributes so that data of uniform representation can be processed by the neuro-genetic algorithm. In this system unauthorized invasion of a user are identified and newer types of attacks are sensed and classified respectively by the neuro-genetic algorithm. The experimental results obtained in this work show that the system achieves improvement in terms of misclassification cost when compared with conventional IDS. The results of the experiments show that this system can be deployed based on a real network or database environment for effective prediction of both normal attacks and new attacks.     

Green synthesis of copper oxide nanoparticles and mosquito larvicidal activity against dengue,zika and chikungunya causing vector Aedes aegypti

In the present study, high purity copper oxide nanoparticles (NPs) were synthesised using Tridax procumbens leaf extract. Green syntheses of nano‐mosquitocides rely on plant compounds as reducing and stabilising agents. Copper oxide NPs were characterised using X‐ray diffraction (XRD) analysis, Fourier transform infrared (FT‐IR), Field‐emission scanning electron microscopy with energy dispersive spectroscopy, Ultraviolet–visible spectrophotometry and fluorescence spectroscopy. XRD studies of the NPs indicate crystalline nature which was perfectly matching with a monoclinic structure of bulk CuO with an average crystallite size of 16 nm. Formation of copper oxide NPs was confirmed by FT‐IR studies and photoluminescence spectra with emission peaks at 331, 411 and 433 nm were assigned to a near‐band‐edge emission band of CuO in the UV, violet and blue region. Gas chromatography–mass spectrometry studies inferred the phytochemical constituents of the leaf extract. Larvicidal activity of synthesised NPs using T. procumbens leaf extract was tested against Aedes aegypti species (dengue, chikungunya, zika and yellow fever transmit vector).Inspec keywords: photoluminescence, spectrophotometry, thermal analysis, chromatography, nanoparticles, antibacterial activity, field emission electron microscopy, microorganisms, wide band gap semiconductors, scanning electron microscopy, X‐ray diffraction, copper compounds, ultraviolet spectra, nanofabrication, X‐ray chemical analysis, crystallites, visible spectra, field emission scanning electron microscopy, nanobiotechnology, semiconductor materials, semiconductor growth, fluorescence, mass spectraOther keywords: energy dispersive spectroscopy, ultraviolet–visual spectrophotometry, fluorescence spectroscopy, chikungunya, green synthesis, mosquito larvicidal activity, zika, X‐ray diffraction analysis, field‐emission scanning electron microscopy, XRD, gas chromatography–mass spectrometry, copper oxide nanoparticles, dengue, tridax procumben leaf extract, nanomosquitocides, FTIR, monoclinic structure, crystallite size, photoluminescence spectra, near‐band‐edge emission band, phytochemical constituents, Aedes aegypti species, yellow fever transmit vector, CuO     

Computing median and antimedian sets in median graphs

The median (antimedian) set of a profile π=(u ₁,…,u _k ) of vertices of a graph G is the set of vertices x that minimize (maximize) the remoteness ∑ _i d(x,u _i ). Two algorithms for median graphs G of complexity O(n idim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes.     

A novel hybrid feature selection via Symmetrical Uncertainty ranking based local memetic search algorithm

A novel correlation based memetic framework (MA-C) which is a combination of genetic algorithm (GA) and local search (LS) using correlation based filter ranking is proposed in this paper. The local filter method used here fine-tunes the population of GA solutions by adding or deleting features based on Symmetrical Uncertainty (SU) measure. The focus here is on filter methods that are able to assess the goodness or ranking of the individual features. Empirical study of MA-C on several commonly used datasets from the large-scale Gene expression datasets indicates that it outperforms recent existing methods in the literature in terms of classification accuracy, selected feature size and efficiency. Further, we also investigate the balance between local and genetic search to maximize the search quality and efficiency of MA-C.     

DanVideo: an MPEG-7 authoring and retrieval system for dance videos

A well-annotated dance media is an essential part of a nation’s identity, transcending cultural and language barriers. Many dance video archives suffer from problems concerning authoring and access, because of the complex spatio-temporal relationships that exist between the dancers in terms of movements of their body parts and the emotions expressed by them in a dance. This paper presents a system named DanVideo for semi-automatic authoring and access to dance archives. DanVideo provides methods of annotation and authoring and retrieval tools for choreographers, dancers, and students. We demonstrate how dance media can be semantically annotated and how this information can be used for the retrieval of the dance video semantics. In particular, DanVideo offers an MPEG-7 based semi-automatic authoring tool that takes dance video annotations generated by dance experts and produces MPEG-7 metadata. DanVideo also has a search engine that takes users’ queries and retrieves dance semantics from metadata arranged using tree-embedding technique and based on spatial, temporal and spatio-temporal features of dancers. The search engine also leverages a domain-specific ontology to process knowledge-based queries. We have assessed the dance-video queries and semantic annotations in terms of precision, recall, and fidelity.     

Epitomic Location Recognition

This paper presents a novel method for location recognition, which exploits an epitomic representation to achieve both high efficiency and good generalization. A generative model based on epitomic image analysis captures the appearance and geometric structure of an environment while allowing for variations due to motion, occlusions, and non-Lambertian effects. The ability to model translation and scale invariance together with the fusion of diverse visual features yields enhanced generalization with economical training. Experiments on both existing and new labeled image databases result in recognition accuracy superior to state of the art with real-time computational performance.     

A genetic algorithm-based artificial neural network model for the optimization of machining processes

Artificial intelligent tools like genetic algorithm, artificial neural network (ANN) and fuzzy logic are found to be extremely useful in modeling reliable processes in the field of computer integrated manufacturing (for example, selecting optimal parameters during process planning, design and implementing the adaptive control systems). When knowledge about the relationship among the various parameters of manufacturing are found to be lacking, ANNs are used as process models, because they can handle strong nonlinearities, a large number of parameters and missing information. When the dependencies between parameters become noninvertible, the input and output configurations used in ANN strongly influence the accuracy. However, running of a neural network is found to be time consuming. If genetic algorithm-based ANNs are used to construct models, it can provide more accurate results in less time. This article proposes a genetic algorithm-based ANN model for the turning process in manufacturing Industry. This model is found to be a time-saving model that satisfies all the accuracy requirements.     

Learning Sparse Feature Representations Using Probabilistic Quadtrees and Deep Belief Nets

Learning sparse feature representations is a useful instrument for solving an unsupervised learning problem. In this paper, we present three labeled handwritten digit datasets, collectively called n-MNIST by adding noise to the MNIST dataset, and three labeled datasets formed by adding noise to the offline Bangla numeral database. Then we propose a novel framework for the classification of handwritten digits that learns sparse representations using probabilistic quadtrees and Deep Belief Nets. On the MNIST, n-MNIST and noisy Bangla datasets, our framework shows promising results and outperforms traditional Deep Belief Networks.     

Curvature and entropy based wall boundary condition for the high order spectral volume Euler solver

A curvature and entropy based wall boundary condition is implemented in the high order spectral volume (SV) context. This method borrows ideas from the “curvature-corrected symmetry technique” developed by (Dadone A, Grossman B. Surface Boundary Conditions for Compressible Flows. AIAA J 1994; 32(2): 285–93), for a low order structured grid Euler solver. After numerically obtaining the curvature, the right state (by convention, the left state is inside the computational domain and the right state lies outside of the computational domain) face pressure values are obtained by solving a linearised system of equations. This is unlike that of the lower order finite volume and difference simulations, wherein the right state face values are trivial to obtain. The right state face density values are then obtained by enforcing entropy conservation. Accuracy studies show that simulations performed by employing the new boundary conditions deliver much more accurate results than the ones which employ traditional boundary conditions, while at the same time asymptotically reaching the desired order of accuracy. Numerical results for two-dimensional inviscid flows around the NACA0012 airfoil and over a bump with the new boundary condition showed dramatic improvements over those with the conventional approach. In all cases and orders, spurious entropy productions with the new boundary treatment are significantly reduced. In general, the numerical results are very promising and indicate that the approach has a great potential for 3D high order simulations.     

Strong fuzzy c-means in medical image data analysis

This paper presents a robust fuzzy c-means (FCM) for an automatic effective segmentation of breast and brain magnetic resonance images (MRI). This paper obtains novel objective functions for proposed robust fuzzy c-means by replacing original Euclidean distance with properties of kernel function on feature space and using Tsallis entropy. By minimizing the proposed effective objective functions, this paper gets membership partition matrices and equations for successive prototypes. In order to reduce the computational complexity and running time, center initialization algorithm is introduced for initializing the initial cluster center. The initial experimental works have done on synthetic image and benchmark dataset to investigate the effectiveness of proposed, and then the proposed method has been implemented to differentiate the different region of real breast and brain magnetic resonance images. In order to identify the validity of proposed fuzzy c-means methods, segmentation accuracy is computed by using silhouette method. The experimental results show that the proposed method is more capable in segmentation of medical images than existed methods.