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

International Workshop on Agent Technologies for e-Services, ATES 2002, 3rd International Symposium on Multi-Agent systems, Large Complex systems, and E-Businesses, MALCEB 2002 and International Workshop on Agent Technology and software engineering, AgeS 2002 held in conjunction with International Conference on Net.ObjectDays, NODe 2002

作者： Henderson, Peter Crouch, Stephen Walters, Robert John Ni, Qinglai Declarative Systems and Software Engineering Department of Electronics and Computer Science University of Southampton SouthamptonSO17 1BJ United Kingdom

ISBN: (纸本)9783540365594

This paper provides some results and analysis of several negotiation algorithms. We have used a tournament-based approach to evaluation and applied this within a community of Buyers and Sellers in a simulated car hire scenario. An automated negotiation environment has been developed and the various negotiation algorithms made to compete against each other. In a single tournament, each algorithm was used as both a Buyer-negotiator and a Sellernegotiator. Each negotiating algorithm accommodates the parameters for negotiation as a set of desirable goals, represented as examples of product specifications. It was the task of each negotiating algorithm to get the best deal possible from every one of their opposites (i.e. Buyer versus Seller) in the sense of being close to the examples they were given as goals. One algorithm proved to be superior to the others against which it was made to compete. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

Optimal partition of QoS requirements for many-to-many connections

Optimal partition of QoS requirements for many-to-many conne...

引用

22nd Annual Joint Conference on the IEEE computer and Communications Societies

作者： Lorenz, Dean H. Orda, Ariel Raz, Danny Distributed Computer Systems IBM Haifa Research Labs Haifa Israel Department of Electrical Engineering Technion - Israel Inst. of Technol. Haifa Israel Department of Computer Science Technion - Israel Inst. of Technol. Haifa Israel

ISBN: (纸本)0780377524

We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the context of performance dependent costs. In this context each network element can offer several QoS guarantees, each associated with a different cost. This is a natural extension to the commonly used bi-criteria model, where each link is associated with a single delay and a single cost. This framework is simple yet strong enough to model many practical interesting networking problems. The fundamental multicast resource allocation problem under this framework is how to optimally allocate QoS requirements on the links of the multicast tree. One needs to partition the end-to-end QoS requirement along the various paths in a tree. The goal is to satisfy the end-to-end QoS requirement with minimum cost. Previous studies under this framework considered single-source multicast connections, where the End-to-end QoS requirement is specified from the source to all other multicast group members. In this paper we extend these results to the more general, and considerably harder case of multicast sessions, where the end-to-end requirement hold for every path between any two multicast group members. Our aim is to provide rigorous solutions, with proven performance guaranties, by way of algorithmic analysis. The problem under investigation is NP hard for general cost functions, thus we first present a pseudo-polynomial exact solution. From this solution we derive two efficient Ε-approximate solutions. One achieves optimal cost, but may violate the end-to-end delay requirement by a factor of (1 + Ε), and the other strictly obeys the bounds and achieves a cost within a factor of (1+Ε) of the optimum. Furthermore, we present improved results for discrete cost functions, and give a simple linear-time exact polynomial solution for a specific, and practically interesting, family of convex cost functions.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Advanced topics in workflow management: Issues, requirements, and solutions

引用

Journal of Integrated Design and Process Science 2003年第3期7卷 49-77页

作者： Van der Aalst, Wil M.P. Weske, Mathias Wirtz, Guido Department of Information and Technology Eindhoven University of Technology Eindhoven NL-5600 MB PO Box 513 Netherlands Hasso Plattner Institute for Software Systems Engineering Potsdam D-14482 Prof. Dr.-Helmert-Straße 2-3 Germany Distributed and Mobile Systems Group Faculty of Information Systems and Applied Computer Science Otto-Friedrich-Universität Bamberg Bamberg D-96045 Feldkirchenstraße 21 Germany

This paper surveys and investigates the strengths and weaknesses of a number of recent approaches to advanced workflow modelling. Rather than inventing just another workflow language, we briefly describe recent workflow languages, and we analyse them with respect to their support for advanced workflow topics. Object Coordination Nets, Workflow Graphs, WorkFlow Nets, and an approach based on Workflow Evolution are described as dedicated workflow modelling approaches. In addition, the Unified Modelling Language as the de facto standard in object-oriented modelling is also investigated. These approaches are discussed with respect to coverage of workflow perspectives and support for flexibility and analysis issues in workflow management, which are today seen as two major areas for advanced workflow support. Given the different goals and backgrounds of the approaches mentioned, it is not surprising that each approach has its specific strengths and weaknesses. We clearly identify these strengths and weaknesses, and we conclude with ideas for combining their best features. © 2003, IOS Press. All rights reserved.

关键词： Applied workflow systems Flexible workflow management Workflow analysis

来源：评论

学校读者我要写书评

暂无评论

Towards automated support for deriving test data from UML statecharts

Towards automated support for deriving test data from UML st...

引用

6th International Conference on Unified Modeling Language, UML 2003

作者： Briand, Lionel C. Cui, Jim Labiche, Yvan Software Quality Engineering Laboratory Systems and Computer Engineering Department Carleton University 1125 Colonel By Drive OttawaONK1S5B6 Canada

ISBN: (纸本)9783540202431

Many statechart-based testing strategies result in specifying a set of paths to be executed through a (flattened) statechart. These techniques can usually be easily automated so that the tester does not have to go through the tedious procedure of deriving paths manually to comply with a coverage criterion. The next step is then to take each test path individually and derive test data, i.e., fully specified test cases. This requires that we determine the system state required for each event/transition that is part of the path to be tested and the input parameter values for all events and actions on the transitions. We propose here a methodology to automate this procedure, which is based on a careful normalization and analysis of event/action contracts and transition guards written with the Object Constraint Language (OCL). It is illustrated by a case study that exemplifies the steps and provides an initial validation. Though many of the steps are automated, some inputs are still required from the modeler and tester and further work is necessary to push the automation even further and solve a number of remaining issues. This paper is a first attempt at clarifying the issues and identifying the analysis steps required in such an endeavor. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

AutoMate: enabling autonomic applications on the grid

AutoMate: enabling autonomic applications on the grid

引用

International Workshop on Active Middleware Services

作者： M. Agarwal V. Bhat H. Liu V. Matossian V. Putty C. Schmidt G. Zhang L. Zhen M. Parashar B. Khargharia S. Hariri The Applied Software Systems Laboratory Department of Electrical and Computer Engineering State University of New Jersey Rutgers USA High Performance Distributed Computing Laboratory Department of Electrical and Computer Engineering University of Arizona Tucson USA

The increasing complexity, heterogeneity and dynamism of networks, systems, services applications have made our computational/information infrastructure brittle, unmanageable and insecure. This has necessitated the investigation of a new paradigm for design, development and deployment based on strategies used by biological systems to deal with complexity, heterogeneity, and uncertainty, i.e. autonomic computing. This paper introduces the AutoMate project and describes its key components. The overall objective of AutoMate is to investigate key technologies to enable the development of autonomic grid applications that are context aware and are capable of self-configuring, self-composing, self-optimizing and self-adapting. Specifically, it will investigate the definition of autonomic components, the development of autonomic applications as dynamic composition of autonomic components, and the design of key enhancements to existing grid middleware and runtime services to support these applications.

关键词： Biology computing Application software Context awareness Middleware Grid computing Laboratories distributed computing computer networks Biological systems Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Datawarp: Building applications which make progress in an inconsistent world

Datawarp: Building applications which make progress in an in...

引用

4th IFIP WG 6.1 International Conference on distributed Applications and Interoperable systems, DAIS 2003 held as a joint event in federation with 6th IFIP WG 6.1 International Conference on Formal Methods for Open Object-based distributed systems, FMOODS 2003

作者： Henderson, Peter Walters, Robert John Crouch, Stephen Ni, Qinglai Declarative Systems and Software Engineering Group Department of Electronics and Computer Science University of Southampton SouthamptonSO17 1BJ United Kingdom

ISBN: (纸本)3540205292

The usual approach to dealing with imperfections in data is to attempt to eliminate them. However, the nature of modern systems means this is often futile. This paper describes an approach which permits applications to operate notwithstanding inconsistent data. Instead of attempting to extract a single, correct view of the world from its data, a DataWarp application constructs a collection of interpretations. It adopts one of these and continues work. Since it acts on assumptions, the DataWarp application considers its recent work to be provisional, expecting eventually most of these actions will become definitive. Should the application decide to adopt an alternative data view, it may then need to void provisional actions before resuming work. We describe the DataWarp architecture, discuss its implementation and describe an experiment in which a DataWarp application in an environment containing inconsistent data achieves better results than its conventional counterpart. © IFIP International Federation for Information Processing 2003.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Grouping verifiable content for selective disclosure

Grouping verifiable content for selective disclosure

引用

8th Australasian Conference on Information Security and Privacy, ACISP 2003

作者： Bull, Laurence Squire, David McG. Newmarch, Jan Zheng, Yuliang School of Computer Science and Software Engineering Monash University Caulfield East 3145 Australia School of Network Computing Monash University Frankston 3199 Australia Department of Software and Information Systems University of North Carolina at Charlotte Charlotte NC 28223 United States

ISBN: (纸本)3540405151

This paper addresses the issue of selective disclosure of verifiable content. It extends previous work relating to Content Extraction Signatures [21] to implement a more complex structure that encodes a richer, more flexible fragment extraction policy, which includes fragment grouping. The new extraction policy enables the signer to specify both optional and mandatory fragment associations (or groupings) for verifying extracted content. © 2003 Springer-Verlag Berlin Heidelberg.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A Framework for Adaptive Cluster Computing Using JavaSpaces

引用

Cluster Computing 2003年第3期6卷 201-213页

作者： Batheja, Jyoti Parashar, Manish The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers The State University of New Jersey Piscataway USA

Heterogeneous networked clusters are being increasingly used as platforms for resource-intensive parallel and distributed applications. The fundamental underlying idea is to provide large amounts of processing capacity over extended periods of time by harnessing the idle and available resources on the network in an opportunistic manner. In this paper we present the design, implementation and evaluation of a framework that uses JavaSpaces to support this type of opportunistic adaptive parallel/distributed computing over networked clusters in a non-intrusive manner. The framework targets applications exhibiting coarse grained parallelism and has three key features: (1) portability across heterogeneous platforms, (2) minimal configuration overheads for participating nodes, and (3) automated system state monitoring (using SNMP) to ensure non-intrusive behavior. Experimental results presented in this paper demonstrate that for applications that can be broken into coarse-grained, relatively independent tasks, the opportunistic adaptive parallel computing framework can provide performance gains. Furthermore, the results indicate that monitoring and reacting to the current system state minimizes the intrusiveness of the framework.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An empirical study of an ER-model inspection meeting

An empirical study of an ER-model inspection meeting

引用

29th EUROMICRO Conference, EUROMICRO 2003

作者： Rombach, Caroline D. Kude, Oliver Aurum, Aybüke Jeffery, Ross Wohlin, Claes Computer Science and Economics University of Mannheim Germany School of Information Systems Technology and Management Univ. of New South Wales Australia School of Computer Science and Engineering Univ. of New South Wales Australia National ICT Australia Department of Software Engineering and Computer Science Blekinge Institute of Technology Sweden

ISBN: (纸本)0769519962

A great benefit of software inspections is that they can be applied at almost any stage of the software development life cycle. We document a large-scale experiment conducted during an entity relationship (ER) model inspection meeting. The experiment was aimed at finding empirically validated answers to the question "which reading technique has a more efficient detection rate when searching for defects in an ER model". Secondly, the effect of the usage of roles in a team meeting was also explored. Finally, we investigate the reviewers' ability to find defects belonging to certain defect categories. The findings showed that the participants using a checklist had a significantly higher detection rate than the ad hoc groups. Overall, the groups using roles had a lower performance than those without roles. Furthermore, the findings showed that when comparing the groups using roles to those without roles, the proportion of syntactic and semantic defects found in the number of overall defects identified did not significantly differ. © 2003 IEEE.

关键词： Inspection

来源：评论

学校读者我要写书评

暂无评论

Flexible information discovery in decentralized distributed systems 03

Flexible information discovery in decentralized distributed ...

引用

International Symposium on High Performance distributed Computing

作者： C. Schmidt M. Parashar The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers University USA

ISBN: (纸本)9780769519654

The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distributed environments such as computational grids and peer-to-peer (P2P) storage and retrieval systems. This paper presents a P2P information discovery system that supports flexible queries using partial keywords and wildcards, and range queries. It guarantees that all existing data elements that match a query are found with bounded costs in terms of number of messages and number of peers involved. The key innovation is a dimension reducing indexing scheme that effectively maps the multidimensional information space to physical peers. The design, implementation and experimental evaluation of the system are presented.

关键词： Peer to peer computing Grid computing distributed computing Resource management Fault tolerant systems Central Processing Unit Costs Technological innovation Indexing Multidimensional systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：