Time filter

Source Type

Ningde, China

Ying S.-M.,Sun Yat Sen University | Ying S.-M.,Ningde Normal University
Inorganica Chimica Acta | Year: 2012

Six coordination polymers from reduced Schiff base ligands, namely, [Zn(L 1) 2]·2H 2O (1), [Ni(L 1) 2]·2H 2O (2), [Ni(L 1) 2(H 2O) 2] (3), [Zn(L 2) 2]·H 2O (4), [Ni(L 2) 2] ·0.5H 2O (5), and [Co(L 2) 2(HL 2)] (6) (HL 1 = 4-((4-pyridinylmethyl)amino)benzoic acid, HL 2 = 3-((4-pyridinylmethyl)amino)benzoic acid) have been obtained by hydrothermal method and studied by single crystal X-ray diffraction, elemental analyses, powder X-ray diffraction, thermogravimetric analysis and infrared spectroscopy. Compounds 1 and 2 are isostructural while compounds 4 and 5 also are isostructural. All these four compounds exhibit a 2D layer structure. Compound 2 is isomeric to 3 but has a chain structure. Compound 6 also exhibits a chain structure. The photoluminescence properties of compounds 1 and 4 were studied. © 2012 Elsevier B.V. All rights reserved.

Fan C.,Shandong University | Lin H.,Ningde Normal University
Journal of Convergence Information Technology | Year: 2012

P-sets(packet sets) is a novel mathematics model obtained by improving finite general set X(Cantor set X), which has dynamic characteristic. P-sets is a set pair composed of internal P-set X F (internal packet set X F) and outer P-set X F (outer packet set X F), or (X F, X F) is a P-sets. Internal P-set X F is obtained by deleting some attributes from the attribute set α. Outer P-set X F is obtained by supplementing some attributes into the attribute set α. α is the attribute set of finite general set X. Using the structure of P-sets, it gives the status characteristics of information and the unit circle theorem of information status identification in the paper. Based on the theoretical results, it gives the application of P-sets in disaster information reasoning-identification. P-sets is a novel mathematical method and model studying information identification.

Li Y.,Ningde Normal University
Journal of Convergence Information Technology | Year: 2012

The aim of this paper is to improve the generated manner of P-sets string to obtain a recursive structure of information. This paper proposes the concept of P-recursion information (packet recursion information, PRI) by improving the generated manner of P-sets string into the recursion generated manner. PRI is composed of P inward-recursion information (packet inward-recursion information, PIRI) and P outward-recursion information (packet outward-recursion information, PORI). The base information of PRI has dynamic characteristics. Furthermore, this paper presents the structure about PRI and proposes the concepts of P inward-recursion information core (PIRIC), P outward-recursion information shell (PORIS) as well as the recursion search ring (RSR). The reduction theorem, the identification criterion and the recursion search algorithm for PRI are obtained. Finally, an application about the recursion search of PRI is provided. RSR can enhance the intuitive identification of recursion search states. PRI is a new mathematical tool to research information systems which have recursive dynamic characteristics.

Lin H.,Ningde Normal University
Journal of Convergence Information Technology | Year: 2011

In this paper, a different approach to extract the threshold value β of Variable Precision Rough Set (VPRS) applied to continuous information systems is presented. This study combines the Fuzzy Set and Rough Fuzzy Set (RFS) theories to determine the β value of VPRS. The β value was determined by the Fuzzy C-means and relevant Fuzzy theories, for the reason that errors of system classification could occur in the fuzzy-clustering phase prior to information classification. In practice, the attributes of the continuous information system were first fuzzed and classified by Fuzzy C-means method, then the maximum of the membership function value was chosen as the cluster forming basis. Finally, the β value of approximate classification was obtained under the VPRS by Implication Relations and Rough Fuzzy Set (RFS) theory. In addition, the influences of Implication Relations of various definitions on the β-lower approximation of VPRS were discussed.

Lin H.,Ningde Normal University | Fan C.,Shandong University
International Journal of Digital Content Technology and its Applications | Year: 2012

By P-reasoning(Packet reasoning), the dual form of P-reasoning is given, briefly P -1- reasoning. P -1-reasoning is composed of internal P -1-reasoning and outer P -1-reasoning, or "if (X F k+1,X F k)⇒ (X F k,X F k+1), then (α F k,α F k+1)⇒ (α F k+1,α F k)" is P -1-reasoning. Under a certain condition, P -1- reasoning can be restored to general reasoning. P -1-reasoning is obtained from the opposite problem of P-reasoning. In the paper, P -1-reasoning and P -1-reasoning theorems are presented as well as internal P -1-reasoning, outer P -1-reasoning and their reasoning structures. The relation between P -1-reasoning and general reasoning is given. The dynamic characteristic of P -1-reasoning and attribute set is obtained. Using the above studies, P -1-reasoning is applied in discovery -identification of the unknown attribute. P -1-reasoning and P-reasoning are two different dynamic reasoning forms, which acquire the application in different area of information system.

Discover hidden collaborations