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

IEEE International Conference on e-science and Grid computing

作者： Xingchen Chu Krishna Nadiminti Chao Jin Srikumar Venugopal Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

In this paper, we present the design of Aneka, a .NET based service-oriented platform for desktop grid computing that provides: (i) a configurable service container hosting pluggable services for discovering, scheduling and balancing various types of workloads and (ii) a flexible and extensible framework/API supporting various programming models including threading, batch processing, MPI and dataflow. Users and developers can easily use different programming models and the services provided by the container to run their applications over desktop Grids managed by Aneka. We present the implementation of both the essential and advanced services within the platform. We evaluate the system with applications using the grid task and dataflow models on top of the infrastructure and conclude with some future directions of the current system.

关键词： Grid computing Object oriented modeling Containers Personal communication networks Application software Processor scheduling Data security Peer to peer computing Authentication Resource management

来源：评论

学校读者我要写书评

暂无评论

Design of Addition and Multiplication Units for High Performance Interval Arithmetic Processor

Design of Addition and Multiplication Units for High Perform...

引用

IEEE Design and Diagnostics of Electronic Circuits and systems (DDECS)

作者： Alexandru Amaricai Mircea Vladutiu Lucian Prodan Mihai Udrescu Oana Boncalo Advanced Computing Systems and Architectures Research Group Computer Science and Engineering Department Polytechnic University of Timisoara Romania

This paper proposes a new approach for the optimization process of the interval addition and multiplication floating point units. For the interval addition/subtraction, an adder exploiting the parallelism of the double path adder structure is used. The two floating point additions needed are performed simultaneously on different data paths. Therefore, the performance of the proposed adder can be the same as that of two individual floating point adders, but with a much reduced cost overhead. Regarding the interval multiplication, a multiplier architecture was designed, in order to be suitable for pipelined structures. It consists of a floating point multiplier which computes two results for the same operation (rounded differently), and of two floating point comparators. In terms of performance, the proposed multiplier unit presents half of the performance of a conventional floating point multiplier. This is not a drawback, if we consider the fact that interval multiplication requires four floating point operations and six comparisons. This paper shows that interval arithmetic can be efficiently implemented in terms of performance and cost.

关键词： Adders Floating-point arithmetic Computer architecture Costs Digital arithmetic High performance computing Computer science Design engineering Design optimization Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Integrated Risk Analysis for a Commercial computing Service

Integrated Risk Analysis for a Commercial Computing Service

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Chee Shin Yeo Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne VIC Australia

Utility computing has been anticipated to be the next generation of computing usage. Users have the freedom to easily switch to any commercial computing service to complete jobs whenever the need arises and simply pay only on usage, without any investment costs. A commercial computing service however has certain objectives or goals that it aims to achieve. In this paper, we identify three essential objectives for a commercial computing service: (i) meet SLA, (ii) maintain reliability, and (iii) earn profit. This leads to the problem of whether a resource management policy implemented in the commercial computing service is able to meet the required objectives or not. So, we also develop two evaluation methods that are simple and intuitive: (i) separate and (ii) integrated risk analysis to analyze the effectiveness of resource management policies in achieving the required objectives. Evaluation results based on five policies successfully demonstrate the applicability of separate and integrated risk analysis to assess policies in terms of the required objectives.

关键词： Risk analysis Resource management Grid computing Distributed computing Switches Maintenance Investments Laboratories Computer science Software engineering

来源：评论

学校读者我要写书评

暂无评论

A recursive clustering methodology using a genetic algorithm

A recursive clustering methodology using a genetic algorithm

引用

Congress on Evolutionary Computation

作者： Amit Banerjee Sushil J. Louis Evolutionary Computing Systems Laboratory Department of Computer Science and Engineering University of Nevada슠Reno NV USA

This paper presents a recursive clustering scheme that uses a genetic algorithm-based search in a dichotomous partition space. The proposed algorithm makes no assumption on the number of clusters present in the dataset; instead it recursively uncovers subsets in the data until all isolated and separated regions have been classified as clusters. A test of spatial randomness serves as a termination criteria for the recursive process. Within each recursive step, a genetic algorithm searches the partition space for an optimal dichotomy of the dataset. A simple binary representation is used for the genetic algorithm, along with classical selection, crossover and mutation operators. Results of clustering on test cases, ranging from simple datasets in 2-D to large multidimensional datasets compare favorably with state of the art approaches in genetic algorithm-driven clustering.

关键词： Genetic algorithms Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids

A Dynamic Critical Path Algorithm for Scheduling Scientific ...

引用

IEEE International Conference on e-science and Grid computing

作者： Mustafizur Rahman Srikumar Venugopal Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Effective scheduling is a key concern for the execution of performance driven grid applications. In this paper, we propose a dynamic critical path (DCP) based workflow scheduling algorithm that determines efficient mapping of tasks by calculating the critical path in the workflow task graph at every step. It assigns priority to a task in the critical path which is estimated to complete earlier. Using simulation, we have compared the performance of our proposed approach with other existing heuristic and meta-heuristic based scheduling strategies for different type and size of workflows. Our results demonstrate that DCP based approach can generate better schedule for most of the type of workflows irrespective of their size particularly when resource availability changes frequently.

关键词： Heuristic algorithms Scheduling algorithm Dynamic scheduling Processor scheduling Grid computing Application software Availability Electrical capacitance tomography Software algorithms Laboratories

来源：评论

学校读者我要写书评

暂无评论

A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions

A Quantum Algorithm for Finding Minimum Exclusive-Or Express...

引用

IEEE Computer Society Annual Symposium on VLSI

作者： M. Sampson D. Voudouris G. Papakonstantinou Department of Electrical and Computer Engineering Division of Computer Science Computing Systems Laboratory National and Technical University of Athens Greece

ISBN: (纸本)9780769528960;0769528961

This paper presents a quantum algorithm for minimizing both exclusive-or sum of complex terms (ESCT) and exclusive-or sum of products (ESOP) expressions. The proposed algorithm, QMin, takes advantage of the inherent massive parallelism of quantum circuits. The ESCT expressions produced by QMin are presented in the related bibliography as an attractive architecture for implementing reversible and quantum circuits.

关键词： Quantum computing Circuits Quantum mechanics Computer architecture Boolean functions Computer science Input variables Minimization methods Laboratories Parallel processing

来源：评论

学校读者我要写书评

暂无评论

A Genetic Algorithm Implementation of the Fuzzy Least Trimmed Squares Clustering

A Genetic Algorithm Implementation of the Fuzzy Least Trimme...

引用

IEEE International Conference on Fuzzy systems (FUZZ-IEEE)

作者： Amit Banerjee Sushil J. Louis Evolutionary Computing Systems Laboratory Department of Computer Science and Engineering MS/171 University of Nevada Reno NV USA

This paper describes a new approach to finding a global solution for the fuzzy least trimmed squares clustering. The least trimmed squares (LTS) estimator is known to be a high breakdown estimator, in both regression and clustering. From the point of view of implementation, the feasible solution algorithm is one of the few known techniques that guarantees a global solution for the LTS estimator. The feasible solution algorithm divides a noisy data set into two parts -the non-noisy retained set and the noisy trimmed set, by implementing a pairwise swap of datum between the two sets until a least squares estimator provides the best fit on the retained set. We present a novel genetic algorithm-based implementation of the feasible solution algorithm for fuzzy least trimmed squares clustering, and also substantiate the efficacy of our method by three examples.

关键词： Genetic algorithms Clustering algorithms Electric breakdown Least squares approximation Partitioning algorithms Noise robustness Laboratories Computer science Minimization methods Prototypes

来源：评论

学校读者我要写书评

暂无评论

The Bayesian Decision Tree Technique Using an Adaptive Sampling Scheme

The Bayesian Decision Tree Technique Using an Adaptive Sampl...

引用

Annual IEEE Symposium on Computer-Based Medical systems

作者： Vitaly Schetinin Wojtek Krzanowski Carsten Maple Computing and Information Systems Department University of Bedfordshire UK School of Engineering Computer Science and Mathematics University of Exeter UK

Decision trees (DTs) provide an attractive classification scheme because clinicians responsible for making reliable decisions can easily interpret them. Bayesian averaging over DTs allows clinicians to evaluate the class posterior distribution and therefore to estimate the risk of making misleading decisions. The use of Markov chain Monte Carlo (MCMC) methodology of stochastic sampling makes the Bayesian DT technique feasible to perform. The Reversible Jump (RJ) extension of MCMC allows sampling from DTs of different sizes. However, the RJ MCMC process may become stuck in a particular DT far away from the region with maximal posterior. This negative effect can be mitigated by averaging the DTs obtained in different starts. In this paper we describe a new approach based on an adaptive sampling scheme. The performances of Bayesian DT techniques with the restarting and adaptive strategies are compared on a synthetic dataset as well as on some medical datasets. By quantitatively evaluating the classification uncertainty, we found that the adaptive strategy is superior to the restarting strategy.

关键词： Bayesian methods Decision trees Sampling methods Uncertainty Monte Carlo methods Stochastic processes Information systems Reliability engineering Computer science Mathematics

来源：评论

学校读者我要写书评

暂无评论

Explicit Multi-Symplectic Methods for Hamiltonian Wave Equations

引用

Communications in Computational Physics 2007年第4期2卷 662-683页

作者： Jialin Hong Shanshan Jiang Chun Li Hongyu Liu State Key Laboratory of Scientific and Engineering Computing Institute of Computational MathematicsAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100080P.R.China Graduate School Chinese Academy of SciencesBeijing 100080P.R.China Department of Mathematics The Chinese University of Hong KongShatinN.T.Hong Kong.

In this paper,based on the multi-symplecticity of concatenating symplectic Runge-Kutta-Nystrom(SRKN)methods and symplectic Runge-Kutta-type methods for numerically solving Hamiltonian PDEs,explicit multi-symplectic schemes are constructed and investigated,where the nonlinear wave equation is taken as a model *** comparisons are made to illustrate the effectiveness of our newly derived explicit multi-symplectic integrators.

关键词： Hamiltonian wave equations multi-symplectic integration symplectic Runge-Kutta methods symplectic Runge-Kutta-Nystrom methods.

来源：评论

学校读者我要写书评

暂无评论

Evaluation of software usability using scenarios organized by abstraction structure 07

Evaluation of software usability using scenarios organized b...

引用

25th Anniversary Conference of the European Association for Cognitive Ergonomics, EACE

作者： Kwon, Gyuhyun Ham, Dong Han Yoon, Wan Chul Department of Industrial and Systems Engineering Virginia Polytechnic Institute State University Blacksburg VA 24061-0002 United States School of Computing Science Middlesex University The Burroughs London NW4 4BT United Kingdom Department of Industrial Engineering Korea Advanced Institute of Science and Technology 373-1 Kusong-dong Yusong-gu Daejon 305-701 Korea Republic of

ISBN: (纸本)9781847998491

Motivation - To improve the current practice of scenario-based usability evaluation by suggesting a new method for generating more comprehensive scenarios and using the scenarios more easily and systematically. Research approach - Work domain analysis (WDA) concept in cognitive work analysis (CWA) framework was employed to develop a method for identifying functions and their relationships, which need to be reflected in scenarios. Two methodological tools were developed to help evaluators analyze functional structure and generate meaningful scenarios respectively. Findings/Design - A new method for generating and using scenarios was developed, which accompanies two new tools (function-control matrix and function order diagram). Research limitations/Implications - As the method was applied to only one word processing software, there is a lack of case studies;however, the method has features that may be generalized to other kinds of software. Originality/Value - This research contributes to making a scenario-based evaluation process more systematic by supplementing its current weak points. Also this research applied abstraction hierarchy concept to software systems to which little attention has been given. Take away message - Scenario-based usability evaluation can be enriched with the use of abstraction-based functional structure of software.

关键词： Word processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：