Some molecule-based materials low dimension nanostructures

Molecule based materials nanoarchitectures have been employed as important nanoscale building blocks for advanced materials and smart miniature devices to fulfill the increasing needs of high materials usage efficiency. Different dimension molecule based materials based nanoarchitectures, especially low dimension nanostructures, attract significant attention due to its fascinating controlled structure and functionality-easy tailoring with excellent semi-conductive properties and stability. In this report, we discuss the some molecule based materials self-assembled oriented functional nanoarchitectures by coordinated inducing. The molecular material building blocks, aggregate structures and their properties in optical, electrical and photoelectrical properties were shown. REFERENCES [1] Guo, Y.B.; Xu, L.; Liu, H. B.; Li, Y. J.; Che, C.-M.; Li, Y. L. Adv. Mater. 2015, 27, 985. [2] Li, Y. J.; Liu, T. F.; Liu, H. B.; Tian, M.-Z.; Li, Y. L. Acc. Chem. Res., 2014, 47,1186. [3] Li, Y. J.; Liang Xu, Liu, H. B.; Li, Y. L. Chem. Soc. Rev. 2014, 43, 2572. [4] Liu, H. B.; Xu, J. L.; Li, Y. J.; Li, Y. L. Acc. Chem. Res. 2010, 43, 1496. [5] Zheng, H. Y.; Li, Y. J.; Liu, H. B.; Yin, X. D.; Li, Y. L. Chem. Soc. Rev. 2011, 40, 4506

China: disidencia y ciberespacio

La reciente condena de Liu Xiaobo, prominente disidente chino, se ha producido en medio de un conflicto de grandes intereses empresariales y políticos, en el marco de un ciberespacio altamente estratégico. Este análisis se propone, primero, explicar la relevancia de la detención de Liu Xiaobo y su importancia en relación con el activismo chino de significado político y social de los últimos años. A continuación ofrece algunas interpretaciones sobre el enfrentamiento Google-Pekín, casi coincidente con el caso Liu y relacionado con ciberataques y censura. Por último, analiza aspectos del pulso de poder en el ciberespacio

Construction and optical-electrical properties of inorganic/organic heterojunction nanostructures

We have designed and synthesized a series of ordered inorganic/organic hybrid aggregate nanostructures of by self-assembly and self-organizing technique. The process and mechanism of growing hybrid aggregate nanostructures have been studied. The ability to tune the size and morphologies of hybrid aggregate nanostructures has been achieved by controlling reaction conditions. The effects of morphologies and size dependent on electrical and optical properties have been demonstrated. These semiconductor molecular hybrid aggregate nanostructures exhibit interesting electrical, optical, and optoelectronic properties for use in next-generation electronic and optoelectronic devices. REFERENCES [1] Liu, H. B.; Zuo, Z. C.; Guo, Y. B.; Li, Y. J.; Li, Y. L. Angew. Chem. Int. Ed. 2010, 49, 2705. [2] Huang, C. S.; Li, Y. L.; Song, Y. L.; Li, Y. J.; Liu, H. B.; Zhu, D. B. Adv. Mater. 2010, 22, 3532. [3] Wang, K.; Yang, H.; Qian, X. M.; Xue, Z.; Li, Y. J.; Liu, H. B.; Li, Y. L. Dalton Trans. 2014, 43, 11542. [4] Liu, H. B.; Wang, K.; Zhang, L.; Qian, X. M.; Y. J.; Li, Y. L. Dalton Trans. 2014, 43, 432. [5] Guo, Y. B.; Xu, L.; Liu, H. B.; Li, Y. J.; Che, C.-M.; Li, Y. L. Adv. Mater. 2015, 27, 985

On the qq-log-convexity conjecture of Sun

In his study of Ramanujan-Sato type series for $1/\pi$, Sun introduced a sequence of polynomials $S_n(q)$ as given by $$S_n(q)=\sum\limits_{k=0}^n{n\choose k}{2k\choose k}{2(n-k)\choose n-k}q^k,$$ and he conjectured that the polynomials $S_n(q)$ are $q$-log-convex. By imitating a result of Liu and Wang on generating new $q$-log-convex sequences of polynomials from old ones, we obtain a sufficient condition for determining the $q$-log-convexity of self-reciprocal polynomials. Based on this criterion, we then give an affirmative answer to Sun's conjecture

Fundamental Cycles and Graph Embeddings

In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al. Based on this, we find a new polynomially bounded algorithm to find the maximum genus of a graph