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

14th International Conference on distributed Computing and Networking, ICDCN 2013

作者： Himanshu, Chauhan Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas Austin TX United States

ISBN: (纸本)9783642356674

In this paper, we show that for elections in distributed systems the conversion from non-binary choices to binary choices does not always provide optimal results when the preferences of nodes are not identical. With this observation, we study the problem of conducting democratic elections in distributed systems in the form of social choice and social welfare functions with three or more candidates. We present some impossibility and possibility results for distributed democratic elections in presence of Byzantine behavior. We also discuss some existing election schemes, and present a new approach that attempts to mitigate the effects of Byzantine *** analyze the performance of these schemes through simulations to compare their efficacy in producing the most desirable social welfare rankings. © Springer-Verlag 2013.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Maximal antichain lattice algorithms for distributed computations

Maximal antichain lattice algorithms for distributed computa...

引用

14th International Conference on distributed Computing and Networking, ICDCN 2013

作者： Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas at Austin Austin TX 78712 United States

ISBN: (纸本)9783642356674

The lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct and enumerate the lattice of maximal antichains. Previously known algorithm by Nourine and Raynoud [NR99, NR02] to construct the lattice takes O (n2m) time where n is the number of events in the computation, and m is the size of the lattice of maximal antichains. The algorithm by Jourdan, Rampon and Jard [JRJ94] takes O ((n + w2)wm) time where w is the width of the computation. All these algorithms assume as input the lattice of maximal antichains prior to the arrival of a new event. We present a new online incremental algorithm, OLMA, that computes the newly added elements to the lattice without requiring the prior lattice. Since the lattice may be exponential in the size of the computation, we get a significant reduction in the space complexity. The OLMA algorithm takes O (mw2 log w L) time and O (wL w log n) space where wL is the width of the lattice of maximal antichains. The lower space complexity makes our algorithm applicable for online global predicate detection in a distributed system. For the purposes of analyzing offline traces, we also propose new enumeration algorithms to traverse the lattice. © Springer-Verlag 2013.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Resource-oriented consistency analysis of engineering processes

Resource-oriented consistency analysis of engineering proces...

引用

14th International Conference on Enterprise Information systems, ICEIS 2012

作者： Bauer, Bernhard Eisenbarth, Thomas Frenzel, Christoph Honke, Benjamin Programming Distributed Systems Lab. Institute of Computer Science University of Augsburg Augsburg Germany

ISBN: (纸本)9789898565105

A number of popular engineering processes and methodologies emerged over the past years which attracted interest in research and industry. For process enactment, enterprises have to match requirements of engineering processes with existing resources. Therefore, it has to be analyzed if employees have sufficient skills or if infrastructure has sufficient capabilities to match the requirements of a situational process. Both, maintaining a skill and resource database and matching requirements against this database are an enormously challenging and time-consuming task. Additionally, this matching has to be carried out regularly as employees join and leave the company and skills change over time. Based upon a formal, logical base, we present an approach that combines ontological and metamodeling technical spaces and enables an automatic analysis of engineering processes regarding the existence of necessary resources.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: All-to-all gradecast using coding with byzantine failures 12

Brief announcement: All-to-all gradecast using coding with b...

引用

2012 ACM Symposium on Principles of distributed Computing, PODC'12

作者： Bridgman III, John F. Garg, Vijay K. Parallel and Distributed Systems Lab. Electrical and Computer Engineering University of Texas at Austin Austin TX United States

No abstract availab.e.

ISBN: (纸本)9781450314503

No abstract availab.e.

关键词： fault tolerance broadcast distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

All-to-all gradecast using coding with byzantine failures

All-to-all gradecast using coding with byzantine failures

引用

14th International Symposium on Stabilization, Safety, and Security of distributed systems, SSS 2012

作者： Bridgman III, John F. Garg, Vijay K. Parallel and Distributed Systems Lab. Electrical and Computer Engineering University of Texas at Austin Austin TX United States

ISBN: (纸本)9783642335358

This paper presents a method that uses forward error correction codes to minimize the message bit complexity when acquiring consistent global information in the presence of faulty processes. We show a modification to the gradecast algorithm that implements our method. Gradecast, first proposed by Feldman and Micali, is a broadcast algorithm for distributed systems that can handle Byzantine failures. It can be used as a basic building block to solve many important problems in distributed computing in the presence of Byzantine failures, such as agreement, clock synchronization, and approximate agreement. Many of these problems require a step where all processes need to send information to all other processes. We refer to the version of gradecast where all processes broadcast to all other processes as all-to-all gradecast. In a distributed system with n processes, n instances of the original gradecast algorithm to perform all-to-all gradecast has a message bit complexity of O(mn3), where m is the length of the message. In this paper, we present an all-to-all gradecast algorithm that takes O(mtn2) message bits, where t is the maximum number of faulty processes. This is a significant reduction in message bit complexity in real systems where t n. Our all-to-all gradecast algorithm uses coding theory to mask Byzantine failures and has wide applicability in distributed systems. For example, by replacing the original gradecast in the byzantine agreement algorithm proposed by Ben-Or, Dolev and Hoch with O(mtn3) message bit complexity, we get a new byzantine agreement algorithm with O(mt2 n2) message bit complexity. Also, this algorithm can be used with their approximate agreement algorithm to get O(kn2 t) instead of O(kn3) message bit complexity. © 2012 Springer-Verlag.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Lattice completion algorithms for distributed computations

Lattice completion algorithms for distributed computations

引用

16th International Conference on Principles of distributed systems, OPODIS 2012

作者： Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas at Austin Austin TX 78712 United States

ISBN: (纸本)9783642354755

A distributed computation is usually modeled as a finite partially ordered set (poset) of events. Many operations on this poset require computing meets and joins of subsets of events. The lattice of normal cuts of a poset is the smallest lattice that embeds the poset such that all meets and joins are defined. In this paper, we propose new algorithms to construct or enumerate the lattice of normal cuts. Our algorithms are designed for distributed computing applications and have lower time or space complexity than those of existing algorithms. We also show applications of this lattice to the problems in distributed computing such as finding the extremal events and detecting global predicates. © 2012 Springer-Verlag.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7201 LNCS卷 V-VI页

作者： Schmitt, Jens B. University of Kaiserslautern Disco - Distributed Computer Systems Lab. Computer Science Department P.O. Box 3049 67663 Kaiserslautern Germany

来源：评论

学校读者我要写书评

暂无评论

E-government and policy simulation in intelligent virtual environments

E-government and policy simulation in intelligent virtual en...

引用

8th International Conference on Web Information systems and Technologies, WEBIST 2012

作者： Aisopos, Fotis Kardara, Magdalini Senger, Philipp Klinger, Roman Papaoikonomou, Athanasios Tserpes, Konstantinos Gardner, Michael Varvarigou, Theodora Distributed Knowledge and Media Systems Lab. National Technical University of Athens Athens Greece Department of Bioinformatics Fraunhofer SCAI 53754 Sankt Augustin Germany School of Computer Science and Electronic Engineering University of Essex Colchester United Kingdom

ISBN: (纸本)9789898565082

Recently, there has been an increase of interest in the social impact of virtual reality technologies, as virtual worlds experienced an increase of their popularity in various social groups (teenagers, businesses). The growing trend for people to spend more time in suchlike virtual spaces implies a demand for intelligent virtual environments, that could mimic the real world as a simulation and provide functionalities and tools for behaviour analysis and adaptation to user preferences. Within the context of e-government, this paper presents the ongoing project +Spaces, which is developing a range of virtual environment tools. The platform architecture is presented and technical challenges involved in creating intelligent virtual spaces for e-government as well as draft policies to be used in role-playing simulations are discussed.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

A comparison of Wireless Fidelity (Wi-Fi) fingerprinting techniques

A comparison of Wireless Fidelity (Wi-Fi) fingerprinting tec...

引用

2011 International Conference on ICT Convergence, ICTC 2011

作者： Del Mundo, Lersan B. Ansay, Rafael Lean D. Festin, Cedric Angelo M. Ocampo, Roel M. Networks and Distributed Systems Lab. Department of Computer Science University of the Philippines Diliman Quezon City 1101 Philippines Computer Networks Lab. Electrical and Electronics Engineering Institute University of the Philippines Diliman Quezon City 1101 Philippines

ISBN: (纸本)9781457712678

Among several techniques proposed for indoor positioning using IEEE 802.11 Wireless Fidelity (Wi-Fi) based networks, those that rely on fingerprinting have been demonstrated to outperform those based on lateration, angulation, and cell of origin in terms of accuracy. We compare and evaluate three Wi-Fi fingerprinting techniques that use the K-Nearest Neighbor (k-NN), Naive Bayes Classifier (NBC) and Support Vector Machine (SVM) algorithms. Our experiments show that SVM-based fingerprinting outperformed both k-NN and NBC-based fingerprinting, achieving accuracies of 2 meters or better within our testbed. © 2011 IEEE.

关键词： Indoor positioning systems

来源：评论

学校读者我要写书评

暂无评论

Majority consensus protocol for strong consistency and high availab.lity

Proceedings - 2011 6th Annual ChinaGrid Conference, ChinaGri...

引用

Proceedings - 2011 6th Annual ChinaGrid Conference, ChinaGrid 2011 2011年 241-245页

作者： Chen, Rishan Zhu, Jiaji Yao, Wenhui Zhou, Jian Peng, Bo Lab. of Computer Networks and Distributed Systems Peking University Beijing China Alibaba Inc. Beijing China

ISBN: (纸本)9780769544724

This paper presents a new approach to coordinating clusters of fail-over storage servers. The proposed protocol is designed for supporting large scale on-line storage services which positioned for strong consistency and high availab.lity. Without sacrificing much performance, the protocol requires only one round-trip message communication with redundant servers. A distributed file system with single centralized master extended with this protocol confirms its efficiency as tens of thousands of operations per second and high availab.lity of 99.9995%. © 2011 IEEE.

关键词： File organization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：