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?(?).
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.
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
41806675
On Diagonally 10-Coloring Plane Triangulations
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. © 1996 John Wiley & Sons, Inc.
38637293
On spanning trees and walks of low maximum degree
34975665
MBBNTree Classifier Algorithm Based on Active Learning from Unlabeled Samples
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.
421418
A Neighborhood-Based Clustering Algorithm
In this paper, we present a new clustering algorithm, NBC, i.e., Neighborhood Based Clustering, which discovers clusters based on the neighborhood characteristics of data. The NBC algorithm has the following advantages: (1) NBC is effective in discovering clusters of arbitrary shape and different densities; (2) NBC needs fewer input parameters than the existing clustering algorithms; (3) NBC can cluster both large and high-dimensional databases efficiently.
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.
5668902
Optimal Spectrum Management in Multiuser Interference Channels
In this paper, we study the problem of continuous frequency optimal spectrum management in multiuser frequency selective interference channels. We assume that interference is treated as noise by the decoders, and separate encoding is applied. First, a simple pair-wise channel condition for frequency division multiple access schemes to achieve all Pareto optimal points of the rate region is derived. It enables fully distributed global optimal decision making on whether any two users should use orthogonal channels. Next, we present an analytical solution to finding the maximum sum-rate in two-user symmetric frequency flat channels. Generalizing this solution to frequency selective channels, a convex optimization is established that yields the global optimum. Finally, we show that our method generalizes to K-user (K ≥ 2) weighted sum-rate maximization in asymmetric frequency selective channels, and we transform this classic nonconvex optimization to an equivalent convex optimization in the primal domain.