In this paper, the flexible widget layout (FWL) problem is formulated as a fuzzy constraint satisfaction problem (FCSP). Widget layout is one of the most important challenges for automatic generation of graphical user interfaces (GUIs). In the field of model-based user interface design, the widget layout is more complicated because the process of selecting widgets is needed. We named this automatic GUI generation accompanied by the widget selection, FWL. The FWL requires both (1) deciding which widget types and their alignments are used and (2) completing the layout in a certain time especially when the system generates them in run time. Our system automatically selects appropriate widgets and lays them out in certain rectangles. We formulate the desirability of the selection straightforward as fuzzy constraints; therefore, we can utilize existing general technique of FCSP for the FWL. We divide the layout process into three phases, and using an existing FCSP algorithm, we realize the layout in a short time enough not to keep users of the generated GUI waiting.
A fuzzy constraint satisfaction problem is an extension of the classical CSP, a powerful tool for modeling various problems based on constraints among variables, and a dynamic CSP is a framework for modeling the transformation of problems. These schemes are the technique to formulate real world problems as CSPs more easily. The CSP model that combines these is already has splendid researches. The Fuzzy Local Change algorithm is practicable enough in small-scale problems, but larger problems require the use of approximate methods. The algorithms for solving CSPs are classified into two categories: systematic searches (complete methods based on search trees), and local searches (approximate methods based on iterative improvement). Both have advantages and disadvantages.
In the work reported in this paper we tested a hybrid approximate method, called the Spread-Repair-Shrink algorithm, on dynamic, large-scale problems. The algorithm repairs local constraints by repeatedly spreading and shrinking a set of search trees until the degree to which the worst constraints (the roots of the trees) are satisfied is improved. In this process, the "stability" of solutions can be maintained because the reassignment is locally limited. Additionally, we innovate SRSD filter as after filtering. We empirically show that Spread-Repair-Shrink and SRSD algorithm keep the stability of solutions rather than other algorithms. It is able to quickly get a good-quality approximate and stabile solution to a large problem.
We propose a new solution named interface client/logic server (ICLS), targeting dialog-based interactive services, supporting user interface (UI) migration, and offering adaptive UIs for devices and services. Constant improvements of technology have brought a large variety of platforms, and that has made users' new demands about the services. The first is that the users would like to use services through different devices and modalities depending on their use contexts. The second is that the users would sometimes like to change devices and take their tasks from one to another, which is called UI migration. Our architecture ICLS is designed based on client/server model. In ICLS, we use XML documents written in abstract interaction description language (AIDL) as logical descriptions of UIs, and introduce one of the semantic web technologies adding the function of expressing meanings of interactions.
An XML-based language, abstract interaction description language (AIDL), we propose, describes abstracted interactions instead of UI descriptions and includes meanings of these interactions. Computer-based services, which are various appliances and applications operated or utilized with user interface (UI) devices, have pervaded our everyday lives. Our approach, interface client/logic server (ICLS) is a model-based UI architecture supporting UI separation, generation, and migration comprehensively. It enables users to select various devices and services according to their different needs before or during service sessions. AIDL enables our architecture ICLS to handle interactions of specific service domains maintaining the independence of services from specific devices and modalities.
We propose a new solution for the flexible widget layout (FWL) problem, formulating this problem as a fuzzy constraint satisfaction problem (FCSP) in the field of artificial intelligence. Widget layout performed by computers is one of the most important challenges for automatic generation of graphical user interfaces (GUIs). In the field of model-based user interface design, the widget layout is more complicated because the process of selecting widgets is needed. The FWL, we named, is the automatic GUI generation, which requires both (1) deciding which widget types and their alignments are used and (2) completing the layout in a certain time especially when the system generates them in run time. Our system automatically selects appropriate widgets and lays them out in certain rectangles. We formulate the desirability of the selection straightforward as fuzzy constraints; therefore, we can utilize existing technique of FCSP for the FWL. We divide the layout process into three phases, and using an existing FCSP algorithm, we realize the layout in a short time enough not to keep users of the generated GUI waiting.
A fuzzy constraint satisfaction problem (FCSP) is an extension of the classical CSP, a powerful tool for modeling various problems based on constraints among variables. Meanwhile, a dynamic CSP is a framework for modeling the dynamic transform of problems. These schemes are the technique to formulate real world problems as CSPs, more easily.
The CSP model that combines these is already has splendid researches. The Fuzzy Local Change algorithm is practicable enough in small-scale problems. However, when the scale of the problems grows to some degree, it becomes necessary to use approximate methods. Basically, the algorithms for solving CSPs are classified into two categories: the systematic search (complete methods based on search trees) and the local search (approximate methods based on iterative improvement). Both have merits and demerits.
In this paper, we tested a hybrid, approximate method called the SRS algorithm, in case of large-scale problems. SRS repeats spreading and shrinking a set of search trees in order to repair local constraints until the satisfaction degree of the worst constraints (which are the roots of the trees) is improved. In this process, the "stability" of solutions can be maintained because the reassignment is locally limited. We empirically show that SRS keeps the stability of solutions rather than starting the search from scratch. It is able to quickly get a good-quality approximate and stabilized solution of sufficiently large size of problems.
We propose a new solution named interface client/logic server (ICLS), targeting dialog-based interactive services, supporting user interface (UI) migration, and offering adaptive UIs for devices and services. Constant improvements of technology have brought a large variety of platforms, and that has made users' new demands about the services. The first is that the users would like to use services through different devices and modalities depending on their use contexts. The second is that the users would sometimes like to change devices and take their tasks from one to another, which is called UI migration. Our architecture ICLS is designed based on client/server model. In ICLS, we use XML documents written in abstract interaction description language (AIDL) as logical descriptions of UIs, and introduce one of the semantic web technologies adding the function of expressing meanings of interactions.
1)© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
2)This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.