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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
9 册 图书

馆藏范围

337 篇 电子文献
4 种 纸本馆藏

日期分布

学科分类号

336 篇 工学
- 336 篇 计算机科学与技术...
- 107 篇 信息与通信工程
- 18 篇 软件工程
130 篇 理学
- 130 篇 数学

主题

12 篇 event-b
10 篇 multi-objective ...
8 篇 genetic programm...
8 篇 evolutionary alg...
7 篇 computers
6 篇 refinement
6 篇 formal methods
6 篇 runtime analysis
5 篇 reinforcement le...
5 篇 approximation al...
5 篇 robots
5 篇 combinatorial op...
5 篇 verification
4 篇 graph algorithms
4 篇 deep learning
4 篇 model checking
4 篇 abstract state m...
4 篇 graph theory
4 篇 theory
4 篇 machine learning

机构

6 篇 sorbonne univ li...
5 篇 swiss fed inst t...
5 篇 univ bergen dept...
5 篇 eindhoven univ t...
5 篇 univ southampton...
5 篇 zhejiang univ ui...
4 篇 univ utrecht utr...
4 篇 charles univ pra...
4 篇 univ tokyo jfli ...
4 篇 univ dusseldorf ...
3 篇 tech univ darmst...
3 篇 slovak acad sci ...
3 篇 univ warsaw inst...
3 篇 univ primorska f...
3 篇 ryerson univ dep...
3 篇 beijing univ tec...
3 篇 univ milan dipar...
3 篇 beijing univ tec...
3 篇 warsaw univ tech...
3 篇 itmo univ st pet...

作者

6 篇 doerr carola
6 篇 leuschel michael
5 篇 schewe klaus-die...
5 篇 doerr benjamin
4 篇 neumann frank
4 篇 coello carlos a....
4 篇 butler michael
4 篇 back thomas
4 篇 liefooghe arnaud
4 篇 hoang thai son
4 篇 riccobene elvini...
3 篇 neumann aneta
3 篇 bloznelis mindau...
3 篇 sudo yuichi
3 篇 yao xin
3 篇 ait-ameur yamine
3 篇 taubenfeld gadi
3 篇 bossek jakob
3 篇 snook colin
3 篇 paulusma daniel

语言

336 篇 英文
5 篇 中文

检索条件"丛书名=Lecture Notes in Computer Science - Theoretical Computer Science and General Issues"

共 341 条记录，以下是71-80 订阅

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

详细简洁

排序：

A Framework for Accelerating Graph Convolutional Networks on Massive Datasets 10th

A Framework for Accelerating Graph Convolutional Networks on...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Li, Xiang Jin, Ruoming Ramnath, Rajiv Agrawal, Gagan Ohio State Univ Columbus OH 43210 USA Kent State Univ Kent OH USA Augusta Univ Augusta GA USA

ISBN: (纸本)9783030914349;9783030914332

In recent years, there has been much interest in Graph Convolutional Networks (GCNs). There are several challenges associated with training GCNs. Particularly among them, because of massive scale of graphs, there is not only a large computation time, but also the need for partitioning and loading data multiple times. This paper presents a different framework in which existing GCN methods can be accelerated for execution on large graphs. Building on top of ideas from metalearning we present an optimization strategy. This strategy is applied to three existing frameworks, resulting in new methods that we refer to as GraphSage++, ClusterGCN++, and GraphSaint++. Using graphs with order of 100 million edges, we demonstrate that we reduce the overall training time by up to 30%, while not having a noticeable reduction in F1 scores in most cases.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Distance Labeling for Planar Graphs 28th

Fault-Tolerant Distance Labeling for Planar Graphs

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Bar-Natan, Aviv Charalampopoulos, Panagiotis Gawrychowski, Pawel Mozes, Shay Weimann, Oren Univ Haifa Haifa Israel Interdisciplinary Ctr Herzliya Herzliyya Israel Univ Wroclaw Wroclaw Poland

ISBN: (纸本)9783030795269;9783030795276

In fault-tolerant distance labeling we wish to assign short labels to the vertices of a graph G such that from the labels of any three vertices u, v, f we can infer the u-to-v distance in the graph G\ {f}. We show that any directed weighted planar graph (and in fact any graph in a graph family with O(root n)-size separators, such as minor-free graphs) admits fault-tolerant distance labels of size O(n(2/3)). We extend these labels in a way that allows us to also count the number of shortest paths, and provide additional upper and lower bounds for labels and oracles for counting shortest paths.

关键词： Forbidden-set distance labels Planar graphs Fault-tolerant distance labels Counting shortest paths

来源：评论

学校读者我要写书评

暂无评论

Approximation Algorithms for the Lower Bounded Correlation Clustering Problem 10th

Approximation Algorithms for the Lower Bounded Correlation C...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Ji, Sai Dong, Yinhong Du, Donglei Xu, Dachuan Chinese Acad Sci Acad Math & Syst Sci Beijing 100190 Peoples R China SouthCentral Univ Nat Sch Management Wuhan 430074 Hubei Peoples R China Univ New Brunswick Fac Business Adm Fredericton NB E3B 5A3 Canada Beijing Univ Technol Beijing Inst Sci & Engn Comp Beijing 100124 Peoples R China

ISBN: (纸本)9783030914349;9783030914332

Lower bounded correlation clustering problem is a generalization of the classical correlation clustering problem, which has many applications in protein interaction networks, cross-lingual link detection, and communication networks, etc. In the lower bounded correlation clustering problem, we are given a complete graph and an integer L. Each edge is labelled either by a positive sign + or a negative sign - whenever the two endpoints of the edge are similar or dissimilar respectively. The goal of this problem is to partition the vertex set into several clusters, subject to an lower bound L on the sizes of clusters so as to minimize the number of disagreements, which is the total number of the edges with positive labels between clusters and the edges with negative labels within clusters. In this paper, we propose the lower bounded correlation clustering problem and formulate the problem as an integer program. Furthermore, we provide two polynomial time algorithms with constant approximate ratios for the lower bounded correlation clustering problem on some special graphs.

关键词： Lower bounded Correlation clustering Approximation algorithm Polynomial time

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Technique for Fake News Detection Using Text-Based Word Vector Representation 10th

Machine Learning Technique for Fake News Detection Using Tex...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Gaurav, Akshat Gupta, B. B. Hsu, Ching-Hsien Castiglione, Arcangelo Chui, Kwok Tai Ronin Inst Montclair NJ 07043 USA Natl Inst Technol Kurukshetra Kurukshetra 136119 Haryana India Asia Univ Dept Comp Sci & Informat Engn Taichung Taiwan Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Minxiong Taiwan Univ Salerno Salerno Italy Hong Kong Metropolitan Univ Sch Sci & Technol Dept Technol Hong Kong Peoples R China

ISBN: (纸本)9783030914349;9783030914332

In the modern era, social media has taken off, and more individuals may now utilise it to communicate and learn about current events. Although people get much of their information online, some of the Internet news is questionable and even deceptively presented. It is harder to distinguish fake news from the real news as it is sent about in order to trick readers into believing fabricated information, making it increasingly difficult for detection algorithms to identify fake news based on the material that is shared. As a result, an urgent demand for machine learning (ML), deep learning, and artificial intelligence models that can recognize fake news arises. The linguistic characteristics of the news provide a simple method for detecting false news, which the reader does not need to have any additional knowledge to make use of. We discovered that NLP techniques and text-based word vector representation may successfully predict fabricated news using a machine learning approach. In this paper, on datasets containing false and genuine news, we assessed the performance of six machine learning models. We evaluated model performance using accuracy, precision, recall, and F1-score.

关键词： Machine learning NLP LR SVM Linear regression Fake news

来源：评论

学校读者我要写书评

暂无评论

Twitter Analysis of Covid-19 Misinformation in Spain 10th

Twitter Analysis of Covid-19 Misinformation in Spain

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Saby, Diego Philippe, Olivier Buslon, Nataly del Valle, Javier Puig, Oriol Salaverria, Ramon Jose Rementeria, Maria Barcelona Supercomp Ctr Barcelona Spain Univ Navarra Pamplona Spain

ISBN: (纸本)9783030914349;9783030914332

A graph analysis on the tweets and users networks from a set of curated news was done to study the existing difference in communication patterns between legitimate and misinformation news. Our findings suggest there is no difference in the influence of misinformation and legitimate news but misinformation news tend to be more shared and present than legitimate news, meaning that while misinformation tweets do not have more influence, their authors are more prolific. Misinformation reach wider audience even if the tweets, individually, are not more influential. A subsequent qualitative analysis on the users reveal that there is also influence of misinformation spreading in Spain from other Spanish speaking countries.

关键词： Misinformation diffusion Twitter influence Network analysis

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Scheduling in the Congested Clique 28th

Near-Optimal Scheduling in the Congested Clique

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Censor-Hillel, Keren Maus, Yannic Polosukhin, Volodymyr Technion Haifa Israel

ISBN: (纸本)9783030795269;9783030795276

This paper provides three nearly-optimal algorithms for scheduling t jobs in the CLIQUE model. First, we present a deterministic scheduling algorithm that runs in O(GlobalCongestion + dilation) rounds for jobs that are sufficiently efficient in terms of their memory. The dilation is the maximum round complexity of any of the given jobs, and the GlobalCongestion is the total number of messages in all jobs divided by the per-round bandwidth of n(2) of the CLIQUE model. Both are inherent lower bounds for any scheduling algorithm. Then, we present a randomized scheduling algorithm which runs t jobs in O(GlobalCongestion + dilation . log n + t) rounds and only requires that inputs and outputs do not exceed O(n log n) bits per node, which is met by, e.g., almost all graph problems. Lastly, we adjust the random-delay-based scheduling algorithm [Ghaffari, PODC'15] from the CONGEST model and obtain an algorithm that schedules any t jobs in O(t/n + LocalCongestion + dilation . log n) rounds, where the LocalCongestion relates to the congestion at a single node of the CLIQUE. We compare this algorithm to the previous approaches and show their benefit. We schedule the set of jobs on-the-fly, without a priori knowledge of its parameters or the communication patterns of the jobs. In light of the inherent lower bounds, all of our algorithms are nearly-optimal. We exemplify the power of our algorithms by analyzing the message complexity of the state-of-the-art MIS protocol [Ghaffari, Gouleakis, Konrad, Mitrovic and Rubinfeld, PODC'18], and we show that we can solve t instances of MIS in O(t+ log *** n) rounds, that is, in O(1) amortized time, for t >= log log Delta log n.

关键词： Distributed algorithms Congested clique Scheduling Maximal independent set

来源：评论

学校读者我要写书评

暂无评论

Unbounded Barrier-Synchronized Concurrent ASMs for Effective MapReduce Processing on Streams 8th

Unbounded Barrier-Synchronized Concurrent ASMs for Effective...

引用

7th International Conference on Rigorous State-Based Methods (ABZ)

作者： Li, Zilinghan He, Shilan Du, Yiqing Gonzalez, Senen Schewe, Klaus-Dieter Zhejiang Univ UIUC Inst Haining Peoples R China P&T Connected Linz Austria

ISBN: (纸本)9783030775421;9783030775438

MapReduce supports the processing of large data sets in parallel. It has been shown that MapReduce is an example for the use of the bulk synchronous parallel (BSP) bridging model, a model for parallel computation on a fixed set of processors comprising alternating computation and communication phases. In this article we extend the normal execution of MapReduce from processing large finite data sets to processing stream queries with input data stream assumed to continue indefinitely. We classify stream queries into three classes, memoryless, semi-memoryless and memorable, and provide the model for each class using MapReduce based on BSP. In addition, as some stream queries require large amounts of computing sources, the BSP computation model is extended to a model with unbounded many agents, but preserving the barrier synchronization. A behavioral theory is developed for this model extending the behavioral theory of the BSP model. This comprises an axiomatization, the definition of Infinite-Agent BSP abstract state machines (Inf-Ag-BSP-ASM) and the proof that such ASMs capture the unbounded synchronized computations. Finally, we show how MapReduce processing can be further improved on grounds of the unbounded extension.

关键词： MapReduce Stream query Infinite-agent BSP model Behavioral theory Concurrent ASM

来源：评论

学校读者我要写书评

暂无评论

Parameterized Complexity of BANDWIDTH of Caterpillars and WEIGHTED PATH EMULATION 1

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Bodlaender, Hans L. Univ Utrecht Dept Informat & Comp Sci POB 80-089 NL-3508 TB Utrecht Netherlands

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

In this paper, we show that Bandwidth is hard for the complexity class W[t] for all t is an element of N, even for caterpillars with hair length at most three. As intermediate problem, we introduce the Weighted Path Emulation problem: given a vertex-weighted path P-N and integer M, decide if there exists a mapping of the vertices of P-N to a path P-M, such that adjacent vertices are mapped to adjacent or equal vertices, and such that the total weight of the pre-image of a vertex from P-M equals an integer c. We show that Weighted Path Emulation, with c as parameter, is hard for W[t] for all t is an element of N, and is strongly NP-complete. We also show that Directed Bandwidth is hard for W[t] for all t is an element of N, for directed acyclic graphs whose underlying undirected graph is a caterpillar.

关键词： Bandwidth Parameterized complexity Weighted path emulation W-hierarchy Caterpillars

来源：评论

学校读者我要写书评

暂无评论

Automatic Transformation of SysML Model to Event-B Model for Railway CCS Application 8th

Automatic Transformation of SysML Model to Event-B Model for...

引用

7th International Conference on Rigorous State-Based Methods (ABZ)

作者： Salunkhe, Shubhangi Berglehner, Randolf Rasheeq, Abdul DB Netz AG Frankfurt Germany Neovendi GmbH Kalkar Germany

ISBN: (纸本)9783030775421;9783030775438

Digitalisation and innovation among the railway systems entail effort-demanding challenges, especially when considering how crucial it is to verify safety requirements and proof security levels. The early Verification and Validation (V&V) of railway systems detect critical issues and avoid severe consequences due to software failure. This paper aims to distinguish the subset of SysML language, which can be verified and usable by a systems engineer. As we are interested in proving safety properties expressed using invariants on states, we consider the Event-B method for this purpose. Later the selected SysML subset is used for automatic transformation and finally performing the verification using a formal verification tool. The transformation is applied on a simple point machine case study from DB Netz AG;First, a SysML model is designed using the Windchill modeler, then automatically transformed to Event-B and finally imported into the RODIN platform for formal verification.

关键词： Model transformation SysML Event-B Model-based systems engineering

来源：评论

学校读者我要写书评

暂无评论

Two-Agent Tree Evacuation 28th

Two-Agent Tree Evacuation

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Devillez, Henri Egressy, Beni Fritsch, Robin Wattenhofer, Roger Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9783030795269;9783030795276

We study the problem of evacuating two agents from a tree graph, through an unknown exit located at one of the nodes. Initially, the agents are located at the same starting node;they explore the graph until one of them finds the exit through which they can evacuate. The task is to minimize the time it takes until both agents evacuate, for a worst case placement of the exit. We consider two communication models, global communication where the agents can communicate at any time, and local communication where the agents can only communicate if they are at the same node at the same time. We show that the problem is NP-hard in both cases. We then present a 4/3-approximation algorithm for global and a 3/2-approximation algorithm for local communication.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共35页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：