14536749
Bartholdi zeta functions of graph bundles having regular fibers
As a continuation of computing the Bartholdi zeta function of a regular covering of a graph by Mizuno and Sato in J. Combin. Theory Ser. B 89 (2003) 27, we derive in this paper some computational formulae for the Bartholdi zeta functions of a graph bundle and of any (regular or irregular) covering of a graph. If the fiber is a Schreier graph or it is regular and the voltages to derive the bundle or the covering lie in an Abelian group, then the formulae can be simplified. As a byproduct, the Bartholdi zeta functions of Schreier graphs, Cayley graphs and the cartesian product of a graph and a regular graph are obtained.
623251
Isomorphism classes of bipartite cycle permutation graphs
207081381
Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups
Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors. An enumeration of the isomorphism classes of n-fold coverings of a graph G was done by Kwak and Lee [Canad. J. Math., XLII (1990), pp. 747--761] and independently by Hofmeister [Discrete Math., 98 (1991), pp. 437--444]. An enumeration of the isomorphism classes of connected n-fold coverings of a graph G was recently done by Kwak and Lee [J. Graph Theory, 23 (1996), pp. 105--109]. But the enumeration of the isomorphism classes of regular coverings of a graph G has been done for only a few cases. In fact, the isomorphism classes of ${\cal A}$-coverings of G were enumerated when ${\cal A}$ is the cyclic group $\BZ_n$, the dihedral group $\BD_n$ (n: odd), and the direct sum of $m$ copies of $\BZ_p$. (See [Discrete Math., 143 (1995), pp. 87--97], [J. Graph Theory, 15 (1993), pp. 621--627], and [Discrete Math., 148 (1996), pp. 85--105]). 
In this paper, we discuss a method to enumerate the isomorphism classes of connected ${\cal A}$-coverings of a graph G for any finite group ${\cal A}$ and derive some formulas for enumerating the isomorphism classes of regular n-fold coverings for any natural number n. In particular, we calculate the number of the isomorphism classes of ${\cal A}$-coverings of G when ${\cal A}$ is a finite abelian group or the dihedral group $\BD_n$. Our method gives partial answers to the open problems 1 and 2 in [Discrete Math., 148 (1996), pp. 85--105] and also gives a formula to calculate the number of the subgroups of a given index of any finitely generated free abelian group.
16002222
Isomorphism classes of cycle permutation graphs
Abstract In this paper, we construct a cycle permutation graph as a covering graph over the dumbbell graph, and give a new characterization of when two given cycle permutation graphs are isomorphic by a positive or a negative natural isomorphism. Also, we count the isomorphism classes of cycle permutation graphs up to positive natural isomorphism, and find the number of distinct cycle permutation graphs isomorphic to a given cycle permutation graph by a positive/negative natural isomorphism. As a consequence, we obtain a formula for finding the number of double cosets of the dihedral group in the symmetric group.
3161617
Isomorphism Classes of Concrete Graph Coverings
Hofmeister introduced the notion of a concrete (resp., concrete regular) covering of a graph G and gave formulas for enumerating the isomorphism classes of concrete (resp., concrete regular) coverings of G [Ars Combin., 32 (1991), pp. 121--127; SIAM J. Discrete Math., 8 (1995), pp. 51--61]. In this paper, we show that the number of the isomorphism classes of n-fold concrete (resp., concrete regular) coverings of G is equal to that of the isomorphism classes of n-fold (resp., regular) coverings of a new graph, the join $G+\infty$ of G and an extra vertex $\infty$. As a consequence, we can enumerate the isomorphism classes of concrete (resp., concrete regular) coverings of a graph by using known formulas for enumerating the isomorphism classes of coverings (resp., regular coverings) of a graph.
40285902
Isoperimetric numbers and bisection widths of double coverings of a complete graph
9196724
STRG-Index: spatio-temporal region graph indexing for large video databases
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for modeling semantically rich and complicated multimedia data. However, there are few methods that consider the temporal feature of video data, which is a distinguishable and representative characteristic when compared with other multimedia (i.e., images). In order to consider the temporal feature effectively and efficiently, we propose a new graph-based data structure called Spatio-Temporal Region Graph (STRG). Unlike existing graph-based data structures which provide only spatial features, the proposed STRG further provides temporal features, which represent temporal relationships among spatial objects. The STRG is decomposed into its subgraphs in which redundant subgraphs are eliminated to reduce the index size and search time, because the computational complexity of graph matching (subgraph isomorphism) is NP-complete. In addition, a new distance measure, called Extended Graph Edit Distance (EGED), is introduced in both non-metric and metric spaces for matching and indexing respectively. Based on STRG and EGED, we propose a new indexing method STRG-Index, which is faster and more accurate since it uses tree structure and clustering algorithm. We compare the STRG-Index with the M-tree, which is a popular tree-based indexing method for multimedia data. The STRG-Index outperforms the M-tree for various query loads in terms of cost and speed.
1058760
Enabling network-aware applications
Many high-performance distributed applications use only a small fraction of their available bandwidth. A common cause of this problem is not a flaw in the application design, but rather improperly tuned network settings. Proper tuning techniques, such as setting the correct TCP buffers and using parallel streams, are well-known in the networking community, but outside this community they are infrequently applied. In this paper, we describe a service that makes the task of network tuning trivial for application developers and users. Widespread use of this service should virtually eliminate a common stumbling block for high-performance distributed applications.
8239026
The kinetic typography engine: an extensible system for animating expressive text
Kinetic typography --- text that uses movement or other temporal change --- has recently emerged as a new form of communication. As we hope to illustrate in this paper, kinetic typography can be seen as bringing some of the expressive power of film --- such as its ability to convey emotion, portray compelling characters, and visually direct attention --- to the strong communicative properties of text. Although kinetic typography offers substantial promise for expressive communications, it has not been widely exploited outside a few limited application areas (most notably in TV advertising). One of the reasons for this has been the lack of tools directly supporting it, and the accompanying difficulty in creating dynamic text. This paper presents a first step in remedying this situation --- an extensible and robust system for animating text in a wide variety of forms. By supporting an appropriate set of carefully factored abstractions, this engine provides a relatively small set of components that can be plugged together to create a wide range of different expressions. It provides new techniques for automating effects used in traditional cartoon animation, and provides specific support for typographic manipulations.
35344991
Spatial Analysis of Linguistic Data with GIS Functions
Abstract During the 1980s techniques for analysis of geographical patterns have been refined to the point that they may be applied to data from many fields. Quantitative spatial analysis and existing functions available in geographical information systems (GIS) enable computerized implementations of these spatial analysis methods. This paper describes the application of quantitative spatial analysis and GIS functions to analysis of language data, using the extensive files of the Linguistic Atlas of the Middle and South Atlantic States (LAMSAS). A brief review of recent development of using quantitative and statistical methods for analysing linguistic data is also included.
376779
Interactive control of avatars animated with human motion data
Real-time control of three-dimensional avatars is an important problem in the context of computer games and virtual environments. Avatar animation and control is difficult, however, because a large repertoire of avatar behaviors must be made available, and the user must be able to select from this set of behaviors, possibly with a low-dimensional input device. One appealing approach to obtaining a rich set of avatar behaviors is to collect an extended, unlabeled sequence of motion data appropriate to the application. In this paper, we show that such a motion database can be preprocessed for flexibility in behavior and efficient search and exploited for real-time avatar control. Flexibility is created by identifying plausible transitions between motion segments, and efficient search through the resulting graph structure is obtained through clustering. Three interface techniques are demonstrated for controlling avatar motion using this data structure: the user selects from a set of available choices, sketches a path through an environment, or acts out a desired motion in front of a video camera. We demonstrate the flexibility of the approach through four different applications and compare the avatar motion to directly recorded human motion.