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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

The Perfect Matching Cut Problem Revisited 1

引用

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

作者： Le, Van Bang Telle, Jan Arne Univ Rostock Inst Informat Rostock Germany Univ Bergen Dept Informat N-5020 Bergen Norway

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and showthat pmc remains NP-complete when restricted to bipartite graphs of maximum degree 3 and arbitrarily large girth. Complementing this hardness result, we give two graph classes in which pmc is polynomial time solvable. The first one includes claw-free graphs and graphs without an induced path on five vertices, the second one properly contains all chordal graphs. Assuming the Exponential Time Hypothesis, we show there is no O* (2(o(n)))-time algorithm for pmc even when restricted to n-vertex bipartite graphs, and also show that pmc can be solved in O* (1.2721(n)) time by means of an exact branching algorithm.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Incorporating Transformer Models for Sentiment Analysis and News Classification in Khmer 10th

Incorporating Transformer Models for Sentiment Analysis and ...

引用

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

作者： Rifat, Md Rifatul Islam Al Imran, Abdullah Rajshahi Univ Engn & Technol Rajshahi Bangladesh Amer Int Univ Bangladesh Dhaka Bangladesh

ISBN: (纸本)9783030914349;9783030914332

In recent years, natural language modeling has achieved a major breakthrough with its sophisticated theoretical and technical advancements. Leveraging the power of deep learning, transformer models have created a disrupting impact in the domain of natural language processing. However, the benefits of such advancements are still inscribed between few highly resourced languages such as English, German, and French. Low-resourced language such as Khmer is still deprived of utilizing these advancements due to lack of technical support for this language. In this study, our objective is to apply the state-of-the-art language models within two empirical use cases such as Sentiment Analysis and News Classification in the Khmer language. To perform the classification tasks, we have employed FastText and BERT for extracting word embeddings and carried out three different type of experiments such as FastText, BERT feature-based, and BERT fine-tuning-based. A large text corpus including over 100,000 news articles has been used for pre-training the transformer model, BERT. The outcome of our experiment shows that in both of the use cases, a pre-trained and fine-tuned BERT model produces the outperforming results.

关键词： Khmer Deep learning Sentiment analysis News classification Transformer models

来源：评论

学校读者我要写书评

暂无评论

The Largest Connected Subgraph Game 47th

The Largest Connected Subgraph Game

引用

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

作者： Bensmail, Julien Fioravantes, Foivos Mc Inerney, Fionn Nisse, Nicolas Univ Cote Azur I3S Inria CNRS Valbonne France CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany

ISBN: (纸本)9783030868376;9783030868383

We introduce the largest connected subgraph game played on an undirected graph G. Each round, Alice colours an uncoloured vertex of G red, and then, Bob colours one blue. Once every vertex is coloured, Alice (Bob, resp.) wins if there is a red (blue, resp.) connected subgraph whose order is greater than that of any blue (red, resp.) connected subgraph. If neither player wins, it is a draw. We prove that Alice can ensure Bob never wins, and define a class of graphs (reflection graphs) in which the game is a draw. We show that the game is PSPACE-complete in bipartite graphs of diameter 5, and that recognising reflection graphs is GI-hard. We prove that the game is a draw in paths if and only if the path has even order or at least 11 vertices, and that Alice wins in cycles if and only if the cycle is of odd order. We also give an algorithm computing the outcome of the game in cographs in linear time.

关键词： Games on graphs Scoring games Connection games PSPACE-complete

来源：评论

学校读者我要写书评

暂无评论

Proving the Safety of a Sliding Window Protocol with Event-B 8th

Proving the Safety of a Sliding Window Protocol with Event-B

引用

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

作者： Coudert, Sophie Telecom Paris LTCI Paris France

ISBN: (纸本)9783030775421;9783030775438

This paper presents an Event-B modeling of the general version of the Sliding Window Protocol (SWP). SWPs ensure reliable data transfer over unreliable media by routing frames together with their indexes. Providing SWPs with formal guarantees is recognized to be quite complex. The experiment we present here shows that Event-B refinement is a suitable approach to ensure the safety of the protocol. First a simple model is developed with unbounded frame indexes. Then bounded indexes and modular arithmetic are introduced, as concrete indexes have fixed size. At this "hybrid" level, unbounded indexes are not used any more in computations but they are still useful to express some properties. Finally, abstract general media are refined towards queues, as an example of implementation. All unbounded indexes fully disappear in the final model.

关键词： Event-B Sliding Window Protocol Formal refinement Safety

来源：评论

学校读者我要写书评

暂无评论

AdvEdge: Optimizing Adversarial Perturbations Against Interpretable Deep Learning 10th

AdvEdge: Optimizing Adversarial Perturbations Against Interp...

引用

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

作者： Abdukhamidov, Eldor Abuhamad, Mohammed Juraev, Firuz Chan-Tin, Eric AbuHmed, Tamer Sungkyunkwan Univ Seoul South Korea Loyola Univ Chicago Chicago IL 60660 USA

ISBN: (纸本)9783030914349;9783030914332

Deep Neural Networks (DNNs) have achieved state-of-theart performance in various applications. It is crucial to verify that the high accuracy prediction for a given task is derived from the correct problem representation and not from the misuse of artifacts in the data. Hence, interpretation models have become a key ingredient in developing deep learning models. Utilizing interpretation models enables a better understanding of how DNN models work, and offers a sense of security. However, interpretations are also vulnerable to malicious manipulation. We present AdvEdge and AdvEdge+, two attacks to mislead the target DNNs and deceive their combined interpretation models. We evaluate the proposed attacks against two DNN model architectures coupled with four representatives of different categories of interpretation models. The experimental results demonstrate our attacks' effectiveness in deceiving the DNN models and their interpreters.

关键词： Adversarial image Deep learning Interpretability

来源：评论

学校读者我要写书评

暂无评论

Odd Cycle Transversal in Mixed Graphs 1

引用

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

作者： Das, Avinandan Kanesh, Lawqueen Madathil, Jayakrishnan Saurabh, Saket Inst Rech Informat Fondamontale Paris France Natl Univ Singapore Sch Comp Singapore Singapore HBNI Inst Math Sci Chennai Tamil Nadu India Univ Bergen Dept Informat Bergen Norway Chennai Math Inst Chennai Tamil Nadu India

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

An odd cycle transversal (oct, for short) in a graph is a set of vertices whose deletion will leave a graph without any odd cycles. The Odd Cycle Transversal (OCT) problem takes an undirected graph G and a non-negative integer k as input, and the objective is to test if G has an oct of size at most k. The directed counterpart of the problem, Directed Odd Cycle Transversal (DOCT), where the input is a digraph and k, is defined analogously. When parameterized by k, OCT is known to be FPT [Reed et al., Oper. Res. Lett., 2004] whereas DOCT was recently shown to be W[1]-hard [Lokshtanov et al., SODA, 2020]. A mixed graph is a graph that contains both directed and undirected edges. In this paper, we study the Mixed Odd Cycle Transversal (MOCT) problem, i.e., OCT on mixed graphs. And we show that MOCT admits a fixed-parameter tractable algorithm when parameterized by k+ l, where l is the number of directed edges in the input mixed graph. In the course of designing our algorithm for MOCT, we also design a fixedparameter tractable algorithm for a variant of the well-known Multiway Cut problem, which might be of independent interest.

关键词： Undirected graphs

来源：评论

学校读者我要写书评

暂无评论

On Morphing 1-Planar Drawings 47th

On Morphing 1-Planar Drawings

引用

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

作者： Angelini, Patrizio Bekos, Michael A. Montecchiani, Fabrizio Pfister, Maximilian John Cabot Univ Rome Italy Univ Tubingen Inst Informat Tubingen Germany Univ Perugia Dipartimento Ingn Perugia Italy

ISBN: (纸本)9783030868376;9783030868383

Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of topology-preserving morphs for pairs of non-planar graph drawings. We make a step towards this problem by showing that a topology-preserving morph always exists for drawings of a meaningful family of 1-planar graphs. While our proof is constructive, the vertices may follow trajectories of unbounded complexity.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Beyond Helly Graphs: The Diameter Problem on Absolute Retracts 47th

Beyond Helly Graphs: The Diameter Problem on Absolute Retrac...

引用

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

作者： Ducoffe, Guillaume Univ Bucharest Bucharest Romania Natl Inst Res & Dev Informat Bucharest Romania

ISBN: (纸本)9783030868376;9783030868383

A subgraph H of a graph G is called a retract of G if it is the image of some idempotent endomorphism of G. We say that H is an absolute retract of some graph class C if it is a retract of any G is an element of C of which it is an isochromatic and isometric subgraph. In this paper, we study the complexity of computing the diameter within the absolute retracts of various hereditary graph classes. First, we show how to compute the diameter within absolute retracts of bipartite graphs in randomized (O) over tilde (m root n) time. Even on the proper subclass of cube-free modular graphs it is, to our best knowledge, the first subquadratic-time algorithm for diameter computation. For the special case of chordal bipartite graphs, it can be improved to linear time, and the algorithm even computes all the eccentricities. Then, we generalize these results to the absolute retracts of k-chromatic graphs, for every k >= 3. Finally, we study the diameter problem within the absolute retracts of planar graphs and split graphs.

关键词： Absolute retract Chordal bipartite graphs Split graphs Planar graphs Diameter computation

来源：评论

学校读者我要写书评

暂无评论

Disjoint Stable Matchings in Linear Time 1

引用

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

作者： Ganesh, Aadityan Prakash, H. V. Vishwa Nimbhorkar, Prajakta Philip, Geevarghese Chennai Math Inst Chennai Tamil Nadu India UMI ReLaX Chennai Tamil Nadu India

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

We show that given a Stable Matching instance G as input, we can find a largest collection of pairwise edge-disjoint stable matchings of G in time linear in the input size. This extends two classical results: 1. The Gale-Shapley algorithm, which can find at most two ("extreme") pairwise edge-disjoint stable matchings of G in linear time, and 2. The polynomial-time algorithm for finding a largest collection of pairwise edge-disjoint perfect matchings (without the stability requirement) in a bipartite graph, obtained by combining Konig's characterization with Tutte's f-factor algorithm. Moreover, we also give an algorithm to enumerate all maximum-length chains of disjoint stable matchings in the lattice of stable matchings of a given instance. This algorithm takes time polynomial in the input size for enumerating each chain. We also derive the expected number of such chains in a random instance of Stable Matching.

关键词： Stable matching Disjoint matchings

来源：评论

学校读者我要写书评

暂无评论

The Dynamic Complexity of Acyclic Hypergraph Homomorphisms 1

引用

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

作者： Vortmeier, Nils Kokkinis, Ioannis Univ Zurich Zurich Switzerland Natl Tech Univ Athens Athens Greece Univ Aegean Mitilini Greece

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

Finding a homomorphism from some hypergraph Q (or some relational structure) to another hypergraph D is a fundamental problem in computer science. We show that an answer to this problem can be maintained under single-edge changes of Q, as long as it stays acyclic, in the DynFO framework of Patnaik and Immerman that uses updates expressed in first-order logic. If additionally also changes of D are allowed, we show that it is unlikely that existence of homomorphisms can be maintained in DynFO.

关键词： Dynamic complexity Conjunctive queries Hypergraph homomorphisms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：