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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,301 篇 会议
53 篇 期刊文献
1 册 图书

馆藏范围

1,355 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,071 篇 工学
- 1,039 篇 计算机科学与技术...
- 439 篇 软件工程
- 152 篇 信息与通信工程
- 149 篇 电气工程
- 74 篇 控制科学与工程
- 41 篇 网络空间安全
- 17 篇 电子科学与技术（可...
- 7 篇 化学工程与技术
- 6 篇 农业工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物工程
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 4 篇 交通运输工程
297 篇 理学
- 271 篇 数学
- 68 篇 统计学（可授理学、...
- 17 篇 物理学
- 9 篇 系统科学
- 8 篇 化学
- 7 篇 生物学
60 篇 管理学
- 32 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 19 篇 工商管理
18 篇 教育学
- 18 篇 教育学
10 篇 经济学
- 10 篇 应用经济学
10 篇 法学
- 7 篇 社会学
- 4 篇 法学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

244 篇 distributed comp...
95 篇 distributed algo...
78 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
28 篇 distributed syst...
23 篇 approximation al...
23 篇 computer systems...
23 篇 algorithms
23 篇 congest model
22 篇 local model
21 篇 fault tolerance
21 篇 distributed grap...
19 篇 cloud computing
17 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 graph algorithms
14 篇 fault-tolerance
14 篇 randomized algor...

机构

30 篇 swiss fed inst t...
26 篇 technion haifa
18 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 univ michigan an...
11 篇 tel aviv univ te...
11 篇 aalto univ espoo
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 natl univ singap...
8 篇 weizmann inst sc...
8 篇 ben gurion univ ...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 technion
6 篇 ecole polytech f...
6 篇 cnrs
5 篇 georgetown univ ...
5 篇 univ toronto on

作者

25 篇 kuhn fabian
22 篇 ghaffari mohsen
19 篇 censor-hillel ke...
18 篇 suomela jukka
17 篇 raynal michel
17 篇 pandurangan gopa...
16 篇 chang yi-jun
16 篇 elkin michael
16 篇 fraigniaud pierr...
15 篇 wattenhofer roge...
14 篇 peleg david
14 篇 toueg sam
14 篇 kutten shay
14 篇 brandt sebastian
13 篇 balliu alkida
13 篇 patt-shamir boaz
13 篇 maus yannic
13 篇 olivetti dennis
13 篇 guerraoui rachid
12 篇 rajsbaum sergio

语言

1,328 篇 英文
26 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"

共 1355 条记录，以下是141-150 订阅

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

详细简洁

排序：

Contention Resolution with Predictions 21

Contention Resolution with Predictions

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Gilbert, Seth Newport, Calvin Vaidya, Nitin Weaver, Alex Natl Univ Singapore Singapore Singapore Georgetown Univ Washington DC 20057 USA

ISBN: (纸本)9781450385480

In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network sizes that predicts the likelihood of each size occurring. The goal is to leverage the predictive power of this distribution to improve on worst-case time complexity bounds. Using a novel connection between contention resolution and information theory, we prove lower bounds on the expected time complexity with respect to the Shannon entropy of the corresponding network size random variable, for both the collision detection and no collision detection assumptions. We then analyze upper bounds for these settings, assuming now that the distribution provided as input might differ from the actual distribution generating network sizes. We express their performance with respect to both entropy and the statistical divergence between the two distributions-allowing us to quantify the cost of poor predictions. Finally, we turn our attention to the related perfect advice setting, parameterized with a length b >= 0, in which all active processes in a given execution are provided the best possible b bits of information about their network. We provide tight bounds on the speed-up possible with respect to b for deterministic and randomized algorithms, with and without collision detection. These bounds provide a fundamental limit on the maximum power that can be provided by any predictive model with a bounded output size.

关键词： distributed algorithms contention resolution

来源：评论

学校读者我要写书评

暂无评论

Deterministic distributed DFS via Cycle Separators in Planar Graphs 25

Deterministic Distributed DFS via Cycle Separators in Planar...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Benjamin Jauregui Pedro Montealegre Ivan Rapaport Universidad de Chile Santiago Chile Universidad Adolfo Ibáñez Santiago Chile

ISBN: (纸本)9798400718854

One of the most basic techniques in algorithm design consists of breaking a problem into subproblems and then proceeding recursively. In the case of graph algorithms, one way to implement this approach is through separator sets. Given a graph G = (V, E), a subset of nodes S ⊆ V is called a separator set of G if the size of each connected component of G - S is at most 2/3 · |V|. The most useful separator sets are those that satisfy certain restrictions of cardinality or *** this work, we present the first deterministic algorithm in the distributed CONGEST model that recursively computes a cycle separator over planar graphs in Õ(D) rounds. This result, as in the centralized setting, has significant implications in the area of distributed planar algorithms. In fact, from this result, we can construct a deterministic algorithm that computes a DFS tree in Õ(D) rounds. This matches both the best-known randomized algorithm of Ghaffari and Parter (DISC, 2017) and, up to polylogarithmic factors, the trivial lower bound of Ω(D) rounds.

关键词： deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Security and Privacy for distributed Optimization & distributed Machine Learning 21

Security and Privacy for Distributed Optimization & Distribu...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Vaidya, Nitin H. Georgetown Univ Washington DC 20057 USA

ISBN: (纸本)9781450385480

The tutorial will include an introduction to (i) distributed optimization and distributed machine learning, (ii) security or fault-tolerance for distributed optimization and learning, and (iii) privacy in distributed optimization and learning. The presentation will cover the basic principles, and some representative solutions. Server-based and peer-to-peer solutions will be discussed. In particular, Byzantine fault-tolerant algorithms for distributed optimization and learning will be discussed. Privacy mechanisms to be discussed include differential privacy and its variations for systems based on multiple servers.

关键词： distributed optimization and learning Fault-tolerance Secure and privacy-preserving optimization

来源：评论

学校读者我要写书评

暂无评论

On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures 36

On Implementing SWMR Registers from SWSR Registers in System...

引用

36th International symposium on distributed computing, DISC 2022

作者： Hu, Xing Toueg, Sam Department of Computer Science University of Toronto Canada

ISBN: (纸本)9783959772556

The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport's pioneering work [14], this problem has been extensively studied in the context of asynchronous processes with crash failures. In this paper, we investigate this problem in the context of Byzantine process failures, with and without process signatures. In particular, we first show a strong impossibility result, namely, that there is no wait-free linearizable implementation of a 1-writer n-reader register from atomic 1-writer (n - 1)-reader registers. In fact, this impossibility result holds even if all the processes except the writer are given atomic 1-writer n-reader registers, and even if we assume that the writer can only crash and at most one reader is subject to Byzantine failures. In light of this impossibility result, we give two register implementations. The first one implements a 1-writer n-reader register from atomic 1-writer 1-reader registers. This implementation is linearizable (under any combination of Byzantine process failures), but it is wait-free only under the assumption that the writer is correct or no reader is Byzantine - thus matching the impossibility result. The second implementation assumes process signatures;it is wait-free and linearizable under any number and combination of Byzantine process failures. © Xing Hu and Sam Toueg.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal distributed Computation of Small Vertex Cuts 36

Near-Optimal Distributed Computation of Small Vertex Cuts

引用

36th International symposium on distributed computing, DISC 2022

作者： Parter, Merav Petruschka, Asaf Weizmann Institute Rehovot Israel

ISBN: (纸本)9783959772556

We present near-optimal algorithms for detecting small vertex cuts in the CONGEST model of distributed computing. Despite extensive research in this area, our understanding of the vertex connectivity of a graph is still incomplete, especially in the distributed setting. To this date, all distributed algorithms for detecting cut vertices suffer from an inherent dependency in the maximum degree of the graph, ∆. Hence, in particular, there is no truly sub-linear time algorithm for this problem, not even for detecting a single cut vertex. We take a new algorithmic approach for vertex connectivity which allows us to bypass the existing ∆ barrier. As a warm-up to our approach, we show a simple Õ(D)-round1 randomized algorithm for computing all cut vertices in a D-diameter n-vertex graph. This improves upon the O(D + ∆/log n)-round algorithm of [Pritchard and Thurimella, ICALP 2008]. Our key technical contribution is an Õ(D)-round randomized algorithm for computing all cut pairs in the graph, improving upon the state-of-the-art O(∆ · D)4-round algorithm by [Parter, DISC'19]. Note that even for the considerably simpler setting of edge cuts, currently Õ(D)-round algorithms are currently known only for detecting pairs of cut edges. Our approach is based on employing the well-known linear graph sketching technique [Ahn, Guha and McGregor, SODA 2012] along with the heavy-light tree decomposition of [Sleator and Tarjan, STOC 1981]. Combining this with a careful characterization of the survivable subgraphs, allows us to determine the connectivity of G \ {x, y} for every pair x, y ∈ V, using Õ(D)-rounds. We believe that the tools provided in this paper are useful for omitting the ∆-dependency even for larger cut values. © Merav Parter and Asaf Petruschka.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

The Topology of Randomized Symmetry-Breaking distributed computing 21

The Topology of Randomized Symmetry-Breaking Distributed Com...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Fraigniaud, Pierre Gelles, Ran Lotker, Zvi Univ Paris Paris France CNRS Paris France Bar Ilan Univ Ramat Gan Israel

ISBN: (纸本)9781450385480

Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic algorithms. In a nutshell, this approach consists of capturing all the possible states of a distributed system at a certain time as a simplicial complex called protocol complex, and viewing computation as a simplicial map from that complex to the so-called output complex, that captures all possible legal output states of the system. This paper aims at studying randomized synchronous distributed computing through the lens of algebraic topology. We do so by studying the wide class of (input-free) symmetry-breaking tasks, e.g., leader election, in synchronous fault-free anonymous systems. We show that it is possible to redefine solvability of a task "locally", i.e., for each simplex of the protocol complex individually, without requiring any global consistency. However, this approach has a drawback: it eliminates the topological aspect of the computation, since a single facet has a trivial topological structure. To overcome this issue, we introduce a "projection" pi of both protocol and output complexes, where every simplex.. is mapped to a complex pi (sigma);the later has a rich structure that replaces the structure we lost by considering one single facet at a time. To show the significance and applicability of our topological approach, we derive necessary and sufficient conditions for solving leader election in synchronous fault-free anonymous sharedmemory and message-passing models. In both models, we consider scenarios in which there might be correlations between the random values provided to the nodes. In particular, different parties might have access to the same randomness source so their randomness is not independent but equal. Interestingly, we find that solvability of leader election relates to the number of parties that posse

关键词： distributed computing lower bounds algebraic topology correlated randomness leader election

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Temporal Locality in Online Algorithms 36

Brief Announcement: Temporal Locality in Online Algorithms

引用

36th International symposium on distributed computing, DISC 2022

作者： Pacut, Maciej Parham, Mahmoud Rybicki, Joel Schmid, Stefan Suomela, Jukka Tereshchenko, Aleksandr Technische Universität Berlin Germany Faculty of Computer Science Universität Wien Austria Institute of Science and Technology Austria Klosterneuburg Austria TU Berlin Germany Fraunhofer SIT Berlin Germany Aalto University Espoo Finland

ISBN: (纸本)9783959772556

Online algorithms make decisions based on past inputs, with the goal of being competitive against an algorithm that sees also future inputs. In this work, we introduce time-local online algorithms;these are online algorithms in which the output at any given time is a function of only T latest inputs. Our main observation is that time-local online algorithms are closely connected to local distributed graph algorithms: distributed algorithms make decisions based on the local information in the spatial dimension, while time-local online algorithms make decisions based on the local information in the temporal dimension. We formalize this connection, and show how we can directly use the tools developed to study distributed approximability of graph optimization problems to prove upper and lower bounds on the competitive ratio achieved with time-local online algorithms. Moreover, we show how to use computational techniques to synthesize optimal time-local algorithms. © Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Download from an External Data Source in Byzantine Majority Settings 25

Brief Announcement: Distributed Download from an External Da...

引用

proceedings of the acm symposium on principles of distributed computing

作者： John Augustine Soumyottam Chatterjee Valerie King Manish Kumar Shachar Meir David Peleg Indian Institute of Technology Madras Chennai Tamil Nadu India University of Victoria Victoria British Columbia Canada The Weizmann institute of science Rehovot Israel The Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9798400718854

We consider the Download problem in the Data Retrieval Model, introduced in (DISC'24), where a distributed set of peers, some of which may be Byzantine, seek to learn n bits of data stored at a trustworthy external data source. Each bit of data can be learned by a peer either through a direct (costly) query of the source or through other peers that have already learned it; the goal is to design a collaborative protocol that reduces the maximum number of bits queried by any one peer ("query complexity"). We achieve optimal query complexity in a synchronous fully connected network with resilience to any constant fraction β < 1 of Byzantine peers, under varying assumptions regarding time and message size.A full version of the paper is available at [2].

关键词： byzantine fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Locally Checkable Problems in Rooted Trees 21

Locally Checkable Problems in Rooted Trees

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Balliu, Alkida Brandt, Sebastian Olivetti, Dennis Studeny, Jan Suomela, Jukka Tereshchenko, Aleksandr Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland Aalto Univ Espoo Finland

ISBN: (纸本)9781450385480

Consider any locally checkable labeling problem Pi in rooted regular trees: there is a finite set of labels Sigma, and for each label x is an element of Sigma we specify what are permitted label combinations of the children for an internal node of label x (the leaf nodes are unconstrained). This formalism is expressive enough to capture many classic problems studied in distributed computing, including vertex coloring, edge coloring, and maximal independent set. We show that the distributed computational complexity of any such problem Pi falls in one of the following classes: it is O(1), Theta(log* n), Theta(log n), or n(Theta)(1) rounds in trees with n nodes (and all of these classes are nonempty). We show that the complexity of any given problem is the same in all four standard models of distributed graph algorithms: deterministic LOCAL, randomized LOCAL, deterministic CONGEST, and randomized CONGEST model. In particular, we show that randomness does not help in this setting, and the complexity class Theta(log log n) does not exist (while it does exist in the broader setting of general trees). We also show how to systematically determine the complexity class of any such problem Pi, i.e., whether II takes Theta(1), Theta(log* n), Theta(log n), or n(Theta(1)) rounds. While the algorithm may take exponential time in the size of the description of II, it is nevertheless practical: we provide a freely available implementation of the classifier algorithm, and it is fast enough to classify many problems of interest.

关键词： distributed algorithms LOCAL model CONGEST model Rooted trees LCL problems

来源：评论

学校读者我要写书评

暂无评论

Emotional Design and User Study on Guidance System For MR distributed Collaboration 10

Emotional Design and User Study on Guidance System For MR Di...

引用

Joint Meeting of the 10th International symposium of Chinese CHI (Chinese CHI) / International Workshop on Human-Engaged computing (IWHEC)

作者： Liang, Xiaozhan Hu, Yong Li, Chuchen Beihang Univ Sch New Media Art & Design Beijing Peoples R China Beihang Univ Yunnan Innovat Inst Beijing Peoples R China Beihang Univ State Key Lab Virtual Real Technol & Syst Beijing Peoples R China

ISBN: (纸本)9781450398695

In recent years, especially after the outbreak of COVID-19, the applications of distributed collaboration in mixed reality (MR) environment has developed rapidly. Due to the cutting-edge technology and the specialized nature of the equipment, many studies have focused on the design of tutorials in MR, but few studies have taken the factors of emotional design into consideration. Since the perception of the state among users is based on their avatar firstly, which is helpful for users' perceptions about collaborative content in novice guidance. Based on Norman's principles of reflective design and James' theory about the experience self, we built a MR virtual sandtable collaboration system, which contains three guiding parts that are the full practice of theoretical research. Furthermore, We generated three progressive levels of emotional solutions in guidance design and conducted user experience research to explore the impact of three different degrees of emotional design, summarizing the applicable paradigm of novice guidance of emotional design in MR distributed collaborative scenarios. Through the evaluation and analysis of SUS model and task load, we found that novice guidance with a higher emotional design level, which combines static graphics, dynamic hand models and conversational voice would result in a better user experience.

关键词： Human-centered computing Interaction design Interaction design theory Concepts and paradigms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：