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

5th Pacific Rim Conference on Multimedia, PCM 2004

作者： Lee, Liang-Teh Li, Kuan-Ching Yang, Chao-Tung Tseng, Chia-Ying Liu, Kang-Yuan Hung, Chih-Hung Dept. of Computer Science and Engineering Tatung University Taipei104 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Taichung433 Taiwan High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung407 Taiwan Networks and Multimedia Institute Institute for Information Industry Taipei106 Taiwan

ISBN: (纸本)9783540239857

In order to obtain a low-cost, low-power consumption and small sized digital home processing center, especially for multimedia applications, we propose a scalable wallet-size cluster computing system in this paper. Such system uses low-cost, low-power consumption and small sized microprocessors as computing nodes to form a cluster system. The main reason why we are interested to investigate and build such system is to increase the computing power and to accelerate the H.264 video processing. We analyzed the H.264 decoder scheme and distributed the most heavy-load computations in the decoder scheme to each computing node (or microprocessor) of the cluster system for the processing of signals, in parallel. To run multimedia applications in this cluster system, an efficient real-time video processing is implemented. © Springer-Verlag Berlin Heidelberg 2004.

关键词： computing power

来源：评论

学校读者我要写书评

暂无评论

Computational challenges in bounded model checking

引用

International Journal on Software Tools for Technology Transfer 2005年第2期7卷 174-183页

作者： Clarke, Edmund Kroening, Daniel Ouaknine, Joël Strichman, Ofer Computer Science Department Carnegie Mellon University Pittsburgh PA United States Department of Computer Science ETH Zudie rich Zürich Switzerland Oxford University Computing Laboratory Oxford United Kingdom Information Systems Engineering Faculty of Industrial Engineering Technion Haifa Israel

We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold (Cτ problem: for every finite model M and an LTL property there exists a number Cτ such that if there is no counterexample to in M of length Cτ or less, then M. Finding this number, if it is sufficiently small, offers a practical method for making bounded model checking complete. We describe how to compute an overapproximation to Cτ for a general LTL property using Büchi automata, following the Vardi-Wolper LTL model checking framework. This computation is based on finding the initialized diameter and initialized recurrence-diameter (the longest loop-free path from an initial state) of the product automaton. We show a method for finding a recurrence diameter with a formula of size O(klogk) (or O(k(logk)²) in practice), where k is the attempted depth, which is an improvement compared to the previously known method that requires a formula of size in O(k²). Based on the value of Cτ, we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard LTL model checking. We discuss ways to bridge this gap. © Springer-Verlag 2005.

关键词： Bonded-Model-checking Completeness-Threshold Complexity

来源：评论

学校读者我要写书评

暂无评论

An enhanced parallel loop self-scheduling scheme for cluster environments

An enhanced parallel loop self-scheduling scheme for cluster...

引用

International Conference on Advanced information Networking and Applications (AINA)

作者： Chao-Tung Yang Kuan-Wei Cheng Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance.

关键词： Processor scheduling Dynamic scheduling Load management Master-slave Concurrent computing Distributed computing Clustering algorithms Runtime computer science Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Decision tree construction for data mining on grid computing environments

Decision tree construction for data mining on grid computing...

引用

International Conference on Advanced information Networking and Applications (AINA)

作者： Chao-Tung Yang Shu-Tzu Tsai Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

In this paper, the authors presented the grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, it is shown that, based on the scope and model of data mining applied in the grid environment as well as user equivalent perspective, grid roles can be categorized into three types. It was aimed, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To fulfill the architecture, an existing parallel decision tree algorithm was first applied (the SPRINT algorithm) to the grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development.

关键词： Decision trees Data mining Grid computing computer architecture Clustering algorithms Concurrent computing Distributed computing computer science Application software Chaos

来源：评论

学校读者我要写书评

暂无评论

The anatomy of a course in cluster and grid computing

The anatomy of a course in cluster and grid computing

引用

International Conference on information Technology: Research and Education (ITRE)

作者： Chao-Tung Yang Kuan-Ching Li High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0780389328

Cluster and grid computing is a relatively new interdisciplinary field, where computer science, engineering and computational biology are its core supporting disciplines. The rise of cluster and grid computing discipline brings to computer science faculty members new opportunities and challenges, both in education and in research. In this paper, we explore issues in teaching cluster and grid computing, the developing of curricula, and thoughts to foster student to work on research projects in cluster and grid computing.

关键词： Anatomy Grid computing Distributed computing Concurrent computing computer networks Brain modeling Predictive models computer science Education Space technology

来源：评论

学校读者我要写书评

暂无评论

Using data grid technologies to construct a digital library environment

Using data grid technologies to construct a digital library ...

引用

International Conference on information Technology: Research and Education (ITRE)

作者： Chao-Tung Yang Hsin-Chuan Ho High-Perfomce Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0780389328

Since the beginning of the 21st century, knowledge has been accumulating at a tremendous speed. Access to global books, literature, and data are continually increasing in large quantities. With the development of Internet and the rapid advancement of information technology, a new knowledge transfer model has been developed: books and other forms of digitized data provide readers with the most convenient methods to search for and obtain library content. We propose a global digital library grid concept. This digital library organization is not only to include new members (new libraries or new museums) flexibility, but also not to affect the system and framework of the original grid member. As the organization grows, it forms an enormous virtual grid digital library to provide readers with speedy knowledge service that meets their individual requirements.

关键词： Software libraries Grid computing Books computer science Internet computer architecture Chaos Data engineering Knowledge engineering information technology

来源：评论

学校读者我要写书评

暂无评论

Two-level preconditioning techniques for electromagnetic wave scattering problems

Two-level preconditioning techniques for electromagnetic wav...

引用

2005 IEEE/ACES International Conference on Wireless Communications and Applied Computational Electromagnetics

作者： Lee, Jeonghwa Zhang, Jun Lu, Cai-Cheng RAPT Industries Inc. 183 Northpointe Blvd. Freeport PA 16229 United States Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Science University of Kentucky Lexington KY 40506 United States Department of Electrical and Computer Engineering University of Kentucky Lexington KY40506 United States

ISBN: (纸本)0780390687

We investigate preconditioned iterative solutions of large dense complex valued matrices arising from discretizing the hybrid integral equations of electromagnetic scattering. Due to the specific data pattern, we propose to construct two-level (TL) preconditioners to treat the conducting and dielectric parts more efficiently. The main purpose of this study is to show that the TL preconditioning is effective with the MLFMA and can reduce the number of Krylov iterations substantially by using subdivided domain of the near part matrix for each level. Our experimental results indicate that the TL preconditioning maintains the computational complexity of the MLFMA, but converges much faster, thus effectively reduces the overall simulation time for the coated material objects. © 2005 ACES.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

On implementation of an enhanced and integrated parallel programming Web-based toolkit

On implementation of an enhanced and integrated parallel pro...

引用

International Conference on information Technology: Research and Education (ITRE)

作者： Kuan-Ching Li Chao-Tung Yang Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan High Performance Computing Laboratory Department of Computer Science and Infnmation Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0780389328

The computing power provided by high performance and low cost PC-based clusters and grid computing platforms are attractive and they are equal or superior to supercomputers and mainframes. In parallel, discussions on how to obtain more computing power from these computing platforms become an interesting issue. The development of applications for these high-performance computing platforms is complicated for several reasons: the complexity of applications themselves, which combines aspects of super computing and distributed computing, and by the need to achieve higher performance. This paper describes the design rationale and implementation of a parallel programming Web-based toolkit, to ease the parallel programming learning process, with the use of Web-based interface. The toolkit has widely been used in MPI parallel programming courses (both in graduate and undergraduate levels) and industry trainings.

关键词： Parallel programming Concurrent computing Application software Distributed computing Grid computing high performance computing Visualization computer science Supercomputers Industrial training

来源：评论

学校读者我要写书评

暂无评论

Quark Mass Dependence of Nucleon Magnetic Moment and Charge Radii

引用

Communications in Theoretical Physics 2005年第2X期44卷 333-336页

作者： MA Wei-Xing ZHOU Li-Juan GU Yun-Ting PING Rong-Gang Center of Theoretical Nuclear Physics National Laboratory of Heavy Ion Accelerator of Lanzhou Lanzhou 730000 China Institute of High Energy Physics~ the Chinese Academy of Sciences Beijing 100039 China Department of Information and Computing Science Guangxi University of Technology Liuzhou 545006 China College of Physics Science and Engineering Technology Guangxi University Nanning 530004 China

Understanding hadron structure within the framework of QCD is an extremely challenging problem. Our purpose here is to explain the model-independent consequences of the approximated chiral symmetry of QCD for two famous results concerning the quark structure of the nucleon. We show that both the apparent success of the constituent quark model in reproducing the ratio of proton to neutron magnetic moments and the apparent success of the Foldy term in reproducing the observed charge radius of the neutron are coincidental. That is, a relatively small change of the current quark mass would spoil both results.

关键词： quark mass nucleon magnetic moment nucleon charge radius

来源：评论

学校读者我要写书评

暂无评论

A high-performance computational resource broker for grid computing environments

A high-performance computational resource broker for grid co...

引用

International Conference on Advanced information Networking and Applications (AINA)

作者： Chao-Tung Yang Po-Chi Shih Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. As grid computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, as well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user's needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user's credentials. The resource broker runs on top of the Globus toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the grid.

关键词： Grid computing Resource management Bandwidth Distributed computing Network servers Monitoring information security Middleware Access protocols Java

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：