5928457
Permutation graphs and Petersen graph
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.
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.
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.
46565546
Arc-disjoint circuits in digraphs
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
313172
Minimum register instruction sequence problem: revisiting optimal code generation for DAGs
We revisit the optimal code generation or evaluation order determination problem-the problem of generating an instruction sequence from a data dependence graph (DDG). In particular, we are interested in generating an instruction sequence S that is optimal in terms of the number of registers used by the sequence S. We call this MRIS (Minimum Register Instruction Sequence) problem. We developed an efficient heuristic solution for the MRIS problem based on the notion of instruction lineage. This solution facilitates the sharing of registers among instructions within a lineage and across lineages by exploiting the structure of a DDG. We implemented our solution on a production compiler and measured the reduction in the number of (spill) loads and (Spill) stores and the wall-clock execution time for the SPEC95 floating point benchmark suite. On average our method reduced the number of loads and stores by 11.5% and 15.9%, respectively, and decreased the total execution time by 2.5%.
6417923
Analysis of Sound Features for Music Timbre Recognition
Recently, communication, digital music creation, and computer storage technology has led to the dynamic increasing of online music repositories in both number and size, where automatic content-based indexing is critical for users to identify possible favorite music pieces. Timbre recognition is one of the important subtasks for such an indexing purpose. Lots of research has been carried out in exploring new sound features to describe the characteristics of a musical sound. The moving picture expert group (MPEG) provides a standard set of multimedia features, including low level acoustical features based on latest research in this area. This paper introduces our newly designed temporal features used for automatic indexing of musical sounds and evaluates them with MPEG7 descriptors, and other popular features.
28387556
Perceiving Environments for Intelligent Agents
One of the important characteristics for intelligent agents is to be able to assess their environments in order to decide on the correct action to take. It is always difficult to do so because many factors including uncertain information, knowledge and bounded time will affect intelligent agent to perceive their environments. In this paper, we propose a procedure descriptive framework to perceive the environments for intelligent agents. The process of belief updating in this framework remains to be constantly changing, until the point of decision making is reached. During the dynamic change of beliefs, the intelligent agents will incorporate their knowledge about other agents, and the possible uncertain information they received from their local sensors and other agents.
1804026
PRISM is research in aSpect mining
Aspect oriented programming (AOP) provides programmers with a new level of modularization capability. Although improving the aspect oriented languages seems to be the most eminent task, we recognize that it is equally important for (professional) software developers to properly leverage the power of AOP and to apply AOP at large scales. As many researchers have realized, one of the best ways to assess the practicality of AOP is to retrofit AOP onto legacy software systems [6, 7, 1]. One of the important activities in doing so is aspect mining. Aspect mining aims at finding non-localized programming concerns of very large software systems, which in turn provide opportunities for aspect oriented modularization and aspect oriented refactoring. Existing work of aspect mining focuses on aspect visualization and aspect browsing [3, 2]. These tools often involve tedious human interactions for complex pattern definition over large code base. Inspired by AMT [3], AMTEX [5] is a step towards building an aspect mining environment which facilitates either autonomous or assisted aspect discovery. Prism is a major extension of AMTEX, which is designed for IDE integration, cross-language mining support, and multimodal analysis. Prism is also an extensible mining platform, which is open for supporting new mining techniques. The current implementation of Prism is built as an Eclipse plugin. It supports Java systems and partially supports C# programs. Through Prism, users can define complex lexical, semantic, and syntactical patterns. The Prism engine
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.