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

Parametric search: three new applications

中国高等学校学术文摘·数学 2010年第1期5卷 65-73页

作者： Naoki KATOH Wencheng WANG Yinfeng XU Binhai ZHU Department of Architecture and Architectural Engineering Kyoto University Nishikyo Kyoto 615-8540 Japan Institute of Software Chinese Academy of Sciences Beijing 100080 China School of Management Xi'an Jiaotong University State Key Lab for Manufacturing Systems Engineering Xi'an 710049 China Department of Computer Science Montana State University Bozeman MT 59717-3880 USA

Parametric search is a useful tool in geometric optimization. Invented by Nimrod Megiddo in 1983, it has been widely used in computational geometry. Unfortunately, this technique has rarely been used in the combinatorial optimization community in China. In this paper, we introduce parametric search via three new geometric optimization applications. keywords Parametric search - geometric optimization - facility location

关键词： Parametric search geometric optimization facility location MSC

来源：评论

学校读者我要写书评

暂无评论

C¹ modeling with hybrid multiple-sided a-patches

引用

International Journal of Foundations of computer Science 2002年第2期13卷 261-284页

作者： Xu, Guoliang Bajaj, Chandrajit L. Evans, Susan State Key Lab. of Scientific and Engineering Computing ICMSEC Chinese Academy of Sciences Beijing China Department of Computer Science University of Texas Austin TX 78712 United States Department of Computer Science University of Purdue West Lafayette IN United States

We propose a new scheme for modeling a smooth interpolatory surface, from a surface discretization consisting of triangles, quadrilaterals and pentagons, by algebraic surface patches which are subsets of real zero contours of trivariate rational functions defined on a collection of tetrahedra and pyramids. The rational form of the modeling function provides enough degrees of freedom so that the number of the surface patches is significantly reduced, and the surface has quadratic recover property. © 2002 World Scientific Publishing Company.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling the locality in graph traversals

Modeling the locality in graph traversals

引用

41st International Conference on Parallel Processing, ICPP 2012

作者： Yuan, Liang Ding, Chen Štefankovič, Daniel Zhang, Yunquan Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China Computer Science Department University of Rochester United States

ISBN: (纸本)9780769547961

An increasing number of applications in physical and social sciences require the analysis of large graphs. The efficiency of these programs strongly depends on their memory usage especially the locality of graph data access. Intuitively, the locality in computation should reflect the locality in graph topology. Existing locality models, however, operate either at program level for regular loops and arrays or at trace level for arbitrary access streams. They are not sufficient to characterize the relation between locality and connectivity. This paper presents a new metrics called the vertex distance and uses it to model the locality in breadth-first graph traversal (BFS). It shows three models that use the average node degree and the edge distribution to predict the number of BFS levels and the reuse distance distribution of BFS. Finally, it evaluates the new models using random and non-random graphs. © 2012 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A New Method for Meet-in-the-Middle Attacks on Reduced AES

引用

China Communications 2011年第2期8卷 21-25页

作者：董晓丽胡予濮韦永壮陈杰 Key Lab. of Computer Networks & Information Security Ministry of EducationXidian University School of Information and Communication Guilin University of Electronic Technology State Key Lab. of Information Security Institute of SoftwareChinese Academy of Sciences

A new 5-round distinguisher of AES with key whitening is presented by using the properties of its round transformation. Based on this distinguisher,we present new meet-in-the-middle attacks on reduced AES considering the key schedule and the time-memory tradeoff approach. New attacks improve the best known meet-in-the-middle attacks on reduced AES presented at *** reduce the time complexity of attacks on 7-round AES-192 and 8-round AES-256 by a factor of at least 28. Moreover,the distinguisher can be exploited to develop the attack on 8-round AES-192.

关键词： AES Rijndael cryptanalysis meet-in-the-middle attack

来源：评论

学校读者我要写书评

暂无评论

Generating different realistic humanoid motion

引用

16th International Conference on Artificial Reality and Telexistence, ICAT 2006

作者： Li, Zhenbo Deng, Yu Li, Hua Key Lab. of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Graduate University of Chinese Academy of Sciences Beijing 100039 China

ISBN: (纸本)3540497765

Different realistic humanoid motion can be used in vary situations in animation. It also plays an important role in virtual reality. In this paper, we propose a novel method to generate different realistic humanoid motion automatically. Firstly, eigenvectors of a motion sequence is computed using principle component analysis. The principle components are served as "virtual joints" in our system. The number of "virtual joints" can be used to control the realistic level of motions. After given the "virtual joints" number, the actual joints' parameters of new motion are computed using the selected "virtual joints". The experiments illuminate that this method has good ability to generate different realistic level motions. © 2006 Springer-Verlag Berlin/Heidelberg.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

CLSIFT: An optimization study of the scale invariance feature transform on GPUs

CLSIFT: An optimization study of the scale invariance featur...

引用

15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013

作者： Wang, Weiyan Zhang, Yunquan Guoping, Long Yan, Shengen Jia, Haipeng Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China State Key Laboratory of Computing Science Institute of Software Chinese Academy of Sciences China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769550886

Scale Invariance Feature Transform (SIFT) is quite suitable for image matching because of its invariance to image scaling, rotation and slight changes in illumination or viewpoint. However, due to high computation complexity it's technically challenging to deploy SIFT in real time application situations. To address this problem, we propose CLSIFT, an OpenCL based highly speeded up and performance portable SIFT solution. Important optimization techniques employed in CLSIFT such as: (1) For less global memory traffic, independent logical functions are merged into the same kernel to reuse data.(2) loop buffers are introduced in for data and intermediate results reusing.(3)Task queue used to schedule threads in the same branch to remove branch divergences. (4) Data partition is based on the statics patterns for workload balance among workgroups. (5) Overlap of CPU time and better parallel strategies are used too. With all mentioned efforts, CLSIFT processes lena. jpg at 74.2 FPS and 43.4FPS respectively on NVidia and AMD GPUS, much higher than CPU's nearly 10 FPS and the known fastest SIFTGPU's 39.8 FPS and 13FPS. Moreover in a quantitative comparison approach we analyze those successful strategies beating SIFTGPU, a famous existing GPU implementation. Additionally, we observe and conclude that NVidia GPU achieves better occupancy and performance due to some factors. Finally, we summarize some techniques and empirical guiding principles that may be shared by other applications on GPU. © 2013 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Theory and Applications of Models of Computation 1

引用

丛书名： Lecture Notes in computer Science

1000年

作者： Jan Kratochvíl Jiří Fiala Petr Kolman Angsheng Li

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Theory and Applications of Models of Computation 1

引用

丛书名： Lecture Notes in computer Science

1000年

作者： Jin-Yi Cai S. Barry Cooper Angsheng Li

来源：评论

学校读者我要写书评

暂无评论

yaSpMV: Yet Another SpMV Framework on GPUs

yaSpMV: Yet Another SpMV Framework on GPUs

引用

作者： Yan, Shengen Li, Chao Zhang, Yunquan Zhou, Huiyang Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China North Carolina State University RaleighNC United States North Carolina State University RaleighNC United States State Key Lab of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Institute of Software Chinese Academy of Sciences Beijing China

SpMV is a key linear algebra algorithm and has been widely used in many important application domains. As a result, numerous attempts have been made to optimize SpMV on GPUs to leverage their massive computational throughput. Although the previous work has shown impressive progress, load imbalance and high memory bandwidth remain the critical performance bottlenecks for SpMV. In this paper, we present our novel solutions to these problems. First, we devise a new SpMV format, called blocked compressed common coordinate (BCCOO), which uses bit flags to store the row indices in a blocked common coordinate (COO) format so as to alleviate the bandwidth problem. We further improve this format by partitioning the matrix into vertical slices to enhance the cache hit rates when accessing the vector to be multiplied. Second, we revisit the segmented scan approach for SpMV to address the load imbalance problem. We propose a highly efficient matrix-based segmented sum/scan for SpMV and further improve it by eliminating global synchronization. Then, we introduce an auto-tuning framework to choose optimization parameters based on the characteristics of input sparse matrices and target hardware platforms. Our experimental results on GTX680 GPUs and GTX480 GPUs show that our proposed framework achieves significant performance improvement over the vendor tuned CUSPARSE V5.0 (up to 229% and 65% on average on GTX680 GPUs, up to 150% and 42% on average on GTX480 GPUs) and some most recently proposed schemes (e.g., up to 195% and 70% on average over clSpMV on GTX680 GPUs, up to 162% and 40% on average over clSpMV on GTX480 GPUs). © 2014 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：