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

Lexicalized Syntax and Topology for Non-projective Dependency Grammar

Electronic Notes in Theoretical Computer Science 2004年 53卷 70-80页

作者： Denys Duchier Programming Systems Lab Universität des Saarlandes Saarbrücken Germany

We propose a lexicalized formulation of dependency grammar that addresses both immediate dependence and linear precedence. Our approach distinguishes two orthogonal, yet mutually constraining dependency trees: an ID tree of syntactic dependencies and a LP tree of topological dependencies. The ID tree is non-ordered, non-projective and its edges are labeled by grammatical functions. The LP tree is ordered and projective and expresses licensed linearizations; its edges are labeled by topological fields. The LP tree can be regarded as deriving from the ID tree through a process of emancipation controlled by lexicalized constraints and principles. In the present article, we formalize valid ID/LP analyses and show how they can be characterized as the solutions of a constraint satisfaction problem. The latter can be solved by constraint programming and forms the basis of our implementation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ordering Constraints over Feature Trees

引用

Constraints 2000年第1-2期5卷 7-41页

作者： Muller, Martin Niehren, Joachim Podelski, Andreas Programming Systems Lab Universität des Saarlandes Stuhlsatzenhausweg 3 D-66041 Saarbrücken Germany Max-Planck-Inst. für Informatik Im Stadtwald D-66123 Saarbrücken Germany

Feature trees are the formal basis for algorithms manipulating record like structures in constraint programming, computational linguistics and in concrete applications like software configuration management. Feature trees model records, and constraints over feature trees yield extensible and modular record descriptions. We introduce the constraint system FT [less-than or equal to] of ordering constraints interpreted over feature trees. Under the view that feature trees represent symbolic information, the relation less than or equal corresponds to the information ordering ("carries less information than"). We present two algorithms in cubic time, one for the satisfiability problem and one for the entailment problem of FT [less-than or equal to] . We show that FT [less-than or equal to] has the independence property. We are thus able to handle negative conjuncts via entailment and obtain a cubic algorithm that decides the satisfiability of conjunctions of positive and negated ordering constraints over feature trees. Furthermore, we reduce the satisfiability problem of Dorre's weak subsumption constraints to the satisfiability problem of FT [less-than or equal to] and improve the complexity bound for solving weak subsumption constraints from O(n5) to O(n3).

关键词： Complexity Entailment Feature constraints Satisfiability Tree orderings Weak subsumption

来源：评论

学校读者我要写书评

暂无评论

Message from the general chair

Proceedings of the 2007 IEEE International Symposium on Work...

引用

Proceedings of the 2007 IEEE International Symposium on Workload Characterization, IISWC 2007年 2-2页

作者： Breternitz Jr., Mauricio Intel MTL - Programming Systems Lab.

来源：评论

学校读者我要写书评

暂无评论

Experimenting with language support for proximity in ambient-oriented programming

Experimenting with language support for proximity in ambient...

引用

International Workshop on Engineering Environment-Mediated Multi-Agent systems, EEMMAS 2007

作者： Ramiro, Victor Dedecker, Jessie Tanter, Éric Barron, Peter University of Chile Santiago Chile Programming Technology Lab. Vrije Universiteit Brussel Belgium Distributed Systems Group Trinity College Dublin Ireland

ISBN: (纸本)3540850287

Proximity is a key to scalable and meaningful interactions in distributed systems, both natural and artificial, and in particular in pervasive computing environments. However, proximity as such is a vague notion that can be considered both in a very factual manner (spatial distance) and in a very abstract and subjective manner (user affinity). We claim that an adequate system or programming language for ambient intelligence applications ought to support an open notion of proximity, making it possible to rely on different, possibly subjective, understandings of proximity, as well as their combinations. We explore how to extend the Ambient-Oriented programming language AmbientTalk with language constructs that give programmers flexible control over subjective proximity definitions in both service advertising and discovery. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Organic and Pervasive Computing – ARCS 2004 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Christian Müller-Schloer Theo Ungerer Bernhard Bauer

ISBN: (数字)9783540247142

ISBN: (纸本)9783540212386

Where is system architecture heading? The special interest group on Computer and systems Architecture (Fachausschuss Rechner- und Systemarchitektur) of the German computer and information technology associations GI and ITG a- ed this question and discussed it during two Future Workshops in 2002. The result in a nutshell: Everything will change but everything else will remain. Future systems technologies will build on a mature basis of silicon and IC technology,onwell-understoodprogramminglanguagesandsoftwareengineering techniques, and on well-established operating systems and middleware concepts. Newer and still exotic but exciting technologies like quantum computing and DNA processing are to be watched closely but they will not be mainstream in the next decade. Although there will be considerable progress in these basic technologies, is there any major trend which uni?es these diverse developments? There is a common denominator – according to the result of the two - ture Workshops – which marks a new quality. The challenge for future systems technologies lies in the mastering of complexity. Rigid and in?exible systems, built under a strict top-down regime, have reached the limits of manageable complexity, as has become obvious by the recent failure of several large-scale projects. Nature is the most complex system we know, and she has solved the problem somehow. We just haven’t understood exactly how nature does it. But it is clear that systems designed by nature, like an anthill or a beehive or a swarm of birds or a city, are di?erent from today’s technical systems that have beendesignedbyengineersandcomputerscientists.

关键词： Computer System Implementation Computer Communication Networks Software Engineering Operating systems Information Storage and Retrieval Information systems Applications (incl. Internet)

来源：评论

学校读者我要写书评

暂无评论

Decentralized business process modeling and enactment:: ICT architecture topologies and decision methods

Decentralized business process modeling and enactment:: ICT ...

引用

5th International Workshop on programming Multi-Agent systems

作者： Bauer, Bernhard Mueller, Jorg P. Roser, Stephan Univ Augsburg Programming Distributed Systems Lab Univ Str 14 D-86135 Augsburg Germany Tech Univ Clausthal Dept Informat D-38678 Clausthal Zellerfeld Germany

ISBN: (纸本)9783540790426

Multiagent systems have been proposed in the literature as a suitable architectural and implementation approach for cross-enterprise collaboration, due to their support for decentral decision-making and peer-to-peer coordination, loosely coupled interaction, modeling support for the notion of electronic institutions, and built-in adaptability mechanisms. While we agree with this general view, we argue that different application domain and different market constellations require different types of architecture. In this paper we look at the specific problem of selecting an information and communication technology (ICT) architecture for cross-enterprise business process (CBP) design and enactment. Therefore we identify three important architectural patterns for CBP enactment. We then propose a decision method for architecture selection based on the analytic hierarchy process (AHP) approach. Finally we illustrate the method by applying it to two application scenarios with differing characteristics. Robustness of the decision method is analyzed by performing a sensitivity analysis.

关键词： Software architecture

来源：评论

学校读者我要写书评

暂无评论

Constraints over Lambda-Structures in semantic underspecification 36

Constraints over Lambda-Structures in semantic underspecific...

引用

36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, COLING-ACL 1998

作者： Egg, Markus Niehren, Joachim Ruhrberg, Peter Xu, Feiyu Department of Computational Linguistics Universität des Saarlandes Saarbrücken Germany Programming Systems Lab Universität des Saarlandes Saarbrücken Germany

We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A λ-structure can be considered as a λ-term up to consistent renaming of bound variables (α-equality);a constraint of CLLS is an underspecified description of a λ-structure. CLLS solves a capturing problem omnipresent in underspecified scope representations. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. Based on CLLS we present a simple, integrated, and underspecified treatment of scope, parallelism, and anaphora. © COLING-ACL *** right reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A cost-driven compilation framework for speculative parallelization of sequential programs

A cost-driven compilation framework for speculative parallel...

引用

Proceedings of the 2004 ACM SIGPLAN Conference on programming Language Design and Implementation (PLDI'04)

作者： Du, Zhao-Hui Yang, Chen Lim, Chu-Cheow Zhao, Qingyu Li, Xiao-Feng Ngai, Tin-Fook Intel China Research Center Intel China Ltd. Beijing China Programming Systems Lab Intel Corporation Santa Clara California United States

The emerging hardware support for thread-level speculation opens new opportunities to parallelize sequential programs beyond the traditional limits. By speculating that many data dependences are unlikely during runtime, consecutive iterations of a sequential loop can be executed speculatively in parallel. Runtime parallelism is obtained when the speculation is correct. To take full advantage of this new execution model, a program needs to be programmed or compiled in such a way that it exhibits high degree of speculative thread-level parallelism. We propose a comprehensive cost-driven compilation framework to perform speculative parallelization. Based on a misspeculation cost model, the compiler aggressively transforms loops into optimal speculative parallel loops and selects only those loops whose speculative parallel execution is likely to improve program performance. The framework also supports and uses enabling techniques such as loop unrolling, software value prediction and dependence profiling to expose more speculative parallelism. The proposed framework was implemented on the ORC compiler. Our evaluation showed that the cost-driven speculative parallelization was effective. Our compiler was able to generate good speculative parallel loops in ten Spec2000Int benchmarks, which currently achieve an average 8% speedup. We anticipate an average 15.6% speedup when all enabling techniques are in place.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Re-engineering automation systems as dynamic software product lines 11

Re-engineering automation systems as dynamic software produc...

引用

11th Dagstuhl-Workshop Modellbasierte Entwicklung Eingebetteter Systeme, MBEES 2015 - 11th Dagstuhl-Workshop on Model-Based Development of Embedded systems, MBEES 2015

作者： Lity, Sascha Burdek, Johannes Lochau, Malte Berens, Markus Schurr, Andy Schaefer, Ina Institute for Programming and Reactive Systems TU Braunschweig Germany Real-Time Systems Lab TU Darmstadt Germany Eckelmann AG Germany Institute of Software Engineering and Automotive Informatics TU Braunschweig Germany

Software engineering is an important development task in the automation domain due to the increasing number of embedded systems applied for controlling various system functions. In general, those automation systems are highly configurable, but share common functionality and engineering artifacts. If the knowledge about commonality and variability is not taken into account, this would result in a separate development process for each new system without reusing engineering artifacts. Software product line engineering is a promising approach for the development of highly configurable automation systems explicitly exploiting the knowledge about commonality and variability. In addition to the specification of the problem space, i.e., all possible system configurations derivable from a feature model, reusable engineering artifacts are defined in the solution space by incorporating variability mechanisms. In this paper, we describe the re-engineering of an existing family of automation systems, a medical device for a novel radiotherapy, i.e., as a software product line. According to the concepts of software product line engineering, we describe (1) how we created a corresponding feature model for the problem space specification, and (2) how we integrated variability modeling into existing engineering artifacts. We provide details about our real-world case study and further explain the adaptation of its re-engineered version as dynamic software product line allowing for re-configuration at runtime. © Tagungsband - Dagstuhl-Workshop MBEES 2015: Modellbasierte Entwicklung Eingebetteter Systeme XI. All rights reserved.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Beta reduction constraints 1

引用

12th International Conference on Rewriting Techniques and Applications, RTA 2001

作者： Bodirsky, Manuel Erk, Katrin Koller, Alexander Niehren, Joachim Programming Systems Lab Universität des Saarlandes Saarbrücken Germany Dept. of Computational Linguistics Universität des Saarlandes Saarbrücken Germany

ISBN: (数字)9783540451273

ISBN: (纸本)3540421173

The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group *** then extend a known semi-decision procedure for CLLS to also deal with group parallelism and thus with beta-reduction constraints. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：