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

2015 Workshop 11

作者： Mingzhu Wei Ryad Chellali Yang Yi Ting Wang Wen Qin College of Electric Engineering and Control Science Nanjing Tech University

Network localization is a fundamental problem in wireless sensor networks,mainly in location dependent applications.A common family of solutions to this problem is the range‐based network *** resulting localization algorithms are noise sensitive and thus lacking in terms of *** contribution provides an algorithm which is robust to measurement *** propose an analytical tool to analyze the effect of range errors in the final location and use a distributed method to solve the noisy range localization problem.

关键词： Network Localization Noisy Range Measurement distributed computation

来源：评论

学校读者我要写书评

暂无评论

A Scalability Metric Based on Beowulf Cluster System

A Scalability Metric Based on Beowulf Cluster System

引用

The Ninth International Symposium on distributed Computing and Applications to Business,Engineering and Science

作者： Yongzhi Zhu,Baoxiang Cao College of Computer Science,Qufu Normal University,RiZhao 276826

Along with the rapid development of parallel computing technology and the popularity of Beowulf cluster system,the scalability of parallel algorithm-machine combinations,which measures the capacity of a parallel algorithm to effectively utilize an increasing number of processors,becomes more and more *** ratio of parallel overhead to computation is reviewed in this paper,the merit and deficiencies of this metric are pointed *** in order to apply the distributed parallel computation environment based on Beowulf cluster it is improved,obtain the new extensible function which reflects the scalability of distributed parallel systems more directly and precisely when the size of machines and the scale of problems are extending in the environment of Beowulf ***,the new metric is used to analyze and prove the scalability of parallel algorithms and Beowulf cluster.

关键词： scalability iso ratio of parallel overhead to computation Beowulf cluster distributed computation

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Power Flow Calculation Service Based on WCF

Design and Implementation of Power Flow Calculation Service ...

引用

2016 4th International Conference on Machinery,Materials and Information Technology Applications(ICMMITA 2016)

作者： Lifang Xu Tong Jiang Zhao Yu Chengnan Lu School of Electrical ＆ Electronic Engineering North China Electric Power University

Some problems exist in power flow calculation such as complex programming and expensive calculation software, a new method is put forward that traditional power flow calculation can be transferred to the Web. Based on that, this paper designs a power flow calculation service. The users can view the service interface and the instruction, add the service to the local program so as to complete the power flow calculation;besides, users can also access the relevant website through browser, upload raw data, and figure out power flow calculation easy and quickly. The method provides a clear and open power flow calculation service, which is convenient to use and can be applied to the teaching and authentication of computation results. In this paper, the Newton-Raphson power flow algorithm in Cartesian coordinates is demonstrated to verify the feasibility of the design.

关键词： Power flow calculation WCF SOA distributed computation Multithreading

来源：评论

学校读者我要写书评

暂无评论

An Intelligent ETL Workflow Framework based on data Partition

An Intelligent ETL Workflow Framework based on data Partitio...

引用

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

作者： Yingying Tu Chaozhen Guo The college of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (纸本)9781424465828

ETL tool is an important part to build a data warehouse and data centers,. For massive data processing, this paper presents an intelligent ETL workflow framework based on the distributed computing servers, adding an intelligent manipulative module, acquiring the data of the system efficiency and resources, operating data, dynamically adjusting the ETL strategy, and doing corresponding data segmentation for larger jobs, realizing workflow optimization for multi-machine parallel execution, improving operational efficiency, and facilitating error recovery. Intelligent control module is composed of the monitor, knowledge base, and the selector. The source data horizontal partition is the basis and difficulty to achieve multi-machine parallel.

关键词： distributed computation Intelligence ETL data partition multi-agent

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Efficiency of distributed Random Sampling Algorithm

Asymptotic Efficiency of Distributed Random Sampling Algorit...

引用

第三十八届中国控制会议

作者： Qian Liu Xingkang He Haitao Fang LSC Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences ACCESS Linnaeus Centre School of Electrical Engineering and Computer Science KTH Royal Institute of Technology

In this paper, we focus on estimating the distribution of underlying parameter over random networks through reconstructing the empirical distribution of initial samples, which can be viewed as a particular average consensus problem. A class of quantized communication protocol, in which neighbors exchange information randomly selected based on the current estimate,is considered. To improve the convergence rate of this distributed random sampling algorithm, we introduce the Polyak average scheme, and show that asymptotic efficiency can be achieved through the averaging technique under proper conditions. The results show that the minimum limit covariance matrix of estimation error can be reached, i.e., the proposed algorithm achieves the highest possible rate of convergence. Finally, we provide a numerical simulation to validate the theoretical results of this work.

关键词： Average consensus distributed computation randomized algorithm asymptotic efficiency

来源：评论

学校读者我要写书评

暂无评论

Network modeling for distributed simulations of unbalanced power systems 07

Network modeling for distributed simulations of unbalanced p...

引用

Proceedings of the 2007 Summer Computer Simulation Conference

作者： Michael Kleinberg Karen Miu Chika Nwankpa Drexel University Philadelphia PA

ISBN: (纸本)9781565553163

With the increasing presence of distributed intelligence throughout power systems, the possibilities for distributed control and operation schemes are becoming progressively more attractive and feasible. Multi-phase distribution power flow is a tool which calculates the operating state of an electric power distribution system and is used to support all other planning and operation applications. This paper will derive models for the distributed analysis and simulation of distribution systems and will present their use in calculating the power flow solution using physically remote distributed *** perform the power flow, distributed analysis models for multi-phase distribution systems have been developed and are embedded in a distributed algorithm. These include network partition models and equivalent source and load models which are used to represent each of the subsystems in the distributed analysis. A distributed processor test bed has been designed to test the performance of the models in distributed simulations. Results will be presented which validate the accuracy of the proposed models and algorithm.

关键词： distributed simulation power distribution systems distributed computation

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: self-stabilizing resource discovery algorithm 13

Brief announcement: self-stabilizing resource discovery algo...

引用

Proceedings of the 2013 ACM symposium on Principles of distributed computing

作者： Seda Davtyan Kishori M. Konwar Alexander A. Shvartsman University of Connecticut Storrs Connecticut USA University of British Columbia Vancouver Canada University of Connectict Storrs Connecticut USA

ISBN: (纸本)9781450320658

distributed cooperative computing in networks involves marshaling collections of network nodes possessing the necessary computational resources. Before the willing nodes can act in a concerted way they must first discover one another. This is the general setting of the Resource Discovery Problem (RDP). This paper presents a self-stabilizing algorithm that solves RDP in a deterministic synchronous setting. The solution approach is formulated in terms of evolving knowledge graphs, where vertices represent the participating network nodes, and edges represent one node's knowledge about another. Ideally, the diameter of such a graph is one, i.e., each node knows all others. The algorithm works in rounds as it evolves the knowledge graph with the goal of reducing its diameter. This is accomplished by nodes sharing their knowledge through gossip messages. We prove that the algorithm is self-stabilizing, i.e., it tolerates arbitrary perturbations in the nodes' local states and is guaranteed to solve the problem once such failures subside. The algorithm has stabilization time of O(D), and it takes at most 4D + 4 complete round to stabilize, where D is the diameter of the initial knowledge graph, and the corresponding message complexity is O,(|V|j ⋅D), where V is the set of participating nodes.

关键词： resource discovery fault-tolerance distributed computation self-stabilization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Automatically balancing relocatable distributed collections

引用

CONCURRENCY AND computation-PRACTICE & EXPERIENCE 2023年第27期35卷

作者： Finnerty, Patrick Kamada, Tomio Ohta, Chikara Kobe Univ Grad Sch Syst Informat Kobe Hyogo Japan Konan Univ Dept Intelligence & Informat Kobe Hyogo Japan Kobe Univ Grad Sch Syst Informat S302 Rokkodai Cho 1-1 Kobe Hyogo 6570013 Japan

In previous work, we introduced a distributed collections library for the APGAS for Java programming model. This library makes it possible for programmers to develop complex distributed programs thanks to the many abstractions and computation patterns supported. In particular, programmers can fully and dynamically change the distribution of data entries through high-level abstractions. However, the problem of balancing the load between processes remains, especially in cases where multiple processes may be concurrently executing on a single host, or when the performance of the hosts used differs. To address this issue and to relieve the burden of programming a load balancing strategy for a specific application, we created a dynamic load balancer integrated into our library. This load balancer operates within a specific context in a manner which does not interfere with the program legibility. Internally, we implement a scheme inspired by the lifeline-based global load balancer scheme first introduced in x$$ \times $$10. We evaluate the performance of our integrated load balancer on a small-scale Beowulf cluster.

关键词： distributed collection distributed computation dynamic load balancing work stealing

来源：评论

学校读者我要写书评

暂无评论

distributed Randomized PageRank Algorithms Based on Web Aggregation over Unreliable Channels

Distributed Randomized PageRank Algorithms Based on Web Aggr...

引用

2010 49th IEEE Conference on Decision and Control

作者： Hideaki Ishii Roberto Tempo Er-Wei Bai Department of Computational Intelligence and Systems Science Tokyo Institute of Technology 4259 Nagatsuta-cho Midori-ku Yokohama 226-8502 Japan IEIIT-CNR Politecnico di Torino Corso Duca degli Abruzzi 24 10129 Torino Italy Department of Electrical and Computer Engineering The University of Iowa 4316 Seamans Center for the Engineering Arts and Sciences Iowa City IA 52242-1527 U.S.A.

ISBN: (纸本)9781424477456

The PageRank algorithm employed at Google assigns a measure of importance to each web page for rankings in search results. In our recent papers, we have proposed a distributed randomized approach for this algorithm, where web pages are treated as agents computing their own PageRank by communicating with linked pages. Here, we focus on the effects of unreliability in the communication and, in particular, model the random data losses as an outcome of Markov chains. By generalizing the aggregated PageRank computation previously developed, we provide a distributed scheme along with analyses on its convergence properties.

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：