Industrial Control Systems (ICS) are increasingly deployed in critical infrastructures. Originally designed to increase the productivity of ICS as well as safety and reliability, nowadays these systems are becoming th...
详细信息
Industrial Control Systems (ICS) are increasingly deployed in critical infrastructures. Originally designed to increase the productivity of ICS as well as safety and reliability, nowadays these systems are becoming th...
详细信息
Industrial Control Systems (ICS) are increasingly deployed in critical infrastructures. Originally designed to increase the productivity of ICS as well as safety and reliability, nowadays these systems are becoming the target of hackers. Several attacks highlighted vulnerabilities, the most relevant one, Stuxnet, stroke in 2010. Protection of ICS against cyberattacks has to be considered. Security of these systems is different from IT security solutions because exchanged data have physical consequences. For that, a new approach for Intrusion Detection System (IDS) in ICS was presented based on filters monitoring orders and reports. Methodology to obtain these filters and their locations in the ICS architecture were introduced. In this paper, we present major improvements in detection mechanisms of these filters. Distance concept, introduced in previous paper (Sicard et al., 2017), is developed and combined to trajectory concept that allows filters to detect deviations from expected behavior. Distance from optimal or forbidden states is essential to compute order sequence bringing back the system into safe states. Trajectory, which is the evolution of distance during state evolution, improves detection mechanism by analyzing sequences sent to the system and received by Programmable Logic Controller (PLC). This combinational security prevents damages against goods and people. Implementation of time based intrusion detection is a step forward for improving filters. Temporal windows indicate when actions have to be done and if received reports correspond to executed orders. Thus, our filter approach secures ICS against combinational and temporal attacks affecting security of goods and people or quality. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
DNA computing is a new computational model which is different from the traditional computational model and it uses the DNA sequences as the materials of information storage and hybridization reaction as computational ...
详细信息
DNA computing is a new computational model which is different from the traditional computational model and it uses the DNA sequences as the materials of information storage and hybridization reaction as computational principle. The accuracy of hybridization reaction immediately affects the reliability and the accuracy of DNA computing. Because of the limit of biologic technology, the emergence of false hybridization reaction is impossible to avoid. To decrease the emergence of false hybridization, many researchers design DNA sequences which satisfy constraints. In this paper, we use improved dynamic genetic algorithm to design DNA sequences which satisfy Hamming distance and h-distance combinational constraints. According to the known theoretical value, our experimental results improve the lower bounds which satisfy both constraints and further shorten the range. More importantly, using our results can decrease the emergence of false hybridization reaction, and improve the reliability and the scale of DNA computing.
The design of DNA code words has been proved to be an important problem for bimolecular computing. It plays an important role in improving the reliability and the scale of DNA computing. Recent experimental and theore...
详细信息
The design of DNA code words has been proved to be an important problem for bimolecular computing. It plays an important role in improving the reliability and the scale of DNA computing. Recent experimental and theoretical advances have produced and tested new methods to obtain large DNA word sets to support virtually any kind of applications. In this paper, we use particle swarm optimization algorithm (PSO) to design DNA word sets with H-distance and Hamming distance combinatorial constraints. By comparing our experimental results with the previous works, our results improve the lower bounds which satisfy combinational constraints, and further shorten the value range of DNA coding bounds. In our computational experiments, we succeed in generating better DNA word sets and give some practical values which satisfy H-distance and Hamming distance constraints. To the best of our knowledge, these results are obtained for the first time, which provide direction for the research of theoretical bounds in DNA coding and the bounds of 4-ary in coding theory.
暂无评论