高效液相色谱-串联质谱法测定玩具中双酚A的迁移量

来源 :2018年第十五届全国青年分析测试学术报告会 | 被引量 : 0次 | 上传用户:shengli1011
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  建立了测定玩具中双酚A迁移量的高效液相色谱-串联质谱(HPLC-MS/MS)方法.改进了欧盟玩具安全标准EN 71-10:2005以水为模拟液的迁移条件,提出了迁移后模拟液经混合纤维素酯(MCE)过滤器过滤后直接由HPLC-MS/MS分析的方法.研究了不同材质针式过滤器对双酚A的影响.结果 表明,聚酰胺(PA、尼龙66)和聚醚砜(PES)过滤器会导致双酚A大量损失,而MCE过滤器对双酚A的回收率最高(>90%).该方法在2~100 μg·L-1范围内呈良好线性关系,相关系数(r2)大于0.999,方法检出限(LOD)为0.30~0.52 μg·L-1,定量下限(LOQ)为1.00~1.72 μg·L-1,加标回收率为96.5%~106%,相对标准偏差(RSD,n=7)为2.0%~8.6%.该法可满足欧盟指令(Eu)2017/898中双酚A迁移限量(0.04 mg·L-1)的要求,且避免了因过滤器选择不当导致的双酚A损失,具有较好的实际意义.
其他文献
  Previous causal inference literature often required no interference among units,that is,the potential outcomes of a unit do not depend on the treatments of
会议
  This is a joint work with Marcelo Viana.We formulate a version of the Avila-Viana Invariance Principle for diffeomorphism cocycles that are not necessary do
会议
  This talk concerns three components in simulating multiphase flows with high accuracy and efficiency.First,I will present a fourth-order projection method f
会议
  We consider an ordinary differential equation(a Knizhnik-Zamolodchikov type equation)with a pole of order two.It turns out that the Stokes factors at this p
会议
  Big data are often contaminated by outliers and heavy-tailed errors,which are also a stylized feature of high-dimensional data.To address this challenge,we
会议
  The study of rigidity phenomenon for group actions is one of the central themes in dynamics.There is a growing interest in recent years for "irreducible" hi
会议
  Let S be a closed orientable surface of genus at least 2,and let G be a semisimple Lie group of non-compact type.Positively ratioed representations are Anos
会议
  Recently Eskin-Kontsevich-Moller-Zorich prove my conjecture that the sum of the top k Lyapunov exponents is always greater or equal to the degree of any ran
会议
  In a joint work with Qingtao Chen,we conjecture that at the root of unity exp(2πi/r)instead of the usually considered root exp(πi/r),the Turaev-Viro and t
会议
  In this talk,I will introduce existing primal-dual algorithms for minimizing f(x)+g(x)+h(Lx),where f is convex and Lipschitz differentiable,g and h are conv
会议