CC BY
39
Metrics of Vector Logic Algebra for Cyber Space
Vladimir Hahanov, Senior Member, IEEE , Svetlana Chumachenko, Member, IEEE,
Karina Mostovaya
Abstract - The algebraic structure determining the vector-matrix transformation in the discrete vector Boolean space for the analyzing information based on logical operations on associative data.
Keywords - vector-matrix transformation, discrete vector Boolean space, information analysis.
I. Introduction
The purpose of this article is significant decreasing the analysis time of associative data structures through the developing metrics of vector logic algebra for parallel implementation of vector operations on dedicated multiprocessor device. The problems are: 1. Develop a signature, satisfying a system of axioms, identities and laws for the carrier, which is represented by a set of associative vectors of equal length in the logic vector space. 2. Create a signature of the relations for the carrier, represented by a pair: an associative vector - an associative matrix. 3. Develop a signature of the transformations for the carrier, represented by a pair of associative matrices of equal length.
The research subject is the algebraic structures and logic spaces, focused to creating the mathematical foundations of effective parallel computing processes, implemented in a multiprocessor dedicated product.
References: 1. Technologies for parallel computing by dedicated multiprocessor systems [1-2, 10, 11, 15]. 2. Algebraic structures, focused to creating a mathematical apparatus for parallel computing [3-4, 7-10]. 3. Process models for the solving real-world problems on the basis of effective parallel computing [5, 6, 11, 13].
Manuscript received September 23, 2011.
Vladimir Hahanov is with the Kharkov National University of Radioelectronics, Ukraine, 61166, Kharkov, Lenin Prosp., 14, room 321 (corresponding author to provide phone: (057)7021326; fax: (057)7021326; e-mail: hahanov@ kture.kharkov.ua).
Chumachenko Svetlana is with the Kharkov National University of Radioelectronics, Ukraine, 61166, Kharkov, Lenin Prosp., 14, room 321 (phone: (057)7021326; fax: (057)7021326; e-mail: ri@ kture.kharkov.ua).
Karina Mostovaya is with the Kharkov National University of Radioelectronics, Ukraine, 61166, Kharkov, Lenin Prosp., 14, room 321 (phone: (057)7021326; fax: (057)7021326; e-mail: [email protected]).
II. B-METIC OF THE VECTOR DIMENSION
Vector discrete logic (Boolean) space determines the interaction of objects through the use of three axioms (identity, symmetry and triangle) forming a nonarithmetic B-metric of vector dimension:
B =
d(a,b) = a © b = (ai © bi),i = 1,n;
d(a, b) = [0 ^ Vi(di = 0)] ^ a = b;
d(a,b) = d(b, a);
d(a,b) © d(b,c) = d(a,c)L
© = [d(a, b) л d(b, c)] v [d(a, b) л d(b, c)].
Vertices of the transitive triangle (a,b,c) are vectors (Fig. 1), which identify the objects in the n-dimensional Boolean B-Space; the sides of triangle d(a,b), d(b,c), d(a,c) are the distances between vertices, which are also represented by vectors of the length n, where each bit is defined in the same alphabet as the coordinates of the vectors-vertices.
Fig. 1. Triangle of the vector transitive closure
Vector transitive triangle is characterized by complete analogy with the numerical measurement of the distance in the metric M-space, which is specified by the system of axioms, determining the interaction between one, two and three points of any space:
fd(a,b) = 0 a = b;
M = \ d(a,b) = d(b,a);
|d(a,b) + d(b,c) > d(a,c).
The specific of metric triangle axiom lies in numerical (scalar) comparison the distances of three objects, where the interval uncertainty of the result - two sides of a triangle can be greater or equal to a third one - not really suitable for determining the exact length of the last side. Removal of this disadvantage is possible only in a logical vector space, which can form a deterministic view for each characteristic of the process or phenomenon state. Then the numerical uncertainty of the third triangle side in a vector logical space takes the form of the exact binary vector, which characterizes the distance between two objects
and is calculated on the basis of knowledge of the distances for the other two triangle sides:
d(a,b) © d(b, c) = d(a,c).
The three axioms of the determining a metric are redundant, at least for the vector space, where a single axiom can be used -the interaction between three points:
d(a,b) © d(b, c) © d(a, c) = 0 . Two identities are followed from this law, which determine the relations between one and two points in a space:
d(a, b) © d(b, c) © d(a,c) = 0 ^
d(a, b) = d(b, a) = 0 ^ c = 0; d(a,a) = 0 ^{b,c} = 0
The following fact is interesting. Having regard to the cyclical nature of the triangle, for any two known adjacent (incident) components the third one can be calculated. This concerns both to states (codes) of vertices and to the distances between them:
f d(a, b) = d(a,c) © d(b, c) j d(b,c) = d(a, b) © d(a, c) [d(a, с) = d(a, b) © d(b, c)
d(b, c) = b © c d(a, с) = a © c d(a, b) = a © b
a = d(a,b) © b b = d(b, c) © c c = d(c, a) © a
Isomorphism of the set theory concerning the algebra of logic allows determining the vector set-theoretic S-space, where the triangle axiom is defined by symmetric difference A, which is analogous to the operation XOR in Boolean algebra:
S =
d(a,b) = aAb = (a;Ab;),i = 1,n; d(a,b) = [0 ^ Vi(d; =0)] о a = b; d(a,b) = d(b, a); d(a,b)Ad(b,c) = d(a,c),
A = [d(a, b) n d(b, c)] u [d(a, b) n d(b, c)].
Here A is the symmetric difference operation on the four-digit set-theoretic alfabet a = {0,1, x = {0,1}, 0}, represented by the following table:
A 0 1 x 0
0 0 x 1 0
1 x 0 0 1
x 1 0 0 x
0 0 1 x 0
When determining the distance between two vectors in the S-space the symmetric difference is used, which is isomorphic to the XOR-operation in the Boolean B-space. Examples of calculating the distances between vectors in both spaces (S, B) are given below:
a 1 0 0 0 1 0 0 1
b x x 0 0 1 1 0 0
c x x x x 0 0 0 0
d(a,b) 0 1 0 0 0 x 0 x
d(b,c) 0 0 1 1 x x 0 0
d(a,c) 0 1 1 1 x 0 0 x
a 1 0 0 0 1 0 0 1
b 1 1 0 0 1 1 0 0
c 1 1 1 1 0 0 0 0
d(a,b) 0 1 0 0 0 1 0 1
d(b,c) 0 0 1 1 1 1 0 0
d(a,c) 0 1 1 1 1 0 0 1
Vector equal to zero (empty set) for all coordinates means a full match the response and query. As well as the vector equal to 1 (symbol x) for all digits indicating complete contradictoriness the response and query. Number of gradations for a variable can be a finite number that multiple of a power 2
a = 2n ^ {22 = 4, 24 = 16}, which is determined by the power of the Boolean on the universe of n primitive. Otherwise, the symmetric difference can exist only in closed concerning the set-theoretic operations alphabet. Thus, the interaction of two objects in a vector logical space can have either binary or multivalued deterministic scale of measuring interaction. Hasse diagram of any finite number of primitives (1,2,3,4, ...) can be packed to a variable of logical vector. Moreover, 16 gradations (for instance) of vector interaction by the four primitives exactly indicate not only the degree of proximity by the variable, but in what way they differ - by some primitives, or their combination. Vector operation XOR actually smooths out the changes in the two codes or vectors, that is of interest for the creating digital filters. If it is applied many times, we can get a binary pyramid, where the last vertex is always the zero vector. Thus, the obtained pyramid makes it possible using some redundancy to correct errors in the process of information transferring. The procedure of convolution distances in order to verify the errors of data transferring for the number of vectors equal degree 2 is presented below. 1) Compute all the distances between the binary codes, including the last and first vectors, resulting in a closed geometric figure q = a; © a;+j(i = n ^ i +1 = 0). 2) Compute all distances between non-overlapping pairs of obtained in the first stage codes c; = a2i-1 © a2i (i = 1,2,3,...,n). 3) Repeat procedure 2 to obtain a package equal to zero in all coordinates. The procedure is illustrated by the following calculations:
01 0 1 1 0 0 0
11 0 1 0 0 1 0
11 1 1 1 0 0 1 1 0 1 0
01 1 0 1 1 0 0 0 0 1 1111
10 1 0 1 1 1 1 0 0 1 1111
01 0 1 1 0 1 0 1 0 1 0
1111 1110 0 0 0 1 0 1 0 0
0 0 0 0 I
Similar actions can be performed and for multivalued vectors, where, for instance, every coordinate is defined in four-digit set-theoretical alphabet, and the procedure is reduced to the obtaining a vector of empty values coordinates:
Here it happen a convolution of a closed space to a single point, Fig. 2, defined in all coordinates by symbols of the empty set, by calculating the distance between vector-objects, and then -the distance between the vector-distances. Otherwise, the modulo sum of all vector-distances, closed in the cycle is equal to an empty vector
j=li+1n n-1
mi = ci Ф c; ^ m = mi Ф mi+1. i=1,n i=1
But this procedure is characterized by less error diagnosis depth - the detecting an incorrect bit is possible. While a binary tree of space convolution makes it possible to increase the diagnosis depth up to a vector pair.
Fig. 2. Closed space convolution
Space convolution is of interest for many real-world problems: 1) Diagnozing and correcting errors when the transmitting information via communication channels. 2) Detecting faults in digital products based on fault detection tables. 3) Searching faults in digital products based on multivalued fault detection tables.
The essence of the space convolution lies in the metric of transitive triangle, which can be transformed by shifting the right side of the equation to the left:
d(a, b) Ф d(b, c) = d(a, c) ^ d(a, b) Ф d(b, c) Ф d(a, c) = 0 .
This definition assign primary importance not elements of the set, but the relations, thereby reducing the system of metric axioms from three to one and to extend its action on an arbitrarily complex structures of n-dimensional space. The classical metric definition for determining the interaction between one, two and three points in a vector logical space is a special case of B-metric when i = 1,2,3 respectively:
fdi = 0 o a = b;
M = < di Ф d2 = 0 o d(a, b) = d(b, a);
[di Ф d2 Ф d3 = 0 o d(a, b) Ф d(b, c) = d(a, c).
In particular, metric, functional and other kinds of spaces in the sum also give zero. For example, a figure with sides 1, 2, 3,
x 0 x 0
0 0 0 1
0 0 0 x
x 0 x 0
x 0 x x
x 0 x x
^ 0 0 0 0
0 x 0 1 x 0 1 0
1 x x 1 0 0 0 0
1 x 1 x x 0 0 1
0 1 x 0 x 0 0 0
1 x 1 0 x 0 x x
0 1 0 1 x 0 x 0
1 x 1 1 0 1 0 0
x 0 x 1 1 1 1 0
according to all the textbooks, is not a triangle, because three points are located in line, Fig. 3. But the axiom of metric transitive closure uses a structure consisting of three points on the plane with different coordinates, which is strictly called a triangle. Then a figure with sides 1, 2, 3, according to the definition of the metric, is a triangle with two zero angles and the third one, equal to 180 degrees, where all the conditions for the three sides are met: a + b > c ^ 1 + 2 = 3.
Fig. 3. Metric triangle III. Conclusion
Information vector logic space as a subset of a metric one determines the interaction between a finite numbers of objects by means of the introduced definitions, axioms of identity, symmetry and transitivity of the triangle. At that the last property degenerates into a strict equality, which makes it possible potentially to reduce by a third volume of binary information about the interaction of objects, due to the convolution of any closed logical space in the zero-vector.
Beta-metric of a vector logic space, presented by a zero-sum of cycle distances of binary codes, creates a fundamental basis for all logical and associative problems of synthesis and analysis related to the searching, recognition and decision-making.
Based on the beta metric and the three quality criteria of interaction between vector logical objects in the same space a beta-criterion is created. It makes it possible to determine effectively, accurately and adequately the quality of object interaction, when searching, pattern recognition and decision-making by calculating the xor-function.
Algebra of vector logic creates an infrastructure mathematical service of a vector logical space for the solving real-world problems of synthesis and analysis. It consists of three components: vector, vector-matrix and matrix algebraic structures. Signature of algebras is given by a standard set of logical vector operations AND, OR, NOT, XOR to determine the interaction between compatible objects of a carrier, which form a binary n-dimensional vectors and compatible by the dimension matrix.
V. References
[1] M.F. Bondarenko, Z.V. Dudar, I.A.Ephimova, V.A. Leshchinsky, S.Yu. Shabanov-Kushnarenko. About brain-like computers // Ra-dielectronics & Informatics.- Kharkov: KHNURE.- 2004, No 2.-P.89-105.
[2] Cohen A.A. Addressing architecture for Brain-like Massively Parallel Computers / Euromicro Symposium on Digital System Design (DSD'04).- 2004.- P. 594-597.
[3] Kuznetsov O.P. Fast brain processes and pattern recognition // News of artificial intelligence.- 1998.- No2.
[4] Vasilyev S.N., Zherlov A.K., Phedosov E.A., Phedunov B.E. Intellectual control in dynamic systems.- M.: Physico-mathematical literature.- 2000.- 352 p.
[5] Lipaev V.V. Software ingeneering. The methodological fundamentals. Textbook.- M.: Teis.- 2006.- 608 p.
[6] I.S. No1439682. 22.07.88. Shift Register / Kakurin N.Ya., Ha-hanov V.I., Loboda V.G., Kakurina A.N.- 4 p.
[7] Hyduke S.M., Hahanov V.I., Obrizan V.I., Kamenuka E.A. Spherical multiprocessor PRUS for solving the Boolean equations // Radielectronics & Informatics.- Kharkov. 2004. No 4(29). P.107-116.
[8] Digital system-on-chip design and test / V.I. Hahanov, E.I. Litvinova, O.A. Guz. - Kharkov: Novoye Slovo, 2009.- 484 p.
[9] Digital system-on-chip design and verification. Verilog & System Verilog / V.I. Hahanov, I.V. Hahanova, E.I. Litvinova, O.A. Guz.-Kharkov: Novoye Slovo, 2010.- 528 p.
[10] A. Acritas. Fundamental of computer algebra with applications.-М.: Mir.- 1994.- 544 p.
[11] A.V. Attetkov. Optimization Methods.- Bauman Moscow State Technical University.- 2003.- 440 p.
[12] M. Abramovici, M.A. Breuer and A.D. Friedman. Digital System Testing and Testable Design. - Comp. Sc. Press.- 1998.- 652 p.
[13] D. Densmore, R. Passerone, A. Sangiovanni-Vincentelli. A Platform-Based taxonomy for ESL Design // Design & Test of computers.- 2006.- P. 359-373.
[14] Diagnosis automation for electronic devices / Yu.V. Malishenko et al./ Editor V.P. Chipulis.- M.: E, 1986.- 216 p.
[15] Trachtengertz E.A. Computer methods for economic and information managerial solutions.- SINTEG.- 2009.- 396 p.
