Takuto Yanagida

Architecture for migratory adaptive user interfaces

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 userspsila 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.

Flexible Widget Layout Formulated as Fuzzy Constraint Satisfaction Problem

We show an improvement of our previous work, a formulation of the flexible widget layout (FWL) problem as a fuzzy constraint satisfaction problem (FCSP) and a method for solving it. The automation of widget layout is one of the most important challenges for the generation of graphical user interfaces (GUIs). In the field of model-based user interface design, widget layout is more complicated because a layout system needs to select widgets. FWL is the automatic GUI generation requiring (1) deciding which widgets are used and (2) completing the layout immediately. We formulate the desirability of selection as fuzzy constraints; thus, we can utilize existing techniques of FCSP without extending its framework.We divide the layout process into three phases, and realize the automatic layout in feasible time.

A Proposal of Context-Aware Service Composition Method Based on Analytic Hierarchy Process

We propose a new service composition method with the analytic hierarchy process and discuss its availability. The concept of context-aware services has been attracting attention as an approach to improving the usability of computer-mediated services. In ubiquitous computing environments, there are several means to provide services for users, and thus, to select an appropriate mean among them is a challenge. Our method for context-aware service composition determines service behaviors by context data. Through the implementation and examination of the method, we have found that the method can output reasonable results.

Personalizing graphical user interfaces on flexible widget layout

The authors propose a method for personalizing the flexible widget layout (FWL) by adjusting the desirability of widgets with a pairwise comparison method, and show its implementation and that it actually works. Personalization of graphical user interfaces (GUIs) is important from a perspective of usability, and it is a challenge in the field of model-based user interface designs. The FWL is a model- and optimization-based layout framework of GUIs offering a possibility for personalization, but it has not actually realized it with any concrete method yet. In this paper, the authors implement a method for personalization as a dialog box and incorporate it into the existing system of the FWL; thus, users can personalize layouts generated by the FWL system at run-time.

Flexible widget layout with fuzzy constraint satisfaction

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.

Keeping the stability of solutions to dynamic fuzzy CSps

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 modelling the dynamic transform of problems. These schemes are the technique to formulate real world problems as CSPs, more easily.

Keeping the stability of solutions in dynamic fuzzy CSPs

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 modelling 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 ldquostabilityrdquo of solutions can be maintained because the reassignment is locally limited. Additionaly, 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.