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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

PROV-IO: An I/O-Centric Provenance Framework for Scientific Data on HPC Systems 22

PROV-IO: An I/O-Centric Provenance Framework for Scientific ...

引用

31st International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： Han, Runzhou Byna, Suren Tang, Houjun Dong, Bin Zheng, Mai Iowa State Univ Ames IA 50011 USA Lawrence Berkeley Natl Lab Berkeley CA USA

ISBN: (纸本)9781450391993

Data provenance, or data lineage, describes the life cycle of data. In scientific workflows on HPC systems, scientists often seek diverse provenance (e.g., origins of data products, usage patterns of datasets). Unfortunately, existing provenance solutions cannot address the challenges due to their incompatible provenance models and/or system implementations. In this paper, we analyze three representative scientific workflows in collaboration with the domain scientists to identify concrete provenance needs. Based on the first-hand analysis, we propose a provenance framework called PROV-IO, which includes an I/O-centric provenance model for describing scientific data and the associated I/O operations and environments precisely. Moreover, we build a prototype of PROV-IO to enable end-to-end provenance support on real HPC systems with little manual effort. The PROV-IO framework provides flexibility in selecting various classes of provenance. Our experiments with realistic workflows show that PROV-IO can address the provenance needs of the domain scientists effectively with reasonable performance (e.g., less than 3.5% tracking overhead for most experiments). Moreover, PROV-IO outperforms a state-of-the-art system (i.e., ProvLake) in our experiments.

关键词： Data Provenance Lineage Scientific Data Workflows High Performance computing FAIR principles Explainability Trustworthiness

来源：评论

学校读者我要写书评

暂无评论

Positive Spectrahedra: Invariance principles and Pseudorandom Generators 2022

Positive Spectrahedra: Invariance Principles and Pseudorando...

引用

54th Annual acm SIGACT symposium on Theory of computing (STOC)

作者： Arunachalam, Srinivasan Yao, Penghui IBM TJ Watson Res Ctr New York NY 10003 USA Nanjing Univ Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781450392648

In a recent work, O'Donnell, Servedio and Tan (STOC 2019) gave explicit pseudorandom generators (PRGs) for arbitrary m-facet polytopes in.. variables with seed length poly-logarithmic in m,n, concluding a sequence of works in the last decade, that was started by Diakonikolas, Gopalan, Jaiswal, Servedio, Viola (SICOMP 2010) and Meka, Zuckerman (SICOMP 2013) for fooling linear and polynomial threshold functions, respectively. In this work, we consider a natural extension of PRGs for intersections of positive spectrahedra. A positive spectrahedron is a Boolean function f(x) = [x(1)A(1) + center dot center dot center dot+x(n)A(n) <= B] where the A(1)s are kxk positive semidefinite matrices. We construct explicit PRGs that delta-fool "regular" width-M positive spectrahedra (i.e., when none of the A(1)s are dominant) over the Boolean space with seed length poly(logk, logn,M, 1/delta). Our main technical contributions are the following: We first prove an invariance principle for positive spectrahedra via the well-known Lindeberg method. As far as we are aware such a generalization of the Lindeberg method was unknown. Second, we prove an upper bound on noise sensitivity and a LittlewoodOfford theorem for positive spectrahedra. Using these results, we give applications for constructing PRGs for positive spectrahedra, learning theory, discrepancy sets for positive spectrahedra (over the Boolean cube) and PRGs for intersections of structured polynomial threshold functions.

关键词： Spectrahedra derandomization invariance principle pseudorandomness

来源：评论

学校读者我要写书评

暂无评论

distributed Construction of Lightweight Spanners for Unit Ball Graphs 36

Distributed Construction of Lightweight Spanners for Unit Ba...

引用

36th International symposium on distributed computing, DISC 2022

作者： Eppstein, David Khodabandeh, Hadi Department of Computer Science University of California IrvineCA United States

ISBN: (纸本)9783959772556

Resolving an open question from 2006 [14], we prove the existence of light-weight bounded-degree spanners for unit ball graphs in the metrics of bounded doubling dimension, and we design a simple O(log∗ n)-round distributed algorithm in the LOCAL model of computation, that given a unit ball graph G with n vertices and a positive constant ϵ ∗ n) rounds in the LOCAL model, but has a O(log ∆) bound on its lightness, where ∆ is the ratio of the length of the longest edge to the length of the shortest edge in the unit ball graph. Next, we adjust our algorithm to work in the CONGEST model, without changing its round complexity, hence proposing the first spanner construction for unit ball graphs in the CONGEST model of computation. We further study the problem in the two dimensional Euclidean plane and we provide a construction with similar properties that has a constant average number of edge intersections per node. Lastly, we provide experimental results that confirm our theoretical bounds, and show an efficient performance from our distributed algorithm compared to the best known centralized construction. © David Eppstein and Hadi Khodabandeh.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Stochastic Coordination in Heterogeneous Load Balancing Systems 21

Stochastic Coordination in Heterogeneous Load Balancing Syst...

引用

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

作者： Goren, Guy Vargaftik, Shay Moses, Yoram Technion Haifa Israel VMware Res Herzliyya Israel

ISBN: (纸本)9781450385480

Current-day data centers and high-volume cloud services employ a broad set of heterogeneous servers. In such settings, client requests typically arrive at multiple entry points, and dispatching them to servers is an urgent distributed systems problem. This paper presents an efficient solution to the load balancing problem in such systems that improves on and overcomes problems of previous solutions. The load balancing problem is formulated as a stochastic optimization problem, and an efficient algorithmic solution is obtained based on a subtle mathematical analysis of the problem. Finally, extensive evaluation of the solution on simulated data shows that it outperforms previous solutions. Moreover, the resulting dispatching policy can be computed very efficiently, making the solution practically viable.

关键词： distributed load balancing Heterogeneous load balancing Stochastically coordinated dispatching Parallel server model

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: What's Live? Understanding distributed Consensus 21

Brief Announcement: What's Live? Understanding Distributed C...

引用

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

作者： Chand, Saksham Liu, Yanhong A. SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Apple Inc Cupertino CA 95014 USA

ISBN: (纸本)9781450385480

distributed consensus algorithms such as Paxos have been studied extensively. Many different liveness properties and assumptions have been stated for them, but there are no systematic comparisons for better understanding of these properties. This paper systematically studies and compares different liveness properties stated for over 30 prominent consensus algorithms and variants. We introduced a precise high-level language and formally specified these properties in the language. We then create a hierarchy of liveness properties combining two hierarchies of the assumptions used and a hierarchy of the assertions made, and compare the strengths and weaknesses of algorithms that ensure these properties. Our formal specifications and systematic comparisons led to the discovery of a range of problems in various stated liveness properties. We also developed TLA+ specifications of these liveness properties, and we used model checking of execution steps to illustrate liveness patterns for Paxos.

关键词： distributed consensus liveness

来源：评论

学校读者我要写书评

暂无评论

Decision Power of Weak Asynchronous Models of distributed computing 21

Decision Power of Weak Asynchronous Models of Distributed Co...

引用

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

作者： Czerner, Philipp Guttenberg, Roland Helfrich, Martin Esparza, Javier Tech Univ Munich Munich Germany

ISBN: (纸本)9781450385480

Esparza and Reiter have recently conducted a systematic comparative study of models of distributed computing consisting of a network of identical finite-state automata that cooperate to decide if the underlying graph of the network satisfies a given property. The study classifies models according to four criteria, and shows that twenty-four initially possible combinations collapse into seven equivalence classes with respect to their decision power, i.e. the properties that the automata of each class can decide. However, Esparza and Reiter only show (proper) inclusions between the classes, and so do not characterise their decision power. In this paper we do so for labelling properties, i.e. properties that depend only on the labels of the nodes, but not on the structure of the graph. In particular, majority (whether more nodes carry label a than b) is a labelling property. Our results show that only one of the seven equivalence classes identified by Esparza and Reiter can decide majority for arbitrary networks. We then study the expressive power of the classes on bounded-degree networks, and show that three classes can. In particular, we present an algorithm for majority that works for all bounded-degree networks under adversarial schedulers, i.e. even if the scheduler must only satisfy that every node makes a move infinitely often, and prove that no such algorithm can work for arbitrary networks.

关键词： distributed computing graph automata weak asynchronous models labelling properties communication graphs decision power

来源：评论

学校读者我要写书评

暂无评论

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs 21

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

引用

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

作者： Bodwin, Greg Parter, Merav Univ Michigan EECS Ann Arbor MI 48109 USA Weizmann Inst Sci Rehovot Israel

ISBN: (纸本)9781450385480

The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths. However, the lemma is tiebreaking-sensitive: if one selects a particular canonical shortest path for each node pair, it is no longer guaranteed that one can build replacement paths by concatenating two selected shortest paths. They left as an open problem whether a method of shortest path tiebreaking with this desirable property is generally possible. We settle this question affirmatively with the first general construction of restorable tiebreaking schemes. We then show applications to various problems in fault-tolerant network design. These include a faster algorithm for subset replacement paths, more efficient fault-tolerant (exact) distance labeling schemes, fault-tolerant subset distance preservers and +4 additive spanners with improved sparsity, and fast distributed algorithms that construct these objects. For example, an almost immediate corollary of our restorable tiebreaking scheme is the first nontrivial distributed construction of sparse fault-tolerant distance preservers resilient to three faults.

关键词： shortest path tiebreaking fault tolerance spanners labeling schemes replacement paths distributed 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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共137页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：