Estimation problem for network model at state and measurements attacks and information cost criterion

Mikołaj Karpiński, Vasyl Martsenyuk, І. S. Gvozdetska, Бахытжан Сражатдинович Ахметов, Nazym Zhumangalieva

2016

Closed access Metadata (CSL-JSON)
DOI 10.1109/iccas.2016.7832298
Data confidence 85 high
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The purpose of this research is to offer constructive algorithm for estimator search in one network model under state and measurements attacks. The model is nonstationary descriptor system including difference equations for node state variables and algebraic equations for measurements. State variables and measurements are considered as random vectors. We use information cost criterion in order to find optimal estimator of inner product. The main algorithm is based on reducing estimation problem to a problem of optimal control. Mean-squared error independent on attacks is obtained