Ma Zhanguo, Feng Jing, Hu Xiangyi, Shi Yanqin, Chen Liang
{"title":"Improved Terms Weighting Algorithm of Text","authors":"Ma Zhanguo, Feng Jing, Hu Xiangyi, Shi Yanqin, Chen Liang","doi":"10.1109/NCIS.2011.171","DOIUrl":"https://doi.org/10.1109/NCIS.2011.171","url":null,"abstract":"Most of traditional information retrieval and automatic text classification methods with vector space model almost need determine the weighting of the feature terms. Term weighting plays an important role to achieve high performance in information retrieval and text classification. The popular method is using term frequency (tf) and inverse document frequency (idf) for representing importance and computing weighting of terms. But the tf-idf model is not introduced class information, the important information such as title, abstract, conclusion, and the synonymous words information. This paper provides an improved method to compute weighting of the terms. The above information is involved. The experimental results show that the performance is enhanced. The role of important and representative terms is raised and the effect of the unimportant feature term to retrieval and classification is decreased. In addition, the F1 based on new algorithm is higher than based on traditional tf-idf model.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"318 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132570253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qiuyan Huo, Jingyu Chen, Xuezhou Xu, Yachuan Zhou, Xin Liu
{"title":"A Location-Aware Efficient Content-Based Searching over Unstructured P2P Network","authors":"Qiuyan Huo, Jingyu Chen, Xuezhou Xu, Yachuan Zhou, Xin Liu","doi":"10.1109/NCIS.2011.135","DOIUrl":"https://doi.org/10.1109/NCIS.2011.135","url":null,"abstract":"With the explosion of P2P (peer-to-peer) applications, searching and locating necessary content is a fundamental part for utilizing Internet information and resources. Unstructured P2P network suffers from the topology mismatch problem between the overlay networks and the underlying physical network and suffers from low searching efficiency based mostly on keys. We suggest an approach of combining location-aware topology matching and interest-based searching to solve the mismatching topology problem and to improve searching efficiency. Key techniques in our approach are constructing location-aware topology based on building an overlay minimum spanning tree (MST) among each source peer and the peers within specific hops, and further optimizing the neighbor connections outside the tree, and building location and interest-based content correlation subnets and routing strategy using combination of peers' locations and metadata-based content correlation expression model and active learning algorithm. The results show that our method achieves approximately 29% reduction on traffic cost and about 60% reduction on query response time.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131889351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Revised Mapping System Design for Host Identity Procotol","authors":"Zhangfeng Hu, Bo Hu, Shanzhi Chen, Jian-Biao He","doi":"10.1109/NCIS.2011.95","DOIUrl":"https://doi.org/10.1109/NCIS.2011.95","url":null,"abstract":"Legacy mapping system for HIP (Host Identity Protocol) is designed based on the traditional DNS (Domain Name System). In addition HIP introduces a new RVS (Rendezvous Server) to maintain the location information for mobile hosts and forward I1 packets to mobile responders. However this design has at least two defects. The first one is that a fixed host may not be approachable for a fairly long period of time if it changes its IP address, because of the existence of deprecated cached entries in DNS. The other is that the load of RVS will be aggravated if a mobile responder is not active or not approachable, because the I1 packets whose destination are mobile responders are forwarded through RVS and will be retransmitted several times. To overcome these defects, in this paper we propose a revised mapping system design for HIP by introducing a new entity called MS (Mapping Server) to store the mappings from HIT to IP address for HIP hosts. In the new mapping system, RVS is not needed any more, and DNS keeps only the mappings from FQDN to HIT for all HIP hosts. With this design, the information stored in DNS is very stable and does not need to be updated frequently, so the TTL of cached entries can be set much longer thus to promote the lookup performance of DNS.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115218933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulate Match and Mismatch by Computing in Pi-Calculus","authors":"Jing Lu","doi":"10.1109/NCIS.2011.142","DOIUrl":"https://doi.org/10.1109/NCIS.2011.142","url":null,"abstract":"Problem of expressiveness between lambda calculus and pi-calculus was still open these years. A full abstraction of lambda-calculus in pi-calculus, given by Cai and Fu, shows that a pi-def, a variant of pi-calculus, is powerful enough to be the target calculus instead of minimal pi-calculus, pi-M. In fact, there are some differences between these two calculi and the most important one is that pi-M contains no operator like match and mismatch, which makes pi-def more expressive. In this paper, a new approach is proposed that simulate, in the framework of pi-calculus, match and mismatch by computing and transforms-terms to a simpler form without match and mismatch. The encoding is also proved to reserve bisimulation and will be put into a part of an interpretation of lambda-calculus in pi-calculus.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115378302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Intrusion Detection Method Based on Multiple Kernel Support Vector Machine","authors":"Guanghui Song, Jiankang Guo, Yan Nie","doi":"10.1109/NCIS.2011.123","DOIUrl":"https://doi.org/10.1109/NCIS.2011.123","url":null,"abstract":"Network intrusion data has the characters such as small sample, nonlinear and high dimension, so the detection performance of single kernel support vector machine (SK-SVM) is instability. The choice of kernel function and relative parameters plays an important role in SK-SVM. It greatly influences the generalization performance of SK-SVM. According to the limitation of SK-SVM, in this paper we present an intrusion detection method based on multiple kernel support vector machine (MK-SVM). MK-SVM can calculate the weights of kernel functions and Lagrange multipliers simultaneously through semi-infinite linear programming, and thus achieve the choice of kernel functions and the optimization of classifier. Furthermore, in order to reduce the time and space required of this method, we adopt feature selection and clustering method in the process of input data preprocessing. The experimental results using KDD CUP 1999 show that our method has better adaptability and higher detection accuracy than the method based on SK-SVM.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114281468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Node Replication Attacks in Wireless Sensor Networks: Bypassing the Neighbor-Based Detection Scheme","authors":"W. Zhu","doi":"10.1109/NCIS.2011.130","DOIUrl":"https://doi.org/10.1109/NCIS.2011.130","url":null,"abstract":"We consider the node replication attack, which is an application-independent attack unique to wireless sensor networks. The attack makes it possible for an adversary to prepare her own low-cost sensor nodes and induce the network to accept them as legitimate ones. To do so, the adversary only needs to physically capture one node, reveal its secret credentials, replicate the node in large quantity, and deploy these malicious nodes back into the network so as to subvert the network with little effort. Recently, Ko et al. proposed a neighbor-based detection scheme to cope with replication attacks. The scheme features distributed detection and takes node mobility into account. It harnesses the dynamic observations of the neighbors of a claimer node and avoids the protocol iterations typically found in distributed detections. Unfortunately, we show that their proposal is subject to various replication attacks that can circumvent the detection. Moreover, it is even possible for a sophisticated adversary to exploit the protocol to revoke legitimate nodes.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114358464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Image Retrieval Based on Multi-features","authors":"Kong Fanhui","doi":"10.1109/NCIS.2011.87","DOIUrl":"https://doi.org/10.1109/NCIS.2011.87","url":null,"abstract":"This paper studies the visual feature extraction of image retrieval. According to HSV color space, we quantify the color space in non-equal intervals, construct one-dimensional feature vector and represent the color feature by cumulative histogram. In describing the image texture features, we use the gray-level co-occurrence matrix (GLCM) and Gabor wavelets respectively. Finally, the HSV color features are combined with GLCM and Gabor wavelets respectively for image retrieval. Experiment results show the effectiveness of the algorithm.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114687012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Network Boundary Gap Technique Scheme Based on Dual Unilateral Path","authors":"Biao Wang, San-ping Tang, Shitao Zhang, Wen-Bin Zhao","doi":"10.1109/NCIS.2011.144","DOIUrl":"https://doi.org/10.1109/NCIS.2011.144","url":null,"abstract":"The traditional network boundary gap technique which can't ensure the confidentiality of information absolutely when interact the information was analyzed. This paper prompts a new technical absolution: A dual unilateral path of information interacting scheme based on unilateral transferring technique by means of partition of information flows. On one hand, this new scheme can confront the connection oriented attacks including the Trojan horse based on TCP and UDP effectively without depending on the current Trojan horse detection technology absolutely, On the other hand, the scheme can confront the data oriented attacks, that is to say, it can protect the confidentiality of the inner system data from destroying by the Trojan horse which was embedded into the inner system through other ways.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117264333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Replicate Distribution Method of Minimum Cost in Cloud Storage for Internet of Things","authors":"Dian He, Ying Liang, Zhi Hang","doi":"10.1109/NCIS.2011.26","DOIUrl":"https://doi.org/10.1109/NCIS.2011.26","url":null,"abstract":"Cloud storage is the inevitable choice for data management in Internet of things. Because of application mobility, low bandwidth of end point and the demand for real time, it is necessary to decrease the cost of data access in Internet of things. This paper discusses the method of cloud storage replicate distribution, uses matrix to record the costs of access the storage servers. Then, according to the point that applications always access the same data from different positions, and combining the data access location and cost of data access at this location, the minimum cost replicate distribution method is put forward and has been designed and analyzed.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115843829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of a VI-Based Synchronic Testing System for Underwater Transducer Array","authors":"Yang Han, Yun Zhu","doi":"10.1109/NCIS.2011.170","DOIUrl":"https://doi.org/10.1109/NCIS.2011.170","url":null,"abstract":"This paper is concerned with the design of testing system for underwater transducer array by using virtual instrument technology. For the practical application of synchronous generation and acquisition, the paper, based on NI-TClk (Trigger clock) synchronization technology, the modular hardware based on PXI (PCI extensions for instrumentation) bus, as well as the modular software as NI-LABVIEW.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116079800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}