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

Proving Obliviousness of probabilistic algorithms with Formal Verification 26

Proving Obliviousness of Probabilistic Algorithms with Forma...

ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH Companion)

作者： Yan, Pengbo Univ Melbourne Melbourne Vic Australia

ISBN: (纸本)9781450399012

Obliviousness is a security feature to protect sensitive information from an algorithm's observable behaviours. For better run-time performance, many oblivious algorithms published recently are probabilistic instead of deterministic, but this also brings difficulties to reason about them. We introduce some challenges, works and further ideas in this paper, including the concrete contribution of extending PSL for verifying one of the random oblivious algorithms. We also present my further PhD research plan on this topic.

关键词： formal verification oblivious algorithm probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

Tracking multiple agents in an intelligent space with probabilistic algorithms and a camera ring

Tracking multiple agents in an intelligent space with probab...

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Marron, M. Pizarro, D. Marcos, A. Jalvo, R. Garcia, J. C. Mazo, M. Univ Alcala de Henares Dept Elect Madrid 28871 Spain

ISBN: (纸本)9781424463916

Detecting, tracking and identifying different non-rigid agents in smart spaces is solved with a probabilistic filter proposed in this paper. A camera ring statically mounted in the intelligent space is used as observation system. Besides, three subsystems create the global detection and tracking algorithm: a three-dimensional reconstruction of these entities;a global tracker of all these entities made of a multimodal filter;and a deterministic classifier based on a connectivity map that obtains the individual agents in the smart space. A the end of the paper, different results and reliability statistics are presented in order to demonstrate the global functionality in real executions of the proposal presented.

关键词： camera ring cameras connectivity map deterministic classifier global tracker image reconstruction intelligent space multi-agent systems multimodal filter multiple agent tracking nonrigid agent observation system pattern classification probabilistic algorithm probabilistic filter randomised algorithms three dimensional reconstruction tracking

来源：评论

学校读者我要写书评

暂无评论

A RELATION BETWEEN CORRECTNESS AND RANDOMNESS IN THE COMPUTATION OF probabilistic algorithmS

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1984年第1期16卷 47-53页

作者： CALUDE, C ZIMAND, M Department of Mathematics University of Bucharest Bucharest Str. Academiei 14 R-70109 Romania

Chaitin and Schwartz [4] have proved that Solovay and Strassen [12], Miller [9], and Rabin [10] probabilistic algorithms for testing primality are error-free in case the input sequence of coin tosses has maximal information content. In this paper we shall describe conditions under which a probabilistic algorithm gives the correct output. We shall work with algorithms having the ability to make “random” decisions not necessarily binary (Zimand [13]). We shall prove that if a probabilistic algorithm is sufficiently “correct”, then it is error-free on all sufficiently long inputs which are random in Kolmogorov and Martin-Löfs sense. Our result, as well as Chaitin and Schwartz’s one, is only of theoretical interest, since the set of all random strings is immune (Calude and Chitescu [2]). © 1984, Taylor & Francis Group, LLC. All rights reserved.

关键词： Kolmogorov complexity Martin-Löfs test probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal probabilistic solution for information confinement, privacy, and security in RFID systems

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2011年第3期34卷 853-863页

作者： Di Pietro, Roberto Molva, Refik Univ Roma Tre Dipartimento Matemat I-00149 Rome Italy Univ Rovira & Virgili UNESCO Chair Data Privacy Tarragona Spain Inst EURECOM F-06560 Sophia Antipolis France

In this paper, we provide the following contributions to enhance the security of RFID based systems. First, we assume that among multiple servers storing the information related to the tags some of them can be compromised. For this new threat scenario, we devise a technique to make RFID identification server dependent, providing a different unique secret key shared by a tag and a server. The solution proposed requires the tag to store just a single key, thus fitting the constraints on tag's memory. Second, we provide a probabilistic tag identification scheme that requires the server to perform just bitwise operations and simple list manipulation primitives, thus speeding up the identification process. The tag identification protocol assures privacy, security and resilience to DoS attacks thanks to its stateless nature. Moreover, we extend the tag identification protocol to achieve mutual authentication and resilience to replay attacks. The proposed identification protocol, unlike other probabilistic protocols, never rejects a legitimate tag. Furthermore, the identification protocol requires the reader to access the local database (DB) of tags' keys O(n) times-where n is the number of tags in the system-while it has been shown in the literature that a privacy preserving identification protocol requires a reader to access O(n) times this DB. In this sense, our protocol is optimal. Finally, the three features suggested in this paper, namely, reader-dependent key management, tag identification, and mutual authentication, can be independently adopted to build alternative solutions. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： RFID systems Information confinement Security Privacy probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

probabilistic Damage Identification Based on Correlation Analysis Using Guided Wave Signals in Aluminum Plates

引用

STRUCTURAL HEALTH MONITORING-AN INTERNATIONAL JOURNAL 2010年第2期9卷 133-144页

作者： Wang, Dong Ye, Lin Su, Zhongqing Lu, Ye Li, Fucai Meng, Guang Univ Sydney LSMS CAMT Sch Aerosp Mech & Mechatron Engn Sydney NSW 2006 Australia Hong Kong Polytech Univ Dept Mech Engn Hong Kong Hong Kong Peoples R China Shanghai Jiao Tong Univ State Key Lab Mech Syst & Vibrat Shanghai 200030 Peoples R China

An algorithm based on correlation analysis was adopted to estimate the probability of the presence of damage in aluminum plates using Lamb wave signals from an active sensor network. Both finite element analysis and experimental evaluations were presented. The Shannon entropy optimization criterion was applied to calibrate the optimal mother wavelet and the most appropriate continuous wavelet transform scale for signal processing. The correlation coefficients for individual sensing paths between the present state (with damage) and the reference state (without damage) were calculated, and the probability of the presence of damage in the monitoring area enclosed by the active sensor network was estimated to identify the damage. A concept of virtual sensing paths (VSPs) was proposed to enhance the performance of the algorithm by increasing the number of sensing paths in data fusion. The results identified using both simulation and experimental Lamb wave signals from different groups of sensing paths at different central frequencies agreed well with the actual situations, demonstrating the potential of the correlation-based algorithm with the application of VSPs for identification of damage in structures.

关键词： Lamb waves damage identification probabilistic algorithm correlation coefficient wavelet transform virtual sensing paths (VSPs)

来源：评论

学校读者我要写书评

暂无评论

probabilistic CHECKING OF ASSOCIATIVITY IN ALGEBRAS

引用

INFORMATION PROCESSING LETTERS 1991年第4期37卷 187-191页

作者： JACOBS, DP Dep. Comp. Sci. Clemson Univ. Clemson SC 29634-1906 USA

We can easily decide, using O(n-5) arithmetic operations, if multiplication is associative in an n-dimensional algebra. We present two Monte Carlo algorithms that use only O(n3) and O(n4) operations respectively. Interestingly, one method can be used in a more general setting to efficiently solve the seemingly hard problem of testing whether an arbitrary algebra over Q satisfies an arbitrary multilinear identity.

关键词： ANALYSIS OF algorithmS probabilistic algorithm NONASSOCIATIVE ALGEBRA

来源：评论

学校读者我要写书评

暂无评论

Fast Non-Local Means (NLM) Computation With probabilistic Early Termination

引用

IEEE SIGNAL PROCESSING LETTERS 2010年第3期17卷 277-280页

作者： Vignesh, Ramanathan Oh, Byung Tae Kuo, C. -C. Jay Indian Inst Technol Dept Elect Engn Kharagpur 721302 W Bengal India Univ So Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA Univ So Calif Signal & Image Proc Inst Los Angeles CA 90089 USA

A speed up technique for the non-local means (NLM) image denoising algorithm based on probabilistic early termination ( PET) is proposed. A significant amount of computation in the NLM scheme is dedicated to the distortion calculation between pixel neighborhoods. The proposed PET scheme adopts a probability model to achieve early termination. Specifically, the distortion computation can be terminated and the corresponding contributing pixel can be rejected earlier, if the expected distortion value is too high to be of significance in weighted averaging. Performance comparative with several fast NLM schemes is provided to demonstrate the effectiveness of the proposed algorithm.

关键词： Early termination fast algorithm image denoising non-local means (NLM) algorithm probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal probabilistic ring exploration by semi-synchronous oblivious robots

引用

THEORETICAL COMPUTER SCIENCE 2013年 498卷 10-27页

作者： Devismes, Stephane Petit, Franck Tixeuil, Sebastien Univ Grenoble 1 VERIMAG UMR 5104 Grenoble France Univ Paris 04 UPMC LIP6 UMR 7606 F-75230 Paris 05 France

We consider a team of k identical, oblivious, and semi-synchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path. Previous results in this weak scenario show that initial symmetry yields high lower bounds when problems are to be solved by deterministic robots. In this paper, we initiate research on probabilistic bounds and solutions in this context, and focus on the exploration problem of anonymous unoriented rings of any size n. It is known that k = Theta(logn) deterministic robots are necessary and sufficient to solve the problem, provided that k and n are coprime. By contrast, we show that four identical probabilistic robots are necessary and sufficient to solve the same problem, also removing the coprime constraint. Our positive results are constructive. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Mobile robots Obliviousness Ring exploration probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

probabilistic inference by means of cluster variation method and linear response theory

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2003年第7期E86D卷 1228-1242页

作者： Tanaka, K Tohoku Univ Grad Sch Informat Sci Dept Comp & Math Sci Sendai Miyagi 9808579 Japan

probabilistic inference by means of a massive probabilistic model usually has exponential-order computational complexity. For such massive probabilistic model, loopy belief propagation was proposed as a scheme to obtain the approximate inference. It is known that the generalized loopy belief propagation is constructed by using a cluster variation method. However, it is difficult to calculate the correlation in every pair of nodes which are not connected directly to each other by means of the generalized loopy belief propagation. In the present paper, we propose a general scheme for calculating an approximate correlation in every pair of nodes in a probabilistic model for probabilistic inference. The general scheme is formulated by combining a cluster variation method with a linear response theory.

关键词： Bayesian network probabilistic inference probabilistic algorithm mean-field theory belief propagation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：