Separated from GUI builders, existing GUI building tools for XML are complex systems that duplicate many functions of GUI builders. They are specialized in building GUIs for XML data only. This puts unnecessary burden on developers since an application usually has to handle both XML and non-XML data. In this paper, we propose a solution that separates the XML-to-GUI bindings from the construction of the GUIs for XML, and concentrates on the XML-to-GUI bindings only. Cooperating with a GUI builder, the proposed system can support the construction of the GUIs for XML as GUI building tools for XML can. Furthermore, the proposed mechanism is neutral to GUI builders and toolkits. As a result, multiple GUI builders and toolkits can be supported by the proposed solution with moderate effort. Our current implementation supports two types of GUI platforms: Java/Swing and Web/Html.

Interactions with human users are a crucial part of many workflow applications. In workflow or business process management specifications, such as WSBPEL, all data are represented as XML. As a consequence, many human tasks simply support users to create or update XML data compliant with a schema. We propose the XML interaction service as a generic Web service for use by human tasks that provides HTML form-based Web interfaces for users to interact with and update schema-compliant XML data. In addition, a visual interface design tool is provided for interface designers to create and customize the Web interfaces an XML interaction service supports.

The proliferation of brand slogans via advertising channels is blurring the distinction between brains and brands. Brand slogans are designed to have positive effects on their brands. However, it is a non-trivial task to examine how brand slogans affect their customers' emotions and how emotions influence perceptions of brand images. In this paper we demonstrate the slogan validator, a novel and language-independent application that can be utilized to evaluate brand slogans by analyzing speech signals from customers' voice of slogans. The intention was to provide a means of exploring whether or not some of the claimed effects for existing brand slogans could actually be realized by the emotion recognition in speech technique rather than the traditional questionnaire responses. The preliminary results of the experiment show that the slogan validator yields high consistency with the participants' actual perceptions of the brand slogans chosen for this research. Moreover, the variation among participants' preferences of these brands can be identified

So far, many user interfaces for XML data (documents) have been constructed from scratch for specific XML vocabularies and applications. The tool support for user interfaces for XML data is inadequate. Forms-XML is an interactive component invoked by applications for generating user interfaces for prescribed XML vocabularies automatically. Based on a given XML schema, the component generates a hierarchy of HTML forms for users to interact with and update XML data compliant with the given schema. The user interface Forms-XML generates is very simple with an abundance of guidance and hints to the user, and can be customized by user interface designers as well as developers.

By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations altogether, thus freeing the user from any syntactic concerns. Based on the proposed algorithms and process, we build an XML editor with forms as its user interface.

Abstract We describe the design and implementation of system architecture to support object introspection in C++. In this system, information is collected by parsing class declarations, and is used to build a supporting environment for object introspection. Our approach is non‐intrusive because it requires no changes in the original class declarations and libraries; hence, binary compatibility between objects before and after the addition of introspective capability is ensured. This is critical if one wants to integrate third‐party class libraries, which are often supplied as black boxes and allow no modification, into highly dynamic applications. We present two applications: the first is automatic I/O support for C++ objects, and the other is interactive exercise of dynamically loaded C++ class libraries. Copyright © 2001 John Wiley & Sons, Ltd.

We describe the design and implementation of system architecture to support object introspection in C++. In this system, information is collected by parsing class declarations, and used to build a supporting environment for object introspection. Our approach is nonintrusive because it requires no change to the original class declarations and libraries, and it guarantees compatibility between objects before and after the addition of introspective capability. This is critical if one wants to integrate third-party class libraries, which are often supplied as black boxes and allow no modification, into highly dynamic applications. We show two applications: automatic I/O support for C++ objects; and an interactive exercise of dynamically loaded C++ class libraries.

In object-oriented software development, it is generally accepted that inheritance should be used just to model a generalization/specialization relationship (i.e., an IS-A). This analysis/design guideline is too permissive. Some researchers thus advocate that a subclass should inherit the full behavior of its superclass. Behavior inheritance, however, is far too restricted. In this paper, we establish a formal model that can clearly differentiate IS-A from behavior inheritance. Under this model, IS-A and behavior inheritance can be decomposed into more fundamental concepts: subset and abstraction/concretization. Also, we are able to develop a set of refined guidelines regarding the use of inheritance.

In object-oriented software development, it is generally accepted that inheritance should be used just to model a generalization/specialization relationship (i.e. an IS-A relation). This analysis/design guideline is too permissive. Some researchers thus advocate that a subclass should inherit the full a behavior of its superclass. Behavior inheritance, however, is far too restricted. In this paper, we establish a formal model that can clearly differentiate IS-A from behavior inheritance. Under this model, IS-A and behavior inheritance can be decomposed into more fundamental concepts: subsets and abstraction/concretization. Also, we are able to develop a set of refined guidelines regarding the use of inheritance.>

Abstract HAGI is an object‐oriented graphics system developed on top of the X window system. In addition to providing facilities that structured graphics systems such as GKS usually have, HAGI supports a high‐ level graphics paradigm with the following features: In addition to graphical objects, the system provides a class of application objects with a higher level of abstraction than graphical objects. Graphics manipulation operations can be issued simplyfrom application objects without explicitly referring to specific graphical objects. Thus graphics manipulation appears to be transparent to application programmers. Graphical objects are designed to encompass more semantics, thus are at a level close to the application. For example, they useflexible visual objects to determine their visual appearance. HAGI provides such a high‐level application/graphics interface by maintaining a dependency relationship between graphical objects and application objects.

The real-weight maximum cut of a planar graph is considered. Given an undirected planar graph with real-value weights associated with its edges, the problem is to find a partition of the vertices into two nonempty sets such that the sum of the weights of the edges connecting the two sets is maximum. The conventional maximum cut and minimum cut problems assume nonnegative edge weights, and thus are special cases of the real-weight maximum cut. An O(n/sup 3/2/ log n) algorithm for finding a real-weight maximum cut of a planar graph where n is the number of vertices in the graph is developed. The best maximum cut algorithm previously known for planar graphs has running time of O(n/sup 3/).>

The author proposes a data structure for the cell map in order to eliminate excess page faults present in the traditional 2-D array structure. Experiments have shown that this representation can effectively eliminate 90% of the page faults. Thus, the performance of routing algorithms can be greatly improved. The proposed structure is very general. The majority of layout algorithms (if not all) based on the 2-D cell map can be modified easily to work with this 1-D structure.>

Abstract The problem of compacting a programmable logic array is formulated as the following graph problem. Given a red‐edge bipartite graph, how to add maximum number of independent green edges such that there are no cycles formed by alternating red and green edges. For this NP‐complete problem, we present a polynomial heuristic algorithm which gives an optimum solution when the red bipartite graph satisfies certain conditions, e.g., a tree. When the bipartite graph does not satisfy these conditions, the heuristic algorithm gives a solution with worst‐case error bound. For a red bipartite graph with given cardinality, we give a tight upper bound on the number of green edges.

Detecting essential primes is important in multiple-valued logic minimization. In this correspondence, we present a fast algorithm that can generate all essential primes without generating a prime cover of the Boolean function. A new consensus operation called asymmetric consensus (acons) is defined. In terms of acons, we prove a necessary and sufficient condition for detecting essential primes for a Boolean function with multiple-valued inputs. The detection of essential primes can be performed by using a tautology checking algorithm. We exploit the unateness of a Boolean function to speed up tautology checking. The notion of unateness considered is more general than that has appeared in the literature.

Detecting essential primes is important in multiple-valued logic minimization. In this paper, We present a fast algorithm that can generate all essential primes without generating a prime cover of the Boolean function. A new consensus operation called asymmetric consensus (acons) is defined. In terms of acons, we prove a necessary and sufficient condition for detecting essential primes for a Boolean function with multiple-valued inputs. The detection of essential primes can be performed by using a tautology checking algorithm. We exploit the unateness of a Boolean function to speed up tautology checking. The notion of unateness considered is more general than that has appeared in the literature.

The folding of programmable logic array (PLA) is considered. We develop a heuristic algorithm for optimal block folding. The algorithm is based on the column intersection graph associated with the PLA. Then the techniques of graph partitioning and two-objective linear programming are applied. Test results will be demonstrated to show the effectiveness of the algorithm.