34344940
A Distributed Hebb Neural Network for Network Anomaly Detection
One of the most challenging problems in anomaly detection is to develop scalable algorithms which are capable of dealing with large audit data, network traffic data, or alter data. In this paper a distributed neural network based on Hebb rule is presented to improve the speed and scalability of inductive learning. The speed is improved by randomly splitting a large data set into disjoint subsets and each subset data is presented to an independent neural network, these networks can be trained in distributed and each one in parallel. The analysis of completeness and risk bounds of competitive Hebb learning proof that the distributed Hebb neural network can avoid the accuracy being degraded as compared to running a single algorithm with the entire data. The experiments are performed on the KDD'99 Data set, which is a standard intrusion detection benchmark. Comparisons with other approaches on the same benchmark demonstrate the effectiveness and applicability of the proposed method.
10205775
Kernel-based Global Folley-Sammon Discriminate Analysis
Kernel trick is a useful method dealing with the nonlinearity of patterns ' distribution, and widely used for non-linear pattern classification problem. Recently, many kernel-based Fisher discriminate methods were proposed, the features extracted by those methods are statistically uncorrelated, usually ineffectively when used in so called "small sample problem "(SSS), which exists in most FR tasks. To overcome this shortcoming, in this paper we present Kernel-based Global Folley-Sammon Discriminate Analysis (KGFS), it can be realized in three steps: firstly by combing kernel function, map data onto an implicit high-dimensional feature space, secondly construct orthogonal feature space there, finally calculate iterative global orthogonal discriminate vectors. Experiments have been done on ORL dataset. In terms of classification error rate performance, proposed kernel based method KGFS has a better performance than other three commonly used kernel-based methods, such as GDA, MGDAandKDDA.
11982779
A Wireless Intrusion Detection Method Based on Dynamic Growing Neural Network
In this paper an intrusion detection method based on dynamic growing neural network (DGNN) for wireless networking is presented. DGNN is based on the Hebbian learning rule and adds new neurons under certain conditions. When DGNN performs supervised learning, resonance will happen if the winner can't match the training example; this rule combines the ART/ARTMAP neural network and WTA learning rule. When DGNN performs unsupervised learning, post-prune is carried out to prevent overfitting the training data just like decision tree learning. The intrusion detection method is an anomaly detection method and the feature is selected from the packets. In the experiments, we first check the ability of the neural network and then use it to perform detection in a WLAN. The results show that it can detect new intrusion behavior and some improving methods are presented in the conclusions
7090731
Anomaly Intrusion Detection Methods for Peer-to-Peer System
Peer-to-peer systems and applications are the hotspot of research of network applications. As peer-to-peer system has no central system and is deployed on an open network, new concerns regarding security have been raised. As an additional security measure, the intrusion detection system would help determine whether unauthorized users are attempting to access, have already accessed, or have compromised the network Intrusion detection, as the second line of defense, is an indispensable tool for highly survivable networks. In this paper two anomaly intrusion detection methods are proposed for peer-to-peer system. The main characters of the methods are that they can detect intrusion in real-time without any expert knowledge and attack signatures. One method uses hidden Markov model to check reflector DoS attacks, another based on adaptive resonance theory, which can learn the normal behavior with unsupervised method. The experimental P2P system is built on FreePastry 1.401 and JDK 1.5.0. The results have indicated that the methods can find DoS attacks immediately and find new intruders with low false alarm rate.
12108467
Tracking Anomalous Behaviors of Name Servers by Mining DNS Traffic
This paper seeks to quantitatively understand the nature of the current threat towards the common name servers. A new tracking technique based on statistical model is proposed to locate the anomalous name servers by analyzing the real-world DNS traffic. After summarizing the attacks towards DNS, the detection method based on associative feature analysis is presented. Experiments are conducted which highlighting both the payload anomaly and the data flow anomaly, and the experimental results reveal the efficiency of our method in detecting the anomalous behaviors of name servers.
29250801
The Case of Interactive Web-Based Course Development
Development of the web-based learning technology supports strong enhancement to the lifelong education. This paper introduces how to design and implement web-based courses by network technology. To adapt the learning custom of the online learner, we adopt interactive and easy-sharing instructional mode and pay more attention to the display attribute of the multimedia during the process of designing and development web-based courses. In the "Civil Law" instructional practice, we divide the learning process into five parts: independent learning, online question-answering, test and examination, case study and discussion, and mock trial.
10717067
3D-SURFER: software for high-throughput protein surface comparison and analysis
SUMMARY
We present 3D-SURFER, a web-based tool designed to facilitate high-throughput comparison and characterization of proteins based on their surface shape. As each protein is effectively represented by a vector of 3D Zernike descriptors, comparison times for a query protein against the entire PDB take, on an average, only a couple of seconds. The web interface has been designed to be as interactive as possible with displays showing animated protein rotations, CATH codes and structural alignments using the CE program. In addition, geometrically interesting local features of the protein surface, such as pockets that often correspond to ligand binding sites as well as protrusions and flat regions can also be identified and visualized.


AVAILABILITY
3D-SURFER is a web application that can be freely accessed from: http://dragon.bio.purdue.edu/3d-surfer


CONTACT
dkihara@purdue.edu


SUPPLEMENTARY INFORMATION
Supplementary data are available at Bioinformatics online.
38238585
Exploiting multi-scale support vector regression for image compression
Unlike traditional neural networks that require predefined topology of the network, support vector regression (SVR) approach can model the data within the given level of accuracy with only a small subset of the training data, which are called support vectors (SVs). This property of sparsity has been exploited as the basis for image compression. In this paper, for still image compression, we propose a multi-scale support vector regression (MS-SVR) approach, which can model the images with steep variations and smooth variations very well resulting in good performance. We test our proposed MS-SVR based algorithm on some standard images. The experimental results verify that the proposed MS-SVR achieves better performance than standard SVR. And in a wide range of compression ratio, MS-SVR is very close to JPEG in terms of peak signal-to-noise ratio (PSNR) but exhibits better subjective quality. Furthermore, MS-SVR even outperforms JPEG on both PSNR and subjective quality when the compression ratio is higher enough, for example 25:1 for Lena image. Even when compared with JPEG-2000, the results show greatly similar trend as those in JPEG experiments, except that the compression ratio is a bit higher where our proposed MS-SVR will outperform JPEG-2000.
37867009
Spatial Clustering with Obstacles Constraints Using Ant Colony and Particle Swarm Optimization
Spatial clustering is an important research topic in Spatial Data Mining (SDM). This paper proposes an Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) method for solving Spatial Clustering with Obstacles Constraints (SCOC). In the process of doing so, we first use improved ACO to obtain the shortest obstructed distance, which is an effective method for arbitrary shape obstacles, and then we develop a novel PKSCOC based on PSO and K-Medoids to cluster spatial data with obstacles. The PKSCOC algorithm can not only give attention to higher local constringency speed and stronger global optimum search, but also get down to the obstacles constraints and practicalities of spatial clustering. The experimental results demonstrate the effectiveness and efficiency of the proposed method, which performs better than Improved K-Medoids SCOC (IKSCOC) in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC (GKSCOC).