At the 16th IFIPWorld Computer Congress
Тhis is a review of the 16th IFIP World Computer Congress held in Beijing,
China, in August, 2000 under the title "Information Processing Beyond Year
2000". The IFIP Computer congress is the most important world scientific forum
on information technologies where the main problems and the most significant
results in modern informatics are considered.

Data dependence analysis based on the Shostak algorithm
The main problem of program parallelizing is to find out data depedences. This
article presents a precise test for data dependence analysis based on analysis
of solvability of a system of linear inequalities in two variables on the basis
of Shostak algorithm. The model of a source program, as well as the Shostak
algorithm and its modification, is given and implementation of the project is
described.

NUMAarchitecture: specific features of compilation and code generation
This paper is about some features of compilation and code generation for NUMAarchitectures.
The definition of a NUMAarchitecture is given and the difference
between multiprocessors and multicomputers is shown. Computers with NUMAarchitectures
and the peculiarities of software for them are described. A review
of the papers related to cycle restructurization and data transformation is also
given.

A functional language SISAL 3.0
The paper describes the Sisal 3.0 language which is the initial version of the source
language of the functional programming system (FPS). Semantic and syntactical
features of this language have been briefly described and a review of the papers
related to the Sisal 3.0 problems have also been done.

A parallel algorithm for solving a problem of interaction between lowdensity plasma flows
The parallel algorithm for solving a problem of interaction between lowdensity
plasma flows is studied. The most elementary parallel architecture is considered. In the context of some natural assumptions, the runtime estimates have been
made for the parallel and sequential cases; the acceleration coefficient has also
been evaluated.

On parallelizing the MEDUZA technique
The problems connected with parallelizing the "MEDUZA" technique applied to
a number of mathematical physics problems are considered.

Software for testing the image processing algorithms
The algorithms which are a base of "a test desk" program intended to develop
applied software for image processing are briefly described.

A GRAMAL language for description of graph models and algorithms
Graph models and various methods of their processing are often and widely
used when constructing software systems of different levels of complexity. Graphs
(being a very convenient tool for description of data structure and information flows) are actively used in a number of mathematical problems. The GRAMAL
system here described is aimed at 4 points:
 to provide a tool for graph model description;
 to represent this model graphically;
 to provide testing and debugging tools for graph processing;
 to support code generation and its further application.

Transform: a data input interface
A data input interface for the information retrieval system Transform is described.
A source of data for this system is bibliography on program transformations.
The aim of this work is to create a program complex which provides a remote
user connected to IS Transform WWWserver with a convenient interface for
registration in the system, input of data to the database, information retrieval,
and output of results in a convenient form.

Application of graphs to programming
This article describes a number of tools which support application of graphs
to programming; they are under development in the Laboratory for program
construction and optimization of the A.P. Ershov Institute of Informatics Systems. A review of the papers on "encyclopedia" of graph algorithms for programmers
is given. Methods and tools for graph (and graph model) visual processing are
described. The dictionary on graph theory in programming and its electronic
version are considered.

Equivalence of local computation models
This paper considers equivalence of local computation models. There exist several
models of local computations on graphs, such as the systems of graph rewriting
with priority, the systems of graph rewriting with supressed context, Zhuravlev's
local algorithms, and the finite automata nets. The paper discusses the question
of comparison between classes of problems solvable in polynomial time invarious
models of local computations. Some propositions and their proofs are given.

Some invariants of a cubelike graph
A cubelike graph was firstly introduced by Lovas. This is a graph with a special
relation of vertex incidence. The article is devoted to a study of some cubelike
graph invariants, in particular, chromatic ones. The value of an edge prescribed
chromatic number is found, and the method for calculation of the cliquemathic
number and the clique number of a cubelike graph is also described.

>A graphic output mechanism in the visualization system for hierarchical graph models
The mechanisms of graphic output in graph visualization systems are considered.
The main problems of constructing such systems are presented and classified and
the general solution methods are given for them. A particular implementation
of these approaches in the Higres system, which is a visualizer and editor for
hierarchical graph models, is described.

User interface in the visualization system for hierarchical graph models
The user interface of the Higres system, a visualizer and editor for hierarchical
graph models, are described. The methods for visualization of the hierarchical
structure are presented which provide one with easytouse intuitive graph editor
interface. The algorithms for automatic drawing refinement and some additional
features implemented in the system are considered.

Making graphbased illustrations with the help of VEGRAS system
The Vegras system described in this article is an editor tool for making graphbased
illustrations. The motivation to develop such software is the lack of easytouse graph editor tools which allow users to make graphbased illustrations
for scientific literature. With the help of our system it is possible to create
nice looking graphbased illustration in a few minutes. In addition, our system
provides a possibility to add different special mathematical symbols to graph's
labels, as well as subscripts and superscripts.

A LISPimplementation of a patternsearch on the basis of similar procedures of Refal and Haskell languages
An extension of Lisp with a patternsearch procedure based on similar ones of
Refal and Haskell languages is described. Some methods for extension of Lisp with
patternsearch tools are considered and convenience of using them for structured
data processing is estimated.

Using patterns inWIS development
Today WEB is the most popular information storage. This article discusses the
use of project patterns when solving different problems of constructing hypermediaapplications,
namely, the process of using patterns aimed to improve constructing
the architecture of WEBInformation Systems (WIS).

A logical structure of the process of puzzle generation and solution
The decisionmaking methods in the TRIZ concept are investigated for the process
of puzzle generation and solution.
