3091780
Coloring edges of graphs embedded in a surface of characteristic zero
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this type with maximum degree Δ ≤ 6 are known to exist. Hind and Zhao showed that such graphs with maximum degree Δ ge; 8 must be class one. This article shows that such graphs with maximum degree Δ = 7 also must be class one, completing the analysis of these surfaces. These are the first surfaces where the maximum degree of class two graphs has been determined.
17244078
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.
44604703
On Simultaneous Edge-Face Colorings of Plane Graphs
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.
5411554
The size of edge chromatic critical graphs with maximum degree 6
In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117–134; Russian Math Surveys 23 (1968), 125–142] conjectured that for any edge chromatic critical graph G = (V, E) with maximum degree , |E| ≥ 2{( 1)|V| + 3}. This conjecture has been verified for ≤ 5. In this article, by applying the Contract grant sponsor: Middle Tennessee State University Summer Research Grant 2004; Contract grant sponsor: China University of Mining and Technology Science Council; Contract grant number: OZK4566; Contract grant sponsor: National Security Agency; Contract grant number: MDA-904-02-1-0096 ; Contract grant number: H98230-04-1-0111. Journal of Graph Theory © 2008 Wiley Periodicals, Inc.
41760389
Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart
This paper proves the conjecture of Hornak and Jendrol' that the faces of a convex polyhedron with maximum vertex degree ? can be colored with 1+(?+7)(??1)d colors in such a way that each pair of faces that are distance at most d apart receives different colors.
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.
15753558
Pseudo-surface based network camera smart control
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.
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.
39669433
E-Mail Services on Hybrid P2P Networks
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.
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.