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

International Conference on Computational Intelligence and Security

作者： Zuowen Tan Key Laboratory of Network Security and Cryptology School of Mathematics and Computer Science Fujian Normal University Fuzhou Fujian China School of Information Technology Jiangxi University of Finance and Economics Nanchang Jiangxi China

ISBN: (纸本)9781424454112

In a group signature scheme, a group member signs messages anonymously on behalf of the group. However, in the case of a dispute, the actual group signer's identity can be revealed by a designated entity. In this paper, we propose a new identity-based group signature scheme using bilinear maps. The group signature scheme is well suited for large groups, i. e., the length of the group' s public key and the length of signatures are independent on the size of the group. Our signature scheme is based on bilinear maps. Furthermore, a group member can sign many messages using the same key pair. Cryptanalysis shows that the proposed group signature scheme is secure under the computational Diffie Hellman problem called CDHP assumption. And it is also more efficient than previous ones satisfying these requirements.

关键词： Identity-based encryption Public key Public key cryptography information security Elliptic curve cryptography Computational intelligence information technology Finance computer security Mathematics

来源：评论

学校读者我要写书评

暂无评论

pService: Towards Similarity Search on Peer-to-Peer Web Services Discovery

pService: Towards Similarity Search on Peer-to-Peer Web Serv...

引用

International Conference on Advances in P2P Systems (AP2PS)

作者： Gang Zhou Jianjun Yu National Digital Switching System Engineering and Technological Research and Development Center China State Key Laboratory of Software Development Environment Beihang University China Computer Network Information Center Chinese Academy and Sciences China

We present the design of pService system for P2P Web services discovery supporting similarity search with its locality-preserving feature based on modified Skip Graph. In pService, the most important property (e.g. service name) of a service is viewed as the indexing key of a peer node. The other properties are extracted as multiattributes which would be mapped into one-dimensional indices using HSFC (Hilbert Space Filling Curve), and assigned to membership vector of the peer node. These two features help to support similarity search in two aspects: peer nodes with similar indexing keys would be distributed neighborly, peer nodes with similar indices will connect to each other through routing table. Our evaluation showed that the pService performs considerable Web services discovery efficiency.

关键词： Peer to peer computing Web services Indexing Routing Hilbert space Filling Search engines Data structures Switching systems Design engineering

来源：评论

学校读者我要写书评

暂无评论

Support Vector Machine for Suppressing Error Method

Support Vector Machine for Suppressing Error Method

引用

International Conference on information Science and Engineering (ICISE)

作者： Shuxia Lu Pu Shi Ming Chen Key Laboratory of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding China Baoding Pascali Cable TV Integrated Information Network Company Limited Baoding China College of Mathematics and Computer Science Hebei University Baoding China

ISBN: (纸本)9781424449095

Support Vector Machine (SVM) is sensitive to noises and outliers. For reducing the effect of noises and outliers, we propose a novel SVM for suppressing error function. The error function is limited to the interval of. The separation hypersurface is simplified and the margin of hypersurface is widened. Experimental results show that our proposed method is able to simultaneously increase the classification efficiency and the generalization ability of the SVM.

关键词： Support vector machines Support vector machine classification computer errors Machine learning Educational institutions Mathematics computer science Noise reduction Training data information science

来源：评论

学校读者我要写书评

暂无评论

A method for constructing simplified kernel model based on kernel-MSE

A method for constructing simplified kernel model based on k...

引用

Pacific-Asia Workshop on Computational Intelligence and Industrial Application, PACIIA

作者： Qi Zhu Yong Xu JinRong Cui ChangFeng Chen JingHua Wang XiangQian Wu YingNan Zhao Key Laboratory of Network Oriented Intelligent Computation Shenzhen Graduate School Harbin Institute of Technology Shenzhen China Department of Computer Science and Technology Harbin Institute of Technology Harbin China Department of Computer Science and Technology Nanjing University of Information Science and Technology Nanjing China

In this paper, we derive an efficient nonlinear feature extraction method from naive Kernel Minimum Squared Error (KMSE) method. The most contribution of the derived method is its feature extraction procedure that is much more computationally efficient than naive KMSE. Differing from naive KMSE that exploits some linear combination of the total training patterns to express the discriminant vector in feature space, the derived method attempts to select out a small number of patterns (referred to as ¿significant nodes¿ in this paper) from the training set and exploits some linear combination of ¿significant nodes¿ to approximate to the discriminant vector in feature space. According to the following two principles, an algorithm for producing ¿significant nodes¿ is designed. The ¿significant node¿ set should well represent the whole training patterns, and each ¿significant node¿ should contribute much for the feature extraction result. Experimental results on several benchmark datasets illustrate our method can efficiently classify the real-world data with the high recognition accuracy.

关键词： Kernel Vectors Feature extraction Space technology Computational intelligence computer science Algorithm design and analysis computer industry Application software Laboratories

来源：评论

学校读者我要写书评

暂无评论

Access Model of Web Users Based on Multi-chains Hidden Markov Models

Access Model of Web Users Based on Multi-chains Hidden Marko...

引用

International Conference on Internet Computing in Science and Engineering (ICICSE)

作者： Kangfeng Zheng Yixian Yang Xiujuan Wang Shize Guo Key Laboratory of network and information attack & defence technology of MOE Beijing University of Posts and Telecommunications Beijing China College of Computer Sciences Beijing University of Technology Beijing China Research Institute of the General Staff of the PLA Beijing China

How to distinguish abnormal access from normal ones is the key problem in Distribution Denial of service(DDoS) attack detection. This research aims at finding out the major difference between the abnormal access and the normal ones in application layer. To this end, the paper conducts modeling on Web users' access behaviors based on hidden Markov model(HMM) with multiple chains and puts forward a method to identify abnormal access. Tests on simulation data indicate that this model can undo Web users access to a certain degree and discern the abnormal access well.

关键词： Hidden Markov models Testing Web and internet services computer crime computer networks Distributed computing Telecommunication traffic Web services Web pages IP networks

来源：评论

学校读者我要写书评

暂无评论

Fuzzy analytic hierarchy process-based utilities evaluation and adoption for DRM security policies

引用

Tongxin Xuebao/Journal on Communications 2009年第1 A期30卷 126-131页

作者： Zhang, Zhi-Yong Ye, Chuan-Qi Fan, Ke-Feng Zhang, Li-Li Niu, Dan-Mei Electronics Information Engineering College Henan University of Science and Technology Luoyang 471003 China Ministry of Education Key Laboratory of Computer Network and Information Security Xidian University Xi'an 710071 China Information Security Center for the State Key Laboratory of Network and Exchange Beijing Post and Telecom University Beijing 100158 China

The utility evaluation of DRM security policies based on fuzzy analytic hierarchy process (FAHP) and their game-theoretic adoptions were proposed from a novel perspective of the different level security and utilities' analyses. Based on the analytic hierarchy structure, the fuzzy estimation consistency matrix was employed to analyze the weights of optional security components and services, and then the gained weight values were further used for the computing of security policies' utilities and the accomplishing the game, finally yielding Nash equilibriums, that is, optimal policies profiles, as well as pre-conditions for participants. The use case for a group of the typical security policies shows that the result of the game includes two different groups of security policies profiles, as well as contents/services provider could effectively deploy a DRM system in term of the number of consumers purchasing digital contents, and average purchase, thus achieving the balance between the digital copyrights protection and real payoffs of participants.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

A Pedestrian Navigation System Using Navigation Sentence Based on XML

A Pedestrian Navigation System Using Navigation Sentence Bas...

引用

International Conference on information Management, Innovation Management and Industrial Engineering, ICIII

作者： Zheng Pan Lei Yan Adam C. Winstanley A. Stewart Fotheringham Jianghua Zheng Beijing Key Laboratory of Spatial Information Integration & Its Applications Institute of RS&GIS Peking University Beijing China National Centre for Geocomputation Maynooth Co. National University of Ireland Kildare Ireland Department of Computer Science Maynooth Co. National University of Ireland Kildare Ireland

Pedestrian navigation system has been widely used in many fields. In order to offer navigation information intelligible for pedestrian, we provide navigation sentences to users, which can be easily displayed on cellular phones with small display area. In addition, the navigation sentences can be converted into voice, which is useful for users in some special situations or with visually impairment. Navigation sentences can separately help pedestrians to go to the destination, or can be combined with electronic map to provide more intuitive navigation information. Compared with guidance maps, navigation sentences are easy to transmit and manage. The navigation sentences are described by XML (extensible markup language) and can be created on the server automatically based on the users' position and destination. This paper will discuss the structure of the pedestrian navigation system using navigation sentences. The structure and generating process of navigation sentences are also described.

关键词： Navigation XML Displays Cellular phones Speech synthesis Engines information management Innovation management Industrial engineering Application software

来源：评论

学校读者我要写书评

暂无评论

Combining opportunistic routing with dynamic source routing for wireless mesh networks

Combining opportunistic routing with dynamic source routing ...

引用

IET International Communication Conference on Wireless Mobile and Computing (CCWMC 2009)

作者： Qiang Shen Xuming Fang Sunmyeng Kim Rong He High Performance Network Lab Institute of Acoustics Chinese Academy and Sciences Beijing China Provincial Key Laboratory of Information Coding and Transmission Southwest Jiaotong University Chengdu China School of Computer and Software Engineering Kumoh National Institute of Technology Gyeongbuk South Korea

Routing in wireless mesh networks presents a great challenge due to unreliable wireless links and collisions. Recently, a new routing method, opportunistic routing (OR), is proposed to deal with them by exploiting broadcast nature of wireless networks. OR relies on the global knowledge of networks to select relays and determine priorities. In this paper, we propose a new routing scheme, OxDSR, which combines OR and dynamic source routing (DSR) and performs opportunistic transmissions with the help of the local information and the traditional route obtained by DSR. By taking the duplicates and additional wireless resource consumed by multiple ACK frames into consideration, we propose a new metric, equivalent data rate, to select and prioritize relays. Extensive simulation study shows that the proposed OxDSR is more resilient and achieves higher throughput than DSR based on the expected transmission count routing metric.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Non-blocking message total ordering protocol

引用

Science in China(Series F) 2008年第12期51卷 1919-1934页

作者： WANG Yun & WANG JunLing School of computer Science & Engineering, Southeast University key Lab of computer network & information integration, MOE, Nanjing 210096, China 1. School of Computer Science & Engineering Southeast University Key Lab of Computer Network & Information Integration MOE Nanjing 210096 China

Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol （NBTOP） for distributed systems. Non-blocking property refers to that the members in a fault tolerant group keep on running independently without waiting for installing the same group view when a fault tolerant group evolves even when decision messages collide. NBTOP takes advantage of token ring as its logical control way. Members adopt re-requesting mechanism （RR） to obtain their lost decisions. Forward acknowledgement mechanism （FA） is put forth to solve decision collisions. The paper further proves that NBTOP satisfies the properties of total order, agreement, and termination. NBTOP is implemented, and its performance test is done. Comparing with the performance of Totem, the results show that NBTOP has a better total ordering delay. It manifests that non-blocking property helps to improve protocol efficiency.

关键词： total ordering protocol non-blocking active replication fault tolerance token ring

来源：评论

学校读者我要写书评

暂无评论

Security and trust in digital rights management: A survey

引用

International Journal of network Security 2009年第3期9卷 247-263页

作者： Zhang, Zhiyong Pei, Qingqi Ma, Jianfeng Yang, Lin Ministry Of Education Key Laboratory of Computer Network and Information Security Xidian University Taibai South Road No.2 Xi'an Shannxi 710071 China Electronic Information Engineering College Henan University of Science and Technology Xiyuan Road No.48 Luoyang Henan 471003 China The Research Institute China Electronic Equipment and Systems Engineering Corporation Dacheng Road 13 Beijing 100141 China

A successful transaction of digital contents is primarily dependent on security policies, trust relationships and benefit equilibriums among various participants in a DRM (Digital Rights Management)-enabling contents value chain ecosystem. We first analyzed basic value chain architectures in existence, together with some fundamental security and trust requirements. And then, a state-of- the-art anatomy of the security and trust related to DRM was presented from different stakeholder' perspectives. Next, some challenges for multi-party mutual trust, not just inclined to any of participants, were proposed based on the holistic consideration of the digital contents/rights protection and the benefits balance. Finally, a conclusion was drawn that the rights-benefits-centric DRM ecosystem and the resulting trust relationship are crucial for the survivability of the contents industry.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：