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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

106 篇 会议
4 册 图书
2 篇 期刊文献

馆藏范围

112 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

85 篇 工学
- 83 篇 计算机科学与技术...
- 62 篇 软件工程
- 9 篇 信息与通信工程
- 8 篇 电气工程
- 3 篇 生物医学工程（可授...
- 2 篇 电子科学与技术（可...
- 2 篇 建筑学
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
- 1 篇 农业工程
- 1 篇 生物工程
45 篇 理学
- 42 篇 数学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
2 篇 农学
- 2 篇 作物学
2 篇 医学
- 1 篇 临床医学
- 1 篇 特种医学
2 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

5 篇 graph theory
4 篇 formal languages
3 篇 graph grammar
3 篇 artificial intel...
2 篇 graphs
2 篇 application soft...
2 篇 graph grammars
2 篇 hypergraph
2 篇 computer communi...
2 篇 computer applica...
2 篇 graphic methods
2 篇 graph neural net...
2 篇 specifications
2 篇 directed graphs
2 篇 data structures
2 篇 data structures ...
2 篇 algebra
1 篇 conflict set
1 篇 complex networks
1 篇 computer science

机构

4 篇 rhein westfal th...
2 篇 department of co...
2 篇 department of co...
2 篇 tech univ berlin...
2 篇 dept. of compute...
1 篇 inst natl rech i...
1 篇 inria-loria nanc...
1 篇 national institu...
1 篇 technical univer...
1 篇 human-computer i...
1 篇 univ bundeswehr ...
1 篇 electronics and ...
1 篇 university of or...
1 篇 aarhus univ dept...
1 篇 the university o...
1 篇 department of co...
1 篇 irisa campus de ...
1 篇 univ massachuset...
1 篇 leiden universit...
1 篇 university of te...

作者

4 篇 kreowski hans-jö...
4 篇 schurr a
4 篇 engelfriet joost
3 篇 bunke h
3 篇 drewes frank
3 篇 ehrig hartmut
2 篇 courcelle bruno
2 篇 parisi-presicce ...
2 篇 minas mark
2 篇 gottler h
2 篇 korff m
2 篇 courcelle b
2 篇 habel annegret
2 篇 mayoh b
2 篇 rozenberg grzego...
2 篇 löwe michael
2 篇 de boer martin j...
2 篇 paz a
2 篇 hoffmann berthol...
2 篇 nagl m

语言

111 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=4th International Workshop on Graph Grammars and Their Application to Computer Science, 1990"

共 112 条记录，以下是41-50 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A SPECIFICATION ENVIRONMENT FOR graph-grammars 4th

引用

4th international workshop on graph grammars and their application to computer science

作者： NAGL, M SCHURR, A RHEIN WESTFAL TH AACHEN LEHRSTUHL INFORMAT 3W-5100 AACHENGERMANY

ISBN: (纸本)9783540544784

Modelling environments (e.g. software development environments) offer tools which build up and maintain complex internal data structures. therefore, before implementing such tools, it is advisable for the tool developer to formally specify the structure and the operations of these internal data structures. graph grammars as an operational specification method have been successfully used for this purpose for many years. this paper describes an integrated set of tools for building up, maintaining, analyzing and executing such an internal specification described in the language PROGRESS, a graph grammar based VHL-Language. It sketches the characteristics of the PROGRESS environment, its software architecture, the specification of the environment in the language itself, and the implementation which, for the biggest part, have been generated. the environment will be used for the following two main purposes: (i) for (syntax) checking PROGRESS specifications (at specification time) before implementing an efficiently working system which is equivalent to the specification, and (ii) for rapid prototyping purposes, i.e. for directly executing a specification. the following paper has to be read in connection with /Sc 90a/ of this volume. Whereas /Sc 90a/ introduces the specification language PROGRESS and its methodological application to a small example the following paper concentrates on the environment's user characteristics and the realization of the environment.

关键词： OPERATIONAL SPECIFICATION OF ABSTRACT DATA TYPES BY graph grammars MODELING ENVIRONMENTS, ESPECIALLY SOFTWARE DEVELOPMENT ENVIRONMENTS STATIC (TYPE) CHECKING RAPID PROTOTYPING DATA MODELING INTEGRATED AND INCREMENTAL TOOLS

来源：评论

学校读者我要写书评

暂无评论

thE thEORY OF graphOIDS - A SURVEY 4th

引用

4th international workshop on graph grammars and their application to computer science

作者： PAZ, A TECHNION ISRAEL INST TECHNOL DEPT COMP SCIIL-32000 HAIFAISRAEL

ISBN: (纸本)9783540544784

A survey type presentation, introducing the theory of graphoids and their representation in graphs. graphoids are ternary relations over a finite domain governed by a finite set of axioms. they are intended as models for the representation of irrelevance relations of the form I(X,Z,Y) where (X,Z,Y) in I has the following interpretation: given that the values of the variables in Z are known, the values of the variables in Y can add no further information about the values of the variables in X.

关键词： AXIOMS OF graph AND AXIOMS OF graphOIDS COMPLETENESS graphS graph GRAMMAR DECISION PROPERTIES IRRELEVANCE RELATION KNOWLEDGE REPRESENTATION PROBABILISTIC DISTRIBUTION REPRESENTATION IN graphS SOUNDNESS

来源：评论

学校读者我要写书评

暂无评论

Layout graph grammars: the placement approach 4th

引用

4th international workshop on graph grammars and their application to computer science, 1990

作者： Brandenburg, Franz J. Lehrstuhl für Informatik University of Passau Innstr. 33 PassauD 8390 Germany

ISBN: (纸本)9783540544784

Layout graph grammars are extensions of context-free graph grammars and are introduced as a tool for syntax directed constructions of graph layouts. the constructions are based on a layout specification of the productions, which are consistently transferred to the derivations. the layout specification consists of rules for a placement of the vertices and a partial routing of the edges. It specifies minimal distances between the vertices in X- or Y-dimension. these distances can be optimized according to some formal cost measures. there is a very intuitive visual representation of the layout specifications, which stems from an elegant graphic representation of the graph grammar productions. Alternatively, the layout specifications are expressed in graph theoretic terms, and so are completely integrated into usual graph grammars. the computation of optimal layouts of graphs is a well-known NP-complete problem, even for binary trees. therefore, we design layout graph grammars which guarantee polynomial time constructions of optimal layouts of graphs. this is achieved by the restriction to polynomial graph grammars and layout specifications, which can be computed efficiently by an attributation technique. Hence, layout graph grammars are a new and powerful tool for efficient solutions of graph layout problems. they help jumping accross the NP-completeness barrier. © 1991, Springer Verlag. All rights reserved.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

graphS AS RELATIONAL STRUCTURES - AN ALGEBRAIC AND LOGICAL APPROACH 4th

引用

4th international workshop on graph grammars and their application to computer science

作者： COURCELLE, B UNIV BORDEAUX 1 INFORMAT LABF-33405 TALENCEFRANCE

ISBN: (纸本)9783540544784

Relational structures form a unique framework in which various types of graphs and hypergraphs can be formalized and studied. We define operations on structures that are compatible with monadic second-order logic, and that are powerful enough to represent context-free graph- and hypergraph-grammers of various types, namely, hyperedge replacement, C-edNCE, and separated handle replacement ones. Several results on monadic second-order properties of the generated sets are obtained in a uniform way.

关键词： CONTEXT-FREE graph-GRAMMAR C-EDNCE graph-GRAMMAR graphS graph OPERATION HYPERgraph HYPEREDGE REPLACEMENT MONADIC 2ND-ORDER LOGIC MONADIC 2ND-ORDER DEFINABLE graph TRANSFORMATION RELATIONAL STRUCTURE

来源：评论

学校读者我要写书评

暂无评论

graph REWRITING IN SOME CATEGORIES OF PARTIAL MORPHISMS 4th

引用

4th international workshop on graph grammars and their application to computer science

作者： KENNAWAY, R UNIV E ANGLIA SCH INFORMAT SYSTNORWICH NR4 7TJNORFOLKENGLAND

ISBN: (纸本)9783540544784

We present a definition of term graph rewriting as the taking of a pushout in a category of partial morphisms, adapting the rather ad hoc definitions we gave in [Ken87] so as to use a standard category-theoretic concept of partial morphism. this single-pushout construction is shown to coincide with the well-known double-pushout description of graph rewriting whenever the latter is defined. In general, the conditions for the single pushout to exist are weaker than those required for the double pushout. In some categories of graphs, no conditions at all are necessary.

关键词： graph REWRITING PARTIAL MORPHISM HYPERgraph TERM graph JUNGLE CATEGORY DOUBLE PUSHOUT SINGLE PUSHOUT

来源：评论

学校读者我要写书评

暂无评论

From graph grammars to high level replacement systems 4th

引用

4th international workshop on graph grammars and their application to computer science, 1990

作者： Ehrig, Hartmut Habel, Annegret Kreowski, Hans-Jörg Parisi-Presicce, Francesce Technical University Berlin Franklinstraße 28/29 Berlin 10W-1000 Germany University of Bremen Postfaeh 33 04 40 Bremen 33W-2800 Germany Università degli Studi Aquila Via Vetoio L’Aqulla1-67100 Italy

ISBN: (纸本)9783540544784

the algebraic approach to graph grammars - well-known in the literature for several types of graphs and structures - is extended to include several new types of replacement systems, especially the roplacement of algebraic specifications which were recently introduced for a rule-based approach to modular system design. this leads to the new concept of high level replacement systems which is formulated in an axiomatic algebraic framework based on categories and double-pushouts. In this paper only basic notions like productions, derivations, parallel and sequential independence are introduced for high-level replacement systems leading to Chorch-Rosser and Parallelism theorems previously shown in the literature for special cases only. © 1991, Springer Verlag. All rights reserved.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

graph-reducible term rewriting systems 4th

引用

4th international workshop on graph grammars and their application to computer science, 1990

作者： Plump, Detlef Fachbereich Mathematik und Informatik Universität Bremen Postfach 33 04 40 Bremen 332800 Germany

ISBN: (纸本)9783540544784

Term rewriting is commonly implemented by graph reduction in order to improve efficiency. In general, however, graph reduction is not complete: a term may be not normalizable through graph derivations although a normal form exists. Term rewriting systems which permit a complete implementation by graph reduction are called graph-reducible. We show that the following property is sufficient for graph-reducibility: every term having a normal form can be normalized by parallel term rewrite steps in which a rule is applied to all occurrences of some subterm. As a consequence, a broad class of term rewriting systems which includes all terminating and all orthogonal systems can be shown to be graph-reducible. © 1991, Springer Verlag. All rights reserved.

关键词： Computational mechanics

来源：评论

学校读者我要写书评

暂无评论

15 Years of Triple graph grammars Research Challenges, New Contributions, Open Problems

15 Years of Triple Graph Grammars Research Challenges, New C...

引用

4th international Conference on graph Transformation

作者： Schuerr, Andy Klar, Felix Tech Univ Darmstadt Real Time Syst Lab D-64283 Darmstadt Germany

ISBN: (纸本)9783540874041

Triple graph grammars (TGGs) have been invented 15 years ago as a formalism for the declarative specification of bidirectional graph-to-graph translations. In this paper we present a list of still open problems concerning the interpretation and the expressiveness of TGGs. We will comment on extensions proposed to improve the original approach and the drawbacks that arise thereof. Consequently a more precise formalization of compulsory properties of the translation of triple graph grammars into forward and backward graph translation functions is given. Regarding these properties an interpretation and implementation of negative application conditions is derived that does not destroy the benefits of the original approach. Additionally a new demand-driven forward/backward translation rule application strategy is proposed. It guarantees for the first time automatically a correct ordering of rule applications without imposing any additional requirements on the structure of the regarded graphs.

关键词： triple graph grammars graph translation model transformation rule application

来源：评论

学校读者我要写书评

暂无评论

Collage grammars 4th

引用

4th international workshop on graph grammars and their application to computer science, 1990

作者： Habel, Annegret Kreowski, Hans-Jörg Universität Bremen Faehbereich Mathematik und Informatik Bremen 33W-2800 Germany

ISBN: (纸本)9783540544784

In this paper, we introduce and study the notion of collage grammars. A collage (in our sense) consists essentially of a set of parts being geometric objects and a set of hyperedges being subjects of further replacement. A set of collages represents a set of geometric patterns where each pattern is just the union of the parts of a collage. By overlay of the represented patterns, a set of collages yields a fractai pattern. Finally, collage grammars embody syntactic means for the generation of sets of collages in the usual way. As collages represent patterns that may be overlaid in addition, collage grammars provide also syntactic devices for the generation of sets of patterns as well as a certain type of fractal patterns. © 1991, Springer Verlag. All rights reserved.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Adaptive Star grammars for graph Models

Adaptive Star Grammars for Graph Models

引用

4th international Conference on graph Transformation

作者： Drewes, Frank Hoffmann, Berthold Minas, Mark Umea Univ S-90187 Umea Sweden Univ Bremen Bremen Germany Univ Bundeswehr Munchen Munich Germany

ISBN: (纸本)9783540874041

Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity and associativity of rule application. In this paper, we study how these grammars can be put to practical use for the definition of graph models. We show how to use adaptive star grammars to specify program graphs, models of object-oriented programs that have been devised for investigating refactoring operations. For this, we introduce notational enhancements and one proper extension (application conditions). the program graphs generated by the grammar comprise not only the nested composition of entities, but also scope rules for their declarations. Such properties cannot easily be defined by meta-models like UML, class diagrams. In contrast, adaptive star grammars cover several aspects of class diagrams.

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共12页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：