Evolving Model for Small-World Network Based on Benefit Choice
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: 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.

title: Tibetan Language Continuous Speech Recognition Based on Dynamic Bayesian Network
abstract: Dynamic Bayesian Networks (DBN) area subset of the probabilistic graphical models (PGM) which include hidden Markov model (HMM) as a special case. One of the principle weaknesses of HMMs is the independence assumptions on the observed and hidden processes of speech. This paper proposed to use the DBN for Tibetan language continuous speech recognition.The proposed approach is based on structure learning paradigm in DBN framework. This approach has the advantage to guaranty that the resulting model represents speech with higher fidelity than HMM. The results of recognition experiments show that the proposed algorithm has better performance of recognition rate and noise suppression compared with HMM.

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: Planar Graphs of Maximum Degree Seven are Class I
abstract: In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic number equal to their maximum degree. He conjectured the same if the maximum degree is either six or seven. This article proves the maximum degree seven case.

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: 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: Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic epsilon in {-1, -2, -3}
abstract: In this paper, we consider the problem of determining the maximum of the set of maximum degrees of class two graphs that can be embedded in a surface. For each surface @S, we define @D(@S)=max{@D(G)|G is a class two graph of maximum degree @D that can be embedded in @S}. Hence Vizing's Planar Graph Conjecture can be restated as @D(@S)=5 if @S is a plane. We show that @D(@S)=7 if @e(@S)=-1 and @D(@S)=8 if @e(@S)@?{-2,-3}.