N-valeronitrile-N'-methylimidazolium hexafluorophosphate ([C 4 CNmim]+ PF 6),as a novel ionic liquid with polar nitrile functional group,was prepared.The structure of the ionic liquid was characterized by using IR...N-valeronitrile-N'-methylimidazolium hexafluorophosphate ([C 4 CNmim]+ PF 6),as a novel ionic liquid with polar nitrile functional group,was prepared.The structure of the ionic liquid was characterized by using IR and 1 H NMR.As a medium,the ionic liquid plays an important role in copolymerization of carbon monoxide (CO) with styrene (St).Some synthetic conditions were determined,including the usage of ionic liquid,palladium composite catalyst and methanol,CO pressure,reaction time and reaction temperature.The influence of these factors on catalytic activity was analyzed.The results show that the catalytic activity has reached 1 724.1 gStCO/(gPd·h) and the catalyst could be reused 5 times under the optimal condition:composite catalyst 0.015 mmol,ionic liquid 3 mL,methanol 0.75 mL,CO pressure 2MPa,reaction time 2 h and reaction temperature 70℃.This CO/St copolymerization within [C 4 CNmim]+ PF 6 system could facilitate ionic liquids with efficient and economical applications to polymeric materials.展开更多
The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-...The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-trees and e-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows and the execution time measurements confirm that for these O（2D） algorithms, the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.展开更多
基金Supported by National Natural Science Foundation of China (No.20476080)Tianjin Natural Science Foundation (No.07JCYBJC00600)
文摘N-valeronitrile-N'-methylimidazolium hexafluorophosphate ([C 4 CNmim]+ PF 6),as a novel ionic liquid with polar nitrile functional group,was prepared.The structure of the ionic liquid was characterized by using IR and 1 H NMR.As a medium,the ionic liquid plays an important role in copolymerization of carbon monoxide (CO) with styrene (St).Some synthetic conditions were determined,including the usage of ionic liquid,palladium composite catalyst and methanol,CO pressure,reaction time and reaction temperature.The influence of these factors on catalytic activity was analyzed.The results show that the catalytic activity has reached 1 724.1 gStCO/(gPd·h) and the catalyst could be reused 5 times under the optimal condition:composite catalyst 0.015 mmol,ionic liquid 3 mL,methanol 0.75 mL,CO pressure 2MPa,reaction time 2 h and reaction temperature 70℃.This CO/St copolymerization within [C 4 CNmim]+ PF 6 system could facilitate ionic liquids with efficient and economical applications to polymeric materials.
文摘The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-trees and e-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows and the execution time measurements confirm that for these O（2D） algorithms, the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.
