#引用
##LaTex
@INPROCEEDINGS{7162855,
author={M. Wang and S. Feng and C. Ouyang and Z. Li},
booktitle={The 27th Chinese Control and Decision Conference (2015 CCDC)},
title={RFID tag oriented data allocation method using artificial immune network},
year={2015},
volume={},
number={},
pages={5218-5223},
keywords={artificial immune systems;knapsack problems;matrix algebra;radiofrequency identification;DA-aiNet algorithms;RFID tag oriented data allocation;artificial immune network;correlation matrix;heuristic algorithm;memory capacity;nonlinear knapsack problem;optimization problem;radiofrequency identification;unexplained data off tag;Correlation;Immune system;Optimization;Radiofrequency identification;Resource management;Sociology;0–1 knapsack problem;Artificial immune network;Optimization;Tag data allocation},
doi={10.1109/CCDC.2015.7162855},
ISSN={1948-9439},
month={May},}
##Normal
M. Wang, S. Feng, C. Ouyang and Z. Li, “RFID tag oriented data allocation method using artificial immune network,” The 27th Chinese Control and Decision Conference (2015 CCDC), Qingdao, 2015, pp. 5218-5223.
doi: 10.1109/CCDC.2015.7162855
keywords: {artificial immune systems;knapsack problems;matrix algebra;radiofrequency identification;DA-aiNet algorithms;RFID tag oriented data allocation;artificial immune network;correlation matrix;heuristic algorithm;memory capacity;nonlinear knapsack problem;optimization problem;radiofrequency identification;unexplained data off tag;Correlation;Immune system;Optimization;Radiofrequency identification;Resource management;Sociology;0–1 knapsack problem;Artificial immune network;Optimization;Tag data allocation},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7162855&isnumber=7161655
#摘要
Radio frequency identification (RFID)
the patient data stored on RFID tag
only important data items can be allocated to a RFID tag with the limited memory
minimizing the total value of “unexplained” data off tag (TVUD)
- the memory capacity
- the correlation matrix
Artificial immune network
a nonlinear knapsack problem
#主要内容
all sampled data items set:
relationship between d i d_i di and d j d_j dj:
-
perfectly linear correlative — r i j 2 = 1 r_{ij}^2=1 rij2=1
-
independent — r i j 2 = 0 r_{ij}^2=0 rij2=0
-
the explained sum of squares (ESS)
-
the total sum of squares (TSS)
a 0/1 knapsack problem
the likelihood that the ith data item cannot be explained by any data item on the tag:
优化目标:
w i w_i wi:
- all w i w_i wi are equal to 4 bytes since each piece of information is modeled as a float point data type
- w i w_i wi are randomly determined in the interval [1,4]
- 本文 — a compact binary string + a data storage format (the data storage format identifier (DSFID))
###1 抗体表示
一个二进制串 — 长度为数据项个数
###2 适应值函数
###3 变异概率
###4 Suppression operator
相似度
###5 流程图
##试验