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

13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

作者： Xu, Lei Xu, Baowen Chen, Lianjie Yang, Hongji Department of Computer Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Nanjing China NARI Technology Development Co. Ltd. Nanjing China School of Computer Science and Engineering Southeast University Nanjing China School of Computing De Montfort University Leicester LE1 9BH United Kingdom

ISBN: (纸本)9780769545387

With the rapid development of Web services, Web service discovery becomes a significant challenge in the matching precision and efficiency. In this paper, we present a novel method in the view of users' requirements for Web Service discovery. We set up the requirement model firstly, so as to present users' requirements in details, then cluster the Web services due to users' common requirements, and obtain corresponding Web services' QoS values. Thus, users can find their really needed Web services in an ordered list. The case study indicates the effect of our method, namely, in the view of users' requirements, we sort the candidate services due to their functions and their QoS attributes in descending order. © 2011 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Implicit surface reconstruction based on adaptive clustering

Implicit surface reconstruction based on adaptive clustering

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Zheng, Chao Zhang, Hui School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769544977

This paper presents an efficient method to reconstruct an implicit surface from a point cloud based on adaptive clustering. First, a novel approach, based on a hierarchical clustering tree with variation and normal constraints, is proposed for normal estimation of the point cloud. It simplifies the point cloud and reduces the amount of direction propagation paths in normal orientation. Second, an implicit surface is computed from the clustering tree by a feature preserving method, using adaptive plane fitting that considers the local feature and sharp areas of the point cloud. Finally, the results demonstrate the efficiency of our method for open, closed and unorganized models, and show that the resulting surfaces preserve the sharp features. © 2011 IEEE.

关键词： Surface reconstruction

来源：评论

学校读者我要写书评

暂无评论

An optimal color mapping strategy based on energy minimization for time-varying data

An optimal color mapping strategy based on energy minimizati...

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Peng, Yi Dong, Jie Chen, Li Chu, Haiyang Yong, Junhai School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769544977

Color mapping plays a critical role in visualization of time-varying data and also sets a challenge for researchers due to the consistency of mapping and great changes in time-varying data. In order to solve this problem and generate feature-prominent animation, we present a two phase optimization technique using bilateral filtering and global energy functions. In the first phase, for each time step, we use a weighted mapping function which combines linear mapping and feature histogram. In the second phase, an optimization function taking global color mapping and minimum color difference into consideration is designed. So users can clearly distinguish between data in variable time steps and easily understand the corresponding relationships between different structures. The experiments' results show that our method can achieve high quality visualization for both static and time-varying data. © 2011 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Multi-resolution mesh fitting by B-spline surfaces for reverse engineering

Multi-resolution mesh fitting by B-spline surfaces for rever...

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Zhang, Sen Li, Zhigang Zhang, Hui Yong, Junhai School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769544977

This paper presents a new multi-resolution mesh fitting algorithm, extending the adaptive patch-based fitting scheme where each underlying quadrilateral is recursively subdivided into four sub-patches. In this paper, the G1 continuity constraints, which mainly consist of perpendicular constraints and twist compatibility constraints, are deduced for B-spline patches. In order to construct a unique B-spline patch for each quadrilateral, the mesh vertices are applied in a least-square approximation, and the energy functions associated with a patch are minimized. In contrast to the original algorithm, this paper fits the mesh into B-spline patches instead of Bézier patches with G1 continuity. The B-spline patches make the algorithm have more free control points to be used for optimizing the shape of the quadrilateral patches to achieve higher flexible patch control and less recursive times. © 2011 IEEE.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of canonical views for CAD models

Automatic generation of canonical views for CAD models

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Hu, Kai-Mo Wang, Bin Yuan, Bin Yong, Jun-Hai School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769544977

Selecting the best views for 3D objects is useful for many applications. However, with the existing methods applied in CAD models, the results neither exhibit the 3D structures of the models fairly nor conform to human's browsing habits. In this paper, we present a robust method to generate the canonical views of CAD models, and the above problem is solved by considering the geometry and visual salient features simultaneously. We first demonstrate that for a CAD model, the three coordinate axes can be approximately determined by the scaled normals of its faces, such that the pose can be robustly normalized. A graph-based algorithm is also designed to accelerate the searching process. Then, a convex hull based method is applied to infer the upright orientation. Finally, four isometric views are selected as candidates, and the one whose depth image owns the most visual features is selected. Experiments on the Engineering Shape Benchmark (ESB) show that the views generated by our method are pleasant, informative and representative. We also apply our method in the calculation of model rectilinearity, and the results demonstrate its high performance. © 2011 IEEE.

关键词： computer aided design

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient scheduling algorithm for sporadic real-time tasks in multiprocessor systems

An energy-efficient scheduling algorithm for sporadic real-t...

引用

13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

作者： Zhang, Dong-Song Chen, Fang-Yuan Li, Hong-Hua Jin, Shi-Yao Guo, De-Ke National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China School of Computing Science Simon Fraser University 8888 University Drive Burnaby BC V5A 1S6 Canada National Laboratory for Information System Engineering School of Information Systems and Management National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769545387

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, the real-time energy-efficient scheduling in multiprocessor systems becomes an urgent problem to reduce the system energy consumption while meeting real-time constraints. For a multiprocessor with independent DVFS and DPM at each processor, this paper proposes an energy-efficient real-time scheduling algorithm named LRE-DVFS-EACH, based on LRE-TL which is an optimal real-time scheduling algorithm for sporadic tasks. LRE-DVFS-EACH utilizes the concept of TL plane and the idea of fluid scheduling to dynamically scale the voltage and frequency of processors at the initial time of each TL plane as well as the release time of a sporadic task in each TL plane. Consequently, LRE-DVFS-EACH can obtain a reasonable tradeoff between the real-time constraints and the energy saving. LRE-DVFS-EACH is also adaptive to the change of workload caused by the dynamic release of sporadic tasks, which can obtain more energy savings. The experimental results show that compared with existing algorithms, LRE-DVFS-EACH can not only guarantee the optimal feasibility of sporadic tasks, but also achieve more energy savings in all cases, especially in the case of high workloads. © 2011 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

A domain partition model approach to the online fault recovery of FPGA-based reconfigurable systems

A domain partition model approach to the online fault recove...

引用

作者： Shang, Lihong Zhou, Mi Hu, Yu Yang, Erfu School of Computer Science and Engineering Beihang University Beijing 100191 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Electronic and Electrical Engineering University of Strathclyde Glasgow Gl 1XW United Kingdom

Field programmable gate arrays (FPGAs) are widely used in reliability-critical systems due to their reconfiguration ability. However, with the shrinking device feature size and increasing die area, nowadays FPGAs can be deeply affected by the errors induced by electromigration and radiation. To improve the reliability of FPGA-based reconfigurable systems, a permanent fault recovery approach using a domain partition model is proposed in this paper. In the proposed approach, the fault-tolerant FPGA recovery from faults is realized by reloading a proper configuration from a pool of multiple alternative configurations with overlaps. The overlaps are presented as a set of vectors in the domain partition model. To enhance the reliability, a technical procedure is also presented in which the set of vectors are heuristically filtered so that the corresponding small overlaps can be merged into big ones. Experimental results are provided to demonstrate the effectiveness of the proposed approach through applying it to several benchmark circuits. Compared with previous approaches, the proposed approach increased MTTF by up to 18.87%. Copyright © 2011 The Institute of Electronics, Information and Communication Engineers.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for private clouds

引用

Journal of Convergence Information technology 2011年第7期6卷 1-9页

作者： Li, Jiandun Peng, Junjie Zhang, Wu School of Computer Engineering and Science Shanghai University Shanghai 200072 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Beijing 100190 China

In contrast with public clouds, private clouds have some unique features, especially when related to workflow scheduling. Of course, the tradeoff problem between power and performance remains to be one of the key concerns. Based on our previous research, in this paper, we propose a hybrid energy-efficient scheduling algorithm using dynamic migration. The experiments show that it can not only reduce the response time, conserve more energy, but also achieve higher level of load balancing.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Toward a common framework for analysis of high performance controls of PMS motor drives

Toward a common framework for analysis of high performance c...

引用

Power Electronic and Drive systems and Technologies Conference

作者： Shafaie, Rohollah Vaez-Zadeh, Sadegh Dept. of Electrical Engineering Iran University of Science and Technology Tehran Iran Advanced Motion System Research Laboratory School of Electrical and Computer Engineering University of Tehran Tehran Iran

ISBN: (纸本)9781612844213

An analysis of permanent magnet synchronous (PMS) motors is carried out to establish a basis for high performance control of the motors. It is then used to formulate vector control and direct torque control of the machines. This provides an insight into the advanced AC motor control methods in general and into vector control and direct torque control in particular, providing new opportunities for proposing novel AC motor control methods. © 2011 IEEE.

关键词： Permanent magnets

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient scheduling approach based on private clouds

引用

Journal of Information and Computational science 2011年第4期8卷 716-724页

作者： Li, Jiandun Peng, Junjie Lei, Zhou Zhang, Wu School of Computer Engineering and Science Shanghai University Shanghai 200072 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Beijing 100190 China

With further development and wide acceptance of cloud computing, lots of companies and colleges decide to take advantage of it in their own data centers, which is known as private clouds. Since private clouds have some unique characteristics and special requirements, it is still a challenging problem to effectively schedule virtual machine requests onto compute nodes, especially with multiple objectives to meet. In this paper, we explore couples of characteristics related to workflow scheduling in the scenario of private clouds and propose a hybrid energy-efficient scheduling approach. The experiments show that it can save more time for users, conserve more energy and achieve higher level of load balancing. Copyright © 2011 Binary Information Press.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：