Gautham Nayak Seetanadi, Karl-Erik Årzén, M. Maggio
{"title":"Control-based event-driven bandwidth allocation scheme for video-surveillance systems","authors":"Gautham Nayak Seetanadi, Karl-Erik Årzén, M. Maggio","doi":"10.1080/23335777.2021.1887364","DOIUrl":"https://doi.org/10.1080/23335777.2021.1887364","url":null,"abstract":"ABSTRACT Modern computer systems consist of large number of entities connected through a shared resource. One such system is a video surveillance network consisting of a set of cameras and a network manager. The surveillance cameras capture a stream of images, encode them with a quality factor and transmit them to the manager over a shared constrained network. The central manager allocates bandwidth to the cameras in a fair manner using a threshold based game-theoretic approach. The presence of these multiple control loops that interact with each other leads to complexity in providing performance and safety guarantees. Our previous work explored performance of the event-based manager using model checking to verify relevant properties of linear models. In this paper we build on our previous work by verifying complex camera models that capture uncertainties during image capture. We model the uncertainties using probabilistic Markov Decision Processes (MDPs) and verify relevant properties of the system. We also evaluate system performance for different system parameters with varying triggering thresholds, showing the advantage of model checking for safe and informed parameter selection. Finally, we evaluate the effect of varying thresholds on manager interventions by capturing images on a commercial off-the-shelf (COTS) camera test-bed.","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"1 1","pages":"111 - 137"},"PeriodicalIF":0.0,"publicationDate":"2021-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88368510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Asim Kumar Mahadani, Shashank Awasthi, G. Sanyal, P. Bhattacharjee, S. Pippal
{"title":"Indel-K2P: a modified Kimura 2 Parameters (K2P) model to incorporate insertion and deletion (Indel) information in phylogenetic analysis","authors":"Asim Kumar Mahadani, Shashank Awasthi, G. Sanyal, P. Bhattacharjee, S. Pippal","doi":"10.1080/23335777.2021.1879274","DOIUrl":"https://doi.org/10.1080/23335777.2021.1879274","url":null,"abstract":"ABSTRACT Evolutionary models are widely used to estimate the evolutionary relationship between the various biological taxa . Majority of the existing evolutionary models ignore insertion and deletion (indel) event, which reduces the computational difficulties, but at the same time, it causes loss of valuable phylogenetic information. In this study, we have developed a modified Kimura 2 parameters (K2P) model to utilise the indel information in phylogenetic tree construction especially in case of low substitution rate sequences Indel rich highly similar DNA sequences (trnL-trnF intergenic spacer region) of Phalaenopsis were collected from Genbank and to test the efficiency of the model in phylogenetic. Our developed Indel-K2P model and K2P model were implemented in MATLAB and calculated the bootstrap value and Robinson-Foulds (RF) distance to test the confidence and accuracy of phylogenetic tree topology. The phylogenetic trees constructed within the framework of Indel-K2P model, exhibited 92.66% accuracy and 40.9% root node confidence while the K2P model without indel shows less accuracy and less root node confidence. Our results indicate that modified Kimura 2 parameters with indel (Indel-K2P) model performed better than Kimura 2 Parameters (K2P) in phylogenetic tree construction for indel rich DNA sequences.","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"49 1","pages":"32 - 44"},"PeriodicalIF":0.0,"publicationDate":"2021-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77955664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A constraint partially observable semi-Markov decision process for the attack–defence relationships in various critical infrastructures","authors":"Nadia Niknami, Jie Wu","doi":"10.1080/23335777.2021.1879935","DOIUrl":"https://doi.org/10.1080/23335777.2021.1879935","url":null,"abstract":"ABSTRACT Gaining a better understanding of the relationship between attackers and defenders in cybersecurity domains to protect computer systems is of great importance. From the defender’s side, it is critical to choose the best reaction to maintain the system in a safe state, based on a given estimate of the attacker. One of the main challenges is that the defender may not be able to correctly detect a current attack due to incomplete and noisy information . Another important factor in the attack-defence interaction is the limited budget of both attackers and defenders. . This paper focuses on an approach based on interactions between the attacker and defender by considering the problem of uncertainty and limitation of resources for the defender, given that the attacker’s actions are given in all states of a Markov chain. The best actions by the defender can be characterised by a Markov Decision Process in the case of partial observability and importance of time in the expected reward, which is a Partially Observable Semi-Markov Decision model. Our simulation on a trace-based data set demonstrates that the proposed approach handles analysing interactions of the attacker and defender with limited budgets foralong with imperfect information for the defender.","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"42 1","pages":"85 - 110"},"PeriodicalIF":0.0,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86424861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal controller design for DC microgrid based on state-dependent Riccati Equation (SDRE) approach","authors":"Erfan Shahradfar, A. Fakharian","doi":"10.1080/23335777.2020.1811381","DOIUrl":"https://doi.org/10.1080/23335777.2020.1811381","url":null,"abstract":"ABSTRACT In the present paper, an optimal control method based on State-Dependent Riccati Equation (SDRE) is used to design a controller for DC microgrid system. In the proposed method, optimal control law is proposed for stabilisation and tracking of online reference paths using pseudo-linearisation and by preserving all the nonlinear characteristics of the system. The proposed method not only traces reference paths, but also is able to minimise control effort and energy consumption. Simulation results indicate efficient performance of the proposed method with regard to tracking reference paths despite the changes in operating point, external load disturbance and parametric uncertainty in comparison with linear quadratic regulators.","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"1 9-10 1","pages":"41 - 72"},"PeriodicalIF":0.0,"publicationDate":"2021-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78515285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Korobkin, S. Fomenkov, A. Zlobin, Dmitriy V. Shabanov, A. Golovanchikov
{"title":"The Software for Formation of Technical Function Assessments Based on the Patent Analysis","authors":"D. Korobkin, S. Fomenkov, A. Zlobin, Dmitriy V. Shabanov, A. Golovanchikov","doi":"10.1007/978-3-030-67892-0_12","DOIUrl":"https://doi.org/10.1007/978-3-030-67892-0_12","url":null,"abstract":"","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"111 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76682702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Johari, Arvinder Kaur, Mohammad S. Hashim, P. K. Rai, Kanika Gupta
{"title":"SEVA: Secure E-Voting Application in Cyber Physical System","authors":"R. Johari, Arvinder Kaur, Mohammad S. Hashim, P. K. Rai, Kanika Gupta","doi":"10.1080/23335777.2020.1837250","DOIUrl":"https://doi.org/10.1080/23335777.2020.1837250","url":null,"abstract":"ABSTRACT Election is the right of every citizen. The exercise of this right through the election is a very expensive mechanism. The people of the constituency, where the elections are to be held, are usually given a day off, so that they can vote. But still many people do not vote. To overcome this problem, an application: ”SEVA: Secure E-Voting Application” in Cyber Physical System is hereby proposed which gives the voters the ability to cast their votes over the web from any remote location of the world. The proposed application deployed on the cloud has been designed and developed using cutting edge technologies like Azure Service Fabric using Microservice architecture. The application is deployed on the Five-Node cluster using Server Fabric Local Cluster for demonstration.","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"8 1","pages":"1 - 31"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77926674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exponential stabilisation for nonlinear PDE systems via sampled-data static output feedback control","authors":"Dongxiao Hu, Xiaona Song, Mi Wang, Junwei Lu","doi":"10.1080/23335777.2020.1837249","DOIUrl":"https://doi.org/10.1080/23335777.2020.1837249","url":null,"abstract":"ABSTRACT This paper focuses on the problem of exponential stabilisation for nonlinear partial differential equation (PDE) systems by designing sampled-data static output feedback controller. First, the nonlinear PDE systems are reconstructed by Takagi-Sugeno (T-S) fuzzy model. Subsequently, the closed-loop systems are obtained by introducing sampled-data static output feedback fuzzy controller. Then, stability conditions of the closed-loop system are obtained based on Lyapunov function approach, which can guarantee that the considered systems are exponential stabilisation and satisfy dissipative performance. Finally, the effectiveness of the developed method is demonstrated by a simulation study.","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"436 1","pages":"179 - 196"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83650688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Matthew Abate, W. Stuckey, L. Lerner, Eric Féron, Samuel Coogan
{"title":"Memory-loss resilient controller design for temporal logic constraints","authors":"Matthew Abate, W. Stuckey, L. Lerner, Eric Féron, Samuel Coogan","doi":"10.1080/23335777.2020.1837248","DOIUrl":"https://doi.org/10.1080/23335777.2020.1837248","url":null,"abstract":"ABSTRACT This paper studies the problem of controlling finite nondeterministic transition systems to satisfy constraints given as linear temporal logic properties. A controller architecture is proposed that maps finite fragments of the state trajectory history to control inputs. This approach avoids the standard controller construction that employs an onboard automaton which is fragile to memory loss or errors. In contrast, the proposed architecture requires storing only a finite sequence of previous system states in memory and is therefore resilient to memory loss. In particular, the system will operate unaltered after such a memory-loss event once the system recollects this finite sequence of system states. A generalised algorithm is outlined for controller synthesis in this manner. Additionally, we demonstrate the construction and implementation of such a memory-loss resilient controller through an experimental demonstration on a differential-drive robot that experiences memory-loss events.","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"17 1","pages":"221 - 242"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80193786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Flexible, decentralised access control for smart buildings with smart contracts","authors":"Leepakshi Bindra, Kalvin Eng, Omid Ardakanian, Eleni Stroulia","doi":"10.1080/23335777.2021.1922502","DOIUrl":"https://doi.org/10.1080/23335777.2021.1922502","url":null,"abstract":"ABSTRACT Large commercial buildings are complex cyber-physical systems containing expensive and critical equipment that ensure the safety and comfort of their numerous occupants. Yet occupant and visitor access to spaces and equipment within these buildings are still managed through unsystematic, inefficient, and human-intensive processes. As a standard practice, long-term building occupants are given access privileges to rooms and equipment based on their organisational roles, while visitors have to be escorted by their hosts. This approach is conservative and inflexible. In this paper, we describe a methodology that can flexibly and securely manage building access privileges for long-term occupants and short-term visitors alike, taking into account the risk associated with accessing each space within the building. Our methodology relies on blockchain smart contracts to describe, grant, audit, and revoke fine-grained permissions for building occupants and visitors, in a decentralised fashion. The smart contracts are specified through a process that leverages the information compiled from Brick and BOT models of the building. We illustrate the proposed method through a typical application scenario in the context of a real office building and argue that it can greatly reduce the administration overhead, while, at the same time, providing fine-grained, auditable access control. CCS Concepts: Security and privacy; Security services; Computer systems organisation; Embedded and cyber-physical systems; Sensors and actuators","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"114 1","pages":"286 - 320"},"PeriodicalIF":0.0,"publicationDate":"2020-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79886403","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Unsupervised learning of depth and ego-motion with absolutely global scale recovery from visual and inertial data sequences","authors":"Ya-ru Meng, Qiyu Sun, Chongzhen Zhang, Yang Tang","doi":"10.1080/23335777.2020.1811386","DOIUrl":"https://doi.org/10.1080/23335777.2020.1811386","url":null,"abstract":"ABSTRACT In this paper, we propose an unsupervised learning method for jointly estimating monocular depth and ego-motion, which is capable to recover the absolute scale of global camera trajectory. In order to solve the general problems of scale drift and scale ambiguity of monocular camera, we fuse geometric movement data from inertial measurement unit (IMU), and use Bi-directional Long Short-Term Memory (BiLSTM) to extract temporal features. Besides, we add a lightweight and efficient attention mechanism, Convolutional Block Attention Module (CBAM), to Convolutional Neural Networks (CNNs) to complete the extraction of image features. Considering the scenes with severe illumination changes, ambiguous structures, moving objects and occlusions, especially scenes with progressively-variant textures, the geometric features can provide adaptive estimation results in the case of the degeneration of visual features. Experiments on the KITTI driving dataset reveal that our scheme achieves promising results in the estimation of camera pose and depth. Moreover, the absolute scale recovery for the global camera trajectory is effective.","PeriodicalId":37058,"journal":{"name":"Cyber-Physical Systems","volume":"14 1","pages":"133 - 158"},"PeriodicalIF":0.0,"publicationDate":"2020-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84326744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}