On the flexibility of toroidal embeddings
Two embeddings @J"1 and @J"2 of a graph G in a surface @S are equivalent if there is a homeomorphism of @S to itself carrying @J"1 to @J"2. In this paper, we classify the flexibility of embeddings in the torus with representativity at least 4. We show that if a 3-connected graph G has an embedding @J in the torus with representativity at least 4, then one of the following holds:(i)@J is the unique embedding of G in the torus; (ii)G has three nonequivalent embeddings in the torus, G is the 4-cube Q"4 (or C"4xC"4), and each embedding of G forms a 4-by-4 toroidal grid; (iii)G has two nonequivalent embeddings in the torus, and G can be obtained from a toroidal 4-by-4 grid (faces are 2-colored) by splitting i(i=<16) vertices along one-colored faces and replacing j(j=<16) other colored faces with planar patches.

title: On cyclic colorings and their generalizations
abstract: A cyclic coloring is a vertex coloring such that vertices in a face receive different colors. Let Δ be the maximum face degree of a graph. This article shows that plane graphs have cyclic 9 5 Δ -colorings, improving results of Ore and Plummer, and of Borodin. The result is mainly a corollary of a best-possible upper bound on the minimum cyclic degree of a vertex of a plane graph in terms of its maximum face degree. The proof also yields results on the projective plane, as well as for d-diagonal colorings. Also, it is shown that plane graphs with Δ=5 have cyclic 8-colorings. This result and also the 9 5 Δ result are not necessarily best possible.

title: On the edge-reconstruction of graphs embedded in surfaces IV
abstract: In this paper, by applying the discharging method, we give simple proofs that (1) every n-vertex graph with minimum degree at least 3 and girth at least 5 that is embeddable in a surface Σ of Euler characteristic at least -n/8 is edge-reconstructible, and (2) every n-vertex graph with minimum degree at least 4 that is embeddable without faces of length at most 3 in a surface Σ of Euler characteristic at least -n/6 is edge-reconstructible.

title: On Diagonally 10-Coloring Plane Triangulations
abstract: This article shows that the vertices of a plane triangulation may be colored with 10 colors such that every pair of vertices has different colors if they are either adjacent or diagonal, that is, that they are not adjacent but are adjacent to two faces which share an edge. This improves a result of Borodin, who showed that 11 colors were sufficient.

title: On the Edge Reconstruction of Graphs Embedded in Surfaces, III,
abstract: In this paper, we prove that if a connected graphGembeddable in a surface?of characteristic?(?) satisfies (1) the minimum degree ofG?5, (2) |V(G)|??43?(?), thenGis edge reconstructible. A direct consequence of the above result is that a triangulationGof a surface of characteristic?(?) is edge reconstructible if |V(G)|??43?(?).

title: On spanning trees and walks of low maximum degree

title: A conceptual model of public medical service system based-on cell phone mobile platform
abstract: In recent years, cell phones have played an increasingly important role in rapidly-developing global telecommunication services. At present, mobile business develops very fast. However, the development in other mobile service fields, such as public service, mobile medical service, etc, is still in its infant stage. Drawing on the experience of the ‘doctor workstation project’ which is cooperated by Renmin University of China and Norway Fredskorps Corporation, this paper discusses the research and implementation of the Doctor Workstation System based on cell phone mobile platform. From the practice of the Doctor Workstation System, the paper advances a conceptual model of public medical service system based-on cell phone mobile platform.

title: Recursive Algorithms for a Novel Identification Criterion
abstract: A new identification criterion is concerned for disturbed system with color noise in this paper. The cost function considers both the errors between the actual outputs and the estimation result and the difference of each estimation error. Under this performance function, a new recursive algorithm DSCN (Disturbed System with Color Noise) is proposed. It could reduce the influence of noise in system identification, further decrease the prediction error. Several simulation examples are given to illustrate the method's anti-disturbance performance.

title: E-Mail Services on Hybrid P2P Networks
abstract: As one of the most important services of Internet, e-mail is widely used in both commercial business and personal communication. In this paper, we explore ways to develop e-mail systems on P2P networks to overcome the weakness of traditional server-centric e-mail systems. We propose a framework of e-mail system based on hybrid P2P network, and present three implementations of the proposed framework, each of which has different capability, reliability. Our system is more flexible and reliable than the traditional e-mail systems.

title: Optimal Spectrum Management in Multiuser Interference Channels
abstract: In this paper, we study the problem of continuous frequency optimal spectrum management in multiuser frequency selective interference channels. We assume that interference is treated as noise by the decoders, and separate encoding is applied. First, a simple pair-wise channel condition for frequency division multiple access schemes to achieve all Pareto optimal points of the rate region is derived. It enables fully distributed global optimal decision making on whether any two users should use orthogonal channels. Next, we present an analytical solution to finding the maximum sum-rate in two-user symmetric frequency flat channels. Generalizing this solution to frequency selective channels, a convex optimization is established that yields the global optimum. Finally, we show that our method generalizes to K-user (K ≥ 2) weighted sum-rate maximization in asymmetric frequency selective channels, and we transform this classic nonconvex optimization to an equivalent convex optimization in the primal domain.

title: MBBNTree Classifier Algorithm Based on Active Learning from Unlabeled Samples
abstract: MBBNTree algorithm, which integrates the advantage of Markov blanket Bayesian networks (MBBN) and decision tree, would behave better performance than other Bayesian networks for classification. But the available training samples with actual classes are not enough for building MBBNTree classifier in practice. Active learning aims at reducing the number of training examples to be labeled by automatically processing the unlabeled examples, then selecting the most informative ones with respect to a given cost function for a human to label. In this paper, the MBBNTree classifier algorithm based on active learning would be presented to solve the problem of learning MBBNTree classifier from unlabeled samples. Experimental results show that the proposed algorithm can reach the same accuracy as passive learning with few labeled training examples.