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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

372 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
106 篇 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...
42 篇 edge computing

机构

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,425 篇 英文
44 篇 其他
4 篇 中文

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

共 4473 条记录，以下是401-410 订阅

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

详细简洁

排序：

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility 21

Separating Bounded and Unbounded Asynchrony for Autonomous R...

引用

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

作者： Kirkpatrick, David Kostitsyna, Irina Navarra, Alfredo Prencipe, Giuseppe Santoro, Nicola Univ British Columbia Dept Comp Sci Vancouver BC Canada TU Eindhoven Dept Math & Comp Sci Eindhoven Netherlands Univ Perugia Dept Math & Comp Sci Perugia Italy Univ Dip Informat Pisa Italy Carleton Univ Sch Comp Sci Ottawa ON Canada

ISBN: (纸本)9781450385480

We consider distributed computations, by identical autonomous mobile entities, that solve the Point Convergence problem: given an arbitrary initial configuration of entities, disposed in the Euclidean plane, move in such a way that, for all epsilon > 0, a configuration is eventually reached and maintained in which the separation between all entities is at most epsilon. The problem has been previously studied in a variety of settings. Our study concerns the minimal assumptions under which entities, moving asynchronously with limited and unknown visibility range and subject to limited imprecision in measurements, can be guaranteed to converge in this way. We present an algorithm that solves Point Convergence, provided the degree of asynchrony is bounded by some arbitrarily large but fixed constant. This provides a strong positive answer to a decade old open question posed by Katreniak. We also prove that, in an otherwise comparable setting, Point Convergence is impossible with unbounded asynchrony. This serves to distinguish the power of bounded and unbounded asynchrony in the control of autonomous mobile entities, settling at the same time a long-standing question whether in the Euclidean plane synchronous entities are more powerful than asynchronous ones.

关键词： Mobile robots distributed geometric algorithms Asynchrony

来源：评论

学校读者我要写书评

暂无评论

Real-Time Simulation Framework with Traffic Incident Prediction: A Singapore Case Study 27

Real-Time Simulation Framework with Traffic Incident Predict...

引用

27th IEEE/acm International symposium on distributed Simulation and Real Time Applications, DS-RT 2023

作者： Othman, Muhammad Shalihin Padinjarapat, Remya K. Wang, Chengxin Arunachalam, Nimal R. Tan, Gary School of Computing National University of Singapore Department of Computer Science Singapore

ISBN: (纸本)9798350337846

Traffic management centres worldwide are facing unprecedented challenges from traffic incidents, impacting congestion, delays, pollution, and costs. Congested roads during peak hours are prone to accidents, causing significant disruptions and delays. Non-recurrent congestion such as accidents, occur unexpectedly and are major contributors to delays while disruptions in public transportation lead to increased demand for alternative modes thereby causing severe congestion. Understanding the impact of these incidents on multi-modal traffic networks is crucial for developing effective response plans. This study addresses the limitations of using only historical data to run simulations in advance. The proposed architecture enables optimized simulations with real-time inputs and accurate parameter prediction for improved response planning. This work provides a foundational proof of concept for utilizing minimal real-time data for accurate simulations of dynamic traffic behaviours through a Singapore case study. Future research can focus on comparative analysis methods, optimization strategies, and incorporating pedestrian effects. These advancements will aid transport authorities in making informed decisions for infrastructure and route planning. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Low-Congestion Shortcuts for Graphs Excluding Dense Minors 21

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

引用

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

作者： Ghaffari, Mohsen Haeupler, Bernhard Swiss Fed Inst Technol Zurich Switzerland Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450385480

We prove that any n-node graph G with diameter D admits shortcuts with congestion O(delta D log n) and dilation O(delta D), where delta is the maximum edge-density of any minor of G. Our proof is simple and constructive with a (Theta) over tilde(delta D)-round(1) distributed construction algorithm. Our results are tight up to logarithmic factors and generalize, simplify, unify, and strengthen several prior results. For example, for graphs excluding a fixed minor, i.e., graphs with constant delta, only (O) over tilde (D-2) bound was known based on a very technical proof that relies on the Robertson-Seymour Graph Structure Theorem. A direct consequence of our result is this: many graph families, including any minor-excluded ones, have near-optimal (Theta) over tilde (D)-round distributed algorithms for many fundamental communication primitives and optimization problems in the standard synchronous message-passing model with logarithmic message sizes, i.e., the CONGEST model. These problems include minimum spanning tree, minimum cut approximation, and shortest-path approximations.

关键词： distributed graph algorithms low-congestion shortcuts minor-exluded graphs planar graphs congestion dilation minimum spanning tree

来源：评论

学校读者我要写书评

暂无评论

Undirected (1+)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms 54

Undirected (1+)-shortest paths via minor-aggregates: near-op...

引用

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

作者： RozhoÅ, Václav Grunau, Christoph Haeupler, Bernhard Zuzic, Goran Li, Jason Eth Zurich Switzerland Carnegie Mellon University United States University of California at Berkeley United States

ISBN: (纸本)9781450392648

This paper presents near-optimal deterministic parallel and distributed algorithms for computing (1+eps)-approximate single-source shortest paths in any undirected weighted graph. On a high level, we deterministically reduce this and other shortest-path problems to Õ(1) Minor-Aggregations. A Minor-Aggregation computes an aggregate (e.g., max or sum) of node-values for every connected component of some subgraph. Our reduction immediately implies: Optimal deterministic parallel (PRAM) algorithms with Õ(1) depth and near-linear work. Universally-optimal deterministic distributed (CONGEST) algorithms, whenever deterministic Minor-Aggregate algorithms exist. For example, an optimal Õ(hopDiameterG)-round deterministic CONGEST algorithm for excluded-minor networks. Several novel tools developed for the above results are interesting in their own right: A local iterative approach for reducing shortest path computations "up to distance D"to computing low-diameter decompositions "up to distance D/2". Compared to the recursive vertex-reduction approach of [Li20], our approach is simpler, suitable for distributed algorithms, and eliminates many derandomization barriers. A simple graph-based Õ(1)-competitive g.,"1-oblivious routing based on low-diameter decompositions that can be evaluated in near-linear work. The previous such routing [ZGY+20] was no(1)-competitive and required no(1) more work. A deterministic algorithm to round any fractional single-source transshipment flow into an integral tree solution. The first distributed algorithms for computing Eulerian orientations. © 2022 acm.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

Tight Bounds on Channel Reliability via Generalized Quorum Systems 25

Tight Bounds on Channel Reliability via Generalized Quorum S...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Alejandro Naser-Pastoriza Gregory Chockler Alexey Gotsman Fedor Ryabinin IMDEA Software Institute Madrid Spain Universidad Politécnica de Madrid Madrid Spain University of Surrey UK Guildford United Kingdom

ISBN: (纸本)9798400718854

Communication channel failures are a major concern for the developers of modern fault-tolerant systems. However, while tight bounds for process failures are well-established, extending them to include channel failures has remained an open problem. We introduce generalized quorum systems -- a framework that characterizes the necessary and sufficient conditions for implementing atomic registers, atomic snapshots, lattice agreement and consensus under arbitrary patterns of process-channel failures. Generalized quorum systems relax the connectivity constraints of classical quorum systems: instead of requiring bidirectional reachability for every pair of write and read quorums, they only require some write quorum to be unidirectionally reachable from some read quorum. This weak connectivity makes implementing registers particularly challenging, because it precludes the traditional request/response pattern of quorum access, making classical solutions like ABD inapplicable. To address this, we introduce novel logical clocks that allow write and read quorums to reliably track state updates without relying on bidirectional connectivity.

关键词： distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate Byzantine Fault-Tolerance in distributed Optimization 21

Approximate Byzantine Fault-Tolerance in Distributed Optimiz...

引用

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

作者： Liu, Shuo Gupta, Nirupam Vaidya, Nitin H. Georgetown Univ Washington DC 20057 USA Ecole Polytech Fed Lausanne EPFL Lausanne Switzerland

ISBN: (纸本)9781450385480

This paper considers the problem of Byzantine fault-tolerance in distributed multi-agent optimization. In this problem, each agent has a local cost function, and in the fault-free case, the goal is to design a distributed algorithm that allows all the agents to find a minimum point of all the agents' aggregate cost function. We consider a scenario where some agents might be Byzantine faulty that renders the original goal of computing a minimum point of all the agents' aggregate cost vacuous. A more reasonable objective for an algorithm in this scenario is to allow all the non-faulty agents to compute the minimum point of only the non-faulty agents' aggregate cost. Prior work [24] shows that if there are up to f (out of n) Byzantine agents then a minimum point of the non-faulty agents' aggregate cost can be computed exactly if and only if the non-faulty agents' costs satisfy a certain redundancy property called 2f -redundancy. However, 2f-redundancy is an ideal property that can be satisfied only in systems free from noise or uncertainties, which can make the goal of exact fault-tolerance unachievable in some applications. Thus, we introduce the notion of (f, epsilon)-resilience, a generalization of exact fault-tolerance wherein the objective is to find an approximate minimum point of the non-faulty aggregate cost, with c accuracy. This approximate fault-tolerance can be achieved under a weaker condition that is easier to satisfy in practice, compared to 2f-redundancy. We obtain necessary and sufficient conditions for achieving (f, epsilon)-resilience characterizing the correlation between relaxation in redundancy and approximation in resilience. In case when the agents' cost functions are differentiable, we obtain conditions for (f, epsilon)-resilience of the distributed gradient-descent method when equipped with robust gradient aggregation;such as comparative gradient elimination or coordinate-wise trimmed mean.

关键词： distributed optimization Approximate fault-tolerance distributed gradient-descent

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Strong and Hiding distributed Certification of $k$-Coloring 25

Brief Announcement: Strong and Hiding Distributed Certificat...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Augusto Modanese Pedro Montealegre Martín Ríos-Wilson Aalto University Espoo Finland Adolfo Ibáñez University Santiago Chile

ISBN: (纸本)9798400718854

We study the problem of certifying whether a graph is k-colorable with a locally checkable proof (LCP) that is able to hide the k-coloring from the verifier, in the sense that no algorithm can (completely) extract a k-coloring from the certificate. Motivated by the search for promise-free separations of extensions of the LOCAL model in the context of locally checkable labeling (LCL) problems, we also require the LCPs to satisfy what we call the strong soundness property. We focus on the case of 2-coloring and show that strong and hiding LCPs for 2-coloring exist in specific graph classes and require only O (log n)-sized certificates. Furthermore, when the input is promised to be a cycle or contains a node of degree 1, we show the existence of strong and hiding LCPs even in an anonymous network and with constant-size certificates. Despite these upper bounds, we prove that there are no strong and hiding LCPs for 2-coloring in general, regardless of certificate size. Along the way, we give a characterization of the hiding property for the general k-coloring problem that appears to be a key component for future investigations in this context.

关键词： coloring problem

来源：评论

学校读者我要写书评

暂无评论

On Register Linearizability and Termination 21

On Register Linearizability and Termination

引用

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

作者： Hadzilacos, Vassos Hu, Xing Toueg, Sam Univ Toronto Toronto ON Canada

ISBN: (纸本)9781450385480

It is well-known that, for deterministic algorithms, linearizable objects can be used as if they were atomic objects. As pointed out by Golab, Higham, and Woelfel, however, a randomized algorithm that works with atomic objects may lose some of its properties if we replace the atomic objects that it uses with objects that are only linearizable. It was not known whether the properties that can be lost include the all-important property of termination (with probability 1). In this paper, we first show that a randomized algorithm can indeed lose its termination property if we replace the atomic registers that it uses with linearizable ones. Golab et al. also introduced strong linearizability, and proved that strongly linearizable objects can be used as if they were atomic objects, even for randomized algorithms: they can replace atomic objects while preserving the algorithm's correctness properties, including termination. Unfortunately, there are important cases where strong linearizability is impossible to achieve. In particular, Helmi, Higham, and Woelfel showed a large class of "non-trivial" objects, including MWMR registers, do not have strongly linearizable implementations from SWMR registers. Thus we propose a new type of register linearizability, called write strong-linearizability, that is strictly stronger than (plain) linearizability but strictly weaker than strong linearizability. This intermediate type of linearizability has some desirable properties. We prove that some randomized algorithms that fail to terminate with linearizable registers, work with write strongly-linearizable ones. In other words, there are cases where linearizability is not sufficient but write strong-linearizability is. In contrast to the impossibility result mentioned above, we prove that write strongly-linearizable MWMR registers are implementable from SWMR registers. While the well-known ABD implementation of SWMR registers in message-passing system is not strongly linearizable, we

关键词： distributed computing concurrency linearizability shared registers

来源：评论

学校读者我要写书评

暂无评论

Message Optimality and Message-Time Trade-offs for APSP and Beyond 25

Message Optimality and Message-Time Trade-offs for APSP and ...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Fabien Dufoulon Shreyas Pai Gopal Pandurangan Sriram Pemmaraju Peter Robinson School of Computing and Communications Lancaster University Lancaster United Kingdom IIT Madras Chennai India Department of Computer Science University of Houston Houston Texas USA University of Iowa Iowa City Iowa USA Augusta University Augusta Georgia USA

ISBN: (纸本)9798400718854

Round complexity is an extensively studied metric of distributed algorithms. In contrast, our knowledge of the message complexity of distributed computing problems and its relationship (if any) with round complexity is still quite limited. To illustrate, for many fundamental distributed graph optimization problems such as (exact) diameter computation, All-Pairs Shortest Paths (APSP), Maximum Matching etc., while (near) round-optimal algorithms are known, message-optimal algorithms are hitherto unknown. More importantly, the existing round-optimal algorithms are not message-optimal. This raises two important questions: (1) Can we design message-optimal algorithms for these problems? (2) Can we give message-time tradeoffs for these problems in case the message-optimal algorithms are not round-optimal?In this work, we focus on a fundamental graph optimization problem, All Pairs Shortest Path (APSP), whose message complexity is still unresolved. We present two main results:(1) An algorithm that solves weighted APSP, using Õ(n2) messages in Õ(n2) rounds. This algorithm is message-optimal (up to logarithmic factors) for algorithms that take poly(n) rounds.(2) For any 0 ≤ ϵ ≤ 1, we show how to solve unweighted APSP in Õ(n2–ϵ) rounds and Õ(n2+ϵ) messages. At one end of this smooth trade-off, we obtain a (nearly) message-optimal algorithm (for algorithms that take poly(n) rounds) using Õ(n2) messages (for ϵ = 0), whereas at the other end we get a (nearly) round-optimal algorithm using Õ(n) rounds (for ϵ = 1).

关键词： distributed APSP

来源：评论

学校读者我要写书评

暂无评论

SYNTHESIS: A Semi-Asynchronous Path-Integrated Stochastic Gradient Method for distributed Learning in computing Clusters 22

SYNTHESIS: A Semi-Asynchronous Path-Integrated Stochastic Gr...

引用

23rd International symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile computing (MobiHoc)

作者： Liu, Zhuqing Zhang, Xin Liu, Jia Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA Iowa State Univ Dept Stat Ames IA USA

ISBN: (纸本)9781450391658

To increase the training speed of distributed learning, recent years have witnessed a significant amount of interest in developing both synchronous and asynchronous distributed stochastic variancereduced optimization methods. However, all existing synchronous and asynchronous distributed training algorithms suffer from various limitations in either convergence speed or implementation complexity. This motivates us to propose an algorithm called SYNTHESIS (semi-asynchronous path-integrated stochastic gradient search), which leverages the special structure of the variance-reduction framework to overcome the limitations of both synchronous and asynchronous distributed learning algorithms, while retaining their salient features. We consider two implementations of SYNTHESIS under distributed and shared memory architectures. We show that our SYNTHESIS algorithms have O(root N epsilon(-2) (Delta+ 1) +N) and O(root N epsilon(- 2) (Delta + 1)d +N) computational complexities for achieving an epsilon-stationary point in non-convex learning under distributed and shared memory architectures, respectively, where N denotes the total number of training samples and Delta represents the maximum delay of the workers. Moreover, we investigate the generalization performance of SYNTHESIS by establishing algorithmic stability bounds for quadratic strongly convex and non-convex optimization. We further conduct extensive numerical experiments to verify our theoretical findings.

关键词： Machine learning asynchronous distributed optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：