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

IADIS International Conference WWW/Internet 2010

作者： Feng, Wangsen Zhang, Bei Xia, Yunni Li, Jiajing Meng, Tao Key Laboratory of Network and Software Security Assurance of Ministry of Education Computing Center Peking University Beijing 100871 China College of Computer Science Chongqing University Chongqing 400044 China School of Mechanical Electronic and Information Engineering China University of Mining and Technology Beijing 100083 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9789728939250

Today, almost all the C2C e-commerce community member reputation evaluating algorithms are time sensitive. The reputation of a community member is accumulated after transactions and the increment of reputation after a successful transaction is computed based on the score given by his or her transaction partner. Since people always tend to do business with those with high reputation value, the reputation of members joined in C2C community at different time will vary greatly although they may provide the same commodity quality and service. It is unfair to new comers. In this paper, we propose a novel algorithm to overcome the shortcoming. Based on the transaction social network, our algorithm employs the random walk strategy to compute member reputation and enhance system fairness. © 2010 IADIS.

关键词： Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

Threshold Signature Scheme Based on Non-internative Diffie-Hellman Signature

Threshold Signature Scheme Based on Non-internative Diffie-H...

引用

International Conference on networking and Distributed computing (ICNDC)

作者： Xiuqun Wang Lican Huang Key Laboratory of Information System Security Ministry of Education Tsinghua University Beijing China Institute of Network and Distributed Computing Zhejiang Science and Technology University Hangzhou China

We present a threshold signature based on non-internative Diffie-Hellman signature. It works in asynchronous communication system and can tolerate Byzantine faults with optimal resilience n ≥ = 3t + 1, where n is the number of the participants and t is the number of the fault participants. The security of this scheme bases on discrete logarithm intractability assumption. We give the security analysis of our proposed threshold signature scheme.

关键词： Polynomials Protocols Public key Interpolation Robustness

来源：评论

学校读者我要写书评

暂无评论

A collaborative framework for privacy protection in online social networks

A collaborative framework for privacy protection in online s...

引用

International Conference on Collaborative computing: networking, Applications and Worksharing (CollaborateCom)

作者： Yan Zhu Zexing Hu Huaixi Wang Hongxin Hu Gail-Joon Ahn Key Laboratory of Network and Software Security Assurance Ministry of Education Peking University China Institute of Computer Science and Technology Peking University Beijing China School of Mathematical Sciences Peking University Beijing China Laboratory of Security Engineering for Future Computing (SEFCOM) Arizona State University Tempe AZ USA

With the wide use of online social networks (OSNs), the problem of data privacy has attracted much attention. Several approaches have been proposed to address this issue. One of privacy management approaches for OSN leverages a key management technique to enable a user to simply post encrypted contents so that only users who can satisfy the associate security policy can derive the key to access the data. However, the key management policies of existing schemes may grant access to unauthorized users and cannot efficiently determine authorized users. In this paper, we propose a collaborative framework which enforces access control for OSN through an innovative key management focused on communities. This framework introduces a community key management based on a new group-oriented convergence cryptosystem, as well as provides an efficient privacy preservation needed in a private OSN. To prove the feasibility of our approach, we also discuss a proof-of-concept implementation of our framework. Experimental results show that our construction can achieve the identified design goals for OSNs with the acceptable performance.

关键词： Cryptography Servers Kernel Data privacy Social network services Communities Collaboration

来源：评论

学校读者我要写书评

暂无评论

Analysis and computing of Association Degree of SMS Feature Words

Analysis and Computing of Association Degree of SMS Feature ...

引用

International Conference on networking and Services (ICNS)

作者： Qindong Sun Hongli Qiao Nan Wang Network Computing and Security Key Laboratory of Shaanxi Xi''an University of Technology Xi'an China MOE Key Laboratory of Intelligent and Network Security Xi''an Jiaotong University Xi'an China

How to judge the relationship between mobile short messages is the key technology of mobile short message topic detection. The characteristics of the mobile SMS text are discussed in this paper, and the association of different SMS topic feature words is analyzed. Then a computing method of the association degree between different SMS feature words is proposed, which is based on leverage formula. The experimental results show that this method can effectively calculate the association degrees between SMS feature words, which could help to extract hot topics in corpus of a mess of short messages.

关键词： Computer networks Data mining Internet Mobile computing Clustering algorithms Information services Web sites Detection algorithms Independent component analysis IP networks

来源：评论

学校读者我要写书评

暂无评论

SkyF2F: Censorship Resistant via Skype Overlay network

SkyF2F: Censorship Resistant via Skype Overlay Network

引用

WASE International Conference on Information Engineering, ICIE

作者： Shoufeng Cao Longtao He Zhongxian Li Yixian Yang Information Security Center State Key Laboratory of Networking and Switching Technology Key Laboratory of network and information attack & defence technology of MOE Beijing University of Posts and Telecommunications China Research Center of Information Security Institute of Computing Technology Chinese Academy and Sciences Beijing China

Internet censorship is on the rise as an increasing number of countries and companies block or monitor access to parts of the Internet. Many censorship resistant systems have been proposed, which rely on deploying many access points to the censored domain. Therefore they face the problem of discovering available nodes and deploying a large number of nodes. Opposite to many access point approach, we present a system building on existing overlay network, a low-cost solution for circumventing Internet, called SkyF2F. SkyF2F is a plug-in for Skype client that allows users to establish a covert communication tunnel across Skype overlay network. We describe the design, a prototype implementation and security analysis of SkyF2F. Our security analysis shows that SkyF2F can successfully circumvent several sophisticated censoring techniques.

关键词： Information security Internet Computer security National security Laboratories Cryptography Buildings Prototypes Monitoring IP networks

来源：评论

学校读者我要写书评

暂无评论

Quick Finding of network Video Stream

Quick Finding of Network Video Stream

引用

International Conference on Computer Science and Information technology (CSIT)

作者： Qindong Sun Shengli Li Xiaojun Guo Network Computing and Security Key Laboratory of Shaanxi Xi'an University of Technology Xi'an China School of Electronics and Information Engineering Xi'an Jiaotong University Xi'an China Department of Research and Development Xi'an Anzhi Science and Technology Corporation Xi'an China

network video technology develops quickly in recent years and the applications of network video are various. The effectively managing of the application based on network video is necessary for network flow management, network security, etc. and finding video stream from the network flow is the precondition and foundation. This paper analyzes the characteristics of the video stream packets, and draws a conclusion that each network video stream type can be labeled uniquely by one characteristic string, based on which, we can find video streams in network flow easily. The experiment results show that the method is able to find network video streams accurately.

关键词： Streaming media Protocols Decision support systems Payloads Servers IP networks Internet

来源：评论

学校读者我要写书评

暂无评论

A real-time adaptive control of autonomic computing environments 07

A real-time adaptive control of autonomic computing environm...

引用

2007 Conference of the Center for Advanced Studies on Collaborative Research, CASCON '07

作者： Solomon, Bogdan Ionescu, Dan Litoiu, Marin Mihaescu, Mircea Network Computing and Control Technologies Research Laboratory School of Information Technology and Engineering University of Ottawa Canada IBM Centre for Advanced Studies Toronto Canada Centre for Advanced Studies IBM Toronto Laboratory Canada IBM WebAhead Development and Security Innovations United States

Autonomic computing has received a great deal of attention from the research community in recent years. Many techniques have been proposed to monitor, analyze, and change the system under observation, but less attention has been paid to adapting the autonomic computing loop itself. Based on previous results on the design and implementation of a reference real-time architecture for autonomic computing, a self-adapting loop based on system-specific adaptation knowledge, which includes the types and properties of autonomic computing components, behavioural constraints, and strategies for adaptation is proposed in this paper. The proposed system is an integral part of the real-time system that controls the behaviour of the computing environment, evaluating its global behaviour using criteria that take into account the mathematical description of the time variation of the number of users in the system. Based on this evaluation, the adaptive system changes the control structure of the autonomic computing environment by replacing its controller with one matching the user time variation law. Elements of the self-adapting loop and the tradeoff of introducing additional overhead to the autonomic computing processes are discussed. A case study illustrates the self-adapting technique proposed. © Copyright 2007 NCCT, and IBM Canada Ltd.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Model for Trust Evaluation

引用

Railway Engineering Science 2006年第1期000卷 23-28页

作者： Zhang Shibin He Dake Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu 610031 China Department of Network Engineering Chengdu University of Information Technology Chengdu 610225 China Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu 610031 China

Based on fuzzy set theory, a fuzzy trust model is established by using membership function to describe the fuzziness of trust. The trust vectors of subjective trust are obtained based on a mathematical model of fuzzy synthetic evaluation. Considering the complicated and changeable relationships between various subjects, the multi-level mathematical model of fuzzy synthetic evaluation is introduced. An example of a two-level fuzzy synthetic evaluation model confirms the feasibility of the multi-level fuzzy synthesis evaluation model. The proposed fuzzy model for trust evaluation may provide a promising method for research of trust model in open networks.

关键词： Trust model Trust vector Trust class Synthetic evaluation Fuzzy set theory

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Model for Trust Evaluation

引用

Journal of Southwest Jiaotong University(English Edition) 2006年第1期14卷 23-28页

作者：张仕斌何大可 Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu 610031 ChinaDepartment of Network Engineering Chengdu University of Information Technology Chengdu 610225 China Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu 610031 China

关键词： Trust model Trust vector Trust class Synthetic evaluation Fuzzy set theory

来源：评论

学校读者我要写书评

暂无评论

Dynamic right-sizing in FTP (drsFTP): Enhancing Grid performance in user-space

Dynamic right-sizing in FTP (drsFTP): Enhancing Grid perform...

引用

International Symposium on High Performance Distributed computing

作者： M.K. Gardner Wu-chun Feng M. Fisk Research & Development in Advanced Network Technology (RADIANT) Computer & Computational Sciences Division Los Alamos National Laboratory Los Alamos NM USA Network Security Team Network Engineering Group Computing Communications & Networking Division Los Alamos National Laboratory Los Alamos NM USA

With the advent of computational grids, networking performance over the wide-area network (WAN) has become a critical component in the grid infrastructure. Unfortunately, many high-performance grid applications only use a small fraction of the available bandwidth because operating systems and their associated protocol stacks are still tuned for yesterdays WAN speeds. As a result, network gurus undertake the tedious process of manually, tuning system buffers to allow TCP flow control to scale to today's WAN grid environments. Although recent research has shown how to set the size of these system buffers automatically at connection set-up, the buffer sizes are only appropriate at the beginning of the connection's lifetime. To address these problems, we describe an automated and scalable technique called dynamic right-sizing. We implement this technique in user space (in particular for bulk-data transfer) so that end users do not have to modify the kernel to achieve a significant increase in throughput.

关键词： Wide area networks Computer networks Grid computing Bandwidth Operating systems Protocols Automatic control Control systems Kernel Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：