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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Streaming Algorithms for Maximizing Non-submodular Functions on the Integer Lattice 10th

Streaming Algorithms for Maximizing Non-submodular Functions...

引用

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

作者： Liu, Bin Chen, Zihan Wang, Huijuan Wu, Weili Ocean Univ China Sch Math Sci Qingdao Peoples R China Qingdao Univ Sch Math & Stat Qingdao Peoples R China Univ Texas Dallas Dept Comp Sci Dallas TX 75080 USA

ISBN: (纸本)9783030914349;9783030914332

Submodular functions play a key role in combinatorial optimization field. The problem of maximizing submodular and nonsubmodular functions on the integer lattice has received a lot of recent attention. In this paper, we study streaming algorithms for the problem of maximizing a monotone non-submodular functions with cardinality constraint on the integer lattice. For a monotone non-submodular function f : Z(n) (+)-> R+ defined on the integer lattice with diminishing-return (DR) ratio., we present a one pass streaming algorithm that gives a (1 - 1/ 27 - is an element of)-approximation, requires at most O(k is an element of(-1) log k/gamma) space and O(is an element of(-1) log k/gamma center dot log parallel to B parallel to 8) update time per element. To the best of our knowledge, this is the first streaming algorithm on the integer lattice for this constrained maximization problem.

关键词： Streaming algorithm Cardinality constraint Non-submodular maximization Integer lattice

来源：评论

学校读者我要写书评

暂无评论

On Additive Spanners in Weighted Graphs with Local Error 47th

On Additive Spanners in Weighted Graphs with Local Error

引用

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

作者： Ahmed, Reyan Bodwin, Greg Hamm, Keaton Kobourov, Stephen Spence, Richard Univ Arizona Dept Comp Sci Tucson AZ 85721 USA Univ Michigan Dept Comp Sci Ann Arbor MI USA Univ Texas Arlington Dept Math Arlington TX 76019 USA

ISBN: (纸本)9783030868376;9783030868383

An additive +ss spanner of a graph G is a subgraph which preserves distances up to an additive +ss error. Additive spanners are well-studied in unweighted graphs but have only recently received attention in weighted graphs [Elkin et al. 2019 and 2020, Ahmed et al. 2020]. This paper makes two new contributions to the theory of weighted additive spanners. For weighted graphs, [Ahmed et al. 2020] provided constructions of sparse spanners with global error ss = cW, where W is the maximum edge weight in G and c is constant. We improve these to local error by giving spanners with additive error +cW(s, t) for each vertex pair (s, t), where W(s, t) is the maximum edge weight along the shortest s-t path in G. These include pairwise +(2+ epsilon)W(center dot, center dot) and +(6+epsilon)W(center dot, center dot) spanners over vertex pairs P subset of V x V on O-epsilon(n|P|(1/3)) and O-epsilon(n|P|(1/4)) edges for all epsilon > 0, which extend previously known unweighted results up to epsilon dependence, as well as an all-pairs +4W(center dot, center dot) spanner on (O) over tilde (n(7/5)) edges. Besides sparsity, another natural way to measure the quality of a spanner in weighted graphs is by its lightness, defined as the total edge weight of the spanner divided by the weight of an MST of G. We provide a +epsilon W(center dot, center dot) spanner with O-epsilon(n) lightness, and a +(4 + epsilon)W(center dot, center dot) spanner with O-epsilon(n(2/3)) lightness. These are the first known additive spanners with nontrivial lightness guarantees. All of the above spanners can be constructed in polynomial time.

关键词： Additives

来源：评论

学校读者我要写书评

暂无评论

Towards ASM-Based Automated Formal Verification of Security Protocols 8th

Towards ASM-Based Automated Formal Verification of Security ...

引用

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

作者： Braghin, Chiara Lilli, Mario Riccobene, Elvinia Univ Milan Comp Sci Dept Via Celoria 18 Milan Italy

ISBN: (纸本)9783030775421;9783030775438

In the security protocols domain, formal verification is more and more highly demanded to guarantee security assurance: humans increasingly depend on the use of connected devices in their daily life, so they must be protected against possible threats and accidents. However, formal verification, and in general the use of formal methods, is slowed by myths and misconceptions, mainly due to their mathematical base, which discourages many designers or engineers from their adoption. In this paper, we pose the basis for the long-term development of an ASM-based user-friendly framework for the formal verification of security protocols. We introduce a mathematical-based set of templates to formalise common patterns in security protocols and a set of security properties. These templates facilitate the protocol formal verification by providing built-in functions and domains, as well as transition rules and property schema, to be customised according to the specific protocol to be verified. The effectiveness of this approach is shown by means of their application to a number of well-known cryptographic security protocols.

关键词： Cryptographic protocols Security assurance Abstract state machines

来源：评论

学校读者我要写书评

暂无评论

Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs 47th

Can Romeo and Juliet Meet? or Rendezvous Games with Adversar...

引用

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

作者： Fomin, Fedor, V Golovach, Petr A. Thilikos, Dimitrios M. Univ Bergen Dept Informat Bergen Norway Univ Montpellier CNRS LIRMM Montpellier France

ISBN: (纸本)9783030868376;9783030868383

We introduce the rendezvous game with adversaries. In this game, two players, Facilitator and Divider, play against each other on a graph. Facilitator has two agents, and Divider has a team of k agents located in some vertices of the graph. They take turns in moving their agents to adjacent vertices (or staying put). Facilitator wins if his agents meet in some vertex of the graph. The goal of Divider is to prevent the rendezvous of Facilitator's agents. Our interest is to decide whether Facilitator can win. It appears that, in general, the problem is PSPACE-hard and, when parameterized by k, co-W[2]-hard. Moreover, even the game's variant where we ask whether Facilitator can ensure the meeting of his agents within tau steps is co-NP-complete already for tau = 2. On the other hand, for chordal and P-5-free graphs, we prove that the problem is solvable in polynomial time. These algorithms exploit an interesting relation of the game and minimum vertex cuts in certain graph classes. Finally, we show that the problem is fixed-parameter tractable parameterized by both the graph's neighborhood diversity and tau.

关键词： Rendezvous games Dynamic separators Complexity

来源：评论

学校读者我要写书评

暂无评论

Mean User-Text Agglomeration (MUTA): Practical User Representation and Visualization for Detection of Online Influence Operations 10th

Mean User-Text Agglomeration (MUTA): Practical User Represen...

引用

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

作者： Crothers, Evan Viktor, Herna Japkowicz, Nathalie Univ Ottawa Ottawa ON Canada Amer Univ Washington DC 20016 USA

ISBN: (纸本)9783030914349;9783030914332

Online influence operations (OIOs) present a serious threat to the integrity of online social spaces and to real-world democratic elections. While many OIO detection approaches have focused on classification algorithms for individual social media posts (often with artificially balanced datasets), we present a novel system centering around a human analyst. This system incorporates a user representation and visualization procedure for unbalanced social media data. Our content-based social media user representation, the Mean User-Text Agglomeration (MUTA), summarizes a user's social media activity with respect to Transformer embeddings of texts authored by the user. We apply MUTA to a real social media dataset in advance of an election event and flag a number of suspicious Reddit users that were later removed by the social media platform. When projected to a 2-dimensional visualizable space, MUTA user representations are shown, via extrinsic cluster quality measures, to outperform BERT representations for analyst identification of OIO accounts.

关键词： Online influence operations User representation Transformer architecture Natural language processing Disinformation Social media analysis

来源：评论

学校读者我要写书评

暂无评论

Comparing Community-Aware Centrality Measures in Online Social Networks 10th

Comparing Community-Aware Centrality Measures in Online Soci...

引用

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

作者： Rajeh, Stephany Savonnet, Marinette Leclercq, Eric Cherifi, Hocine Univ Burgundy Lab Informat Bourgogne Dijon France

ISBN: (纸本)9783030914349;9783030914332

Identifying key nodes is crucial for accelerating or impeding dynamic spreading in a network. Community-aware centrality measures tackle this problem by exploiting the community structure of a network. Although there is a growing trend to design new community-aware centrality measures, there is no systematic investigation of the proposed measures' effectiveness. This study performs an extensive comparative evaluation of prominent community-aware centrality measures using the Susceptible-Infected-Recovered (SIR) model on real-world online social networks. Overall, results show that K-shell with Community and Community-based Centrality measures are the most accurate in identifying influential nodes under a single-spreader problem. Additionally, the epidemic transmission rate doesn't significantly affect the behavior of the community-aware centrality measures.

关键词： Complex networks Centrality Influential nodes Community structure SIR model

来源：评论

学校读者我要写书评

暂无评论

Extending ASMETA with Time Features 8th

Extending ASMETA with Time Features

引用

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

作者： Bombarda, Andrea Bonfanti, Silvia Gargantini, Angelo Riccobene, Elvinia Univ Bergamo Dipartimento Ingn Gest Informaz & Prod Bergamo Italy Univ Milan Dipartimento Informat Milan Italy

ASMs and the ASMETA framework can be used to model and analyze a variety of systems, and many of them rely on time constraints. In this paper, we present the ASMETA extension to deal with model time features.

ISBN: (纸本)9783030775421;9783030775438

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic Set Functions 10th

Approximation Algorithm for Maximizing Nonnegative Weakly Mo...

引用

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

作者： Cui, Min Du, Donglei Xu, Dachuan Yang, Ruiqi Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Univ New Brunswick Fac Management Fredericton NB E3B 5A3 Canada Beijing Univ Technol Beijing Inst Sci & Engn Comp Beijing 100124 Peoples R China Univ Chinese Acad Sci Sch Math Sci Beijing 100049 Peoples R China

ISBN: (纸本)9783030914349;9783030914332

In recent years, submodularity has been found in a wide range of connections and applications with different scientific fields. However, many applications in practice do not fully meet the characteristics of diminishing returns. In this paper, we consider the problem of maximizing unconstrained non-negative weakly-monotone non-submodular set function. The generic submodularity ratio gamma is a bridge connecting the non-negative monotone functions and the submodular functions, and no longer applicable to the non-monotone functions. We study a class of non-monotone functions, define as the weakly-monotone function, redefine the submodular ratio related to it and name it weaklymonotone submodularity ratio (gamma) over cap, propose a deterministic double greedy algorithm, which implements the (gamma) over cap/(gamma) over cap +2 approximation of the maximizing unconstrained non-negative weakly-monotone function problem. When (gamma) over cap. = 1, the algorithm achieves an approximate guarantee of 1/3, achieving the same ratio as the deterministic algorithm for the unconstrained submodular maximization problem.

关键词： Non-submodular optimization Unconstrained Submodularity ratio

来源：评论

学校读者我要写书评

暂无评论

Collecting Coupons is Faster with Friends 28th

Collecting Coupons is Faster with Friends

引用

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

作者： Alistarh, Dan Davies, Peter Inst Sci & Technol Austria IST Austria Campus 1 A-3400 Klosterneuburg Austria

ISBN: (纸本)9783030795269;9783030795276

In this note, we introduce a distributed twist on the classic coupon collector problem: a set of m collectors wish to each obtain a set of n coupons;for this, they can each sample coupons uniformly at random, but can also meet in pairwise interactions, during which they can exchange coupons. By doing so, they hope to reduce the number of coupons that must be sampled by each collector in order to obtain a full set. This extension is natural when considering real-world manifestations of the coupon collector phenomenon, and has been remarked upon and studied empirically (Hayes and Hannigan 2006, Ahmad et al. 2014, Delmarcelle 2019). We provide the first theoretical analysis for such a scenario. We find that "coupon collecting with friends" can indeed significantly reduce the number of coupons each collector must sample, and raises interesting connections to the more traditional variants of the problem. While our analysis is in most cases asymptotically tight, there are several open questions raised, regarding finer-grained analysis of both "coupon collecting with friends," and of a long-studied variant of the original problem in which a collector requires multiple full sets of coupons.

关键词： Coupon collector problem Population protocols Probability

来源：评论

学校读者我要写书评

暂无评论

Target Set Selection in Social Networks with Influence and Activation Thresholds 10th

Target Set Selection in Social Networks with Influence and A...

引用

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

作者： Qiang, Zhecheng Pasiliao, Eduardo L. Zheng, Qipeng P. Univ Cent Florida Dept Ind Engn & Management Syst Orlando FL 32816 USA Air Force Res Lab Munit Directorate Shalimar FL USA

ISBN: (纸本)9783030914349;9783030914332

Social media networks have gradually become the major venue for broadcasting and relaying information, thereafter making great influences in many aspects of our daily lives. With the mass adoption of the internet and mobile devices, social media users tend to follow and adopt their friends' or followers' thoughts and behaviors. Thus finding influential users in social media is crucial for many viral marketing, cybersecurity, politics, and safety-related applications. In this study, we address the problem through solving the influence and activation thresholds target set selection problem, which is to find the minimum number of seed nodes that influence all the users at time T. These time-indexed integer program models suffer from computational difficulties with binary variables at each time step. To this respect, this paper leverages computational algorithms, i.e., Graph Partition, Nodes Selection, and Greedy Algorithm to solve the models for large-scale networks. Computational results show that it is beneficial to apply the BFS Greedy algorithm for large scale networks. In addition, the results also indicate nodes selection methods perform better in the long-tailed networks.

关键词： Networks Integer programming Target set selection Greedy algorithm Influence maximization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：