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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

8 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

5 篇 工学
- 5 篇 计算机科学与技术...
- 2 篇 信息与通信工程
- 2 篇 软件工程
- 1 篇 电气工程
4 篇 理学
- 4 篇 数学
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

1 篇 complex networks
1 篇 network models
1 篇 spectral graph t...
1 篇 data mining and ...
1 篇 social networks
1 篇 petri nets
1 篇 densification
1 篇 discrete mathema...
1 篇 graph theory
1 篇 algorithm analys...
1 篇 information stor...

机构

2 篇 yandex moscow
2 篇 ryerson univ on
1 篇 eindhoven univer...
1 篇 purdue universit...
1 篇 university of tw...
1 篇 school of engine...
1 篇 univ potsdam has...
1 篇 buryat state uni...
1 篇 moscow mv lomono...
1 篇 department of ma...
1 篇 moscow inst phys...
1 篇 moscow state uni...
1 篇 moscow institute...
1 篇 fields inst res ...

作者

1 篇 weske mathias
1 篇 anthony bonato
1 篇 pralat pawel
1 篇 paweł prałat
1 篇 michael mitzenma...
1 篇 litvak nelly
1 篇 bonato anthony
1 篇 komjáthy júlia
1 篇 lefortier damien
1 篇 ostroumova liudm...
1 篇 gleich david f.
1 篇 raigorodskii and...
1 篇 kunze matthias
1 篇 samosvat egor
1 篇 meger erin
1 篇 prokhorenkova li...

语言

9 篇 英文

检索条件"任意字段=10th International Workshop on Algorithms and Models for the Web Graph, WAW 2013"

共 9 条记录，以下是1-10 订阅

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

详细简洁

排序：

algorithms and models for the web graph - 10th international workshop, waw 2013, Proceedings

Algorithms and Models for the Web Graph - 10th International...

引用

10th international workshop on algorithms and models for the web graph, waw 2013

ISBN: (纸本)9783319035352

the proceedings contain 17 papers. the topics discussed include: asymmetric distribution of nodes in the spatial preferred attachment model;a spatial preferential attachment model with local clustering;a local clustering algorithm for connection graphs;on the power of adversarial infections in networks;on the choice of kernel and labeled data in semi-supervised learning methods;a nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks;evolution of the media web;random intersection graph process;alpha current flow betweenness centrality;tree nash equilibria in the network creation game;fast low-cost estimation of network properties using random walks;fast algorithms for the maximum clique problem on massive sparse graphs;a faster algorithm to update betweenness centrality after node alteration;and generalized preferential attachment: tunable power-law degree distribution and clustering coefficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

algorithms and models for the web graph: 12th international workshop, waw 2015 Eindhoven, the Netherlands, December 10-11, 2015 Proceedings 12th

Algorithms and Models for the Web Graph: 12th International ...

引用

12th international workshop on algorithms and models for the web graph, waw 2015

作者： Gleich, David F. Komjáthy, Júlia Litvak, Nelly Purdue University West LafayetteIN United States Eindhoven University of Technology Eindhoven Netherlands University of Twente Enschede Netherlands

来源：评论

学校读者我要写书评

暂无评论

8th international workshop on algorithms and models for the web graph, waw 2011

8th International Workshop on Algorithms and Models for the ...

引用

8th international workshop on algorithms and models for the web graph, waw 2011

ISBN: (纸本)9783642212857

the proceedings contain 10 papers. the special focus in this conference is on algorithms and models for the web graph. the topics include: High-ordered random walks and generalized laplacians on hypergraphs;detecting the structure of social networks using (α,β)-communities;latent clustering on graphs with multiple edge types;quick detection of top-k personalized pagerank lists;rank-based models of network structure and the discovery of content;1-local 33/24-competitive algorithm for multicoloring hexagonal graphs;modeling social networks through user background and behavior;dirichlet pagerank and trust-based ranking algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

algorithms and models for the web graph - 8th international workshop, waw 2011, Proceedings

Algorithms and Models for the Web Graph - 8th International ...

引用

8th international workshop on algorithms and models for the web graph, waw 2011, Co-located with the 15th international Conference on Random Structures and algorithms, RSA 2011

ISBN: (纸本)9783642212857

the proceedings contain 10 papers. the topics discussed include: a spectral algorithm for computing social balance;high-ordered random walks and generalized Laplacians on hypergraphs;latent clustering on graphs with multiple edge types;quick detection of top-k personalized pagerank lists;rank-based models of network structure and the discovery of content;1-local 33/24-competitive algorithm for multicoloring hexagonal graphs;modeling social networks through user background and behavior;dirichlet pagerank and trust-based ranking algorithms;and efficient generation of networks with given expected degrees.

关键词：

来源：评论

学校读者我要写书评

暂无评论

algorithms and models for the web graph 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Anthony Bonato Paweł Prałat Michael Mitzenmacher

ISBN: (数字)9783319035369

ISBN: (纸本)9783319035352

this book constitutes the refereed proceedings of the 10th international workshop on algorithms and models for the web graph, waw 2013, held in Cambridge, MA, USA, in December 2013. the 17 papers presented were carefully reviewed and selected for inclusion in this volume. they address topics related to graph-theoretic and algorithmic aspects of related complex networks, including citation networks, social networks, biological networks, molecular networks and other networks arising from the Internet.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery Information Storage and Retrieval

来源：评论

学校读者我要写书评

暂无评论

Iterated Global models for Complex Networks 1

引用

17th international workshop on algorithms and models for the web graph (waw)

作者： Bonato, Anthony Meger, Erin Ryerson Univ Toronto ON Canada

ISBN: (数字)9783030484781

ISBN: (纸本)9783030484774;9783030484781

We introduce the Iterated Global model as a deterministic graph process that simulates several properties of complex networks. In this model, for every set S of nodes of a prescribed cardinality, we add a new node that is adjacent to every node in S. We focus on the case where the size of S is approximately half the number of nodes at each time-step, and we refer to this as the half-model. the half-model provably generate graphs that densify over time, have bad spectral expansion, and low diameter. We derive the clique, chromatic, and domination numbers of graphs generated by the model.

关键词： Network models Social networks Densification Spectral graph theory

来源：评论

学校读者我要写书评

暂无评论

Evolution of the media web

Evolution of the media web

引用

10th international workshop on algorithms and models for the web graph, waw 2013

作者： Lefortier, Damien Ostroumova, Liudmila Samosvat, Egor Yandex Moscow Russia Moscow State University Moscow Russia Moscow Institute of Physics and Technology Moscow Russia

ISBN: (纸本)9783319035352

We present a detailed study of the part of the web related to media content, i.e., the Media web. Using publicly available data, we analyze the evolution of incoming and outgoing links from and to media pages. Based on our observations, we propose a new class of models for the appearance of new media content on the web where different attractiveness functions of nodes are possible including ones taken from well-known preferential attachment and fitness models. We analyze these models theoretically and empirically and show which ones realistically predict both the incoming degree distribution and the so-called recency property of the Media web, something that existing models did not capture well. Finally we compare these models by estimating the likelihood of the real-world link graph from our data set given each model and obtain that models we introduce are significantly more accurate than previously proposed ones. One of the most surprising results is that in the Media web the probability for a post to be cited is determined, most likely, by its quality rather than by its current popularity. © 2013 Springer international Publishing.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

Modularity of Complex Networks models 1

引用

13th international workshop on algorithms and models for the web graph (waw)

作者： Prokhorenkova, Liudmila Ostroumova Pralat, Pawel Raigorodskii, Andrei Moscow Inst Phys & Technol Moscow Russia Yandex Moscow Russia Ryerson Univ Toronto ON Canada Fields Inst Res Math Sci Toronto ON Canada Moscow MV Lomonosov State Univ Moscow Russia Buryat State Univ Ulan Ude Russia

ISBN: (数字)9783319497877

ISBN: (纸本)9783319497877;9783319497860

Modularity is designed to measure the strength of division of a network into clusters (known also as communities). Networks with high modularity have dense connections between the vertices within clusters but sparse connections between vertices of different clusters. As a result, modularity is often used in optimization methods for detecting community structure in networks, and so it is an important graph parameter from practical point of view. Unfortunately, many existing nonspatial models of complex networks do not generate graphs with high modularity;on the other hand, spatial models naturally create clusters. We investigate this phenomenon by considering a few examples from both sub-classes. We prove precise theoretical results for the classical model of random d-regular graphs as well as the preferential attachment model, and contrast these results with the ones for the spatial preferential attachment (SPA) model that is a model for complex networks in which vertices are embedded in a metric space, and each vertex has a sphere of influence whose size increases if the vertex gains an in-link, and

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Visualization of Successor Relations in Business Process models

Visualization of Successor Relations in Business Process Mod...

引用

10th international workshop on web Services and Formal Methods (WS-FM) - Formal Aspects of Service-Oriented and Cloud Computing

作者： Kunze, Matthias Weske, Mathias Univ Potsdam Hasso Plattner Inst D-14482 Potsdam Germany

ISBN: (纸本)9783319082608;9783319082592

Business process models are a central knowledge asset for organizations, as they explicitly capture the knowledge for documentation, analysis, automation, and certification of business processes. Companies maintain an abundance of process models and their reuse requires powerful means to searching them and presenting the search results effectively. Visualizing specific fragments of a process model facilitates comprehension, and can be used to highlight those parts of a process model that have been matched by a query in process model search. In this work, we develop an approach to projecting a successor relation, a characterization of the behavior of a process, on fragments of a process model graph. Our solution is applicable to process models that can be traced back to bounded Petri net systems. For sound, free-choice workflow systems, discovery of these fragments is carried out efficiently.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：