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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Formalizing the Institution for Event-B in the Coq Proof Assistant 8th

Formalizing the Institution for Event-B in the Coq Proof Ass...

引用

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

作者： Reynolds, Conor Maynooth Univ Maynooth Kildare Ireland

We formalize a fragment of the theory of institutions sufficient to establish basic facts about the institution EVT for Event-B, and its relationship with the institution FOPEQ for first-order predicate logic. We prov... 详细信息

ISBN: (纸本)9783030775421;9783030775438

关键词： Coq Event-B Institution theory

来源：评论

学校读者我要写书评

暂无评论

Groups Influence with Minimum Cost in Social Networks 10th

Groups Influence with Minimum Cost in Social Networks

引用

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

作者： Pham, Phuong N. H. Pham, Canh V. Duong, Hieu V. Trung Thanh Nguyen Thai, My T. Ho Chi Minh city Univ Food Ind Fac Informat Technol Ho Chi Minh Vietnam Phenikaa Univ ORlab Fac Comp Sci Hanoi 12116 Vietnam Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL USA

ISBN: (纸本)9783030914349;9783030914332

This paper studies a Group Influence with Minimum cost which aims to find a seed set with smallest cost that can influence all target groups, where each user is associated with a cost and a group is influenced if the total score of the influenced users belonging to the group is at least a certain threshold. As the group-influence function is neither submodular nor supermodular, theoretical bounds on the quality of solutions returned by the well-known greedy approach may not be guaranteed. To address this challenge, we propose a bi-criteria polynomial-time approximation algorithm with high certainty. At the heart of the algorithm is a novel group reachable reverse sample concept, which helps speed up the estimation of the group influence function. Finally, extensive experiments conducted on real social networks show that our proposed algorithm outperform the state-of-the-art algorithms in terms of the objective value and the running time.

关键词： Viral marketing Group influence Approximation algorithm Online social network

来源：评论

学校读者我要写书评

暂无评论

Network Based Framework to Compare Vaccination Strategies 10th

Network Based Framework to Compare Vaccination Strategies

引用

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

作者： Singh, Rishi Ranjan Dhar, Amit Kumar Kherani, Arzad Alam Jacob, Naveen Varghese Misra, Ashitabh Bajpai, Devansh Indian Inst Technol Dept Elect Engn & Comp Sci Raipur Chhattisgarh India Univ Illinois Champaign IL USA Goldman Sachs Serv Private Ltd Bengaluru India

ISBN: (纸本)9783030914349;9783030914332

We propose a network based framework to model spread of disease. We study the evolution and control of spread of virus using the standard SIR-like rules while incorporating the various available models for social interaction. The dynamics of the framework has been compared with the real-world data of COVID-19 spread in India. This framework is further used to compare vaccination strategies.

关键词： Network based framework Vaccination strategies Disease spread modelling

来源：评论

学校读者我要写书评

暂无评论

Distributed Graph Problems Through an Automata-Theoretic Lens 28th

Distributed Graph Problems Through an Automata-Theoretic Len...

引用

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

作者： Chang, Yi-Jun Studeny, Jan Suomela, Jukka Swiss Fed Inst Technol Zurich Switzerland Aalto Univ Espoo Finland

ISBN: (纸本)9783030795269;9783030795276

The locality of a graph problem is the smallest distance T such that each node can choose its own part of the solution based on its radius-T neighborhood. In many settings, a graph problem can be solved efficiently with a distributed or parallel algorithm if and only if it has a small locality. In this work we seek to automate the study of solvability and locality: given the description of a graph problem., we would like to determine if. is solvable and what is the asymptotic locality of. as a function of the size of the graph. Put otherwise, we seek to automatically synthesize efficient distributed and parallel algorithms for solving.. We focus on locally checkable graph problems;these are problems in which a solution is globally feasible if it looks feasible in all constant-radius neighborhoods. Prior work on such problems has brought primarily bad news: questions related to locality are undecidable in general, and even if we focus on the case of labeled paths and cycles, determining locality is PSPACE-hard (Balliu et al. PODC 2019). We complement prior negative results with efficient algorithms for the cases of unlabeled paths and cycles and, as an extension, for rooted trees. We study locally checkable graph problems from an automata-theoretic perspective by representing a locally checkable problem. as a nondeterministic finite automaton M over a unary alphabet. We identify polynomial-time-computable properties of the automaton M that near-completely capture the solvability and locality of Pi in cycles and paths, with the exception of one specific case that is co-NP-complete.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Preventing Small (s, t)-Cuts by Protecting Edges 47th

Preventing Small (s, t)-Cuts by Protecting Edges

引用

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

作者： Gruettemeier, Niels Komusiewicz, Christian Morawietz, Nils Sommer, Frank Philipps Univ Marburg Fachbereich Math & Informat Marburg Germany

ISBN: (纸本)9783030868376;9783030868383

We introduce and study Weighted Min (s, t)-Cut Prevention, where we are given a graph G = (V, E) with vertices s and t and an edge cost function and the aim is to choose an edge set D of total cost at most d such that G has no (s, t)-edge cut of capacity at most a that is disjoint from D. We show that Weighted Min (s, t)-Cut Prevention is NP-hard even on subcubcic graphs when all edges have capacity and cost one and provide a comprehensive study of the parameterized complexity of the problem. We show, for example W[1]-hardness with respect to d and an FPT algorithm for a.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Understanding the issues Surrounding COVID-19 Vaccine Roll Out via User Tweets 10th

Understanding the Issues Surrounding COVID-19 Vaccine Roll O...

引用

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

作者： Esparza, Jose Bejarano, Gissella Ramesh, Arti Seetharam, Anand Univ Privada Norte Trujillo Peru Baylor Univ Waco TX USA Binghamton Univ Binghamton NY USA

ISBN: (纸本)9783030914349;9783030914332

Vaccinations have emerged as one of the key tools to combat the COVID-19 pandemic, reduce infections and to enable safe re-opening of societies. Vaccinating the entire world population is a challenging undertaking and with demand far exceeding supply in the world, it is expected that topics surrounding vaccinations generate a wide array of discussions. Therefore, in this paper, we collect data from Twitter during the early days of the COVID-19 vaccination program and adopt a linguistic approach to better understand and appreciate peoples' concerns and opinions with regards to the roll out of the vaccines. We begin by studying the term frequencies (i.e., unigrams and bigrams) and observe discussions around vaccination doses, receiving doses, vaccine supply, scheduling appointments and wearing masks as the vaccination efforts get underway. We then adopt a seeded topic modeling approach to automatically identify the main topics of discussion in the tweets and the main issues being discussed in each topic. We observe that our dataset has nine distinct topics. For example, we observe topics related to vaccine distribution, eligibility, scheduling and COVID variants. We then study the sentiment of the tweets with respect to each of the nine topics and observe that the overall sentiment is negative for most of the topics. We only observe a higher percentage of positive sentiment for topics related to obtaining information and schools. Our research lays the foundation to conduct a more fine-grained analysis of the various issues faced by the people as the pandemic recedes over the course of the next few years.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

A Modeling and Verification Framework for Security Protocols 8th

A Modeling and Verification Framework for Security Protocols

引用

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

作者： Lilli, Mario Univ Milan Comp Sci Dept Via Celoria 18 Milan Italy

ISBN: (纸本)9783030775421;9783030775438

Bad design decisions in security protocols can drastically affect the robustness of the protection given by protocols, causing the introduction of vulnerabilities and leak of information. My PhD project aims to reduce the possibility of introducing flaws supporting designers and engineers with a user-friendly formal verification framework, with various options for both model construction and verification.

关键词： ASM Security protocol Automatic verification ASMETA

来源：评论

学校读者我要写书评

暂无评论

About the Concolic Execution and Symbolic ASM Function Promotion in CASM 8th

About the Concolic Execution and Symbolic ASM Function Promo...

引用

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

作者： Paulweber, Philipp Moosbrugger, Jakob Zdun, Uwe Vienna Univ Technol Inst Informat Syst Engn Res Unit Compilers & Languages CompLang Argentinierstr 8 A-1040 Vienna Austria Univ Vienna Fac Comp Sci Res Grp Software Architecture SWA Wahringerstr 29 A-1090 Vienna Austria

ISBN: (纸本)9783030775421;9783030775438

The Abstract State Machines (ASMs) are a well-known state based formal method to describe systems at a very high level and can be executed either through a concrete or symbolic interpretation. By symbolically executing an ASM specification, certain properties can be checked by transforming the described ASM into a suitable input for model checkers or Automated Theorem Provers (ATPs). Due to the rather fast increasing state space, model checking and ATP solutions can lead to inefficient implementations of symbolic execution. More efficient state space and execution performance can be achieved by using a concolic execution approach. In this paper, we describe an improved concolic execution implementation for the Corinthian Abstract State Machine (CASM) language. We outline the transformation of a symbolically executed ASM specification to a single Thousands of Problems for Theorem Provers (TPTP) format. Furthermore, we introduce a compiler analysis to promote concrete ASM functions into symbolic ones in order to obtain symbolic consistency.

关键词： Abstract State Machine Concolic execution CASM TPTP Z3

来源：评论

学校读者我要写书评

暂无评论

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set 1

引用

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

作者： Donkers, Huib Jansen, Bart M. P. Eindhoven Univ Technol Eindhoven Netherlands

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

The goal of this paper is to open up a new research direction aimed at understanding the power of preprocessing in speeding up algorithms that solve NP-hard problems exactly. We explore this direction for the classic Feedback Vertex Set problem on undirected graphs, leading to a new type of graph structure called antler decomposition, which identifies vertices that belong to an optimal solution. It is an analogue of the celebrated crown decomposition which has been used for Vertex Cover. We develop the graph structure theory around such decompositions and develop fixed-parameter tractable algorithms to find them, parameterized by the number of vertices for which they witness presence in an optimal solution. This reduces the search space of fixed-parameter tractable algorithms parameterized by the solution size that solve Feedback Vertex Set.

关键词： Kernelization Preprocessing Feedback vertex set Graph decomposition

来源：评论

学校读者我要写书评

暂无评论

Social Cohesion During the Stay-at-Home Phase of the First Wave of the COVID-19 Pandemic on Polish-Speaking Twitter 10th

Social Cohesion During the Stay-at-Home Phase of the First W...

引用

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

作者： Jarynowski, Andrzej Semenov, Alexander Wojta-Kempa, Monika Belik, Vitaly Interdisciplinary Res Inst Wroclaw Poland Free Univ Berlin Inst Vet Epidemiol & Biostat Syst Modeling Grp Berlin Germany Univ Florida Herbert Wertheim Coll Engn Gainesville FL USA St Petersburg State Univ Ctr Econometr & Business Analyt St Petersburg Russia Wroclaw Med Univ Dept Hlth Humanities & Social Sci Wroclaw Poland

ISBN: (纸本)9783030914349;9783030914332

Catastrophic and urgent events, such as the COVID-19 pandemic, are known not only to polarize societies and induce selfish, individualistic behavior, but might also motivate altruistic behavior. We have analyzed COVID-19 perception using data collected from the Polish-language Internet from 15.01-30.06.2020, equaling 930,319 tweets. Deploying methods of computational social science and digital epidemiology, we aim to understand mechanisms of social consolidation and depolarization (measured by network modularity and sentiment) during the so-called "stay-at-home phase" of the COVID-19 pandemic. Mauss' theory of interaction or exchange of gifts, the theory of social capital, as well as Kaniasty's theory of mobilization and deterioration serve as a background for reflection on the Polish example during the first epidemic wave. Our study highlights the potential of social support and caretaking to reduce affective and behavioral polarization in social media

关键词： COVID-19 Risk perception Polarization Twitter Social media Social network analysis Sentiment Internet research

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：