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

7th International Conference on Computational science, ICCS 2007

作者： Ying, Weiqin Li, Yuanxiang Peng, Shujuan Wang, Weiwu State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China School of Computer Science Wuhan University Wuhan 430079 China

ISBN: (纸本)9783540725893

The genetic algorithm (GA) often suffers from the premature convergence because of the loss of population diversity at an early stage of searching. This paper proposes a steep thermodynamical evolutionary algorithm (STEA), which utilizes a steep thermodynamical selection (STS) rule. STEA simulates the competitive mechanism between energy and entropy in annealing to systematically resolve the conflicts between selective pressure and population diversity in GA. This paper also proves that the rule STS has the approximate steepest descent ability of the free energy. Experimental results show that STEA is both far more efficient and much stabler than the thermodynamical genetic algorithm (TDGA). © Springer-Verlag Berlin Heidelberg 2007.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Pseudo trust: Zero-knowledge based authentication in anonymous peer-to-peer protocols

Pseudo trust: Zero-knowledge based authentication in anonymo...

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Lu, Li Han, Jinsong Hu, Lei Huai, Jinpeng Liu, Yunhao Ni, Lionel M. State Key Lab. of Information Security Graduate School Chinese Academy of Sciences Beijing China Dept. of Computer Science and Engineering Hong Kong University of Science and Technology Kowloon Hong Kong School of Computer Science Beihang University Beijing China State Key Lab. of Software Developing Environment Beihang University Beijing China

ISBN: (纸本)1424409101

Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence, there exists an inherent tradeoff between trust and anonymity. To the best of our knowledge, there is currently no P2P protocol that provides complete mutual anonymity as well as authentication and trust management. We propose a zero-knowledge authentication scheme called Pseudo Trust (PT), where each peer, inst.ad of using its real identity, generates an unforgeable and verifiable pseudonym using a one-way hash function. A novel authentication scheme based on Zero-Knowledge Proof is designed so peers can be authenticated without leaking any sensitive information. With the help of PT, most existing identity-based trust management schemes become applicable in mutual anonymous P2P systems. We analyze the levels of security and anonymity in PT, and evaluate its performance using trace-driven simulations and a prototype implementation. The strengths of Pseudo Trust include the lack of need for a centralized trusted party or CA, high scalab.lity and security, low traffic and cryptography processing overheads, and man-in-middle attack resistance. We aim for the Pseudo Trust design to be included in the P2P trust and anonymity context. © 2007 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Mesh deformation under skeleton-based detail-preservation

Mesh deformation under skeleton-based detail-preservation

引用

2007 10th IEEE International Conference on computer Aided Design and computer Graphics, CAD/Graphics 2007

作者： Wu, Jinzhong Liu, Xuehui Wu, Enhua State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Department of Computer and Information Science University of Macau Macao China Graduate University Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424415793

With in skeleton based deformation, two issues are waiting for investigation, large angle rotation and artifacts near joint regions. In this paper we propose rotation angle decomposition and detail preserving method to conquer them. A skeleton with multiple connected bones is prior computed for a triangle mesh. While deforming, large angle rotation is simulated by several progressive small angle rotations. We also introduce a distortion metric function E to quantify the difference between mesh edge vectors before and after deformation, preserving the detail of mesh surfaces. Nearby vertex position blending is enforced. We use sparse conjugate gradient method for the minimization of metric function E. Results show our method is suitable for 3D modeling and character animation applications, making the deformation near joint regions more natural. © 2007 IEEE.

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

Approximation to the minimum rooted star cover problem

Approximation to the minimum rooted star cover problem

引用

4th International Conference on Theory and Applications of Models of Computation, TAMC 2007

作者： Wenbo, Zhao Peng, Zhang State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences P.O.Box 8718 Beijing 100080 China Graduate University Chinese Academy of Sciences Beijing China

ISBN: (纸本)3540725032

In this paper, we study the following minimum rooted star cover problem: given a complete graph G = (V, E) with a length function l : E &rarr + that satisfies the triangle inequality, a designated root vertex r ∈ V, and a length bound D, the objective is to find a minimum cardinality set of rooted stars, that covers all vertices in V such that the length of each rooted star is at most D, where a rooted star is a subset of E having a common center s S V and containing the edge (r, s). This problem is NP-complete and we present a constant ratio approximation algorithm for this problem. Springer-Verlag Berlin Heidelberg 2007.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

An access control model in lager-scale P2P file sharing systems

An access control model in lager-scale P2P file sharing syst...

引用

7th International Conference on Computational science (ICCS 2007)

作者： Yue Guang-xue Yu Fei Chen Li-ping Chen Yi-jun College of Information Engineering Jiaxing University 314000 China Department of Computer Science and Technology Huaihua University 418000 China State Key Lab. for Novel Software Technology Nanjing University 210093 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University 2150063 China

ISBN: (纸本)9783540725893

In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult. In this paper, we identify access control requirements and propose a trust based access control framework for P2P file-sharing systems. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

The tilt cursor: Enhancing stimulus-response compatibility by providing 3D orientation cue of pen

Conference on Human Factors in Computing Systems - Proceedin...

引用

Conference on Human Factors in Computing Systems - Proceedings 2007年 303-306页

作者： Tian, Feng Ao, Xiang Wang, Hongan Setlur, Vidya Dai, Guozhong Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences P.O.Box 8718 Beijing China State Key Lab. of Computer Science P.O.Box 8718 Beijing China Nokia Research Palo Alto 975 Page Mill Road Palo Alto CA United States

ISBN: (纸本)1595935932;9781595935939

In order to improve stimulus-response compatibility of touchpad in pen-based user interface, we present the tilt cursor, i.e. a cursor dynamically reshapes itself to providing the 3D orientation cue of pen. We also present two experiments that evaluate the tilt cursor?s performance in circular menu selection and specific marking menu selection tasks. Results show that in a specific marking menu selection task, the tilt cursor significantly outperforms the shape-fixed arrow cursor and the live cursor [4]. In addition, results show that by using the tilt cursor, the response latencies for adjusting drawing directions are smaller than that by using the other two kinds of cursors. © Copyright 2007 ACM.

关键词： Human computer interaction Sensory perception Three dimensional computer graphics Ubiquitous computing Menu selection task Stimulus response compatibility

来源：评论

学校读者我要写书评

暂无评论

An energy-aware protocol for data gathering applications in wireless sensor networks

An energy-aware protocol for data gathering applications in ...

引用

IEEE International Conference on Communications (ICC 2007)

作者： Liu, Ming Zheng, Yuan Cao, Jiannong Chen, Guihai Chen, Lijun Gong, Haigang School of Computer Science and Engineering University of Electronic and Technology of China China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9781424403523

Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requirement of applications/users such as sensing area coverage. In this paper, we propose a novel hierarchical clustering protocol for long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely intra-cluster coverage to cope with the area coverage problem. We evaluate the performance of the proposed protocol using a simple temperature sensing application. Simulation results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Modified quantization index modulation watermarking adaptive to contrast masking thresholds

Modified quantization index modulation watermarking adaptive...

引用

1st International Conference on Communications and Networking in China, ChinaCom '06

作者： Guoxi, Wang Lihong, Ma. Kang, Cai Hanqing, Lu GD Key Lab. of Computer Network Dept.of Electronic Engineering South China Univ. of Tech. Guangzhou 510641 China National Lab. of Pattern Recognition Inst. Automation China Academy of Science Beijing 100080 China Guangdong Telecom.

ISBN: (纸本)1424404630

In this paper, we suggest an adaptive watermarking method to improve both transparence and robustness of quantization index modulation (QIM) scheme. inst.ad of a fixed quantization step size, we apply a step size adapted to image content in each 8×8 block to make a balance of the robustness extraction and the transparence of embedding. The modified steps are determined by the contrast masking thresholds of Watson's perceptual model. From normalized cross correlation between the original watermark and the detected watermark, we observe that it is robust to attacks of additive white Gaussian noise, salt & pepper noise, JPEG compression than the original QIM. © 2006 IEEE.

关键词： Digital watermarking

来源：评论

学校读者我要写书评

暂无评论

A kind of fuzzy constructive neural network and its application

A kind of fuzzy constructive neural network and its applicat...

引用

26th Chinese Control Conference, CCC 2007

作者： Tao, Wu Liwei, Chen Junjun, Mao Ling, Zhang State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210093 China Key Lab. IC and SP Anhui University Hefei 230039 China School of Mathematics and Computational Science Anhui University Hefei 230039 China

ISBN: (纸本)7900719229

Support vector machine (SVM) has been studied and applied extensively for its high accuracy, but it must construct SVM decision tree to classify sample sets with multiclass for it just be applicable for binary classification and solve a quadratic programming problem to gain optimal hyperplane either in sample spaces or in feature spaces;Alternative covering algorithm which designs neutral networks with spherical domains has the advantages of fast performance, some hard solving problems have been solved using this algorithm. In this paper, a new kind of structural learning algorithm which combining covering design algorithm, fuzzy set and SVM is put forward, inst.nces show that this kind of networks has the virtue of both covering design algorithm and SVM.

关键词： Fuzzy neural networks

来源：评论

学校读者我要写书评

暂无评论

Assigning block size based on speculation for parallel downloading

Assigning block size based on speculation for parallel downl...

引用

6th IEEE International Conference on computer and Information Technology, CIT 2006

作者： Fu, Jianming Fan, Hui School of Computer Science Wuhan University 430072 Wuhan China State Key Lab. of Software Engineering Wuhan University 430072 Wuhan China

ISBN: (纸本)076952687X

With the development of mirror sites, parallel downloading, which can decrease download latency, is becoming more and more popular. Dynamic parallel downloading can be adapted according to the fluctuation of network bandwidths, and has a better performance than static parallel downloading. To reduce the number of requesting document blocks, we propose a scheme in which block size is assigned based on speculation. It deals with the unbalance of assignments during downloading and decreases download latency effectively. Further more, we have implemented a parallel downloading prototype, which makes use of this scheme. Through experimental tests, this scheme shows its advantages of both download latency and the number of block assignments. © 2006 IEEE.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：