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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

740 篇 会议
41 篇 期刊文献

馆藏范围

781 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

607 篇 工学
- 593 篇 计算机科学与技术...
- 344 篇 软件工程
- 93 篇 信息与通信工程
- 67 篇 控制科学与工程
- 64 篇 电气工程
- 40 篇 网络空间安全
- 12 篇 电子科学与技术（可...
- 4 篇 机械工程
- 4 篇 仪器科学与技术
- 4 篇 化学工程与技术
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 3 篇 农业工程
- 2 篇 建筑学
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
234 篇 理学
- 218 篇 数学
- 61 篇 统计学（可授理学、...
- 12 篇 物理学
- 6 篇 系统科学
- 4 篇 化学
- 3 篇 大气科学
- 3 篇 生物学
48 篇 管理学
- 28 篇 管理科学与工程(可...
- 22 篇 图书情报与档案管...
- 18 篇 工商管理
10 篇 经济学
- 10 篇 应用经济学
4 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

224 篇 distributed comp...
35 篇 distributed algo...
26 篇 distributed comp...
25 篇 computer systems...
17 篇 algorithms
15 篇 consensus
15 篇 distributed syst...
14 篇 fault tolerance
12 篇 distributed algo...
11 篇 computer network...
10 篇 message passing
10 篇 approximation al...
9 篇 self-stabilizati...
9 篇 shared memory
8 篇 cloud computing
8 篇 randomized algor...
6 篇 parallel algorit...
6 篇 computation theo...
6 篇 coloring
6 篇 sensor networks

机构

7 篇 ben gurion univ ...
5 篇 technion
5 篇 department of co...
4 篇 technion haifa
4 篇 college of compu...
4 篇 department of co...
4 篇 eth comp engn & ...
4 篇 yale univ dept c...
3 篇 univ of californ...
3 篇 univ of toronto ...
3 篇 computer enginee...
3 篇 cispa helmholtz ...
3 篇 yale university
3 篇 university of fr...
3 篇 technion israel ...
3 篇 hebrew univ jeru...
3 篇 mit cambridge ma...
3 篇 irisa rennes
3 篇 eth zurich
3 篇 cnrs university ...

作者

13 篇 kuhn fabian
13 篇 awerbuch baruch
13 篇 raynal michel
12 篇 peleg david
12 篇 kutten shay
11 篇 toueg sam
11 篇 patt-shamir boaz
11 篇 wattenhofer roge...
10 篇 guerraoui rachid
10 篇 gafni eli
10 篇 dolev danny
9 篇 elkin michael
9 篇 rajsbaum sergio
9 篇 attiya hagit
8 篇 khandekar rohit
8 篇 pandurangan gopa...
8 篇 aspnes james
8 篇 fraigniaud pierr...
7 篇 korman amos
7 篇 herlihy maurice

语言

774 篇 英文
6 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"

共 781 条记录，以下是61-70 订阅

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

详细简洁

排序：

Language semantics driven design and formal analysis for distributed cyber-physical systems 37

Language semantics driven design and formal analysis for dis...

引用

2018 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating Algorithms for distributed Systems, ApPLIED 2018, co-located with the 37th acm symposium on the principles of distributed computing, PODC 2018

作者： Ghosh, Ritwika Misailovic, Sasa Mitra, Sayan University of Illinois at Urbana-Champaign United States

ISBN: (纸本)9781450357753

Typically platform specific programming models for distributed Cyber-Physical Systems provide limited portability, code reuse, rigorous verification, and synthesis. Koord is a new distributed CPS programming model and language, which treats the platform-independent decision and coordination tasks as a separate concern from platform-dependent concerns of low-level sensing, communication, and control. Koord features event-based programming, shared variables for convenient coordination across multiple agents, and interfaces defined by sensor and actuator ports for the (platform independent) application program to interface with program's environment consisting of controllers and the physical plant. We implement the executable semantics of Koord in the K framework. The Koord framework also includes formal analysis tools on top of the semantics to enable semantics driven-verification. © 2018 Copyright held by the owner/author(s).

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Towards reproducible evaluation of large-scale distributed systems 37

Towards reproducible evaluation of large-scale distributed s...

引用

作者： Matos, Miguel INESC-ID IST. U. Lisboa Lisboa Portugal

ISBN: (纸本)9781450357753

Reproducing experimental results is nowadays seen as one of the greatest impairments for the progress of science in general and distributed systems in particular. This stems from the increasing complexity of the systems under study and the inherent complexity of capturing and controlling all variables that can potentially affect experimental results. We argue that this can only be addressed with a systematic approach to all the stages of the evaluation process. This raises the following challenges: i) precisely describe the environment and variables affecting the experiment, ii) minimize the number of (uncontrollable) variables affecting the experiment and iii) have the ability to subject the system under evaluation to controlled fault patterns. In the following, we highlight the research directions we are currently pursuing to address these goals. Our overarching goal is to build an open-source evaluation platform, Angainor 1, able to deploy an experiment, control the network topology, inject faults, monitor the whole experiment and automatically derive summary statistics of the experimental data. © 2018 Copyright held by the owner/author(s).

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

2019 Edsger W. Dijkstra Prize in distributed computing 19

2019 Edsger W. Dijkstra Prize in Distributed Computing

引用

proceedings of the 2019 acm symposium on principles of distributed computing

作者： Lorenzo Alvisi Shlomi Dolev Faith Ellen Idit Keidar Fabian Kuhn Jukka Suomela Cornell University Ithaca NY USA Ben Gurion University of the Negev Beer-Sheva Israel University of Toronto Toronto ON Canada Technion Haifa Israel University of Freiburg Freiburg Germany Aalto University Espoo Finland

ISBN: (纸本)9781450362177

The committee decided to award the 2019 Edsger W. Dijkstra Prize in distributed computing to Alessandro Panconesi and Aravind Srinivasan for their paper Randomized distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds, SIAM Journal on computing, volume 26, number 2, 1997, pages 350-368. A preliminary version of this paper appeared as Fast Randomized Algorithms for distributed Edge Coloring, proceedings of the Eleventh annual acm symposium principles of distributed computing (PODC), 1992, pages *** paper presents a simple synchronous algorithm in which processes at the nodes of an undirected network color its edges so that the edges adjacent to each node have different colors. It is randomized, using 1.6Δ + O(log1+ζn) colors and O(log n) rounds with high probability for any constant ζ>0, where n is the number of nodes and is the maximum degree of the nodes. This was the first nontrivial distributed algorithm for the edge coloring problem and has influenced a great deal of follow-up work. Edge coloring has applications to many other problems in distributed computing such as routing, scheduling, contention resolution, and resource *** spite of its simplicity, the analysis of their edge coloring algorithm is highly nontrivial. Chernoff-Hoeffding bounds, which assume random variables to be independent, cannot be used. Instead, they develop upper bounds for sums of negatively correlated random variables, for example, which arise when sampling without replacement. More generally, they extend Chernoff-Hoeffding bounds to certain random variables they call λ-correlated. This has directly inspired more specialized concentration inequalities. The new techniques they introduced have also been applied to the analyses of important randomized algorithms in a variety of areas including optimization, machine learning, cryptography, streaming, quantum computing, and mechanism design.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributing computations in fog architectures 37

Distributing computations in fog architectures

引用

2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge computing Paradigms, TOPIC 2018, in conjunction with the 37th acm symposium on principles of distributed computing, PODC 2018

作者： Vidyasankar, Krishnamurthy Memorial University St. John's Newfoundland Canada

ISBN: (纸本)9781450357760

Internet of Things (IoT) services and applications include Connected Vehicles, Smart Grid, Smart Cities, Health Care and, in general, Wireless Sensors and Actuators Networks. Typically, the scenarios can be captured with a Fog computing architecture that consists of edge nodes that generate and possibly pre-process (sensor) data, fog nodes that do some processing quickly and do any actuations that may be needed, and cloud nodes that may perform further detailed analysis for long-term and archival purposes. This paradigm enables (i) quicker real time computations and actuations, avoiding the latency involved in communicating with the cloud for them, (ii) reducing the amount of data that is sent to the cloud, thus reducing network bandwidth requirement and delay in data transmission, and (iii) doing this without the need for 24/7 network connectivity to the cloud. However, the storage, compute and network connectivity capabilities of the edge and fog nodes may be limited. Hence the computations need to be distributed carefully among the processing nodes. In this paper, we develop a generic framework for distributing computations to the different nodes in a fog architecture. Our framework is applicable to an arbitrary hierarchy of the nodes, one or more homogeneous or heterogeneous source inputs, and to processing the input batches either individually or combined with other batches by way of merges and splits. It can serve initially as a schema for a given computation and later to optimize executions of instances. © 2018 Association for computing Machinery.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

Locally-iterative distributed (∆ + 1)-coloring below szegedy-vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models 37

Locally-iterative distributed (∆ + 1)-coloring below szeged...

引用

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

作者： Barenboim, Leonid Elkin, Michael Goldenberg, Uri Open University of Israel Raanana Israel Ben-Gurion University of the Negev Beer-Sheva Israel

ISBN: (纸本)9781450357951

We consider graph coloring and related problems in the distributed message-passing model. Locally-iterative algorithms are especially important in this setting. These are algorithms in which each vertex decides about its next color only as a function of the current colors in its 1 − hop − nei hborhood. In STOC'93 Szegedy and Vishwanathan showed that any locally-iterative (∆ + 1)-coloring algorithm requires Ω(∆ log ∆ + log∗ n) rounds, unless there exists "a very special type of coloring that can be very efficiently reduced" [39]. No such special coloring has been found since then. This led researchers to believe that Szegedy-Vishwanathan barrier is an inherent limitation for locally-iterative algorithms, and to explore other approaches to the coloring problem [1, 2, 17, 29]. The latter gave rise to faster algorithms, but their heavy machinery which is of non-locally-iterative nature made them far less suitable to various settings. In this paper we obtain the aforementioned special type of coloring. Specifically, we devise a locally-iterative (∆ + 1)-coloring algorithm with running time O(∆ + log∗ n), i.e., below Szegedy-Vishwanathan barrier. This demonstrates that this barrier is not an inherent limitation for locally-iterative algorithms. As a result, we also achieve significant improvements for dynamic, self-stabilizing and bandwidth-restricted settings. This includes the following results. • We obtain self-stabilizing distributed algorithms for (∆ + 1)-vertex-coloring, (2∆ − 1)-edge-coloring, maximal independent set and maximal matching with O(∆ + log∗ n) time. This significantly improves previously-known results that have O(n) or larger running times [21]. • We devise a (2∆ − 1)-edge-coloring algorithm in the CONGEST model with O(∆ + log∗ n) time and O(∆)-edge-coloring in the Bit-Round model with O(∆ + log n) time. The factors of log∗ n and log n are unavoidable in the CONGEST and Bit-Round models, respectively. Previously-known algorithms had superlinear depende

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Fast Space Optimal Leader Election in Population Protocols 29

Fast Space Optimal Leader Election in Population Protocols

引用

29th annual acm-SIAM symposium on Discrete Algorithms (SODA)

作者： Gasieniec, Leszek Stachowiak, Grzegorz Univ Liverpool Liverpool Merseyside England Uniwersytet Wroclawski Wroclaw Poland

ISBN: (纸本)9781611975031

The model of population protocols refers to the growing in popularity theoretical framework suitable for studying pairwise interactions within a large collection of simple indistinguishable entities, frequently called agents. In this paper the emphasis is on the space complexity in fast leader election via population protocols governed by the random scheduler, which uniformly at random selects pairwise interactions from the population of n agents. The main result of this paper is a new fast and space optimal leader election protocol. The new protocol operates in parallel time O(log(2) n) equivalent to O(n log(2) n) sequential pairwise interactions, in which each agent utilises O(log log n) states. This double logarithmic space utilisation matches asymptotically the lower bound 1/2 log log n on the number of states utilised by agents in any leader election algorithm with the running time o(n/polylog n)see [7]. Our solution relies on the concept of phase clocks, a fundamental synchronisation and coordination tool in the field of distributed computing. We propose a new fast and robust population protocol for initialisation of phase clocks to be run simultaneously in multiple modes and intertwined with the leader election process. We also provide the reader with the relevant formal argumentation indicating that our solution is always correct and fast with high probability.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

The Complexity of distributed Edge Coloring with Small Palettes 29

The Complexity of Distributed Edge Coloring with Small Palet...

引用

29th annual acm-SIAM symposium on Discrete Algorithms (SODA)

作者： Chang, Yi-Jun He, Qizheng Li, Wenzheng Pettie, Seth Uitto, Jara Univ Michigan Ann Arbor MI 48109 USA Tsinghua Univ ITCS Inst Interdisciplinary Informat Sci Beijing Peoples R China Swiss Fed Inst Technol Zurich Switzerland Univ Freiburg Freiburg Germany

ISBN: (纸本)9781611975031

The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree Delta. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes. Our results are as follows. We simplify the round elimination technique of Brandt et al. [9] and prove that (2 Delta-2)-edge coloring requires Omega(log(Delta) log n) time w.h.p. and Omega(log(Delta) n) time deterministically, even on trees. The simplified technique is based on two ideas: the notion of an irregular running time (in which network components terminate the algorithm at prescribed, but irregular times) and some general observations that transform weak lower bounds into stronger ones. We give a randomized edge coloring algorithm that can use palette sizes as small as Delta + (O) over tilde(root Delta), which is a natural barrier for randomized approaches. The running time of the algorithm is at most O(log Delta . T-LLL), where T-LLL is the complexity of a permissive version of the constructive Lovasz local lemma We develop a new distributed Lovasz local lemma algorithm for tree-structured dependency graphs, which leads to a (1 + epsilon)-edge coloring algorithm for trees running in O(log log n) time. This algorithm arises from two new results: a deterministic O(log n)-time LLL algorithm for tree-structured instances, and a randomized O(log log n)-time graph shattering method for breaking the dependency graph into independent O(log n)-size LLL instances. A natural approach to computing (Delta + 1)-edge colorings (Vizing's theorem) is to extend partial colorings by iteratively re-coloring parts of the graph, e.g., via "augmenting paths. We prove that this approach may be viable, but in the worst case requires recoloring sub graphs of diameter Omega(Delta log n). This stands in contrast to distributed algorithms for Brooks' theorem [32], which exploit the existence of O(log(Delta) n)-length augmenting paths.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

proceedings of the annual acm symposium on principles of distributed computing

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

引用

36th acm symposium on principles of distributed computing, PODC 2017

ISBN: (纸本)9781450349925

The proceedings contain 59 papers. The topics discussed include: exploiting spontaneous transmissions for broadcasting and leader election in radio networks;communication primitives in cognitive radio networks;analyzing contention and backoff in asynchronous shared memory;a layered architecture for erasure-coded consistent distributed storage;seeing is believing: a client-centric specification of database isolation;space complexity of fault-tolerant register emulations;brief announcement: readers of wait-free unbounded registers must write;brief announcement: fast shared counting using (O(n)) compare-and-swap registers;on the multiparty communication complexity of testing triangle-freeness;distributed MST and routing in almost mixing time;brief announcement: optimal address-oblivious epidemic dissemination;a simple deterministic distributed MST algorithm, with near-optimal time and message complexities;distributed approximation of maximum independent set and maximum matching;deterministic distributed (delta + o(delta))-edge-coloring, and vertex-coloring of graphs with bounded diversity;optimal distance labeling schemes for trees;randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model;effectiveness of delaying timestamp computation;ignore or comply? on breaking symmetry in consensus;and greedy routing and the algorithmic small-world phenomenon.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Massively Parallel Methods for Dynamic Programming 2017

Efficient Massively Parallel Methods for Dynamic Programming

引用

49th annual acm-SIGACT symposium on Theory of computing (STOC)

作者： Im, Sungjin Moseley, Benjamin Sun, Xiaorui Univ Calif Elect Engn & Comp Sci 5200 N Lake Rd Merced CA 95344 USA Washington Univ Dept Comp Sci & Engn 1 Brookings Dr St Louis MO 63130 USA Univ Calif Berkeley Simons Inst Theory Comp Berkeley CA 94702 USA Simons Inst Theory Comp Berkeley CA USA

ISBN: (纸本)9781450345286

Modern science and engineering is driven by massively large data sets and its advance heavily relies on massively parallel computing platforms such as Spark, MapReduce, and Hadoop. Theoretical models have been proposed to understand the power and limitations of such platforms. Recent study of developed theoretical models has led to the discovery of new algorithms that are fast and efficient in both theory and practice, thereby beginning to unlock their underlying power. Given recent promising results, the area has turned its focus on discovering widely applicable algorithmic techniques for solving problems efficiently. In this paper we make progress towards this goal by giving principles for simulating a large class of sequential dynamic programs in the distributed setting. In particular, we identify two key properties, monotonicity and decomposibility, which allow us to derive efficient distributed algorithms for problems possessing the properties. We showcase our framework by considering several core dynamic programming applications, Longest Increasing Subsequence, Optimal Binary Search Tree, and Weighted Interval Selection. For these problems, we derive algorithms yielding solutions that are arbitrarily close to the optimum, using O(1) rounds and (O) over tilde (n/m) memory on each machine where n is the input size and m is the number of machines available.

关键词： Massively parallel computing Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Choreographing cyber-physical distributed control systems for the energy sector 17

Choreographing cyber-physical distributed control systems fo...

引用

32nd annual acm symposium on Applied computing, SAC 2017

作者： López, Hugo A. Heussen, Kai Department of Applied Mathematics and Computer Science Technical University of Denmark Kongens Lyngby Denmark Department of Electrical Engineering Technical University of Denmark Kongens Lyngby Denmark

ISBN: (纸本)9781450344869

Energy Systems are facing a significant change in the way their management and control is conceived. With the introduction of distributed and renewable energy based resources, a shift to a more distributed operation paradigm is emerging, overturning the conventional top-down design and operation principles. This shift creates a demand for distributed control systems (DCS) to facilitate a more adaptive and efficient operation of power networks. One key challenge here is to ensure the required reliability of distributed control systems. Whereas proven strategies exist for reliable control for coordination of physical actions, with increasing distribution of such control, the reliability and degradation properties in response to communications issues become more important. We build on the notion of Quality Choreographies, a formal model for the development of failure-aware distributed systems, and discuss how quality choreographies respond to the needs presented by DCS. We demonstrate their applicability by modelling the Bully Algorithm, one of the de-facto election algorithms used in coordination of DCS. Copyright 2017 acm.

关键词： distributed parameter control systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：