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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

distributed Averaging in Opinion Dynamics 23

Distributed Averaging in Opinion Dynamics

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Berenbrink, P. Cooper, C. Gava, C. Mallmann-Trenn, F. Radzik, T. Marzagao, D. Kohan Rivera, N. Univ Hamburg Hamburg Germany Kings Coll London London England Univ Oxford Oxford England Univ Valparaiso Valparaiso Chile

ISBN: (纸本)9798400701214

We consider two simple asynchronous opinion dynamics on arbitrary graphs where every node u of the graph has an initial value xi(u)(0). In the first process, which we call the Nodemodel, at each time step t >= 0, a random node.. and a random sample of k of its neighbours v(1), v(2), . . . , v(k) are selected. Then, u updates its current value xi(u)(t) to xi(u)(t + 1) = alpha xi(u) (t) + (1-alpha)/k Sigma(k)(i-1) xi(vi)(t), where alpha is an element of(0, 1) and k >= 1 are parameters of the process. In the second process, called the. Edgemodel, at each step a random pair of adjacent nodes (u , v) is selected, and then nodeu updates its value equivalently to the Nodemodel with k = 1 and v as the selected neighbour. For both processes, the values of all nodes converge to the same value F, which is a random variable depending on the random choices made in each step. For the Nodemodel and regular graphs, and for the Edgemodel and arbitrary graphs, the expectation of F is the average of the initial values 1/n Sigma(u is an element of V) xi(u)(0). For the Nodemodel and non-regular graphs, the expectation of F is the degree-weighted average of the initial values. Our results are two-fold. We consider the concentration of F and show tight bounds on the variance of F for regular graphs. We show that when the initial values do not depend on the number of nodes, then the variance is negligible, and hence the nodes are able to estimate the initial average of the node values. Interestingly, this variance does not depend on the graph structure. For the proof we introduce a duality between our processes and a process of two correlated random walks. We also analyse the convergence time for both models and for arbitrary graphs, showing bounds on the time T-epsilon required to make all node values 'epsilon-close' to each other. Our bounds are asymptotically tight under some assumptions on the distribution of the initial values.

关键词： distributed Averaging Dual Processes Stochastic Processes Random Walks

来源：评论

学校读者我要写书评

暂无评论

Single Bridge Formation in Self-Organizing Particle Systems 38

Single Bridge Formation in Self-Organizing Particle Systems

引用

38th International symposium on distributed computing, DISC 2024

作者： Oh, Shunhao Briones, Joseph L. Calvert, Jacob Egan, Noah Randall, Dana Richa, Andréa W. School of Computer Science Georgia Institute of Technology AtlantaGA United States School of Computing and Augmented Intelligence Arizona State University TempeAZ United States

ISBN: (纸本)9783959773522

Local interactions of uncoordinated individuals produce the collective behaviors of many biological systems, inspiring much of the current research in programmable matter. A striking example is the spontaneous assembly of fire ants into "bridges" comprising their own bodies to traverse obstacles and reach sources of food. Experiments and simulations suggest that, remarkably, these ants always form one bridge – instead of multiple, competing bridges – despite a lack of central coordination. We argue that the reliable formation of a single bridge does not require sophistication on behalf of the individuals by provably reproducing this behavior in a self-organizing particle system. We show that the formation of a single bridge by the particles is a statistical inevitability of their preferences to move in a particular direction, such as toward a food source, and their preference for more neighbors. Two parameters, η and β, reflect the strengths of these preferences and determine the Gibbs stationary measure of the corresponding particle system’s Markov chain dynamics. We show that a single bridge almost certainly forms when η and β are sufficiently large. Our proof introduces an auxiliary Markov chain, called an "occupancy chain," that captures only the significant, global changes to the system. Through the occupancy chain, we abstract away information about the motion of individual particles, but we gain a more direct means of analyzing their collective behavior. Such abstractions provide a promising new direction for understanding many other systems of programmable matter. © Shunhao Oh, Joseph L. Briones, Jacob Calvert, Noah Egan, Dana Randall, and Andréa W. Richa.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

A Graph Theoretic Approach for Resilient distributed Algorithms 22

A Graph Theoretic Approach for Resilient Distributed Algorit...

引用

acm symposium on principles of distributed computing (PODC)

作者： Parter, Merav Weizmann Inst Sci Rehovot Israel

ISBN: (纸本)9781450392624

Following the immense recent advances in distributed networks, the explosive growth of the Internet, and our increased dependency on these infrastructures, guaranteeing the uninterrupted operation of communication networks has become a major objective in network algorithms. The modern instantiations of distributed networks, such as the Bitcoin network and cloud computing, introduce new security challenges that deserve urgent attention in both theory and practice.

关键词： distributed Graph Algorithms Information Theoretic Security CONGEST

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Annual acm symposium on principles of distributed computing

Proceedings of the Annual ACM Symposium on Principles of Dis...

引用

37th acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2018

ISBN: (纸本)9781450357951

The proceedings contain 62 papers. The topics discussed include: nesting-safe recoverable linearizability: modular constructions for non-volatile memory;deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity;brief announcement: persistent multi-word compare-and-swap;separating lock-freedom from wait-freedom;passing messages while sharing memory;revisionist simulations: a new approach to proving space lower bounds;on the classification of deterministic objects via set agreement power;leveraging indirect signaling for topology inference and fast broadcast;broadcast in radio networks, time vs. energy tradeoffs;round- and message-optimal distributed graph algorithms;improved massively parallel computation algorithms for mismatching, and vertex cover;distributed approximation of minimum k-edge-connected spanning subgraphs;brief announcement: distributed minimum vertex coloring and maximum independent set in chordal graphs;fair leader election for rational agents in asynchronous rings and networks;leader election in well-connected graphs;almost-surely terminating asynchronous byzantine agreement revisited;sublinear message bounds for randomized agreement;tight bounds for asymptotic and approximate consensus;property testing of planarity in the congest model;and locking timestamps versus locking objects.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Cloud-Scale Characterization of Remote Procedure Calls 23

A Cloud-Scale Characterization of Remote Procedure Calls

引用

29th acm symposium on Operating Systems principles (SOSP)

作者： Seemakhupt, Korakit Stephens, Brent E. Khan, Samira Liu, Sihang Wassel, Hassan Yeganeh, Soheil Hassas Snoeren, Alex C. Krishnamurthy, Arvind Culler, David E. Levy, Henry M. Univ Virginia Charlottesville VA 22903 USA Google Mountain View CA USA Univ Utah Salt Lake City UT 84112 USA Univ Waterloo Waterloo ON N2L 3G1 Canada Univ Calif San Diego La Jolla CA 92093 USA Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9798400702297

The global scale and challenging requirements of modern cloud applications have led to the development of complex, widely distributed, service-oriented applications. One enabler of such applications is the remote procedure call (RPC), which provides location-independent communication and hides the myriad of cloud communication complexities and requirements within the RPC stack. Understanding RPCs is thus one key to understanding the behavior of cloud applications. While there have been numerous studies of RPCs in distributed systems, as well as attempts to optimize RPC overheads with both software and hardware, there is still a lack of knowledge about the characteristics of RPCs "in the wild" in the modern cloud environment. To address this gap, we present, to the best of our knowledge, the first large-scale fleet-wide study of RPCs. Our study is conducted at Google, where we measured the infrastructure supporting Google's user-facing, billion-user web services, such as Google Search, Gmail, Maps, and YouTube, and the information and data management systems that support them. To carry out the study, we examined over 10,000 different RPC methods sampled from over one billion traces, along with statistics collected every 30 minutes over a period of nearly two years. Among other things, we consider the volume, throughput and growth rate of RPCs in the datacenter, the latency of RPCs and their components (the "RPC latency tax"), and the structure of RPC call chains. Our analysis shows that the characteristics, scope and complexity of RPCs at hyperscale differ significantly from the assumptions made in prior research. Overall, our work provides new insights into RPC usage and characteristics at the largest scale and motivates further research on optimizing the diverse behavior of this crucial communication mechanism.

关键词： Remote procedure call Cloud computing distributed computing Communications systems

来源：评论

学校读者我要写书评

暂无评论

A distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem 22

A Distributed Combinatorial Topology Approach to Arrow's Imp...

引用

acm symposium on principles of distributed computing (PODC)

作者： Rajsbaum, Sergio Raventos-Pujol, Armajac Univ Nacl Autonoma Mexico Inst Matemat Mexico City Mexico Univ Publ Navarra Madrid Pamplona Dept Estadist Informat Matemat Pamplona Spain Univ Autonoma Madrid Dept Analisis Economico Econ Cuantitativa Madrid Spain

ISBN: (纸本)9781450392624

Baryshnikov presented a remarkable algebraic topology proof of Arrow's impossibility theorem trying to understand the underlying reason behind the numerous proofs of this fundamental result of social choice theory. We present here a novel combinatorial topology approach that does not use advanced mathematics, while giving a geometric intuition of the impossibility. This exposes a remarkable connection with distributed computing techniques. We study in detail the case of two voters, n = 2, and three alternatives, |x| = 3, and show that Arrow's impossibility is closely related to the index lemma. Also, we study the domain restrictions that avoid the impossibility. Finally, we explain why the case of n = 2 and |x| = 3 is where this interesting geometry happens, by giving a simple proof that this case implies Arrow's impossibility for any |x| >= 3 and any finite n >= 2.

关键词： Combinatorial Topology Arrow's impossibility theorem index lemma domain restriction social choice

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Maximum Flow in Planar Graphs 38

Brief Announcement: Distributed Maximum Flow in Planar Graph...

引用

38th International symposium on distributed computing, DISC 2024

作者： Abd-Elhaleem, Yaseen Dory, Michal Parter, Merav Weimann, Oren Department of Computer Science University of Haifa Israel Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9783959773522

The dual of a planar graph G is a planar graph G∗ that has a vertex for each face of G and an edge for each pair of adjacent faces of G. The profound relationship between a planar graph and its dual has been the algorithmic basis for solving numerous (centralized) classical problems on planar graphs involving distances, flows, and cuts. In the distributed setting however, the only use of planar duality is for finding a recursive decomposition of G [DISC 2017, STOC 2019]. In this paper, we extend the distributed algorithmic toolkit (such as recursive decompositions and minor-aggregations) to work on the dual graph G∗. These tools can then facilitate various algorithms on G by solving a suitable dual problem on G∗. Given a directed planar graph G with hop-diameter D, our key result is an Õ(D2)-round algorithm1 for Single Source Shortest Paths on G∗, which then implies an Õ(D2)-round algorithm for Maximum st-Flow on G. Prior to our work, no Õ(Poly(D))-round algorithm was known for Maximum st-Flow. We further obtain a D·no(1)-rounds (1 + ϵ)-approximation algorithm for Maximum st-Flow on G when G is undirected and s and t lie on the same face. Finally, we give a near optimal Õ(D)-round algorithm for computing the weighted girth of G. The main challenges in our work are that G∗ is not the communication graph (e.g., a vertex of G is mapped to multiple vertices of G∗), and that the diameter of G∗ can be much larger than D (i.e., possibly by a linear factor). We overcome these challenges by carefully defining and maintaining subgraphs of the dual graph G∗ while applying the recursive decomposition on the primal graph G. The main technical difficulty, is that along the recursive decomposition, a face of G gets shattered into (disconnected) components yet we still need to treat it as a dual node. © Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, and Oren Weimann.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved Tradeoffs for Leader Election 23

Improved Tradeoffs for Leader Election

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Kutten, Shay Robinson, Peter Ming, Ming Zhu, Xianbin Technion Israel Inst Technol Haifa Israel Augusta Univ Sch Comp & Cyber Sci Augusta GA USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9798400701214

We consider leader election in clique networks, where n nodes are connected by point-to-point communication links. For the synchronous clique under simultaneous wake-up, i.e., where all nodes start executing the algorithm in round 1, we show a tradeoff between the number of messages and the amount of time. The previous lower bound side of such a tradeoff, in the seminal paper of Afek and Gafni (1991), was shown only assuming adversarial wake-up. Interestingly, our new tradeoff also improves the previous lower bounds for a large part of the spectrum, even under simultaneous wake-up. More specifically, we show that any deterministic algorithm with a message complexity of n f (n) requires Omega(log n/log f(n) + 1) rounds, for f(n) > 1. Our result holds even if the node IDs are chosen from a relatively small set of size Theta(n log n), as we are able to avoid using Ramsey's theorem, in contrast to many existing lower bounds for deterministic algorithms. We also give an upper bound that improves over the previously-best tradeoff achieved by the algorithm of Afek and Gafni. Our second contribution for the synchronous clique under simultaneous wake-up is to show that Omega(n log n) is in fact a lower bound on the message complexity that holds for any deterministic algorithm with a termination time T (n) (i.e., any function of n), for a sufficiently large ID space. We complement this result by giving a simple deterministic algorithm that achieves leader election in sublinear time while sending only o(n log n) messages, if the ID space is of at most linear size. We also show that Las Vegas algorithms (that never fail) require Theta(n) messages. This exhibits a gap between Las Vegas and Monte Carlo algorithms. For the synchronous clique under adversarial wake-up, we show that Omega(n(3/2)) is a lower bound for 2-round algorithms. Our result is the first superlinear lower bound for randomized leader election algorithms in the clique. We also give a simple algorithm that matche

关键词： distributed Algorithm Leader Election Lower Bound

来源：评论

学校读者我要写书评

暂无评论

distributed Edge Coloring in Time Polylogarithmic in " 41

Distributed Edge Coloring in Time Polylogarithmic in "

引用

41st acm symposium on principles of distributed computing, PODC 2022

作者： Balliu, Alkida Brandt, Sebastian Kuhn, Fabian Olivetti, Dennis Gran Sasso Science Institute L'Aquila Italy Cispa Helmholtz Center for Information Security Saarbrücken Germany University of Freiburg Freiburg Germany

ISBN: (纸本)9781450392624

We provide new deterministic algorithms for the edge coloring problem, which is one of the classic and highly studied distributed local symmetry breaking problems. As our main result, we show that a (2Δ- 1)-edge coloring can be computed in time poly log Δ+ O(log∗n) in the LOCAL model. This improves a result of Balliu, Kuhn, and Olivetti [PODC '20], who gave an algorithm with a quasi-polylogarithmic dependency on ". We further show that in the CONGEST model, an (8 + ) "-edge coloring can be computed in poly log Δ+ O(log∗n) rounds. The best previous O( ")-edge coloring algorithm that can be implemented in the CONGEST model is by Barenboim and Elkin [PODC '11] and it computes a 2O(1/) "- edge coloring in time O( "+ log∗n) for any ĝ (0, 1]. © 2022 acm.

关键词： Coloring

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal distributed Dominating Set in Bounded Arboricity Graphs 22

Near-Optimal Distributed Dominating Set in Bounded Arboricit...

引用

acm symposium on principles of distributed computing (PODC)

作者： Dory, Michal Ghaffari, Mohsen Ilchi, Saeed Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450392624

We describe a simple deterministic O(epsilon(-1) log Delta) round distributed algorithm for (2 alpha+ 1) (1 + epsilon) approximation of minimum weighted dominating set on graphs with arboricity at most alpha. Here Delta denotes the maximum degree. We also show a lower bound proving that this round complexity is nearly optimal even for the unweighted case, via a reduction from the celebrated KMW lower bound on distributed vertex cover approximation [Kuhn, Moscibroda, and Wattenhofer Jacm'16]. Our algorithm improves on all the previous results (that work only for unweighted graphs) including a randomized O(alpha(2)) approximation in O(log n) rounds [Lenzen and Wattenhofer DISC'10], a deterministic O(alpha log Delta) approximation in O(log Delta) rounds [Lenzen and Wattenhofer DISC'10], a deterministic O(alpha) approximation in O(log(2) Delta) rounds [implicit in Bansal and Umboh IPL'17 and Kuhn, Moscibroda, and Wattenhofer SODA'06], and a randomized O(alpha) approximation in O(alpha log n) rounds [Morgan, Solomon and Wein DISC'21]. We also provide a randomized O(alpha log Delta) round distributed algorithm that sharpens the approximation factor to alpha (1 + o(1)). If each node is restricted to do polynomial-time computations, our approximation factor is tight in the first order as it is NP-hard to achieve alpha - 1 - epsilon approximation [Bansal and Umboh IPL'17].

关键词： distributed computing Dominating Set Arboricity Approximation Algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共137页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：