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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Superfast Coloring in CONGEST via Efficient Color Sampling 28th

Superfast Coloring in CONGEST via Efficient Color Sampling

引用

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

作者： Halldorsson, Magnus M. Nolin, Alexandre Reykjavik Univ Dept Comp Sci ICE TCS Reykjavik Iceland

ISBN: (纸本)9783030795269;9783030795276

We present a procedure for efficiently sampling colors in the CONGEST model. It allows nodes whose number of colors exceeds their number of neighbors by a constant fraction to sample up to Theta(log n) semi-random colors unused by their neighbors in O(1) rounds, even in the distance-2 setting. This yields algorithms with O(log*Delta) complexity for different edge-coloring, vertex coloring, and distance-2 coloring problems, matching the best possible. In particular, we obtain an O(log*Delta)-round CONGEST algorithm for (1+epsilon)Delta-edge coloring when Delta >= log1+1/ log* n n, and a poly(log log n)-round algorithm for (2 Delta- 1)-edge coloring in general. The sampling procedure is inspired by a seminal result of Newman in communication complexity.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Two-Tier Cache-Aided Full-Duplex Content Delivery in Satellite-Terrestrial Networks 10th

Two-Tier Cache-Aided Full-Duplex Content Delivery in Satelli...

引用

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

作者： Ngo, Quynh T. Phan, Khoa T. Xiang, Wei Mahmood, Abdun Slay, Jill La Trobe Univ Dept Comp Sci & Informat Technol Sch Engn & Math Sci Melbourne Vic Australia Univ South Australia Sch Comp & Informat Sci Adelaide SA Australia

ISBN: (纸本)9783030914349;9783030914332

Enabling global Internet access is challenging for the Internet of Things due to limited range of terrestrial network services. One viable solution is to deploy satellites into terrestrial systems for coverage extension. However, operating a hybrid satellite-terrestrial system incurs potentially high satellite bandwidth consumption and excessive service latency. This work aims to reduce the content delivery delay and bandwidth consumption from the Internet-connected gateway to remote users in satellite terrestrial networks, using a two-tier cache-enabled fullduplex system model where content caches are placed at the satellite and the ground station. A closed-form solution for successful delivery probability of content files within allocated time slot under general caching policy is derived considering the requested content distributions and channel statistics. Illustrative results demonstrate superior performance of the proposed system over those of single-tier cache-aided. The tradeoff between successful delivery probability and satellite bandwidth consumption, in addition to insights on the network support ability are also investigated.

关键词： Satellite-terrestrial networks Edge caching Full-duplex Successful delivery probability Cache placement design

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs 1

引用

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

作者： Swat, Sylwester Kasprzak, Marta Poznan Univ Tech Inst Comp Sci Piotrowo 2 PL-60965 Poznan Poland

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

In this article, we describe algorithms and techniques used in the method ExTREEm for the treedepth decomposition problem. ExTREEm won the heuristic track of the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2020). It searches for a minimum-height treedepth decomposition of a graph via computing graph separators. Among concepts that are incorporated into the approach, we can distinguish a new objective function for evaluating separators, preprocessing based on finding treedepth decompositions in cactus subgraphs and on identification of graphlets, five algorithms for finding separators, a separator minimization method for a refinement of found separators, and a refinement of an obtained treedepth decomposition by merging techniques of tree rotations. This approach enables us to quickly obtain low-depth decompositions of very large graphs.

关键词： Treedepth decomposition Elimination tree Separator

来源：评论

学校读者我要写书评

暂无评论

Community Detection Using Semilocal Topological Features and Label Propagation Algorithm 10th

Community Detection Using Semilocal Topological Features and...

引用

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

作者： Malhotra, Deepanshu Gera, Ralucca Saxena, Akrati Guru Gobind Singh Indraprastha Univ Univ Sch Informat Commun & Technol New Delhi India Naval Postgrad Sch Monterey CA 93943 USA Eindhoven Univ Technol Dept Math & Comp Sci Eindhoven Netherlands

ISBN: (纸本)9783030914349;9783030914332

The detection of cohesive clusters with similar characteristics in multiple types of networks is of immense informational value to researchers. In this work, we propose a Weighted Semilocal Similarity based Label Propagation Algorithm (WSSLPA) for such community detection. The proposed method detects communities by using the semilocal topological features to overcome the shortcoming of randomness and instability in the existing label propagation algorithms while selecting a community label from multiple maximum labels. We associate user-defined weight parameters with the topological features to help WSSLPA adapt to different networks and enhance the performance metrics scores of detected communities. We compare the performance of the proposed method with other community detection techniques and show that the identified communities of WSSLPA are closer to the groundtruth communities.

关键词： Complex networks Community detection Label propagation

来源：评论

学校读者我要写书评

暂无评论

Synchronous Concurrent Broadcasts for Intermittent Channels with Bounded Capacities 28th

Synchronous Concurrent Broadcasts for Intermittent Channels ...

引用

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

作者： Turau, Volker Hamburg Univ Technol Inst Telemat D-21073 Hamburg Germany

ISBN: (纸本)9783030795269;9783030795276

In this work we extend the recently proposed synchronous broadcast algorithm amnesiac flooding to the case of intermittent communication channels. In amnesiac flooding a node forwards a received message in the subsequent round. There are several reasons that render an immediate forward of a message impossible: Higher priority traffic, overloaded channels, etc. We show that postponing the forwarding for one or more rounds prevents termination. Our extension overcomes this shortcoming while retaining the advantages of the algorithm: Nodes don't need to memorize the reception of a message to guarantee termination and messages are sent at most twice per edge. This extension allows to solve more general broadcast tasks such as multi-source broadcasts and concurrent broadcasts for systems with bounded channel capacities.

关键词： Floods

来源：评论

学校读者我要写书评

暂无评论

Fragmented Objects: Boosting Concurrency of Shared Large Objects 28th

Fragmented Objects: Boosting Concurrency of Shared Large Obj...

引用

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

作者： Anta, Antonio Fernandez Georgiou, Chryssis Hadjistasi, Theophanis Nicolaou, Nicolas Stavrakis, Efstathios Trigeorgi, Andria IMDEA Networks Inst Madrid Spain Univ Cyprus Nicosia Cyprus Algolysis Ltd Limassol Cyprus

ISBN: (纸本)9783030795269;9783030795276

This work examines strategies to handle large shared data objects in distributed storage systems (DSS), while boosting the number of concurrent accesses, maintaining strong consistency guarantees, and ensuring good operation performance. To this respect, we define the notion of fragmented objects: concurrent objects composed of a list of fragments (or blocks) that allow operations to manipulate each of their fragments individually. As the fragments belong to the same object, it is not enough that each fragment is linearizable to have useful consistency guarantees in the composed object. Hence, we capture the consistency semantic of the whole object with the notion of fragmented linearizability. Then, considering that a variance of linearizability, coverability, is more suited for versioned objects like files, we provide an implementation of a distributed file system, called CoBFS, that utilizes coverable fragmented objects (i.e., files). In CoBFS, each file is a linked-list of coverable block objects. Preliminary emulation of CoBFS demonstrates the potential of our approach in boosting the concurrency of strongly consistent large objects.

关键词： Distributed storage Large objects Linearizability Coverability

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Submodular Maximization over Integer Lattice 10th

Differentially Private Submodular Maximization over Integer ...

引用

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

作者： Hu, Jiaming Xu, Dachuan Du, Donglei Miao, Cuixia Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Beijing Univ Technol Beijing Inst Sci & Engn Comp Beijing 100124 Peoples R China Univ New Brunswick Fac Management Fredericton NB E3B 5A3 Canada Qufu Normal Univ Sch Math Sci Qufu 273165 Shandong Peoples R China

ISBN: (纸本)9783030914349;9783030914332

Many machine learning problems, such as medical data summarization and social welfare maximization, can be modeled as the problems of maximizing monotone submodular functions. Differentially private submodular functions under cardinality constraints are first proposed and studied to solve the Combinatorial Public Projects (CPP) problem, in order to protect personal data privacy while processing sensitive data. However, the research of these functions for privacy protection has received little attention so far. In this paper, we propose to study the differentially private submodular maximization problem over the integer lattice. Our main contributions are to present differentially private approximation algorithms for both DR-submodular and integer submodular function maximization problems under cardinality constraints and analyze the sensitivity of our algorithms.

关键词： Integer submodular Differentially private DR-submodular

来源：评论

学校读者我要写书评

暂无评论

MIC Model for Cervical Cancer Risk Factors Deep Association Analysis 10th

MIC Model for Cervical Cancer Risk Factors Deep Association ...

引用

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

作者： Zhou, Tiehua Tang, Yingxuan Gong, Ling Xie, Hua Shan, Minglei Wang, Ling Northeast Elect Power Univ Sch Comp Sci Dept Comp Sci & Technol Jilin Jilin Peoples R China Beihua Univ Dept Nursing Jilin Jilin Peoples R China Jilin Cent Gen Hosp Jilin Jilin Peoples R China

ISBN: (纸本)9783030914349;9783030914332

Prevention of cervical cancer (CC) is challenging due to unobvious early symptoms and the complexity of influencing factors. There are many risk factors for CC including the direct risk factors and indirect risk factors that may be caused by other diseases or reasons. In this paper, we proposed a MIC (Multiple Indicators Correlation) model to resolve the problem of analyzing risk factors by establishing the indicators structure. Based on the close relationship of indicators shown in the literature, the strength of relationship among indicators is calculated through the method of correlation analysis, and then strong association rules of CC were dug by computing the relationship of indicators combination and disease from electronic medical records (EMR). Experiment shows that though calculating the strength of multi-indicator joint influence, MIC model solves the problem of unstructured and many missing values for the data of EMR, it has better accuracy in prediction of CC.

关键词： Cervical cancer risk factors Association rules Deep association analysis Data mining NLP

来源：评论

学校读者我要写书评

暂无评论

Event-B Formalization of Event-B Contexts 8th

Event-B Formalization of Event-B Contexts

引用

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

作者： Bodeveix, Jean-Paul Filali, Mamoun IRIT UPS 118 Route Narbonne F-31062 Toulouse France IRIT CNRS 118 Route Narbonne F-31062 Toulouse France

ISBN: (纸本)9783030775421;9783030775438

This paper presents an Event-B meta-modelisation of an Event-B project restricted to its context hierarchy which introduces the functional part of a development through sets, constants, axioms and theorems. We study the proposal of a new mechanism for Event-B. It consists in allowing to instantiate in a new context an already proved theorem in a given context. We investigate the validation of the instantiation mechanism in order to prove the validity of imported theorems. We also compare the proposal with similar mechanisms available within some existing theorem provers.

关键词： Formal methods Event-B Meta modelisation

来源：评论

学校读者我要写书评

暂无评论

Analysing ProB's Constraint Solving Backends What Do They Know? Do They Know Things? Let's Find Out! 7th

Analysing ProB's Constraint Solving Backends What Do They Kn...

引用

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

作者： Dunkelau, Jannik Schmidt, Joshua Leuschel, Michael Heinrich Heine Univ Dusseldorf Inst Informat Univ Str 1 D-40225 Dusseldorf Germany

ISBN: (纸本)9783030480769;9783030480776

We evaluate the strengths and weaknesses of different backends of the ProB constraint solver. For this, we train a random forest over a database of constraints to classify whether a backend is able to find a solution within a given amount of time or answers unknown. The forest is then analysed in regards of feature importances to determine subsets of the B language in which the respective backends excel or lack for performance. The results are compared to our initial assumptions over each backend's performance in these subsets based on personal experiences. While we do employ classifiers, we do not aim for a good predictor, but are rather interested in analysis of the classifier's learned knowledge over the utilised B constraints. The aim is to strengthen our knowledge of the different tools at hand by finding subsets of the B language in which a backend performs better than others.

关键词： Constraint solving Machine learning Decision trees Feature importances Association rules Automated tool selection

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：