Computer Science, № 1, 1993

Special colour roundoff problem arises in the visualization of the colour images in the •computer screen under restricted palette after real valued treatment of the initial image, connected for example with the compression of colour components, and also in the scanning of colour images, palette exchanges and so on. An...

Some results of investigation into the spectral properties of k-valued (k ≥ 2) logical functions are presented. The main goal of the investigation is to show the power of spectral methods in implicant extraction and recognition of some useful logical function properties. The relation between the sum-of-products form...

This paper describes implementation algorithms of relational algebra operations in associative parallel processors like Staran using the language STAR. For these operations we construct procedures which form a hierarchy.

This paper presents the S4CAD software tool which allows to synthesize and analyse a set of admissible systolic arrays for the given matrix algorithm. A systematic approach to the design is presented as a theoretical background of the S4CAD. The tool runs under graphical operating environment Microsoft Windows 3 placing...

An efficient way to achieve the high accuracy of the results of computations is to increase the operands capacity. The best results in terms of the problem solution rate and effectiveness of memory using can be reached in the case when a computer system provides the possibility of dynamic capacity...

The intention of the paper is to characterize and examine density and crossing properties of prime event structures. We show the coincidence of L-density and L-ciossing for this class of event structures. It has turned out that any configuration in an M-dense prime event structure is full (i.e., at least...

Mu-calculus is a polymodal logic with fixed points. A Decision Procedure (DP) checks the validity of a formula. A Model-Checking Procedure (MCP) constructs the validity set of a formula in a model. Since Mu-calculus is finitely approximatizible and it is applicable for verification of Finite-State Machines an effective MCPs are...