期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
基于三维扫描技术陶瓷扁平制品表面积的测量方法 被引量:3
1
作者 徐大余 陈峰 +2 位作者 张侃 敖敏 戴亚鹏 《陶瓷学报》 CAS 北大核心 2019年第5期670-674,共5页
陶瓷扁平制品铅、镉迁移量的检测涉及到制品与食物模拟物接触面积的计算,此接触面积计算的精确度关系到检测结果的准确性。对一些圆形规则的扁平制品其表面积能够容易获得,但对一些不规则的扁平制品比如勺、筷类其表面积不容易通过常规... 陶瓷扁平制品铅、镉迁移量的检测涉及到制品与食物模拟物接触面积的计算,此接触面积计算的精确度关系到检测结果的准确性。对一些圆形规则的扁平制品其表面积能够容易获得,但对一些不规则的扁平制品比如勺、筷类其表面积不容易通过常规测量工具测得。本文以勺子为例,提出采用三维扫描技术测量其表面积,通过对勺子制品的三维扫描建立三维模型,然后通过软件Artec Studio对三维模型进行数据计算,从而获得勺子表面积,该计算结果精确可靠。通过本文研究,为不规则陶瓷扁平制品的表面积提供了一种可行的测量方法。 展开更多
关键词 陶瓷扁平制品 表面积测量 三维扫描技术 铅镉迁移量
下载PDF
Synthesis and Structural Characterization of {[Mn(phen)_2(OAc)(H_2O)]ClO_4}_2H_2O 被引量:1
2
作者 ZHANGXiao-Feng chenfeng 《Chinese Journal of Structural Chemistry》 SCIE CAS CSCD 北大核心 2003年第2期151-154,共4页
The crystal structure of the title compound {[Mn(phen)2(OAc)(H2O)]ClO4}2H2O (phen = 1,10-phenanthroline) has been synthesized and determined by X-ray diffraction. The crystal is of triclinic, space group P?with a = 12... The crystal structure of the title compound {[Mn(phen)2(OAc)(H2O)]ClO4}2H2O (phen = 1,10-phenanthroline) has been synthesized and determined by X-ray diffraction. The crystal is of triclinic, space group P?with a = 12.7955(4), b = 15.0544(4), c = 16.2183(4) , ?= 64.479(1), b =67.526(1), g = 83.582(1), C52H40Cl2Mn2N8O15, Mr = 1197.70, V = 2600.1(1) ?, Dc = 1.530 g/cm3, F(000) = 1224, = 0.666 cm-1 and Z = 2. The final refinement gave R = 0.0691 and wR = 0.1821 for 6131 observed reflections with I > 2s(I). The cell of the complex contains two uniform mono-manganese molecules [Mn(phen)2(OAc)(H2O)]ClO4 and a solvate water molecule. Four nitrogen atoms from two chelating phenanthroline ligands and one oxygen atom from acetate ligate to the MnⅡ ion, forming a distorted octahedral geometry together with one coordinated water molecule. One ClO4- anion and one water molecule exist outside the cation [Mn(phen)2(OAc)- (H2O)]+ as a counter ion and solvate molecule, respectively. 展开更多
关键词 manganese crystal structure SYNTHESIS 1 10-PHENANTHROLINE acetato
下载PDF
野生食用植物资源的开发利用现状及前景分析 被引量:3
3
作者 陈锋 于翠翠 《现代食品》 2018年第19期32-34,共3页
21世纪以来,野生食用植物资源的开发利用问题成为绿色食品开发的重要关键。本文在阐述国内外关于野生食用植物资源定义的基础上,分析野生食用植物资源的特点,并为如何优化野生食用植物资源的开发和利用进行策略分析。
关键词 野生食用植物资源 开发利用 现状 前景
下载PDF
A study of specific interaction of the transcription factor and the DNA element by atomic force microscopy 被引量:4
4
作者 QINFeng JIANGYaxin +4 位作者 MAXinyong chenfeng FANGXiaohong BAIChunli LIYiqin 《Chinese Science Bulletin》 SCIE EI CAS 2004年第13期1376-1380,共5页
Atomic force microscopy (AFM) was employed to quantitatively detect the interaction between a transcription factor, ZmDREBIA, and its target DNA sequence (DRE).The specificity of the interaction was revealed by compar... Atomic force microscopy (AFM) was employed to quantitatively detect the interaction between a transcription factor, ZmDREBIA, and its target DNA sequence (DRE).The specificity of the interaction was revealed by comparing the binding probability of ZmDREBIA to DRE element with core sequence ACCGAC and to the ERE element with core sequence AGCCGCC. Moreover, the single-molecular unbinding force between ZmDREBIA and DRE element was determined using Poisson statistical method to be 99±9 pN.The results indicated that AFM could serve as a sensitive and reliable technique to probe the interaction properties of the transcription factor and DNA element at single-molecular level, thus indicating that AFM is advantageous over the traditional methods, such as the electrophoretic mobility shift assay, regarding to the functional analysis of transcription factors. 展开更多
关键词 转录因子 DNA 原子增强显微镜方法 AFM ZmDREBIA 转基因作物 玉米
原文传递
SEMI-DEFINITE RELAXATION ALGORITHM FOR SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES
5
作者 chenfeng ZHANGLIANSHENG 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 2005年第1期153-158,共6页
The authors present a semi-definite relaxation algorithm for the scheduling problem with controllable times on a single machine. Their approach shows how to relate this problem with the maximum vertex-cover problem wi... The authors present a semi-definite relaxation algorithm for the scheduling problem with controllable times on a single machine. Their approach shows how to relate this problem with the maximum vertex-cover problem with kernel constraints (MKVC).The established relationship enables to transfer the approximate solutions of MKVCinto the approximate solutions for the scheduling problem. Then, they show how to obtain an integer approximate solution for MKVC based on the semi-definite relaxation and randomized rounding technique. 展开更多
关键词 时序问题 时间控制 半定规划 近似算法 最小组合优化
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部