11764310
Symmetric drawings of triconnected planar graphs
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we need two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our aim in this paper is to construct maximally symmetric straight-line drawings of triconnected planar graphs in linear time. Previously known algorithms run in quadratic time. We show that an algorithm of Fontet can be used to find an embedding in the plane with the maximum number of symmetries, and present a new algorithm for finding a straight line drawing that achieves that maximum. Both algorithms run in linear time.
653040
The Puzzle Layout Problem
This poster describes an implementation of the puzzle generators and puzzle layouts introduced in [1].
40285902
Isoperimetric numbers and bisection widths of double coverings of a complete graph
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.
7349909
Reconstructing a formal security model
Abstract Role-based access control (RBAC) is a flexible approach to access control, which has generated great interest in the security community. The principal motivation behind RBAC is to simplify the complexity of administrative tasks. Several formal models of RBAC have been introduced. However, there are a few works specifying RBAC in a way which system developers or software engineers can easily understand and adopt to develop role-based systems. And there still exists a demand to have a practical representation of well-known access control models for system developers who work on secure system development. In this paper we represent a well-known RBAC model with software engineering tools such as Unified Modeling Language (UML) and Object Constraints Language (OCL) to reduce a gap between security models and system developments. The UML is a general-purpose visual modeling language in which we can specify, visualize, and document the components of a software system. And OCL is part of the UML and has been used for object-oriented analysis and design as a de facto constraints specification language in software engineering arena. Our representation is based on a standard model for RBAC proposed by the National Institute of Standards and Technology. We specify this RBAC model with UML including three views: static view, functional view, and dynamic view. We also describe how OCL can specify RBAC constraints that is one of important aspects to constrain what components in RBAC are allowed to do. In addition, we briefly discuss future directions of this work.
3211752
Information-Processing Costs in Online Stock Trading
The recent proliferation of online stock trading raises the question of whether online stock trading provides online investors with better benefits than does traditional brokerage-based trading. Compared to its well-known benefits such as lowered commission costs and convenience, the costs incurred to online investors before the transaction - information-processing costs - seem to have received little attention. Due to the 'do-it-yourself' nature of online stock trading, individual online traders have to expend their time and effort to reach investment decisions. More specifically, online investors need to sort out the relevant online information, reprocess it to suit their investment needs, and use the refined information to calibrate their final investment decisions. Depending on an individual investor's characteristics, the costs to reach their online transactions can vary. For some online investors, the costs can be higher than the savings in online transaction costs, thus making the overall cost of o...
3107205
Crossing Minimization for Symmetries
AbstractWe consider the problem of drawing a graph with a given symmetry
 such that the number of edge crossings is minimal. We show that this
 problem is NP-hard, even if the order of orbits around the rotation
 center or along the reflection axis is fixed.
 We devise an O(m log m) algorithm
 for computing a crossing minimal drawing if inter-orbit edges may
 not cross orbits, showing in particular that intra-orbit edges do
 not contribute to the NP-hardness of the crossing minimization
 problem for symmetries.