Entity

Time filter

Source Type

Zhangzhou, China

Zhangzhou Normal University is a public university located in Zhangzhou, Fujian, China. Wikipedia.


Chen X.-B.,Zhangzhou Normal University
Information Sciences | Year: 2013

The n-dimensional folded hypercube FQn is an important variant of the n-dimensional hypercube Qn, which is obtained from Q n by adding an edge between any pair of vertices with complementary addresses. The diameter of FQn is âŒ̂n/ 2⌉, about half the diameter of Qn. A set of k(≥2) spanning trees rooted at the same vertex r in a graph G is said to be independent if for each vertex x other than r, the k paths from r to x, with one path in each spanning tree, are internally disjoint. By using independent spanning trees (ISTs) one can design fault-tolerant broadcasting schemes and increase message security in a network. Recently, Yang et al. proposed an algorithm, which can be parallelized, for constructing n + 1 ISTs on FQ n with the height of each spanning tree being n. In this paper, we propose an algorithm for constructing n + 1 optimal ISTs on FQn in the sense that there is a shortest path between the only child of the root r and any other vertex in each spanning tree (therefore, the height of each spanning tree is âŒ̂n/2⌉ + 1). Moreover, the algorithm runs in time O((n + 1)N) and can be parallelized to run by using N = 2n processors on FQn in time O(n). © 2013 Elsevier Inc. All rights reserved. Source


Zhang J.-Y.,Zhangzhou Normal University
European Journal of Combinatorics | Year: 2014

Let M=CM(G,X,p) be a regular Cayley map, and let φ be the corresponding skew-morphism. If the power function of φ assumes exactly i values in Z|X|, then M is called of skew-type i. Note that regular balanced Cayley maps are of skew-type 1, and regular t-balanced (including anti-balanced) Cayley maps are of skew-type 2. Those two classes of maps have been studied by many researchers. In this paper, some results on regular Cayley maps of skew-type 3 for abelian groups are given. As applications, many new regular Cayley maps for abelian groups are constructed. © 2014 Elsevier Ltd. Source


Zhu W.,Zhangzhou Normal University | Wang F.-Y.,CAS Institute of Automation
Information Sciences | Year: 2012

As a technique for granular computing, rough sets deal with the vagueness and granularity in information systems. Covering-based rough sets have been proposed to generalize this theory for wider application. Three types of covering-based rough sets have been studied for different situations. To make the theory more complete, this paper proposes a fourth type of covering-based rough sets. Compared with the existing ones, the new type shows its special characteristic in the interdependency between its lower and upper approximations. We carry out a systematical study of this new theory. First, we discuss basic properties such as normality, contraction, and monotone. Then we investigate the conditions for this type of covering-based rough sets to satisfy the properties of Pawlak's rough sets and study the interdependency between the lower and upper approximation operations. In addition, axiomatic systems for the lower and upper approximation operations are established. Lastly, we address the relationships between this type of covering-based rough sets and the three existing ones. © 2012 Elsevier Inc. All rights reserved. Source


Lin P.,Zhangzhou Normal University
International Journal of Machine Learning and Cybernetics | Year: 2012

Discernibility matrices play an important role in the attribute reduction of information systems. The reduction of a family of general relations, which preserves the topological base, is an extension of the attribute reduction of information systems. In this paper, we construct a new discernibility matrix for the topological reduction of a family of general relations. © 2011 Springer-Verlag. Source


Yang H.,Zhangzhou Normal University
Biochemical Genetics | Year: 2013

l-gulono-gamma-lactone oxidase (GULO) catalyzes the final step in vertebrate vitamin C biosynthesis. Vitamin C-incapable vertebrates lack the GULO gene. Gene structure and phylogenetic analyses showed that vertebrate GULO genes are 64-95% identical at the amino acid level and consist of 11 conserved exons. GULO pseudogenes have multiple indel mutations and premature stop codons in higher primates, guinea pigs, and some bats. No GULO-like sequences were identified in teleost fishes. During animal GULO evolution, exon F was subdivided into F1 and F2. Additional GULO retropseudogenes were identified in dogs, cats, and giant pandas. GULO-flanking genome regions acquired frequent segment translocations and inversions during vertebrate evolution. Purifying selection was detected across vertebrate GULO genes (d N/d S = 0.069), except for some positively selected sites identified in sharks and frogs. These positive sites demonstrated little functional significance when mapped onto the three-dimensional GULO protein structure. Vertebrate GULO genes are conserved except for those that are lost. © 2013 Springer Science+Business Media New York. Source

Discover hidden collaborations