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.
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.
15396012
Silicon Wafer Defect Extraction Based on Morphological Filter and Watershed Algorithm
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.
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.
6844020
On non-null separating circuits in embedded graphs
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.
206571175
A New Bound on the Cyclic Chromatic Number
In 1969, Ore and Plummer defined an angular coloring as a natural extension of the Four Color Problem: a face coloring of a plane graph where faces meeting even at a vertex must have distinct colors. A natural lower bound is the maximum degree ? of the graph. Some graphs require ?32?? colors in an angular coloring. Ore and Plummer gave an upper bound of 2?, which was improved to ?95?? by the authors with Borodin. This article gives a new upper bound of ?59?? on the angular chromatic number. The cyclic chromatic number is the equivalent dual vertex coloring problem.