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

2010 International Conference on Computer Application and System Modeling, ICCASM 2010

作者： He, Peng Pan, Heng Li, Xiangdong Zheng, Qiusheng Zhengzhou Key Laboratory of Network Security Appraisal Zhongyuan Institute of Technology ZhengZhou China

ISBN: (纸本)9781424472369

The physical topology discovery is one of the difficulties in network measurements. This paper proposes a novel algorithm for discovering the physical topology of networks based on Spanning Tree Protocol (STP). Our algorithm improves and elevates the accuracy of connection judgments and the effectiveness and efficiency of discoveries greatly;it can also do well in finding backup links, hubs and other dumb devices that do not support SNMP. Besides, we solve the problem that devices' ports do not correspond to MAC addresses within VLANs. © 2010 IEEE.

关键词： network management

来源：评论

学校读者我要写书评

暂无评论

An attack graph based network security evaluation model for hierarchical network

An attack graph based network security evaluation model for ...

引用

2010 IEEE International Conference on Information Theory and Information security, ICITIS 2010

作者： Ge, Haihui Gu, Lize Yang, Yixian Liu, Kewei Key Laboratory of Network and Information Attack and Defence Technology MOE Beijing University of Posts and Telecommunications Beijing China Laboratory of network security Information Technology Security Evaluation Center Beijing China

ISBN: (纸本)9781424469406

To evaluate the security situation of hierarchical network, a novel evaluation algorithm based on the method of constructing a security risk function is proposed. The proposed algorithm is the aggregation of qualitative evaluation and quantitative evaluation. We quantify the asset loss (AL) and the threat value of each attack step (TVA) basing on attack graph, and adjust the loss of assets that are of the same type and have different uses with coefficient of asset importance (CAI). Then, we construct a risk evaluation function which is based on the above three parameters. Thus, the assessment score gotten through the evaluation function can comprehensively reflect the risk value including loss, threat of an attack step, and importance of the suffering entity. Finally, we get the risk value by fusing all subnets'risk value in one area, and divide the risk value into 4 security levels. Seen from the case study, the model solves the security evaluation problem for hierarchical network simply and efficiently. © 2010 IEEE.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of Computer Science & technology 2010年第6期25卷 1293-1304页

作者：王怀习朱岩冯荣权 Stephen S.Yau LMAM School of Mathematical SciencesPeking University Electronic Engineering Institute Institute of Computer Science and Technology Peking University Key Laboratory of Network and Software Security Assurance (Peking University) Ministry of Education Information Assurance Center and School of Computing Informatics and Decision Systems Engineering Arizona State University

In this paper a new signature scheme,called Policy-Endorsing Attribute-Based Signature,is developed to correspond with the existing Ciphertext-Policy Attribute-Based *** signature provides a policy-and-endorsement *** this mechanism a single user,whose attributes satisfy the predicate,endorses the *** signature allows the signer to announce his endorsement using an access policy without having to reveal the identity of the *** security of this signature,selfless anonymity and existential unforgeability,is based on the Strong Diffie-Hellman assumption and the Decision Linear assumption in bilinear map groups.

关键词： cryptography fine-grained access control attribute-based signature policy-and-endorsement selfless anonymity existential unforgeability

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on networking and Distributed computing

作者： Shan, Yi Liu, Taoying Liu, Hong Key Laboratory of Network Science Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769542072

It is generally believed that Zipf's law is well applied for Web objects. However, as OSNs prevail and Internet begins to concentrate more and more on individuals, many researchers report that request frequency of Web objects deviates from Zipf's law notably, especially for UGC (User Generated Content) sites. In this paper, we take the first step to explain it from the perspective of relations between content provider and consumer. Our contribution is twofold: (1) We propose a new metric named social locality to quantify relations between content providers and consumers of a site. (2) We find that social locality has strong influence on the access patterns of UGC sites. Sites with high social locality may deviate from Zipf's law more significantly than the ones with lower social locality. © 2010 IEEE.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Investigating, modeling, and ranking interface complexity of Web Services on the World Wide Web

Investigating, modeling, and ranking interface complexity of...

引用

World Congress on Services

作者： Lu, Xiaoyi Lin, Jian Zou, Yongqiang Peng, Juan Liu, Xingwu Zha, Li Key Laboratory of Network Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9780769541297

Analyzing factors of affecting Web Service invocation performance is a hot topic. Among the factors, service interface complexity is a key one investigated by much research work. However, these researches mainly analyze the impact on the performance of primitives, some simple data structures like mesh interface object, or array of them. For the complex data structures, these works lack of a systematic approach to characterize the impact. This paper firstly makes a detailed statistics of service interface complexity based on a large sample space (10K+ WSDL files) on the World Wide Web, and we find about 41.6% services contain complex data structures. The statistic results guide us to conduct many experiments for finding out the correlation of service interface complexity to invocation performance. We discover an interesting feature on commonly used Web Service platforms (Axis/gSOAP/.Net), called Data Structural Form Unaware. As each parameter or return value can be represented as a tree with two kinds of nodes, structure type node and primitive type node, then the feature means that the overhead caused by parameters or return values is independent of the organization of nodes in the trees, but it is only related with the number and the type of nodes. By this feature, we present a simple model to quantify the impact of service interface complexity. Using our model, a Service Interface Performance Vector can be calculated by parsing a WSDL file to estimate the overhead of service interface design. This vector, together with the invocation probability of each operation, generates the Service Interface Performance Score, a comprehensive complexity indicator which can be used to evaluate and rank the service interfaces. At last, a rank report of services on the WWW is shown. Our work can play a guiding role in service interface designing, service interface performance predicting, and ranking. © 2010 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Identification and extraction of topic elements for Chinese interactive text

Identification and extraction of topic elements for Chinese ...

引用

International Conference on Multimedia technology

作者： Haiping Zhu Yang Yang Yan Chen Xiaolu Yu Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Technology Research and Development Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi''an Jiaotong University Xi'an China Department of Computer Science and Technology Xi'an Jiaotong University China Department of Computer Science and Technology Xi''an Jiaotong University Xi'an China Xi'an Jiaotong University Xi'an Shaanxi CN

ISBN: (纸本)9781612847719

This paper is based on identification and extraction of topic elements for Chinese interactive text. A topic segmentation method based on time sequence is achieved. Then a novel identification and extraction algorithm of topic elements is proposed. Firstly, noise filtering and Chinese word segmentation on the original corpus are executed. Secondly, the identifying and extracting method in group of mixed turn is used to extract the topic elements, such as time, place and figure. Finally, performance evaluation of identification recall, identification accuracy and extraction accuracy are achieved. The experimental results show the effectiveness of the algorithm.

关键词： XML Semantics security Nickel Accuracy Satellites

来源：评论

学校读者我要写书评

暂无评论

A Digital Interface-based Digital Rights Management Scheme for Digital Cinema

引用

电子学报(英文版) 2010年第3期19卷 481-485页

作者： FAN Kefeng MA Zhaofeng YANG Yixiani NIU Xinxin Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Network and Information Attack and Defence Technology of MOE Beijing University of Posts and Telecommunications Beijing China

Digital rights management (DRM) is indispensable to prevent various kinds of illegal content usage. In this paper, we present a Digital interface-based DRM scheme (DI-DRM) for digital cinema, which can provide a new multi-interfaces oriented DRM solution for dig- . ital cinema. The authentication protocol and the encryption algorithm are described in detail. The two kinds of digital interfaces-based DRM prototype system are developed. security and performance analysis show the proposed scheme has several advantages. First, it is more secure than the existing scheme. Second, it is supported more rights, including the downstream devices. Finally, the cost of the chip based on DI-DRM is low. The scale of SOC application scheme is only 1/3 to 1/6 of the existing DTCP.

关键词：数字版权管理数字接口数字影院身份验证协议 DRM 数字电影加密算法原型系统

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of sign quantized projection

引用

The Journal of China Universities of Posts and Telecommunications 2010年第1期17卷 62-66页

作者： YE Tian-yu NIU Xin-xin MA Zhao-feng YANG Yi-xian Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Key Laboratory of Network and Information Attack and Defense Technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China National Engineering Laboratory for Disaster Backup and Recovery Beijing 100876 China

Quantized projection technology （QP） is the version of quantization index modulation （QIM） working in the projection domain. It essentially belongs to a double-sided additive embedder. In this article, the concept of sign quantized projection （SQP） is proposed, which differs from the conventional QP when working as a single-sided embedder. Theoretical analysis reveals that SQP has the same probability of miss and probability of false alarm as QP. Also, the document-to-watermark ratio （DWR） of SQP is less than its counterpart of QP by lOlg（1＋ γ） dB.

关键词： DWR QP SQP

来源：评论

学校读者我要写书评

暂无评论

Signal sparse representation based on the peak transform and modulus maximum of wavelet coefficients

引用

Tamkang Journal of Science and Engineering 2011年第3期14卷 217-224页

作者： Cen, Yi-Gang Xin, Rui Chen, Xiao-Fang Cen, Li-Hui Hu, Ming-Xing Chen, Shi-Ming Institute of Information Science Beijing Jiaotong University Beijing 100044 China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing 100044 China School of Information Science and Engineering Central South University Hunan Changsha 410083 China Centre for Medical Image Computing University College London United Kingdom School of Electrical and Electronic Engineering East China Jiao Tong University Jiangxi Nanchang 330013 China

It is now well-known that one can reconstruct sparse or compressible signals accurately from a very limited number of measurements. This technique is known as "compressed sensing" or "compressive sampling" (CS). A basic requirement of CS is that a signal should be sparse or it can be sparsely represented in some orthogonal bases. Based on the Peak Transform (PT) and modulus maximum of wavelet coefficients, a new algorithm was proposed for the signals that are non-sparse themselves and can not be sparsely represented by wavelet transform such as the Linear Frequency Modulated signal. According to this algorithm, K-sparse wavelet coefficients can be obtained. For the peak sequence produced by the Peak Transform, value expansion approach of reversible watermarking is exploited such that the peak sequence can be embedded into the measurements of the signal, which avoids increasing additional points for transmission. By using the Peak Transform and modulus maximum, non-sparse wavelet coefficients can be transformed into K-sparse coefficients, which improves the reconstruction result of CS. Simulation results showed that our proposed algorithm achieved better performance comparing with the original CS algorithm.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

An improved radius of gyration similarity measure between generalized fuzzy numbers and its application to multisource data fusion

引用

Journal of Computers 2011年第8期6卷 1732-1739页

作者： Yong, Deng Dong, Sun Wen, Jiang Jianling, Xu College of computer and information sciences Southwest University Chongqing 400715 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University Hanzhou Zhejiang 310036 China School of Electronics and Information Technology Shanghai Jiao Tong University Shanghai 200240 China Key Laboratory of Intelligent Computing Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China Department of Electronics Engineering Northwestern Polytechnical University Xían 710072 China Grain Economics Institute Nanjing University of Finance and Economics Nanjing 210003 China

The degree of similarity between fuzzy numbers plays an important role in fuzzy information fusion. In this paper, improved ROG-based similarity measure developed from the current ROG method is presented. It is shown that the new method can overcome some shortcomings of the existing similarity measures. Based on the proposed similarity measure, a more flexible and intelligent algorithm is developed to deal with multisensor data fusion problems. A numerical example is used to illustrate the efficiency of the proposed method. © 2011 ACADEMY PUBLISHER.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：