30819900
A note on Vizing's independence number conjecture of edge chromatic critical graphs
Abstract In 1968, Vizing conjectured that, if G is a Δ -critical graph with n vertices, then α ( G ) ⩽ n / 2 , where α ( G ) is the independence number of G. In this note, we verify this conjecture for n ⩽ 2 Δ .
22657577
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.
11791396
On total 9-coloring planar graphs of maximum degree seven
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. c © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 67–73, 1999
27555066
On the Edge Reconstruction of Graphs Embedded in Surfaces, III,
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?(?).
38637293
On spanning trees and walks of low maximum degree
6315714
On the edge-reconstruction of graphs embedded in surfaces IV
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.
27805594
Research on Query-by-Committee Method of Active Learning and Application
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. The major problem is to find the best selection strategy function to quickly reach high classification accuracy. Query-by-Committee (QBC) method of active learning is less computation than other active learning approaches, but its classification accuracy can not achieve the same high as passive learning. In this paper, a new selection strategy for the QBC method is presented by combining Vote Entropy with Kullback-Leibler divergence. Experimental results show that the proposed algorithm is better than previous QBC approach in classification accuracy. It can reach the same accuracy as passive learning with few labeled training examples.
10603661
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.
76437
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.
27085331
Design of a real-time interactive tele-exercise classroom for computer exercises over a Gigabit Network
This paper proposes a tele-exercise classroom for computer exercises over the Japan Gigabit Network. The requirements for constructing the tele-exercise classroom be discussed. The main features of the classroom are (1) a teacher can monitor a strident's operations, (2) give instructions to the student, (3) show a demonstration to the student. Besides, exercise materials and/or problems happening during the exercise class can be presented by using a synchronous/asynchronous white board, and discussions between the teacher and a student (students) can be carried out through interactive real-time video/audio. We present a systems model which shows the configuration of the system, user computer terminal types, system modes, and action modes. In addition, the extendibility of the system is considered in the model.
9627822
A Working Model for Real-time Interactive Distance Education Support Systems
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.