Communication protocols often rely on stateful mechanisms to ensure certain security properties. For example, counters and timestamps can be used to ensure authentication, or the security of communication can depend on whether a particular key is registered to a server or it has been revoked. ProVerif, like other state of the art tools for protocol analysis, achieves good performance by convert...

The quasi-OBE (QOBE) algorithm is a set-membership adaptive filtering algorithm based on the principles of optimal bounding ellipsoid (OBE) processing. This algorithm can provide enhanced convergence and tracking performance as well as reduced average computational complexity in comparison with the more traditional adaptive filtering algorithms such as the recursive leastsquares (RLS) algorithm...

The contact behaviour between the grinding wheel and workpiece in abrasive machining processes has been investigated. This has revealed the ambiguity in deciding the size of the contact region from a measured contact signal. For improved representation of the contact conditions, fuzzy set theory was used. A membership function for the fuzzy representation of the extent of wheelworkpiece contact...

Fuzzy AHP is a hybrid method that combines Fuzzy Set Theory and AHP. It has been developed to take into account uncertainty and imprecision in the evaluations. Fuzzy Set Theory requires the definition of a membership function. At present, there are no indications of how these membership functions can be constructed. In this paper, a way to calibrate the membership functions with comparisons giv...

This paper introduces a constrained version of the recently proposed set-membership affine projection algorithm based on the set-membershp criteria for coefficient update. The algorithm is suitable for linearly-constrained minimum-varianc filtering applications. The data selective property of the proposed algorithm greatly reduces the computational burden as compared with a nonselective approac...

Given a graph $$G=(V,E)$$ and an integer k, the Minimum Membership Dominating Set (MMDS) problem seeks to find dominating set $$S \subseteq V$$ of G such that for each $$v \in , $$\vert N[v] \cap S\vert $$ is at most k. We investigate parameterized complexity obtain following results MMDS problem. First, we show NP-hard even on planar bipartite graphs. Next, W[1]-hard parameter pathwidth (and t...

In this paper we continue to investigate the important parameter of global warming a heat wave that has no unique definition and represents the constellation of different factors such as e.g., heat index (temperature + humidity), time periods of excessive heat, etc. We find typical characteristics of heat indexes during different time periods, using most typical fuzzy expected values. Trapezoid...

In this paper, the texture feature ”coarseness” is modelled by means of a fuzzy partition on the domain of coarseness measures. The number of linguistic labels to be used, and the parameters of the membership functions associated to each fuzzy set are calculated relating representative coarseness measures (our reference set) with the human perception of this texture property. A wide variety of ...