20165974
An intelligent image retrieval system using XML
With the rapid development of Internet technology, the number of Internet users and the amount of multimedia information on the Internet is ever increasing. Recently, the Web sites, such as e-business sites and shopping mall sites, deal with lots of image information. As a result, it is required to support content-based image retrieval efficiently on such image data. This paper proposes an intelligent image retrieval system, which adopts XML technology. To support object-based content retrieval on product catalog images containing multiple objects, we describe a multilevel metadata structure representing the local features, global features, and semantics of image data. To enable semantic-based and content-based retrieval on such image data, we design an XML-schema for the proposed metadata. We also describe how to automatically transform the retrieval results into the forms suitable for the various user environments, such as Web browser or mobile browser, using XSLT. The proposed scheme can be utilized to enable efficient image metadata sharing between systems, and it will contribute in improving the retrieval correctness and the user's satisfaction on content-based e-catalog image retrieval.
242071
Searching Color Images by Emotional Concepts
Most of the content-based image retrieval systems focus on similarity- based retrieval of images by utilizing color, shape and texture features. For color-based image retrieval, the average color or color-histograms of images are widely used as feature vectors. In this paper, we propose a new searching scheme, called Fuzzy Membership Value-Indexing, to guarantee higher retrieval quality. This scheme allows us to retrieve images based on high-level emotional concepts, such as ‘cool', ‘soft', ‘strong,' etc. Each image is automatically classified into predefined emotional categories, by analyzing its color values in HSI color space and assigning appropriate fuzzy membership values. Our experimental results show that the proposed technique can reflect user's searching intention more accurately.
40285902
Isoperimetric numbers and bisection widths of double coverings of a complete graph
653040
The Puzzle Layout Problem
This poster describes an implementation of the puzzle generators and puzzle layouts introduced in [1].
9291771
Drawing Trees Symmetrically in Three Dimensions
AbstractSymmetric graph drawing enables a clear understanding of the structure of the graph. Previous work on symmetric graph drawing has focused on two dimensions. Symmetry in three dimensions is much richer than that of two dimensions. This is the first paper to extend symmetric graph drawing into three dimensions. More specifically, the paper investigates the problem of drawing trees symmetrically in three dimensions. First, we suggest a model for drawing trees symmetrically in three dimensions. Based on this model, we present a linear time algorithm for finding the maximum number of three-dimensional symmetries in trees. We also present a three-dimensional symmetric drawing algorithm for trees.

1395152
A Group-Theoretic Method for Drawing Graphs Symmetrically
Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for drawing graphs symmetrically based on group theory. More formally, we define a n-geometric automorphism group of a graph that can be displayed as symmetries of a drawing of the graph in n dimensions. Then we present an algorithm to find all 2- and 3-geometric automorphism groups of a graph. We implement the algorithm using Magma [11] and the experimental results shows that our approach is very efficient in practice. We also present a drawing algorithm to display a 2- or 3-geometric automorphism group.
2336438
Software reuse and competition: Consumer preferences in a software component market
Research on software reuse has traditionally focused on reuse among employees within the same organization. In contrast, our research investigates consumer preferences in a software component market with multiple producers and consumers of software components. We propose that empirically studying competition in software component markets is crucial to discovering success factors for improving software reuse. To facilitate such research, we have developed an experimental market laboratory called SofTrade; we report here the results of two empirical studies made possible by this environment. Our results support some existing reuse maxims, such as the concept that consumers prefer to reuse components that are general and flexible. Other established reuse beliefs are not supported by our results, such as the expectation that consumers will prefer objects with unique, complex features. Overall, the research reported here strongly supports the claim that the practice of exploring software reuse activity within real or artificial software component markets produces unique insights into how we can improve software reuse.