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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,307 篇 会议
55 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

1,074 篇 工学
- 1,045 篇 计算机科学与技术...
- 459 篇 软件工程
- 168 篇 电气工程
- 148 篇 信息与通信工程
- 76 篇 控制科学与工程
- 41 篇 网络空间安全
- 19 篇 电子科学与技术（可...
- 9 篇 农业工程
- 7 篇 建筑学
- 7 篇 化学工程与技术
- 6 篇 机械工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 仪器科学与技术
302 篇 理学
- 274 篇 数学
- 67 篇 统计学（可授理学、...
- 17 篇 物理学
- 11 篇 系统科学
- 9 篇 生物学
- 8 篇 化学
- 4 篇 大气科学
71 篇 管理学
- 39 篇 管理科学与工程(可...
- 33 篇 图书情报与档案管...
- 24 篇 工商管理
12 篇 经济学
- 12 篇 应用经济学
12 篇 教育学
- 12 篇 教育学
9 篇 法学
- 7 篇 社会学
9 篇 农学
- 9 篇 作物学
1 篇 医学

主题

243 篇 distributed comp...
88 篇 distributed algo...
79 篇 distributed comp...
31 篇 distributed algo...
31 篇 consensus
29 篇 distributed syst...
26 篇 cloud computing
25 篇 algorithms
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 fault tolerance
20 篇 local model
19 篇 message passing
18 篇 distributed grap...
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 fault-tolerance
14 篇 randomized algor...
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
15 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 tel aviv univ te...
10 篇 natl univ singap...
9 篇 ben gurion univ ...
9 篇 technion dept co...
9 篇 aalto univ espoo
8 篇 weizmann inst sc...
8 篇 univ michigan an...
8 篇 carnegie mellon ...
7 篇 ben gurion univ ...
6 篇 cispa helmholtz ...
6 篇 national univers...
6 篇 st. olaf college...
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...
5 篇 ecole polytech f...

作者

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

语言

1,356 篇 英文
6 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2013 ACM symposium on Principles of distributed computing"

共 1363 条记录，以下是201-210 订阅

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

详细简洁

排序：

Differential Privacy in distributed Environments: An Overview and Open Questions 21

Differential Privacy in Distributed Environments: An Overvie...

引用

proceedings of the 2021 acm symposium on principles of distributed computing

作者： Cynthia Dwork Harvard University & Radcliffe Institute for Advanced Study Cambridge MA USA

ISBN: (纸本)9781450385480

Differential privacy is a mathematically rigorous definition of privacy tailored to statistical analysis of large datasets. Differentially private algorithms are equipped with a parameter which controls the formal measure of privacy loss. All algorithms have utility/privacy tradeoffs, and the goal of algorithmic research in differential privacy is to optimize this *** privacy is most widely studied in the centralized model, in which a trusted and trustworthy curator has access to raw data. Deployment in industry has focused on the local model, where privacy is "rolled into" the data on the client via randomization before being collected. There is a separation between the power of the centralized and local *** a brief recap of differential privacy and its properties, we will survey a few highlights of differential privacy in a variety of distributed settings that lie between the local and centralized models, and conclude with suggestions for future research.

关键词： differential privacy distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

On distributed Listing of Cliques 20

On Distributed Listing of Cliques

引用

39th symposium on principles of distributed computing

作者： Censor-Hillel, Keren Le Gall, Francois Leitersdorf, Dean Technion Dept Comp Sci Haifa Israel Nagoya Univ Grad Sch Math Nagoya Aichi Japan

ISBN: (纸本)9781450375825

We show an (O) over tilde (n(p/(p+2)))-round algorithm in the CONGEST model for listing of K-p (a clique with p nodes), for all p = 4, p >= 6. For p = 5, we show an (O) over tilde (n(3/4))-round algorithm. For p = 4 and p = 5, our results improve upon the previous state-of-the-art of O(n(5/6+o(1))) and O(n(21/22+o(1))), respectively, by Eden et al. [DISC 2019]. For all p >= 6, ours is the first sub-linear round algorithm for Kp listing. We leverage the recent expander decomposition algorithm of Chang et al. [SODA 2019] to create clusters with a good mixing time. Three key novelties in our algorithm are: (1) we carefully iterate our listing process with coupled values of min-degree within the clusters and arboricity outside the clusters, (2) all the listing is done within the cluster, which necessitates new techniques for bringing into the cluster the information about all edges that can potentially form K-p instances with the cluster edges, and (3) within each cluster we use a sparsity-aware listing algorithm, which is faster than a general listing algorithm and which we can allow the cluster to use since we make sure to sparsify the graph as the iterations proceed. As a byproduct of our algorithm, we show an optimal sparsityaware algorithm for K-p listing, which runs in Theta(1 + m/n(1+2/p)) rounds in the CONGESTED CLIQUE model. Previously, Pandurangan et al. [SPAA 2018], Chang et al. [SODA 2019], and Censor-Hillel et al. [TCS 2020] showed sparsity-aware algorithms for the case of p = 3, yet ours is the first such sparsity aware algorithm for p >= 4.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A deterministic almost-tight distributed algorithm for approximating single-source shortest paths

A deterministic almost-tight distributed algorithm for appro...

引用

作者： Henzinger, Monika Krinninger, Sebastian Nanongkai, Danupon Faculty of Computer Science University of Vienna Vienna1090 Austria Department of Computer Sciences University of Salzburg Salzburg5020 Austria Department of Theoretical Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden

We present a deterministic (1 + o(1))-approximation (n1/2+o(1) + D1+o(1))-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model);here n is the number of nodes in the network, D is its (hop) diameter, and edge weights are positive integers from 1 to poly(n). This is the first nontrivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized (1 + o(1))-approximation Õ(√nD1/4 + D)-time algorithm of Nanongkai [in proceedings of STOC, 2014, pp. 565-573] by a factor of as large as n1/8, and (ii) the O(∊-1 log ∊ -1)-approximation factor of Lenzen and Patt-Shamir's Õ(n1/2+∊ + D)-time algorithm [in proceedings of STOC, 2013, pp. 381-390] within the same running time. (Throughout, we use Õ(·) to hide polylogarithmic factors in n.) Our running time matches the known time lower bound of Ω (√n/log n + D) [M. Elkin, SIAM J. Comput., 36 (2006), pp. 433-456], thus essentially settling the status of this problem which was raised at least a decade ago [M. Elkin, SIGACT News, 35 (2004), pp. 40-57]. It also implies a (2 + o(1))-approximation (n1/2+o(1) + D1+o(1))- time algorithm for approximating a network's weighted diameter which almost matches the lower bound by Holzer and Pinsker [in proceedings of OPODIS, 2015, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, Germany, 2016, 6]. In achieving this result, we develop two techniques which might be of independent interest and useful in other settings: (i) a deterministic process that replaces the ``hitting set argument"" commonly used for shortest paths computation in various settings, and (ii) a simple, deterministic construction of an (no(1), o(1))-hop set of size n1+o(1). We combine these techniques with many distributed algorithmic techniques, some of which are from problems that are not directly related to shortest paths, e.g., ruling sets [A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, SIAM J. Discrete Math., 1 (1988),

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Beyond CS principles: Bringing the Frontiers of computing to K12 21

Beyond CS Principles: Bringing the Frontiers of Computing to...

引用

proceedings of the 52nd acm Technical symposium on Computer Science Education

作者： Ákos Lédeczi Shuchi Grover Veronica Catete Brian Broll Vanderbilt University Nashville TN USA Looking Glass Venture Palo Alto CA USA North Carolina State University Raleigh NC USA

ISBN: (纸本)9781450380621

The AP Computer Science principles (CSP) high school course introduces students to computer science and programming. What should motivated students study after successful completion of AP CSP? The AP CSA class teaches Java programming and it has traditionally not attracted students from underrepresented groups. We are working on an alternative, projects-based course that will teach cutting edge CS concepts, such as distributed computing, computer networking, cybersecurity, the internet of things and machine learning, in a hands-on, accessible manner. Such an approach enables students to work on problems that interest them making computing more relevant and the curriculum more engaging. We utilize NetsBlox, a collaborative, block-based programming environment that extends Snap! with a few carefully selected abstractions that open up the vast array of resources freely available on the internet for student programs. Moreover, the tool enables students to work together on the same project remotely similarly to how Google Docs operate. This demonstration will introduce the environment and highlight its utility in creating distributed applications such as a shared whiteboard app and projects that access public domain scientific data sources and visualize them in various ways using online services such as Google Maps or charting. More information is available at https://***.

关键词： distributed computing block-based programming internet of things computer networking cybersecurity

来源：评论

学校读者我要写书评

暂无评论

Dynamic scaling for low-precision learning 21

Dynamic scaling for low-precision learning

引用

proceedings of the 26th acm SIGPLAN symposium on principles and Practice of Parallel Programming

作者： Ruobing Han Min Si James Demmel Yang You Peking University Argonne National Laboratory UC Berkeley National University of Singapore

ISBN: (纸本)9781450382946

In recent years, distributed deep learning is becoming popular in industry and academia. Although researchers want to use distributed systems for training, it has been reported that the communication cost for synchronizing gradients can be a bottleneck. Using low-precision gradients is a promising technique for reducing the bandwidth requirement. In this work, we propose Auto Precision Scaling (APS), an algorithm that can improve the accuracy when we communicate gradients by low-precision floating-point values. APS can improve the accuracy for all precisions with a trivial communication cost. Our experimental results show that for both image classification and segmentation, applying APS can train the state-of-the-art models by 8-bit floating-point gradients with no or only a tiny accuracy loss (<0.05%). Furthermore, we can avoid any accuracy loss by designing a hybrid-precision technique. Finally, we propose a performance model to evaluate the proposed method. Our experimental results show that APS can get a significant speedup over the state-of-the-art method. To make it available to researchers and developers, we design and implement a high-performance system for customized precision Deep Learning(CPD), which can simulate the training process using an arbitrary low-precision customized floating-point format. We integrate CPD into PyTorch and make it open-source to the public1.

关键词： distributed training

来源：评论

学校读者我要写书评

暂无评论

Plain SINR is Enough! 19

Plain SINR is Enough!

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Halldorsson, Magnus M. Tonoyan, Tigran Reykjav Univ Dept Comp Sci ICE TCS Reykjavik Iceland

ISBN: (纸本)9781450362177

We develop randomized distributed algorithms for many of the most fundamental communication problems in the wireless SINR model, including (multi-message) broadcast, local broadcast, coloring, MIS, and aggregation. The complexity of the algorithms is optimal up to polylogarithmic preprocessing time. It shows - contrary to expectation - that the plain vanilla SINR model is just as powerful and fast (modulo the preprocessing) as various extensions studied, including power control, carrier sense, collision detection, free acknowledgements, and GPS location. A key component of the algorithms is an efficient simulation of Congest algorithms on a constant-density SINR backbone.

关键词： wireless network distributed algorithm plain SINR

来源：评论

学校读者我要写书评

暂无评论

The distributed Complexity of Locally Checkable Problems on Paths is Decidable 19

The Distributed Complexity of Locally Checkable Problems on ...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Balliu, Alkida Brandt, Sebastian Chang, Yi-Jun Olivetti, Dennis Rabie, Mikael Suomela, Jukka Aalto Univ Helsinki Finland Swiss Fed Inst Technol Zurich Switzerland Univ Michigan Ann Arbor MI 48109 USA Univ Paris IRIF Paris France

ISBN: (纸本)9781450362177

Consider a computer network that consists of a path with n nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints-more formally, we have an LCL (locally checkable labeling) problem. How many communication rounds are needed (in the standard LOCAL model of computing) to solve this problem? It is well known that the answer is always either O(1) rounds, or Theta(log* n) rounds, or Theta(n) rounds. In this work we show that this question is decidable (albeit PSPACE-hard): we present an algorithm that, given any LCL problem defined on a path, outputs the distributed computational complexity of this problem and the corresponding asymptotically optimal algorithm.

关键词： distributed computing complexity decidability

来源：评论

学校读者我要写书评

暂无评论

Hardness of Minimal Symmetry Breaking in distributed computing 19

Hardness of Minimal Symmetry Breaking in Distributed Computi...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Balliu, Alkida Hirvonen, Juho Olivetti, Dennis Suomela, Jukka Aalto Univ Helsinki Finland

ISBN: (纸本)9781450362177

A graph is weakly 2-colored if the nodes are labeled with colors black and white such that each black node is adjacent to at least one white node and vice versa. In this work we study the distributed computational complexity of weak 2-coloring in the standard LOCAL model of distributed computing, and how it is related to the distributed computational complexity of other graph problems. First, we show that weak 2-coloring is a minimal distributed symmetry-breaking problem for regular even-degree trees and highgirth graphs: if there is any non-trivial locally checkable labeling problem that is solvable in o(log* n) rounds with a distributed graph algorithm in the middle of a regular even-degree tree, then weak 2-coloring is also solvable in o(log* n) rounds there. Second, we prove a tight lower bound of Omega(log* n) for the distributed computational complexity of weak 2-coloring in regular trees;previously only a lower bound of Omega(log log* n) was known. By minimality, the same lower bound holds for any non-trivial locally checkable problem inside regular even-degree trees.

关键词： distributed complexity theory graph algorithms locally checkable labelings LOCAL model

来源：评论

学校读者我要写书评

暂无评论

Deterministic distributed Dominating Set Approximation in the CONGEST Model 19

Deterministic Distributed Dominating Set Approximation in th...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Deurer, Janosch Kuhn, Fabian Maus, Yannic Univ Freiburg Freiburg Germany Technion Haifa Israel

ISBN: (纸本)9781450362177

We develop deterministic approximation algorithms for the minimum dominating set problem in the CONGEST model with an almost optimal approximation guarantee. For epsilon > 1/ poly log Delta we obtain two algorithms with approximation factor (1 + epsilon) (1 + ln(Delta + 1)) and with runtimes 2(O(root log n log log n)) and O(Delta poly log Delta + poly log Delta log* n), respectively. Further we show how dominating set approximations can be deterministically transformed into a connected dominating set in the CONGEST model while only increasing the approximation guarantee by a constant factor. This results in a deterministicO(log Delta)-approximation algorithm for the minimum connected dominating set with time complexity 2(O(root log n log log n)).

关键词： dominating set approximation CONGEST model

来源：评论

学校读者我要写书评

暂无评论

Implementing Mediators with Asynchronous Cheap Talk 19

Implementing Mediators with Asynchronous Cheap Talk

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Abraham, Ittai Dolev, Danny Geffner, Ivan Halpern, Joseph Y. VMWARE Palo Alto CA 94304 USA Hebrew Univ Jerusalem Jerusalem Israel Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450362177

A mediator can help non-cooperative agents obtain an equilibrium that may otherwise not be possible. We study the ability of players to obtain the same equilibrium without a mediator, using only cheap talk, that is, nonbinding pre-play communication. Previous work has considered this problem in a synchronous setting. Here we consider the effect of asynchrony on the problem, and provide upper bounds for implementing mediators. Considering asynchronous environments introduces new subtleties, including exactly what solution concept is most appropriate and determining what move is played if the cheap talk goes on forever. Different results are obtained depending on whether the move after such "infinite play" is under the control of the players or part of the description of the game.

关键词： distributed computing game theory security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共137页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：