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

International Conference on Sustainable Power Generation and Supply

作者： Zhao, J. Shi, F. Chen, G. Hohai Univ Dept Elect Engn Nanjing 210098 Peoples R China Yixing Power Co Yixing Jiangsu 214200 Peoples R China

ISBN: (纸本)9781424449347

It is imperative to accurately consider the effect of external network on internal system's voltage stability for Online voltage stability assessment of a subsystem within a large interconnected power grid. Since the heaviest load condition of a system and a set of credible severe contingencies have to be considered in VSA, traditional network equivalent with respect to a snapshot case cannot meet the requirements. Two different distributed computation modes are proposed to exactly consider the effects of external networks. They are the synchronous iteration (SI) mode and the asynchronous iteration (AI) mode. The continuation power flow methods under both SI and AI mode are developed to calculate the load margins. The numerical results of IEEE118 bus power system indicate that the decomposition and coordination methods can get the better results comparing to the local equivalence methods.

关键词： Voltage Stability Assessment distributed computation Continuation Power Flow Synchronous Iteration Mode Asynchronous Iteration Mode

来源：评论

学校读者我要写书评

暂无评论

Computing on a partially eponymous ring

引用

10th International Conference on Principles of distributed Systems

作者： Mavronicolas, Marios Michael, Loizos Spirakis, Paul Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA Univ Cyprus Dept Comp Sci CY-1678 Nicosia Cyprus Univ Paderborn Fac Comp Sci Elect Engn & Math D-33102 Paderborn Germany Univ Patras Dept Comp Engn & Informat Patras 26500 Greece Res Acad Comp Technol Inst Patras 26500 Greece

ISBN: (纸本)9783540499909

We study the partially eponymous model of distributed computation, which simultaneously generalizes the anonymous and the eponymous models. In this model, processors have identities, which are neither necessarily all identical (as in the anonymous model) nor necessarily unique (as in the eponymous model). In a decision problem formalized as a relation, processors receive inputs and seek to reach outputs respecting the relation. We focus on the partially eponymous ring, and we shall consider the computation of circularly symmetric relations on it. We consider sets of rings where all rings in the set have the same multiset of identity multiplicities. We distinguish between solvability and computability: in solvability, processors are required to always reach Outputs respecting the relation;in computability, they must do so whenever this is possible, and Must otherwise report impossibility. -We present a topological characterization of solvability for a relation on a set of rings. which can be expressed as an efficiently checkable, number-theoretic predicate. -We present a universal distributed algorithm for computing a relation on a set of rings: it runs any distributed algorithm for constructing views, followed by local steps. We derive, as our main result, a universal upper bound on the message complexity to compute a relation on a set of rings: this bound demonstrates a graceful degradation with the Least Minimum Base, a parameter indicating the degree of least possible eponymity for a set of rings. Thereafter, we identify two cases where a relation can be computed on a set of rings, with rings of size n, with an efficient number of O (n . Ig n) messages. (C) 2008 Elsevier B.V. All rights reserved.

关键词： distributed computation Partially eponymous Ring Solvability Computability Message complexity Multiple leader election Circularly symmetric relation

来源：评论

学校读者我要写书评

暂无评论

A Study of Convergence of the Majority Genetic Algorithm with Infinite Size Population

A Study of Convergence of the Majority Genetic Algorithm wit...

引用

International Conference on Networks Security, Wireless Communications and Trusted Computing

作者： Su, Jun Qin, Hang Yangtze Univ Comp Sch Jinzhou 434023 Peoples R China

Nowadays, the genetic algorithm (GA) has become widespread, the theoretical work from the genetic and evolutionary computation field has been largely ignored by practitioners in real world applications. This paper pro... 详细信息

ISBN: (纸本)9780769536101

关键词： Genetic algorithm convergence distributed computation infinite size population

来源：评论

学校读者我要写书评

暂无评论

A distributed Randomized Approach for the PageRank computation: Part 2

A Distributed Randomized Approach for the PageRank Computati...

引用

47th IEEE Conference on Decision and Control

作者： Ishii, Hideaki Tempo, Roberto Tokyo Inst Technol Dept Computat Intelligence & Syst Sci Yokohama Kanagawa 2268502 Japan Politecn Torino CNR IEIIT I-10129 Turin Italy

ISBN: (纸本)9781424431243

In the search engine of Google, the PageRank algorithm plays a crucial role in ranking the obtained results. The algorithm determines the importance of each web page based on the link structure of the web. In this two-part paper, we propose a distributed randomized approach for the PageRank computation, where the pages locally update their values by communicating with linked pages. This paper is the second part, and we develop two enhanced distributed schemes which deal with simultaneous updates and update termination of the computations, respectively.

关键词： distributed computation Multi-agent consensus PageRank algorithm Randomization Stochastic matrices

来源：评论

学校读者我要写书评

暂无评论

A distributed Randomized Approach for the PageRank computation: Part 1

A Distributed Randomized Approach for the PageRank Computati...

引用

47th IEEE Conference on Decision and Control

作者： Ishii, Hideaki Tempo, Roberto Tokyo Inst Technol Dept Computat Intelligence & Syst Sci Yokohama Kanagawa 2268502 Japan Politecn Torino CNR IEIIT I-10129 Turin Italy

ISBN: (纸本)9781424431243

In the search engine of Google, the PageRank algorithm plays a crucial role in ranking the obtained results. The algorithm quantifies the importance of each web page based on the link structure of the web. In this two-part paper, we first provide an overview of the original problem setup. Then, we propose several distributed randomized schemes for the computation of the PageRank, where the pages can locally update their values by communicating to those connected by links. A detailed discussion on the close relations to the multi-agent consensus problems is also given.

关键词： distributed computation Multi-agent consensus PageRank algorithm Randomization Stochastic matrices

来源：评论

学校读者我要写书评

暂无评论

Computing the PageRank Variation for Fragile Web Data

引用

SICE Journal of Control, Measurement, and System Integration 2009年第1期2卷 1-9页

作者： Hideaki Ishii Roberto Tempo Department of Computational Intelligence &ampSystems Science Tokyo Institute of Technology IEIIT-CNR Politecnico di Torino

Search engines utilize numerous measures to rank the webpages in the search results. At Google, the so-called PageRank algorithm provides crucial information by quantifying the importance of webpages. The PageRank values are considered to be objective since the algorithm requires only the data of the web link structure. In this paper, we first introduce the original PageRank algorithm and give a brief overview of the distributed randomized approach recently proposed by the authors. Then, we consider the problem of computing the variation in the PageRank values that can be caused by erroneous data in the web structure when some links are fragile. An efficient (centralized) algorithm in the form of linear programming is proposed. This approach employs results from the field of interval matrices. Numerical examples are given to verify the effectiveness of the approach.

关键词： distributed computation interval matrices multi-agent systems PageRank algorithm randomized algorithms search engines

来源：评论

学校读者我要写书评

暂无评论

In-network detection of anomaly regions in sensor networks with obstacles

引用

COMPUTER SCIENCE-RESEARCH AND DEVELOPMENT 2009年第3期24卷 153-170页

作者： Franke, Conny Karnstedt, Marcel Klan, Daniel Gertz, Michael Sattler, Kai-Uwe Chervakova, Elena Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Ilmenau Univ Technol Databases & Informat Syst Grp Ilmenau Germany Heidelberg Univ Inst Comp Sci Heidelberg Germany Inst Microelectron & Mechtron Syst Ilmenau Germany

In the past couple of years, sensor networks have evolved into an important infrastructure component for monitoring and tracking events and phenomena in several, often mission critical application domains. An important task in processing streams of data generated by these networks is the detection of anomalies, e.g., outliers or bursts, and in particular the computation of the location and spatial extent of such anomalies in a sensor network. Such information is then used as an important input to decision making processes. In this paper, we present a novel approach that facilitates the efficient computation of such anomaly regions from individual sensor readings. We propose an algorithm to derive regions with a spatial extent from individual (anomalous) sensor readings, with a particular focus on obstacles present in the sensor network and the influence of such obstacles on anomaly regions. We then improve this approach by describing a distributed in-network processing technique where the region detection is performed at sensor nodes and thus leads to important energy savings. We demonstrate the advantages of this strategy over a traditional, centralized processing strategy by employing a cost model for real sensors and sensor networks.

关键词： Sensor networks Data streams Outlier detection distributed computation

来源：评论

学校读者我要写书评

暂无评论

Recent Developments in distributed Particle Filtering: Towards Fast and Accurate Algorithms

引用

IFAC Proceedings Volumes 2009年第20期42卷 138-143页

作者： Andrea Simonetto Tamás Keviczky Delft Center for Systems and Control Delft University of Technology The Netherlands

Particle filters have been widely used for the solution of optimal estimation problems in nonlinear non-Gaussian environments. One of their drawbacks is that these methods are computationally expensive. In the past few years, new developments have been made in trying to distribute the particle filter algorithm among different computing agents in order to make the underlying computations tractable. This period also witnessed the rise of general purpose GPU devices, which are making massive code parallelization possible. These developments have the potential to make the particle filter a viable alternative for real-time implementations in the near future, even when the number of required particles is high. In this paper we review the state-of-the-art in distributed particle filtering and propose a method that is applicable to distributed computing architectures.

关键词： Particle filters distributed estimation algorithms distributed particle filters consensus filters distributed computation mobile robot tracking general purpose GPU

来源：评论

学校读者我要写书评

暂无评论

Capacity provision networks: Foundations of markets for sharable resources in distributed computational economies

引用

INFORMATION SYSTEMS RESEARCH 2008年第2期19卷 144-160页

作者： Du, Anna Ye Geng, Xianjun Gopal, Ram Ramesh, R. Whinston, Andrew B. SUNY Buffalo Dept Management Sci & Syst Buffalo NY 14260 USA Univ Washington Dept Informat Syst & Operat Management Seattle WA 98195 USA Univ Connecticut Dept Operat & Informat Management Storrs CT 06269 USA Univ Texas Austin Dept Management Sci & Informat Risk & Operat Mana Austin TX 78712 USA

With the rapid growth of rich-media content over the Internet, content and service providers (SP) are increasingly facing the problem of managing their service resources cost-effectively while ensuring a high quality of service (QoS) delivery at the same time. In this research we conceptualize and model an Internet-based storage provisioning network for rich-media content delivery. This is modeled as a capacity provision network (CPN) where participants possess service infrastructures and leverage their topographies to effectively serve specific customer segments. A CPN is a network of SPs coordinated through an allocation hub. We first develop the notion of discounted QoS capabilities of storage resources. We then investigate the stability of the discount factors over time and the network topography using a test-bed on the Internet through a longitudinal empirical study. Finally, we develop a market maker mechanism for optimal multilateral allocation and surplus sharing in a network. The proposed CPN is closely tied to two fundamental properties of Internet service technology: positive network externality among cooperating SPs and the property of effective multiplication of capacity allocation among several distributed service sites. We show that there exist significant incentives for SPs to engage in cooperative allocation and surplus sharing. We further demonstrate that intermediation can enhance the allocation effectiveness and that the opportunity to allocation and surplus sharing can play an important role in infrastructure planning. In conclusion, this study demonstrates the practical business viability of a cooperative CPN market.

关键词： capacity provision networks resource sharing online market distributed computation quality of service

来源：评论

学校读者我要写书评

暂无评论

Cloud-Enabled Scalable Decision Tree Construction

Cloud-Enabled Scalable Decision Tree Construction

引用

Fifth International Conference on Semantics,Knowledge and Grid(第五届语义、知识与网格国际会议 SKG 2009)

作者： Yuzhang Han Peter Brezany Ivan Janciak Department of Computer Science University of Vienna Vienna Austria

Cloud Computing, as a newly emerging technology, is an innovation providing dynamically scalable and virtualized resources as services. In this paper, we introduce our recent effort to build a service-oriented distributed computational system based on the Cloud concepts named distributed computational Service Cloud. This kind of Cloud hosts scalable Grid services, which are implemented with Web- Services-Resource-Framework-compliant (WSRF) [1] Web services, enabling high-performance and distributed computing. We evaluate the Cloud using scalable decision tree service, which provides computational intensive data mining algorithm. The architecture of the system as well as details of the distributed decision tree construction is the kernel content of this paper.

关键词： Cloud Computing Decision Tree distributed computation Web service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：