Entity

Time filter

Source Type

Zhangzhou, China

Cai P.,Hunan University | Cai P.,Zhangzhou Teachers College | Tang J.-S.,Hunan University
Zhendong yu Chongji/Journal of Vibration and Shock | Year: 2013

A new method was presented for studying the controlling of amplitude of limit cycles. The amplitudes of limit cycles were determined by using the modified multiple scale method and the analytical expressions regarding the amplitudes of controlled limit cycles and the feedback gains were also obtained. The control of amplitudes of limit cycles was realized by choosing suitable feedback gains and the efficiencies of different controllers were discussed and compared. The validity of the analytical conclusions was verified by numerical simulations and the method still maintains high accuracy for the case of larger parameter ε. Source


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. Source


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. Source


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. Source


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. Source

Discover hidden collaborations