Abstract Set membership proofs are an invaluable part of privacy preserving systems. These allow a prover to demonstrate knowledge witness w corresponding secret element x public set, such that they jointly satisfy given NP relation, i.e. ?( w, ) = 1 and is member set { , . ???? }. This allows the identity remain hidden, eg. ring signatures confidential transactions in cryptocurrencies. In this...

The present research aimed to study the application of Fuzzy logic in social science research. In this regard, based on two variables, Social Capital and Quality of Life, the degree of Tehran’s membership in the set of social development was studied using FSQCA software.This research was an applied and descriptive research methodologically; and extensive in quantitative...

Sridhar Gollamudi Shirish Nagaraj Yih-Fang Huang Laboratory for Image and Signal Analysis Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 E-mail: [email protected] Abstract | This paper presents the concept of SetMembership Filtering (SMF), an extension of SetMembership Identi cation (SMI) theory to the general ltering problem. A toolbox of adaptive solutions cal...

In this work a constrained adaptive filtering strategy based on conjugate gradient (CG) and set-membership (SM) techniques is presented for adaptive beamforming. A constraint on the magnitude of the array output is imposed to derive an adaptive algorithm that performs data-selective updates when calculating the beamformer’s parameters. We consider a linearly constrained minimum variance (LCMV) ...

In this paper, diagnosis for hybrid systems using a parity space approach that considers model uncertainty is proposed. The hybrid diagnoser is composed of modules which carry out the mode recognition and diagnosis tasks interacting each other, since the diagnosis module adapts accordingly to the current hybrid system mode. Moreover, the methodology takes into account the unknown but bounded un...

A wide variety of powerful cryptographic tools have been built using RSA, Diffie-Hellman, and other similar assumptions as their basis. Computational security has been achieved relative to complexity assumptions about the computational difficulty of a variety of number theoretic problems. However, these problems are closely related, and it is likely that if any one of them turns out to be effic...

In this article, a resilient set-membership approach is put forward to deal with the state estimation problem for sort of discrete-time memristive neural networks (DMNNs) hybrid time delays under weighted try-once-discard protocol (WTODP). The WTODP utilized mitigate unnecessary network congestion occurring in channel between DMNNs and estimator. order ensure resilience against possible realiza...

This paper concerns multicast applications that are interested in the evolution of their membership over time. It covers optimal on-line estimation algorithms for determining the membership of a multicast group. The paper briefly reviews the related work and our own contributions to the field. Using a probabilistic acknowledgement scheme – its period and probability can be set to achieve high q...