维普中文期刊产品整合服务
4篇 您的检索式:作者名="Hou Boxing"
    题名 作者 年代 出处 被引量
1Effect of High Pressure Homogenization Treatment on Structure and Properties of Soybean Residue Cellulose Nanofibers显示文摘To reduce the adverse effects of non-cellulose materials on subsequent homogenization,the effects of a high-pressure homogenization treatment on the structure and properties of cellulose nanofibers(CNF)prepared by acid treatment of soybean residue were studied.The effects of the number of homogenization step on the microfibrillation degree,crystalline structure and mechanical properties of the soybean residue were analyzed by SEM,FT-IR,XRD,TG and DTG.The results showed that an increase in the number of homogenization steps led to an increase in the degree of microfibrillation,a more uniform distribution of the CNF diameter,and an increase in the crystallinity of CNF.However,but when the number of homogenization steps exceeded 15,the rate of change decreased,and the crystallinity of CNF decreased.As the number of homogenization steps increased,the average degree of polymerization and average molecular weight of CNF decreased continuously,and after 15 homogenization steps,their rate of change also decreased.Therefore,15 steps of high-pressure homogenization represented a suitable number of steps to prepare the soybean residue CNF with an average diameter of 15 nm.Peiyi Li Yumeng Wang Binyao Zhou Qingqing Hou Hezhen Liu Haozhe Lei Boxing Jian Xinping Li 2019Paper And Biomaterials2019,4,4:4
2Rare tree provenance Fukiencypress显示文摘 Zheng Renhua Hou Boxing 1988News Report of Forestry Science and Technology1988,,7:1
3Adsorption behaviour of Tween80 on graphite显示文摘HOU Qingfen LU Xiancai HU Boxing 2005Adsorption Science and Technology2005,23,1:1
4A HEURISTIC FOR F3/bi= b/C_(max) AND ITSWORST-CASE ANALYSIS显示文摘This paper describes a heuristic for solving F3/bi = b/Cmax scheduling problem. This algorithm first uses the Johnson’s algorithm solving F2Cmax, then, presents revised algorithm to solve F3/bi = b/Cmax. Lastly, an O(n log n) time heuristic is presented which generates a schedule with length at most 3/2 times that of an optimal schedule, for even number n 4, and 3/2 + 1/(2n) times that of an optimal schedule, for odd number n 4. These bounds are tight.HOU Sixiang (China Marine Development and Research Cented Box 1303-17, Beijing 100073, China) DU Donglei (Institute of Applied Mathematics, Academia Sinica, Beijing 100080, China) 1997Systems Science and Mathematical Sciences1997,10,2:0
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费