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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,032 篇 会议
2,167 篇 期刊文献
34 篇 学位论文

馆藏范围

6,233 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,925 篇 工学
- 2,158 篇 计算机科学与技术...
- 1,870 篇 电气工程
- 955 篇 信息与通信工程
- 908 篇 控制科学与工程
- 407 篇 软件工程
- 156 篇 仪器科学与技术
- 155 篇 电子科学与技术（可...
- 137 篇 机械工程
- 72 篇 交通运输工程
- 40 篇 石油与天然气工程
- 21 篇 动力工程及工程热...
- 21 篇 网络空间安全
- 16 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 9 篇 材料科学与工程（可...
- 8 篇 航空宇航科学与技...
690 篇 理学
- 371 篇 数学
- 274 篇 系统科学
- 77 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
233 篇 管理学
- 225 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
37 篇 医学
- 32 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
3 篇 农学
2 篇 艺术学
1 篇 法学

主题

6,233 篇 distributed algo...
545 篇 wireless sensor ...
543 篇 convergence
526 篇 algorithm design...
409 篇 optimization
381 篇 computer science
372 篇 distributed comp...
361 篇 network topology
328 篇 routing
279 篇 resource managem...
219 篇 protocols
210 篇 computational mo...
207 篇 computer network...
202 篇 costs
199 篇 approximation al...
199 篇 fault tolerance
186 篇 ad hoc networks
181 篇 bandwidth
179 篇 wireless network...
178 篇 peer to peer com...

机构

25 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 univ liverpool d...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
14 篇 suny stony brook...
14 篇 swiss fed inst t...
14 篇 purdue univ sch ...
13 篇 northeastern uni...
12 篇 univ penn dept e...
12 篇 department of el...
12 篇 weizmann inst sc...
11 篇 department of in...
11 篇 georgia state un...
11 篇 purdue univ sch ...
11 篇 shanghai jiao to...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
21 篇 hong yiguang
21 篇 notarstefano giu...
21 篇 scutari gesualdo
20 篇 dagdeviren orhan
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
16 篇 cortes jorge
16 篇 khan usman a.
16 篇 schmid stefan
16 篇 sharma gokarna
15 篇 peleg david
15 篇 korman amos
15 篇 navarra alfredo
15 篇 mou shaoshuai
15 篇 zeng xianlin

语言

6,128 篇 英文
62 篇 其他
38 篇 中文
4 篇 德文
1 篇 法文
1 篇 葡萄牙文
1 篇 俄文
1 篇 土耳其文

检索条件"主题词=distributed algorithms"

共 6233 条记录，以下是181-190 订阅

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

详细简洁

排序：

Awake-Efficient distributed algorithms for Maximal Independent Set 42

Awake-Efficient Distributed Algorithms for Maximal Independe...

引用

42nd IEEE International Conference on distributed Computing Systems (ICDCS)

作者： Hourani, Khalid Pandurangan, Gopal Robinson, Peter Univ Houston Dept Comp Sci Houston TX 77004 USA Augusta Univ Sch Comp & Cyber Sci Augusta GA USA

ISBN: (数字)9781665471770

ISBN: (纸本)9781665471770

We present a simple algorithmic framework for designing efficient distributed algorithms for the fundamental symmetry breaking problem of Maximal Independent Set (MIS) in the sleeping model [Chatterjee et al, PODC 2020]. In the sleeping model, only the rounds in which a node is awake are counted for the awake complexity, while sleeping rounds are ignored. This is motivated by the fact that a node spends resources only in its awake rounds and hence the goal is to minimize the awake complexity. Our framework allows us to design distributed MIS algorithms that have O (polyloglog(n)) (worst-case) awake complexity in certain important graph classes which satisfy the so-called adjacency property. Informally, the adjacency property guarantees that the graph can be partitioned into an appropriate number of classes so that each node has at least one neighbor belonging to every class. Graphs that can satisfy the adjacency property are random graphs with large clustering coefficient such as random geometric graphs as well as line graphs of regular (or near regular) graphs. We first apply our framework to design two randomized distributed MIS algorithms for random geometric graphs of arbitrary dimension d (even non-constant). The first algorithm has O(polyloglog n) (worst-case) awake complexity with high probability, where n is the number of nodes in the graph.' This means that any node in the network spends only O(polyloglog n) awake rounds;this is almost exponentially better than the (traditional) time complexity of O(log n) rounds (where there is no distinction between awake and sleeping rounds) known for distributed MIS algorithms on general graphs or even the faster O(root log n/log log n ) rounds known for Erdos-Renyi random graphs. log log n However, the (traditional) time complexity of our first algorithm is quite large-essentially proportional to the degree of the graph. Our second algorithm has a slightly worse awake complexity of O(d polyloglog n), but achieves a sig

关键词： Clustering algorithms Complexity theory Partitioning algorithms Time complexity distributed algorithms distributed computing

来源：评论

学校读者我要写书评

暂无评论

Formal Verification Approaches for distributed algorithms: A Systematic Literature Review 22

Formal Verification Approaches for Distributed Algorithms: A...

引用

22nd International Conference on Knowledge-Based and Intelligent Information and Engineering Systems (KES)

作者： Fakhfakh, Faten Tounsi, Mohamed Mosbah, Mohamed Kacem, Ahmed Hadj Univ Sfax ReDCAD Lab Sfax Tunisia Univ Bordeaux LaBRI Lab Bordeaux INP Bordeaux France

distributed algorithms have become a rapidly growing field of research due to the advances of the network technologies. However, they are very difficult to implement correctly because they must meet many requirements. In this paper, we follow the guidelines of systematic literature reviews to provide a survey of the existing works ensuring the formal verification of distributed algorithms in static and dynamic networks. Then, we develop a taxonomy of these solutions based on some criteria. Also, a discussion on each criterion is shown with a focus on constraints, requirements and challenges. Finally, we identify some recommendations and open research areas which can motivate the development of more efficient solutions. So, throughout this present paper, we provide information for researchers and developers to understand the contributions and challenges of the existing solutions to pave the way for enhancing their reliability. (C) 2018 The Authors. Published by Elsevier Ltd.

关键词： distributed algorithms formal verification static and dynamic networks taxonomy challenges

来源：评论

学校读者我要写书评

暂无评论

Moderately Complex Paxos Made Simple: High-Level Executable Specification of distributed algorithms 19

Moderately Complex Paxos Made Simple: High-Level Executable ...

引用

21st International Symposium on Principles and Practice of Declarative Programming (PPDP)

作者： Liu, Yanhong A. Chand, Saksham Stoller, Scott D. SUNY Stony Brook Comp Sci Dept Stony Brook NY 11794 USA

ISBN: (纸本)9781450372497

This paper describes the application of a high-level language and method in developing simpler specifications of more complex variants of the Paxos algorithm for distributed consensus. The specifications are for Multi-Paxos with preemption, replicated state machine, and reconfiguration and optimized with state reduction and failure detection. The language is DistAlgo. The key is to express complex control flows and synchronization conditions precisely at a high level, using nondeterministic waits and message-history queries. We obtain complete executable specifications that are almost completely declarative-updating only a number for the protocol round besides the sets of messages sent and received. We show the following results: (1) English and pseudocode descriptions of distributed algorithms can be captured completely and precisely at a high level, without adding, removing, or reformulating algorithm details to fit lower-level, more abstract, or less direct languages. (2) We created higher-level control flows and synchronization conditions than all previous specifications, and obtained specifications that are much simpler and smaller, even matching or smaller than abstract specifications that omit many algorithm details. (3) The simpler specifications led us to easily discover useless replies, unnecessary delays, and liveness violations (if messages can be lost) in previous published specifications, by just following the simplified algorithm flows. (4) The resulting specifications can be executed directly, and we can express optimizations cleanly, yielding drastic performance improvement over naive execution and facilitating a general method for merging processes. (5) We systematically translated the resulting specifications into TLA+ and developed machine-checked safety proofs, which also allowed us to detect and fix a subtle safety violation in an earlier unpublished specification. Additionally, we show the basic concepts in Paxos that are fundamental in many d

关键词： distributed algorithms distributed consensus executable specification high-level specification message-history queries Paxos

来源：评论

学校读者我要写书评

暂无评论

Unknown Participants, Changing Topologies, and Faulty Devices: New Bounds for distributed algorithms in Challenging Wireless Network Models

Unknown Participants, Changing Topologies, and Faulty Device...

引用

作者： Weaver, Brain Alexander Georgetown University

学位级别：Ph.D., Doctor of Philosophy

In this thesis, we study several distributed problems in complex algorithm models designed to represent certain challenges associated with wireless networks. We begin by studying the contention resolution problem in a model we introduce in which the exact size of the network is unknown, but a probability distribution over the possible sizes is provided as input to the algorithm. We study this problem with and without collision detection, in both cases proving upper and lower bounds for the time complexity of the problem, revealing an interesting dependence on the Shannon entropy of the provided distribution. We then turn our attention to the one-shot gossip and capacity problems. We study both of these problems in the mobile telephone model (MTM), a recently introduced peer-to-peer model designed to capture the constraints and capabilities of wireless mesh networks created by existing smartphone communication technologies. We once again prove upper and lower bounds for the complexities of these problems. We then extend the MTM by introducing a new model which eliminates the assumption of synchronized rounds, proving an upper bound for the one-shot gossip problem in this harder asynchronous model. Finally, we explore two classic graph structuring problems, the maximal independent set (MIS) and maximal matching (MM) problems, in variations of the well-studied broadcast-CONGEST model which allow for the possibility of different types of device failures. We first introduce a model which includes crash failures. This model divides an algorithm execution into two stages. During the first stage, preparation for the crashes can be made. In the second stage, which begins after the crashes occur, the algorithm attempts to compute a valid structure with respect to the surviving subgraph. In this model, we show upper and lower bounds for how quickly an MIS and MM can be repaired in the second stage, given some amount of precomputation performed in the first. We then introduce a

关键词： Capacity Contention resolution distributed algorithms One-shot gossip Maximal independent set Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Cloud-based Demand Response for Smart Grid: Architecture and distributed algorithms

Cloud-based Demand Response for Smart Grid: Architecture and...

引用

IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Kim, Hongseok Kim, Young-Jin Yang, Kai Thottan, Marina Alcatel Lucent Bell Labs Murray Hill NJ 07974 USA

ISBN: (纸本)9781457717024

In this paper we propose cloud-based demand response (CDR), a novel demand response architecture for fast response times in large scale deployments. The proposed architecture is in contrast to master/slave based demand response where the participants directly interact with the utility using host address-centric communication. CDR leverages data-centric communication, publisher/subscriber and topic-based group communication to make demand response secure, scalable and reliable. To the utility, CDR appears to be a black box function call that takes an input from the utility, e.g., power deficit and gives an output to the utility, e.g., power reduction per customer and the corresponding price incentive. Using this implementation framework, we propose two market-based distributed algorithms (bisection and Illinois methods). The proposed algorithms exhibit at least exponentially fast convergence with O(1) iteration as the number of customers grows and outperform prior work of the dual gradient method in terms of convergence speed while keeping the same messaging overhead.

关键词： Convergence Cost function Illinois method Load management Reliability Servers bisection method black box function call cloud computing cloud-based demand response data-centric communication distributed algorithm distributed algorithms host address-centric

来源：评论

学校读者我要写书评

暂无评论

Universally-Optimal distributed algorithms for Known Topologies 2021

Universally-Optimal Distributed Algorithms for Known Topolog...

引用

53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Haeupler, Bernhard Wajc, David Zuzic, Goran CMU Pittsburgh PA 15213 USA Swiss Fed Inst Technol Zurich Switzerland Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450380539

Many distributed optimization algorithms achieve existentially-optimal running times, meaning that there exists some pathological worst-case topology on which no algorithm can do better. Still, most networks of interest allow for exponentially faster algorithms. This motivates two questions: (i) What network topology parameters determine the complexity of distributed optimization? (ii) Are there universally-optimal algorithms that are as fast as possible on every topology? We resolve these 25-year-old open problems in the known-topology setting (i.e., supported CONGEST) for a wide class of global network optimization problems including MST, (1+epsilon)-min cut, various approximate shortest paths problems, sub-graph connectivity, etc. In particular, we provide several (equivalent) graph parameters and show they are tight universal lower bounds for the above problems, fully characterizing their inherent complexity. Our results also imply that algorithms based on the low-congestion shortcut framework match the above lower bound, making them universally optimal if shortcuts are efficiently approximable.

关键词： distributed algorithms Universal Optimality Universal Lower Bounds Shortcuts Shortcut Quality

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for control of demand response and distributed energy resources

Distributed algorithms for control of demand response and di...

引用

IEEE Conference on Decision and Control

作者： Alejandro D. Domínguez-García Christoforos N. Hadjicostis Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign Urbana IL USA Department of Electrical and Computer Engineering University of Cyprus Nicosia Cyprus

ISBN: (纸本)9781612848006;9781612848013

This paper proposes distributed algorithms for control and coordination of loads and distributed energy resources (DERs) in distribution networks. These algorithms are relevant for load curtailment control in demand response programs, and also for coordination of DERs for provision of ancillary services. Both the distributed load-curtailment and DER coordination problems can be cast as distributed resource allocation problems with constraints on resource capacity. We focus on linear iterative algorithms in which each resource j maintains a set of values that is updated to be a weighted linear combination of the resource's own previous set of values and the previous sets of values of its neighboring resources. This set of values can be used by each node to determine its own contribution to load curtailment or to resource request.

关键词： Steady-state Resource management Load management Density estimation robust algorithm Energy resources distributed algorithms Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed algorithms on Random Graphs

Efficient Distributed Algorithms on Random Graphs

引用

作者： Fathi, Reza University of Houston

学位级别：Ph.D., Doctor of Philosophy

This dissertation focuses on two prominent graph problems: finding Hamiltonian cycles and detecting communities in graphs. Both of them are NP-hard problems on general graphs but can admit efficient solutions in {\em random graphs}. In this dissertation, we present efficient distributed algorithms for the above two problems in random graphs. First, we present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we design and analyze a randomized distributed algorithm for the classical $G(n,p)$ random graph model, with number of nodes $n$ and $p=\frac{c\ln n}{n^{\delta}}$ (for any constant $0 < \delta \leq 1$ and for a suitably large constant $c > 0$), that finds a Hamiltonian cycle with high probability in $\tilde{O}(n^{\delta})$ rounds.\footnote{The notation $\tilde{O}$ hides a $\text{polylog}(n)$ factor.} Our algorithm works in the (synchronous) CONGEST model (i.e., only $O(\log n)$-sized messages are communicated per edge per round) and its computational cost per node is sublinear (in $n$) per round and is fully-distributed (each node uses only $o(n)$ memory and all nodes' computations are essentially balanced). Our algorithm improves over the previous best known result in terms of both the running time as well as the edge sparsity of the graphs where it can succeed; in particular, the denser the random graph, the smaller is the running time. Second, we present a distributed algorithm for community detection in the {\em stochastic block model} (also called {\em planted partition model}), a widely-studied and canonical random graph model for community detection and clustering. Designing effective algorithms for community detection is an important and challenging problem in {\em large-scale} graphs, studied extensively in the literature. Various solutions have been proposed, but many of them are centralized with expensive procedures (requiring full knowledge of the input graph) and have a large running tim

关键词： distributed algorithms Random graphs Hamiltonian cycles Community detection

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for transmission power control in wireless sensor networks

Distributed algorithms for transmission power control in wir...

引用

IEEE Conference on Wireless Communications and Networking

作者： M. Kubisch H. Karl A. Wolisz L.C. Zhong J. Rabaey Telecommunication Networks Group Technische Universität Berlin Berlin Germany Berkeley Wireless Research Center University of California Berkeley CA USA

In a wireless, multi-hop sensor network, choosing transmission power levels has an important impact on energy efficiency and network lifetime. Two algorithms for dynamically adjusting transmission power level on a per-node basis are proposed here. Network lifetime, convergence speed as well as resulting network connectivity are used as figures of merit for these two algorithms. They have been evaluated in an indoor sensor environment. The network lifetime metrics of these two local algorithms are also benchmarked against power control algorithms using global information. We show that these local algorithms outperform fixed power level assignment and that the lifetime achieved by them is usually within a factor of two of globally computed solution while being scalable.

关键词： distributed algorithms Power control Intelligent networks Wireless sensor networks Relays Energy efficiency Routing Computer networks Sensor phenomena and characterization Protocols

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Verifying and Ensuring Strong Connectivity of Directed Networks

Distributed Algorithms for Verifying and Ensuring Strong Con...

引用

IEEE Conference on Decision and Control

作者： Made Widhi Surya Atman Azwirman Gusrialdi Faculty of Engineering and Natural Sciences Tampere University Tampere Finland

ISBN: (纸本)9781665436601

This paper considers the problem of distributively verifying and ensuring strong connectivity of directed networks. Strong connectivity of a directed graph associated with the communication network topology is crucial in ensuring the convergence of many distributed algorithms. Specifically, inspired by maximum consensus algorithm, we first propose a distributed algorithm that enables nodes in a networked system to verify strong connectivity of a directed graph. Then, given an arbitrary weakly connected directed graph, we develop a distributed algorithm to augment additional links to ensure the directed graph’s strong connectivity. Both algorithms are implemented without requiring information of the overall network topology and are scalable (linearly with the number of nodes) as they only require finite storage and converge in finite number of steps. Finally, the proposed distributed algorithms are demonstrated via several examples.

关键词： Network topology Conferences Directed graphs Consensus algorithm Topology Communication networks distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：