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

International Conference on Grid and Cooperative Computing (GCC)

作者： Jiuxin Cao Jingyu Huang Guojin Wang Jun Gu School of Computer Science and Engineering Jiangsu Provincial Key Laboratory of Network and Information Security Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China

With the advance of Web services and applications, quality of service (QoS) has becoming a key issue in Web service selection. Current discovery model and standards such as UDDI, WSDL do not give much support to QoS description and evaluation. Meanwhile, many researches only focus on QoS model and computation, without taking user individual preference into consideration. How to dynamically evaluate candidate Web services based on user preference is an important problem to be solved. This paper proposes a QoS and user preference based evaluation model called Q-WSEM(QoS-based Web service evaluation model) that extends the existing model by adding Web service evaluation center, and establishes a three-layer framework to achieve Web service evaluation based on QoS and user preference. In the third layer, information entropy method of multiple-attribute decision making theory is adopted to facilitate QoS assessment, and preference model is also introduced to provide interface for user to modify preference-based objective weight. Moreover, we have developed and implemented a Q-WSEM prototype, and measured the validity under different preferences. Experiment results demonstrate the effectiveness of this approach.

关键词： Web services Quality of service computer networks Laboratories information entropy Decision making Web and internet services Grid computing computer science information security

来源：评论

学校读者我要写书评

暂无评论

A Fair and Efficient Protocol for the Millionaires＇ Problem

引用

电子学报(英文版) 2009年第2期18卷 249-254页

作者： LI Ronghua WU Chuankun ZHANG Yuqing Graduate University of Chinese Academy of Sciences ( GUCAS) Beijing 100039 China National Computer Network Intrusion Protection Center GUCAS Beijing 100039 China State Key Laboratory of Information Security Institute of Software Beijing 100039 China

In the semi-honest model, Lin and Tzeng proposed an efficient solution to the millionaires' problem based on homomorphic encryption. They reduced the problem to the set intersection problem by encoding the private inputs in a special way (the encoding method allows an efficient protocol for the set intersection problem). This paper modifies Lin and Tzeng's protocol by introducing an Oblivious third party, and the modification is fair and secure in the same model. Compared with some of the previous fair protocols, our protocol relaxes the cryptographic assumption or the trust model. Compared with other previous fair protocols, our protocol are more efficient. We also consider security against malicious adversaries, i.e., malicious participants (the two millionaires) and third party.

关键词：议定书有效率编码方法第三方协议加密交集修改

来源：评论

学校读者我要写书评

暂无评论

Optimal k-nearest-neighbor query in data grid

Optimal k-nearest-neighbor query in data grid

引用

Joint International Conference on Advances in Data and Web Management, APWeb/WAIM 2009

作者： Zhuang, Yi Hu, Hua Li, Xiaojun Xu, Bin Hu, Haiyang College of Computer and Information Engineering Zhejiang Gongshang University China Zhejiang Provincial Key Laboratory of Information Network Technology China Hangzhou Dianzi University China

ISBN: (纸本)9783642006715

The paper proposes an optimal distributed k Nearest Neighbor query processing algorithm based on Data Grid, called the opGkNN. Three steps are incorporated in the opGkNN. First when a user submits a query with a vector Vq and a number k, an iDistance[3]-based vector set reduction is first conducted at data node level in parallel. Then the candidate vectors are transferred to the executing nodes for the refinement process in which the answer set is obtained. Finally, the answer set is transferred to the query node. The experimental results show that the performance of the algorithm is efficient and effective in minimizing the response time by decreasing network transfer cost and increasing the parallelism of I/O and CPU. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

On cross-correlation properties of Boolean functions

On cross-correlation properties of Boolean functions

引用

2009 4th International Conference on Communications and networking in China, CHINACOM 2009

作者： Zhou, Yu Xie, Min Xiao, Guozhen State Key Lab. Integrated Service Network Xidian University Shannxi Xi'an 710071 China Key Laboratory Computer Network and Information Security Xidian University Shannxi Xi'an 710071 China

ISBN: (纸本)9781424443376

To measure the correlation between two arbitrary Boolean functions, we propose the two new criteria called the sum-of-squares indicator and the absolute indicator of the cross-correlation. The two indicators generalize the GAC criterion (which was proposed by X.M. Zhang and Y.L. Zheng, in GAC-the criterion for global avalanche characteristics of cryptographic functions, Journal for Universal computer Science, 1(5): 316-333, 1995). Lower and upper bounds on the two indicators are obtained.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Threshold Multiparty Controlled Teleportation of Arbitrary m-Qubit Quantum information

引用

Communications in Theoretical Physics 2009年第10期52卷 593-596页

作者： YANG Yu-Guang WEN Qiao-Yan College of Computer Science and Technology Beijing University of Technology Beijing 100124 China State Key Laboratory of Integrated Services Network Xidian University Xi＇an 710071 China State Key Laboratory of Information Security （Graduate University of Chinese Academy of Sciences） Beijing 100049 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

We present a （t, .n） threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubit quantum state between two remote parties. The unknown m-qubit quantum state can be recovered by the receiver under control of a subset of the n controllers if the number of the subset is larger than or equal to a threshold, say, t, but not for any t - 1 or fewer controllers. Our scheme seems to be more practical and more flexible than other existing protocols. The quantum resource required is just m Einstein-Podolsky-Rosen （EPR） pairs plus some single photons. The techniques required are only Bell state measurement, single-qubit unitary operation and yon Neumann measurement. So our scheme is also feasible with present-day technique.

关键词： controlled teleportation threshold controlled teleportation entanglement

来源：评论

学校读者我要写书评

暂无评论

Statistical Analysis of Trust Overlay network

Statistical Analysis of Trust Overlay Network

引用

International Seminar on Future information Technology and Management Engineering, FITME

作者： Zhong Zhu Guoxin Wu Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education South-East University Nanjing China

A TON (trust overlay network) is a virtual network on top of the underlying distributed application network, which is a directed and weighted complex network. A detailed understanding of the structural properties of TON topology will benefit the accurate grasp of the trust formation mechanism and management model and the effect on underlying distributed application network, in order to make better use of trust relationships (also called "soft security") to solve security issues of large-scale distributed application system. Based on P2P service network model with the property of small world, two algorithms for generating TON were proposed, which was implemented on the Repast simulation system. The simulation results and analysis suggest the TON fits power-law distribution ( ¿ ¿ (1,4)) in in-degree, outdegree, global trust value and local trust value, which shows a TON has a scale-free networks characteristics.

关键词： Statistical analysis Peer to peer computing Application software computer network management network topology Power system security Analytical models Distributed computing information technology Conference management

来源：评论

学校读者我要写书评

暂无评论

A SOA Based Framework of Service Ability Description and Selection Methods for Application integration in Manufacturing Domain

A SOA Based Framework of Service Ability Description and Sel...

引用

International Conference on Interoperability for Enterprise Software and Applications China, IESA

作者： Weihua Huang Xiaoping Li School of Computer Science & Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China

In this paper, an SOA based framework for service ability description and selection methods is proposed for the application integration in manufacturing domain. A uniform and standard schema is introduced to accurately describe both user requirements and service abilities. Services are organized and classified by an index tree, by which the service ability matching procedure which is the key of service selection can be simplified. An effective matching algorithm is presented along with the matching degree definition and calculation. The entire framework is implemented.

关键词： Service oriented architecture Application software Pulp manufacturing computer aided manufacturing computer integrated manufacturing Classification tree analysis computer science Laboratories computer networks computer science education

来源：评论

学校读者我要写书评

暂无评论

Reputation Mechanism in Peer-to-Peer network

Reputation Mechanism in Peer-to-Peer Network

引用

International Conference on information Science and Engineering (ICISE)

作者： Peng Wu Guoxin Wu Key Laboratory of Computer Network and Information Integration Ministry of Education School of Computer Science and Engineering South-East University Nanjing China

ISBN: (纸本)9781424449095

Peer-to-Peer (P2P) technology has been widely used in file-sharing, distributed computing, e-market and information management. However, one of the critical challenges for P2P systems is the ability to manage risks involved in interacting and collaborating with prior unknown and potentially malicious peers. Reputation systems can successfully minimize the potential damages to the P2P systems by computing the trustworthiness of a certain peer from that peer's behavior history. In this paper, we give a brief survey of researches on reputation mechanism in P2P network. Firstly the fundamentals of reputation mechanism are introduced. By investigating the reputation systems in P2P network, we outline several key technologies of reputation mechanism. Finally we put forward the essential design principles of the ideal reputation mechanism.

关键词： Peer to peer computing Collaboration information management Risk management information science Laboratories computer network management computer science education computer science Educational technology

来源：评论

学校读者我要写书评

暂无评论

A Novel Clustering Algorithm in Wireless Sensor networks

A Novel Clustering Algorithm in Wireless Sensor Networks

引用

International Conference on Industrial and information Systems, IIS

作者： Jiangpeng Dai Shu Liu Key Laboratory of Computer Network and Information Integration Ministry of Education School of Computer Science & Engineering South-East University Nanjing China

ISBN: (纸本)9781424439362

The demands of energy-efficient, distributed and scalable features are critical factors for designing topology control and routing management scheme in wireless sensor networks. To meet these demands, clustering is a good method in sensor networks topology control and routing. But by analyzing former clustering algorithms, it is found that there are deficiencies and limitations because of the usage of random method in cluster head election. In this paper, clustering mechanism is modeled and analyzed theoretically, and then turned to approximate optimization problem. A novel heuristic information based clustering algorithm is proposed to solve the above problem. The performance of this novel algorithm is analyzed and validated by simulation experiments. The results of experiments indicate that the algorithm can conduct clustering in network well and obtain excellent network performance, such as improved robustness, lower global energy cost and longer network lifetime. In particular, the performance is still stable while increasing the nodes scale.

关键词： Clustering algorithms Wireless sensor networks network topology Routing Algorithm design and analysis Energy efficiency Energy management Nominations and elections Performance analysis Analytical models

来源：评论

学校读者我要写书评

暂无评论

A Reputation-Based Trust Model for P2P Systems

A Reputation-Based Trust Model for P2P Systems

引用

International Conference on Computational Intelligence and Security

作者： Peng Wu Guoxin Wu Key Laboratory of Computer Network and Information Integration Ministry of Education School of Computer Science and Engineering South-East University Nanjing China

ISBN: (纸本)9781424454112

One of the fundamental challenges for Peer to Peer (P2P) systems is the ability to manage risks involved in interacting and collaborating with prior unknown and potentially malicious parties. Reputation-based trust management systems have proven to be essential to enforcing cooperative behavior in P2P networks. However, in many existing reputation-based trust models, the validity of peers' trust valuation is seriously affected by peers' malicious behaviors, such as strategic cheating, dishonest recommending and collusion. In this paper, we propose a novel reputation-based trust model for P2P systems. In our approach, the trustworthiness of peers consists of the experience-based and recommendation-based trust. To provide adequate reaction to peers' malicious behaviors, some factors are introduced to distinguish these experiences about peers' behaviors. Simulation shows that the proposed model has advantages in countering peers' malicious behaviors over the existing trust models.

关键词： Peer to peer computing computer network management Feedback Predictive models Computational intelligence computer security information security Laboratories computer science education Systems engineering education

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：