Tibetan Language Continuous Speech Recognition Based on Dynamic Bayesian Network
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: 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: A Working Model for Real-time Interactive Distance Education Support Systems
abstract: In Japan, most of the real time distance learning systems constructed over JGN (Japan Gigabit Network) are simple applications of video conference system equipped with high-quality audio/video transmission equipment. Such systems are not modeled to add distance educational support such as real time floor control, and are insufficient and inefficient to perform real time distance lecture or seminar when the number of sites get larger. This paper proposes a Working Model for distributed computer systems supporting real-time interactive distance lectures or seminars over JGN. As an application of the working model, functions for floor control and tele-presentation were discussed. The utility of the proposed working model was confirmed with an experimental system.

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 five-color theorem
abstract: In this note, we show that the edges and faces of any plane graph with maximum degree three can be simultaneously colored with five colors.

title: New lower bounds for the size of edge chromatic critical graphs

title: On total 9-coloring planar graphs of maximum degree seven
abstract: Given a graph G, a total k-coloring of G is a simultaneous coloring of the vertices and edges ofGwith at most k colors. If ∆(G) is the maximum degree ofG, then no graph has a total ∆-coloring, but Vizing conjectured that every graph has a total (∆ + 2)-coloring. This Total Coloring Conjecture remains open even for planar graphs. This article proves one of the two remaining planar cases, showing that every planar (and projective) graph with ∆ ≤ 7 has a total 9-coloring by means of the discharging method.