Zhangzhou Teachers College

Zhangzhou, China

Zhangzhou Teachers College

Zhangzhou, China
SEARCH FILTERS
Time filter
Source Type

Li Y.L.,Zhangzhou Teachers College | Wei M.,Xiamen University
Key Engineering Materials | Year: 2010

Customers are the source of hotel profits, and hotel profits provide the customers with a wide range of services to achieve through the hotel. Because of the existence of intangible, heterogeneity, identity of production and consumption in services, as well as the subjective characteristics in the evaluation of service quality, etc, the phenomenon of customers' complaints will inevitably be encountered. If they are not handled properly, it will inevitably cause the loss of the hotel. So it is a great importance to handle correctly customer complaints. By analyzing the substance of customer complaints and the causing reason, this paper proposes countermeasures to deal with customer complaints to turn negative factors into positive ones, and enhance customer satisfaction and loyalty, and safeguard the reputation of the hotel to improve hotel service quality. © (2010) Trans Tech Publications.


Chen B.,University of Jinan | Li J.,Zhangzhou Teachers College
Proceedings - 2010 7th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2010 | Year: 2010

In this paper, we introduce and study the notion of fuzzy b-I-open sets, which is properly placed between fuzzy openness and fuzzy b-openness regardless the fuzzy topological ideal. We deduce some characterization theorems for such concepts exactly analogous to general topology. And we define the notion of fuzzy b-I-continuous function via fuzzy b-I-open sets and some of its properties are investigated. Moreover, we give a decomposition of fuzzy continuity by using fuzzy b-I-continuous function. ©2010 IEEE.


Chen X.-B.,Zhangzhou Teachers College
Information Processing Letters | Year: 2010

Let Wn denote any bipartite graph obtained by adding some edges to the n-dimensional hypercube Qn, and let S and T be any two sets of k vertices in different partite sets of Wn. In this paper, we show that the graph Wn has k vertex-disjoint (S, T)-paths containing all vertices of Wn if and only if k = 2n - 1 or the graph Wn - (S ∪ T) has a perfect matching. Moreover, if the graph Wn - (S ∪ T) has a perfect matching M, then the graph Wn has k vertex-disjoint (S, T)-paths containing all vertices of Wn and all edges in M. And some corollaries are given. © 2009 Elsevier B.V. All rights reserved.


Chen X.-B.,Zhangzhou Teachers College
Information Processing Letters | Year: 2010

Let Qn denote an n-dimensional hypercube with n ≥ 2, P be a path of length h in Qn and F ⊂ E (Qn) \ E (P). Recently, Tsai proved that if 1 ≤ h ≤ n - 1 and | F | ≤ n - 1 - h, then in the graph Qn - F the path P lies on a cycle of every even length from 2 h + 2 to 2n, and P also lies on a cycle of length 2h if | F | ≤ h - 2. In this paper, we show that if 1 ≤ h ≤ 2 n - 3 and | F | ≤ n - 2 - ⌊ h / 2 ⌋, then in Qn - F the path P lies on a cycle of every even length from 2 h + 2 to 2n, and P also lies on a cycle of length 2h if P contains two edges of the same dimension or P is a shortest path and | F ∩ E (Qh) | ≤ h - 2, where Qh is the h-dimensional subcube containing the path P. Moreover, the upper bound 2 n - 3 of h is sharp and the upper bound n - 2 - ⌊ h / 2 ⌋ of | F | is sharp for any given h with 1 ≤ h ≤ 2 n - 3. © 2010 Elsevier B.V. All rights reserved.


Chen X.-B.,Zhangzhou Teachers College
Information Sciences | Year: 2013

In this paper we consider the problem of paired many-to-many disjoint path covers of the hypercubes and obtain the following result. Let S={ s1,s2,...,sk} and T={t1, t2,...,tk} be two sets of k vertices in different partite sets of the n-dimensional hypercube Qn, and let e=|{i| siandtiare adjacent,1≤i≤k}|. If n>k+⌈(k-e)/ 2⌉, then there exist k vertex-disjoint paths P1, P2,...,Pk, where Pi connects si and ti, for i=1,2,...,k, such that these k paths contain all vertices of Qn. © 2013 Elsevier Inc. All rights reserved.


Chen X.-B.,Zhangzhou Teachers College
Information Sciences | Year: 2013

The complete graphs are an important class of graphs, and are also fundamental interconnection networks. Recently, Fu investigated their edge-fault-tolerant Hamiltonicity and Ho, et al. investigated their edge-fault-tolerant Hamiltonian-connectivity. In this paper, we improve the result of Fu and point out that the proof of the result of Ho, et al. fails. Then we consider the edge-fault-tolerant panconnectivity of the complete graphs and obtain the following result. Let F be any set of at most 2n - 10 faulty edges in the complete graph Kn with n vertices, such that every vertex of the graph G=Kn-F is incident with at least three edges and G∉{K8-E(K4),K10-E(K5)}. Then G is nearly panconnected, i.e., for any two vertices u and v, there exists a path connecting u and v in G of any length from 3 to n - 1. As a corollary, every edge in the graph G lies on a cycle of any length from 4 to n. Moreover, the number 2n - 10 of faulty edges tolerated is sharp. © 2012 Elsevier Inc. All rights reserved.


Chen X.-B.,Zhangzhou Teachers College
Information Sciences | Year: 2013

In this paper, we introduce the concept of the k-path-(bi)panconnectivity of (bipartite) graphs. It is a generalization of the (bi)panconnectivity and of the paired many-to-many k-disjoint path cover. The 2-path-bipanconnectivity with only one exception of the n-cube Qn (n ≥ 4) is proved. Precisely, the following result is obtained: In an n-cube with n ≥ 4 given any four vertices u1, v1, u2, v2 such that two of them are in one partite set and the another two are in the another partite set. Let s = t = 5 if C = u1u2v1v 2 is a cycle of length 4, and s = d(u1, v1) + 1 and t = d(u2, v2) + 1 otherwise, where d(u, v) denotes the distance between two vertices u and v. And let i and j be any two integers such that both i - s ≥ 0 and j - t ≥ 0 are even with i + j ≤ 2 n. Then there exist two vertex-disjoint (u1, v 1)-path P and (u2, v2)-path R with |V(P)| = i and |V(R)| = j. As consequences, many properties of hypercubes, such as bipanconnectivity, bipanpositionable bipanconnectivity [18], bipancycle-connectivity [12], two internally disjoint paths with two given lengths, and the 2-disjoint path cover with a path of a given length [21], follow from our result. © 2013 Elsevier Inc. All rights reserved.


Chen X.-B.,Zhangzhou Teachers College
Information Processing Letters | Year: 2010

Let n(≥3) be a given integer and Ωk={l|k≤l≤2n-1andl-kis even}. And let Qn be an n-dimensional hypercube and FǎŠE(Qn), such that every vertex of the graph Qn-F is incident with at least two edges. Assume x and y are any two vertices with Hamming distance H(x,y)=h. In this paper, we obtain the following results: (1) If h≥2 and |F|≤min{n+h-1,2n-5}, then in Qn-F there exists an xy-path of each length l E Ωh+2, and the upper bound n+h-1 on |F| is sharp when 2≤h≤n-4, and the upper bound 2n-5 on |F| is sharp when n-4≤h≤n-1 and h=2. (2) If |F|≤2n-5, then in Qn-F there exists an xy-path of each length l E Ωs, where s=h if n-1≤h≤n, and s=h+2 if n-4≤h≤n-2 and h≥2, and s=h+4 otherwise. Hence, the diameter of the graph Qn-F is n. Our results improve some previous results. © 2010 Elsevier B.V. All rights reserved.


Chen X.-B.,Zhangzhou Teachers College
Information Processing Letters | Year: 2012

Let Mk={ ui, vi}i=1k be a set of k pairs of distinct vertices of the n-dimensional hypercube Qn such that it contains k vertices from each class of bipartition of Qn. Gregor and Dvořák proved that if n>2k, then there exist k vertex-disjoint paths P1, P2,⋯, Pk containing all vertices of Qn, where two end-vertices of Pi are ui and vi for i=1,2,⋯,k. In this paper we show that the result still holds if removing n-2k-1 edges from Qn. When k=2, we also show that the result still holds if removing 2n-7≥1 edges from Qn such that every vertex is incident with at least three fault-free edges, and the number 2n-7 of faulty edges tolerated is sharp. © 2011 Elsevier B.V. All rights reserved.


Chen X.-B.,Zhangzhou Teachers College
Information Processing Letters | Year: 2011

A set of k 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, one path in each spanning tree, are internally disjoint. Using independent spanning trees (ISTs) one can design fault-tolerant broadcasting schemes and increase message security in a network. Thus, the problem of ISTs on graphs has been received much attention. Recently, Yang et al. proposed a parallel algorithm for generating optimal ISTs on the hypercube. In this paper, we propose a similar algorithm for generating optimal ISTs on Cartesian product of complete graphs. The algorithm can be easily implemented in parallel or distributed systems. Moreover, the proof of its correctness is simpler than that of Yang et al. © 2010 Elsevier B.V.

Loading Zhangzhou Teachers College collaborators
Loading Zhangzhou Teachers College collaborators