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

35th ACM International Conference on Supercomputing (ICS)

作者： Huang, Xuan Klacansky, Pavol Petruzza, Steve Gyulassy, Attila Bremer, Peer-Timo Pascucci, Valerio Univ Utah SCI Inst Salt Lake City UT 84112 USA Utah State Univ Logan UT 84322 USA Lawrence Livermore Natl Lab Livermore CA 94550 USA

ISBN: (纸本)9781450383356

Topological analysis is used in several domains to identify and characterize important features in scientific data, and is now one of the established classes of techniques of proven practical use in scientific computing. The growth in parallelism and problem size tackled by modern simulations poses a particular challenge for these approaches. Fundamentally, the global encoding of topological features necessitates interprocess communication that limits their scaling. In this paper, we extend a new topological paradigm to the case of distributed computing, where the construction of a global merge tree is replaced by a distributed data structure, the merge forest, trading slower individual queries on the structure for faster end-to-end performance and scaling. Empirically, the queries that are most negatively affected also tend to have limited practical use. Our experimental results demonstrate the scalability of both the merge forest construction and the parallel queries needed in scientific workflows, and contrast this scalability with the two established alternatives that construct variations of a global tree.

关键词： distributed algorithms topological data analysis feature extraction

来源：评论

学校读者我要写书评

暂无评论

A distributed Algorithm for Multi-Armed Bandit with Homogeneous Rewards over Directed Graphs

A Distributed Algorithm for Multi-Armed Bandit with Homogene...

引用

American Control Conference (ACC)

作者： Zhu, Jingxuan Liu, Ji SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

ISBN: (纸本)9781665441971

This paper studies a distributed multi-armed bandit problem over a network of N agents whose neighbor relationships are described by a directed graph G. Each agent makes a sequence of decisions on selecting an arm from M candidates, yet it only receives a sample of the reward for each decision, which is an unknown random variable. A distributed upper confidence bound (UCB) algorithm is proposed for the agents to cooperatively learn the best decision. It is shown that when all the agents share a homogeneous distribution of each arm reward and G is strongly connected, the algorithm achieves a guaranteed logarithmic regret for all N agents. A sufficient condition under which the proposed distributed algorithm learns faster than the classical single-agent UCB1 is also provided.

关键词： Knowledge engineering Sufficient conditions Decision making Directed graphs Random variables distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Friends or Foes: distributed and Randomized algorithms to Determine Dishonest Recommenders in Online Social Networks

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2014年第10期9卷 1695-1707页

作者： Li, Yongkun Lui, John C. S. Univ Sci & Technol China Sch Comp Sci & Technol Hefei 215123 Peoples R China Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China

Viral marketing is becoming important due to the popularity of online social networks (OSNs). Companies may provide incentives (e. g., via free samples of a product) to a small group of users in an OSN, and these users provide recommendations to their friends, which eventually increases the overall sales of a given product. Nevertheless, this also opens a door for malicious behaviors: dishonest users may intentionally give misleading recommendations to their friends so as to distort the normal sales distribution. In this paper, we propose a detection framework to identify dishonest users in the OSNs. In particular, we present a set of fully distributed and randomized algorithms, and also quantify the performance of the algorithms by deriving probability of false positive, probability of false negative, and the distribution of number of detection rounds. Extensive simulations are also carried out to illustrate the impact of misleading recommendations and the effectiveness of our detection algorithms. The methodology we present here will enhance the security level of viral marketing in the OSNs.

关键词： Dishonest recommenders misbehavior detection distributed algorithms online social networks

来源：评论

学校读者我要写书评

暂无评论

Consensus From distributed Iterative Voting 11

Consensus From Distributed Iterative Voting

引用

IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC)

作者： Guha, Agneyi Dasgupta, Abhijit BSQ Res LLP Bangalore Karnataka India SP Jain Sch Global Management Mumbai Maharashtra India

ISBN: (纸本)9781665414906

distributed algorithms executed by a network of nodes with limited computational resources have many practical applications, not only in computer science, but also in other areas of engineering, and in physics, biology, and the social sciences. This paper studies one such algorithm in which the nodes update their states by iteratively voting for one of a finite number of candidates. Our numerical simulations show that convergence for this algorithm depends on a parameter m that determines the mean of the normal distribution that generates the weights in the network. When m is above an upper threshold, the algorithm always converges to a consensus candidate. When m is below a lower threshold, the algorithm does not converge and there is no consensus. When m is between these two thresholds, then the algorithm converges, but not necessarily to a consensus candidate. The values of the thresholds depend on the size of the network.

关键词： distributed algorithms distributed consensus iterative voting recurrent networks signed graphs

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model 21

Performance analysis of a distributed algorithm for admissio...

引用

22nd International Conference on distributed Computing and Networking (ICDCN)

作者： Ganesan, Ashwin Int Sch Engn INSOFE Mumbai Maharashtra India

ISBN: (纸本)9781450389334

A general open problem in networking is: what are the fundamental limits to the performance that is achievable with some given amount of resources? More specifically, if each node in the network has information about only its 1-hop neighborhood, then what are the limits to performance? This problem is considered for wireless networks where each communication link has a minimum bandwidth quality-of-service (QoS) requirement. Links in the same vicinity contend for the shared wireless medium. The conflict graph captures which pairs of links interfere with each other and depends on the MAC protocol. In IEEE 802.11 MAC protocol-based networks, when communication between nodes i and j takes place, the neighbors of both i and j remain silent. This model of interference is called the 2-hop interference model because the distance in the network graph between any two links that can be simultaneously active is at least 2. In the admission control problem studied in the present paper, the objective is to determine, using only localized information, whether a given set of flow rates is feasible. In the present work, a distributed algorithm is proposed for this problem, where each node has information only about its 1-hop neighborhood. The worst-case performance of the distributed algorithm, i.e. the largest factor by which the performance of this distributed algorithm is away from that of an optimal, centralized algorithm, is analyzed. Lower and upper bounds on the suboptimality of the distributed algorithm are obtained, and both bounds are shown to be tight. The exact worst-case performance is obtained for some ring topologies. While distance-d distributed algorithms have been analyzed for the 1-hop interference model, an open problem in the literature is to extend these results to the K-hop interference model, and the present work initiates the generalization to the K-hop interference model.

关键词： Graph theory wireless ad hoc networks quality-of-service (QoS) media access (MAC) protocols distributed algorithms approximation algorithms admission control 2-hop interference model secondary interference model imperfection ratio

来源：评论

学校读者我要写书评

暂无评论

Robust distributed Estimation of the Algebraic Connectivity for Networked Multi-robot Systems

Robust Distributed Estimation of the Algebraic Connectivity ...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Malli, Joanna Bechlioulis, Charalampos P. Kyriakopoulos, Kostas J. Natl Tech Univ Athens Sch Mech Engn Control Syst Lab Athens Greece

ISBN: (纸本)9781728190778

The connectivity of distributed networked multi-robot systems is a crucial operational specification, since the involved robots interact/communicate locally only with their immediate neighbors. Thus, in this work, we propose a distributed algorithm to estimate the algebraic connectivity of the underlying communication graph, which stands as a valid connectivity metric. Our method establishes robustness and fast convergence properties that can be adjusted independently via the appropriate selection of certain design parameters. Finally, we confirm the theoretical findings through simulated paradigms and verify the superiority of our method against a well-established solution of the related literature.

关键词： Measurement Automation Conferences Estimation Robustness Multi-robot systems distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Backward/Forward Sweep Algorithm for Economic Dispatch in Modern Distribution Grids 52

Distributed Backward/Forward Sweep Algorithm for Economic Di...

引用

52nd North American Power Symposium (NAPS)

作者： Haider, Rabab Jaddivada, Rupamathi Annaswamy, Anuradha M. Ilic, Marija D. MIT Mech Engn 77 Massachusetts Ave Cambridge MA 02139 USA MIT Lab Informat & Decis Syst 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781728181929

The emerging power grid is characterized by a high penetration of distributed energy resources (DERs), particularly in the distribution grid. There is potential to leverage these DERs to provide grid-level support or reduce operating costs. However, economic dispatch of these DERs in a centralized fashion is computationally intractable. Rather, the use of distributed algorithms which leverage grid edge intelligence and peer-to-peer communication is preferred. To this end, we propose a distributed algorithm for the recursive economic dispatch of DERs for radial distribution grids, based on the backward/forward sweep method, using the LinDistFlow equations. We aggregate costs through recursive bid functions using local information, which are then cleared using local computational resources. We motivate our design of bid functions using the KKT optimality conditions, and provide numerical results for the IEEE-13 bus network.

关键词： Economics Aggregates Power grids Peer-to-peer computing distributed power generation distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

LP-relaxation based distributed algorithms for Scheduling in Wireless Networks

LP-relaxation based Distributed Algorithms for Scheduling in...

引用

IEEE International Conference on Computer Communications

作者： Chandramani Singh Angelia Nedic R. Srikant Coordinated Science Lab University of Illinois at Urbana-Champaign Urbana IL 61801 USA

ISBN: (纸本)9781479933617

LP relaxations of Maximum Weighted Independent Set (MWIS) problems have been widely studied. A key motivation for this prior work comes from the central role that MWIS plays in designing throughput-optimal algorithms for wireless networks. However, to the best of our knowledge, the actual packet delay performance of these algorithms has not been studied in the context of wireless networks. In this paper, we first present an algorithm for solving the LP relaxation of MWIS which exhibits faster convergence to an optimal solution. Further, we show that one does not have to wait for infinite time for convergence to occur, but a simple rounding technique can be used to identify the ON/OFF states of the wireless links in finite time. As in prior work, such an approach only identifies the optimal MWIS states of some of the links in the network. Therefore, we present a scheme to combine this solution with Q-CSMA. Simulations indicate that the proposed scheme significantly improves the performance of Q-CSMA. Further, the proposed algorithm is shown to perform much better than previously suggested LP relaxation schemes due to its superior convergence properties.

关键词： Wireless networks distributed algorithms algorithms Converge network links Scheme Relaxation

来源：评论

学校读者我要写书评

暂无评论

How to implement doubly-stochastic matrices for consensus-based distributed algorithms

How to implement doubly-stochastic matrices for consensus-ba...

引用

Sensor Array and Multichannel Signal Processing Workshop

作者： Sergio Valcarcel Macua Carlos Moreno Leon Jhoan Samuel Romero Silvana Silva Pereira Javier Zazo Alba Pagès-Zamora Roberto López-Valcarce Santiago Zazo Escuela Técnica Superior de Ingenieros de Telecomunicación Universidad Politécnica de Madrid Spain SPCOM Group Universitat Politécnica de Catalunya-Barcelona Tech Spain GPSC Universidade de Vigo Spain

Doubly-stochastic matrices are usually required by consensus-based distributed algorithms. We propose a simple and efficient protocol and present some guidelines for implementing doubly-stochastic combination matrices even in noisy, asynchronous and changing topology scenarios. The proposed ideas are validated with the deployment of a wireless sensor network, in which nodes run a distributed algorithm for robust estimation in the presence of nodes with faulty sensors.

关键词： Signal processing algorithms Topology distributed algorithms Robustness Estimation Protocols Network topology

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents 22

Brief Announcement: Gathering Despite a Linear Number of Wea...

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Hirose, Jion Nakamura, Junya Ooshita, Fukuhito Inoue, Michiko Nara Inst Sci & Technol Ikoma Nara Japan Toyohashi Univ Technol Toyohashi Aichi Japan Fukui Univ Technol Fukui Fukui Japan

ISBN: (纸本)9781450392624

We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist k agents with unique identifiers (IDs) in the network, and.. of them are weakly Byzantine agents, which behave arbitrarily except for falsifying their IDs. The agents behave in synchronous rounds, and each node does not have any memory like a whiteboard. In the literature, there exists a gathering algorithm that tolerates any number of Byzantine agents, while the fastest gathering algorithm requires Omega(f(2)) non-Byzantine agents. This paper proposes an algorithm that solves the gathering problem efficiently with Omega(f(2)) non-Byzantine agents since there is a large gap between the number of non-Byzantine agents in the previous works. The proposed algorithm achieves the gathering in O(f center dot |Lambda(good) | center dot X (Nu)) rounds in case of 9f + 8 <= k and simultaneous startup if.. is given to agents, where ||Lambda(good) | | is the length of the largest ID among nonByzantine agents, and |Lambda(good) | is the number of rounds required to explore any network composed of n nodes. This algorithm is faster than the most fault-tolerant existing algorithm and requires fewer non-Byzantine agents than the fastest algorithm if.. is given to agents, although the guarantees on simultaneous termination and startup delay are not the same. To achieve this property, we propose a new technique to simulate a Byzantine consensus algorithm for synchronous message-passing systems on agent systems.

关键词： Gathering distributed algorithms Byzantine environments

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：