Yutaka Watanobe

Algorithm library based on algorithmic cyberFilms

A library of algorithms developed as algorithmic cyberFilms is presented. Algorithmic cyberFilms are a new type of software components for presentation, specification/programming and automatic code generation of computational algorithms. The algorithmic cyberFilm format is implemented as a set of multimedia frames (and scenes), and each component is represented by frames of algorithmic skeletons representing dynamical features of an algorithm, by frames of integrated view providing static features of the algorithm in a compact format, and by corresponding template codes supporting the program generation. We developed a library which is a collection of basic and advanced algorithms taught at universities, including computation on grids, trees and graphs. In this paper, we present basic constructs of visual languages which are used for representing cyberFilms as well as for demonstrating the library components. We also provide a general overview of the library and its features. In addition, we discuss results of experiments which were conducted to verify the usability of the library components and their usefulness in education.

Hybrid intelligence aspects of programming in *AIDA algorithmic pictures

Abstract Programming in algorithmic pictures ( a -pictures) is an approach where pictures and moving pictures are used as super-characters for representing features of computational algorithms and data structures. Within this approach some “data space structures” are traversed by “fronts of computation” and/or some “units of activity” are traversed by flows of data. There are compound a -pictures to define algorithmic steps (called Algorithmic CyberFrames) and generic a -pictures to define the contents of compound pictures. Compound a -pictures are assembled into special series to represent some algorithmic features. The series are assembled into an Algorithmic CyberFilm. The generic/compound a -pictures and their series are developed and acquired in special galleries of an open type where supportive pictures of embedded clarity annotations are also included. In this paper, *AIDA (Star-AIDA) modeling/programming language (AIDA stands for Animation and Images to Develop Algorithms) and its Filmification modeling (F-modeling) environment are briefly considered and examples of programs in a -pictures are provided. A special attention is paid to *AIDA programs as special information resources which perception, comprehension and cognition depend on interaction with, at least, a few different but mutually supplementing features of a -pictures. A scheme of data/knowledge acquisition based on clusters of different views and how this acquisition is oriented to enhancing user’s ability within works on developing application models, corresponding algorithms and programs, are presented.

An advanced search interface for mobile devices

An advanced search interface for mobile devices is presented. The search interface employs the query-by-object (QBO) approach which enables end users to obtain information in a database without using SQL. So far, the QBO approach has been employed in a number of applications. The aim of this research is to develop a visual user interface on mobile devices so that the users can more intuitively manipulate the objects for information retrieval. In this paper, the user interface, an algorithm of SQL generation, and the system architecture are presented. A framework to generalize the QBO approach with the interface for different databases is also considered.

F-Modeling Environment: Acquisition Techniques for Obtaining Special-Purpose Features

Programming based on algorithmic pictures is an approach where pictures and moving pictures are used as super-characters for representing and explaining features of computational algorithms. Generic pictures are used to define compound pictures and compound pictures are assembled into special series for representing algorithmic features. Programming in algorithmic pictures is supported by F-modeling environment which functionality supports knowledge/experience acquisition through special galleries and libraries of an open type. Such acquisition permanently enhances intelligent aspects of the environment in general and allows obtaining necessary features required by special applications. In this paper a case study of transferring knowledge/experience into F-modeling environment is considered. It is based on introducing a set of new picture-based constructs for programming systems of robotic and embedded types.

AIDA compiler: a code synthesizer from programs in pictures

AIDA is a language for programming (modeling and documenting) in pictures within F-modeling environment where pictures and moving pictures are used as super-characters for representing features of computational algorithms, corresponding application models and possible related documentation. Generic pictures of the algorithmic super-characters are used to compose compound pictures defining algorithmic steps. The generic and compound pictures, as well as their series are acquired in special galleries of an open type where supportive pictures of various annotations are also included. These acquisitions allow very compact algorithmic specifications from which a set of program slices with different levels of details are synthesized. The lowest level slice is a C++ program. The F-modeling environment provides a set of editors for different views and annotations. In this paper, a structure of the synthesizer is presented and a distribution of its functions among the environment subsystems is provided. A special attention is payed to internal objects, template programs and algorithms supporting the C++ program generation.

Composing control flow and formula rules for computing on grids

We define computation on grids as the composition, through pushout constructions, of control flows, carried across adjacency relations between grid cells, with formulas updating the value of some attribute. The approach is based on the identification of a subcategory of attributed typed graphs suitable to the definition of pushouts on grids, and is illustrated in the context of the Cyberfilm visual language.

Algorithmic CyberFilm Language

The algorithmic cyberFilm language is a visual programming language for presentation, specification and consequent automatic code generation of computational algorithms. The language employs a physical-mathematical abstraction which represents an algorithm as a model of a space and activity in this space. This language has been used to present/specify a variety of algorithms, but a general description of it has not yet been presented. This paper provides an additional description of the algorithmic cyberFilm language including its syntax and semantic aspects. We also show that certain constructs of this language represent semantic features of other constructs

Diagram scenes in *AIDA

*AIDA modeling/programming language is based on algorithmic pictures and animations as super-characters for representing and explaining features of computational (or other type) algorithms. Generic pictures are used to define compound pictures and compound pictures are assembled into special series (Cyber-scenes) prepared for automatic code generation. There are super-characters related to space structures for imitating some physical regions (shapes) in 3-D space and (computational) activities in time on structure nodes, and to diagram structures for representing connections between a set of activity units and specifying a partial order of the activity execution. The sets of the super-characters are open and adding new ones is implemented as a special knowledge/experience acquisition to support various modeling techniques and applications. In this paper we focus on the diagram structures and present how new Cyber-scenes for statechart and clients-server alliances are incorporated into *AIDA language.

Filmification of Methods: Representation of Particle-In-Cell Algorithms

Filmification of methods is an approach to find new formats for program and data/knowledge representation. It is also to create a basis for specifying and developing a new generation of programming environments. Within this approach various algorithms are analyzed and represented as cyberFilms where special visual super-symbols (icons) are introduced for defining meaning of the cyberFilm frames. In this paper, the filmification of methods is applied for particle-in-cells algorithms. Results demonstrate a promising compactness of the program representation, covering technical details of parallel implementation and an effectiveness of an open set of icons.

Integrating keyword search with multiple dimension tree views over a summary corpus data cube

We demonstrate a system that integrates a novel OLAP component with a keyword search engine, to support querying over sparse and ragged corpus data. The key contribution of our system is the integration of dynamically selected point sets such as search results with OLAP querying over aggregated data. During the demonstration, participants will be able to enter a keyword search; observe the returned list of result files; observe distributional features such as outliers and clusters of results in the corpus in multiple dimension views; and select and partition corpus slices in the OLAP component to narrow search results. Participants will be able to experience not just the individual querying features of our system, but the way that they work together to facilitate smooth interaction sequences that combine OLAP and keyword search querying.