Nikolay N. Mirenkov

Visual computing within environment of self-explanatory components

Abstract A visual language and a multimedia environment supporting the language are considered. The language is explained through describing a visual program for solving partial differential equations by a multigrid method. The environment is based on a database of self-explanatory components in a “film” format and a film management system for searching, editing, composing and other manipulations with components. The visual program presented is only one view of a self-explanatory component. In fact, it can also be watched in dynamics and from other points of view for better understanding the method features. The goal of the visual program example is to show that visual programs can be physically much smaller than the text they replace and much easier for understanding and modifying.

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.

VIM Language Paradigm

A visual language paradigm for the interactive specification of application algorithms is proposed for consideration. The approach is based on a set of computational schemes (”shapes” of computation) presented by color figures, pictures and animation films with sound accompaniment. Each film is related to series of frames (computational steps) and it reflects some knowledge about data processing. Each frame “brightens” up a substructure of data for which operations should be specified. As a rule, this substructure is a set of points and/or moving objects in a multi-dimensional space-time. A user embeds his algorithm into computational schemes by making these schemes more precise. In fact, he defines the specification by creating his new film. The corresponding program (sequential or parallel) is generated automatically.

Constructive Heterogeneous Object Modeling Using Signed Approximate Real Distance Functions

We introduce a smooth approximation of the min/max operations, called signed approximate real distance function (SARDF), for maintaining an approximate signed distance function in constructive shape modeling. We apply constructive distance-based shape modeling to design objects with heterogeneous material distribution in the constructive hypervolume model framework. The introduced distance approximation helps intuitively model material distributions parametrized by distances to so-called material features. The smoothness of the material functions, provided here by the smoothness of the defining function for the shape, helps to avoid undesirable singularities in the material distribution, like stress or concentrations. We illustrate application of the SARDF operations by two- and three-dimensional heterogeneous object modeling case studies.

A visual representation of cellular automata-like systems

Cellular automata (CA) models and corresponding algorithms have a rich theoretical basis, and have also been used in a great variety of applications. A number of programming languages and systems have been developed to support the implementation of the CA models. However, these languages focus on computational and performance issues, and do not pay enough attention to programming productivity, usability, understandability, and other aspects of software engineering. In this paper, we describe a new special-purpose programming language developed for visual specification, presentation, and explanation of CA systems within a visual programming environment, as well as, for programming them. This language is based on using visual patterns, colors, and animation for representing the CA system structures and operations on these structures, and for performing editing and composing manipulations with corresponding software components. Examples of the CA algorithm representations and some details of the environment implementation are presented. r 2004 Elsevier Ltd. All rights reserved.

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.

Intelligent management of distributed dynamic sensor networks

A universal solution for the management of dynamic sensor networks will be presented, covering both networking and application layers. A network of intelligent modules, overlaying the sensor network, collectively interprets mission scenarios in a special high-level language, which can start from any nodes and cover the network at runtime. The spreading scenarios are extremely compact, which may be useful for energy-saving communications. The code will be exhibited for distributed collection and fusion of sensor data, and also for tracking mobile targets by scattered and communicating sensors.

Self-explanatory components: a basis for new communicators

Abstract An approach for using the self-explanatory component concept in multimedia message representation is considered. It is based on “film” formats of multimedia symbols (multimedia words) and multimedia sentences (multimedia hieroglyphs). Corresponding films are multiple views of objects/processes. They are “pieces of knowledge.” These pieces are acquired in a film database. The user should not study them in advance. A film management system (including self-explanatory interface panels) provides effective access to the database items. In this paper, the concept of self-explanatory components, formats to represent multimedia sentences and words, as well as a brief explanation of the film (component) management system are provided. Some implementation results oriented to people with communication disorders are presented.

Movie-Based multimedia environment for programming and algorithms design

In the presented work, we introduce a concept of the Movie-Based Programming based on movie-like representation of algorithms and methods. It provides correspondence between algorithmic movie frames and problem solution steps that any frame should visualize/animate a part of a program/algorithm execution. The programming process is in manipulating with special movie-program objects (MP-objects) generating automatically a part of an executable code as well as producing frames, which are adequate to the code generated. It also includes a special multimedia language with high-level constructions and operators in order to make the programming process more efficient and comfortable. Both movie and program can synchronously be generated and debugged. A debugging scheme allows visualizing and controlling all references to the structure elements.

Shape recovery using functionally represented constructive models

We propose a method which helps to fit existing parameterized function representation (FRep) models to a given dataset of 3D surface points. Best fitted parameters of the model are obtained by using a hybrid algorithm combining simulated annealing and Levenberg-Marquardt methods. The efficiency of the approach is shown for recovery of two test items. We show through the CAD model processing an application of the proposed approach to the shape recovery followed by finite element mesh generation and adaptation.