3-Coloring graphs embedded in surfaces
In this article, we show that there exists an integer k(Σ) ≥ 5 such that, if G is a graph embedded in a surface Σ without i-circuits, 4 ≤ i ≤ k(Σ), then G is 3-colorable.

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 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, 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: Evolving Model for Small-World Network Based on Benefit Choice
abstract: Based on reviewing the research progress of evolving model for small-world network, the defects of present studies were pointed out. Taking a square grid as the basis, an evolving model for small-world network based on benefit choice was built. This model is different from other papers in which limitation of vector' degree was considered. Then, the author proposed a simulation scheme and compared the network generated by simulation with a same scale random network. The results show that this network has small-world characteristic. Finally, several directions were given.

title: Pseudo-surface based network camera smart control
abstract: Network camera is widely used in a lot of fields, such as remote monitoring, video conference. However, in almost network camera systems, the camera remote control is realized by using a remote controller or a personal computer with a crude user interface. This kind of control methods are not effective in the situation such as real time distance class where a smart operation is needed for the teacher. This article proposes a pseudo-surface based control method for network camera remote control. This method can improve the operativeness of the network camera control without using special devices other than a control computer. The effectiveness of this method was proven by a simulation system. In this article the principle of this method is described, and several examples of it are introduced.

title: Silicon Wafer Defect Extraction Based on Morphological Filter and Watershed Algorithm
abstract: Defect extraction techniques are studied regarding the silicon wafer surface defect. We design a new filter based on multiple structuring elements and suggest an improved marker-based and region merging watershed. To begin with, the filter which generalized close-opening and open-closing filter based on the morphological filter with multiple structuring elements is introduced to eliminate the noise and simplify the image and morphological gradient image while preserving the details. And then in order to reduce the over-segmentation of the watershed algorithm, this paper suggests an improved marker-based and region merging method, region average gray value and edge strength criterion is used in merging operation and has a good effect on segmentation. Finally, the improved watershed algorithm is applied to the filtered gradient image to get the defect contours. The experiments show that this method can eliminate the noises and extract accurately location and closed region contours, which lays a good foundation for defect feature extraction and selection.

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