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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 电气工程
- 75 篇 控制科学与工程
- 41 篇 网络空间安全
- 17 篇 电子科学与技术（可...
- 7 篇 化学工程与技术
- 6 篇 农业工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物工程
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 4 篇 交通运输工程
298 篇 理学
- 272 篇 数学
- 68 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 8 篇 化学
- 7 篇 生物学
60 篇 管理学
- 32 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 19 篇 工商管理
18 篇 教育学
- 18 篇 教育学
10 篇 经济学
- 10 篇 应用经济学
10 篇 法学
- 7 篇 社会学
- 4 篇 法学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

247 篇 distributed comp...
95 篇 distributed algo...
76 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
28 篇 distributed syst...
23 篇 approximation al...
23 篇 computer systems...
23 篇 congest model
22 篇 local model
22 篇 algorithms
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...

机构

29 篇 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...
9 篇 ben gurion univ ...
8 篇 weizmann inst sc...
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...
14 篇 peleg david
14 篇 toueg sam
14 篇 wattenhofer roge...
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,341 篇 英文
13 篇 其他
1 篇 中文

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

共 1355 条记录，以下是81-90 订阅

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

详细简洁

排序：

Deconstructing Alibaba Cloud's Preemptible Instance Pricing 23

Deconstructing Alibaba Cloud's Preemptible Instance Pricing

引用

32nd International symposium on High-Performance Parallel and distributed computing (HPDC) part of the acm Federated computing Research Conference (FCRC)

作者： Davidow, Danielle Movsowitz Ben-Yehuda, Orna Agmon Dunkelmen, Orr Tel Aviv Univ Dept Ind Engn Tel Aviv Israel Univ Haifa Caesarea Rothschild Inst Interdisciplinary Applic Haifa Israel Univ Haifa Dept Comp Sci Haifa Israel

ISBN: (纸本)9798400701559

Alibaba Cloud's preemptible instances are IaaS instances sold using an auction, similar to the spot instances offered by Amazon Web Services (AWS). Clients purchase them by bidding. The instances are terminated when supply is insufficient, or when the client's bid is lower than the "market price"- which Alibaba Cloud publishes ever so often. We collected Alibaba Cloud's preemptible price traces from November 2018 to July 2021. This work analyzes the traces, and shows evidence that they experienced sharp lateral behavioral changes over time. We characterize the traces before and after these events. Our analysis highlights features in the traces that seem to be artificially engineered by an underlying pricing mechanism. Since engineered features may abruptly change, they are particularly interesting to clients planning their bidding strategy, or scholars who study them (e.g., to design new pricing mechanisms on the basis of real-life data).

关键词： Cloud computing Auctions Alibaba Cloud Traces

来源：评论

学校读者我要写书评

暂无评论

Byzantine Resilient distributed computing on External Data 38

Byzantine Resilient Distributed Computing on External Data

引用

38th International symposium on distributed computing, DISC 2024

作者： Augustine, John Biju, Jeffin Meir, Shachar Peleg, David Ramachandran, Srikkanth Thiruvengadam, Aishwarya Indian Institute of Technology Madras Chennai India Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9783959773522

We study a class of problems we call retrieval problems in which a distributed network has read-only access to a trusted external data source through queries, and each peer is required to output some computable function of the data. To formalize this, we propose the Data Retrieval Model comprising two parts: (1) a congested clique network with k peers, up to βk of which can be Byzantine in every execution (for suitable values of β ∈ [0, 1));(2) a trusted source of data with no computational abilities, called the External Data Source (or just source for short). This source stores an array X of n bits (n k), providing every peer in the congested clique read-only access to X through queries. It is assumed that a query to the source is significantly more expensive than a message between two peers in the network. Hence, we prioritize minimizing the number of queries a peer performs over the number of messages it sends. Retrieval problems are easily solved by having each peer query all of X, so we focus on designing non-trivial query-efficient protocols for retrieval problems in the DR network that achieve low query performance per peer. Specifically, to initiate this study, we present deterministic and randomized upper and lower bounds for two fundamental problems. The first is the Download problem that requires every peer to output an array of n bits identical to X. The second problem of focus, Disjunction, requires nodes to learn if some bit in X is set to 1. © John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, and Aishwarya Thiruvengadam.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds 22

Brief Announcement: Distributed MST Computation in the Sleep...

引用

acm symposium on principles of distributed computing (PODC)

作者： Augustine, John Moses, William K., Jr. Pandurangan, Gopal Indian Inst Technol Madras Chennai India Univ Houston Houston TX USA

ISBN: (纸本)9781450392624

We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in (O) over tilde (D + root n) rounds in the standard CONGEST model (where n is the network size and D is the network diameter) and this is essentially the best possible round complexity (up to logarithmic factors). However, in resource-constrained networks such as wireless ad hoc and sensor networks, nodes spending so much time can lead to significant spending of resources such as energy. Motivated by the above consideration, we study distributed algorithms for MST under the sleeping model [Chatterjee et al., PODC 2020], a model for design and analysis of resource-efficient distributed algorithms. In the sleeping model, a node can be in one of two modes in any round - sleeping or awake (unlike the traditional model where nodes are always awake). Only the rounds in which a node is awake are counted, while sleeping rounds are ignored. A node spends resources only in the awake rounds and hence the main goal is to minimize the awake complexity of a distributed algorithm, the worst-case number of rounds any node is awake. We present distributed MST algorithms that have optimal awake complexity with a matching lower bound. We also show that our awake-optimal algorithms have essentially the best possible round complexity by presenting a lower bound on the product of the awake and round complexity of any distributed algorithm (including randomized).

关键词： Minimum Spanning Tree Sleeping model energy-efficient awake complexity round complexity trade-offs

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

INFINEL: An efficient GPU-based processing method for unpredictable large output graph queries 24

INFINEL: An efficient GPU-based processing method for unpred...

引用

29th acm SIGPLAN Annual symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Park, Sungwoo Oh, Seyeon Kim, Min-Soo Korea Adv Inst Sci & Technol Seoul South Korea GraphAI Seoul South Korea

ISBN: (纸本)9798400704352

With the introduction of GPUs, which are specialized for iterative parallel computations, the execution of computationintensive graph queries using a GPU has seen significant performance improvements. However, due to the memory constraints of GPUs, there has been limited research on handling large-scale output graph queries with unpredictable output sizes on a GPU. Traditionally, two-phase methods have been used, where the query is re-executed after splitting it into sub-tasks while only considering the size of the output in a static manner. However, two-phase methods become highly inefficient when used with graph data with extreme skew, failing to maximize the GPU performance. This paper proposes INFINEL, which handles unpredictable large output graph queries in a one-phase method through chunk allocation per thread and kernel stop/restart methods. We also propose applicable optimization techniques due to the corresponding unique characteristics of operating with low time/space overhead and not heavily relying on the GPU output buffer size. Through extensive experiments, we demonstrate that our one-phase method of INFINEL improves the performance by up to 31.5 times over the conventional twophase methods for triangle listing ULO query.

关键词： Graph query processing Large output Parallel computing GPU

来源：评论

学校读者我要写书评

暂无评论

Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions 22

Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expa...

引用

acm symposium on principles of distributed computing (PODC)

作者： Chang, Yi-Jun Su, Hsin-Hao Natl Univ Singapore Singapore Singapore Boston Coll Boston MA 02467 USA

ISBN: (纸本)9781450392624

Many combinatorial optimization problems, including maximum weighted matching and maximum independent set, can be approximated within (1 +/-epsilon) factors in poly(log n, 1/epsilon) rounds in the LOCAL model via network decompositions [Ghaffari, Kuhn, and Maus, STOC 2018]. These approaches, however, require sending messages of unlimited size, so they do not extend to the more realistic CONGEST model, which restricts the message size to be O(log n) bits. For example, despite the long line of research devoted to the distributed matching problem, it still remains a major open problem whether an (1 - epsilon)-approximate maximum weighted matching can be computed in poly(log n, 1/epsilon) rounds in the CONGEST model. In this paper, we develop a generic framework for obtaining poly(log n, 1/epsilon)-round (1 +/- epsilon)-approximation algorithms for many combinatorial optimization problems, including maximum weighted matching, maximum independent set, and correlation clustering, in graphs excluding a fixed minor in the CONGEST model. This class of graphs covers many sparse network classes that have been studied in the literature, including planar graphs, bounded-genus graphs, and bounded-treewidth graphs. Furthermore, we show that our framework can be applied to give an efficient distributed property testing algorithm for an arbitrary minor-closed graph property that is closed under taking disjoint union, significantly generalizing the previous distributed property testing algorithm for planarity in [Levi, Medina, and Ron, PODC 2018 & distributed computing 2021]. Our framework uses distributed expander decomposition algorithms [Chang and Saranurak, FOCS 2020] to decompose the graph into clusters of high conductance. We show that any graph excluding a fixed minor admits small edge separators. Using this result, we show the existence of a high-degree vertex in each cluster in an expander decomposition, which allows the entire graph topology of the cluster to be routed to a

关键词： distributed graph algorithms expander decompositions matching

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：