Exploring the factors to control Znsalen aggregation is of importance to design functional materials in catalysis, optical materials and biological imaging. In this work, we synthesized and characterized four cryptand...Exploring the factors to control Znsalen aggregation is of importance to design functional materials in catalysis, optical materials and biological imaging. In this work, we synthesized and characterized four cryptand type tri Znsalen complexes and found that cryptand structure could efficiently minimize intermolecular Zn…O interaction. More importantly, encapsulated by PLGA nanoparticles, cryptand tri Znsalen 1 displayed visible intracellular fluorescence whereas monomeric Znsalen 5 could not. These results provide a new access to design new luminescent materials with the potential application in optics and biological studies.展开更多
We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite siz...We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite size around the swarm center in a finite time. Moreover, we extend our results to more general attraction/repulsion functions. Numerical simulations demonstrate that all agents will eventually enter into and remain in a bounded region around the swarm center which may exhibit complex spiral motion due to asymmetry of the coupling structure. The model in this paper is more general than isotropic swarms and our results provide further insight into the effect of the interaction pattern on individual motion in a swarm system.展开更多
An ionic iridium（Ⅲ） complex[Ir（F2dpyb）（bzdpp）2Cl][OTf]with 1,3-difluoro-4,6-di（2-pyridinyl） benzene（F2dpybH） terdentate ligand and benzyldiphenylphosphine（bzdpp）ligand was synthesized and characterized.Th...An ionic iridium（Ⅲ） complex[Ir（F2dpyb）（bzdpp）2Cl][OTf]with 1,3-difluoro-4,6-di（2-pyridinyl） benzene（F2dpybH） terdentate ligand and benzyldiphenylphosphine（bzdpp）ligand was synthesized and characterized.The structure of iridium complex was verified by single-crystal X-ray crystallography.It crystallizes in monoclinic,space group P21/n with a =14.3654（7）,b = 23.0026（10）,c = 15.7964（7） A°,β = 97.6029（11）,V= 5173.9（4） A°3,Z = 4,F（000） =2552,Dc = 1.645 Mg/m^3,Mr = 1281.49 and μ = 0.071 mm^-1.The UV-vis absorption and phosphorescence of the complex were discussed.The complex was ＇aggregation induced emission（AIE）＇ active.It exhibited no emission in CH2Cl2 solution but strong blue-green emission in solid state under ultraviolet light excitation.The complex emitted a strong phosphorescence centered at493 nm when doped in PMMA.Its lifetime is 0.755 μs and quantum yield is approximately 0.134.展开更多
We analyze a common feature of p-Kemeny AGGregation（p-KAGG） and p-One-Sided Crossing Minimization（p-OSCM） to provide new insights and findings of interest to both the graph drawing community and the social choice ...We analyze a common feature of p-Kemeny AGGregation（p-KAGG） and p-One-Sided Crossing Minimization（p-OSCM） to provide new insights and findings of interest to both the graph drawing community and the social choice community. We obtain parameterized subexponential-time algorithms for p-KAGG—a problem in social choice theory—and for p-OSCM—a problem in graph drawing. These algorithms run in time O＊（2O（√k log k））,where k is the parameter, and significantly improve the previous best algorithms with running times O.1.403k/and O.1.4656k/, respectively. We also study natural ＂above-guarantee＂ versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p-directed feedback arc set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of ＂votes＂ in the input to p-KAGG is odd the above guarantee version can still be solved in time O＊（2O（√k log k））, while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails（equivalently, unless FPT D M[1]）.展开更多
基金supported by the National Scientific Foundation of China(No.20971007)National Key Basic Research Support Foundation of China(NKBRSFC)(Nos.2013CB933402,2015CB856300)
文摘Exploring the factors to control Znsalen aggregation is of importance to design functional materials in catalysis, optical materials and biological imaging. In this work, we synthesized and characterized four cryptand type tri Znsalen complexes and found that cryptand structure could efficiently minimize intermolecular Zn…O interaction. More importantly, encapsulated by PLGA nanoparticles, cryptand tri Znsalen 1 displayed visible intracellular fluorescence whereas monomeric Znsalen 5 could not. These results provide a new access to design new luminescent materials with the potential application in optics and biological studies.
基金This work was supported by the National Natural Science Foundation of China (No. 10372002,60274001) and the National Key Basic Research and Develop-ment Program (No.2002CB312200).
文摘We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite size around the swarm center in a finite time. Moreover, we extend our results to more general attraction/repulsion functions. Numerical simulations demonstrate that all agents will eventually enter into and remain in a bounded region around the swarm center which may exhibit complex spiral motion due to asymmetry of the coupling structure. The model in this paper is more general than isotropic swarms and our results provide further insight into the effect of the interaction pattern on individual motion in a swarm system.
基金Supported by the National Natural Science Foundation of China(21572001)the Natural Science Foundation from Bureau of Education of Anhui Province(KJ2013A063)the Anhui Province Undergraduate Innovation and Entrepreneurship Training Program(201510360119)
文摘An ionic iridium（Ⅲ） complex[Ir（F2dpyb）（bzdpp）2Cl][OTf]with 1,3-difluoro-4,6-di（2-pyridinyl） benzene（F2dpybH） terdentate ligand and benzyldiphenylphosphine（bzdpp）ligand was synthesized and characterized.The structure of iridium complex was verified by single-crystal X-ray crystallography.It crystallizes in monoclinic,space group P21/n with a =14.3654（7）,b = 23.0026（10）,c = 15.7964（7） A°,β = 97.6029（11）,V= 5173.9（4） A°3,Z = 4,F（000） =2552,Dc = 1.645 Mg/m^3,Mr = 1281.49 and μ = 0.071 mm^-1.The UV-vis absorption and phosphorescence of the complex were discussed.The complex was ＇aggregation induced emission（AIE）＇ active.It exhibited no emission in CH2Cl2 solution but strong blue-green emission in solid state under ultraviolet light excitation.The complex emitted a strong phosphorescence centered at493 nm when doped in PMMA.Its lifetime is 0.755 μs and quantum yield is approximately 0.134.
基金supported by a GermanNorwegian PPP grantsupported by the Indo-German Max Planck Center for Computer Science (IMPECS)
文摘We analyze a common feature of p-Kemeny AGGregation（p-KAGG） and p-One-Sided Crossing Minimization（p-OSCM） to provide new insights and findings of interest to both the graph drawing community and the social choice community. We obtain parameterized subexponential-time algorithms for p-KAGG—a problem in social choice theory—and for p-OSCM—a problem in graph drawing. These algorithms run in time O＊（2O（√k log k））,where k is the parameter, and significantly improve the previous best algorithms with running times O.1.403k/and O.1.4656k/, respectively. We also study natural ＂above-guarantee＂ versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p-directed feedback arc set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of ＂votes＂ in the input to p-KAGG is odd the above guarantee version can still be solved in time O＊（2O（√k log k））, while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails（equivalently, unless FPT D M[1]）.
