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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

On 3-Coloring of (2P₄, C₅)-Free Graphs 47th

On 3-Coloring of (2P4, C5</sub...

引用

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

作者： Jelinek, Vit Klimosova, Tereza Masarik, Tomas Novotna, Jana Pokorna, Aneta Charles Univ Prague Fac Math & Phys Prague Czech Republic Univ Warsaw Fac Math Informat & Mech Warsaw Poland Simon Fraser Univ Burnaby BC Canada

ISBN: (纸本)9783030868376;9783030868383

The 3-coloring of hereditary graph classes has been a deeplyresearched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minimal forbidden induced subgraphs H-1, H-2,...;the graphs in the class are called (H-1, H-2,...)-free. The complexity of 3-coloring is far from being understood, even for classes defined by a few small forbidden induced subgraphs. For H-free graphs, the complexity is settled for any H on up to seven vertices. There are only two unsolved cases on eight vertices, namely 2P(4) and P-8. For P-8-free graphs, some partial results are known, but to the best of our knowledge, 2P(4)-free graphs have not been explored yet. In this paper, we show that the 3-coloring problem is polynomial-time solvable on (2P(4), C-5)-free graphs.

关键词： 3-coloring Hereditary classes 2P(4)-free graphs Cographs

来源：评论

学校读者我要写书评

暂无评论

A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems 28th

A Distributed Computing Perspective of Unconditionally Secur...

引用

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

作者： Rajsbaum, Sergio Univ Nacl Autonoma Mexico Inst Matemat Mexico City 04510 DF Mexico

ISBN: (纸本)9783030795269;9783030795276

The problem of A privately transmitting information to B by a public announcement overheard by an eavesdropper C is considered. To do so by a deterministic protocol, the inputs of the players must be correlated. Dependent inputs are traditionally represented using a deck of cards. There is a publicly known signature (a, b, c), where n = a + b + c + r, and A gets a cards, B gets b cards, and C gets c cards, out of the deck of n cards. Using a deterministic protocol, A decides its announcement based on her hand. Using techniques from coding theory, Johnson graphs, and additive number theory, a novel perspective inspired by distributed computing theory is provided, to analyze the amount of information that A needs to send, while preventing C from learning a single card of her hand. In one extreme, the generalized Russian cards problem, B wants to learn all of A's cards, and in the other, B wishes to learn something about A's hand.

关键词： Johnson graphs Russian cards problem Information theoretic security Combinatorial cryptography Constant weight codes

来源：评论

学校读者我要写书评

暂无评论

Sterling: A Web-Based Visualizer for Relational Modeling Languages 8th

Sterling: A Web-Based Visualizer for Relational Modeling Lan...

引用

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

作者： Dyer, Tristan Baugh, John Brown Univ Providence RI 02912 USA North Carolina State Univ Raleigh NC USA

ISBN: (纸本)9783030775421;9783030775438

We introduce Sterling, a web-based visualization tool that provides interactive views of relational models and allows users to create custom visualizations using modern JavaScript libraries like D3 and Cytoscape. We outline its design goals and architecture, and describe custom visualizations developed with Sterling that enable verification studies of scientific software used in production. While development is driven primarily by the Alloy community, other relational modeling languages are accommodated by Sterling's data agnostic architecture.

关键词： Alloy Sterling Formal methods Visualization

来源：评论

学校读者我要写书评

暂无评论

Power Grid Cascading Failure Prediction Based on Transformer 10th

Power Grid Cascading Failure Prediction Based on Transformer

引用

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

作者： Zhou, Tianxin Li, Xiang Lu, Haibing Santa Clara Univ Santa Clara CA 95053 USA

ISBN: (纸本)9783030914349;9783030914332

Smart grids can be vulnerable to attacks and accidents, and any initial failures in smart grids can grow to a large blackout because of cascading failure. Because of the importance of smart grids in modern society, it is crucial to protect them against cascading failures. Simulation of cascading failures can help identify the most vulnerable transmission lines and guide prioritization in protection planning, hence, it is an effective approach to protect smart grids from cascading failures. However, due to the enormous number of ways that the smart grids may fail initially, it is infeasible to simulate cascading failures at a large scale nor identify the most vulnerable lines efficiently. In this paper, we aim at 1) developing a method to run cascading failure simulations at scale and 2) building simplified, diffusion based cascading failure models to support efficient and theoretically bounded identification of most vulnerable lines. The goals are achieved by first constructing a novel connection between cascading failures and natural languages, and then adapting the powerful transformer model in NLP to learn from cascading failure data. Our trained transformer models have good accuracy in predicting the total number of failed lines in a cascade and identifying the most vulnerable lines. We also constructed independent cascade (IC) diffusion models based on the attention matrices of the transformer models, to support efficient vulnerability analysis with performance bounds.

关键词： Power grid Smart grid Cascading failure Transformer Independent cascade model

来源：评论

学校读者我要写书评

暂无评论

FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More 1

引用

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

作者： Jansen, Bart M. P. de Kroon, Jari J. H. Eindhoven Univ Technol Eindhoven Netherlands

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

For a hereditary graph class H, the H-elimination distance of a graph G is the minimum number of rounds needed to reduce G to a member of H by removing one vertex from each connected component in each round. The H-treewidth of a graph G is the minimum, taken over all vertex sets X for which each connected component of G - X belongs to H, of the treewidth of the graph obtained from G by replacing the neighborhood of each component of G - X by a clique and then removing V (G) \ X. These parameterizations recently attracted interest because they are simultaneously smaller than the graph-complexity measures treedepth and treewidth, respectively, and the vertex-deletion distance to H. For the class H of bipartite graphs, we present nonuniform fixed-parameter tractable algorithms for testing whether the H- elimination distance or H- treewidth of a graph is at most k. Along the way, we also provide such algorithms for all graph classes H defined by a finite set of forbidden induced subgraphs.

关键词： Elimination distance FPT Odd cycle transversal

来源：评论

学校读者我要写书评

暂无评论

Formalizing and Analyzing System Requirements of Automatic Train Operation over ETCS Using Event-B 8th

Formalizing and Analyzing System Requirements of Automatic T...

引用

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

作者： Eschbach, Robert ITK Engn GmbH Speyerer Tal 6 D-76761 Ruelzheim Germany

ISBN: (纸本)9783030775421;9783030775438

The European Railway Traffic Management System (ERTMS) aims at the replacement of incompatible national railway traffic management systems in Europe. A part of ERTMS is the European Train Control System (ETCS). ETCS is an automatic train protection system and can collaborate with an automatic train operation system (ATO). ATO can control and monitor the braking, traction and door system of a train. This collaboration is called ATO over ETCS. In this paper we describe the experiences gained in the formalization and the formal analysis of system requirements related to the modes of the ATO onboard unit and its interfaces to train, ATO trackside unit, and ETCS onboard unit. A primary goal to achieve was the stepwise and systematic construction of an Event-B specification tightly coupled with the requirements based on a bidirectional traceability concept. Another goal was the formal verification of important safety properties related to the mode transitions and transition conditions of the ATO onboard unit.

关键词： ATO over ETCS Formalization Traceability Formal verification Event-B

来源：评论

学校读者我要写书评

暂无评论

Recovering Communities in Temporal Networks Using Persistent Edges 10th

Recovering Communities in Temporal Networks Using Persistent...

引用

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

作者： Avrachenkov, Konstantin Dreveton, Maximilien Leskela, Lasse Inria Sophia Antipolis 2004 Route Lucioles F-06902 Valbonne France Aalto Univ Dept Math & Syst Anal Otakaari 1 Espoo 02150 Finland

ISBN: (纸本)9783030914349;9783030914332

This article studies the recovery of static communities in a temporal network. We introduce a temporal stochastic block model where dynamic interaction patterns between node pairs follow a Markov chain. We render this model versatile by adding degree correction parameters, describing the tendency of each node to start new interactions. We show that in some cases the likelihood of this model is approximated by the regularized modularity of a time-aggregated graph. This time-aggregated graph involves a trade-off between new edges and persistent edges. A continuous relaxation reduces the regularized modularity maximization to a normalized spectral clustering. We illustrate by numerical experiments the importance of edge persistence, both on simulated and real data sets.

关键词： Graph clustering Temporal networks Spectral methods Stochastic block model

来源：评论

学校读者我要写书评

暂无评论

Social and Motivational Factors for the Spread of Physical Activities in a Health Social Network 10th

Social and Motivational Factors for the Spread of Physical A...

引用

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

作者： Phan, NhatHai Kil, David Piniewski, Brigitte Dou, Dejing New Jersey Inst Technol Newark NJ USA HealthMantic Inc Los Altos CA USA PeaceHealth Labs Eugene OR USA Univ Oregon Eugene OR USA

ISBN: (纸本)9783030914349;9783030914332

Identifying the effects of social and motivational factors is critical to understanding how healthy behaviors, i.e., physical activities, spread in digital therapeutics programs. We evaluated a comprehensive interconnected social network of 254 overweight and obese individuals across 335 days. Daily physical activities, social activities, biomarkers, and biometric measures were available for all subjects. We improved proportional hazards models to characterize the impact of self-motivation, influence, and susceptibility in the spread of physical activities. After 6 months, the YesiWell users increased leisure walking minutes by 164% on average compared with 47% among the control participants (P < 0.05). The YesiWell users also lost more weight than the controls (5.2 pounds vs. 1.5 pounds) (P < 0.01). Our estimations showed that influence and susceptibility increase with age;relaxed people are 96% more influential than stressed people (P < 0.001);obese people are 23% more selfmotivated (P < 0.001);socially active people are 29% more influential (P < 0.001);those who self-characterize as "keep-to-themselves" people have a 79% greater susceptibility (P < 0.001). Relaxed people exert the most influence on non-stressed peers at 109% more than baseline (P < 0.001). Our findings could enable new and effective personalized behavioral interventions to spread healthy behaviors in next-generation digital therapeutics.

关键词： Overweight Obesity Social and motivation factors Physical activities

来源：评论

学校读者我要写书评

暂无评论

Maximizing the Sum of a Supermodular Function and a Monotone DR-submodular Function Subject to a Knapsack Constraint on the Integer Lattice 10th

Maximizing the Sum of a Supermodular Function and a Monotone...

引用

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

作者： Tan, Jingjing Xu, Yicheng Zhang, Dongmei Zhang, Xiaoqing Weifang Univ Sch Math & Informat Sci Weifang 261061 Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen 518055 Peoples R China Guangxi Key Lab Cryptog & Informat Secur Guilin 541004 Peoples R China Shandong Jianzhu Univ Sch Comp Sci & Technol Jinan 250101 Peoples R China Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China

ISBN: (纸本)9783030914349;9783030914332

Submodular maximization is of great significance as it has included many classical combinatorial problems. In this paper, we consider the maximization of the sum of a supermodular function and a monotone DR-submodular function on the integer lattice. As our main contribution, we present a streaming algorithm under the assumption that the optimum is known, and a two-pass streaming algorithm in general case. The proposed algorithms are proved to have polynomial time and space complexity, and a performance guarantee dependent on the curvature of the supermodular function.

关键词： Submodular maximization Supermodular DR-submodular Knapsack constraint Integer lattice

来源：评论

学校读者我要写书评

暂无评论

The Complexity of Gerrymandering over Graphs: Paths and Trees 1

引用

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

作者： Bentert, Matthias Koana, Tomohiro Niedermeier, Rolf TU Berlin Fac 4 Algorithm & Computat Complex Berlin Germany

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

Roughly speaking, gerrymandering is the systematic manipulation of the boundaries of electoral districts to make a specific (political) party win as many districts as possible. While typically studied from a geographical point of view, addressing social network structures, the investigation of gerrymandering over graphs was recently initiated by Cohen-Zemach et al. [AAMAS 2018]. Settling three open questions of Ito et al. [AAMAS 2019, TCS 2021], we classify the computational complexity of the NP-hard problem Gerrymandering over Graphs when restricted to paths and trees. Our results, which are mostly of negative nature (that is, worst-case hardness), in particular yield two complexity dichotomies for trees. For instance, the problem is polynomial-time solvable for two parties but becomes weakly NP-hard for three. Moreover, we show that the problem remains NP-hard even when the input graph is a path.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：