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

7th International Conference on Intelligent Systems, Modelling and Simulation (ISMS)

作者： Cichon, Jacek Gotfryd, Karol Wroclaw Univ Technol Fac Fundamental Problems Technol Dept Comp Sci Wroclaw Poland

ISBN: (纸本)9781509006656

In this paper, we propose a novel method of solving the averaging problem for distributed Wireless Sensors Networks. This method is based on approximated histograms of measurements made by a sensor network. Our method uses a set of probabilistic counters and allows to find the approximation of the average of a set of measures done by sensor network with arbitrary, controlled by two parameters, precision. The exchange of information is based on broadcasting method exploiting extreme propagation technique. Our method require O(D) rounds, where D is the diameter of the network. We analyze both kind of errors which occurs in our method: discretization errors caused by the histogram representation of the data and errors due to the probabilistic nature of the used counters.

关键词： message propagation distributed algorithm extreme propagation average probabilistic counter exponential distribution Erlang distribution Delta method

来源：评论

学校读者我要写书评

暂无评论

Garbage Collection for General Graphs

Garbage Collection for General Graphs

引用

作者： Krishnan, Hari Louisiana State University

学位级别：博士

Garbage collection is moving from being a utility to a requirement of every modern programming language. With multi-core and distributed systems, most programs written recently are heavily multi-threaded and distributed. distributed and multi-threaded programs are called concurrent programs. Manual memory management is cumbersome and difficult in concurrent programs. Concurrent programming is characterized by multiple independent processes/threads, communication between processes/threads, and uncertainty in the order of concurrent operations. The uncertainty in the order of operations makes manual memory management of concurrent programs difficult. A popular alternative to garbage collection in concurrent programs is to use smart pointers. Smart pointers can collect all garbage only if developer identifies cycles being created in the reference graph. Smart pointer usage does not guarantee protection from memory leaks unless cycle can be detected as process/thread create them. General garbage collectors, on the other hand, can avoid memory leaks, dangling pointers, and double deletion problems in any programming environment without help from the programmer. Concurrent programming is used in shared memory and distributed memory systems. State of the art shared memory systems use a single concurrent garbage collector thread that processes the reference graph. distributed memory systems have very few complete garbage collection algorithms and those that exist use global barriers, are centralized and do not scale well. This thesis focuses on designing garbage collection algorithms for shared memory and distributed memory systems that satisfy the following properties: concurrent, parallel, scalable, localized (decentralized), low pause time, high promptness, no global synchronization, safe, complete, and operates in linear time.

关键词： reachability graph distributed algorithm garbage collection shared memory concurrency

来源：评论

学校读者我要写书评

暂无评论

A distributed Minimum Spanning Tree for Cognitive Radio Networks

引用

Procedia Computer Science 2016年 89卷 162-169页

作者： Mahendra Kumar Murmu Akheel M. Firoz Sandeep Meena Shubham Jain National Institute of Technology Kurukshetra Haryana 136 119 India

The minimum spanning tree is a classical problem in distributed system environment. We extend this challenge in Cognitive Radio Networks (CRN). In CRN, the spectrum mobility and the node mobility creates connectivity problem during neighbour discovery. Thus, finding edges (or relation graph) between the SU nodes in order to create communication graph for Minimum Spanning Tree (MST) is a challenge in cognitive radio network. In the present work, we propose a solution to the problem of creating minimum spanning tree (MST) in cognitive radio network. It is a message passing based distributed algorithm. The MST algorithm find shortest path between any pairs of SUs (or vertices) in the communication graph of CRN. The communication message complexity of our algorithm is 6 E , where E represents the edges. The MST is useful for data dissemination in cognitive radio network.

关键词： Cognitive Radio Network Minimum Spanning Tree Minimum Cost distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed mirror descent method for saddle point problems over directed graphs

引用

COMPLEXITY 2016年第S2期21卷 178-190页

作者： Li, Jueyou Chen, Guo Dong, Zhaoyang Wu, Zhiyou Yao, Minghai Chongqing Normal Univ Sch Math Sci Chongqing 400047 Peoples R China Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia Bohai Univ Dept Coll Fdn Educ Jinzhou 121013 Peoples R China

In this article, we consider a mini-max multi-agent optimization problem where multiple agents cooperatively optimize a sum of local convex-concave functions, each of which is available to one specific agent in a network. To solve the problem, we propose a distributed optimization method by extending classical mirror descent algorithms to the distributed setting. We obtain the convergence of the algorithm under wild conditions that the agent communication follows a directed graph and the related weighted matrices are row stochastic. In particular, when the weighted matrices are restricted to be doubly stochastic, we provide the explicit convergence rate of the algorithm by choosing the stepsize in a suitable way. The proposed algorithm can be viewed as a generalization of the subgradient projection methods since it utilizes a customized Bregman divergence instead of the usual Euclidean squared distance. Finally, some simulation results on a matrix game are presented to illustrate the performance of the algorithm. (c) 2016 Wiley Periodicals, Inc. Complexity 21: 178-190, 2016

关键词： multi-agent system computational complexity distributed algorithm mirror descent saddle point problem

来源：评论

学校读者我要写书评

暂无评论

Improved distributed algorithm via Zero-Padding and Multi-Port ROM Structure

Improved Distributed Algorithm via Zero-Padding and Multi-Po...

引用

Measurement Touch the World——IEEE 2011 10th International Conference on Electronic Measurement & Instruments(ICEMI’2011)

作者： Xie Baozhong,Chen Tiequn(School of Mechanical and Automotive Engineering,South China University of Technology,Guangzhou 510641,China)

Inner product operation of vector is a very common method in signal processing,especially in digital filter,and there is a great influence of calculating speed and the occupied resources upon the signal processing system.A traditional serial shift-summation distributed algorithm(DA)needs many shift-summation operations but not high in the calculating speed,and complete pipeline parallel structure needs many chip resources of Field Programmable Gates Array(FPGA).For these reasons,an improved method was presented,in which Multi-Port Read Only Memory(MPROM)was synthesized by a Look-Up Table in FPGA to construct a distributed ***'s more,logic shift operation is replaced by Zero-Padding as to reduce resource occupation and calculation time *** verification by simulation and synthesization,it was shown that the improved algorithm can reach the performance of a complete pipeline parallel structure but only needs a resource occupation of the serial shift-summation structure.

关键词： distributed algorithm multi-port ROM pipeline zero-padding

来源：评论

学校读者我要写书评

暂无评论

Convergence Analysis on Variable Sample distributed Methods for Stochastic Nash Equilibrium

Convergence Analysis on Variable Sample Distributed Methods ...

引用

第28届中国控制与决策会议

作者： Dali Zhang Sino-US Global Logistics Institute Antai College of Economics and ManagementShanghai Jiao Tong University

ISBN: (纸本)9781467397155

In this paper,we propose a variable sample distributed algorithm for the computation of stochastic Nash equilibrium in which the objective functions are replaced,at each iteration,by sample average *** investigate the contraction mapping properties of the variable sample distributed algorithm and show that the accuracy of estimators yielded in the algorithms to their true counterparts are determined by both the sample size schedules and the contraction mapping *** also investigate conditions on the sample size schedules under which the accumulation point generated by the algorithm asymptotically converges to the true Nash equilibrium.

关键词： Monte Carlo methods distributed algorithm stochastic Nash equilibrium sample size schedule

来源：评论

学校读者我要写书评

暂无评论

distributed Bisection Method for Economic Power Dispatch in Smart Grid

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2015年第6期30卷 3024-3035页

作者： Xing, Hao Mou, Yuting Fu, Minyue Lin, Zhiyun Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Zhejiang Peoples R China Zhejiang Univ Dept Control Sci & Engn Hangzhou 310027 Zhejiang Peoples R China Univ Newcastle Sch Elect Engn & Comp Sci Callaghan NSW 2308 Australia Zhejiang Univ Coll Elect Engn Hangzhou 310027 Zhejiang Peoples R China

In this paper, we present a fully distributed bisection algorithm for the economic dispatch problem (EDP) in a smart grid scenario, with the goal to minimize the aggregated cost of a network of generators, which cooperatively furnish a given amount of power within their individual capacity constraints. Our distributed algorithm adopts the method of bisection, and is based on a consensus-like iterative method, with no need for a central decision maker or a leader node. Under strong connectivity conditions and allowance for local communications, we show that the iterative solution converges to the globally optimal solution. Furthermore, two stopping criteria are presented for the practical implementation of the proposed algorithm, for which sign consensus is defined. Finally, numerical simulations based on the IEEE 14-bus and 118-bus systems are given to illustrate the performance of the algorithm.

关键词： Consensus distributed algorithm distributed convex optimization economic power dispatch smart grid

来源：评论

学校读者我要写书评

暂无评论

distributed Byzantine fault detection technique in wireless sensor networks based on hypothesis testing

引用

COMPUTERS & ELECTRICAL ENGINEERING 2015年 48卷 270-285页

作者： Panda, Meenakshi Khilar, P. M. Natl Inst Technol Rourkela Dept Comp Sci & Engn Rourkela 769008 India

distributed fault detection in wireless sensor network is an important problem where every sensor node identifies its own fault status based on the information from its neighboring sensor nodes. This paper presents a novel distributed fault detection algorithm to detect the soft faulty sensor nodes in sparse wireless sensor networks. In the proposed scheme, every sensor node gathers the information only from their neighboring nodes in order to reduce the communication overhead. The Neyman-Pearson testing method is used to predict the fault status of each sensor node and the neighboring sensor nodes. A voting scheme is applied on the fault status information to obtain the final fault status of each sensor node. The generic parameters such as detection accuracy, false alarm rate, time complexity, message complexity, detection latency, network life time and energy consumption are considered to evaluate the performance of proposed scheme analytically as well as through simulation. The result shows that the proposed scheme significantly improves the performance over the existing algorithms. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Wireless sensor networks distributed algorithm Soft fault detection algorithm Byzantine fault Neyman-Pearson detector

来源：评论

学校读者我要写书评

暂无评论

distributed computation in dynamic networks via random walks

引用

THEORETICAL COMPUTER SCIENCE 2015年 581卷 45-66页

作者： Das Sarma, Atish Molla, Anisur Rahaman Pandurangan, Gopal eBay Inc eBay Res Labs San Jose CA USA Nanyang Technol Univ Div Math Sci Singapore 637371 Singapore Univ Houston Dept Comp Sci Houston TX 77204 USA

The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Random walks are a fundamental primitive in a wide variety of network applications;the local and lightweight nature of random walks is especially useful for providing uniform and efficient solutions to distributed control of dynamic networks. Given their applicability in dynamic networks, we focus on developing fast distributed algorithms for performing random walks in such networks. Our first contribution is a rigorous framework for the design and analysis of distributed random walk algorithms in dynamic networks. We then develop a fast distributed random-walk based algorithm that runs in (O) over tilde(root tau Phi) rounds(2) (with high probability), where tau is the dynamic mixing time and Phi is the dynamic diameter of the network, respectively, and returns a sample close to a suitably defined stationary distribution of the dynamic network. Our next contribution is a fast distributed algorithm for the fundamental problem of information dissemination (also called as gossip) in a dynamic network. In gossip, or more generally, k-gossip, there are k pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the k tokens to all nodes. We present a random-walk based algorithm that runs in (O) over tilde (min{n(1/3)k(2/3)(tau Phi)(1/3),k Phi}) rounds (with high probability). This is the first o(k Phi))-time fully-distributed token forwarding algorithm (on certain graph families) that improves over the previous-best O(k Phi) round distributed algorithm (Kuhn et al. [24]), although in an oblivious adversary model. The random walk framework developed in this paper has also subsequently proved useful in developing efficient storage and search algorithms as well as developing fast byzantine agreement algorithms in dynamic networks. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Dynamic network distributed algorithm Random walks Random sampling Information dissemination Gossip

来源：评论

学校读者我要写书评

暂无评论

Fast distributed Demand Response With Spatially and Temporally Coupled Constraints in Smart Grid

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2015年第6期11卷 1597-1606页

作者： Deng, Ruilong Xiao, Gaoxi Lu, Rongxing Chen, Jiming Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Zhejiang Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

As the next generation power grid, smart grid is characterized as an informationized system, and demand response is one of its important features to deal with the ever-increasing peak energy usage. However, the supply capacity and required demand make the demand response problem with both spatially and temporally coupled constraints, which, to the best of our knowledge, has not been thoroughly investigated in a distributed manner. The complexity lies in how to guarantee privacy and convergence of distributed algorithms. Aiming at this challenge, in this paper, we first propose a distributed algorithm, which is based on dual decomposition and does not require each user to reveal his/her private information. Then, the convergence analysis is conducted to provide guidance on how to choose the proper step size;through which, we notice that the convergence speed of the subgradient projection method is not fast enough and it is highly dependent on the choice of the step size. Therefore, to increase the convergence rate of the distributed algorithm, we further propose a fast approach based on binary search. Finally, the distributed algorithms are illustrated by numerical simulations and the extensive comparison results validate the better performance of the fast approach.

关键词： Convergence demand response distributed algorithm smart grid spatially/temporally coupled constraint

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：