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

probabilistic CLOCK SYNCHRONIZATION IN DISTRIBUTED SYSTEMS

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第5期5卷 474-487页

作者： ARVIND, K Digital Equipment Corporation Littleton MA USA

This paper presents and analyzes a new probabilistic clock synchronization algorithm that can guarantee a much smaller bound on the clock skew than most existing algorithms. The algorithm is probabilistic in the sense that the bound on the clock skew that it guarantees has a probability of invalidity associated with it. However, the probability of invalidity may be made extremely small by transmitting a sufficient number of synchronization messages. It is shown that an upper bound on the probability of invalidity decreases exponentially with the number of synchronization messages transmitted. A closed-form expression that relates the probability of invalidity to the clock skew and the number of synchronization messages is also derived.

关键词： CLOCK SYNCHRONIZATION DETERMINISTIC algorithm DISTRIBUTED SYSTEMS MASTER-SLAVE SCHEME probabilistic algorithm PROBABILITY OF INVALIDITY TIME TRANSMISSION PROTOCOL

来源：评论

学校读者我要写书评

暂无评论

Distributed computation of shared backup path in mesh optical networks using probabilistic methods

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2004年第5期12卷 920-930页

作者： Bouillet, E Labourdette, JF Tellium Inc Oceanport NJ 07757 USA

We assess the benefits of using statistical techniques to ascertain the shareability of protection channels when computing shared-mesh restored lightpaths in optical mesh networks. These optical networks support wavelength conversion everywhere as a byproduct of the electronic nature of the switching in the optical-electronic-optical optical cross connect used. Current deterministic approaches require a detailed level of information proportional to the number of active lightpaths. Although this is not an issue for good sized networks in the foreseeable future, these approaches are not practicable for distributed route computation involving larger networks. On the other hand, distributed approaches that do not make use of shareability information require a significant amount of additional capacity compared to a centralized approach with access to complete shareability information. With the proposed approach we show that even with less information, independent of the amount of traffic demand, it is possible to predict the shareability of protection channels with remarkable accuracy. In addition, we propose a local distributed channel assignment scheme that is used in conjunction with our distributed route computation proposal to assign shared channels when provisioning the backup path. This channel assignment scheme can also be used to further optimize capacity usage in individual links upon certain events or at regular intervals. Experiments are provided that demonstrate that our approach yields faster computation times with no significant penalty in terms of capacity usage than a centralized approach using complete information.

关键词： mesh protection optical networks optical switching performance analysis probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

A probabilistic dynamic technique for the distributed generation of very large state spaces

引用

PERFORMANCE EVALUATION 2000年第1-4期39卷 127-148页

作者： Knottenbelt, WJ Harrison, PG Mestern, MA Kritzinger, PS Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England Univ Cape Town Dept Comp Sci ZA-7701 Rondebosch South Africa

Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have developed a new dynamic probabilistic state exploration algorithm which addresses this problem for general, structurally unrestricted state spaces. Our method has a low state omission probability and low memory usage that is independent of the length of the state vector. In addition, the algorithm can be easily parallelised. This combination of probability and parallelism enables us to rapidly explore state spaces that are an order of magnitude larger than those obtainable using conventional exhaustive techniques. We derive a performance model of this new algorithm in order to quantify its benefits in terms of distributed run-time, speedup and efficiency. We implement our technique on a distributed-memory parallel computer acid demonstrate results which compare favourably with the performance model. Finally, we discuss suitable choices for the three hash functions upon which our algorithm is based. (C)2000 Elsevier Science B.V. All rights reserved.

关键词： state space exploration state space generation parallel algorithm probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

NANOSCALE RESONANCE ENERGY TRANSFER-BASED DEVICES FOR probabilistic COMPUTING

引用

IEEE MICRO 2015年第5期35卷 72-84页

作者： Wang, Siyang Lebeck, Alvin R. Dwyer, Chris Duke Univ Dept Elect & Comp Engn Durham NC 27706 USA Duke Univ Dept Comp Sci Durham NC 27706 USA

Despite the theoretical advances in probabilistic computing, A fundamental mismatch persists between the deterministic hardware that traditional computers use and the stochastic nature of probabilistic algorithms. The authors propose resonance energy transfer (RET) between chromophores as an enabling technology for probabilistic computing functional units. RET networks can implement efficient samplers with arbitrary probability distributions and have great potential for accelerating probabilistic algorithms.

关键词： Absorption Approximation methods chromophore continuous-time Markov chain DNA nanotechnology Energy exchange Markov random fields micro probabilistic algorithm probabilistic logic Probability distribution resonance energy transfer self-assembly

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time probabilistic observability analysis of sampled-data piecewise affine systems

引用

SYSTEMS & CONTROL LETTERS 2007年第11-12期56卷 685-694页

作者： Azuma, Shun-ichi Imura, Jun-Ichi Kyoto Univ Grad Sch Informat Kyoto 6110011 Japan Tokyo Inst Technol Grad Sch Informat Sci & Engn Tokyo 152 Japan

This paper proposes a polynomial-time probabilistic approach to solve the observability problem of sampled-data piecewise affine systems. First, an algebraic characterization for the system to be observable is derived. Next, based on the characterization, we propose a randomized algorithm that can determine if the system is observable in a probabilistic sense or the system is not observable in a detemimistic sense. Finally, it is shown with some examples, for which it is hopeless to check the observability in a deterministic way, that the proposed algorithm is very useful. (c) 2007 Elsevier B.V. All rights reserved.

关键词： hybrid systems piecewise affine systems sampled-data observability probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

THE COMPLEXITY OF probabilistic VERIFICATION

引用

JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY 1995年第4期42卷 857-907页

作者： COURCOUBETIS, C YANNAKAKIS, M ICS IRAKLIONGREECE AT&T BELL LABS MURRAY HILLNJ 07974

We determine the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic. For sequential programs, we present an algorithm that runs in time linear in the program and exponential in the specification, and also show that the problem is in PSPACE, matching the known lower bound. For concurrent programs, we show that the problem can be solved in time polynomial in the program and doubly exponential in the specification, and prove that it is complete for double exponential time. We also address these questions for specifications described by omega-automata or formulas in extended temporal logic.

关键词： AUTOMATA EXPTIME-COMPLETE MARKOV CHAIN MODEL CHECKING probabilistic algorithm PSPACE-COMPLETE TEMPORAL LOGIC

来源：评论

学校读者我要写书评

暂无评论

probabilistic SELF-STABILIZATION

引用

INFORMATION PROCESSING LETTERS 1990年第2期35卷 63-67页

作者： HERMAN, T Dep. Comp. Sci. Univ. Texas Austin TX 78712-1188 USA

Because no deterministic solution is possible for problems in a ring of identical processes, probabilistic methods using randomization are typically proposed as solutions. A probabilistic, self-stabilizing algorithm is presented for a ring of identical processes. In this algorithm, several conditions exist: 1. The number of processes in the ring is odd. 2. The processes operate synchronously. 3. Communication is unidirectional in the ring. The normal function of the algorithm is to circulate a single token in the ring. If the initial state of the ring is abnormal - that is, the number of tokens differs from one - the execution of the algorithm results probabilistically in convergence to a normal state with one token. This algorithm differs from previous solutions in that a ring of processes operates synchronously rather than asynchronously.

关键词： Distributed computing probabilistic algorithm self-stabilization uniform rings

来源：评论

学校读者我要写书评

暂无评论

PET: probabilistic Estimating Tree for Large-Scale RFID Estimation

PET: Probabilistic Estimating Tree for Large-Scale RFID Esti...

引用

31st International Conference on Distributed Computing Systems (ICDCS)

作者： Zheng, Yuanqing Li, Mo Qian, Chen Nanyang Technol Univ Sch Comp Engn Singapore Singapore Univ Texas Austin Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)9780769543642

Estimating the number of RFID tags in the region of interest is an important task in many RFID applications. In this paper we propose a novel approach for efficiently estimating the approximate number of RFID tags. Compared with existing approaches, the proposed probabilistic Estimating Tree (PET) protocol achieves O(loglogn) estimation efficiency, which remarkably reduces the estimation time while meeting the accuracy requirement. PET also largely reduces the computation and memory overhead at RFID tags. As a result, we are able to apply PET with passive RFID tags and provide scalable and inexpensive solutions for large-scale RFID systems. We validate the efficacy and effectiveness of PET through theoretical analysis as well as extensive simulations. Our results suggest that PET outperforms existing approaches in terms of estimation accuracy, efficiency, and overhead.

关键词： probabilistic estimating tree probabilistic algorithm RFID counting system

来源：评论

学校读者我要写书评

暂无评论

probabilistic Cryptosystem with Two Pairs of Private/Public Keys

Probabilistic Cryptosystem with Two Pairs of Private/Public ...

引用

International Conference on Electrical and Computing Technologies and Applications (ICECTA)

作者： Alfaifi, Reem Comp Sci Dept Riyadh Saudi Arabia

ISBN: (纸本)9781538608722

This paper proposes a new cryptosystem that uses two pairs of -private/public-keys. The two distinct pairs have different roles: one is for signing/verifying the message and another for encrypting/decrypting it. The proposed cryptosystem uses Euler's theorem and Fermat little theorem to generate public/private keys and encrypt/decrypt message schemes. There are two different schemes in this system: encrypt/decrypt and signature schemes. In the encrypt/decrypt scheme, a sender's public key is announced publicly;then, it is used whenever an encrypted message is to be sent to a receiver (message(publicKey)). Only the one who has the private key can decrypt the encrypted message (message(privateKey)). In the signature scheme, the sender can sign the message by its private key, and anyone can verify this message by using its public key. Thus, the proposed algorithm mitigates the effect of situation where one of the private keys is disclosed. The attacker should get the two private keys rather than one to completely attack the system.

关键词： Public key cryptosystem Cryptography Two private keys probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

probabilistic Encryption - A Practical Implementation

Probabilistic Encryption - A Practical Implementation

引用

4th International Conference on Computer Sciences and Convergence Information Technology

作者： Creado, Orhio Mark Wang, Yiling Wu, Xianping Le, Phu Dung Monash Univ Caulfield Sch Informat Technol Melbourne Vic 3004 Australia

ISBN: (纸本)9781424452446

This paper aims to provide a practical implementation of a probabilistic cipher by extending on the algorithms by Fuchsbauer, Goldwasser and Micali. We provide details on designing and implementing the cipher and further support our understanding by providing a statistical analysis of our implementation for the key generation, encryption, and decryption times taken by the cipher for key sizes of 1024, 2048, and 4096 bits for varying message spaces of 750, 1500, 3000, and 5000 bits. The concept of 'inter-bit operating time' is introduced for the cipher which calculates time elapsed between two instances of an operation. We show the working of a probabilistic cipher purely from a practical standpoint to justify if its original algorithm is practically implementable.

关键词： probabilistic Encryption probabilistic Cipher probabilistic algorithm Public-Key Cryptosystem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：