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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,314 篇 会议
152 篇 期刊文献
6 册 图书

馆藏范围

4,471 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,284 篇 工学
- 3,130 篇 计算机科学与技术...
- 1,641 篇 软件工程
- 413 篇 信息与通信工程
- 373 篇 电气工程
- 223 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 34 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
807 篇 理学
- 672 篇 数学
- 129 篇 统计学（可授理学、...
- 65 篇 系统科学
- 52 篇 生物学
- 43 篇 物理学
- 26 篇 化学
376 篇 管理学
- 225 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 171 篇 工商管理
120 篇 教育学
- 120 篇 教育学
46 篇 法学
- 37 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
17 篇 农学
- 17 篇 作物学
16 篇 医学
1 篇 文学
1 篇 军事学

主题

373 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
107 篇 grid computing
99 篇 cloud computing
93 篇 distributed syst...
91 篇 computational mo...
62 篇 computer network...
61 篇 concurrent compu...
55 篇 computer science
53 篇 fault tolerance
50 篇 distributed algo...
50 篇 algorithms
49 篇 application soft...
46 篇 parallel computi...
44 篇 computer archite...
44 篇 distributed data...
43 篇 message passing
42 篇 computer systems...
41 篇 high performance...

机构

48 篇 swiss fed inst t...
32 篇 technion haifa
30 篇 universidade do ...
27 篇 carnegie mellon ...
24 篇 mit cambridge ma...
22 篇 univ freiburg fr...
17 篇 vienna universit...
16 篇 univ michigan an...
15 篇 university of au...
14 篇 tel aviv univ te...
14 篇 natl univ singap...
12 篇 univ toronto on
12 篇 georgia inst tec...
12 篇 uas technikum vi...
12 篇 ben gurion univ ...
12 篇 cornell univ ith...
12 篇 aalto univ espoo
12 篇 univ calif berke...
11 篇 ecole polytech f...
11 篇 indiana univ blo...

作者

33 篇 kuhn fabian
31 篇 ghaffari mohsen
24 篇 elkin michael
22 篇 awerbuch baruch
22 篇 chen haibo
22 篇 pandurangan gopa...
21 篇 suomela jukka
20 篇 censor-hillel ke...
19 篇 peleg david
19 篇 fraigniaud pierr...
18 篇 chang yi-jun
18 篇 wattenhofer roge...
18 篇 rui oliveira
17 篇 raynal michel
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,414 篇 英文
54 篇 其他
4 篇 中文

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

共 4472 条记录，以下是341-350 订阅

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

详细简洁

排序：

STOC 2022 - proceedings of the 54th Annual acm SIGACT symposium on Theory of computing

STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Sympos...

引用

54th Annual acm SIGACT symposium on Theory of computing, STOC 2022

ISBN: (纸本)9781450392648

The proceedings contain 134 papers. The topics discussed include: nonlocal games, compression theorems, and the arithmetical hierarchy;an area law for 2D frustration-free spin systems;dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture;near-optimal quantum algorithms for multivariate mean estimation;distributed quantum inner product estimation;the power of two choices in graphical allocation;expanders via local edge flips in quasilinear time;(fractional) online stochastic matching via fine-grained offline statistics;the power of multiple choices in online stochastic matching;online edge coloring via tree recurrences and correlation decay;breaking the n k barrier for minimum k-cut on simple graphs;and learning low-degree functions from a logarithmic number of random queries.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Practice-informed Paterns for Organising Large Groups in distributed Mixed Reality Collaboration

Practice-informed Paterns for Organising Large Groups in Dis...

引用

2024 CHI Conference on Human Factors in computing Sytems, CHI 2024

作者： Wong, Emily Esquivel, Juan Sánchez Leiva, Germán Grønbæk, Jens Emil Velloso, Eduardo The University of Melbourne MelbourneVIC Australia Aarhus University Aarhus Denmark

ISBN: (纸本)9798400703300

Collaborating across dissimilar, distributed spaces presents numerous challenges for computer-aided spatial communication. Mixed reality (MR) can blend selected surfaces, allowing collaborators to work in blended f-formations (facing formations), even when their workstations are physically misaligned. Since collaboration often involves more than just participant pairs, this research examines how we might scale MR experiences for large-group collaboration. To do so, this study recruited collaboration designers (CDs) to evaluate and reimagine MR for large-scale collaboration. These CDs were engaged in a four-part user study that involved a technology probe, a semi-structured interview, a speculative low-fidelity prototyping activity and a validation session. The outcomes of this paper contribute (1) a set of collaboration design principles to inspire future computer-supported collaborative work, (2) eight collaboration patterns for blended f-formations and collaboration at scale and (3) theoretical implications for f-formations and space-place relationships. As a result, this work creates a blueprint for scaling collaboration across distributed spaces. © 2024 Copyright held by the owner/author(s)

关键词： Mixed reality

来源：评论

学校读者我要写书评

暂无评论

LOTUS: Locality Optimizing Triangle Counting 22

LOTUS: Locality Optimizing Triangle Counting

引用

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

作者： Esfahani, Mohsen Koohi Kilpatrick, Peter Vandierendonck, Hans Queens Univ Belfast Belfast Antrim North Ireland

ISBN: (纸本)9781450392044

Triangle Counting (TC) is a basic graph mining problem with numerous applications. However, the large size of real-world graphs has a severe effect on TC performance. This paper studies the TC algorithm from the perspective of memory utilization. We investigate the implications of the skewed degree distribution of real-world graphs on TC and make novel observations on how memory locality is negatively affected. Based on this, we introduce the LOTUS algorithm as a structure-aware TC that optimizes locality. The evaluation on 14 real-world graphs with up to 162 billion edges and on 3 different processor architectures of up to 128 cores shows that Lotus is 2.2-5.5x faster than previous works.

关键词： Graph Algorithms High Performance computing Memory Locality Triangle Counting Real-World Graphs Graph Mining Clique Problem

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improved Communication Complexity of Fault-Tolerant Consensus 2022

Improved Communication Complexity of Fault-Tolerant Consensu...

引用

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

作者： Hajiaghayi, Mohammad T. Kowalski, Dariusz R. Olkowski, Jan Univ Maryland College Pk MD 20742 USA Augusta Univ Augusta GA USA

ISBN: (纸本)9781450392648

Consensus is one of the most thoroughly studied problems in distributed computing, yet there are still complexity gaps that have not been bridged for decades. In particular, in the classical message-passing setting with processes' crashes, since the seminal works of Bar-Joseph and Ben-Or [PODC 1998] and Aspnes and Waarts [SICOMP 1996, Jacm 1998] in the previous century, there is still a fundamental unresolved question about communication complexity of fast randomized Consensus against a (strong) adaptive adversary crashing processes arbitrarily online. The best known upper bound on the number of communication bits is Theta(n(3/2)/root log n) per process, while the best lower bound is Omega(1). This is in contrast to randomized Consensus against a (weak) oblivious adversary, for which time-almost-optimal algorithms guarantee amortized O (1) communication bits per process. We design an algorithm against adaptive adversary that reduces the communication gap by nearly linear factor to O ( root n center dot polylog n) bits per process, while keeping almostoptimal (up to factor O ( log(3) n)) time complexity O (root n center dot log(5/2)n). More surprisingly, we show this complexity indeed can be lowered further, but at the expense of increasing time complexity, i.e., there is a trade-off between communication complexity and time complexity. More specifically, our main Consensus algorithm allows to reduce communication complexity per process to any value from polylog n to O ( root n center dot polylog n), as long as Time x Communication = O (n center dot polylog n ). Similarly, reducing time complexity requires more random bits per process, i.e., Time x Randomness =O (n center dot polylog n). Our parameterized consensus solutions are based on a few newly developed paradigms and algorithms for crash-resilient computing, interesting on their own. The first one, called a Fuzzy Counting, provides for each process a number which is in-between the numbers of alive processes at

关键词： distributed consensus crash failures adaptive adversary

来源：评论

学校读者我要写书评

暂无评论

Practical Efficient Microservice Autoscaling with QoS Assurance 22

Practical Efficient Microservice Autoscaling with QoS Assura...

引用

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

作者： Hossen, Md Rajib Islam, Mohammad A. Ahmed, Kishwar Univ Texas Arlington Arlington TX 76019 USA Univ South Carolina Beaufort Bluffton SC USA

ISBN: (纸本)9781450391993

Cloud applications are increasingly moving away from monolithic services to agile microservices-based deployments. However, efficient resource management for microservices poses a significant hurdle due to the sheer number of loosely coupled and interacting components. The interdependencies between various microservices make existing cloud resource autoscaling techniques ineffective. Meanwhile, machine learning (ML) based approaches that try to capture the complex relationships in microservices require extensive training data and cause intentional SLO violations. Moreover, these ML-heavy approaches are slow in adapting to dynamically changing microservice operating environments. In this paper, we propose PEMA (Practical EfficientMicroservice Autoscaling), a lightweight microservice resource manager that finds efficient resource allocation through opportunistic resource reduction. PEMA's lightweight design enables novel workload-aware and adaptive resource management. Using three prototype microservice implementations, we show that PEMA can find efficient resource allocation and save up to 33% resource compared to the commercial rule-based resource allocations.

关键词： Autoscaling microservices resource management cloud computing quality of service

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：