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

International Conference on Educational and Information technology (ICEIT)

作者： Wu, Junying Xia, Chunhe Lv, Liangshuang Wang, Haiquan Beijing Key Laboratory of Network Technology School of Computer Science and Engineering Beihang University Beijing China College of Software Beihang University Beijing China

ISBN: (纸本)9781424480340

In DTNs, links are rare. Making full use of every link shows great importance to routing protocols. Link Prediction (LP) can predict future links between two nodes. Plenty of algorithms for link prediction have been proposed and were applied to various real networks, like social network. But few were applied to wireless ad hoc networks. Some recent works were done to study mobility prediction on link availability prediction, which was to predict the reliability of existing links [1-8]. In this paper, we study link prediction algorithms that use only topology information and adjust it to mobility ad hoc networks. We propose a Group Link Prediction Algorithm (GLP). GLP can predict future link not only between nodes, but also between groups. GLP is a distributed, lightweight algorithm. Simulation shows that GLP has significant performance in group mobility ad hoc networks. In the future, a routing protocol in the full use of GLP will be studied. © 2010 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Group key management using proxy re-encryption for dynamic networks

Group key management using proxy re-encryption for dynamic n...

引用

2nd International Workshop on Education technology and computer Science, ETCS 2010

作者： Zhang, Minqing Wu, Xuguang Han, Yiliang Yang, Xiaoyuan Key Laboratory of Network and Information Security of APF Engineering College of APF China Department of Computer Science and Technology Xi'an Jiaotong University Xi'an China

ISBN: (纸本)9780769539874

Decentralized group key management mechanisms offer beneficial solutions to enhance the scalability and reliability of a secure multicast framework by dividing the whole group into subgroups. However, many of the previous decentralized solutions require the trust key distribution center, or don't exploit the broadcast nature of wireless communication. In the study, a novel group key management scheme is proposed, which employs decentralized group membership, doesn't relay on the trust center, and makes use of the wireless broadcast nature to efficiently accommodate dynamic group changes. The main contributions are: (1) we extend a proxy re-encryption to multi-hop environment, and then develop a distributed protocol for key distribution;(2) in local group communication, we use multi-recipients encryption to broadcast key information reducing communication cost;(3) we analyze the proposed scheme with the previous schemes and the analysis result indicates that the proposed scheme has advantages with regard to the rekeying cost, storage overhead and computation efficiency. © 2010 IEEE.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Currency recognition modeling research based on bp neural network improved by gene algorithm

Currency recognition modeling research based on bp neural ne...

引用

2010 International Conference on computer Modeling and Simulation, ICCMS 2010

作者： Cao, Bu-Qing Liu, Jian-Xun School of Computer Science and Engineering Key Laboratory of Knowledge Management and Network-based Manufacture Hunan University of Science and Technology Xiangtan China State Key Laboratory of Software Engineering Wuhan University Wuhan China School of Computer Wuhan University Wuhan China

ISBN: (纸本)9780769539416

Both Artificial Neural networks and Gene Algorithm are a method that people imitates biological treatment pattern and gains the intelligence out of it in order to handle complicated problems. Based on uncertain network model structure and indeterminate initial weights and slow convergence speed for Back Propagation Neural networks, this paper proposes that make use of Gene Algorithm to improve it in order to find the most suitable network connection weights and network structure, then form GA-BP model and apply it to currency recognition. The experiment indicates that GA-BP model shorten training time for Back Propagation Neural networks and gain higher recognition speed and better recognition effect, thereby, it is preponderant for image recognition that make use of Gene Algorithm to improve Back Propagation Neural networks. © 2010 IEEE.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

A novel term weighting scheme with distributional coefficient for text categorization with support vector machine

A novel term weighting scheme with distributional coefficien...

引用

2010 IEEE Youth Conference on Information, Computing and Telecommunications, YC-ICT 2010

作者： Ping, Yuan Zhou, Ya-Jian Yang, Yi-Xian Peng, Wei-Ping Key Laboratory of Network and Information Attack and Defence Technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China Department of Computer Science and Technology Xuchang University Xuchang 461000 China

ISBN: (纸本)9781424488841

In text categorization, vectorizing a document by probability distribution is an effective dimension reduction way to save training time. However, the data sets that share many common keywords between categories affect the classification performance seriously. To address that problem, firstly, we conduct an effective term weighting scheme consisting of posterior probability and relevance frequency to improve the performance of the traditional hybrid classification model. To get a better representation of the information contained in a document, as well as the introduction of an advanced hybrid classification model, we also propose a novel term weighting scheme with distributional coefficient so as to obtain further accuracy enhancement. The experimental results show that these proposed schemes are significantly better than the traditional method. © 2010 IEEE.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Applying multiple residual error gray forecast to restrain endpoints effect in HHT of network traffic

Applying multiple residual error gray forecast to restrain e...

引用

International Conference on Pervasive Computing, Signal Processing and Applications

作者： Zheng, Kangfeng Wang, Xiujuan Yang, Yixian Guo, Shize Key Laboratory of Network and Information Attack and Defense Technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China College of Computer Sciences Beijing University of Technology Beijing 100124 China

ISBN: (纸本)9780769541808

Studying the features of network traffic is a necessary method in many applications such as managing and monitoring the network, detecting network attack etc. Due to the non-stationary and random characteristics of the traffic signal, Hilbert-Huang Transformation(HHT) is an effective method in signal processing. However, endpoints effect comes subsequently in HHT. In this particular case, the paper introduces a multiple residual error gray forecast method to realize data continuation so as to inhibiting endpoints effect in applying HHT to network traffic signal. Experimental results show that this method can effectively restrain the endpoint divergence phenomenon in applying HHT to network traffic signal, but it is not applicable to deterministic signals. © 2010 IEEE.

关键词： Mathematical transformations

来源：评论

学校读者我要写书评

暂无评论

Optimization of probabilistic neural networks based on center neighbor

Optimization of probabilistic neural networks based on cente...

引用

International Conference on E-Business and E-Government

作者： Liu, Lianzhong Li, Chunfang Qian, Lipu Key Laboratory of Beijing Network Technology School of Computer Science and Engineering Beihang University Beijing China Network Center Heibei Institute of Physical Education Beihang University Beijing China Network Center Heibei Institute of Physical Education Shijiazhuang China

ISBN: (纸本)9780769539973

Probabilistic Neural networks (PNN) learn quickly from examples in one pass and asymptotically achieve the Bayes-optimal decision boundaries. The major disadvantage of PNN is that it requires one node or neuron for each training sample. Various clustering techniques have been proposed to reduce this requirement to one node per cluster center. Decision boundaries of clustering centers are approximation to training samples. A new optimization of PNN is investigated here using iteratively computing the centers of each class samples unrecognized and add the nearest neighbors to pattern layer. This algorithm takes into account not only the approximation of probability density but also the necessary of classification. For compensating the loss of generalization accuracy to some degree, ensemble learning technique is introduced to boost the accuracy in test dataset. Experiments on UCI show the appropriate tradeoff in training time, number of nodes and generalization ability. © 2010 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

An executable business model for generic web applications

An executable business model for generic web applications

引用

2010 International Conference on computer Information Systems and Industrial Management Applications, CISIM 2010

作者： Chen, Zhenxiang Ma, Kun Abraham, Ajith Yang, Bo Sun, Runyuan Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan China School of Computer Science and Technology Shandong University Jinan China Scientific Network for Innovation and Research Excellence United States

ISBN: (纸本)9781424478170

In this paper, a novel platform-specific executable business model called xBM is proposed to sufficiently represent the business logic process. The metamodel of xBM have been analysed, formalised and illustrated. Traditional version control idea based on the copy-modify-merge approach is also applied in xBM. Moreover, our approach for model development approach based on xBM is presented for generic web applications. Finally a case study of simplified Provincial Excellent Academic Degree Thesis Review System is demonstrated how to build xBMs and transform them into the final system. ©2010 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Reverse extraction of early-age hydration kinetic equation from observed data of Portland cement

引用

Science China(Technological Sciences) 2010年第6期53卷 1540-1553页

作者： WANG Lin1,YANG Bo2,ZHAO XiuYang1,2,CHEN YueHui2 & CHANG Jun3 1 School of computer Science and technology,Shandong University,Jinan 250101,China 2 Provincial key laboratory for network-based Intelligent Computing,University of Jinan,Jinan 250022,China 3 School of Material Science and Engineering,University of Jinan,Jinan 250022,China 1. School of Computer Science and Technology Shandong University Jinan 250101 China2. Provincial Key Laboratory for Network-based Intelligent Computing University of Jinan Jinan 250022 China3. School of Material Science and Engineering University of Jinan Jinan 250022 China

The early-age hydration of Portland cement paste has an important impact on the formation of microstructure and development of ***,manual derivation of hydration kinetic equation is very difficult because there are multi-phased,multi-sized and interrelated complex chemical and physical reactions during cement *** this paper,early-age hydration kinetic equation is reversely extracted automatically from the observed time series of hydration degree of Portland cement using evolutionary computation method that combines gene expression programming and particle swarm optimization *** order to reduce the computing time,GPUs are used for acceleration in *** have shown that according to the extracted kinetic equation,simulation curve of early-age hydration is in good accordance with the observed experimental ***,this equation still has a good generalization ability even changing chemical composition,particle size and curing conditions.

关键词： Portland cement hydration kinetic equation reverse extraction gene expression programming particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

TLDV: Tree-Like Locator Distance Vector routing protocol for MANETs

TLDV: Tree-Like Locator Distance Vector routing protocol for...

引用

2010 International Conference on Educational and Information technology, ICEIT 2010

作者： Wang, Haiquan Mi, Le Xia, Chunhe Lv, Liangshuang Chen, Meng State Key Laboratory of Virtual Reality Technology and System Beihang University Beijing China Beijing Key Laboratory of Network Technology Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China School of Software Beihang University Beijing China

ISBN: (纸本)9781424480340

Most routing protocols in MANETs don't scale well in networks with large numbers of nodes where the scalability of the routing protocols plays a vital role. And it is well known that these routing protocols usually use node locator (e.g. IP address) as pure identifier. In this paper, we propose a scalable Tree-Like Locator Distance Vector routing protocol for MANETs, which is inspired by DART. This protocol splits node's ID and locator in network layer. Each node has one unique permanent ID and a temporary dynamic 2b-ary tree locator. Node's locator describes the node's relative position in the network's topology, and should change whenever the topology changes. © 2010 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：