A novel chitinolytic and chitosanolytic bacterium, Sphingomonas sp. CJ-5, has been isolated and characterized. It secretes both chitinase and chitosanase into surrounding medium in response to chitin or chitosan induc...A novel chitinolytic and chitosanolytic bacterium, Sphingomonas sp. CJ-5, has been isolated and characterized. It secretes both chitinase and chitosanase into surrounding medium in response to chitin or chitosan induction. To characterize the enzymes, both chitinase and chitosanase were purified by ammonium sulfate precipitation, Sephadex G-200 gel filtration and DEAE-Sepharose Fast Flow. SDS-PAGE analysis demonstrated molecular masses of chitinase and chitosanase were 230 kDa and 45 kDa respectively. The optimum hydrolysis conditions for chitinase were about pH 7.0 and 36 ℃, and these for chitosanase were pH 6.5 and 56 ℃, respectively. Both enzymes were quite stable up to 45 ℃ for one hour at pH 5-8. These results show that CJ-5 may have potential for industrial application particularly in recycling of chitin wastes.展开更多
Simulations of heat transfer and oxygen transport during a Czochralski growth of silicon with and without a cusp magnetic field were carried out. A finite volume method with a low-Reynolds number K-e model proposed by...Simulations of heat transfer and oxygen transport during a Czochralski growth of silicon with and without a cusp magnetic field were carried out. A finite volume method with a low-Reynolds number K-e model proposed by Jones-Launder was employed. The numerical results were compared with the experimental data in the literature. It is found that the calculated results are in good agreement with the experimental data.展开更多
With the growing trend toward using cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Many cryptography and security schemes,such as PDP(Provable Data Possession) an...With the growing trend toward using cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Many cryptography and security schemes,such as PDP(Provable Data Possession) and POR(Proofs of Retrievability) were proposed for this problem.Although many efficient schemes for static data have been constructed,only a few dynamic schemes exist,such as DPDP(Dynamic Provable Data Possession).But the DPDP scheme falls short when updates are not proportional to a fixed block size.The FlexList-based Dynamic Provable Data Possession(FlexDPDP) was an optimized scheme for DPDP.However,the update operations(insertion,remove,modification)in Flex DPDP scheme only apply to single node at a time,while multiple consecutive nodes operation is more common in practice.To solve this problem,we propose optimized algorithms for multiple consecutive nodes,which including MultiNodes Insert and Verification,MultiNodes Remove and Verification,MultiNodes Modify and Verification.The cost of our optimized algorithms is also analyzed.For m consecutive nodes,an insertion takes O(m) + O(log N) + O(log m),where N is the number of leaf nodes of FlexList,a remove takes O(log/V),and a modification is the same as the original algorithm.Finally,we compare the optimized algorithms with original FlexList through experiences,and the results show that our scheme has the higher efficiency of time and space.展开更多
基金Project supported by the Marine Bureau of Zhejiang Province, China
文摘A novel chitinolytic and chitosanolytic bacterium, Sphingomonas sp. CJ-5, has been isolated and characterized. It secretes both chitinase and chitosanase into surrounding medium in response to chitin or chitosan induction. To characterize the enzymes, both chitinase and chitosanase were purified by ammonium sulfate precipitation, Sephadex G-200 gel filtration and DEAE-Sepharose Fast Flow. SDS-PAGE analysis demonstrated molecular masses of chitinase and chitosanase were 230 kDa and 45 kDa respectively. The optimum hydrolysis conditions for chitinase were about pH 7.0 and 36 ℃, and these for chitosanase were pH 6.5 and 56 ℃, respectively. Both enzymes were quite stable up to 45 ℃ for one hour at pH 5-8. These results show that CJ-5 may have potential for industrial application particularly in recycling of chitin wastes.
基金Supported by the Ph.D. Start-up Fund of Beijing University of Technology (No.127-00227).
文摘Simulations of heat transfer and oxygen transport during a Czochralski growth of silicon with and without a cusp magnetic field were carried out. A finite volume method with a low-Reynolds number K-e model proposed by Jones-Launder was employed. The numerical results were compared with the experimental data in the literature. It is found that the calculated results are in good agreement with the experimental data.
基金supported in part by the National Natural Science Foundation of China under Grant No.61440014&&No.61300196the Liaoning Province Doctor Startup Fundunder Grant No.20141012+2 种基金the Liaoning Province Science and Technology Projects under Grant No.2013217004the Shenyang Province Science and Technology Projects under Grant Nothe Fundamental Research Funds for the Central Universities under Grant No.N130317002 and No.N130317003
文摘With the growing trend toward using cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Many cryptography and security schemes,such as PDP(Provable Data Possession) and POR(Proofs of Retrievability) were proposed for this problem.Although many efficient schemes for static data have been constructed,only a few dynamic schemes exist,such as DPDP(Dynamic Provable Data Possession).But the DPDP scheme falls short when updates are not proportional to a fixed block size.The FlexList-based Dynamic Provable Data Possession(FlexDPDP) was an optimized scheme for DPDP.However,the update operations(insertion,remove,modification)in Flex DPDP scheme only apply to single node at a time,while multiple consecutive nodes operation is more common in practice.To solve this problem,we propose optimized algorithms for multiple consecutive nodes,which including MultiNodes Insert and Verification,MultiNodes Remove and Verification,MultiNodes Modify and Verification.The cost of our optimized algorithms is also analyzed.For m consecutive nodes,an insertion takes O(m) + O(log N) + O(log m),where N is the number of leaf nodes of FlexList,a remove takes O(log/V),and a modification is the same as the original algorithm.Finally,we compare the optimized algorithms with original FlexList through experiences,and the results show that our scheme has the higher efficiency of time and space.
