<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Research on Visual Malicious Code Classification Based on Improved Faster R-CNN</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Liang</forename><surname>Zhen</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">College of Information Science and Engineering</orgName>
								<orgName type="institution">Shenyang Ligong University</orgName>
								<address>
									<postCode>110159</postCode>
									<settlement>Liaoning Shenyang</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<author role="corresp">
							<persName><forename type="first">Yuntao</forename><surname>Zhao</surname></persName>
							<email>zhaoyuntao2014@163.com</email>
							<affiliation key="aff0">
								<orgName type="department">College of Information Science and Engineering</orgName>
								<orgName type="institution">Shenyang Ligong University</orgName>
								<address>
									<postCode>110159</postCode>
									<settlement>Liaoning Shenyang</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff1">
								<orgName type="department">International Conference on Computer and Information Processing Technology</orgName>
								<address>
									<addrLine>August 5-7</addrLine>
									<postCode>2022</postCode>
									<settlement>Shenyang</settlement>
									<country key="CN">China</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Research on Visual Malicious Code Classification Based on Improved Faster R-CNN</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">F4AD99B15FEF40A797235DAD42550955</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T18:58+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>1 Malicious code visualization</term>
					<term>Rank &amp; Sort loss</term>
					<term>Faster R-CNN network</term>
					<term>object detection</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>With the development of Internet technology, the number of malicious software is increasing and malicious attacks are becoming rampant. Therefore, the research on malicious software has a great application prospect. This paper proposes a visual malicious code classification method based on improved Faster R-CNN. Rank &amp; Sort Loss is used to optimize the loss function of the Faster R-CNN model, in order to reduce the number of hyperparameters, improve the performance of the model, and make it more robust to the problem of class imbalance in training. The experimental results show that using the improved Faster R-CNN detection method has a further improvement in the recognition accuracy of malicious code grayscale images compared with the classic Faster R-CNN detection method.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>In 2020, according to the detection and dissemination of malicious programs by CNCERT / CC (National Internet Emergency Center), more than 42.98 million samples of malicious programs were found in the whole year. According to the above report, malicious code has great harm. Based on the above situation, it is of great significance to study malicious code. At this stage, there have been many researches on malicious code analysis and detection methods. In 2011, L.Nataraj et al. proposed a malicious code visualization method and classification method, which converts binary data files of malicious code into texture images, and classifies malicious software through KNN model and Euclidean distance <ref type="bibr" target="#b1">[2]</ref>. Through experimental demonstration, this method can effectively improve the detection speed of malicious code, and also ensure the accuracy level of traditional static detection methods. On this basis, many researchers have begun to try to use the detection and classification method based on malicious code image to train the appropriate malicious code classifier. For example, Zhang Jinglian et al. proposed a malicious code classification technology based on feature fusion, which extracts and fuses the features by extracting the opcode instructions and grayscale image texture of malicious code, and uses Random Forest (RF) to classify the malicious code families <ref type="bibr" target="#b2">[3]</ref>. The above methods all visualize the malicious code, convert the malicious code into a grayscale image for further classification, and achieve good results.</p><p>With the application of Convolutional Neural Network (CNN) in object detection, more and more researchers have put forward a series of achievements. For example, Ross B. Girshick proposed the Faster R-CNN network <ref type="bibr" target="#b5">[5]</ref>. For target detection in grayscale images of malicious code, we need to detect the position of the section (.text) where the core feature opcodes are located in the grayscale image. The loss of the traditional Faster R-CNN model is composed of two parts: classification loss and regression loss. During the training process, many hyperparameters will be generated, which requires human and material resources to adjust the parameters. At the same time, the imbalance of data distribution will also affect the detection effect of the model. Therefore, this paper optimizes the loss function for the above problems, and introduces Rank &amp; Sort Loss to achieve better detection results.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related Work 2.1. Research on Malicious Code Visualization</head><p>Static disassembly of malicious code to achieve the visualization of malicious code. IDA Pro is used for static disassembly, by importing malicious software into IDA Pro to get malicious code binary file (.bytes file) and assembly file (.asm file).On this basis, the obtained binary executable file is used as input data, and regard it as the original Bytes binary stream. A hexadecimal number can be considered as a combination of binary number, and four binary numbers can be converted to a hexadecimal number. Because the range of hexadecimal number is only between 0 and 16, which corresponds to two hexadecimal numbers of 256 pixel value of grayscale image, this method can convert the original data into a simple gray image. The sequence of binary streams corresponding to the gray level of each 8-bit pixel is segmented and then arranged into a sequence to form the corresponding grayscale image. Figure <ref type="figure" target="#fig_0">1</ref> shows the schematic diagram of malicious code visualization.   </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Faster R-CNN Network Model</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">Rank &amp; Sort Loss</head><p>Rank &amp; Sort (RS) Loss <ref type="bibr" target="#b8">[8]</ref> was proposed by K. Oksuz et al in 2021. Rank &amp; Sort Loss is composed of Rank loss and Sort loss. Rank loss enables all positive samples to be sorted before negative samples, and only the negative samples with higher scores are selected for calculation. Sort loss uses IoU as the classification label, so that the positive samples in the prediction box can be sorted by continuous values as the label. Besides, Rank &amp; Sort Loss does not require multi-task weight or coefficient adjustment. The definition of the loss function is shown in formula <ref type="bibr" target="#b0">(1)</ref>:</p><formula xml:id="formula_0">𝐿 𝑅𝑆 = 1 |𝑃| ∑ (𝑙 𝑅𝑆 (𝑖) − 𝑙 𝑅𝑆 * (𝑖)) 𝑖∈𝑃 (<label>1</label></formula><formula xml:id="formula_1">)</formula><p>Where P is the collection of positive sample, 𝑙 𝑅𝑆 (𝑖) is the sum of rank error and sort error at this time, 𝑙 𝑅𝑆 * (𝑖) is the sum of the target rank error and the target sort error, using equations ( <ref type="formula" target="#formula_2">2</ref>) and ( <ref type="formula" target="#formula_3">3</ref>) respectively express:</p><formula xml:id="formula_2">𝑙 𝑅𝑆 (𝑖) = 𝑟𝑎𝑛𝑘 − (𝑖) 𝑟𝑎𝑛𝑘(𝑖) + ∑ 𝐻(𝑥 𝑖𝑗 )(1−𝑦 𝑗 ) 𝑗∈𝑃 𝑟𝑎𝑛𝑘 + (𝑖)<label>(2)</label></formula><formula xml:id="formula_3">𝑙 𝑅𝑆 * (𝑖) = 𝑙 𝑅 * (𝑖) + ∑ 𝐻(𝑥 𝑖𝑗 )[𝑦 𝑗 ≥𝑦 𝑖 ](1−𝑦 𝑗 ) 𝑗∈𝑃 ∑ 𝐻(𝑥 𝑖𝑗 )[𝑦 𝑗 ≥𝑦 𝑖 ] 𝑗∈𝑃<label>(3)</label></formula><p>Where 𝑖 and 𝑗 are the sample numbers, 𝑦 is the score label, and 𝑟𝑎𝑛𝑘(𝑖) is the number of all positive samples and negative samples that are greater than or equal to the positive sample's classification score; 𝑟𝑎𝑛𝑘 − (𝑖) is the number of all negative samples that is greater than or equal to the positive sample's classification score; 𝑟𝑎𝑛𝑘 + (𝑖) is the number of all positive samples that is greater than or equal to the positive sample's classification score, 𝑥 𝑖𝑗 is the classification score, 𝐻(𝑥) is the unit step function, 𝑙 𝑅 * (𝑖) is the target rank error.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Task Description</head><p>The training process for the whole network mainly includes the following steps: convolution channel number is 18, which is used to predict whether each prediction box contains an object, and the other convolution channel number is 36, which is used to adjust the prior box, get a suggestion box. Then, the classification and regression are carried out through the ROIPooling layer. The improved method is to replace the cross entropy loss in the classification loss with the RS loss, and the regression loss adopts the GIoU loss. The weighted parameter of the regression loss of the improved model is the RS loss divided by the regression loss.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Experimental Process and Analysis 4.1. Experimental Data Set</head><p>This experiment selects malicious sample data from the Kaggle platform of the Microsoft Malware Security Defense Center. There are 1839 samples from 6 malicious code sample families, as shown in Table <ref type="table" target="#tab_1">1</ref>.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Experimental Environment</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Analysis of Experimental Results</head><p>In the experiment, the data were randomly divided into training set and test set according to 8:2. The accuracy rate and recall rate are selected as the evaluation criteria. Table <ref type="table" target="#tab_3">3</ref> shows the accuracy rate and recall rate of each class of the traditional machine learning classifier, the traditional Faster R-CNN network framework and the improved Faster R-CNN network framework. The experimental results show that the Faster R-CNN network model is better than the traditional machine learning classification model, and the improved Faster R-CNN network model is further improved on the basis of the traditional Faster R-CNN network model. After the introduction of RS Loss, the accuracy of the model is increased by 1.9 percentage points compared with the original model. At the same time, the complexity of the model is measured by Floating point Operations (FLOPs) and Parameters. The results show that the amount of Parameters of the model is reduced by 15.37% compared with the original model, and the amount of FLOPs is reduced by 23.58%.It shows that the introduction of RS loss can greatly reduce the amount of parameters and effectively reduce the complexity of the model.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion</head><p>In order to further improve the detection and classification effect of malicious code, this paper proposes a malicious code classification model based on improved Faster R-CNN. The method of using Rank &amp; Sort loss function effectively reduces the number of hyperparameters. In the process of model training, there is no need to repeatedly adjust the hyperparameters. We only need to adjust the learning rate to improve the model performance, avoiding the complex parameter adjustment process and one loss dominant situation. The experimental results show that the model is more feasible and effective. In the following work, the detection ability of the model can be further improved by adding Attention Mechanism and Data Augmentation.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Visualization of malicious code</figDesc><graphic coords="2,164.38,285.97,280.73,159.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head></head><label></label><figDesc>Faster R-CNN is a deep learning network model based on region proposal network. The function of target positioning is added on basis of the CNN network model. Compared with the RCNN and Fast R-CNN detection networks, the Faster R-CNN network implements an end-to-end network training mode, so that the CNN for generating the proposal window and the CNN for object detection share operations. The structure of Fast R-CNN mainly includes backbone extraction network, RPN region proposal network, region of interest pooling layer and classifier. The Faster R-CNN network first processes the pictures, obtains the common feature layer, and then obtains the suggestion frame, then uses the suggestion frame to intercept the common feature layer, and adjusts some feature layers after the interception to the same size through the ROI pooling layer, and finally Perform classification and regression. The network structure is shown in Figure2.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Faster R-CNN network structure</figDesc><graphic coords="2,194.52,631.47,220.02,96.35" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: inspection effect diagram</figDesc><graphic coords="5,232.18,72.00,131.00,164.95" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head></head><label></label><figDesc>1. Convert the malicious code into a grayscale image dataset and preprocess the dataset. The first step is to use the disassembly tool IDA Pro to disassemble, turn the program used for detection into a binary file, and map it into a corresponding grayscale image through visualization. Modify the label names to the labels of 6 types of malicious code images. 2. Feature extraction is performed on the input image through the backbone extraction network. In this paper, ResNet50 is used as the backbone extraction network. ResNet50 has two basic blocks, Conv Block and Identity Block. The main difference between the two is that Conv Block performs convolution operations on the residual edge, while Identity Block does not perform convolution. ResNet50 contains 1 Conv Block, and the number of Identity Blocks is 3, 4, 6, and 3, respectively. 3. The features output by the backbone extraction network are sent to the proposal box, where one</figDesc><table /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 1</head><label>1</label><figDesc></figDesc><table><row><cell>Malicious sample data</cell><cell></cell><cell></cell></row><row><cell>Malicious code</cell><cell>Number</cell><cell>Type</cell></row><row><cell>family name</cell><cell>of training</cell><cell></cell></row><row><cell></cell><cell>samples</cell><cell></cell></row><row><cell>Ramnit</cell><cell>354</cell><cell>Worm</cell></row><row><cell>Vundo</cell><cell>278</cell><cell>Trojan</cell></row><row><cell>Tracur</cell><cell>295</cell><cell>Trojan</cell></row><row><cell>Gatak</cell><cell>243</cell><cell>back door</cell></row><row><cell>Obfuscator.ACY</cell><cell>400</cell><cell>malicious</cell></row><row><cell></cell><cell></cell><cell>advertisement</cell></row><row><cell>Lollipop</cell><cell>269</cell><cell>malicious</cell></row><row><cell></cell><cell></cell><cell>advertisement</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 2</head><label>2</label><figDesc></figDesc><table><row><cell>Experimental environment</cell><cell></cell></row><row><cell>Experimental</cell><cell>Information</cell></row><row><cell>platform</cell><cell></cell></row><row><cell>Operating system</cell><cell>ubuntu16.04</cell></row><row><cell>Graphics card</cell><cell>RTX 2080Ti</cell></row><row><cell>Drive</cell><cell>Nvidia 430.34</cell></row><row><cell>CUDA</cell><cell>9.0</cell></row><row><cell>Language</cell><cell>Python 3.6</cell></row><row><cell>Framework</cell><cell>PyTorch</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_3"><head>Table 3</head><label>3</label><figDesc></figDesc><table><row><cell>Malicious sample data</cell><cell></cell><cell></cell></row><row><cell>Classification</cell><cell>Accuracy</cell><cell>Recall</cell></row><row><cell>method</cell><cell></cell><cell></cell></row><row><cell>KNN</cell><cell>0.611</cell><cell>0.427</cell></row><row><cell>RF</cell><cell>0.889</cell><cell>0.836</cell></row><row><cell>Faster R-CNN</cell><cell>0.894</cell><cell>0.877</cell></row><row><cell>RS+Faster R-CNN</cell><cell>0.913</cell><cell>0.895</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<author>
			<persName><surname>Cncert</surname></persName>
		</author>
		<idno>2021-07- 21</idno>
		<ptr target="．https://www.cert.org.cn/publish/main/upload/File/2020%20Annual%20Report.pdf" />
		<title level="m">China Internet network security report 2020</title>
				<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<title level="m" type="main">Malware Images: Visualization and Automatic Classification</title>
		<author>
			<persName><forename type="first">L</forename><surname>Nataraj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Karthikeyan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Jacob</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2011">2011</date>
			<publisher>ACM</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Research on malicious code classification based on feature fusion</title>
		<author>
			<persName><forename type="first">Zhang</forename><surname>Jinglian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Peng</forename><surname>Yanbing</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J</title>
		<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title/>
		<idno type="DOI">10.19678/j.issn.1000-3428.0051790</idno>
	</analytic>
	<monogr>
		<title level="j">Computer Engineering</title>
		<imprint>
			<biblScope unit="volume">45</biblScope>
			<biblScope unit="issue">08</biblScope>
			<biblScope unit="page" from="281" to="286" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Visualization and automatic classification of malicious code with enhanced information density</title>
		<author>
			<persName><forename type="first">Liu</forename><surname>Yashu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Wang</forename><surname>Zhihai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Hou</forename><surname>Yueran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Yan</forename><surname>Hanbing</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Tsinghua University (Natural Science Edition)</title>
		<imprint>
			<biblScope unit="volume">59</biblScope>
			<biblScope unit="issue">01</biblScope>
			<biblScope unit="page" from="9" to="14" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
	<note>J</note>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks</title>
		<author>
			<persName><forename type="first">S</forename><surname>Ren</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>He</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Girshick</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Pattern Analysis &amp; Machine Intelligence</title>
		<imprint>
			<biblScope unit="volume">39</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="1137" to="1149" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
	<note>J</note>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Deep neural network based malware detection using two dimensional binary program features</title>
		<author>
			<persName><forename type="first">J</forename><surname>Saxe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Berlin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">C]// International Conference on Malicious &amp; Unwanted Software</title>
				<imprint>
			<publisher>IEEE</publisher>
			<biblScope unit="page">2015</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Malicious File Hash Detection and Drive-by Download Attacks</title>
		<author>
			<persName><forename type="first">Ibrahim</forename><surname>Ghafir</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Vaclav</forename><surname>Prenosil</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J</title>
		<imprint>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Rank &amp; Sort Loss for Object Detection and Instance Segmentation</title>
		<author>
			<persName><forename type="first">Cam</forename><forename type="middle">B</forename><surname>Oksuz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Akbas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J</title>
		<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Lichuan Testing of malicious code detection method based on texture feature</title>
		<author>
			<persName><forename type="first">Wang</forename><surname>Yinglong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Liu</forename><surname>Huang Zuyuan</surname></persName>
		</author>
		<author>
			<persName><surname>Ailian</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J]. Mobile communication</title>
		<imprint>
			<biblScope unit="volume">41</biblScope>
			<biblScope unit="issue">13</biblScope>
			<biblScope unit="page" from="46" to="49" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<title level="m" type="main">C]// International Conference on Information &amp; Communication Technology for Competitive Strategies</title>
		<author>
			<persName><forename type="first">S</forename><surname>Kunwar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Sharma</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
	<note>Malware Analysis: Tools and Techniques</note>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Detecting Malware with an Ensemble Method Based onDeep Neural Network</title>
		<author>
			<persName><forename type="first">Jinpei</forename><surname>Yan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Yong</forename><surname>Qi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Qifan</forename><surname>Rao</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J</title>
		<imprint>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
