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

IEEE International Conference on E-Commerce Technology Workshops

作者： S. Roser B. Bauer Programming Distributed Systems Lab Institute of Computer Science University of Augsburg Germany

Business process modeling (BPM) is one of the key factors in defining service-oriented solutions for business collaborations. Like in traditional software engineering there is a need for adaptable methodologies to develop information and communication technology (ICT) systems supporting collaborative business processes. In this work we introduce a categorization for the classification of modeling languages and approaches used to model collaborative business processes. Considering an example, we show how the classification of modeling languages and approaches facilitates the development of methodologies for collaborative business processes.

关键词： Collaboration Standardization Collaborative work Application software Software engineering Collaborative software Service oriented architecture Standards organizations Standards development Computer science

来源：评论

学校读者我要写书评

暂无评论

Put My Galakmid Coin into the Dispenser and Kick It: Computational Linguistics and Theorem Proving in a Computer Game

引用

Journal of Logic, Language and Information 2004年第2期13卷 187-206页

作者： Koller, Alexander Debusmann, Ralph Gabsdil, Malte Striegnitz, Kristina Department of Computational Linguistics Saarland University Saarbrücken Germany Programming Systems Lab Saarland University Saarbrücken Germany

We combine state-of-the-art techniques from computational linguisticsand theorem proving to build an engine for playing text adventures,computer games with which the player interacts purely through naturallanguage. The system employs a parser for dependency grammar and ageneration system based on TAG, and has components for resolving andgenerating referring expressions. Most of these modules make heavy useof inferences offered by a modern theorem prover for descriptionlogic. Our game engine solves some problems inherent in classical textadventures, and is an interesting test case for the interactionbetween natural language processing and inference.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Situational method engineering applied for the enactment of development processes - An agent based approach

Situational method engineering applied for the enactment of ...

引用

作者： Seemueller, Holger Voos, Holger Honke, Benjamin Bauer, Bernhard Mobile Robotics and Mechatronics Lab. University of Applied Sciences Ravensburg-Weingarten D-88241 Weingarten Germany Programming Distributed Systems Lab. Institute of Computer Science University of Augsburg D-86135 Augsburg Germany

ISBN: (纸本)9789898425065

Interdisciplinary product development is faced with the collaboration of diverse roles and a multitude of interrelated artifacts. Traditional and sequential process models cannot deal with the long-lasting and dynamic behavior of the development processes of today. Moreover, development processes have to be tailored to the needs of the projects, which are usually distributed today. Thus, keeping these projects on track from a methodology point of view is difficult. In order to deal with these challenges, this paper will present a novel method engineering and enactment approach. It combines the ideas of workflow technologies and product line engineering for method engineering as well as agent technology for the development process enactment.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

The constraint language for lambda structures

引用

Journal of Logic, Language and Information 2001年第4期10卷 457-485页

作者： Egg, Markus Koller, Alexander Niehren, Joachim Department of Computational Linguistics University of the Saarland 66041 Saarbrücken P.O. Box 15 11 50 Germany Programming Systems Lab. University of the Saarland 66041 Saarbrücken P.O. Box 15 11 50 Germany

This paper presents the Constraint Language for Lambda Structures (CLLS), a first-order language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, tree-like structures that encode λ-terms. Based on CLLS, we present an underspecified, uniform analysis of scope, ellipsis, anaphora, and their interactions. CLLS solves a variable capturing problem that is omnipresent in scope underspecification and can be processed efficiently. © 2001 Kluwer Academic Publishers.

关键词： Anaphora Ellipsis Scope ambiguity Tree descriptions Underspecification

来源：评论

学校读者我要写书评

暂无评论

POV-Ray parallelization and optimization: An experience report

POV-Ray parallelization and optimization: An experience repo...

引用

2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'05

作者： Yang, Chen Chen, Yongjian Fu, Xiong Lim, Chu-Cheow Ju, Roy KeXue Yuan South Road ZhongGuanCun HaiDian Dist Beijing 100086 China Programming Systems Lab/MTL SC12-323 2200 Mission College Blvd Santa Clara CA 95052-8119 United States

ISBN: (纸本)1932415602

With the industry trend towards multi-core chip, we need to understand the practical issues faced by users who are porting large existing sequential software to a parallel platform. There is much literature on inventing, implementing and optimizing parallel algorithms. We study what a user needs in order to come up with an efficient parallel program, starting from a sequential application. We parallelized, debugged and optimized a large, public-domain ray-tracing code (POV-Ray). We built a performance tool to predict parallel POV-Ray's scalability on different platforms. The performance prediction tool and modeling was an important part of the optimization methodology because it guides the user's expectations on the potential benefits of more efforts to identify performance bottlenecks. We describe the steps in our POV-Ray work, and summarize potential relevant research issues. Even for a sequential algorithm which can be "embarrassingly parallelized", there is still much scope for further research to simplify the user's parallelization and optimization efforts.

关键词： Ray tracing

来源：评论

学校读者我要写书评

暂无评论

Global constraints for round robin tournament scheduling

Global constraints for round robin tournament scheduling

引用

作者： Henz, Martin Müller, Tobias Thiel, Sven School of Computing National University of Singapore Singapore 117543 Singapore Programming Systems Lab. Saarland University 66041 Saarbrücken Germany Max-Planck-Inst. für Informatik Im Stadtwald 66123 Saarbrücken Germany

In the presence of side-constraints and optimization criteria, round robin tournament problems are hard combinatorial problems, commonly tackled with tree search and branch-and-bound optimization. Recent results indicate that constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain by exploiting global constraint propagation algorithms during search. In this paper, we analyze arc-consistent propagation algorithms for the global constraints "all-different" and "one-factor" in the domain of round robin tournaments. The best propagation algorithms allow us to compute all feasible perfectly mirrored pattern sets with minimal breaks for intermural tournaments of realistic size, and to improve known lower bounds for intramural tournaments balanced with respect to carry-over effects. © 2003 Published by Elsevier B.V.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for the configuration problem of dominance graphs

An efficient algorithm for the configuration problem of domi...

引用

2001 Operating Section Proceedings, American Gas Association

作者： Althaus, Ernst Duchier, Denys Koller, Alexander Mehlhorn, Kurt Niehren, Joachim Thiel, Sven Max-Planck-Institute for Computer Science Saarbrücken Germany Programming Systems Lab. Fachbereich Informatik Universität des Saarlandes Saarbrücken Germany Department of Computational Linguistics Universität des Saarlandes Saarbrücken Germany

ISBN: (纸本)0898714907

Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only normal dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known. Copyright © 2009 ACM, Inc.

关键词： Human factors Languages Verification

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Test Suite Optimization for Incremental Product Family Testing

Multi-Objective Test Suite Optimization for Incremental Prod...

引用

IEEE International Conference on Software Testing, Verification and Validation

作者： Hauke Baller Sascha Lity Malte Lochau Ina Schaefer TU Braunschweig Institute for Programming and Reactive Systems TU Darmstadt Real Time Systems Lab TU Braunschweig Institute of Software Engineering and Automotive Informatics

ISBN: (纸本)9781479922567

The design of an adequate test suite is usually guided by identifying test requirements which should be satisfied by the selected set of test cases. To reduce testing costs, test suite minimization heuristics aim at eliminating redundancy from existing test suites. However, recent test suite minimization approaches lack (1) to handle test suites commonly derived for families of similar software variants under test, and (2) to incorporate fine-grained information concerning cost/profit goals for test case selection. In this paper, we propose a formal framework to optimize test suites designed for sets of software variants under test w.r.t. multiple conflicting cost/profit objectives. The problem representation is independent of the concrete testing methodology. We apply integer linear programming (ILP) to approximate optimal solutions. We further develop an efficient incremental heuristic for deriving a sequence of representative software variants to be tested for approaching optimal profits under reduced costs. We evaluated the algorithm by comparing its outcome to the optimal solution.

关键词： Testing Strategies Test Coverage of Specifications Constrained Optimization Linear programming

来源：评论

学校读者我要写书评

暂无评论

A dynamic compilation framework for controlling microprocessor energy and performance 38

A dynamic compilation framework for controlling microprocess...

引用

MICRO-38: 38th Annual IEEE/ACM International Symposium on Microarchitecture

作者： Wu, Qiang Reddi, V.J. Wu, Youfeng Lee, Jin Connors, Dan Brooks, David Martonosi, Margaret Clark, Douglas W. Depts. of Computer Science Electrical Engjneering Princeton University Dept. of Electrical and Computer Engineering U. of Colorado Boulder Programming Systems Lab. Corporate Tech. Group Intel Corporation Division of Engineering and Applied Science Harvard University

ISBN: (纸本)0769524400

Dynamic voltage and frequency scaling (DVFS) is an effective technique for controlling microprocessor energy and performance. Existing DVFS techniques are primarily based on hardware, OS timeinterrupts, or static-compiler techniques. However, substantially greater gains can be realized when control opportunities are also explored in a dynamic compilation environment. There are several advantages to deploying DVFS and managing energy/performance tradeoffs through the use of a dynamic compiler. Most importantly, dynamic compiler driven DVFS is fine-grained, code-aware, and adaptive to the current microarchitecture environment. This paper presents a design framework of the run-time DVFS optimizer in a general dynamic compilation system. A prototype of the DVFS optimizer is implemented and integrated into an industrialstrength dynamic compilation system. The obtained optimization system is deployed in a real hardware platform that directly measures CPU voltage and current for accurate power and energy readings. Experimental results, based on physical measurements for over 40 SPEC or Olden benchmarks, show that significant energy savings are achieved with little performance degradation. SPEC2K FP benchmarks benefit with energy savings of up to 70% (with 0.5% performance loss). In addition, SPEC2K INT show up to 44% energy savings (with 5% performance loss), SPEC95 FP save up to 64% (with 4.9% performance loss), and Olden save up to 61% (with 4.5% performance loss). On average, the technique leads to an energy delay product (EDP) improvement that is 3X-5X better than static voltage scaling, and is more than 2X (22% vs. 9%) better than the reported DVFS results of prior static compiler work. While the proposed technique is an effective method for microprocessor voltage and frequency control, the design framework and methodology described in this paper have broader potential to address other energy and power issues such as di/dt and thermal control. © 2005 IEEE.

关键词： Microprocessor chips

来源：评论

学校读者我要写书评

暂无评论

The first-order theory of ordering constraints over feature trees

The first-order theory of ordering constraints over feature ...

引用

Annual Symposium on Logic in Computer Science

作者： M. Miffler J. Niehren R. Treinen Programming Syst. Lab. Saarlandes Univ. Saarbrucken Germany Programming Systems Lab Universitat des Saarlandes Saarbrucken Germany Laboratoire de Recherche en Informatique Universite de Paris Sud Orsay France

The system FT/sub /spl les// of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT/sub /spl les// and its fragments, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT/sub /spl les// is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We determine the complexity of the entailment problem of FT/sub /spl les// with existential quantification to be PSPACE-complete, by proving its equivalence to the inclusion problem of non-deterministic finite automata. Our reduction from the entailment problem to the inclusion problem is based on a new algorithm that, given an existential formula of FT/sub /spl les//, computes a finite automaton which accepts all its logic consequences.

关键词： Constraint theory labeling Tellurium Automata Read only memory Computational linguistics Computer languages Logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：