oalib

OALib Journal期刊

ISSN: 2333-9721

费用:99美元

投稿

时间不限

2017 ( 79 )

2016 ( 86 )

2015 ( 907 )

2014 ( 1524 )

自定义范围…

匹配条件: “FANG Bin-Xing” ,找到相关结果约40545条。
列表显示的所有文章,均可免费获取
第1页/共40545条
每页显示
Techniques for Determining the Geographic Location of IP Addresses in ISP Topology Measurement
Yu Jiang,Bin-Xing Fang,Ming-Zeng Hu,Xiang Cui,
Yu Jiang
,Bin-Xing Fang,Ming-ZengHu,and Xiang Cui

计算机科学技术学报 , 2005,
Abstract: A brief survey on the state-of-the-art research of determining geographic location of IP addresses is presented. The problem of determining the geographic location of routers in Internet Service Provider (ISP) topology measurement is discussed when there is inadequate information such as domain names that could be used. Nine empirical inference rules are provided, and they are respectively (1) rule of mutual inference, (2) rule of locality, (3) rule of ping-pong assignment, (4) rule of bounding from both sides, (5) rule of preferential exit deny, (6) rule of unreachable/timeout, (7) rule of relay hop assignment, (8) rule of following majority, and (9) rule of validity checking based on interface-finding. In totally 2,563 discovered router interfaces of a national ISP topology, only 6.4% of them can be located by their corresponding domain names. In contrast, after exercising these nine empirical inference rules, 38% of them have been located. Two methods have mainly been employed to evaluate the effectiveness of these inference rules. One is to compare the measured topology graph with the graph published by the corresponding ISP. The other is to contact the administrator of the corresponding ISP for the verification of IP address locations of some key routers. The conformity between the locations inferred by the rules and those determined by domain names as well as those determined by whois information is also examined. Experimental results show that these empirical inference rules play an important role in determining the geographic location of routers in ISP topology measurement. Supported by the National Natural Science Foundation of China under Grant Nos. 60203021 and 60403033. Yu Jiang received the B.S. degree in computer software from the Heilongjiang University, Harbin, China, in 1990 and the M.S. degree in computer software and theory from the Harbin Institute of Technology (HIT), Harbin, China, in 1999. From August 1990 to August 1999, he worked on computer applications for the Statistics Bureau of Heilongjiang Provincial Government. At present, he is with the professional title of senior electronic engineer, and he is currently working toward the Ph.D. degree at the HIT. His current research interests are in the areas of Internet measurement and distributed network computing. Bin-Xing Fang received the B.S. degree in computer applications from the HIT, Harbin, China, in 1981 and the M.S. degree in computer architecture from Tsinghua University, Beijing, China, in 1984 and the Ph.D. degree in computer architecture from the HIT, Harbin, China, in 1989. He conducted post-doctoral research work at the National University of Defense Technology, Changsha, China. He is a part time professor in the School of Computer Science and Technology at the HIT, Harbin, China, and the head of the National Computer Network Emergency Response Technical Team/Coordination Center, Beijing, China. His research interests are in the areas of computer network and
Several Key Problems in Parallel Debugging
并行调试中的若干关键问题

WANG Wei FANG Bin-Xing ZHANG Hong-Li,
王巍
,方滨兴

计算机科学 , 2003,
Abstract: With the development of technique of parallel computing, parallel debugging becomes more and more important. Some new products and technology appear. In this paper, we introduce some key problems concerned in parallel debugging and some methods to solve them.
Covariance, correlation matrix and the multi-scale community structure of networks
Hua-Wei Shen,Xue-Qi Cheng,Bin-Xing Fang
Physics , 2010, DOI: 10.1103/PhysRevE.82.016114
Abstract: Empirical studies show that real world networks often exhibit multiple scales of topological descriptions. However, it is still an open problem how to identify the intrinsic multiple scales of networks. In this article, we consider detecting the multi-scale community structure of network from the perspective of dimension reduction. According to this perspective, a covariance matrix of network is defined to uncover the multi-scale community structure through the translation and rotation transformations. It is proved that the covariance matrix is the unbiased version of the well-known modularity matrix. We then point out that the translation and rotation transformations fail to deal with the heterogeneous network, which is very common in nature and society. To address this problem, a correlation matrix is proposed through introducing the rescaling transformation into the covariance matrix. Extensive tests on real world and artificial networks demonstrate that the correlation matrix significantly outperforms the covariance matrix, identically the modularity matrix, as regards identifying the multi-scale community structure of network. This work provides a novel perspective to the identification of community structure and thus various dimension reduction methods might be used for the identification of community structure. Through introducing the correlation matrix, we further conclude that the rescaling transformation is crucial to identify the multi-scale community structure of network, as well as the translation and rotation transformations.
Survey and Evaluation on Computer Vulnerability Database
计算机弱点数据库综述与评价

ZHANG Yong-Zheng,FANG Bin-Xing,CHI Yue,
张永铮
,方滨兴,迟悦

计算机科学 , 2006,
Abstract: Computer vulnerability database has been an important part of vulnerability research, and it is greatly significant for collecting, storing and organizing vulnerability information. This paper introduces the definition and taxonomy of computer vulnerabilities, analyzes and evaluates the present vulnerability databases, finally discusses the existing problems and the future research work.
Research and Improvement on the Data Distribution Algorithm of pC++ Language
pC++语言中数据划分算法的研究与改进

SHI Wei,FANG Bin-xing,HU Ming-zeng,
石威
,方滨兴,胡铭曾

软件学报 , 1999,
Abstract: 大规模并行计算是当前该领域研究的一大热点.由于大多数应用问题是数据并行问题,所以人们更多地采用数据并行计算方法来解决实际问题.在数据并行计算中,影响计算速度的一个重要因素是数据的划分状况.该文针对一种较为流行的面向对象数据并行语言——pC++的数据划分算法进行了分析,并指出了其不足之处,同时提出了一种改进的数据划分算法.实验表明,此算法与原有算法相比具有明显的优越性.
A Survey on Internet Topology Modeling
Internet拓扑建模综述

ZHANG Yu,ZHANG Hong-Li,FANG Bin-Xing,
张宇
,张宏莉,方滨兴

软件学报 , 2004,
Abstract: As the basis of Internet development and exploitation on higher levels, the Internet topology modeling starts from the random model to the hierarchical model. Then it developed to a more realistic one, scale-free network model. Many characteristics of topology are analyzed with the corresponding metrics, including power law. Moreover, the related work on the current topology models, topology generation algorithms, and topology generators is fully presented. Finally, the new problems and challenges which arise from current research are discussed and some suggestions for future research work are put forward.
A Network Anomaly Detection Method Based on Transduction Scheme
基于直推式方法的网络异常检测方法

LI Yang,FANG Bin-Xing,GUO Li,CHEN You,
李洋
,方滨兴,郭莉,陈友

软件学报 , 2007,
Abstract: Network anomaly detection has been an active and difficult research topic in the field of intrusion detection for many years. Up to now,high false alarm rate,requirement of high quality data for modeling the normal patterns and the deterioration of detection rate because of some "noisy" data in the training set still make it not perform as well as expected in practice. This paper presents a novel network anomaly detection method based on improved TCM-KNN (transductive confidence machines for K-nearest neighbors) machine learning algorithm,which can effectively detect anomalies using normal data for training. A series of experiments on well known KDD Cup 1999 dataset demonstrate that it has lower false positive rate,especially higher confidence under the condition of ensuring high detection rate than the traditional anomaly detection methods. In addition,even provided with training dataset contaminated by "noisy" data,the proposed method still holds good detection performance. Furthermore,it can be optimized without obvious loss of detection performance by adopting small dataset for training and employing feature selection aiming at avoiding the "curse of dimensionality".
Techniques of Building a Scalable, Efficient Intrusion Monitoring Architecture
一种可扩展的高效入侵监测平台技术

YANG Wu,FANG Bin-Xing,YUN Xiao-Chun,
杨武
,方滨兴,云晓春

软件学报 , 2007,
Abstract: To perform effective intrusion analysis in higher bandwidth network, this paper studies the data collecting techniques and proposes a scalable efficient intrusion monitoring architecture (SEIMA) for network intrusion detection system (NIDS). In the architecture of SEIMA, scaling network intrusion detection to high network speeds can be achieved using multiple sensors operating in parallel coupled with a suitable load balancing traffic splitter. High-performance data transfer is achieved through asynchronous DMA without OS's intervention by using efficient address translation technique and buffer management mechanism. Multi-rule packet filter based on finite state machine technique is implemented at user layer to eliminate overhead for processing redundant packets. The simulative and actual experiment results indicate that SEIMA is capable of reducing the using rate of CPU while improving the efficiency of data collection in NIDS, so as to save much more system resources for complex data analysis in NIDS. The method of SEIMA is very practical for network security.
Measurement Method of Gnutella-Like Peer-to-Peer Network
类Gnutella的对等网络的测量方法研究*

LIU Gang,FANG Bin-xing,HU Ming-zeng,ZHANG Hong-li,
刘刚
,方滨兴,胡铭曾,张宏莉

计算机应用研究 , 2006,
Abstract: The paper designs and implements a new crawler to extract the topology of the Gnutella network, and empirically deduces the shutter speed for an accurate topological snapshot.
Study on the security of SIP
SIP协议的安全性研究

YU Zhi-chun,FANG Bin-xing,ZHANG Zhao-xin,
俞志春
,方滨兴,张兆心

计算机应用 , 2006,
Abstract: With the widespread use of multimedia communications,SIP(Session Initiation Protocol) is becoming one of the most important protocols in the VoIP field.Facing the complex and open Internet environment,the security of SIP needs to be improved and enhanced.This paper analyzed the security threats to SIP at first,and then proved the existence of these threats by simulated attacking experiments,finally improved the authentication mechanism and provided security solution to SIP.
第1页/共40545条
每页显示


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.