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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是21-30 订阅

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

详细简洁

排序：

Relaxed conditional statistical shape models and their application to non-contrast liver segmentation

Relaxed conditional statistical shape models and their appli...

引用

4th international workshop on Computational and Clinical applications in Abdominal Imaging, Held in Conjunction with the 15th international Conference on Medical Image Computing and computer-Assisted Intervention, MICCAI 2012

作者： Tomoshige, Sho Oost, Elco Shimizu, Akinobu Watanabe, Hidefumi Kobatake, Hidefumi Nawano, Shigeru Graduate School of Bio-Applications and Systems Engineering Tokyo University of Agriculture and Technology Nakacho 2-24-16 Koganei-shi Tokyo 184-8588 Japan Department of Radiology International University of Health and Welfare Mita Hospital 1-4-3 Mita Minato-ku Tokyo 108-8329 Japan

ISBN: (纸本)9783642336119

this paper proposes a novel conditional statistical shape model (SSM) that allows a relaxed conditional term. the method is based on the selection formula and allows a seamless transition between the non-conditional SSM and the conventional conditional SSM. Unlike a conventional conditional SSM, the relaxed conditional SSM can take the reliability of the condition into account. Organ shapes estimated by the proposed SSM were used as shape priors for graph Cut based segmentation. Results for liver shape estimation and subsequent liver segmentation show the benefit of the proposed model over conventional conditional SSMs. © 2012 Springer-Verlag.

关键词： graphic methods

来源：评论

学校读者我要写书评

暂无评论

Web-Age Information Management - WAIM 2012 international workshops: GDMM, IWSN, MDSP, USDM, and XMLDM, Proceedings

Web-Age Information Management - WAIM 2012 International Wor...

引用

Int. workshops on Web-Age Information Management, WAIM 2012: 1st Int. workshop on GDMM 2012, 2nd Int. Wireless Sensor Networks workshop, IWSN 2012, 1st Int. workshop on MDSP 2012, 3rd Int. workshop on USDM 2012, 4th Int. workshop on XMLDM 2012

ISBN: (纸本)9783642330490

the proceedings contain 34 papers. the topics discussed include: algebra for parallel xquery processing;graph-structured data compression based on frequent subgraph contraction;privacy preserving reverse nearest-neighbor queries processing on road network;wikipedia revision graph extraction based on N-gram cover;wireless nerve: invisible anti-theft system in wireless sensor network;a spatial-temporal model for the malware propagation in MWSNs based on the reaction-diffusion equations;the application of a node-localization algorithm of wireless sensor network in intelligent transportation system;parallel network virtualization resource management system;the analysis of priority-based slotted CSMA/CA algorithm in IEEE 802.15.4 sensor network;QoI-based data gathering and routing guidance in VANETs;PTL: partitioned logging for database storage on flash solid state drives;and adaptation mechanism of iSCSI protocol for NAS storage solution in wireless environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Network analysis on provenance graphs from a crowdsourcing application

Network analysis on provenance graphs from a crowdsourcing a...

引用

4th international Provenance and Annotation workshop, IPAW 2012

作者： Ebden, Mark Huynh, Trung Dong Moreau, Luc Ramchurn, Sarvapali Roberts, Stephen Department of Engineering Science University of Oxford Oxford OX1 3PJ United Kingdom Electronics and Computer Science University of Southampton Southampton SO17 1BJ United Kingdom

ISBN: (纸本)9783642342219

Crowdsourcing has become a popular means for quickly achieving various tasks in large quantities. CollabMap is an online mapping application in which we crowdsource the identification of evacuation routes in residential areas to be used for planning large-scale evacuations. So far, approximately 38,000 micro-tasks have been completed by over 100 contributors. In order to assist with data verification, we introduced provenance tracking into the application, and approximately 5,000 provenance graphs have been generated. they have provided us various insights into the typical characteristics of provenance graphs in the crowdsourcing context. In particular, we have estimated probability distribution functions over three selected characteristics of these provenance graphs: the node degree, the graph diameter, and the densification exponent. We describe methods to define these three characteristics across specific combinations of node types and edge types, and present our findings in this paper. applications of our methods include rapid comparison of one provenance graph versus another, or of one style of provenance database versus another. Our results also indicate that provenance graphs represent a suitable area of exploitation for existing network analysis tools concerned with modelling, prediction, and the inference of missing nodes and edges. © 2012 Springer-Verlag.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

graph grammars and the application in Proposition Calculus

Graph Grammars and The Application in Proposition Calculus

引用

2011 4th IEEE international Conference on computer science and Information Technology(ICCSIT 2011)

作者： Han Ding Yi Wang GeJing Xu Bo Hang School of Mathematical and Computer Sciences Xiang Fan University

ISBN: (纸本)9781612848334

Based on graph grammar theory and Edge-Based Context-Sensitive graph Grammar (EGG), this paper construct a graphical proposition calculus process by graphic the propositional formulas and the equivalent *** order to construct automated calculation process for a proposition formula, we make a brief analysis of the connecting-word calculation priority and the rules-selection priority and methods.

关键词： proposition calculus graph grammar graphical

来源：评论

学校读者我要写书评

暂无评论

Identifying infeasible GUI test cases using support vector machines and induced grammars

Identifying infeasible GUI test cases using support vector m...

引用

workshop on Requirements and Validation, Verification, and Testing

作者： Gove, Robert Faytong, Jorge Human-Computer Interaction Lab University of Maryland College Park MD United States Institute for Advanced Computer Studies University of Maryland College Park MD United States Department of Computer Science University of Maryland College Park MD United States

ISBN: (纸本)9780769543451

Model-based GUI software testing is an emerging paradigm for automatically generating test suites. In the context of GUIs, a test case is a sequence of events to be executed which may detect faults in the application. However, a test case may be infeasible if one or more of the events in the event sequence are disabled or made inaccessible by a previously executed event (e.g., a button may be disabled until another GUI widget enables it). these infeasible test cases terminate prematurely and waste resources, so software testers would like to modify the test suite execution to run only feasible test cases. Current techniques focus on repairing the test cases to make them feasible, but this relies on executing all test cases, attempting to repair the test cases, and then repeating this process until a stopping condition has been met. We propose avoiding infeasible test cases altogether by predicting which test cases are infeasible using two supervised machine learning methods: support vector machines (SVMs) and grammar induction. We experiment with three feature extraction techniques and demonstrate the success of the machine learning algorithms for classifying infeasible GUI test cases in several subject applications. We further demonstrate a level of robustness in the algorithms when training and classifying test cases of different lengths. © 2011 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Efficient graph Reachability Query Answering Using Tree Decomposition

Efficient Graph Reachability Query Answering Using Tree Deco...

引用

4th international workshop on Reachability Problems

作者： Wei, Fang Univ Freiburg Dept Comp Sci D-7800 Freiburg Germany

ISBN: (纸本)9783642153488

Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data processing, ontology reasoning and bioinformatics. In this paper, we present a novel indexing method based on the concept of tree decomposition. We show analytically that this intuitive approach is both time and space efficient. We demonstrate empirically the efficiency and the effectiveness of our method.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

WALCOM: Algorithms and Computation - 4th international workshop, WALCOM 2010, Proceedings

WALCOM: Algorithms and Computation - 4th International Works...

引用

4th international workshop on Algorithms and Computation, WALCOM 2010

ISBN: (纸本)3642114393

the proceedings contain 27 papers. the topics discussed include: crossings between curves with many tangencies;approximation algorithms for art gallery problems in polygons and terrains;the Hamiltonian augmentation problem and its applications to graph drawing;small grid drawings of planar graphs with balanced bipartition;computation of non-dominated points using compact voronoi diagrams;a simple algorithm for approximate partial point set pattern matching under rigid motion;reconstruction algorithm for permutation graphs;parallel algorithms for encoding and decoding blob code;a simple and faster branch-and-bound algorithm for finding a maximum clique;the covert set-cover problem with application to network discovery;real root isolation of multi-exponential polynomials with application;and a simple and fast algorithm for maximum independent set in 3-degree graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the Covert Set-Cover Problem with application to Network Discovery

The Covert Set-Cover Problem with Application to Network Dis...

引用

4th international workshop on Algorithms and Computation (WALCOM 2010)

作者： Sen, Sandeep Muralidhara, V. N. Indian Inst Technol Dept Comp Sci & Engn Delhi India

ISBN: (纸本)9783642114397

We address a. version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We want to find a small set-cover using a minimal number of such queries. We present a Monte Carlo randomized algorithm that approximates an optimal set-cover of size OPT within O(log N) factor with high probability using O(OPT . log(2) N) queries where N is the number of elements in the universal set. We apply this technique to the network discovery problem that involves certifying all the edges and non-edges of an unknown n-vertices graph based on layered-graph queries from a minimal number of vertices. By reducing it to the covert set-cover problem we present an O(log(2) n)-competitive Monte Carlo randomized algorithm for the covert version of network discovery problem. the previously best known algorithm has a competitive ratio of Omega(root n log n) and therefore our result achieves an exponential improvement.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：