<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Sens.</journal-id>
<journal-title>Frontiers in Sensors</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Sens.</abbrev-journal-title>
<issn pub-type="epub">2673-5067</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">896299</article-id>
<article-id pub-id-type="doi">10.3389/fsens.2022.896299</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Sensors</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Fault-Aware Adversary Attack Analyses and Enhancement for RRAM-Based Neuromorphic Accelerator</article-title>
<alt-title alt-title-type="left-running-head">Shang et al.</alt-title>
<alt-title alt-title-type="right-running-head">Fault-Aware Adversary Attack</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Shang</surname>
<given-names>Liuting</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1719037/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Jung</surname>
<given-names>Sungyong</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1142685/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Li</surname>
<given-names>Fengjun</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Pan</surname>
<given-names>Chenyun</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1338287/overview"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Department of Electrical Engineering</institution>, <institution>University of Texas at Arlington</institution>, <addr-line>Arlington</addr-line>, <addr-line>TX</addr-line>, <country>United States</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Department of Electrical Engineering and Computer Science</institution>, <institution>University of Kansas</institution>, <addr-line>Lawrence</addr-line>, <addr-line>KS</addr-line>, <country>United States</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/988902/overview">Giovanni Pau</ext-link>, Kore University of Enna, Italy</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/971638/overview">Xing Wu</ext-link>, East China Normal University, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1349019/overview">Yuanfang Chen</ext-link>, Hangzhou Dianzi University, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1341086/overview">Bing Li</ext-link>, Capital Normal University, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Liuting Shang, <email>liuting.shang@mavs.uta.edu</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Sensor Networks, a section of the journal Frontiers in Sensors</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>13</day>
<month>05</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>3</volume>
<elocation-id>896299</elocation-id>
<history>
<date date-type="received">
<day>14</day>
<month>03</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>26</day>
<month>04</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2022 Shang, Jung, Li and Pan.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Shang, Jung, Li and Pan</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Neural networks have been widely deployed in sensor networks and IoT systems due to the advance in lightweight design and edge computing as well as emerging energy-efficient neuromorphic accelerators. However, adversary attack has raised a major threat against neural networks, which can be further enhanced by leveraging the natural hard faults in the neuromorphic accelerator that is based on resistive random access memory (RRAM). In this paper, we perform a comprehensive fault-aware attack analysis method for RRAM-based accelerators by considering five attack models based on a wide range of device- and circuit-level nonideal properties. The research on nonideal properties takes into account detailed hardware situations and provides a more accurate perspective on security. Compared to the existing adversary attack strategy that only leverages the natural fault, we propose an initiative attack based on two soft fault injection methods, which do not require a high-precision laboratory environment. In addition, an optimized fault-aware adversary algorithm is also proposed to enhance the attack effectiveness. The simulation results of an MNIST dataset on a classic convolutional neural network have shown that the proposed fault-aware adversary attack models and algorithms achieve a significant improvement in the attacking image classification.</p>
</abstract>
<kwd-group>
<kwd>security of IoT systems</kwd>
<kwd>hardware security</kwd>
<kwd>adversary attack</kwd>
<kwd>neuromorphic accelerator</kwd>
<kwd>nonideal property</kwd>
<kwd>fault injection</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>Introduction</title>
<p>The rapid development of deep learning algorithms and hardware in recent years has brought great success in a wide range of applications, some of which serve distributed systems such as the Internet of Things (IoT) and computer vision. However, deep learning meets two aspects of hardware problems in real-world implementation, especially in distributed scenarios. On the one hand, it is a severe challenge to meet various requirements of neural applications for the current hardware, including but not limited to computation throughput, latency, energy efficiency, and bandwidth efficiency in both training and inference stages. As a consequence, many accelerators schemes have been explored to better support the deployment of the neural network, in which the RRAM-based neuromorphic circuit is one of the most promising schemes that provides orders of magnitude improvement in the area, energy, and speed compared to CMOS-based platform/accelerators, such as TPU/GPU (<xref ref-type="bibr" rid="B27">Kim et al., 2012</xref>; <xref ref-type="bibr" rid="B14">Giacomin et al., 2018</xref>; <xref ref-type="bibr" rid="B20">Hu et al., 2018</xref>; <xref ref-type="bibr" rid="B32">Liu et al., 2018</xref>). On the other hand, privacy leakage is a critical threat in distributed systems from a security perspective. Sending data from the sensor networks to the cloud can incur the users&#x2019; concern that their secure data/behavioral information will be illegally captured by malicious agencies/persons (<xref ref-type="bibr" rid="B10">Chen and Ran, 2019</xref>). Hence, edge computing that deploys a computation engine in-site and locally processes the data captured from sensors becomes an attractive option for applications in distributed systems (<xref ref-type="bibr" rid="B2">AWS, 2022</xref>; <xref ref-type="bibr" rid="B17">Ha et al., 2014</xref>; <xref ref-type="bibr" rid="B56">Zhang et al., 2015</xref>; <xref ref-type="bibr" rid="B21">Hung et al., 2018</xref>; <xref ref-type="bibr" rid="B39">Mohammadi et al., 2018</xref>; <xref ref-type="bibr" rid="B12">Chinchali et al., 2018</xref>; <xref ref-type="bibr" rid="B30">Liu et al., 2019</xref>). Meanwhile, a distributed system can benefit from both RRAM-based accelerator and edge computing to achieve better performance, privacy, and longer working life (<xref ref-type="bibr" rid="B19">Hsu et al., 2019</xref>; <xref ref-type="bibr" rid="B57">Zhou et al., 2019</xref>; <xref ref-type="bibr" rid="B46">Singh et al., 2021</xref>).</p>
<p>Unfortunately, the trend of deploying RRAM-based accelerators in edge computing raises new security risks. Traditionally, neural networks are vulnerable to well-designed adversary attacks, which misleads classification by adding human-unnoticeable perturbation on the input samples. For example, adversary attacks can efficiently corrupt the intelligence of image classification or even manipulate the result of classification by slightly modifying the pixels in an image (<xref ref-type="bibr" rid="B15">Goodfellow et al., 2014</xref>; <xref ref-type="bibr" rid="B7">Carlini and Wagner, 2017</xref>; <xref ref-type="bibr" rid="B37">Madry et al., 2017</xref>). Although many software-domain defense strategies, such as adversarial training (<xref ref-type="bibr" rid="B15">Goodfellow et al., 2014</xref>), gradients masking (<xref ref-type="bibr" rid="B41">Papernot et al., 2017</xref>), and model distillation (<xref ref-type="bibr" rid="B42">Papernot et al., 2016</xref>), have been developed to substantially reduce the adversary attack success rate, hardware-based adversary attacks are proposed to further enhance the attack. Because of the distributed deployment of the RRAM-based accelerator, edge computing hardware is accessible to adversaries. Several hardware-based adversary attack methods have been designed to largely strengthen misleading ability by actively injecting faults to the weights of neural networks in digital memory. The fault injection methods target bit-flipping on critical positions by remote trojans, such as row hammer attacks (<xref ref-type="bibr" rid="B44">Rakin et al., 2020</xref>; <xref ref-type="bibr" rid="B45">Rakin et al., 2021</xref>), or invasive physical attacks like the laser injection technique (<xref ref-type="bibr" rid="B34">Liu et al., 2017a</xref>; <xref ref-type="bibr" rid="B5">Breier et al., 2018</xref>). However, those methods mainly target the digital system, and the security investigations for emerging RRAM-based analog accelerators are still insufficient. As emerging devices, RRAMs usually suffer from the immaturity of the fabrication technology and exhibit natural hard/soft faults (resistance stuck or drift), especially those that have multiple resistance states and represent multi-bit weights in a single cell. Since the neuromorphic system possesses an inherent error tolerance, minor nonideal characteristics in devices cannot induce noticeable accuracy degradation and can be considered &#x201c;benign&#x201d; (<xref ref-type="bibr" rid="B47">Temam, 2012</xref>). The RRAM-based neural network accelerators with &#x2018;benign&#x2019; faults can properly operate pre-trained functions in the testing/operation but are vulnerable to fault-aware adversary attacks.</p>
<p>A few works have investigated the impact of &#x2018;benign&#x2019; nonideal properties in RRAM-based hardware on adversary attacks toward image classification. One work discusses how the nonideal properties reduce the adversary attack success rate and concludes that the RRAM-based neuromorphic hardware is inherently robust against adversary attacks (<xref ref-type="bibr" rid="B4">Bhattacharjee and Panda, 2020</xref>). While a recent work points out that the hard faults in the RRAM crossbar array can be leveraged to substantially enhance the adversary attack strength and effectively breakthrough software defense strategy (<xref ref-type="bibr" rid="B36">Lv et al., 2021</xref>). In this previous work, the investigation is focused on the software domain and the nonideal properties are simplified as &#x2018;hard fault&#x2019;, i.e., the corrupted weights are fixed to the maximum or minimum value of a layer in neural networks. In this paper, we will analyze and enhance the faults/variation-based adversary attack based on rich RRAM nonideal behaviors and circuit characteristics in neural network accelerators. The major contributions of this work are highlighted in the following.<list list-type="simple">
<list-item>
<p>&#x2022; This work develops adversary attack models based on the rich and detailed nonideal properties that exist in the RRAM crossbar array, including soft-faults (i.e., conductance variation, hereinafter referred to as &#x2018;variation&#x2019;) and hard-faults. A novel perspective of nonideal properties at the circuit level is provided, including the realization of signed weights and the distributions of faults considering the mapping strategy. Such a perspective promotes the scope of hardware-aware adversary attacks.</p>
</list-item>
<list-item>
<p>&#x2022; The device-level and circuit-level attack models investigated in this paper enable the active enhancing/creating of the natural faults/variation and increase the effectiveness of attacks. By using normal images, projected gradient descent (PGD) adversary images, and fault-aware adversary images as inputs, comprehensive evaluations of performance are performed with a convolutional neural network trained with the MNIST handwritten digits dataset.</p>
</list-item>
<list-item>
<p>&#x2022; We enhance the fault-aware adversary attack method by reducing the amplitude of perturbation and increasing the number of perturbed pixels in input images. Without increasing the total change in pixels values, the enhanced algorithm not only improves the ability to mislead the classifier but also eliminates the obvious traces of changes.</p>
</list-item>
</list>
</p>
<p>The rest of this work is organized as follows. In <italic>Introduction</italic>, the background of conventional and fault-aware adversary attacks is provided. In <italic>Introduction</italic>, the properties of emerging RRAM devices and RRAM-based neuromorphic circuits that can be leveraged by adversary attacks are introduced. The experiment setup as well as the proposed fault-aware adversary attack models are given in <italic>Introduction</italic>. We provide the simulation results of the attack models and analyze them in <italic>Introduction</italic>. In <italic>Introduction</italic>, an enhanced attack algorithm is proposed and evaluated. Finally, we discuss several potential defense methods in <italic>Introduction</italic>.</p>
</sec>
<sec id="s2">
<title>Background of Conventional and Fault-Aware Adversary Attack</title>
<p>Researchers have developed rich adversary attack techniques to undermine the security of neural networks in various areas. Here, we discuss one of the most popular attack targets, neural networks for image classification. The purpose of adversary attack can be concluded as adding human-invisible perturbations in test images to mislead the classification, which can be expressed as:<disp-formula id="e1">
<mml:math id="m1">
<mml:mrow>
<mml:mi mathvariant="bold-italic">C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi mathvariant="bold-italic">W</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3b4;</mml:mi>
<mml:mi mathvariant="bold-italic">p</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2260;</mml:mo>
<mml:mi mathvariant="bold-italic">C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi mathvariant="bold-italic">W</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">&#xa0;</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mo>&#x7c;</mml:mo>
<mml:mo>&#x7c;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3b4;</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">p</mml:mi>
<mml:mi mathvariant="bold-italic">n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
<mml:mo>&#x7c;</mml:mo>
<mml:mo>&#x7c;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:mi mathvariant="normal">&#x3f5;</mml:mi>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>where C (&#x2022;) refers to the predictions of the neural network, <inline-formula id="inf1">
<mml:math id="m2">
<mml:mi>W</mml:mi>
</mml:math>
</inline-formula>, <inline-formula id="inf2">
<mml:math id="m3">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf3">
<mml:math id="m4">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, denotes the network weights, test image, and perturbations, respectively, and <inline-formula id="inf4">
<mml:math id="m5">
<mml:mi mathvariant="italic">&#x3f5;</mml:mi>
</mml:math>
</inline-formula> represents the constraints of perturbations and ensures that the image edition cannot be easily recognized by a human. Conventional adversary attack methods usually add the perturbation test images by using the gradients (<xref ref-type="bibr" rid="B15">Goodfellow et al., 2014</xref>; <xref ref-type="bibr" rid="B7">Carlini and Wagner, 2017</xref>; <xref ref-type="bibr" rid="B37">Madry et al., 2017</xref>), while defense techniques are proposed as effective countermeasures (<xref ref-type="bibr" rid="B15">Goodfellow et al., 2014</xref>; <xref ref-type="bibr" rid="B42">Papernot et al., 2016</xref>; <xref ref-type="bibr" rid="B41">Papernot et al., 2017</xref>).</p>
<p>In a previous work (<xref ref-type="bibr" rid="B36">Lv et al., 2021</xref>), natural hard-fault in RRAM is utilized to break through protected neural network accelerators. Such an attack bypasses conventional protection by assuming users will ignore the benign hard fault in hardware. Compared to the fault-aware attack that injects faults by Trojan/physical methods, it is harder to prevent this method because the faults utilized are naturally existing. The fault-aware adversary attack on an RRAM-based accelerator first measures the faults in the RRAMs that store the weights of a neural network. Then, attackers find perturbation-vulnerable positions in a given test image <inline-formula id="inf5">
<mml:math id="m6">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. The standard of vulnerability is the gradient difference <inline-formula id="inf6">
<mml:math id="m7">
<mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, which is defined by (<xref ref-type="bibr" rid="B36">Lv et al., 2021</xref>):<disp-formula id="e2">
<mml:math id="m8">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mo>&#x2032;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>where gradient <inline-formula id="inf7">
<mml:math id="m9">
<mml:msup>
<mml:mi>g</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:math>
</inline-formula> of test image <inline-formula id="inf8">
<mml:math id="m10">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is calculated by a neural network model with fault, and gradient <inline-formula id="inf9">
<mml:math id="m11">
<mml:mi>g</mml:mi>
</mml:math>
</inline-formula> is calculated in the fault-free model. For a pixel with coordinator <inline-formula id="inf10">
<mml:math id="m12">
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, a larger <inline-formula id="inf11">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mtext>&#xa0;</mml:mtext>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> indicates a stronger ability to distort the prediction, so the fault-aware adversary attack selects the pixel with the largest <inline-formula id="inf12">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> to add perturbation. Starting from a clean image, the perturbation is added by following a greedy algorithm, i.e., gradually increasing the number of perturbed pixels and the amplitude of the newly added perturbation until the classification is mislead or the perturbation reaches the limitation. We adopt this algorithm to test the proposed attack models for different fault types and design an enhanced method based on it.</p>
</sec>
<sec id="s3">
<title>Attackable Device/Circuit Properties</title>
<p>In this section, we investigate the properties of emerging RRAM devices and RRAM-based neuromorphic circuits, which build the foundation of fault-aware adversary attack models that are proposed in <italic>Attackable Device/Circuit Properties</italic>.</p>
<sec id="s3-1">
<title>Hard/Soft Faults in RRAM Devices</title>
<p>RRAM devices are area-competitive (multi-level data in one 4F<sup>2</sup>&#xa0;cell (<xref ref-type="bibr" rid="B40">M&#xfc;nch et al., 2019</xref>)) for large-scale neuromorphic circuits partly because of their compact nanoscale integration. However, this feature also leads to lower reliability, i.e., more hard/soft faults. There are multiple mechanism candidates for building RRAM cells, ranging from filamentary (<xref ref-type="bibr" rid="B43">Prezioso et al., 2015</xref>; <xref ref-type="bibr" rid="B55">Yu et al., 2015</xref>), phase change (<xref ref-type="bibr" rid="B6">Burr et al., 2015</xref>; <xref ref-type="bibr" rid="B26">Kim et al., 2015</xref>), ferroelectric ram (<xref ref-type="bibr" rid="B25">Kaneko et al., 2014</xref>), to conductive-bridge (<xref ref-type="bibr" rid="B24">Jo et al., 2010</xref>; <xref ref-type="bibr" rid="B22">Jeong et al., 2015</xref>). For most device mechanisms, the realization and retention of multi-bit data storage on the nanoscale are very challenging due to several issues.</p>
<p>First, permanently hard faults (i.e., stuck at On/Off resistance state) are common due to improper read/write current/voltage, environment stimulus, and/or natural damage (<xref ref-type="bibr" rid="B35">Lv et al., 2015</xref>; <xref ref-type="bibr" rid="B23">Jiang et al., 2016</xref>; <xref ref-type="bibr" rid="B18">He et al., 2019</xref>; <xref ref-type="bibr" rid="B54">Yeo et al., 2019</xref>; <xref ref-type="bibr" rid="B13">Fadeev and Rudenko, 2021</xref>; <xref ref-type="bibr" rid="B50">Wu et al., 2021</xref>). Second, imperfections exist in the complicated fabrication process, such as feature size shrinkage, line-edge roughness, and oxide thickness fluctuation can lead to variations in the resistance of RRAM (i.e., soft faults). Although minor variations can be compensated during the programming process of RRAM, some faults that lead to extremely high or low conductance cannot be fixed once the fabrication is done. In addition, because of the inherent particle drift and the currents periodically passthrough RRAM during the operation, the values stored in RRAM vary with time (<xref ref-type="bibr" rid="B35">Lv et al., 2015</xref>; <xref ref-type="bibr" rid="B23">Jiang et al., 2016</xref>). Without rewriting weight values, the accuracy of stored weights in RRAMs will degrade even if the chip is not operating (<xref ref-type="bibr" rid="B13">Fadeev and Rudenko, 2021</xref>). Moreover, all environmental factors, such as temperature, electrical fields, magnetic fields, and illumination, affect the resistance state. For example, the temperature has been shown to have a strong positive correlation with the conductance variation/fault rate of RRAM (<xref ref-type="bibr" rid="B35">Lv et al., 2015</xref>; <xref ref-type="bibr" rid="B23">Jiang et al., 2016</xref>; <xref ref-type="bibr" rid="B13">Fadeev and Rudenko, 2021</xref>; <xref ref-type="bibr" rid="B50">Wu et al., 2021</xref>). Such influence of temperature may be exaggerated by the chip cooling limitation in a dense layout, such as 3-dimensional stacked RRAM architecture for higher area efficiency (<xref ref-type="bibr" rid="B1">An et al., 2019</xref>; <xref ref-type="bibr" rid="B28">Lin et al., 2020</xref>). In addition, the distribution of variation/fault rate changes with the uneven distribution of corresponding factors. For example, the center positions in 3-dimensional stacking RRAM architecture encounter more faults due to a higher temperature (<xref ref-type="bibr" rid="B3">Beigi and Memik, 2016</xref>), and the locally enhanced electric field generated by the irregular shapes at the edge of the filamentary RRAM array causes more faults (<xref ref-type="bibr" rid="B35">Lv et al., 2015</xref>). All the sources of soft/hard faults above can be utilized by adversaries to mislead the neural network.</p>
<p>There are several types of solutions to reduce the variation mentioned above. For permanent variation/fault, solutions at the programing stage have been proposed to alleviate the hard faults and soft faults caused by inherent mismatches (<xref ref-type="bibr" rid="B48">Tunali and Altun, 2016</xref>; <xref ref-type="bibr" rid="B29">Liu et al., 2017b</xref>; <xref ref-type="bibr" rid="B51">Xia et al., 2017</xref>; <xref ref-type="bibr" rid="B52">Xia et al., 2018</xref>). However, some solutions (<xref ref-type="bibr" rid="B29">Liu et al., 2017b</xref>; <xref ref-type="bibr" rid="B51">Xia et al., 2017</xref>) require redundant hardware to replace corrupted memristors with the functional ones, and other solutions (<xref ref-type="bibr" rid="B48">Tunali and Altun, 2016</xref>; <xref ref-type="bibr" rid="B29">Liu et al., 2017b</xref>; <xref ref-type="bibr" rid="B52">Xia et al., 2018</xref>) need error correction using additional memristors (<xref ref-type="bibr" rid="B48">Tunali and Altun, 2016</xref>; <xref ref-type="bibr" rid="B29">Liu et al., 2017b</xref>; <xref ref-type="bibr" rid="B52">Xia et al., 2018</xref>). The additional memristors and error-correcting circuits significantly increase the costs and create difficulty in hardware implementation as the depth of the neural network grows. For temporary variation/fault, a straightforward solution is to simply check and rewrite all the weights stored in RRAMs during the inference period (<xref ref-type="bibr" rid="B52">Xia et al., 2018</xref>), which is time- and energy-consuming due to the complicated process, a large number of weights, and requirement of data communication. Since IoT/sensor networks are energy-sensitive, such a fault detection process cannot be frequently performed when the classification accuracy of neural networks has not met a noticeable degradation. In addition, adding cooling equipment, protecting mask, better quality control, and specific design can alleviate the temporary variation/fault. However, prevention of temporary variation/fault may induce a significant challenge and cost because in many cases sensors/computation nodes in distributed network may work in a variety of unstable outdoor harsh environments, and these devices are considered as low-cost consumables. In conclusion, the benign faults will widely exist with the neuromorphic accelerator for a long period of time.</p>
</sec>
<sec id="s3-2">
<title>RRAM Crossbar Array and Circuit Design</title>
<p>RRAM crossbar array is the core part of a neural network accelerator, which performs the most computation-dense MVM operation. In this section, we analyze the circuit-level model of the RRAM array and the corresponding impact of variation/fault on the neural network.</p>
<p>The first noticeable point is the representation strategy of weights. As shown in <xref ref-type="fig" rid="F1">Figure 1B</xref>, MVM (V &#x2022; W) is realized by programming the conductance of the RRAM cells to store the weight matrix (W). Then, the analog voltages are applied to the word line to represent the input vector (V). The currents flowing through RRAM cells are accumulated in bit lines and transformed to voltages by trans-impedance amplifiers (TIA) for the multiplication/summation results. In the previous work, the weight is represented by a single cell as shown in <xref ref-type="fig" rid="F1">Figure 1B</xref>, and it assumes the faulty weights are stuck at the maximum/minimum value among cells in a neural layer. While according to a recent state-of-the-art work that achieves a real-world neuromorphic accelerator (<xref ref-type="bibr" rid="B53">Yao et al., 2020</xref>), using two memristors to represent one weight value is more practical and precise and leads to easier implementation. As shown in <xref ref-type="fig" rid="F1">Figure 1C</xref>, <italic>W</italic>
<sub>1,1</sub> is represented by the conductance of a pair of RRAM cells, <italic>G</italic>
<sub>p(1,1)</sub> and <italic>G</italic>
<sub>n(1,1)</sub>, which are connected to input <italic>V</italic>
<sub>1</sub> and inversed input -<italic>V</italic>
<sub>1</sub>, respectively. If <italic>W</italic>
<sub>1,1</sub> is a negative value, the current flowing into the bit line can be calculated as:<disp-formula id="e3">
<mml:math id="m15">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">I</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1,1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">G</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">p</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1,1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">G</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">n</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1,1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi mathvariant="bold-italic">G</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">p</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1,1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msub>
<mml:mo>&#x226a;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">G</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">n</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1,1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>
<bold>(A)</bold> Diagram of fully-connected layer, <bold>(B)</bold> assumed 1-RRAM-1-weight weights mapping in previous work, <bold>(C)</bold> mapping signed weights by using complementary RRAMs to represent positive and negative values, <bold>(D)</bold> diagram of convolution layer, and <bold>(E)</bold> mapping method for convolution layer.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g001.tif"/>
</fig>
<p>Since the minimum conductance value is usually not within the stable working conductance range for storing data, the RRAM cell that does not store information (<inline-formula id="inf13">
<mml:math id="m16">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1,1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> in <xref ref-type="disp-formula" rid="e3">Eq 3</xref>) can be regarded as negligible.</p>
<p>If one of the RRAM cells in a pair is faulty and stuck at maximum or minimum conductance, seven possible consequences can happen as shown in <xref ref-type="table" rid="T1">Table 1</xref>; <xref ref-type="fig" rid="F2">Figure 2</xref> illustrates how a weight value is changed when one of the RRAM cells in the pair is stuck at minimum conductance. It can be observed that directly using the device fault rate for the evaluation of fault-aware adversary attack rate causes an overestimation in the weight difference.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>All eight results of getting 1&#xa0;cell stuck at minimum/maximum conductance.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left"/>
<th align="center">
<italic>G</italic>
<sub>p</sub> - &#x3e; <italic>G</italic>
<sub>min</sub>
</th>
<th align="center">
<italic>G</italic>
<sub>n</sub> - &#x3e; <italic>G</italic>
<sub>min</sub>
</th>
<th align="center">
<italic>G</italic>
<sub>p</sub> - &#x3e; <italic>G</italic>
<sub>max</sub>
</th>
<th align="center">
<italic>G</italic>
<sub>n</sub> - &#x3e; <italic>G</italic>
<sub>max</sub>
</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">
<bold>&#x2b;<italic>&#x7c;W</italic>
</bold>
<sub>
<bold>(i,j)</bold>
</sub>
<bold>&#x7c;</bold>
</td>
<td align="center">0</td>
<td align="center">&#x2b;<italic>&#x7c;W</italic>
<sub>(i,j)</sub>&#x7c;</td>
<td align="center">&#x2b;<italic>&#x7c;W</italic>
<sub>max</sub>&#x7c;</td>
<td align="center">
<italic>&#x7c;W</italic>
<sub>(i,j)</sub>&#x7c;<italic>-&#x7c;W</italic>
<sub>max</sub>&#x7c;</td>
</tr>
<tr>
<td align="left">
<bold>-<italic>&#x7c;W</italic>
</bold>
<sub>
<bold>(i,j)</bold>
</sub>
<bold>&#x7c;</bold>
</td>
<td align="center">-<italic>&#x7c;W</italic>
<sub>(i,j)</sub>&#x7c;</td>
<td align="center">0</td>
<td align="center">
<italic>&#x7c;W</italic>
<sub>max</sub>&#x7c;-<italic>&#x7c;W</italic>
<sub>(i,j)</sub>&#x7c;</td>
<td align="center">-<italic>&#x7c;W</italic>
<sub>max</sub>&#x7c;</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Circuit diagram of four results of getting 1&#xa0;cell stuck at minimum conductance.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g002.tif"/>
</fig>
<p>Second, the method of mapping weights to the RRAM crossbar array affects how the variation and fault distribute in weights. As discussed above, multiple reasons can lead to the uneven distribution of variation or faults. As an example, the temperature model in <xref ref-type="fig" rid="F3">Figures 3A, B</xref> shows that variations/faults have a higher probability to occur in the center area of each layer of the RRAM stack because of higher temperatures. By assuming one layer contains one crossbar array, the mapping-aware variation/fault analyses can be performed to investigate how different fault-dense areas affect the adversary attack. In this paper, we consider the mapping scheme of the two most common layers in neural networks, i.e., the fully-connected layer and convolution layer. A mapping method of the fully-connected layer can be found in <xref ref-type="fig" rid="F1">Figures 1A, B</xref>, where input <italic>V</italic>
<sub>
<italic>i</italic>
</sub> is the output of the upper layer, and <italic>I</italic>
<sub>i</sub> is the input of the lower layer. Hence, <italic>W</italic>
<sub>2,3</sub> denotes the weight connecting nodes one to two and 2&#x2013;3. The mapping method of the convolution layer can be found in <xref ref-type="fig" rid="F1">Figures 1D, E</xref>, where templates are reshaped as vectors and placed in the bit line direction in the crossbar array. Since variation and fault is more likely to happen in the center area, they will affect different parts of weights in different layers. The affection and analysis will be investigated in <italic>RRAM Crossbar Array and Circuit Design</italic>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>
<bold>(A)</bold> 3-dimensional RRAM crossbar array stack for higher area efficiency, <bold>(B)</bold> temperature map in RRAM stack.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g003.tif"/>
</fig>
<p>Fourth, due to the immature fabrication process of emerging RRAM devices, a special precision extension technique can be deployed to improve the weight precision. For example, <xref ref-type="fig" rid="F4">Figure 4</xref> shows a method of using three 2-bit RRAM cells to represent one 6-bit weight value by applying quantified input voltages and summing three output currents. This exposes the accelerator to a novel risk of attack towards quantification.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Diagram of using multiple RRAMs to extend the precision of one weight value. Here, three 2-bit cells are utilized to represent a weight value of 6-bit precision, and the input voltages are scaled to different weights of each cell.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g004.tif"/>
</fig>
</sec>
</sec>
<sec id="s4">
<title>Novel Attack Models</title>
<p>According to the device properties and the details of circuit design investigated in <italic>Novel Attack Models</italic>, we propose five fault-aware attack models. Several assumptions are first given, then modelized attack strategies are designed to prepare for further benchmarking.</p>
<sec id="s4-1">
<title>Assumptions of Adversary Attack</title>
<p>We adopt the same assumptions in previous work for investigating the fault-aware adversary attack (<xref ref-type="bibr" rid="B36">Lv et al., 2021</xref>):<list list-type="simple">
<list-item>
<p>(1) White box: the adversary has access to the full architecture and parameters of the neural network model, as well as the labels for provided inputs.</p>
</list-item>
<list-item>
<p>(2) Model of neural networks: the details of neural network architecture are provided in <xref ref-type="fig" rid="F5">Figure 5</xref>, in which convolution layers and fully-connected layers are followed by the ReLU activation function. We also deploy an existing adversarial training defense mechanism to strengthen the robustness of neural networks against adversarial attacks (<xref ref-type="bibr" rid="B37">Madry et al., 2017</xref>).</p>
</list-item>
<list-item>
<p>(3) Data set and perturbations: the fault-aware adversary examples are generated by adding extra perturbations to the conventional adversarial examples (<xref ref-type="bibr" rid="B38">M. A. E. Challenge, 2017</xref>). The conventional adversarial examples have <inline-formula id="inf14">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>&#x221e;</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> norm of perturbations on pixels that do not exceed <inline-formula id="inf15">
<mml:math id="m18">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> in <xref ref-type="disp-formula" rid="e1">Eq 1</xref>. For the extra fault-targeted perturbations, the restriction of their amplitude is the final pixel value should not exceed [0, 1]. To maintain the concealment of perturbation against the human eye, only around 1% (10 pixels for MNIST data set) of fault-targeted perturbations are allowed. The attack framework is built on Tensorflow.</p>
</list-item>
</list>
</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Architecture of neural network for MNIST.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g005.tif"/>
</fig>
</sec>
<sec id="s4-2">
<title>Attack Models</title>
<p>According to the discussion in <italic>Attack Models</italic>, an original binary attack model and five novel variation/fault attack models are developed as shown in <xref ref-type="fig" rid="F6">Figure 6</xref>. By independently analyzing each of them, the attack models can be accordingly categorized as follows.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Overview of five fault/variation models.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g006.tif"/>
</fig>
<p>Original Baseline Binary Attack Model: this model adopts the same configurations in previous work (<xref ref-type="bibr" rid="B36">Lv et al., 2021</xref>), which assumes all the faults are evenly distributed, faulty values are positive or negative maximum absolute values (i.e., binary) in a layer. Meanwhile, all the parameters, as well as faulty values in the neural network, are known to the attacker.</p>
<p>Attack Model 1: regarding the fault model in <xref ref-type="fig" rid="F6">Figure 6A</xref>, we assume only 1&#xa0;cell in a pair is faulty because of the low fault rate. Thus, the random hard faults in the RRAM crossbar array result in seven kinds of change in each weight value according to <xref ref-type="table" rid="T1">Table 1</xref>. To verify the necessity of this model, we also investigate how the attack can be affected if adversaries simplify Attack Model 1, i.e., apply the Baseline Attack Model to circuits with a dual RRAM representation. The faults could be the natural faults during the fabrication, or the faults created during a long operation. Because the adversaries have access to the neural network accelerator, fault testing algorithms, such as March-C, can be applied to detect the hardware faults information (<xref ref-type="bibr" rid="B9">Chen et al., 2014</xref>; <xref ref-type="bibr" rid="B31">Liu et al., 2016</xref>). With unlimited access to the peripheral read/write circuits in a non-invasive way, attackers can also read out the conduction of the functional cell in the faulty pair and calculate the real stored weight value. Notably, based on the relation between temperature and fault rate, adversaries can actively apply long-term temperature raising or short-term baking to increase the fault rate in the RRAM chip. Compared to existing laser-based fault injection that is accurate to bit, the temperature-based approach is inexpensive and can be performed <italic>in-situ</italic> instead of in-laboratory environments. That also makes the attack fast and stealthy without the need for the device to be offline. Furthermore, the temperature-based active fault injection reduces the inherent faults that are vulnerable to the adversary attack.</p>
<p>Attack Model 2: as shown in <xref ref-type="fig" rid="F6">Figure 6B</xref>, for the RRAM arrays that do not have enough hard faults to trigger the fault-based adversary attack, adversaries can utilize the variations in the RRAM chip to enhance the attack ability. As discussed in <italic>Attack Models</italic>, the variation in conductance widely exists in hardware and deteriorates with the increase in operating time and temperature. Adversaries are able to access the variation information by leveraging the inherent read function, which is slower than fault detection because of the large number of parameters in deep neural networks. However, it is still advantageous for convenient <italic>in-situ</italic> attacks and the ability to enhance variations by manipulating operation temperature. The amplitude of variation in every RRAM cell obeys a normal distribution with the standard deviation <inline-formula id="inf16">
<mml:math id="m19">
<mml:mi>&#x3c3;</mml:mi>
</mml:math>
</inline-formula> (<xref ref-type="bibr" rid="B11">Chen et al., 2017</xref>).</p>
<p>Attack Model 3: for the RRAM array that utilizes 3-dimensional RRAM stacks or those that have more defects in fabrication, adversaries can leverage the higher fault rate caused by thermal or other stimuli. While the positions of such faults in an array are unevenly distributed according to the type of the stimuli. Hence, using the thermal and electric field fault mechanisms discussed in <italic>Attack Models</italic> as examples, we create the models of the distribution of fault positions as shown in <xref ref-type="fig" rid="F6">Figure 6C</xref> to investigate the impact of fault distributions on the attack success rate. The fault type in this model is assumed to be hard faults. The fault rates of RRAM cells in the first model (c-1) and the non-fault rate in the second model (c-2) are assumed to be exponentially related to the distance from the cell to the center of the array. For example, the fault rate in the model (c-1) can be expressed as:<disp-formula id="e4">
<mml:math id="m20">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>f</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mi>M</mml:mi>
<mml:mn>2</mml:mn>
</mml:mfrac>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mi>N</mml:mi>
<mml:mn>2</mml:mn>
</mml:mfrac>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>where <inline-formula id="inf17">
<mml:math id="m21">
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is an arbitrary position in an <inline-formula id="inf18">
<mml:math id="m22">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> array. Also, the two uneven distributions are normalized to ensure the same total fault rate as the baseline binary attack model.</p>
<p>Attack Model 4: for the weight representation method that extends the precision by using more RRAM devices (i.e., more MVM blocks), we propose the attack model as shown in <xref ref-type="fig" rid="F6">Figure 6D</xref>. Since the improved weight precision in the RRAM-based neural accelerator comes with the price of more crossbar arrays as well as peripheral circuits, power gating schemes can be deployed to provide a customizable precision. The energy can be optimized accordingly by cutting off the power supply for the MVM block that represents the least significant bits. However, adversaries can access the hardware and maliciously shut down those MVM blocks to create a quantification error, which intentionally induces the conductance variation within <inline-formula id="inf19">
<mml:math id="m23">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b4;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> when rounding toward the nearest representable number, where <inline-formula id="inf20">
<mml:math id="m24">
<mml:mi>&#x3b4;</mml:mi>
</mml:math>
</inline-formula> is the minimum resolution of the degraded weight value.</p>
<p>Attack Model 5: the attack model is shown in <xref ref-type="fig" rid="F6">Figure 6E</xref> aims to investigate the sensitivity of fault-aware adversary attacks regarding the positions and types of layers. To avoid reading all parameters and accelerating the attack process, adversaries can only enhance and detect the faults in layers that are most effective in improving the attack success rate. Here, this attack model is separated by two assumptions. The first one assumes that the original accelerator does not have a fault and randomly creates faults to the layers that are effective to adversaries (for example, by locally increasing temperature). Another is a control group that only reads part of layers from an all-layer faulty chip, which aims to test whether the absence of partial fault information can disable the attack. For both assumptions, we set the convolution layers (close to input) or fully-connected layers (close to output) as the layers that we acknowledge all the faults as shown in <xref ref-type="fig" rid="F6">Figure 6E</xref>.</p>
</sec>
</sec>
<sec id="s5">
<title>Evaluation of the Proposed Attack Models</title>
<sec id="s5-1">
<title>Configuration of Evaluation</title>
<p>In order to obtain a robust adversary attack model, first, the given neural network is fully trained by the existing method (<xref ref-type="bibr" rid="B37">Madry et al., 2017</xref>; <xref ref-type="bibr" rid="B38">M. A. E. Challenge</xref>). Then, the faults or variations are added to simulate the potential and real conditions of the hardware. Since all the discussed faults are due to the nonideality of the RRAM devices in a crossbar array, the faults/variation are only added to the weights among layers, while the existing work adds faults to all trainable variables, including bias (<xref ref-type="bibr" rid="B36">Lv et al., 2021</xref>). This setting and the training method will lead to a difference in the accuracy and attack success rate. Here, the attack success rate is defined as the baseline accuracy minus accuracy after the attack. We use 500 MNIST handwriting figures as testing examples to create conventional adversary examples as well as fault-aware adversary examples. For each fault/variation setting, neural network models with 20 different faults/variation are generated for the purpose of sampling.</p>
</sec>
<sec id="s5-2">
<title>Evaluation Results</title>
<p>The simulation results from Attack Model one to five are shown in the figures below. &#x2018;Without Attack&#x2019;, &#x2018;PGD&#x2019;, and &#x2018;Faults/Variation Attack&#x2019; denote inputting image examples with no perturbation, PGD adversary perturbation, and faults/variation-based adversary perturbation, respectively. The curves for the baseline prediction show that the RRAM nonideality in neuromorphic accelerator does not lead to noticeable degradation in figure classification. Meanwhile, the lines of the PGD attack indicate that the conventional adversary attack cannot efficiently leverage the natural faults/variation in hardware to enhance the attack success rate.</p>
<p>
<xref ref-type="fig" rid="F7">Figure 7A</xref> includes the attack success rates generated by the Binary Attack Model and Attack Model 1. The result shows that Attack Model one results in a higher classification rate, which is because two out of the seven conditions in <xref ref-type="table" rid="T1">Table 1</xref> will not lead to an error in weight value. The dotted curve shows that applying Baseline Attack Model to a circuit with dual RRAM representation will lead to degradation in attack effectiveness. This result indicates that it is necessary to select a correct attack model to ensure the attack success rate.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>
<bold>(A)</bold> Results of Attack Model 1, and <bold>(B)</bold> results of Attack Model 2.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g007.tif"/>
</fig>
<p>The results of Attack Model two are shown in <xref ref-type="fig" rid="F7">Figure 7B</xref>, in which the variation-based adversary attack effectively reduces the worst accuracy in the baseline attack model from 60.5 to 49.4%. That means the widely existing minor variation in RRAM crossbar arrays can be utilized to create a larger impact on the final predicted results. the hard faults can be quickly detected by array-level scanning and replaced by backup/spare cells, the variation in RRAM possesses better concealment since comparing the conductance of each RRAM cell with standard value is extremely time-consuming.</p>
<p>In <xref ref-type="fig" rid="F8">Figure 8A</xref>, we can observe that two uneven distributions of faults in an RRAM crossbar array, i.e., Attack Model 3, reduce the attack success rate. This indicates that the attack is less effective if the positions of faults are dominated by unevenly distributed stimuli or fabrication mismatch.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>
<bold>(A)</bold> Results of attack Model 3, and <bold>(B)</bold> results of attack Model 4.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g008.tif"/>
</fig>
<p>The attack results of Attack Model four are shown in <xref ref-type="fig" rid="F8">Figure 8B</xref>, which claims precision degradation as a promising method to create value variation for adversary attacks. The attack effectiveness proven by Attack Model two and four indicates that not only hard fault but also the small conductance variation can lead to significant gradients difference and open a door for adversary attack.</p>
<p>In <xref ref-type="fig" rid="F9">Figure 9A</xref>, adding faults in convolution layers, i.e., the first two layers, results in a much lower accuracy compared to the attacked classifier that only has faults in fully-connected layers. Although fully-connected layers have a dominant number of parameters (99.06%) in the neural network used for simulation, those layers do not play an important role in the fault-based attack. On the contrary, only adding faults to convolution layers achieves comparable attack effectiveness compared to the Original Binary Attack Model, which has faults in all layers. This proves the hypothesis in previous work, i.e., the faults in neural accelerator need several layers to broadcast and thus enhance the impact on classification.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>
<bold>(A)</bold> Results of attack Model 5, in which all faults in the chip are known, <bold>(B)</bold> results of attack Model 5, in which only the faults in certain layers are known.</p>
</caption>
<graphic xlink:href="fsens-03-896299-g009.tif"/>
</fig>
<p>However, <xref ref-type="fig" rid="F9">Figure 9B</xref> indicates that only detecting partial faults of an accelerator that has faults in every layer will weaken the fault-aware adversary attack. provide a conclusion that the <italic>in-situ</italic> faults detection can obtain &#x223c;100 <inline-formula id="inf21">
<mml:math id="m25">
<mml:mo>&#xd7;</mml:mo>
</mml:math>
</inline-formula> acceleration if the active fault injection can be focused on the area that is closer to the input (for example, irradiating part of the 2-dimensional RRAM area with infrared rays). This substantially improves the practicality and concealment of deploying the attack.</p>
</sec>
</sec>
<sec id="s6">
<title>Enhanced Fault-Aware Adversary Attack</title>
<p>The existing fault-aware adversary attack algorithm adds perturbations on a few pixels in adversary images. The amplitude of the perturbation is unlimited, which means a black pixel can be inversed as white in the grey image. As shown in <xref ref-type="fig" rid="F10">Figure 10</xref>, such a unconstrainted modification leads to obvious manipulations in the attacked images. A typical phenomenon is the discontinued strokes of numbers, which can be easily detected and defended. The original intention of the full-ranged perturbation is to ensure that a sufficient change can be accumulated in the gradient ascent direction. Hence, we propose to increase the number of perturbations and limit the amplitude of each perturbation. This method ensures the trigger of misclassification by a large number of perturbations but each perturbation is less noticeable.</p>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>Comparison of adversary attack images on MNIST. The disconnected positions are marked by red circles. The images generated by the proposed attack is with perturbations limited within [-0.2, 0.2].</p>
</caption>
<graphic xlink:href="fsens-03-896299-g010.tif"/>
</fig>
<p>We denote the perturbation range as <inline-formula id="inf22">
<mml:math id="m26">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, then the full-ranged perturbation is within [-1.1] for MNIST images. As can be observed in <xref ref-type="table" rid="T2">Table 2</xref>, the proposed method achieves better attack effectiveness with a smaller average change in pixel values of an image. The new strategy not only reduces the number of discontinued strokes in the original position (e.g., &#x2018;5&#x2019; in the third row of <xref ref-type="fig" rid="F10">Figure 10</xref>), but also motivates the algorithm to find a new misleading pattern (e.g., &#x2018;1&#x2019; in the third row of <xref ref-type="fig" rid="F10">Figure 10</xref>), which explains the improvement in attack success rate. The images on the third row of <xref ref-type="fig" rid="F10">Figure 10</xref> illustrate that the algorithm no longer creates obvious disconnection in handwritten figures. Compared to the images generated by the existing method, the ones generated by the proposed method achieve a similar appearance as the original images. Moreover, since the attackable images with different perturbation ranges do not always overlap, independently applying attacks with different ranged perturbations can further improve the attack effectiveness. For example, performing an attack of 10 perturbations within [-1,1] and 20 perturbations within [-0.35,0.35] results in a 17.2% improvement in the attack success rate without increasing the change of pixel values. Performing an attack by traverse through 10 perturbations within [-1,1] and 20 perturbations within [-0.1,0.1] [-0.2,0.2] [-0.3,0.3], and [-0.35,0.35] further reduce the accuracy to 40.6%. In addition, the enhanced attack is also deployed on targets with different fault types. As shown in <xref ref-type="table" rid="T3">Table 3</xref>, the method is applicable to both other hard faults (dual RRAM) and soft faults (normal variation and degraded precision).</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>All eight results of getting 1&#xa0;cell stuck at minimum/maximum conductance. 10 perturbations occur in the range of [-1.1] and the remaining ranges have 20 perturbations.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Rang of perturbation</th>
<th align="center">[-1.1]</th>
<th align="center">[-1.1] or [-0.35.0.35]</th>
<th align="center">Traverse 5 ranges</th>
<th align="center">[-0.1.0.1]</th>
<th align="center">[-0.2.0.2]</th>
<th align="center">[-0.3.0.3]</th>
<th align="center">[-0.4.0.4]</th>
<th align="center">[-0.5.0.5]</th>
<th align="center">[-0.6.0.6]</th>
<th align="center">[-0.7.0.7]</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Accuracy</td>
<td align="char" char=".">60.5%</td>
<td align="char" char=".">43.3%</td>
<td align="char" char=".">40.6%</td>
<td align="char" char=".">77.9%</td>
<td align="char" char=".">69.4%</td>
<td align="char" char=".">57.7%</td>
<td align="char" char=".">50.8%</td>
<td align="char" char=".">45.1%</td>
<td align="char" char=".">40.8%</td>
<td align="char" char=".">40.7%</td>
</tr>
<tr>
<td align="left">Average Changed Pixel Values</td>
<td align="char" char=".">4.1</td>
<td align="char" char=".">4.1</td>
<td align="char" char=".">4.0</td>
<td align="char" char=".">0.87</td>
<td align="char" char=".">1.0</td>
<td align="char" char=".">2.8</td>
<td align="char" char=".">3.2</td>
<td align="char" char=".">4.6</td>
<td align="char" char=".">5.6</td>
<td align="char" char=".">6.4</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Comparison of original and enhanced adversary attacks on hard faults (dual RRAM) and soft faults (normal variation and degraded precision). The five ranges for the enhanced attack are the same as in <xref ref-type="table" rid="T2">Table 2</xref>.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th colspan="2" align="left">Other fault types</th>
<th align="center">Dual RRAM</th>
<th align="center">Variation <inline-formula id="inf23">
<mml:math id="m27">
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>&#x3c3;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>5</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</th>
<th align="center">Precision (bit &#x3d; 3)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="2" align="left">Original Attack</td>
<td align="left">Accuracy</td>
<td align="char" char=".">64.1%</td>
<td align="char" char=".">46.4%</td>
<td align="char" char=".">67.2%</td>
</tr>
<tr>
<td align="left">Average Changed Pixel Values</td>
<td align="char" char=".">4.1</td>
<td align="char" char=".">4.0</td>
<td align="char" char=".">4.2</td>
</tr>
<tr>
<td rowspan="2" align="left">Enhanced Attack with 5 Ranges</td>
<td align="left">Accuracy</td>
<td align="char" char=".">48.2%</td>
<td align="char" char=".">38%</td>
<td align="char" char=".">56.2%</td>
</tr>
<tr>
<td align="left">Average Changed Pixel Values</td>
<td align="char" char=".">3.9</td>
<td align="char" char=".">3.8</td>
<td align="char" char=".">3.9</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s7">
<title>Potential Defense Methods</title>
<p>Since conventional fault-based adversary attacks aim to actively inject faults to selected parameters in memory by Trojan, some defense methods have been proposed to successfully prevent most of the threats (<xref ref-type="bibr" rid="B33">Liu et al., 2017c</xref>; <xref ref-type="bibr" rid="B16">Gu et al., 2017</xref>; <xref ref-type="bibr" rid="B8">Chen et al., 2018</xref>; <xref ref-type="bibr" rid="B49">Wang et al., 2019</xref>). However, they do not apply to the RRAM-targeted attack method for two reasons. First, some of those countermeasures can detect and remove the misleading by analyzing the results of testing classification. But the natural faults appear randomly in RRAM cells and hence are immune to such defense methods. Second, a fault-aware adversary attack assumes that the user simply transplants the neural network to the hardware and ignores the nonideality of the circuit while the defense methods require the full information of the prepared chip. Third, these defense methods are not designed to effectively defend the attack during the inference stage. Even if the full information of the nonideality is known and fixed, none of the defense methods can be deployed to prevent the faults/variations that occur during the operation or are injected <italic>in-situ</italic>.</p>
<p>Checking data integrity is another approach to solve/alleviate the fault-based adversary attack. However, popular data error detection/correction techniques, such as error-correction code (ECC), do not apply to the analog circuit. Besides, inherent faults are unfixable, and knowing their existence cannot prevent the attack. As discussed in <italic>Potential Defense Methods</italic>, dynamically replacing unfixable RRAM cells with backup cells is not practical. Moreover, for the faults/variations that are fixable and occur during the operation, the user can repair/replace them by repetitively scanning the RRAM status. However, such a naive approach is inefficient and leads to unacceptable overheads in delay and power consumption. In addition, the designer can consider adding temperature (or other stimuli) sensors on the chip to monitor environmental temperature status and report to the user once an anomaly happens. However, this method is inapplicable to malicious stimuli that focus on partial RRAM, and it cannot solve the faults/variation caused by inherent nonideality. Finally, destroying the physical reading port of neuromorphic hardware can prevent the attacker from accessing fault/variation information, which is previously used to protect secure data in memory. Unfortunately, this scheme also blocks access to the device when an update needs to be performed on the neural network. As a result, it is only suitable for one-time training and stable digital memory with a long data retention time.</p>
</sec>
<sec sec-type="conclusion" id="s8">
<title>Conclusion</title>
<p>In this paper, five faults/variation-based adversary attack models are developed based on detailed nonideal properties that exist in the RRAM crossbar array. By analyzing the device- and circuit-level phenomena, the scope of the attack is extended from simple and abstract binary hard faults to non-binary faults, randomly injected faults, uneven-distributed faults, and soft faults. The investigation reveals that adding faults to neural layers that are closer to input is much more efficient than those closer to output. More importantly, the quantification error and conductance variation are proven to be effective under the variation-aware attacks, in which the conductance variation achieves a 49.4% improvement in attack success rate compared to the attack based on original binary faults. Finally, an enhanced attack method is proposed to obtain more stealthy adversary images with up to 19.9% better attack success rates.</p>
</sec>
</body>
<back>
<sec id="s9">
<title>Data Availability Statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found here: <ext-link ext-link-type="uri" xlink:href="http://yann.lecun.com/exdb/mnist/">http://yann.lecun.com/exdb/mnist/</ext-link>.</p>
</sec>
<sec id="s10">
<title>Author Contributions</title>
<p>LS designed and conducted most of the experiments. SJ provided the discussion of adversary attack background information and applications. FL revised this paper and contributed to data analysis. CP led this project.</p>
</sec>
<sec sec-type="COI-statement" id="s11">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s12">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>An</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>An</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Yi</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Realizing Behavior Level Associative Memory Learning through Three-Dimensional Memristor-Based Neuromorphic Circuits</article-title>. <source>IEEE Trans. Emerg. Top. Comput. Intell.</source> <volume>5</volume> (<issue>4</issue>), <fpage>668</fpage>&#x2013;<lpage>678</lpage>. <pub-id pub-id-type="doi">10.1109/TETCI.2019.2921787</pub-id> </citation>
</ref>
<ref id="B2">
<citation citation-type="web">
<collab>AWS</collab> <article-title>AWS Deeplens</article-title>(<year>2022</year>). <comment>Availabel at: <ext-link ext-link-type="uri" xlink:href="https://aws.amazon.com/cn/deeplens/">https://aws.amazon.com/cn/deeplens/</ext-link>
</comment>. </citation>
</ref>
<ref id="B3">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Beigi</surname>
<given-names>M. V.</given-names>
</name>
<name>
<surname>Memik</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>TAPAS: Temperature-Aware Adaptive Placement for 3D Stacked Hybrid Caches</article-title>,&#x201d; in <conf-name>Proceedings of the Second International Symposium on Memory Systems</conf-name>, <conf-loc>Alexandria, VA, United States</conf-loc>, <conf-date>October 3&#x2013;6, 2016</conf-date>, <fpage>415</fpage>&#x2013;<lpage>426</lpage>. </citation>
</ref>
<ref id="B4">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Bhattacharjee</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Panda</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Rethinking Non-idealities in Memristive Crossbars for Adversarial Robustness in Neural Networks</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/pdf/2008.11298.pdf">https://arxiv.org/pdf/2008.11298.pdf</ext-link>
</comment>. </citation>
</ref>
<ref id="B5">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Breier</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Jap</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Bhasin</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Practical Fault Attack on Deep Neural Networks</article-title>,&#x201d; in <conf-name>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security</conf-name>, <conf-loc>Toronto, Canada</conf-loc>, <conf-date>October 15&#x2013;19, 2018</conf-date>, <fpage>2204</fpage>&#x2013;<lpage>2206</lpage>. <pub-id pub-id-type="doi">10.1145/3243734.3278519</pub-id> </citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Burr</surname>
<given-names>G. W.</given-names>
</name>
<name>
<surname>Shelby</surname>
<given-names>R. M.</given-names>
</name>
<name>
<surname>Sidler</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>di Nolfo</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Jang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Boybat</surname>
<given-names>I.</given-names>
</name>
<etal/>
</person-group> (<year>2015</year>). <article-title>Experimental Demonstration and Tolerancing of a Large-Scale Neural Network (165 000 Synapses) Using Phase-Change Memory as the Synaptic Weight Element</article-title>. <source>IEEE Trans. Electron Devices</source> <volume>62</volume> (<issue>11</issue>), <fpage>3498</fpage>&#x2013;<lpage>3507</lpage>. <pub-id pub-id-type="doi">10.1109/ted.2015.2439635</pub-id> </citation>
</ref>
<ref id="B7">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Carlini</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Wagner</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Towards Evaluating the Robustness of Neural Networks</article-title>,&#x201d; in <conf-name>2017 IEEE Symposium on Security and Privacy (SP)</conf-name>, <conf-loc>San Jose, CA, USA</conf-loc>, <conf-date>22-26 May 2017</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>39</fpage>&#x2013;<lpage>57</lpage>. <pub-id pub-id-type="doi">10.1109/sp.2017.49</pub-id> </citation>
</ref>
<ref id="B8">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Carvalho</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Baracaldo</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Ludwig</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Edwards</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>T.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). <article-title>Detecting Backdoor Attacks on Deep Neural Networks by Activation Clustering</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/1811.03728">https://arxiv.org/abs/1811.03728</ext-link>
</comment>. </citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>C.-Y.</given-names>
</name>
<name>
<surname>Shih</surname>
<given-names>H-C.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>C-W.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>C-H.</given-names>
</name>
<name>
<surname>Chiu</surname>
<given-names>P-F.</given-names>
</name>
<name>
<surname>Sheu</surname>
<given-names>S-S.</given-names>
</name>
<etal/>
</person-group> (<year>2014</year>). <article-title>RRAM Defect Modeling and Failure Analysis Based on March Test and a Novel Squeeze-Search Scheme</article-title>. <source>IEEE Trans. Comput.</source> <volume>64</volume> (<issue>1</issue>), <fpage>180</fpage>&#x2013;<lpage>190</lpage>. <pub-id pub-id-type="doi">10.1109/TC.2014.12</pub-id> </citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Ran</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Deep Learning with Edge Computing: A Review</article-title>. <source>Proc. IEEE</source> <volume>107</volume> (<issue>8</issue>), <fpage>1655</fpage>&#x2013;<lpage>1674</lpage>. <pub-id pub-id-type="doi">10.1109/jproc.2019.2921977</pub-id> </citation>
</ref>
<ref id="B11">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>P.-Y.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>NeuroSim&#x2b;: An Integrated Device-To-Algorithm Framework for Benchmarking Synaptic Devices and Array Architectures</article-title>,&#x201d; in <conf-name>2017 IEEE International Electron Devices Meeting (IEDM)</conf-name>, <conf-loc>San Francisco, CA, USA</conf-loc>, <conf-date>2-6 Dec. 2017</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>6.1. 1</fpage>&#x2013;<lpage>6.1. 4</lpage>. </citation>
</ref>
<ref id="B12">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Chinchali</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Chu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Sharma</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Bansal</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Misra</surname>
<given-names>R.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). &#x201c;<article-title>Cellular Network Traffic Scheduling with Deep Reinforcement Learning</article-title>,&#x201d; in <conf-name>Thirty-second AAAI conference on artificial intelligence</conf-name>, <conf-loc>New Orleans, LA, United States</conf-loc>, <conf-date>February 2&#x2013;7, 2018</conf-date>. </citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fadeev</surname>
<given-names>A. V.</given-names>
</name>
<name>
<surname>Rudenko</surname>
<given-names>K. V.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>To the Issue of the Memristor&#x27;s HRS and LRS States Degradation and Data Retention Time</article-title>. <source>Russ. Microelectron.</source> <volume>50</volume> (<issue>5</issue>), <fpage>311</fpage>&#x2013;<lpage>325</lpage>. <pub-id pub-id-type="doi">10.1134/s1063739721050024</pub-id> </citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Giacomin</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Greenberg-Toledo</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Kvatinsky</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Gaillardon</surname>
<given-names>P.-E.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A Robust Digital RRAM-Based Convolutional Block for Low-Power Image Processing and Learning Applications</article-title>. <source>IEEE Trans. Circuits Syst. I Regul. Pap.</source> <volume>66</volume> (<issue>2</issue>), <fpage>643</fpage>&#x2013;<lpage>654</lpage>. <pub-id pub-id-type="doi">10.1109/TC.2014.12</pub-id> </citation>
</ref>
<ref id="B15">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Goodfellow</surname>
<given-names>I. J.</given-names>
</name>
<name>
<surname>Shlens</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Szegedy</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Explaining and Harnessing Adversarial Examples</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/1412.6572">https://arxiv.org/abs/1412.6572</ext-link>
</comment>. </citation>
</ref>
<ref id="B16">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Gu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Dolan-Gavitt</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Garg</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Badnets: Identifying Vulnerabilities in the Machine Learning Model Supply Chain</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/1708.06733">https://arxiv.org/abs/1708.06733</ext-link>
</comment>. </citation>
</ref>
<ref id="B17">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Ha</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Richter</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Pillai</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Satyanarayanan</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Towards Wearable Cognitive Assistance</article-title>,&#x201d; in <conf-name>Proceedings of the 12th annual international conference on Mobile systems, applications, and services</conf-name>, <conf-loc>Bretton Woods, NH, United States</conf-loc>, <conf-date>June 16&#x2013;19, 2014</conf-date>, <fpage>68</fpage>&#x2013;<lpage>81</lpage>. <pub-id pub-id-type="doi">10.1145/2594368.2594383</pub-id> </citation>
</ref>
<ref id="B18">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>He</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Ewetz</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>J.-S.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Noise Injection Adaption: End-To-End ReRAM Crossbar Non-ideal Effect Adaption for Neural Network Mapping</article-title>,&#x201d; in <conf-name>Proceedings of the 56th Annual Design Automation Conference 2019</conf-name>, <conf-loc>Las Vegas, NV, USA</conf-loc>, <conf-date>2-6 June 2019</conf-date>, <fpage>1</fpage>&#x2013;<lpage>6</lpage>. </citation>
</ref>
<ref id="B19">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Hsu</surname>
<given-names>T.-H.</given-names>
</name>
<name>
<surname>Chiu</surname>
<given-names>Y-C.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>W-C.</given-names>
</name>
<name>
<surname>Lo</surname>
<given-names>Y-C.</given-names>
</name>
<name>
<surname>Lo</surname>
<given-names>C-C.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>R-S.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). &#x201c;<article-title>AI Edge Devices Using Computing-In-Memory and Processing-In-Sensor: from System to Device</article-title>,&#x201d; in <conf-name>2019 IEEE International Electron Devices Meeting (IEDM)</conf-name>, <conf-loc>San Francisco, CA, USA</conf-loc>, <conf-date>7-11 Dec. 2019</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>22.5. 1</fpage>&#x2013;<lpage>22.5. 4</lpage>. <pub-id pub-id-type="doi">10.1109/iedm19573.2019.8993452</pub-id> </citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Graves</surname>
<given-names>C. E.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ge</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Montgomery</surname>
<given-names>E.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). <article-title>Memristor&#x2010;Based Analog Computation and Neural Network Classification with a Dot Product Engine</article-title>. <source>Adv. Mat.</source> <volume>30</volume> (<issue>9</issue>), <fpage>1705914</fpage>. <pub-id pub-id-type="doi">10.1002/adma.201705914</pub-id> </citation>
</ref>
<ref id="B21">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Hung</surname>
<given-names>C.-C.</given-names>
</name>
<name>
<surname>Ananthanarayanan</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Bodik</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Golubchik</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Bahl</surname>
<given-names>P.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). &#x201c;<article-title>Videoedge: Processing Camera Streams Using Hierarchical Clusters</article-title>,&#x201d; in <conf-name>2018 IEEE/ACM Symposium on Edge Computing (SEC)</conf-name>, <conf-loc>Seattle, WA, USA</conf-loc>, <conf-date>25-27 Oct. 2018</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>115</fpage>&#x2013;<lpage>131</lpage>. </citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jeong</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>W. D.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Utilizing Multiple State Variables to Improve the Dynamic Range of Analog Switching in a Memristor</article-title>. <source>Appl. Phys. Lett.</source> <volume>107</volume> (<issue>17</issue>), <fpage>173105</fpage>. <pub-id pub-id-type="doi">10.1063/1.4934818</pub-id> </citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Jang</surname>
<given-names>M. H.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>Q.</given-names>
</name>
<etal/>
</person-group> (<year>2016</year>). <article-title>Sub-10 Nm Ta Channel Responsible for Superior Performance of a HfO2 Memristor</article-title>. <source>Sci. Rep.</source> <volume>6</volume> (<issue>1</issue>), <fpage>28525</fpage>&#x2013;<lpage>28528</lpage>. <pub-id pub-id-type="doi">10.1038/srep28525</pub-id> </citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jo</surname>
<given-names>S. H.</given-names>
</name>
<name>
<surname>Chang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Ebong</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Bhadviya</surname>
<given-names>B. B.</given-names>
</name>
<name>
<surname>Mazumder</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Nanoscale Memristor Device as Synapse in Neuromorphic Systems</article-title>. <source>Nano Lett.</source> <volume>10</volume> (<issue>4</issue>), <fpage>1297</fpage>&#x2013;<lpage>1301</lpage>. <pub-id pub-id-type="doi">10.1021/nl904092h</pub-id> </citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kaneko</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Nishitani</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ueda</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Ferroelectric Artificial Synapses for Recognition of a Multishaded Image</article-title>. <source>IEEE Trans. Electron Devices</source> <volume>61</volume> (<issue>8</issue>), <fpage>2827</fpage>&#x2013;<lpage>2833</lpage>. <pub-id pub-id-type="doi">10.1109/ted.2014.2331707</pub-id> </citation>
</ref>
<ref id="B26">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Kim</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ishii</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Lewis</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Perri</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>BrightSky</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>2015</year>). &#x201c;<article-title>NVM Neuromorphic Core with 64k-Cell (256-by-256) Phase Change Memory Synaptic Array with On-Chip Neuron Circuits for Continuous <italic>In-Situ</italic> Learning</article-title>,&#x201d; in <conf-name>2015 IEEE international electron devices meeting (IEDM)</conf-name>, <conf-loc>Washington, DC, USA</conf-loc>, <conf-date>7-9 Dec. 2015</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>17.1. 1</fpage>&#x2013;<lpage>17.1. 4</lpage>. <pub-id pub-id-type="doi">10.1109/iedm.2015.7409716</pub-id> </citation>
</ref>
<ref id="B27">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Kim</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2012</year>). &#x201c;<article-title>A Digital Neuromorphic VLSI Architecture with Memristor Crossbar Synaptic Array for Machine Learning</article-title>,&#x201d; in <conf-name>2012 IEEE International SOC Conference</conf-name>, <conf-loc>Niagara Falls, NY, USA</conf-loc>, <conf-date>12-14 Sept. 2012</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>328</fpage>&#x2013;<lpage>333</lpage>. </citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lin</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Three-dimensional Memristor Circuits as Complex Neural Networks</article-title>. <source>Nat. Electron</source> <volume>3</volume> (<issue>4</issue>), <fpage>225</fpage>&#x2013;<lpage>232</lpage>. <pub-id pub-id-type="doi">10.1038/s41928-020-0397-9</pub-id> </citation>
</ref>
<ref id="B29">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Strachan</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Rescuing Memristor-Based Neuromorphic Design with High Defects</article-title>,&#x201d; in <conf-name>2017 54th ACM/EDAC/IEEE Design Automation Conference (DAC)</conf-name>, <conf-loc>Austin, TX, USA</conf-loc>, <conf-date>18-22 June 2017</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1145/3061639.3062310</pub-id> </citation>
</ref>
<ref id="B30">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Gruteser</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Edge Assisted Real-Time Object Detection for Mobile Augmented Reality</article-title>,&#x201d; in <conf-name>The 25th Annual International Conference on Mobile Computing and Networking</conf-name>, <conf-loc>Los Cabos, Mexico</conf-loc>, <conf-date>October 21&#x2013;25, 2019</conf-date>, <fpage>1</fpage>&#x2013;<lpage>16</lpage>. <pub-id pub-id-type="doi">10.1145/3300061.3300116</pub-id> </citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>You</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Kuang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Duan</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Efficient March Test Algorithm for 1T1R Cross&#x2010;bar with Complete Fault Coverage</article-title>. <source>Electron. Lett.</source> <volume>52</volume> (<issue>18</issue>), <fpage>1520</fpage>&#x2013;<lpage>1522</lpage>. <pub-id pub-id-type="doi">10.1049/el.2016.1693</pub-id> </citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Fardad</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Varshney</surname>
<given-names>P. K.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A Memristor-Based Optimization Framework for Artificial Intelligence Applications</article-title>. <source>IEEE Circuits Syst. Mag.</source> <volume>18</volume> (<issue>1</issue>), <fpage>29</fpage>&#x2013;<lpage>44</lpage>. <pub-id pub-id-type="doi">10.1109/mcas.2017.2785421</pub-id> </citation>
</ref>
<ref id="B33">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Aafer</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>W-C.</given-names>
</name>
<name>
<surname>Zhai</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Trojaning Attack on Neural Networks</article-title>,&#x201d; in <conf-name>Conference: Network and Distributed System Security Symposium</conf-name>, <conf-loc>San Diego, CA, United States</conf-loc>, <conf-date>February 26&#x2013;March 1, 2017</conf-date>. <pub-id pub-id-type="doi">10.14722/ndss.2018.23300</pub-id> </citation>
</ref>
<ref id="B34">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Fault Injection Attack on Deep Neural Network</article-title>,&#x201d; in <conf-name>2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)</conf-name>, <conf-loc>Irvine, CA, USA</conf-loc>, <conf-date>13-16 Nov. 2017</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>131</fpage>&#x2013;<lpage>138</lpage>. <pub-id pub-id-type="doi">10.1109/iccad.2017.8203770</pub-id> </citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lv</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Banerjee</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>2015</year>). <article-title>Evolution of Conductive Filament and its Impact on Reliability Issues in Oxide-Electrolyte Based Resistive Random Access Memory</article-title>. <source>Sci. Rep.</source> <volume>5</volume> (<issue>1</issue>), <fpage>7764</fpage>&#x2013;<lpage>7766</lpage>. <pub-id pub-id-type="doi">10.1038/srep07764</pub-id> </citation>
</ref>
<ref id="B36">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Lv</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>VADER: Leveraging the Natural Variation of Hardware to Enhance Adversarial Attack</article-title>,&#x201d; in <conf-name>2021 26th Asia and South Pacific Design Automation Conference (ASP-DAC)</conf-name>, <conf-loc>Tokyo, Japan</conf-loc>, <conf-date>18-21 Jan. 2021</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>487</fpage>&#x2013;<lpage>492</lpage>. </citation>
</ref>
<ref id="B37">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Madry</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Makelov</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Schmidt</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Tsipras</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Vladu</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Towards Deep Learning Models Resistant to Adversarial Attacks</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/1706.06083">https://arxiv.org/abs/1706.06083</ext-link>
</comment>. </citation>
</ref>
<ref id="B38">
<citation citation-type="web">
<collab>M. A. E. Challenge</collab>(<year>2017</year>). <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://github.com/MadryLab/mnist_challenge#mnist-adversarial-examples-challenge">https://github.com/MadryLab/mnist_challenge&#x23;mnist-adversarial-examples-challenge</ext-link>
</comment>.</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mohammadi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Al-Fuqaha</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Sorour</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Guizani</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Deep Learning for IoT Big Data and Streaming Analytics: A Survey</article-title>. <source>IEEE Commun. Surv. Tutorials</source> <volume>20</volume> (<issue>4</issue>), <fpage>2923</fpage>&#x2013;<lpage>2960</lpage>. <pub-id pub-id-type="doi">10.1109/comst.2018.2844341</pub-id> </citation>
</ref>
<ref id="B40">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>M&#xfc;nch</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Bishnoi</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Tahoori</surname>
<given-names>M. B.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Reliable In-Memory Neuromorphic Computing Using Spintronics</article-title>,&#x201d; in <conf-name>Proceedings of the 24th Asia and South Pacific Design Automation Conference</conf-name>, <conf-loc>Tokyo Odaiba Waterfront</conf-loc>, <conf-date>January 21&#x2013;24, 2019</conf-date>, <fpage>230</fpage>&#x2013;<lpage>236</lpage>. </citation>
</ref>
<ref id="B41">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Papernot</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>McDaniel</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Goodfellow</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Jha</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Celik</surname>
<given-names>Z. B.</given-names>
</name>
<name>
<surname>Swami</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Practical Black-Box Attacks against Machine Learning</article-title>,&#x201d; in <conf-name>Proceedings of the 2017 ACM on Asia conference on computer and communications security</conf-name>, <conf-loc>San Jose, CA, United States</conf-loc>, <conf-date>May 22&#x2013;26, 2017</conf-date>, <fpage>506</fpage>&#x2013;<lpage>519</lpage>. <pub-id pub-id-type="doi">10.1145/3052973.3053009</pub-id> </citation>
</ref>
<ref id="B42">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Papernot</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>McDaniel</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Jha</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Swami</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>Distillation as a Defense to Adversarial Perturbations against Deep Neural Networks</article-title>,&#x201d; in <conf-name>2016 IEEE symposium on security and privacy (SP)</conf-name>, <conf-loc>San Jose, CA, USA</conf-loc>, <conf-date>22-26 May 2016</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>582</fpage>&#x2013;<lpage>597</lpage>. <pub-id pub-id-type="doi">10.1109/sp.2016.41</pub-id> </citation>
</ref>
<ref id="B43">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Prezioso</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kataeva</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Merrikh-Bayat</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Hoskins</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Adam</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Sota</surname>
<given-names>T.</given-names>
</name>
<etal/>
</person-group> (<year>2015</year>). &#x201c;<article-title>Modeling and Implementation of Firing-Rate Neuromorphic-Network Classifiers with Bilayer Pt/Al2O3/TiO2&#x2212; x/Pt Memristors</article-title>,&#x201d; in <conf-name>2015 IEEE International Electron Devices Meeting (IEDM)</conf-name>, <conf-loc>Washington, DC, USA</conf-loc>, <conf-date>7-9 Dec. 2015</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>17.4. 1</fpage>&#x2013;<lpage>17.4. 4</lpage>. <pub-id pub-id-type="doi">10.1109/iedm.2015.7409719</pub-id> </citation>
</ref>
<ref id="B44">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Rakin</surname>
<given-names>A. S.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Tbt: Targeted Neural Network Attack with Bit Trojan</article-title>,&#x201d; in <conf-name>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</conf-name>, <conf-loc>Seattle, WA, USA</conf-loc>, <conf-date>13-19 June 2020</conf-date>, <fpage>13198</fpage>&#x2013;<lpage>13207</lpage>. <pub-id pub-id-type="doi">10.1109/cvpr42600.2020.01321</pub-id> </citation>
</ref>
<ref id="B45">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rakin</surname>
<given-names>A. S.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Yao</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Chakrabarti</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>T-bfa: Targeted Bit-Flip Adversarial Weight Attack</article-title>. <source>IEEE Trans. Pattern Analysis Mach. Intell</source>. <pub-id pub-id-type="doi">10.1109/TPAMI.2021.3112932</pub-id> </citation>
</ref>
<ref id="B46">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Singh</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Diware</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Gebregiorgis</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bishnoi</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Catthoor</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Joshi</surname>
<given-names>R. V.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). &#x201c;<article-title>Low-power Memristor-Based Computing for Edge-AI Applications</article-title>,&#x201d; in <conf-name>2021 IEEE International Symposium on Circuits and Systems (ISCAS)</conf-name>, <conf-loc>Daegu, Korea</conf-loc>, <conf-date>22-28 May 2021</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>5</lpage>. <pub-id pub-id-type="doi">10.1109/iscas51556.2021.9401226</pub-id> </citation>
</ref>
<ref id="B47">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Temam</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2012</year>). &#x201c;<article-title>A Defect-Tolerant Accelerator for Emerging High-Performance Applications</article-title>,&#x201d; in <conf-name>2012 39th Annual International Symposium on Computer Architecture (ISCA)9-13 June 2012</conf-name>, <conf-loc>Portland, OR, USA</conf-loc> (<publisher-name>IEEE</publisher-name>), <fpage>356</fpage>&#x2013;<lpage>367</lpage>. <pub-id pub-id-type="doi">10.1145/2366231.2337200</pub-id> </citation>
</ref>
<ref id="B48">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tunali</surname>
<given-names>O.</given-names>
</name>
<name>
<surname>Altun</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Permanent and Transient Fault Tolerance for Reconfigurable Nano-Crossbar Arrays</article-title>. <source>IEEE Trans. Computer-Aided Des. Integr. Circuits Syst.</source> <volume>36</volume> (<issue>5</issue>), <fpage>747</fpage>&#x2013;<lpage>760</lpage>. </citation>
</ref>
<ref id="B49">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Yao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Shan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Viswanath</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). &#x201c;<article-title>Neural Cleanse: Identifying and Mitigating Backdoor Attacks in Neural Networks</article-title>,&#x201d; in <conf-name>2019 IEEE Symposium on Security and Privacy (SP)</conf-name>, <conf-loc>San Francisco, CA, USA</conf-loc>, <conf-date>19-23 May 2019</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>707</fpage>&#x2013;<lpage>723</lpage>. <pub-id pub-id-type="doi">10.1109/sp.2019.00031</pub-id> </citation>
</ref>
<ref id="B50">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>M.-C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>J.-Y.</given-names>
</name>
<name>
<surname>Ting</surname>
<given-names>Y.-H.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>C.-Y.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>W.-W.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A Novel High-Performance and Energy-Efficient RRAM Device with Multi-Functional Conducting Nanofilaments</article-title>. <source>Nano Energy</source> <volume>82</volume>, <fpage>105717</fpage>. <pub-id pub-id-type="doi">10.1016/j.nanoen.2020.105717</pub-id> </citation>
</ref>
<ref id="B51">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Huangfu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yin</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chakrabarty</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2017</year>). <article-title>Stuck-at Fault Tolerance in RRAM Computing Systems</article-title>. <source>IEEE J. Emerg. Sel. Top. Circuits Syst.</source> <volume>8</volume> (<issue>1</issue>), <fpage>102</fpage>&#x2013;<lpage>115</lpage>. </citation>
</ref>
<ref id="B52">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ning</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chakrabarty</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Fault-tolerant Training Enabled by On-Line Fault Detection for RRAM-Based Neural Computing Systems</article-title>. <source>IEEE Trans. Computer-Aided Des. Integr. Circuits Syst.</source> <volume>38</volume> (<issue>9</issue>), <fpage>1611</fpage>&#x2013;<lpage>1624</lpage>. </citation>
</ref>
<ref id="B53">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yao</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Fully Hardware-Implemented Memristor Convolutional Neural Network</article-title>. <source>Nature</source> <volume>577</volume> (<issue>7792</issue>), <fpage>641</fpage>&#x2013;<lpage>646</lpage>. <pub-id pub-id-type="doi">10.1038/s41586-020-1942-4</pub-id> </citation>
</ref>
<ref id="B54">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yeo</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Chu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gi</surname>
<given-names>S.-G.</given-names>
</name>
<name>
<surname>Hwang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>B.-G.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Stuck-at-fault Tolerant Schemes for Memristor Crossbar Array-Based Neural Networks</article-title>. <source>IEEE Trans. Electron Devices</source> <volume>66</volume> (<issue>7</issue>), <fpage>2937</fpage>&#x2013;<lpage>2945</lpage>. <pub-id pub-id-type="doi">10.1109/ted.2019.2914460</pub-id> </citation>
</ref>
<ref id="B55">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Yu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>P.-Y.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2015</year>). &#x201c;<article-title>Scaling-up Resistive Synaptic Arrays for Neuro-Inspired Architecture: Challenges and Prospect</article-title>,&#x201d; in <conf-name>2015 IEEE International Electron Devices Meeting (IEDM)</conf-name>, <conf-loc>Washington, DC, USA</conf-loc>, <conf-date>7-9 Dec. 2015</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>17.3. 1</fpage>&#x2013;<lpage>17.3. 4</lpage>. <pub-id pub-id-type="doi">10.1109/iedm.2015.7409718</pub-id> </citation>
</ref>
<ref id="B56">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Chowdhery</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bahl</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Jamieson</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Banerjee</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2015</year>). &#x201c;<article-title>The Design and Implementation of a Wireless Video Surveillance System</article-title>,&#x201d; in <conf-name>Proceedings of the 21st Annual International Conference on Mobile Computing and Networking</conf-name>, <conf-loc>New York, NY, United States</conf-loc>, <conf-date>September 7&#x2013;11, 2015</conf-date>, <fpage>426</fpage>&#x2013;<lpage>438</lpage>. <pub-id pub-id-type="doi">10.1145/2789168.2790123</pub-id> </citation>
</ref>
<ref id="B57">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Zeng</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Edge Intelligence: Paving the Last Mile of Artificial Intelligence with Edge Computing</article-title>. <source>Proc. IEEE</source> <volume>107</volume> (<issue>8</issue>), <fpage>1738</fpage>&#x2013;<lpage>1762</lpage>. <pub-id pub-id-type="doi">10.1109/jproc.2019.2918951</pub-id> </citation>
</ref>
</ref-list>
</back>
</article>