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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
2 篇 期刊文献
1 册 图书

馆藏范围

109 篇 电子文献
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
2 篇 graphs
2 篇 application soft...
2 篇 graph grammars
2 篇 hypergraph
2 篇 graphic methods
2 篇 graph neural net...
2 篇 specifications
2 篇 directed graphs
2 篇 data structures
2 篇 algebra
1 篇 conflict set
1 篇 complex networks
1 篇 computer science
1 篇 performance
1 篇 maximal independ...
1 篇 attribute gramma...
1 篇 network-on-a-chi...

机构

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 篇 technical univer...
1 篇 human-computer i...
1 篇 univ bundeswehr ...
1 篇 electronics and ...
1 篇 university of or...
1 篇 aarhus univ dept...
1 篇 department of co...
1 篇 irisa campus de ...
1 篇 univ massachuset...
1 篇 leiden universit...
1 篇 univ bordeaux 1 ...
1 篇 department of co...
1 篇 lif-université d...

作者

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

语言

108 篇 英文
1 篇 其他
1 篇 中文

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

共 109 条记录，以下是11-20 订阅

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

详细简洁

排序：

Sketching Data Structures for Massive graph Problems 4th

Sketching Data Structures for Massive Graph Problems

引用

international workshop on Polystores and other Systems for Heterogeneous Data, Poly 2018 and 4th international workshop on Data Management and Analytics for Medicine and Health Care, DMAH 2019 held in conjunction with 44th international Conference on Very Large Data Bases, VLDB 2018

作者： Lopes, Juan P. A. Oliveira, Fabiano S. Pinto, Paulo E. D. Barbosa, Valmir C. Federal University of Rio de Janeiro Rio de Janeiro Brazil State University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9783030141769

In this work, we explore the application of sketching data structures to solve problems in graphs that do not fit entirely in memory. these structures allow compact representations of data, admitting some probability of failure. We aim at the implicit representation and dynamic connectivity problems. Our contributions include two new probabilistic implicit representations, one that uses Bloom filters and allows representing sparse graphs with O(|E|) bits, and another that uses MinHash sketches and represents trees with O(|V|) bits. We also describe a variant of an -sampling sketch that allows proving a tighter upper bound on the failure probability of sampling. © 2019, Springer Nature Switzerland AG.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Integration of CUDA processing within the C++ library for parallelism and concurrency (HPX) 4

Integration of CUDA processing within the C++ library for pa...

引用

4th IEEE/ACM international workshop on Extreme Scale Programming Models and Middleware, ESPM2 2018

作者： Diehl, Patrick Seshadri, Madhavan Heller, thomas Kaiser, Hartmut Center for Computation and Technology Louisiana State University LA United States Nanyang Technological University Singapore Department of Computer Science Friedrich-Alexander-University Erlangen-Nürnberg Germany Department of Computer Science Louisiana State University LA United States Stellar Group United States

ISBN: (纸本)9781728101781

Experience shows that on today's high performance systems the utilization of different acceleration cards in conjunction with a high utilization of all other parts of the system is difficult. Future architectures, like exascale clusters, are expected to aggravate this issue as the number of cores are expected to increase and memory hierarchies are expected to become deeper. One big aspect for distributed applications is to guarantee high utilization of all available resources, including local or remote acceleration cards on a cluster while fully using all the available CPU resources and the integration of the GPU work into the overall programming model. For the integration of CUDA code we extended HPX, a general purpose C++ run time system for parallel and distributed applications of any scale, and enabled asynchronous data transfers from and to the GPU device and the asynchronous invocation of CUDA kernels on this data. Both operations are well integrated into the general programming model of HPX which allows to seamlessly overlap any GPU operation with work on the main cores. Any user defined CUDA kernel can be launched on any (local or remote) GPU device available to the distributed application. We present asynchronous implementations for the data transfers and kernel launches for CUDA code as part of a HPX asynchronous execution graph. Using this approach we can combine all remotely and locally available acceleration cards on a cluster to utilize its full performance capabilities. Overhead measurements show, that the integration of the asynchronous operations (data transfer + launches of the kernels) as part of the HPX execution graph imposes no additional computational overhead and significantly eases orchestrating coordinated and concurrent work on the main cores and the used GPU devices. © 2018 IEEE.

关键词： graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

On the role of the graph clause in the performance of federated SPARQL queries 4

On the role of the GRAPH clause in the performance of federa...

引用

4th international workshop on Dataset PROFIling and fEderated Search for Web Data, PROFILES 2017

作者： Chaves-Fraga, David Gutierrez, Claudio Corcho, Oscar Ontology Engineering Group Universidad Politénica de Madrid Spain Computer Science Department CIWS Universidad de Chile Chile

Federated SPARQL queries give unified answers from multiple and distributed SPARQL endpoints. A good example may be the collection of stops from different transport companies in the same city to create a route planning application. the performance of the evaluation of these types of queries is usually poor, a fact that makes difficult their use in real-life applications that need good performance requirements. In this paper we present a preliminary analysis on the improvement that can be achieved by using the graph clause in federated SPARQL queries. the main goal is to reduce the search space of such queries by setting the NAMED graph to the graph pattern where the corresponding patterns should be evaluated. We perform a preliminary comparison between a federated query and a rewriting that uses systematically the graph clause. these experiments show that the inclusion of the graph clause may only improve performance of query evaluation between 5% and 10%. these early findings suggest that, although the graph clause may indeed play a role in speeding up federated SPARQL queries, hurdles are yet to be overcome when using the graph clause as named graphs are semantically ambiguous.

关键词： Federated queries graph Performance SPARQL

来源：评论

学校读者我要写书评

暂无评论

Algorithms for Regular Tree Grammar Network Search and their application to Mining Human-Viral Infection Patterns 1

引用

15th international workshop on Algorithms in Bioinformatics (WABI)

作者： Smoly, Ilan Carmel, Amir Shemer-Avni, Yonat Yeger-Lotem, Esti Ziv-Ukelson, Michal Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Ben Gurion Univ Negev Dept Virol IL-84105 Beer Sheva Israel Ben Gurion Univ Negev Dept Clin Biochem & Pharmacol IL-84105 Beer Sheva Israel

ISBN: (数字)9783662482216

ISBN: (纸本)9783662482216;9783662482209

Network querying is a powerful approach to mine molecular interaction networks. Most network querying tools support queries in the form of a template sub-network, in case of topology-constrained queries, or a set of colored vertices in case of topology-free queries. A third approach is grammar-based queries, which are more flexible and expressive as they allow the addition of logic rules to the query. Previous grammar-based querying tools defined queries via string grammars and identified paths in graphs. In this paper, we extend the scope of grammar-based queries to regular tree grammar (RTG), and the scope of the identified sub-graphs from paths to trees. We introduce a new problem and propose a novel algorithm to search a given graph for the k highest scoring sub-graphs matching a tree accepted by an RTG. Our algorithm is based on dynamic programming and combines an extension to k-best parsing optimization with color coding. We implement the new algorithm and exemplify its application to mining the human-viral interaction network. Our code is available at http://***/(similar to)smolyi/RTGnet/.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

RDF-SQ: Mixing parallel and sequential computation for top-down OWL RL inference 4th

引用

4th international workshop on graph Structures for Knowledge Representation and Reasoning, GKR 2015

作者： Urbani, Jacopo Jacobs, Ceriel Department of Computer Science VU University Amsterdam Amsterdam Netherlands Max Planck Institute for Informatics Saarbruecken Germany

ISBN: (纸本)9783319287010

the size and growth rate of the Semantic Web call for querying and reasoning methods that can be applied over very large amounts of data. In this paper, we discuss how we can enrich the results of queries by performing rule-based reasoning in a top-down fashion over large RDF knowledge bases. this paper focuses on the technical challenges involved in the topdown evaluation of the reasoning rules. First, we discuss the application of well-known algorithms in the QSQ family, and analyze their advantages and drawbacks. then, we present a new algorithm, called RDF-SQ, which re-uses different features of the QSQ algorithms and introduces some novelties that target the execution of the OWL-RL rules. We implemented our algorithm inside the QueryPIE prototype and tested its performance against QSQ-R, which is the most popular QSQ algorithm, and a parallel variant of it, which is the current state-of-theart in terms of *** used a large LUBM dataset with ten billion triples, and our tests show that RDF-SQ is significantly faster and more efficient than the competitors in almost all cases. © Springer international Publishing Switzerland 2015.

关键词： Resource Description Framework (RDF)

来源：评论

学校读者我要写书评

暂无评论

RecLAK: Analysis and recommendation of interlinking datasets 4

RecLAK: Analysis and recommendation of interlinking datasets

引用

4th international Conference on Learning Analytics and Knowledge, LAK 2014

作者： Lopes, Giseli Rabello Leme, Luiz André P. Paes Nunes, Bernardo Pereira Casanova, Marco A. Departament of Informatics PUC-Rio Rio-de Janeiro/RJ Brazil Computer Science Institute UFF Niterói/RJ Brazil

this paper presents the RecLAK, a Web application developed for the LAK Challenge 2014. RecLAK focuses on the analysis of the LAK dataset metadata and provides recommendations of potential candidate datasets to be interlinked with the LAK dataset. RecLAK follows an approach to generate recommendations based on Bayesian classifiers and on Social Networks Analysis measures. Furthermore, RecLAK generates graph visualizations that explore the LAK dataset over other datasets in the Linked Open Data cloud. the results of the experiments contribute to the understanding and improvement of the LAK dataset. Furthermore, it can also help researchers of the fields covered by LAK dataset, such as learning analytics and educational data mining. Copyright © 2014 for the individual papers by the papers' authors.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Machine Learning in Medical Imaging - 4th international workshop, MLMI 2013, Held in Conjunction with MICCAI 2013, Proceedings

Machine Learning in Medical Imaging - 4th International Work...

引用

4th international workshop on Machine Learning in Medical Imaging, MLMI 2013, Held in Conjunction with 16th international Conference on Medical Image Computing and computer Assisted Intervention, MICCAI 2013

ISBN: (纸本)9783319022666

the proceedings contain 32 papers. the topics discussed include: unsupervised deep learning for hippocampus segmentation in 7.0 Tesla MR images;integrating multiple network properties for MCI identification;learning-boosted label fusion for multi-atlas auto-segmentation;volumetric segmentation of key fetal brain structures in 3D ultrasound;fully automatic detection of the carotid artery from volumetric ultrasound images using anatomical position-dependent LBP features;a transfer-learning approach to image segmentation across scanners by maximizing distribution similarity;a Bayesian algorithm for image-based time-to-event prediction;patient-specific manifold embedding of multispectral images using kernel combinations;fMRI analysis with sparse Weisfeiler-lehman graph statistics;patch-based segmentation without registration: application to knee MRI;thickness NETwork (thickNet) features for the detection of prodromal AD;and temporally dynamic resting-state functional connectivity networks for early MCI identification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards an automated 3D reconstruction of plant architecture

Towards an automated 3D reconstruction of plant architecture

引用

4th international Symposium on applications of graph Transformations with Industrial Relevance, AGTIVE 2011

作者： Schöler, Florian Steinhage, Volker Institute of Computer Science III University of Bonn Römerstraße 164 53117 Bonn Germany

ISBN: (纸本)9783642341755

Non-destructive and quantitative analysis and screening of plant phenotypes throughout plants' lifecycles is essential to enable greater efficiency in crop breeding and to optimize decision making in crop management. In this contribution we propose graph grammars within a sensor-based system approach to the automated 3D reconstruction and semantic annotation of plant architectures. the plant architectures in turn will serve for reliable plant phenotyping. More specifically, we propose to employ Relational Growth grammars to derive semantically annotated 3D reconstruction hypotheses of plant architectures from 3D sensor data, i.e., laser range measurements. Furthermore, we suggest deriving optimal reconstruction hypotheses by embedding the graph grammar-based data interpretation within a sophisticated probabilistic optimization framework, namely a Reversible Jump Markov Chain Monte Carlo sampling. this paper presents the design of the overall system framework with the graph grammar-based data interpretation as the central component. Furthermore, we present first system improvements and experimental results achieved in the application domain of grapevine breeding. © 2012 Springer-Verlag.

关键词： Crops

来源：评论

学校读者我要写书评

暂无评论

Contextual hyperedge replacement

Contextual hyperedge replacement

引用

4th international Symposium on applications of graph Transformations with Industrial Relevance, AGTIVE 2011

作者： Drewes, Frank Hoffmann, Berthold Minas, Mark Umeå Universitet Sweden DFKI Bremen Universität Bremen Germany Universität der Bundeswehr München Germany

ISBN: (纸本)9783642341755

In model-driven design, the structure of software is commonly specified by meta-models like uml class diagrams. In this paper we study how graph grammars can be used for this purpose, using statecharts as an example. We extend context-free hyperedge-replacement-which is not powerful enough for this application-so that rules may not only access the nodes attached to the variable on their left-hand side, but also nodes elsewhere in the graph. Although the resulting notion of contextual hyperedge replacement preserves many properties of the context-free case, it has considerably more generative power-enough to specify software models that cannot be specified by class diagrams. © 2012 Springer-Verlag.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

From UML class diagrams to OWL ontologies: A graph transformation based Approach

From UML class diagrams to OWL ontologies: A graph transform...

引用

4th international Conference on Web and Information Technologies, ICWIT 2012

作者： Belghiat, Aissam Bourahla, Mustapha Department of Computer Science University of Md Boudiaf Msila 28000 Algeria

Models are placed by modeling paradigm at the center of development process. these models are represented by languages, like UML the language standardized by the OMG which became necessary for development. Moreover the ontology engineering paradigm places ontologies at the center of development process, in this paradigm we find OWL (the description language adopted by a great community of users) the principal language for knowledge representation. the bridging between UML and OWL appeared on several regards such as the classes and associations. In this paper, we propose an approach based graph transformation and registered in the MDA architecture for the automatic generation of OWL ontologies from UML class diagrams. the transformation is based on transformation rules;the level of abstraction in these rules is close to the application in order to have usable ontologies.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：