80453
Chords of longest circuits in locally planar graphs
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a chord. This conjecture is verified for locally 4-connected planar graphs, that is, let N be the set of natural numbers; then there is a function h : N → N such that, for every 4-connected graph G embedded in a surface S with Euler genus g and face-width at least h(g), every longest circuit of G has a chord.
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
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.
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.
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.
14923326
Co-histogram and Image Degradation Evaluation
The tool for image degradation evaluation addressed in this paper is called co-histogram, which is a statistic graph generated by counting the corresponding pixel pairs of two images. The graph is a two-dimensional joint probability distribution of the two images. A co-histogram shows how the pixels are distributed among combinations of two image pixel values. By means of co-histogram, we can have a visual understanding of PSNR, and the symmetry of a co-histogram is also significant for objective evaluation of image degradation. Our experiments with image degradation models of image compression, convolution blurring and geometric distortion perform the importance of the co-histogram.
10867502
Robust Visual Tracking via Pixel Classification and Integration
We propose a novel framework for tracking non-rigid objects via pixel classification and integration (PCI). Given a new input frame, the tracker first performs object classification on each pixel and then finds the region that has the highest integral of scores. There are several key advantages of the proposed approach: it is computationally very efficient; it finds a global, instead of local (e.g., mean-shift), optimal solution within a search range; and it is inherently robust to different object scales with minimum extra computation. Within this framework, a mixture of long-term and short-term appearance model is further introduced to perform PCI. As a result, the tracker is able to adapt to both slow and rapid appearance changes without drifting. Challenging video sequences are presented to illustrate how the proposed tracker handles large motion, dramatic shape changes, scale variations, illumination variations and partial occlusions
206618709
Building an Ontology for Financial Investment
Intelligent agent technologies hold great promise for the financial services and investment industries such as portfolio management. In financial investment, a multi-agent system approach is natural because of the multiplicity of information sources and the different expertise that must be brought to bear to produce a good recommendation (such as a stock buy or sell decision). The agents in a multi-agent system need to coordinate, cooperate or communicate with each other to solve a complex problem. However, ontologies are a key component in how different agents in a multi-agent system can communicate effectively, and how the knowledge of agents can develop. This paper presents a case study in building an ontology in financial investment. The lessons we learned from the construction process are discussed. Based on our ontology development experience and the current development of ontologies, a framework of next generation ontology construction tools, which is aimed to facilitate the ontology construction, is proposed.
6431749
Reasoning with Multimedia Information Using Symbolic Projection
In many multimedia application systems, it is not the final goal to retrieve the relevant multimedia information from different multimedia information sources. Rather, post-processing of the retrieved multimedia information is needed. For example, the retrieved information is used as "known facts". The systems will do some reasoning to obtain further conclusions based on these multimedia form "known facts". We call this reasoning with multimedia information. Most current research work in multimedia information processing is focused on multimedia information retrieval, but post-processing the retrieved information is more or less ignored. This paper explores the way to tackle this problem by using symbolic projection. A case study of reasoning with still image information is presented. Some extensions to symbolic projection-introducing auxiliary pictorial objects in symbolic pictures that need to be processed-are discussed. We expect this paper will stimulate further research on this important but ignored topic.
33105882
CyberBridges A Model Collaboration Infrastructure for e-Science
The "CyberBridges" pilot project is an innovative model for creating a new generation of scientists and engineers who are capable of fully integrating cyberinfrastructure into the whole educational, professional, and creative process of their respective disciplines. CyberBridges augments graduate student education to include a foundation of understanding in advanced networking and grid infrastructure for high performance computing, and bridges the divide between the information technology community and diverse science and engineering disciplines. We demonstrate the effectiveness of CyberBridges by providing four case studies. Groundwork has begun to extend the outreach of CyberBridges for international research and education collaborations.