Results 11 to 20 of about 1,387,076 (273)
Determination of set-membership identifiability sets [PDF]
International audienceThis paper concerns the concept of set-membership identifiability introduced in \cite{jauberthie}. Given a model, a set-membership identifiable set is a connected set in the parameter domain of the model such that its corresponding ...
C. Jauberthie +16 more
core +7 more sources
Confidence set for group membership [PDF]
We develop new procedures to quantify the statistical uncertainty of data-driven clustering algorithms. In our panel setting, each unit belongs to one of a finite number of latent groups with group-specific regression curves.
Dzemski, Andreas, Okui, Ryo
core +4 more sources
Distributed interpolatory algorithms for set membership estimation [PDF]
This work addresses the distributed estimation problem in a set membership framework. The agents of a network collect measurements which are affected by bounded errors, thus implying that the unknown parameters to be estimated belong to a suitable ...
Farina, Francesco +2 more
core +7 more sources
Set-Pi: Set Membership p-Calculus [PDF]
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.
Alessandro Bruni +3 more
openaire +1 more source
Graded Set-Membership Models [PDF]
The values of the parameters or state variables of a set-membership model are classified only as feasible (consistent with the observations and with specified bounds on output error and unknown forcing) or not. Such classification is compatible with worst-case design or prediction, but uninformative about the average quality of fit to the observations.
P.F. Weston, J.P. Norton
openaire +1 more source
Parameterized Complexity of Minimum Membership Dominating Set
Given a graph $G=(V,E)$ and an integer $k$, the Minimum Membership Dominating Set (MMDS) problem seeks to find a dominating set $S \subseteq V$ of $G$ such that for each $v \in V$, $|N[v] \cap S|$ is at most $k$. We investigate the parameterized complexity of the problem and obtain the following results about MMDS: W[1]-hardness of the problem ...
Agrawal, Akanksha +4 more
openaire +3 more sources
SET MEMBERSHIP ESTIMATION WITH A SEPARATE RESTRICTION ON INITIAL STATE AND DISTURBANCES
We consider a set membership estimation problem for linear non-stationary systems for which initial states belong to a compact set and uncertain disturbances in an observation equation are integrally restricted. We prove that the exact information set of
Polina A. Yurovskikh
doaj +1 more source
Ordered subalgebras of ordered BCI-algebras based on the MBJ-neutrosophic structure [PDF]
The neutrosophic set consists of three fuzzy sets called true membership function, false membership function and indeterminate membership function.
Eunsuk Yang, Eun Hwan Roh, Young Bae Jun
doaj +1 more source
A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding [PDF]
Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by ...
Benavoli, Alessio, Piga, Dario
core +2 more sources
This paper presents a new formulation for set-membership parameter estimation of fractional systems. In such a context, the error between the measured data and the output model is supposed to be unknown but bounded with a priori known bounds. The bounded
Amairi Messaoud
doaj +1 more source

