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

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

来源：评论

学校读者我要写书评

暂无评论

25th Annual Computational Neuroscience Meeting CNS-2016, Seogwipo City, South Korea, July 2-7, 2016 Abstracts

引用

BMC NEUROSCIENCE 2016年第1期17卷 1-112页

作者： [Anonymous] Computational Neurobiology Laboratory The Salk Institute for Biological Studies San Diego USA UNIC CNRS Gif sur Yvette France The European Institute for Theoretical Neuroscience (EITN) Paris France ATR Computational Neuroscience Laboratories Kyoto Japan Krembil Research Institute University Health Network Toronto Canada Department of Physiology University of Toronto Toronto Canada Department of Medicine (Neurology) University of Toronto Toronto Canada Department of Physics University of New Hampshire Durham USA Department of Neurophysiology Nencki Institute of Experimental Biology Warsaw Poland Department of Theory Wigner Research Centre for Physics of the Hungarian Academy of Sciences Budapest Hungary Department of Mathematical Sciences KAIST Daejoen Republic of Korea Department of Mathematics University of Houston Houston USA Department of Biochemistry & Cell Biology and Institute of Biosciences and Bioengineering Rice University Houston USA Department of Biology and Biochemistry University of Houston Houston USA Grupo de Neurocomputación Biológica Dpto. de Ingeniería Informática Escuela Politécnica Superior Universidad Autónoma de Madrid Madrid Spain Department of Biological Sciences University of Southern California Los Angeles USA Center for Neuroscience Korea Institute of Science and Technology Seoul South Korea Department of Neurology Albert Einstein College of Medicine Bronx USA Center for Neuroscience KIST Seoul South Korea Department of Neuroscience University of Science and Technology Daejon South Korea Systems Neuroscience Group QIMR Berghofer Medical Research Institute Herston Australia Department of Psychology Yonsei University Seoul South Korea Department of Psychiatry Kyung Hee University Hospital at Gangdong Seoul South Korea Department of Psychiatry Veterans Administration Boston Healthcare System and Harvard Medical School Brockton USA Department of Electrical and Electronic Engineering The University of Melbourne Parkvil

A1 Functional advantages of cell-type heterogeneity in neural circuits Tatyana O. Sharpee A2 Mesoscopic modeling of propagating waves in visual cortex Alain Destexhe A3 Dynamics and biomarkers of mental disorders Mitsuo Kawato F1 Precise recruitment of spiking output at theta frequencies requires dendritic h-channels in multi-compartment models of oriens-lacunosum/moleculare hippocampal interneurons Vladislav Sekulić, Frances K. Skinner F2 Kernel methods in reconstruction of current sources from extracellular potentials for single cells and the whole brains Daniel K. Wójcik, Chaitanya Chintaluri, Dorottya Cserpán, Zoltán Somogyvári F3 The synchronized periods depend on intracellular transcriptional repression mechanisms in circadian clocks. Jae Kyoung Kim, Zachary P. Kilpatrick, Matthew R. Bennett, Kresimir Josić O1 Assessing irregularity and coordination of spiking-bursting rhythms in central pattern generators Irene Elices, David Arroyo, Rafael Levi, Francisco B. Rodriguez, Pablo Varona O2 Regulation of top-down processing by cortically-projecting parvalbumin positive neurons in basal forebrain Eunjin Hwang, Bowon Kim, Hio-Been Han, Tae Kim, James T. McKenna, Ritchie E. Brown, Robert W. McCarley, Jee Hyun Choi O3 Modeling auditory stream segregation, build-up and bistability James Rankin, Pamela Osborn Popp, John Rinzel O4 Strong competition between tonotopic neural ensembles explains pitch-related dynamics of auditory cortex evoked fields Alejandro Tabas, André Rupp, Emili Balaguer-Ballester O5 A simple model of retinal response to multi-electrode stimulation Matias I. Maturana, David B. Grayden, Shaun L. Cloherty, Tatiana Kameneva, Michael R. Ibbotson, Hamish Meffin O6 Noise correlations in V4 area correlate with behavioral performance in visual discrimination task Veronika Koren, Timm Lochmann, Valentin Dragoi, Klaus Obermayer O7 Input-location dependent gain modulation in cerebellar nucleus neurons Maria Psarrou, Maria Schilstra, Neil Davey, Benjamin Torben-Ni

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Augmented reality and tangible user interfaces integration for enhancing the user experience

Augmented reality and tangible user interfaces integration f...

引用

11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry, VRCAI 2012

作者： Rodrigues, Fábio Sato, Fernando Botega, Leonardo Oliveira, Allan Computing and Information Systems Research Lab. Centro Universitário Eurípides de Marília Brazil Wireless Networks and Distributed Interactive Simulations Laboratory Universidade Federal de São Carlos Brazil

ISBN: (纸本)9781450318259

The integration of post-wimp computer interfaces arises as an alternative to meet individual limitations of each one, considering both interaction components and feedbacks to users. Tangible interfaces can present restrictions referring to physical space on tabletop architectures, which limits the manipulation of objects and deprecates the interactive process. Hence, this paper proposes the integration of techniques of mobile Augmented Reality with tabletop tangible architecture for blending real and virtual components on its surface, aiming to make the interactive process richer, seamless and more complete. © 2012 ACM.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

A communication efficient group key distribution scheme for MANETs

A communication efficient group key distribution scheme for ...

引用

6th International Conference on Network and System Security, NSS 2012

作者： Yang, Yang College of Mathematics and Computer Science Fuzhou University Fuzhou 350002 China Key Lab. of Information Security of Networks Systems Fuzhou University Fujian Province 350002 China

ISBN: (纸本)9783642346002

To secure the group communication in wireless ad hoc networks, a group key shared between participants is required. The special nature and the constraints posed by wireless ad hoc networks make the establishment of a group key a challenging task. The execution of a group key distribution scheme must be very carefully designed having in mind both the computation and communication efficiency. In this paper, we propose a communication efficient group key distribution scheme which adopts the Identity Based Broadcast Encryption (IBBE) methodology. No message exchange is required for the suggested scheme to establish a group key when the group members' identities are known to the broadcaster. A highlight of the scheme is that communication overhead remains unchanged as group size grows. In order for the group member to obtain his/her session key, only one bilinear pairing computation is required. Moreover, we show that the new scheme is proved secure in standard model under the truncated q-ABDHE assumption. Thus, the scheme can not only meet security demands but also efficient in terms of computational and communication. Our scheme is tested on a modern station and the experimental results demonstrate its suitability for large scale MANETs. © 2012 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

A practical local hacking scheme on device-independent bell test based quantum randomness expansion

A practical local hacking scheme on device-independent bell ...

引用

Frontiers in Optics, FIO 2012

作者： Li, Junhui Yu, Quanfu Liu, Yu Guo, Hong CREAM Group State Key Lab. of Advanced Optical Communication Systems and Networks Inst. of Quantum Electronics School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

Violation of Bell inequality cannot guarantee non-locality, thus an applicable hacking scheme on device-independent Bell test based quantum randomness expansion is given, together with a more secure upper bound on gen... 详细信息

ISBN: (纸本)9781557529565

关键词： Personal computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：