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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Labeling Schemes for Deterministic Radio Multi-broadcast 47th

Labeling Schemes for Deterministic Radio Multi-broadcast

引用

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

作者： Krisko, Colin Miller, Avery Univ Manitoba Winnipeg MB Canada

ISBN: (纸本)9783030868376;9783030868383

We consider the multi-broadcast problem in arbitrary connected radio networks consisting of n nodes. There are k designated source nodes for some fixed k is an element of{1,..., n}, and each source node has a piece of information that it wants to share with all nodes in the network. We set out to determine the shortest possible labels so that multi-broadcast can be solved deterministically in the labeled radio network by some deterministic distributed algorithm. First, we show that every radio network G with maximum degree Delta can be labeled using O(min{log k, log Delta})- bit labels in such a way that multi-broadcast with k sources can be accomplished. This bound is tight for certain network topologies (e.g., complete graphs), but there are networks where significantly shorter labels are sufficient, e.g., we show how to construct a tree with maximum degree Theta(root n) in which gossiping (i.e., multi-broadcast with n sources) can be solved after labeling each node with O(1) bits. For all trees, we provide a labeling scheme and algorithm that will solve gossiping, and, we prove an impossibility result that demonstrates that our labeling scheme is optimal for gossiping in each tree. In particular, we prove that Theta(logD(G))-bit labels are necessary and sufficient in each tree G, where D(G) denotes the distinguishing number of G.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Summarization Algorithms for News: A Study of the Coronavirus Theme and Its Impact on the News Extracting Algorithm 10th

Summarization Algorithms for News: A Study of the Coronaviru...

引用

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

作者： Gadasina, Lyudmila Veklenko, Vladislav Luukka, Pasi St Petersburg State Univ 7-9 Univ Skaya Nab St Petersburg 199034 Russia Moscow Inst Phys & Technol 9 Inst Skiy Per Dolgoprudnyi 141701 Moscow Region Russia LUT Univ Skinnarilankatu 34 Lappeenranta 53850 Finland

ISBN: (纸本)9783030914349;9783030914332

Extract summarization algorithms help identify significant information from the news by extracting meaningful sentences from the original text. The information background existing at the time of the news release often significantly affects its content. Such background can distort the text summarization algorithm working results. The study was conducted with the example of the theme "coronavirus" (COVID-19), which at the time of the study was one of the main topics in news feeds. Experiments were carried out on sports news articles, concerned football. This news area was selected because it is not related to medical topics. The TextRank algorithm for sport news extraction was applied in two ways. First, the key information from the source text of news was extracted. Then, a list of the COVID related words was created and the key information from news without considering words from this list was extracted. Our approach showed that mentioning a popular theme such as COVID that is not related to sports can have a negative impact on the text summarization algorithm. We suggest that to obtain accurate results of the algorithm operation, it is necessary to first compile a dictionary of terms related to the coronavirus theme and then exclude them when identifying the main content of news texts.

关键词： Summarization algorithm News Coronavirus Text Extracting

来源：评论

学校读者我要写书评

暂无评论

Verifying System-Level Security of a Smart Ballot Box 8th

Verifying System-Level Security of a Smart Ballot Box

引用

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

作者： Dghaym, Dana Hoang, Thai Son Butler, Michael Hu, Runshan Aniello, Leonardo Sassone, Vladimiro Univ Southampton ECS Southampton Hants England

ISBN: (纸本)9783030775421;9783030775438

Event-B, a refinement-based formal modelling language, has traditionally focused on safety, but now increasingly finds a new role in developing secure systems. In this paper we take a fresh look at security and focus on what security means for the system rather than looking at detailed protocols. We use Event-B for proving security from an abstract view and refining it towards design details, focusing on the refinement of the availability property of the system. We define a general approach to guarantee the availability of events by ensuring the non-strengthening of their guards, taking into consideration their parameter types. We illustrate our approach using a smart ballot system, an integral part of modern voting systems.

关键词： Event-B Availability property System security Refinement Voting system

来源：评论

学校读者我要写书评

暂无评论

Detecting Hate Speech Contents Using Embedding Models 10th

Detecting Hate Speech Contents Using Embedding Models

引用

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

作者： Duong, Phuc H. Chung, Cuong C. Vo, Loc T. Nguyen, Hien T. Ngo, Dat Ton Duc Thang Univ Artificial Intelligence Lab Fac Informat Technol Ho Chi Minh City Vietnam Banking Univ Ho Chi Minh City Dept Econ Math Ho Chi Minh City Vietnam New AI Res Ho Chi Minh City Vietnam

ISBN: (纸本)9783030914349;9783030914332

The rise of hate speech contents on social network platforms has recently become a topic of interest. There have been a lot of studies to develop systems that can automatically detect hate speech contents. In this paper, we propose a knowledge-rich solution to hate speech detection by incorporating hate speech embeddings to generate a more accurate representation of the given text. To obtain the hate speech embeddings, we construct a hate speech dictionary in a semi-supervised fashion. We conduct experiments on two popular datasets, which show that the combination of word embeddings and hate speech embeddings can produce promising results when compared with the methods that employ largescale pre-trained language models.

关键词： Natural language processing Hate speech detection Deep learning

来源：评论

学校读者我要写书评

暂无评论

Approximate Minimum Directed Spanning Trees Under Congestion 28th

Approximate Minimum Directed Spanning Trees Under Congestion

引用

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

作者： Lenzen, Christoph Vahidi, Hossein MPI Informat Saarbrucken Germany Saarbrucken Grad Sch Comp Sci Saarbrucken Germany

ISBN: (纸本)9783030795269;9783030795276

The minimum directed spanning tree (MDST) problem has until recently not been studied in distributed computing models. This fundamental task generalizes the well-studied minimum spanning tree problem, by asking for a minimum weight spanning tree rooted at some specified node of a directed network. In their DISC 2019 paper [9], Fischer and Oshman reduce the MDST problem to the single-source shortest path (SSSP) problem, with a polylogarithmic increase in running time. This holds both in the Congest and Congested Clique models. Fischer and Oshman further suggest the possibility that an approximate SSSP algorithm could be leveraged in computing an approximate DST. We extend their analysis to show that this is indeed the case: For epsilon > 0, using a (1 + epsilon)-approximation to SSSP running in R rounds we can compute a (1 + epsilon)-approximate MDST in (O) over tilde (R) rounds ((O) over tilde -notation neglects polylogarithmic factors in the number n of nodes in the graph.). In particular, this implies the following improvements in the state of the art for (1 + o(1))-approximation of MDST. An (O) over tilde (n(1-2/omega+o(1))). subset of (O) over tilde (n(0.158))-round Congested Clique algorithm, where omega < 2.373 is the fast matrix multiplication exponent [3]. An <(O)over tilde>(lambda(2))-round Congested Clique algorithm in graphs where each edge has an at most factor lambda >= 1 heavier reverse edge [1]. An (O) over tilde(lambda(2)(root n+D))-round Congest algorithm in the same family of graphs [1]. For lambda is an element of log(O(1)) n, the resulting running time of (O) over tilde (root n+D) is unconditionally tight up to a polylogarithmic factor [21].

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

On Subgraph Complementation to H-free Graphs 1

引用

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

作者： Antony, Dhanyamol Garchar, Jay Pal, Sagartanu Sandeep, R. B. Sen, Sagnik Subashini, R. Natl Inst Technol Calicut Calicut Kerala India Indian Inst Technol Dharwad Dharwad Karnataka India

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

For a class G of graphs, the problem Subgraph Complement to G asks whether one can find a subset S of vertices of the input graph G such that complementing the subgraph induced by S in G results in a graph in G. We investigate the complexity of the problem when G is H-free for H being a complete graph, a star, a path, or a cycle. We obtain the following results: - When H is a K-t (a complete graph on t vertices) for any fixed t >= 1, the problem is solvable in polynomial-time. This applies even when G is a subclass of K-t-free graphs recognizable in polynomial-time, for example, the class of (t - 2)-degenerate graphs. - When H is a K-1,K- t (a star graph on t + 1 vertices), we obtain that the problem is NP-complete for every t >= 5. This, along with known results, leaves only two unresolved cases - K-1,K-3 and K-1,K-4. - When H is a P-t (a path on t vertices), we obtain that the problem is NP-complete for every t >= 7, leaving behind only two unresolved cases - P-5 and P-6. - When H is a C-t (a cycle on t vertices), we obtain that the problem is NP-complete for every t >= 8, leaving behind four unresolved cases - C-4, C-5, C-6, and C-7. Further, we prove that these hard problems do not admit subexponentialtime algorithms (algorithms running in time 2(o(|V (G)|))), assuming the Exponential Time Hypothesis. A simple complementation argument implies that results for G are applicable for (G) over bar, thereby obtaining similar results for H being the complement of a complete graph, a star, a path, or a cycle. Our results generalize two main results and resolve one open question by Fomin et al. (Algorithmica, 2020).

关键词： Subgraph complementation Graph modification Graph classes

来源：评论

学校读者我要写书评

暂无评论

Bears with Hats and Independence Polynomials 47th

Bears with Hats and Independence Polynomials

引用

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

作者： Blazej, Vaclav Dvorak, Pavel Opler, Michal Czech Tech Univ Fac Informat Technol Prague Czech Republic Charles Univ Prague Fac Math & Phys Prague Czech Republic

ISBN: (纸本)9783030868376;9783030868383

Consider the following hat guessing game. A bear sits on each vertex of a graph G, and a demon puts on each bear a hat colored by one of h colors. Each bear sees only the hat colors of his neighbors. Based on this information only, each bear has to guess g colors and he guesses correctly if his hat color is included in his guesses. The bears win if at least one bear guesses correctly for any hat arrangement. We introduce a new parameter-fractional hat chromatic number (mu) over cap, arising from the hat guessing game. The parameter (mu) over cap is related to the hat chromatic number which has been studied before. We present a surprising connection between the hat guessing game and the independence polynomial of graphs. This connection allows us to compute the fractional hat chromatic number of chordal graphs in polynomial time, to bound fractional hat chromatic number by a function of maximum degree of G, and to compute the exact value of (mu) over cap of cliques, paths, and cycles.

关键词： Hat guessing game Independence polynomial Chordal graphs

来源：评论

学校读者我要写书评

暂无评论

Graph Exploration by Energy-Sharing Mobile Agents 28th

Graph Exploration by Energy-Sharing Mobile Agents

引用

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

作者： Czyzowicz, Jurek Dobrev, Stefan Killick, Ryan Kranakis, Evangelos Krizanc, Danny Narayanan, Lata Opatrny, Jaroslav Pankratov, Denis Shende, Sunil Univ Quebec Outaouais Dept Informat Gatineau PQ Canada Slovak Acad Sci Bratislava Slovakia Carleton Univ Sch Comp Sci Ottawa ON Canada Wesleyan Univ Dept Math & Comp Sci Middletown CT USA Concordia Univ Dept Comp Sci & Software Engn Montreal PQ Canada Rutgers State Univ Dept Comp Sci New Brunswick NJ USA

ISBN: (纸本)9783030795269;9783030795276

We consider the problem of collective exploration of a known n-node edge-weighted graph by k mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbitrary subset of nodes in the graph, and each agent has an initial, possibly different, amount of energy. The goal of the exploration problem is for every edge in the graph to be traversed by at least one agent. The amount of energy used by an agent to travel distance x is proportional to x. In our model, the agents can share energy when co-located: when two agents meet, one can transfer part of its energy to the other. For an n-node path, we give an O(n + k) time algorithm that either finds an exploration strategy, or reports that one does not exist. For an n-node tree with l leaves, we give an O(n+lk(2)) algorithm that finds an exploration strategy if one exists. Finally, for the general graph case, we show that the problem of deciding if exploration is possible by energy-sharing agents is NP-hard, even for 3-regular graphs. In addition, we show that it is always possible to find an exploration strategy if the total energy of the agents is at least twice the total weight of the edges;moreover, this is asymptotically optimal.

关键词： Energy Exploration Graph Mobile agent Path Sharing Tree

来源：评论

学校读者我要写书评

暂无评论

Formal Meta Engineering Event-B: Extension and Reasoning The EB4EB Framework 8th

Formal Meta Engineering Event-B: Extension and Reasoning The...

引用

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

作者： Riviere, Peter IRIT INPT ENSEEIHT 2 Rue Charles Camichel Toulouse F-31000 Toulouse France

State-based Formal methods have been used to design and verify the development of complex software systems for a long time. Such methods are underpinned with solid mathematical concepts. © 2021, Springer Nature S... 详细信息

ISBN: (纸本)9783030775421;9783030775438

关键词： Formal methods

来源：评论

学校读者我要写书评

暂无评论

Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel 1

引用

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

作者： Crespelle, Christophe Gras, Benjamin Perez, Anthony Univ Lyon DANTE INRIA UCBL LIP UMR CNRS 5668 Lyon France Univ Trier Informat Wissensch Fachbereich 4 D-54296 Trier Germany Univ Orleans INSA Ctr Val Loire LIFO EA 4022 F-45067 Orleans France

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

Given a class of graphs G and a graph G = (V, E), the aim of the G-completion problem is to find a set of at most k non-edges whose addition in G results in a graph that belongs to G. Completion to chordal or to natural subclasses of chordal graphs cover a broad range of classical NP-Complete problems, that have been extensively studied. When G coincides with the class of chordal graphs, the problem is the wellknown Minimum Fill-In problem. Other notable examples include completion to proper interval, threshold or trivially perfect graphs. Aforementioned problems are known to admit polynomial kernels, and it has been conjectured that completion to subclasses of chordal graphs further characterized by a finite number of forbidden induced subgraphs admits polynomial kernels. We investigate this line of research by considering completion to an important subclass of chordal graphs, namely chordal distance-hereditary graphs. Chordal distance-hereditary graphs are a natural generalization of trivially perfect graphs and have been extensively studied from the structural viewpoint. However, to the best of our knowledge, completion to chordal distance-hereditary graphs has not received attention so far. We thus initiate the first algorithmic study of this problem, and prove its NP-Completeness and that it admits a kernel with O(k(4)) vertices. To that aim, we rely on several known characterizations of chordal distance-hereditary graphs. In particular, such graphs admit a tree-like decomposition, so-called clique laminar tree. Unlike all aforementioned subclasses of chordal graphs, this decomposition does not correspond to a partition of the vertex set at hand. To circumvent this, we propose an approach based on the notion of clique (minimal) separator decomposition and a new characterization of chordal distance-hereditary graphs that might be of independent interest.

关键词： Parameterized complexity Kernelization algorithms Chordal graphs Distance-hereditary graphs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：