检索结果-内蒙古大学图书馆

International Conference on Communication technology (ICCT)

作者： Wei Li Min Li Ruiting Fan Lanjun Li Beijing Key Laboratory of Network Technology School of Computer Science and Technology Beihang University Beijing China

Fault diagnosis for wireless mesh network is an active field in recent years, and also the decision tree algorithm is widely used in Data Mining field. How to apply machine learning algorithm in network fault diagnosis presents challenge. This paper proposes a rule post-pruning method named as W-C4.5-RP which is based on traditional C4.5 algorithm. In order to verify the validation of the algorithm, we trained the decision tree by injecting faults actively into wireless mesh network (WMN) in a testbed in campus networks. The experimental results show that the W-C4.5-RP algorithm can shorten diagnostic time and increase diagnostic efficiency. This method can be applicable for the faults diagnosis in wireless mesh networks which are characteristic of burst and extremely short duration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A multi-factor integrated fault diagnosis method for distributed applications

A multi-factor integrated fault diagnosis method for distrib...

引用

International Conference on Information Science and Engineering (ICISE)

作者： Wei Li Guangye Li Yin Yin Key Laboratory of Beijing Network Technology School of Computer Science and Technology Beihang University Beijing China

ISBN: (纸本)9781424476169

Fault management is a key research part in the field of distributed applications management. Fault Management based on active probing is divided into two phases: fault detection and fault diagnosis, considering probe costs in these two phases, this paper proposes two algorithms: PSFD and PSFL. Finally, MATLAB is used as the experiment platform and BNT toolkit is adopted. Simulations show the effectiveness of the algorithms.

关键词： Probes Fault detection Algorithm design and analysis Fault location Greedy algorithms Complexity theory

来源：评论

学校读者我要写书评

暂无评论

A new hierarchical key AuthData management scheme for trusted platform

A new hierarchical key AuthData management scheme for truste...

引用

International Conference on Multimedia Information networking and Security

作者： Peng, Weiping Zhou, Yajian Wang, Cong Yang, Yixian Ping, Yuan Key Laboratory of Network and Information Attack and Defence Technology of MOE Beijing University of Posts and Telecommunications Beijing China School of Computer Science and Technology Henan Polytechnic University Jiaozuo Henan China National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9780769542584

The purpose of TPM authorization mechanism is to authenticate the owner of a TPM or to authorize the use of an instance of a TPM capability. The TPM treats knowledge of the AuthData as complete proof of ownership of the entity. The main specification defines an authorized user must provide the parent key AuthData before loading its child key and provide the child key AuthData before using it. All users had to manage more and more AuthData values with the rapid increasing of keys. We have designed and analyzed a new hierarchical key AuthData management Scheme for trusted platform. In our scheme, each authorized user just needs to keep one single AuthData, and the computational requirement for generating or deriving an AuthData is just at the level of modular exponentiation and hash operation. Moreover, the lower level AuthData values can be easily derived from higher level AuthData along the same chain, but it is infeasible reversely. Even if more lower level AuthData values can't be colluded to calculate the higher level AuthData. The result of performance evaluation and security analysis demonstrates that our proposed method is feasible and security. © 2010 IEEE.

关键词： Trusted computing

来源：评论

学校读者我要写书评

暂无评论

Research on task-deployment for the distributed simulation of computer network attack and defense exercises

引用

Journal of Computational Information Systems 2010年第4期6卷 1037-1050页

作者： Chen, Meng Jiao, Jian Yang, Yi Luo, Min Xia, Chunhe School of Computer Science and Engineering Beihang University Beijing 100191 China Key Laboratory of Beijing Network Technology China

To solve the problem of unreasonable tasks deployment which extends the whole simulating time and limits the simulating scale in Distributed Simulation of computer network Attack and Defense Exercises (DSCNADE), this paper analyzes the simulating process of DSCNADE and the relation between hosts' performance and tasks' requirement, and presents a task-deployment model-PDAMTD (the Pushdown Automaton Model of Task-Deployment) which achieves deploying simulation tasks in DSCNADE through gathering the running ability of every host that runs a simulator, evaluating the capability requirement of every atomic simulation task and using Atomic Simulation Tasks Matching Algorithm based on Ant Colony Theory (ASTMAACT). Otherwise, we design and implement a Task-Deployment System for the Distributed Simulation of computer network Attack and Defense Exercises (TDSDSCNADE), and the experiments show that TDSDSCNADE makes DSCNADE achieve optimizing its running time and expand its scale for network security simulation. Copyright © 2010 Binary Information Press.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

The CMVAI-File: An Efficient Approximation-Based High-Dimensional Index Structure

The CMVAI-File: An Efficient Approximation-Based High-Dimens...

引用

International Conference on Multimedia Information networking and Security (MINES)

作者： Lihong Ye Yuan Hua Communication and Computer Network Key Laboratory of Guangdong South China University of Technology Guangzhou China

Similarity-Search based index structure is an important topic in many application areas, such as content-based multimedia information retrieval, data mining, cluster analysis, etc. In order to improve query performance in high-dimensional vector spaces, lots of index structures have been proposed. However, many well-known index structures encounter “dimensional curse” while the dimension of feature vector increase. In order to solve such problem, researchers analyzed the nearest-neighbor search problem in high-dimensional vector spaces deeply and proposed some approximation-based index structures. The VA-File which is the first implement approximation-based index structures has done well in solving “dimensional curse” problem. However, approximate vectors in VA-File are just simply placed in flat structure files without other optimization methods. In this paper, we propose the Collecting and Multi-Vector-Approximation Indexed-File (CMVAI-File). The CMVAI-File is still an approximate-based index structure and uses a filter-based approach. Unlike the VA-File, the CMVAI-File uses multi-level approximate, collect the same vector-approximations and a segmental structure to improve query performance. Experimental results show that CMVAI-File has a promising improvement in performance.

关键词： Approximation methods Indexes Approximation algorithms Image databases Time factors Filtering algorithms Filtering

来源：评论

学校读者我要写书评

暂无评论

Achieving High Throughput by Transparent network Interface Virtualization on Multi-core Systems

Achieving High Throughput by Transparent Network Interface V...

引用

IEEE International Conference on Cloud Computing technology and Science (CloudCom)

作者： Huiyong Zhang Yuebin Bai Zhi Li Niandong Du Wentao Yang School of Computer Science Beijing Key Laboratory of Network Technology Beihang University Beijing China

Though with the rapid development, there remains a challenge on achieving high performance of I/O virtualization. The Para virtualized I/O driver domain model, used in Xen, provides several advantages including fault isolation, live migration, and hardware independence. However, the high CPU overhead of driver domain leads to low throughput for high bandwidth links. Direct I/O can achieve high performance but at the cost of removing the benefits of the driver domain model. This paper presents software techniques and optimizations to achieve high throughput network I/Ovirtualization by driver domain virtualization model on multicore systems. In our experiments on multi-core system with a quad-port 1GbE NIC, we observe the overall throughput of multiple guest VMs can only be 2.2Gb/s, while the link bandwidth is 4Gb/s in total. The low performance results from the disability of driver domain to concurrently serve multiple guest VMs running bandwidth-intensive applications. Consequently, two approaches are proposed. First, a multi task let net back is implemented to serve multiple net fronts on currently. Second, we implement a new event channel dispatch mechanism to balance event associated with networkI/O over VCPUs of driver domain. To reduce the CPU overhead of the driver domain model, we also propose two optimizations: lower down event frequency in netback and implement LRO in net front. By applying all the above techniques, our experiments show that the overall throughput can be improved from the original 2.2Gb/s to 3.7Gb/s and the multi-core CPU resources can be utilized efficiently. We believe that the approaches of our study can be valuable for high throughput I/O virtualization in the coming multi-core era.

关键词： Driver circuits Throughput Bandwidth network interfaces Hardware Software Linux

来源：评论

学校读者我要写书评

暂无评论

Research of presence service testbed on cloud-computing environment

Research of presence service testbed on cloud-computing envi...

引用

2010 3rd IEEE International Conference on Broadband network and Multimedia technology, IC-BNMT2010

作者： Quan, Wei Wu, Jun Zhan, Xiaosu Huang, Xiaohong Ma, Yan Institute of Network Technology Beijing University of Posts and Telecommunications Beijing China School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424467709

Presence service has become one of the key application services, which can be applied in many areas, such as buddy status, tele-working, ticket sale, the Internet of things, location-based service and so on. And cloud computing, widely used to provide a variety of IT services, has been a new method of sharing infrastructure. This paper presents a design and implementation of presence service deployed on a cloud computing environment. Open source implementations such as a cloud platform, a presence server, an XCAP server are deployed to establish the testbed. The testbed practically analyzes the presence service work flows, WEB interface for presence service. And the service quality in the cloud environment is analyzed through many special stress tests. Finally, the paper points out many evolutions of the testbed, and extends presence service to IMS system. © 2010 IEEE.

关键词： Testbeds

来源：评论

学校读者我要写书评

暂无评论

Dictionary based inverted index for music information retrieval

Dictionary based inverted index for music information retrie...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Xiao-Hong Yang Qing-Cai Chen Xiao-Long Wang Department of Computer Science and Technology Key Laboratory of Network Oriented Intelligent Computation Shenzhen Graduate School Harbin Institute of Technology Shenzhen China Department of Computer Science and Technology Key Laboratory of Network Oriented Intelligent Computation Harbin Institute of Technology Shenzhen China

ISBN: (数字)9781424465279

ISBN: (纸本)9781424465262

With the rapid progress in data storage and communication technology, there has been an explosive growth of music information. As the traditional metadata-based search engine can not provide natural and intuitive way to retrieve music, content-based music information retrieval has been attracting more and more attention and is becoming a popular research topic over the past decades. How to organize and search large scale music collections is one of the most fundamental challenging research problems. In this paper we introduce an inverted index approach well known in text information retrieval to organize and index music collections. According to musical form structure and repetition rule of musical themes, repeating patterns can be regarded as representation for musical themes. Statistical result indicates repeating patterns follow Zipf's law on a given music database. Music melodies are segmented into phrases based on musical dictionary composed of repeating patterns, and added into inverted index with necessary music information. Experimental results reveal that proposed index method outperforms the compared method greatly with much less storage space.

关键词： Dictionaries Music

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on Educational and Information technology (ICEIT)

作者： Senshen Hao Jian Jiao Chunhe Xia Xiaojian Li Shan Yao State Key Laboratory of Virtual Reality Technology and System Beijing Key Laboratory of Network Technology School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781424480333

In order to effectively deal with large-scale attacks on computer networks, computer network Defense (CND) policy refinement based on descriptive language is wildly used. However, it's very difficult to figure out the semantic discrepancies between the measures and the predefined policy after the calculation with symbols by computers. A new method is presented to solve the discordance of semantic between the measures and the predefined policy automatically. Based on the establishment of the ontology of CND policy and measure (CNDPM), the CND policy and measure semantic similarity analysis model (CNDPMSSAM) is established, and then the termination of the two main components of CNDPMSSAM are proofed by the putdown automaton, and the prototype system of CNDPMSSAM is implemented. At last, we validate the validity of this method on analyzing semantic similarity of transferring from computer network Defense Policy Specification Language (CNDPSL) to Defense Measure Description Language (DMDL) with experiments.

关键词： CND measure CND policy ontology semantic similarity Ontology Semantics Policies ANALYSIS MODELS Discordance Signs and symbols

来源：评论

学校读者我要写书评

暂无评论

Descriptive model of peer-to-peer Botnet structures

Descriptive model of peer-to-peer Botnet structures

引用

International Conference on Educational and Information technology (ICEIT)

作者： Junfeng Duan Jian Jiao Chunhe Xia Shan Yao Xiaojian Li State Key Laboratory of Virtual Reality Technology and System Beijing Key Laboratory of Network Technology School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781424480333

Peer-to-peer (P2P) Botnets, which are more resilient and robust than centralized botnets, have emerged as the peer-to-peer technology evolves. Better understanding of this new phenomenon will help researchers develop detection and mitigation methods. Most of existing work is case study of typical P2P botnets. In this paper, we focus on systematically analyzing structures of P2P botnets. We propose a descriptive model of P2P botnet structures, which consists of features of P2P bot, definitions of structures, and structural properties. Firstly, we detail two key functionalities of P2P bot, command-and-control (C&C) functionality and peer-to-peer (P2P) functionality, and give several features of P2P bot. And then, we define two structures of P2P botnets: C&C structure and P2P structure. To characterize these structures, we propose several properties and corresponding quantitative methods. Finally, we conduct experiments to verify our results.

关键词： Peer to peer computing Routing protocols Concrete Storms Analytical models Fires

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：