1 April 2019 in Computer Methods and Programs in Biomedicine
ZZZhanybai T. Zhusubaliyev
1 June 2020 in Computer Methods and Programs in Biomedicine
23 June 2022 in IEEE Transactions on Biomedical Engineering
The mathematical modeling of the human smooth pursuit system from eye-tracking data is considered. Recently developed algorithms for the estimation of Volterra-Laguerre (VL) models with explicit time delay are applied in continuous and discrete time formulations to experimental data collected from Parkinsonian patients in different medication states and healthy controls. The discrete VL model with an explicit time delay and the method for its estimation are first introduced in this paper. The estimated parameters of a second-order VL model are shown to capture the ocular dynamics both in health and disease. The possibility of including the estimated time delay, along with the VL kernel parameters, into the set of the model parameters is explored. The results obtained in continuous VL modeling are compared with those in discrete time to discern the effects due to the sampling enforced by the eye tracker used for data acquisition.
17 September 2024 in IEEE Transactions on Control of Network Systems
This paper considers the problem of security allocation in a networked control system under stealthy attacks. The system is comprised of interconnected subsystems represented by vertices. A malicious adversary selects a single vertex on which to conduct a stealthy data injection attack with the purpose of maximally disrupting a distant target vertex while remaining undetected. Defense resources against the adversary are allocated by a defender on several selected vertices. First, the objectives of the adversary and the defender with uncertain targets are formulated in a probabilistic manner, resulting in an expected worst-case impact of stealthy attacks. Next, we provide a graph-theoretic necessary and sufficient condition under which the cost for the defender and the expected worst-case impact of stealthy attacks are bounded. This condition enables the defender to restrict the admissible actions to dominating sets of the graph representing the network. Then, the security allocation problem is solved through a Stackelberg game-theoretic framework. Finally, the obtained results are validated through a numerical example of a 50-vertex networked control system.
1 April 2019 in Mathematical Biosciences