20943799
On 2-Connected Spanning Subgraphs with Low Maximum Degree
Given a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at mostk. Also, let?(G) be the Euler characteristic ofG. This paper shows that every 3-connected graphGhas a (10?2?(G))-trestle. If?(G)??5, this is improved to 8?2?(G), and for?(G)??10, this is further improved to 6?2?(G). This result is shown to be best possible for almost all values of?(G) by the demonstration of 3-connected graphs embedded on each surface of Euler characteristic??0 which have no (5?2?)-trestle. Also, it is shown that a 4-connected graph embeddable on a surface with non-negative Euler characteristic has a 3-trestle, approaching a conjecture of Nash-Williams.
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.
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
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.
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.
18369572
Recursive Algorithms for a Novel Identification Criterion
A new identification criterion is concerned for disturbed system with color noise in this paper. The cost function considers both the errors between the actual outputs and the estimation result and the difference of each estimation error. Under this performance function, a new recursive algorithm DSCN (Disturbed System with Color Noise) is proposed. It could reduce the influence of noise in system identification, further decrease the prediction error. Several simulation examples are given to illustrate the method's anti-disturbance performance.
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.
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.
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.
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.