18082444
Circuit Decompositions of Eulerian Graphs
Let G be an eulerian graph. For each vertex v?V(G), let P(v) be a partition of the edges incident with v and set P=?v?V(G)P(v), called a forbidden system of G. We say that P is admissible if |P?T|?12|T| for every P?P and every edge cut T of G. H. Fleischner and A. Frank (1990, J. Combin. Theory Ser. B50, 245?253) proved that if G is planar and P is any admissible forbidden system of G, then G has a circuit decomposition F such that |C?P|?1 for every C?F and every P?P. We generalize this result to all eulerian graphs that do not contain K5 as a minor. As a consequence, a conjecture of Sabidussi is settled for graphs that do not contain K5 as a minor. Also, as a byproduct, our proof provides a different approach to the circuit cover theorem of B. Alspach, L. A. Goddyn, and C.-Q. Zhang (1994, Trans. Amer. Math. Soc.344, No. 1, 131?154).
17086856
A note about shortest cycle covers
Let G be a graph with odd edge-connectivity r. It is proved in this paper that if r>3, then G has a 3-cycle (1,2)-cover of total length at most ((r+1)|E(G)|)/r.
46565546
Arc-disjoint circuits in digraphs
36530209
Determination of the star valency of a graph
The star valency of a graph G is the minimum, over all star decompositions π, of the maximum number of elements in π incident with a vertex. The maximum average degree of G, denoted by dmax-ave(G), is the maximum average degree of all subgraphs of G. In this paper, we prove that the star valency of G is either ⌈dmax-ave(G)/2⌉ or ⌈dmax-ave(G)/2⌉ + 1, and provide a polynomial time algorithm for determining the star valency of a graph.
17466332
Nowhere-zero 3-flows in products of graphs
A graph G is an odd-circuit tree if every block of G is an odd length circuit. It is proved in this paper that the product of every pair of graphs G and H admits a nowhere-zero 3-flow unless G is an odd-circuit tree and H has a bridge. This theorem is a partial result to the Tutte’s 3-flow conjecture and generalizes a result by Imrich and Skrekovski [7] that the product of two bipartite graphs admits a nowhere-zero 3-flow. A byproduct of this theorem is that every bridgeless Cayley graph G 1⁄4 Cayð ;SÞ on an abelian group with a minimal generating set S admits a nowhere-zero 3-flow except for odd prisms. 2005 Wiley Periodicals, Inc. J Graph Theory 50: 79–89, 2005
13303898
Chords of longest circuits in 3-connected graphs
Thomassen conjectured that every longest circuit of a 3-connected graph has a chord. The conjecture is verified in this paper for projective planar graphs with minimum degree at least 4.
31582417
An Agent-Based Soft Computing Society
Soft computing (SC) techniques such as fuzzy logic (FL), neural networks (NN), and genetic algorithms (GA) are complementary. Each SC technique has particular computational properties that make them suited for particular problems and not for others. Thus, in solving complex, real-world problems, we need to incorporate some SC techniques into the application systems to increase the systems' "intelligence". In this paper, we first propose an agent-based framework for integrating SC techniques into practical application systems. We then discuss the design and implementation of a platform independent soft computing support environment based on the framework. We call such an environment agent-based soft computing society. Such a society can facilitate the design of truly robust, flexible and adaptive hybrid intelligent systems.
12091703
Indexing and retrieval of 3D models aided by active learning
We demonstrate a system for indexing and retrieval of 3D models aided by active learning. We propose a new set of region-based features for 3D models. Each model is treated as a solid volume with a uniform density. Features such as the volume-surface ratio, the moment invariants and the Fourier transform coefficients are efficiently calculated from the mesh model directly. Comparable retrieval performance is achieved with other features such as the cord histogram, the 3D shape spectrum, etc. To further improve the performance, we incorporate hidden annotation into our system. We propose to use active learning to improve the annotation efficiency. We show that with active learning, the system can perform better than random annotation, and the retrieval result improves rapidly with the number of annotated samples. Moreover, relevance feedback is included in the system and combined with active learning, which provides better user-adoptive retrieval results.
11885669
A decision tree-based multimodal data mining framework for soccer goal detection
We propose a new multimedia data mining framework for the extraction of soccer goal events in soccer videos by using combined multimodal analysis and decision tree logic. The extracted events can be used to index the soccer videos. We first adopt an advanced video shot detection method to produce shot boundaries and some important visual features. Then, the visual/audio features are extracted for each shot at different granularities. This rich multimodal feature set is filtered by a pre-filtering step to clean the noise as well as to reduce the irrelevant data. A decision tree model is built upon the cleaned data set and is used to classify the goal shots. Finally, the experimental results demonstrate the effectiveness of our framework for soccer goal extraction.
207326756
Estimating the amount of defocus through a wavelet transform approach
This paper presents a new technique for defocus estimation of a captured image. In our method, a ratio of the wavelet coefficients of high frequency correspond to a same image point at two different levels is used. For an edge point, it is shown that the ratio is related to the amount of defocus. Let α be the ratio of wavelet coefficients at the first level to that at the second level. The value of α decreases as the amount of defocus increase. In our experiments of iris image analysis, when α is larger than 0.5 the number of feature points in an image almost remain constant. It means that the image is little defocused and available for image recognition. Compared with Fourier methods, this technique is more robust. In addition, this method is fast enough to be used in auto-focus system for tracking moving objects.
9240156
TeraScope: distributed visual data mining of terascale data sets over photonic networks
TeraScope is a framework and a suite of tools for interactively browsing and visualizing large terascale data sets. Unique to TeraScope is its utilization of the Optiputer paradigm to treat distributed computer clusters as a single giant computer, where the dedicated optical networks that connect the clusters serve as the computer's system bus. TeraScope explores one aspect of the Optiputer architecture by employing a distributed pool of memory, called LambdaRAM, that serves as a massive data cache for supporting parallel data mining and visualization algorithms.