On the Maximum Number of Independent Cycles in a Bipartite Graph
LetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n?2k, wherekis a positive integer. Suppose that the minimum degree ofGis at leastk+1. We show that ifn>2k, thenGcontainskvertex-disjoint cycles. We also show that ifn=2k, thenGcontainsk?1 quadrilaterals and a path of order 4 such that all of them are vertex-disjoint. Moreover, the condition on degrees is sharp. We conjecture that whenn=2k,Gindeed containskvertex-disjoint quadrilaterals.

title: Packing Three Copies of a Tree into a Complete Graph
abstract: A three T of order n is said to be 3-placeable if there are three edge-disjoint copies of T in Kn. In this paper we characterize all the trees T such that T is 3-placeable.

title: On Quadrilaterals and Cycle Covers in a Bipartite Graph

title: Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three
abstract: . Our main result is as follows: For any integer , if G is a claw-free graph of order at least and with minimum degree at least 3, then G contains k vertex-disjoint triangles unless G is of order and G belongs to a known class of graphs. We also construct a claw-free graph with minimum degree 3 on n vertices for each such that it does not contain k vertex-disjoint triangles. We put forward a conjecture on vertex-disjoint triangles in -free graphs.

title: On Independent Cycles in a Bipartite Graph
abstract: Let G=(V1,V2;E) be a bipartite graph with 2k≤m=|V1|≤|V2|=n, where k is a positive integer. We show that if the number of edges of G is at least (2k−1)(n−1)+m, then G contains k vertex-disjoint cycles, unless e(G)=(2k−1)(n−1)+m and G belongs to a known class of graphs.

title: On Covering a Bipartite Graph with Cycles
abstract: We conjectured in [H. Wang,  (1999), pp. 115--121] that, for each integer $k\geq 2$, there exists N(k) such that if G=(V1,V2;E) is a bipartite graph with $|V_1|=|V_2|=n\geq N(k)$ and d(x)+d(y)\geq n+k$ for each pair of nonadjacent vertices x and y of G with $x\in V_1$ and $y\in V_2$, then for any k independent edges e1, . . ., ek of G, there exist k vertex-disjoint cycles C1, . . . ,Ck in G such that $e_i\in E(C_i)$ for all $i\in\{1,\ldots ,k\}$ and $V(C_1\cup\cdots \cup C_k)=V(G)$. This conjecture is also verified for k=2 in [H. Wang,  (1999), pp. 115--121]. We prove this conjecture for k=3 in this paper.

title: A dependable Peer-to-Peer computing platform
abstract: This paper discusses a dependable and widely applicable Peer-to-Peer (P2P) computing platform. As the existing P2P computing platforms are limited due to the lack of support for various computational models, this paper proposes a workflow management mechanism to support task dependency in parallel programs while increasing computing efficiency. In general, task dependency leads to a serious performance degradation for failed task re-execution because of volatile peers. Therefore, it results in low dependability. Here, dependability is defined as a comparison of the actual performance with task failures to the theoretical one without failure on a P2P computing platform. Redundant task dispatch and a runtime optimization method are proposed to guarantee high dependability even with highly volatile peers. Large-scale simulation results indicate that the computing platform efficiently solves the problem of P2P computing due to volatile peers.

title: Minimum entropy of B-spline PDF systems with mean constraint
abstract: For the B-spline approximation of the continuous probability density function (PDF), the relationships between the B-spline weights and entropy both in general and under the mean constraint have been analyzed. It provides the conditions under which the minimum entropy can be achieved subject to the mean constraint. The difference between the entropy of continuous and discrete distributions has also been clarified. A minimum entropy controller with the mean constraint is then developed and several simulations are performed to verify the main results.

title: Temperature dependence of DC characteristics of NpN InP/GaAsSb/InP double heterojunction bipolar transistors: an analytical study
abstract: An analytic study of DC characteristics based on the drift-diffusion approach has been performed for the InP/GaAsSb DHBTs. The current transport of InP/GaAsSb/InP DHBTs has been investigated focusing the device temperature dependence. Our simulation results show that, at room temperature, the DC characteristics of the InP/GaAsSb/InP DHBTs similar to the conventional InP-based HBT using InGaAs as the base layer although a type-II energy band alignment is presented in the InP/GaAsSb HBT. However, due to different mechanisms for the electron injection from the emitter induced by the different conduction band alignments, the InP/GaAsSb HBTs may present a different temperature dependent behavior in term of device current gain as compared to the conventional InP/InGaAs HBTs. Higher current gain could be achieved by the InP/GaAsSb HBTs at elevated temperature.

title: An Intelligent Mill Load Switching Control of the Pulverizing System for an Alumina Sintering Process
abstract: This paper proposes an intelligent switching control strategy for the pulverizing system for an alumina sintering process. The control strategy consists of a coordinating controller, a proportional-integral (PI) controller, a rule-based reasoning controller and a switching mechanism. The practical application to a pulverizing system in an alumina sintering process has shown that when the hot air temperature is low and varies frequently, this control strategy ensures that the mill load and the temperature of the mill outlet are both within their required ranges, and also controls the mill load at the level corresponding to the maximum mill output. Moreover, it has been observed that the proposed control strategy can avoid the fault operating condition and effectively reduce the unit energy consumption.

title: An Algorithm for Identification of Reduced-Order Dynamic Models of Gas Turbines
abstract: Model based approaches show a lot of advantages for fault detection and condition monitoring. Particularly, it is true in employing reduced order models for real-time parameter identification and output prediction of gas turbines. Many algorithms have been developed, but most of them focus on one-step-ahead prediction models and involve complex computation. These algorithms are not acceptable for long-term prediction and real-time condition monitoring. In this paper, an improved gradient method (dynamic gradient descent) is proposed. The idea is to take account of the dependency of prediction errors and calculate the gradient information recursively. Not only low computation expense is achieved, but the non-Gaussian errors can also be overcome when this approach is applied to estimate parameters of a reduced order gas turbine model and to improve long-term prediction