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

5th international conference on generative programming and component engineering, GPCE'06. Co-located with the 21st international conference on Object-Oriented programming, Systems, Languages, and Applications, OOPSLA 2006

作者： Fontijne, Daniel University of Amsterdam

ISBN: (纸本)1595932372

Geometric Algebra (GA) is an algebra that encodes geometry much better than standard techniques, which are mainly based on linear algebra with various extensions. Compared to standard techniques, GA has clearer semantics and a richer, more consistent language. this expresses itself, among others, in a much greater genericity of functions over the algebra. Exploiting this genericity efficiently is a problem that can be solved through generative *** paper describes our Geometric Algebra Implementation Generator Gaigen 2. Gaigen 2 synthesizes highly efficient GA implementations from the specification of the algebra. Functions over such algebras can be defined in a high-level coordinate-free domain-specific language, and Gaigen 2 transforms these functions into low-level coordinate-based code. this code can be emitted in any target language through a custom back-end. Benchmarks of our implementation show that the combination of GA and Gaigen 2 can rival the performance of standard geometry techniques, despite the greater abstraction and genericity of *** obtain this high performance, Gaigen 2 must adapt the generated code to the program that links to it. this is done via a profiling feedback loop. While running, the generated code makes a connection to the code generator. the generated code sends information about functions that should be optimized. the code generator registers this information and sends back new type information. After the program terminates, the code is regenerated according to the recorded profile. this profiling feedback technique may also be useful to implement other types of algebras. Copyright © 2006 ACM.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

generative design supported by tree based genetic algorithm

Generative design supported by tree based genetic algorithm

引用

6th IEEE international conference on Computer and Information Technology, CIT 2006

作者： Liu, Hong Liu, Xiyu School of Information Science and Engineering Shandong Normal University Jinan 250014 China School of Management Shandong Normal University Jinan 250014 China

ISBN: (纸本)076952687X

this paper presents a novel computational approach that uses tree based genarative algorithm to generate design. this approach is illustrated by a reading lamp design example, which uses general mathematical expressions and tree-based genetic algorithm to generate 2D sketch shapes. then, these 2D sketch shapes are processed to form 3D components and saved in component base. A complex design is produced by combining different components. the result shows that approach is able to generate some innovative solutions and demonstrates the power of computational approach. © 2006 IEEE.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Modeling, validating and automating composition of web services 06

Modeling, validating and automating composition of web servi...

引用

ICWE'06: 6th international conference on Web engineering

作者： Fu, Yujian Dong, Zhijiang He, Xudong Florida International University Miami FL 33199

ISBN: (纸本)1595933522

Current service architecture description language and composition approaches consider simplistic method invocation. they pay less attention to the formal semantics and verification of service composition in the design, and less support property specifications and architecture validation. this paper presents an executable web service architecture model, Service-Oriented Software Architecture Model (SO-SAM), which is an extension of SAM (Software Architecture Model [16]) to the web service applications, and verification of web system properties in the design. SO-SAM describes each web service in terms of component and service composition in terms of connector separately. Furthermore, we validate SO-SAM model to prove that it facilitates the verification and monitoring of web services integration through translation to the Maude programming langauge, a high level language and high performance executable specification with the componentized and object-oriented design, as well as using model checking technique in the system design level. Finally, a case study of the validation of the model is demonstrated.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

generative programming and component engineering - 4th international conference, GPCE 2005, Proceedings

Generative Programming and Component Engineering - 4th Inter...

引用

4th international conference on generative programming and component engineering, GPCE 2005

ISBN: (纸本)3540291385

the proceedings contain 30 papers. the topics discussed include: object-oriented reengineering patterns - an overview;certifiable program generation;efficient code generation for a domain specific language;Bossa Nova: introducing modularity into the Bossa domain-specific language;model compiler construction based on aspect-oriented mechanisms;shadow programming: reasoning about programs using Lexical join point information;generalized type-based disambiguation of meta programs with concrete object syntax;semi-inversion of guarded equations;a generative programming approach to interactive information retrieval: insights and experiences;and optimizing marshalling by run-time program generation.

关键词： Technical presentations

来源：评论

学校读者我要写书评

暂无评论

A modified standard embedding with jumps in nonlinear optimization

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2006年第3期169卷 1185-1206页

作者： Guddat, J Vázquez, G Nowack, D Rückmann, JJ Univ Americas Puebla Escuela Ciencias Cholula 72820 Mexico Humboldt Univ Inst Math D-10099 Berlin Germany

the paper deals with a combination of pathfollowing methods (embedding approach) and feasible descent direction methods (so-called jumps) for solving a nonlinear optimization problem with equality and inequality constraints. Since the method that we propose here uses jumps from one connected component to another one, more than one connected component of the solution set of the corresponding one-parametric problem can be followed numerically. It is assumed that the problem under consideration belongs to a generic subset which was introduced by Jongen, Jonker and Twilt. there already exist methods of this type for which each starting point of a jump has to be an endpoint of a branch of local minimizers. In this paper the authors propose a new method by allowing a larger set of starting points for the jumps which can be constructed at bifurcation and turning points of the solution set. the topological properties of those cases where the method is not successful are analyzed and the role of constraint qualifications in this context is discussed. Furthermore, this new method is applied to a so-called modified standard embedding which is a particular construction without equality constraints. Finally, an algorithmic version of this new method as well as computational results are presented. (c) 2005 Published by Elsevier B.V.

关键词： parametric programming pathfollowing methods with jumps genericity Jongen-Jonker-Twilt regularity modified standard embedding

来源：评论

学校读者我要写书评

暂无评论

Programmed strategies for program verification

Programmed strategies for program verification

引用

6th international Workshop on Reduction Strategies in Rewriting and programming, WRS 2006, as part of the Federated Logic conference, FLoC 2006

作者： Kieburtz, Richard B. OGI School of Science and Engineering OHSU Portland OR United States

Plover is an automated property-verifier for Haskell programs that has been under development for the past three years as a component of the Programatica project. In Programatica, predicate definitions and property assertions written in P-logic, a programming logic for Haskell, can be embedded in the text of a Haskell program module. P-logic properties refine the type system of Haskell but cannot be verified by type-checking alone;a more powerful logical verifier is needed. Plover codes the proof rules of P-logic, and additionally, embeds strategies and decision procedures for their application and discharge. It integrates a reduction system that implements a rewriting semantics for Haskell terms with a congruence-closure algorithm that supports reasoning with equality. It can employ splitting strategies to explore alternative valuations of expressions of type Bool or other finite data types, but these strategies lead to exponential growth of terms and must be employed cautiously. Plover itself is written in Stratego, which has proven to be a powerful language in which to write a verifier. this talk will explain the design and implementation of some of the strategies that enable Plover to comprehend Haskell and to discharge some valid property assertions.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Polychronous mode automata

Polychronous mode automata

引用

6th ACM and IEEE international conference on Embedded Software, EMSOFT 2006

作者： Talpin, Jean-Pierre Brunette, Christian Gautier, thierry Gamatié, Abdoulaye IRISA/INRIA-Rennes Campus de Beaulieu F-35042 Rennes France INRIA Futurs 6b Av. Pierre et Marie Curie 59260 Lezennes France

ISBN: (纸本)1595935428

Among related synchronous programming principles, the model of computation of the POLYCHRONY workbench stands out by its capability to give high-level description of systems where each component owns a local activation clock (such as, typically,distributed real-time systems or systems on a chip). In order to bring the modeling capability of POLYCHRONY to the context of a model-driven engineering toolset for embedded system design, we define a diagramic notation composed of mode automata and data-flow equations on top of the multi-clocked synchronous model of computation supported by the POLYCHRONY workbench. We demonstrate the agility of this paradigm by considering the example of an integrated modular avionics application. Our presentation features the formalization and use of model transformation techniques of the GME environment to embed the extension of POLYCHRONY's meta-model with mode automata. Copyright 2006 ACM.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

A modified standard embedding with jumps in nonlinear optimization

A modified standard embedding with jumps in nonlinear optimi...

引用

6th international conference on Industrial engineering and Production Management

作者： Guddat, J Vázquez, G Nowack, D Rückmann, JJ Univ Americas Puebla Escuela Ciencias Cholula 72820 Mexico Humboldt Univ Inst Math D-10099 Berlin Germany

关键词： parametric programming pathfollowing methods with jumps genericity Jongen-Jonker-Twilt regularity modified standard embedding

来源：评论

学校读者我要写书评

暂无评论

Workflow deployment in ICENI II

引用

6th international conference on Computational Science (ICCS 2006)

作者： McGough, A. Stephen Lee, William Darlington, John Univ London Imperial Coll Sci Technol & Med Dept Comp London Esci Ctr London SW7 2AZ England

ISBN: (纸本)3540343830

the Imperial College e-Science Networked Infrastructure (ICENI) has been developed by the London e-Science Centre for over four years. ICENI has prototyped many novel ideas for providing an end to end Grid middleware. this has included: service-oriented architecture, component programming model, retaining and using meta-data collected throughout the life-cycle of an application, and scheduling algorithms which are aware of workflow and performance data. In this paper we describe the workflow pipeline and deployment process of ICENI II. this allows the user to specify their workflow at an abstract level which is fed through the pipeline in order to successfully deploy it over the Grid. the tool sets, which make up the stages of the ICENI II pipeline, are designed to be composable in an a-la-carte fashion. thus allowing Grid developers to select only those components which are relevant for their work. When these tool sets are composed together they form the higher level services required to make the Grid useful to the end user.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Tutorial on generative Software Development

Tutorial on Generative Software Development

引用

international Software Product Line conference (SPLC)

作者： K. Czarnecki University of Waterloo Canada

Software product line engineering (SPLE) [5] seeks to exploit the commonalities among systems from a given problem domain while managing the variabilities among them in a systematic way. In SPLE, new system variants can be rapidly created based on a set of reusable assets, such as a common architecture, components, and models. generative software development [6] aims at modeling and implementing product lines in such a way that a given system can be automatically generated from a specification written in one or more textual or graphical domain-specific languages (DSLs) [13, 4, 15, 8, 3, 1, 12, 14].

关键词： Tutorial programming Computer architecture Production facilities Computer science Application software engineering management DSL Ontologies Software tools

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：