Intrusion detection using rough set classification

Recently machine learning-based intrusion detection approaches have been subjected to extensive researches because they can detect both misuse and anomaly. In this paper, rough set classification (RSC), a modern learning algorithm, is used to rank the features extracted for detecting intrusions and generate intrusion detection models. Feature ranking is a very critical step when building the model. RSC performs feature ranking before generating rules, and converts the feature ranking to minimal hitting set problem addressed by using genetic algorithm (GA). This is done in classical approaches using Support Vector Machine (SVM) by executing many iterations, each of which removes one useless feature. Compared with those methods, our method can avoid many iterations. In addition, a hybrid genetic algorithm is proposed to increase the convergence speed and decrease the training time of RSC. The models generated by RSC take the form of'IF-THEN' rules, which have the advantage of explication. Tests and comparison of RSC with SVM on DARPA benchmark data showed that for Probe and DoS attacks both RSC and SVM yielded highly accurate results (greater than 99% accuracy on testing set).

SLEACH: Secure Low-Energy Adaptive Clustering Hierarchy Protocol for Wireless Sensor Networks

LEACH (Low-Encrgy Adaptive Clustering Hi-erarchy) protocol is a basic clustering-based routing protocol of sensor networks. In this paper, we present the design of SLEACH, asecure extension for the LEACH protocol. We divide SLEACH into four phases and fit inexpensivecryplp-graphic operations to each part of the protocol functionality to create an efficient,practical protocol. Then we give security analyses of SLEACH. Our security analyses show that ourschemeis robust against any external attacker or compromised nodes in the sensor network.

An Adaptive Trust Model of Web Services

This paper proposes a dynamic Web service trust (WS Trust) model, and somecorresponding trust metric evaluation algorithms. The main goal is to evaluate the trustworthinessand predict the future bchaxiors of entities in oeder to help users find trustworthy Web serviceproviders and prevent users from providing unfair ratings against service providers.

ANALYSES ON SYSTEMATIC CONFRONTATION OF FIGHTER AIRCRAFT

Analyses of the systematic confrontation between two military forcfes are the highest hierarchy on opera-tional effectiveness study of weapon systema.The physi-cal model for tactical many-on-many engagements of an aerial warfare with heterogeneous figher aircraft is estab-lished.On the basis of Lanchester multivariate equations of square law,a mathematical model corresponding to the established physical model is given.A superiorityh parame-ter is then derived directly from the mathematical model.With view to the high -tech condition of modern war-fare,the concept of superiority parameter which more well and truly reflects the essential of an air-to-air en-gagement is further formulated.The attrition coeffi-cients,which are key to the differential equations,are de-termined by using tactics of random target assignment and air-to-air capability index of the fighter aircraft.Hereby,taking the mathematical model and superiority parameter as cores,calculations amd analyses of complicate systemic problems such as evaluation of battle superiority,prog-mostication of combat process and optimization of colloca-tions have been accomplished.Results indicate that a clas-sical combat theory with its certain recent development has received newer applications in the military operation research for complicated confrontation analysis issues.

A novel self-organizing E-Learner community model with award and exchange mechanisms

How to share experience and resources among learners is becoming one of the hottest topics in the field of E-Learning collaborative techniques. An intuitive way to achieve this objective is to group learners which can help each other into the same community and help them learn collaboratively. In this paper, we proposed a novel community self-organization model based on multi-agent mechanism, which can automatically group learners with similar preferences and capabilities. In particular, we proposed award and exchange schemas with evaluation and preference track records to raise the performance of this algorithm. The description of learner capability, the matchmaking process, the definition of evaluation and preference track records, the rules of award and exchange schemas and the self-organization algorithm are all discussed in this paper. Meanwhile, a prototype has been built to verify the validity and efficiency of the algorithm. Experiments based on real learner data showed that this mechanism can organize learner communities properly and efficiently; and that it has sustainable improved efficiency and scalability.

An Improved Heuristic Ant-Clustering Algorithm

An improved heuristic ant-clustering algorithm(HAC)is presented in this paper.A device of ’memory bank’ is proposed,which can bring forth heuristic knowledge guiding ant to move in the bi-dimension grid space.The device lowers the randomness of ants’ moving and avoids the producing of"un-assigned data object".We have made some experiments on real data sets and synthetic data sets.The results demonstrate that HAC has superiority in misclassification error rate and runtime over the classical algorithm.

Towards the Idealization Procedure of BAN-Like Logics

We demonstrate the flaws of Mao's method, which is an augmentation ofprotocol idealization in BAN-like logics, and then offer some new idealization rules based on Mao'smethod. Furthermore, we give some theoretical analysis of our rules using the strand spaceformalism, and show the soundness of our idealization rules under strand spaces Some examples onusing the new rules to analyze security protocols are also concerned. Our idealization method ismore effective than Mao's method towards many protocol instances, and is supported by a formalmodel.

Meta-information generation in distributed information system

The authors discuss the concept of meta information which is the description of information system or its subsystems, and proposes algorithms for meta information generation. Meta information can be generated in parallel mode and network computation can be used to accelerate meta information generation. Most existing rough set methods assume information system to be centralized and cannot be applied directly in distributed information system. Data integration, which is costly, is necessary for such existing methods. However, meta information integration will eliminate the need of data integration in many cases, since many rough set operations can be done straightforward based on meta information, and many existing methods can be modified based on meta information.

Efficient Identity Based Signcryption Scheme with Public Verifiability and Forward Security

In this paper, we point out that Libert and Quisquater’s signcryption scheme cannot provide public verifiability. Then we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiability and forward security at the same time. Under the Bilinear Diffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be some-what more efficient than Libert and Quisquater’s one.

Cryptanalysis and Improvement of Signcryption Schemes on Elliptic Curves

In this paper, we analyze two signcryption schemes on elliptic curves proposed by Zheng Yu-liang and Hideki Imai. We point out a serious problem with the schemes that the elliptic curve based signcryption schemes lose confidentiality to gain non-repudiation. We also propose two improvement versions that not only overcome the security leak inherent in the schemes but also provide public verifiability or forward security. Our improvement versions require smaller computing cost than that required by signature-then-encryption methods.

A Classification Method for Web Information Extraction

Web information extraction is viewed as a classification process and a competing classification method is presented to extract Web information directly through classification. Web fragments are represented with three general features and the similarities between fragments are then defined on the bases of these features. Through competitions of fragments for different slots in information templates, the method classifies fragments into slot classes and filters out noise information. Far less annotated samples are needed as compared with rule-based methods and therefore it has a strong portability. Experiments show that the method has good performance and is superior to DOM-based method in information extraction. Key words information extraction - competing classification - feature extraction - wrapper induction CLC number TP 311 Foundation item: Supported by the National Natural Science Foundation of China (60303024)Biography: LI Xiang-yang (1974-), male, Ph. D. Candidate, research direction: information extraction, natural language processing.

Integrated Semantic Similarity Model Based on Ontology

To solve the problem of the inadequacy of semantic processing in the intelligent question answering system, an integrated semantic similarity model which calculates the semantic similarity using the geometric distance and information content is presented in this paper. With the help of interrelationship between concepts, the information content of concepts and the strength of the edges in the ontology network, we can calculate the semantic similarity between two concepts and provide information for the further calculation of the semantic similarity between user’s question and answers in knowledge base. The results of the experiments on the prototype have shown that the semantic problem in natural language processing can also be solved with the help of the knowledge and the abundant semantic information in ontology. More than 90% accuracy with less than 50 ms average searching time in the intelligent question answering prototype system based on ontology has been reached. The result is very satisfied. Key words intelligent question answering system - ontology - semantic similarity - geometric distance - information content CLC number TP39 Foundation item: Supported by the important science and technology item of China of “The 10th Five-year Plan” (2001BA101A05-04)Biography: LIU Ya-jun (1953-), female, Associate professor, research direction: software engineering, information processing, data-base application.

A Proxy Signature Scheme as Secure as Decisional Diffie-Hellman Problem

Based on decisional Difiie-Hcllman problem, we propose a simpleproxy-protected signature scheme In the random oracle model, we also carry out the strict securityproof for the proposed scheme. The security of the proposed scheme is not loosely related to thediscrete logarithm assumption hut tightly related to the decisional Diffie-Hellman assumption in therandom oracle model.

An automatic scheme to construct Snort rules from honeypots data

A scheme to construct signatures automatically for Snort from the data captured by honeypots is presented. With this scheme intrusion detection systems can be quickly updated to detect new intrusions soon when happen. The idea is based on the observation that any traffic to and from honeypots represents abnormal activities, so data patterns extracted from these packets can be used by misuse detection system to identify new attacks. The algorithm of constructing rules is discussed. Experiment illustrates the effectiveness of the scheme.

Method of Automatic Ontology Mapping through Machine Learning and Logic Mining

Ontology mapping is the bottleneck of handling conflicts among heterogeneous ontologies and of implementing reconfiguration or interoperability of legacy systems. We proposed an ontology mapping method by using machine learning, type constraints and logic mining techniques. This method is able to find concept correspondences through instances and the result is optimized by using an error function; it is able to find attribute correspondence between two equivalent concepts and the mapping accuracy is enhanced by combining together instances learning, type constraints and the logic relations that are imbedded in instances; moreover, it solves the most common kind of categorization conflicts. We then proposed a merging algorithm to generate the shared ontology and proposed a reconfigurable architecture for interoperation based on multi agents. The legacy systems are encapsulated as information agents to participate in the integration system. Finally we give a simplified case study.

Differentially Private Multidimensional Data Publication

Multidimensional data provides enormous opportunities in a variety of applications. Recent research has indicated the failure of existing sanitization techniques （e.g., k-anonymity） to provide rigorous privacy guarantees. Privacy- preserving multidimensional data publishing currently lacks a solid theoretical foundation. It is urgent to develop new techniques with provable privacy guarantees, e-Differential privacy is the only method that can provide such guarantees. In this paper, we propose a multidimensional data publishing scheme that ensures c-differential privacy while providing accurate results for query processing. The proposed solution applies nonstandard wavelet transforms on the raw multidimensional data and adds noise to guarantee c-differential privacy. Then, the scheme processes arbitrarily queries directly in the noisy wavelet- coefficient synopses of relational tables and expands the noisy wavelet coefficients back into noisy relational tuples until the end result of the query. Moreover, experimental results demonstrate the high accuracy and effectiveness of our approach.

Web-Based Information Systems and Applications: A Survey

Biography: XU Bao-wen(1961-), male, Ph.D. Professor, research direction: programming language, software engineering, Web-based technology, etc.

Conception Innovation Design System Based on PDM Framework

The system is based on the globally shared product model conforming to VRML Standard, and uses SmarTeam (PDM) system to integrate and encapsulate CAD, CAE and other application software for product development. The system takes sugarcane harvester? mobile telephone design analysis and evaluation as an example, and utilizes fuzzy evaluation principle to evaluate the design and simulation analysis results for decisions making. The platform provides a collaborative intelligent environment for the design of products, aiming at integrating people, process and data in the virtual product development. The multi-layered system architecture provides capability for KBM and conception innovation design process with a single unified data and process model so as to achieve true process streamlining and data integrity throughout the entire product development lifecycle, and hence improves enterprises efficiency.

Block-based test data adequacy measurement criteria and test complexity metrics

On the basis of software testing tools we developed for programming languages, we firstly present a new control flowgraph model based on block. In view of the notion of block, we extend the traditional program\|based software test data adequacy measurement criteria, and empirically analyze the subsume relation between these measurement criteria. Then, we define four test complexity metrics based on block. They are J\|complexity 0; J\|complexity 1; J\|complexity \{1+\}; J\|complexity 2. Finally, we show the Kiviat diagram that makes software quality visible.

A ＂cluster＂ based search scheme in peer-to-peer network

This paper presents a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.