WO2001065468A1

WO2001065468A1 - A combined color linear and two-dimensional bar code structure for information visualization and_search

Info

Publication number: WO2001065468A1
Application number: PCT/IL2001/000149
Authority: WO
Inventors: Alexander Baskin
Original assignee: Alexander Baskin
Priority date: 2000-02-28
Filing date: 2001-02-18
Publication date: 2001-09-07
Also published as: IL134780A0; AU2001234046A1

Abstract

A combined color linear and two-dimensional bar code structure contains the following encoded information: alphabet and lexical attributes in Hebrew, lexical attributes of words, phrases and expressions from one or a few natural languages and special designations. A color two-dimensional bar code structure portion is a matrix consisting of color elements. A linear color bar code structure portion consists of a set of color bars. Each of such elements or bars is characterised by the placement, position and colours. Any information in one or several languages can be coded to a combined color linear and two-dimensional bar code structure. The general purpose of the present invention is to provide a new scaleable methods of collecting, analyzing, processing, and understanding information for future applications in unstructured databases and E-publishing. To attain this, the present invention is directed to methods and algorithms of high dense coding, cryptography, processing data in video memory, information visualization, intellectual search, select, ranging, verification, collection and classification information, translation texts, and active studying foreign languages.

Description

A combined color linear and two-dimensional bar code structure for information visualization & search.

Technical Field.

This invention relates to alphabet and lexical attributes in Hebrew, lexical attributes of words, phrases and expressions from one or a few natural languages and special designations encoded into combined color linear and two-dimensional bar code symbols, and also in particular to the use of colours and positions of elements of symbols and to coding based on aggregation and stratification of attributes, in order to attain the goal of solution of the following problems: processing, representation, compression, cryptography, visualisation, search according to prototype, ranging, comparative analyses, collection and selection of information, translation of texts and study foreign languages.

Background Art.

Unstructured text databases are common in many manufacturing and service business operations. The service reports of automobiles, description of claims in insurance industry, medical records are some examples. Over the period of time such databases continue to grow and become a huge and unwieldy source of information.

Unstructured text databases and E-publishing (eBooks, electronic library, magazine and etc) from year to year continue to generate increasing amounts of data, most of which is useless.

The present invention is directed to scaleable methods of collection, analyzing, processing and understanding data from unstructured text databases and E-pubUshing systems. This invention relates to development of algorithms for representations and processing of abstract data, intellectual search, select, ranging, comparative analysis of information, coding, compression, cryptography, storage, protection and delivery of information, translation of texts and study foreign languages, and also for associative human perception of information, helping to read, understand and analyze texts.

Processing of abstract data is a promising approach for machine and human search, select, ranging, comparative analysis, understanding and perception of information. A typical analysis consists of examining a set of documents in order to answer some specific question. In analysis a major is knowledge of the information space documents. One of the major problems is the overview many documents. One way to overcome the problem is to reduce the information that needs to be processing through suitable abstractions. It has been suggested by Autonomy's Inc. which has created a suite of innovative products based on neural networks and pattern-matching technologies that provided the foundations of an approach called Adaptive Probabilistic Concept Modelling (APCM). Autonomy's software has the ability to analyze a document, extract the ideas in the text and determine which are the most important. Because Autonomy's technology can derive meaning in a piece of text, it also can profile users by analyzing the ideas in the documents they read or produce. Software of ARCM is capable of understanding the main thrust of a piece of text and then finding similar documents by analysing the patterns of symbols and contexts. This concept-based approach overcomes the problem of a keyword approach, which is able to identify documents where a search term appears, but cannot tell how relevant the document is to the subject being researched.

The other approach, AT&T Bell Laboratories develop software SeeSoft. SeeSoft visualizes text files by mapping each line into a thin row, colored according to a statistic of interest. By means of direct manipulation and high interaction graphics, the user manipulates this reduced representation of the code in order to find interesting patterns. Further insight is obtained by using additional windows to display the actual code. It is typical to make visualization as colors lines or microscopy fonts.

In order to attain the above-mentioned goal in the present invention it is practical to coding abstract date of information as 2D bar code and use 2D bar code in scaleable processing in order to make intellectual search, select, ranging, comparative analysis, visualization information and etc.

Prior Two-Dimensional Bar Codes Known two-dimensional bar codes exist that are extensions of one-dimensional bar codes, in that one-dimensional bar codes are stacked with horizontal guard bars between them to increase the density. An example of such bar codes is seen in U.S. Pat. No. 4,794,239, to Allais.

Multi-colored bar code systems have been proposed in the past. For example, U.S. Pat. No. 3,637,993 discloses a transition code recognition system which uses a three color bar code. This bar code symbology is therefore transition or edge defined, and does not take advantage of other colors in the spectrum.

Ultracode was developed in 1997 by Zebra Technologies and is in the public domain. It has the unique ability to encode both Latin and non-Latin alphabet languages, such as Russian, Chinese, Japanese and Korean. Ultracode supports both black/white and a higher density colored versions.

Colored bar arrays bearing encoded information have been used for many years for instance for color coding of electrical and electronic resistors. By way of background, U.S. Patents illustrating black and white and colored bar codes include U.S. Pat. Nos. 3,772,200, 3,858,506, 3,861,886, 4,010,355, 4,044,227, 4,053,433 4,239,261, 4,329,393, 4,390,452, 4,794,238, 4,268,179, 5,003,251, 4,855,909, 4,844,509, 4,714,934.

A combined linear and two-dimensional bar code structure containing encoding information therein comprising: a linear bar code structure portion and a two-dimensional bar code structure portion. One such a combined linear and two-dimensional bar code. A complete description this code is contained in U.S. Pat. No. 5,920,062.

Alternatives to bar codes include: circular formats employing radially disposed wedge-shaped coded elements, such as in U.S. Pat. No. 3,553,438, or concentric black and white bit-encoded rings, such as in U.S. Pat. Nos. 3,971,917 and 3,916,160; grids of rows and columns of data-encoded squares or rectangles, such as in U.S. Pat. No. 4,286,146; microscopic spots disposed in cells forming a regularly spaced grid, as in U.S. Pat. No. 4,634,850; and densely packed multicolored data fields of dots or elements, such as described in U.S. Pat. No. 4,488,679. Data arrays containing acquisition targets are known in the art; for example, concentric geometric figures, including rings, squares, triangles, hexagons and numerous variations thereof, such as described in U.S. Pat. Nos. 3,513,320 and 3,603,728. U.S. Pat. No. 3,693,154 and 3,801,775 also describe the use of comprising concentric circles as identification. A example of a label containing a higher density data array is shown in U.S. Pat. Nos. 4,874,936 and 4,896,029 where data is encoded in the form of an hexagonal data cell array hat contains about 100 characters of information.

There is an increasing need for a system to encode abstracts of documents. In particular, there is a desire to create highly densed 2-D colour bar codes which provide identification documents. Also highly densed 2-D colour bar codes for documents visualization and their use for effective solution of problems of classification, ranging and search of documents on the base of visual images of documents in the mode of dialogue visualization.

Disclosure of Invention.

The general purpose of the present invention, which will be described subsequently in greater detail, is to provide a coding abstract data as attributes of roots or sell roots in Hebrew, lexical attributes of words, phrases and expressions from one or a few natural languages into combined color linear and two-dimensional bar code which has many advantages in order to solve the problem of providing effective scaleable algorithms of collecting, analyzing, processing and understanding of texts. The purpose also is to make the system, which provides coding abstract attributes of texts to bar code and using bar code for search according to prototype, visualization of information and etc. Commercially-aλ'ailable bar code systems typically lack in solve this problem.

Existing inventions of bar codes were intended for coding bytes, digits and letters. The present invention is intended for coding attributes of roots or sell roots in Hebrew, lexical attributes of words, phrases and expressions from one or a few natural languages and special designations.

The present invention is a method of coding based on attributes of Hebrew alphabet, attributes of roots and sell roots and lexical attributes in Hebrew. Kabalistic books give description of Hebrew alphabet as a set of universal attributes that are elements of universal theory of classification based on kabalistic concepts of «Ten sfirot».

In the other hand, in Hebrew a number of frequently used roots and sell roots are small. It is possible to form almost all lexical stock of Hebrew from these roots. Most Hebrew roots consist of only 3 letters and sell roots consist of only 2 letters. On the base of models of roots and words in Hebrew it is possible to create sets of attributes in Hebrew and in other languages. Roots and cells of roots are classification attributes for Hebrew and other languages. Hebrew is a high formalized language. This above-mentioned feature of Hebrew is used in the present invention for creating a high density bar code in order to attain effective scaleable algorithms of collecting, analyzing, processing and understanding texts, and for solution of the following problems: processing, representation, compression, cryptography, visualisation, search according to prototype, ranging, comparative analyses, collection and selection of information, translation of texts and study foreign languages.

Information visualisation is: presenting information in such a way that as much as possible can be assimilated by the human perceptual system instead of relying on the human cognitive system, presenting detailed information about a specific topic while also presenting a complete overview of all information available (the fisheye concept).

One embodiment of the present invention includes an information visualisation. Words, phrases or expressions of any language can be visualized as combined color linear and two- dimensional bar code.

The present invention is directed to development of systems of information visualization. Such systems comprise the means of coding for data obtained directly from computer files.

It is another an object of this invention to provide a system which provides a visual representation of abstract of document in combined color linear and two-dimensional bar code.

The present invention relates to a high density combined linear and two-dimensional color bar code symbology. The symbology may be used to create a high density, a combined color linear and two-dimensional bar code symbol, which in turn may be used in a computer system.

It is therefore an object of the present invention to provide a bar code system with increased information density over existing systems.

It is a further object of the present invention to use multiple colors in a bar code system in order to obtain such increased information density.

It is a further object of the present invention to provide such a bar code system which uses multiple colors to increase information density.

Accordingly, an object of the invention is to provide an improved compression and cryptography date. In addition to being compact in size, the invention provides for high security in the transmission of information. This embodiment of the invention, the data is encoded and decoded using a keyed data encryption technique in order to increase the security of the data transmission. In this embodiment, only the person having the encryption key will be able to decode the graphic pattern. Thus, the invention provides a highly reliable system for representing data in graphic form having increased encoding capacity.

Another object of the invention is to provide a method of maintaining of verification, comparative analysis, search, selection, ranging and classification of documents in various languages is based on description of the contents of information in as attributes of roots or sell roots in Hebrew, lexical attributes of words, phrase and expression from one or a few natural languages.

Although specific features of this invention are shown in some drawings and not others, this is for convenience only as each feature may be combined with any or all of the other features in accordance with the invention.

Other embodiments will occur to those skilled in the art and are within the following claims:

The following claims are intended to encompass all such uses, implementations, and embodiments. It will be apparent to those skilled in the art that various modifications and variations can be made in the decoding method and apparatus without departing from the scope or spirit of the invention. Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

Further objects and advantages of the invention will become apparent from the description of the invention which follows.

The invention accordingly comprises the several steps in their relation of one or more such steps with respect to each of the others and the article possessing features properties and relation of elements, which are exemplified in the following detailed disclosure, and the scope of the invention will be indicated in the claims.

Brief Description of Drawings.

Other objects, features and advantages will occur to those skilled in the art from the following description of a preferred embodiment and the accompanying drawings, in which:

FIG:. 1 is a prior art • color two-dimensional bar code structure portion.

FIG. 2 is the parameters of combined color linear and two-dimensional bar code structure;

Best mode for Carrying Out the Invention.

Prior art color two-dimensional bar code structure portion is matrix 10, FIG. 1 which consists of five or six elements. This matrix 10, FIG. I includes matrix of symbols 11, FIG. 1. The matrix of symbols can be placed inside matrix 10, FIG. 1 in four positions: 12, 13, 14 and 15,

FIG. 4 - /D .

Prior art color two-dimensional bar code structure portion consists of elements of a symbol and elements of a background. The matrix of symbols (or symbol) consists of four elements (elements of a symbol). All elements from matrix 10, FIG. 1., that are not elements of a symbol are elements of a background.

Any symbol consists of four elements. Element of a symbol can be of one of two types: elements of type A and elements of type B. The universal symbol consists of four elements of type A. The empty symbol consists of four elements of type B. The symbols of other kinds consist of 'n' elements of type A and 'm' elements of type B, where n+m=4. A background consists of one or two elements: one element of type C plus one element of type D or one element of type E which consists of element of type C and element of type D.

The elements of symbol that are shaded in FIG. 1 are elements of type A The elements of symbol that are not shaded in FIG. 1 are elements of type B. Element 16 in FIG. 1 is element of type C , element 17 in FIG. 1 is element of type D and element 18 in FIG. 1 is element of type E. The colors of the pixels of elements of symbol are colors of symbol. The colors of the pixels of elements of background are colors of background.

The element is simple if it consists of pixels of one kind. The element is combined if it consists from pixels of several kinds. In a simple element all pixels are of the same color. All the pixels of a simple element encode the identical information. The pixels of combined element encode different information. Each position of a pixel in combined element accords to some information (this information is encoded by position of pixel). In such element the pixels can be also of different colors. A combined element can include more than one pixels that encode the same information.

All elements of types A, B, C, D and E can be simple or combined.

Each element has width xl and height yl in pixels. It is possible to create 16 symbols from four elements.

The empty element of symbol is an element which does not contain any pixel, and xl=yl=0. The mono element of symbol is an element which consists of one pixel, and xl=yl=l. In other cases the element of symbol consists of xl*yl pixels.

Element of type C, 16 FIG. 1, has width x2 and height y2 in pixels. Element of type D, 17 FIG. 1, has width x3 and height y3 in pixels. J-f the background consists of one element then this element consists of x2*y2 + x3*y3 pixels. The element of type E is empty when x2=y2=x3^:=y3=0. The element of type C is empty when x2=y2= 0. The element of type D is empty when x3=y3=0.

The empty symbol consists of four empty elements. The matrix of symbol has width XI and height Yl in pixels. In the matrix of empty symbol X1=Y1=0. The empty background consists of one empty element of type E, and x2=x3==y2=y3=^:0.

The mono symbol consists of one mono element of symbol, and Xl=xl=Yl=yl=l. The W- mono symbol consists of two mono elements of symbol, and Xl=2, xl=l, Yl=yl=l. The mono two-dimensional bar code structure portion consists of mono symbol and empty background, and x2=x3=y2=y3=0, X=Y=Xl=xl=Yl=yl=l. The W-mono two-dimensional bar code structure portion consists of W-mono symbol and empty background, and x2=x3=y2=y3=^::0, X-X1=2, xl=l, Y=Yl=yl=l.

Each pixel of non-empty element can decode one or several attributes of roots or sell roots in Hebrew, lexical attributes of words, phrases and expressions from one or a few natural languages and special designations. Each method of coding such attributes in a combined color linear and two-dimensional bar code structure is characterised by the following parameters:

1. Parameters X,Y, Xl,Yl,xl,yl,x2.y2,x3,y3 (matrix of two-dimensional portion, matrix of symbols and elements).

2. List of symbols.

3. Table of elements, where line number is the number of element and columns contain the following parameters of element: type, number of symbol that contains this element, position of element in symbol, position of matrix of symbol and what element is it - simple or combined.

4. The table of pixels of each element that contains description of information encoded in each pixel, position of pixel in element, the way of coloring of pixel. A linear portion of combined color linear and two-dimensional bar code structure can be of fixed or variable width. The linear portion has width X2 and height Y2, and each bar has width x and height y. Each bar consists of pixels of the same color.

5. Table of linear portion parameters: is the width variable or fixed, X2,Y2, x and y, way of bars coloring, description information encoded in bars.

The coloring of pixels and bars can be implemented by 4, 8, 16, 256 colors or 24 or 32 bit RGB colors.

The present invention provides five ways of coding text to a combined color linear and two- dimensional bar code structure. The first way - a high dense coding that is used for storage of electronic information. The second way - a high dense coding that is used for storage of information that can be read by optical devices. The third way - coding that is used for delivery of information in visual formats (MPEG or others). The fourth way - coding that is used for processing information in video memory (intellectual search, select, ranging, verification, collection and classification information ). The fifth way - coding that is used for information visualization.

It is possible to encode attributes of alphabet and lexical in Hebrew, lexical attributes of words, phrases and expressions from one or a few natural languages and special designations to a digital code. The present invention provides three ways of coding text to such stratified digital code. The first way - a high dense coding that is used for storage of information. The second way - coding that is used for delivery of information. The third way - coding that is used for processing information (intellectual search, select, ranging, verification, collection and classification information).

Each method of coding text to a combined color linear and two-dimensional bar code structure is based on declaration of attributes of roots or sell roots in Hebrew, lexical attributes of words, phrases and expressions from one or a few natural languages and special designations. The method of coding is chosen according to the need of solving one or several of the following problems: providing of high density of coding, cryptography, search according to prototype in video memory, information visualization and others.

1. Attributes.

This invention relates to attributes of roots or sell roots in Hebrew, lexical attributes of words, phrases and expressions from one or a few natural languages and special designations encoded into combined color linear and two-dimensional bar code symbols.

In any language a word or an expression can be encoded to multi-positional digital code as A0.A1.A2.A3.A4, where A0 is a root of a word, Al - prefix, A2 - suffix, A3 - preposition and other accessory lexical elements and A4 - special words from context.

The best way of coding text to attain the goal of the present invention is to use a multi- positional digital code that consists of large number of positions where each position has a small number of elements.

The number of possible elements in positions Al - A4 is small. In A0 position there can be approximately 30000 - 60000 elements and even more. In order to attain the above-mentioned object, it is necessary to represent A0 as a multi-positional digital code consists of large number of positions where each position has a small number of elements (A0 = a0.al.a2.a3...).

In the present invention the attributes of roots or sell roots in Hebrew are used for declaration of stratification positional code a0,al,a2,a3..., where aO is a main attribute, al supplements aO, a2 supplements aO.al, etc. The present invention is several methods of coding texts based on the attributes of Hebrew alphabet and the attributes of roots and sell roots and lexical attributes in Hebrew. Kabalistic books give description of Hebrew alphabet as a set of umversal attributes that are elements of universal theory of classification based on kabalistic theory of «Ten sfirot».

A number of frequently used roots and sell roots in Hebrew is small. It is possible to form almost all lexical stock of Hebrew from these roots. Most Hebrew roots consist of only three letters and sell roots consist of only two letters. On the base of models of roots and words in Hebrew it is possible to create sets of attributes in Hebrew and in other languages. Roots and cells of roots are classification attributes for Hebrew and other languages. Hebrew is a high formalized language.

In the present invention the kabalistic principals of Hebrew are used for constructing the attributes of information.

This above-mentioned feature of Hebrew is used in the present invention for creating a high density bar code in order to attain effective scaleable algorithms of collecting, analyzing, processing and understanding texts, and for solution of the following problems: processing, representation, compression, cryptography, visualisation, search according to prototype, ranging, comparative analyses, collection and selection of information, translation of texts and study foreign languages.

For constructing AO = a0.al.a2.a3... it is possible to use methods of coding that are not connected to Hebrew. For example, semantic classes constructed manually or automatically (using taxonomy or another algorithm) for various languages. But using Hebrew is the only way that provides natural constructing of multi-position digital code a0.al.a2.a3... .

Building a multi-position stratification digital code in Hebrew can be implemented in two ways. The first way is calculation roots in Hebrew from words or expressions of any language. The second way is calculation words in Hebrew from words or expressions of any language. Calculation of roots or words in Hebrew can be implemented by translation from any language to Hebrew.

2. Methods of coding words or roots to alphabet attributes in Hebrew.

The present invention includes description of six examples of methods of coding words or roots to alphabet attributes in Hebrew:

1. Method of coding based on mono roots of words in Hebrew.

2. Method of coding based on mono cell of roots of words in Hebrew.

3. Three methods of coding based on mono LI -cells of roots of words in Hebrew.

4. Method of coding based on mono R- sells roots and R- roots of words in Hebrew.

Roots in Hebrew usually consist of three letters. In these methods only three-letter roots are used. Cell of root is two letters of a root. Cell of root can be the first and the second, the first and the third or the second and the third letters of three letters of the root. The words that have the same roots or sells of roots have something common in their meaning. Mono cell root words are the words formed from set of roots that have the same cell of root.

Most Hebrew words can be reduced to limited set of roots from which almost all lexical stock of language is formed according to certain rules. From one root usually it is possible to form more than hundred words. In Hebrew there are small number of roots. There are approximately 1640 verb roots. In Hebrew there are approximately 800 often used roots and 150 - 200 sells of roots. 3. Mono root words in Hebrew (method 1).

Each word in Hebrew can be coded as a pair (A, I) where "A" is the root of this word and "I" is the index of this word in the group of all possible words that have root "A" (the order number of the word in the group). If there are several variants of the root in the dictionary indexing starts from the first variant and continues subsequently. In the case of four letter roots, they are reduced to three letter roots by the rules of Hebrew, otherwise such roots are not coded.

In Hebrew there are 22 letters. Each letter can be coded as ala2a3 or blb2. Table 1 shows coding Hebrew letters as ala2a3. Table 2 shows coding Hebrew letters as blb2.

Table 1. al a2 a3 al a2 a3 al a2 a3

Alef 0 1 1 Yood 0 1 2 Koof

Bayt 1 1 1 Kaff 1 1 2 Raysh

Geemel 0 3 1 Lahmed 0 3 2 Sheen

Dahlet 0 1 3 Mem 0 1 4 Tav 0

Hay 1 1 3 Noon 1 1 4

Nahv 0 3 3 Sahmekh 0 3 4

Zahyeen 0 2 1 Ahyeen 0 2 2

Khet 1 2 1 Pay 1 2 2

Tet 1 3 1 Tsahdee 1 3 2

Table 2. bl b2 bl b2 bl b2

Alef 1 1 Yood 4 1 Koof 7 1

Bayt 1 2 Kaff 4 2 Raysh 7 2

Geemel 1 3 Lahmed 4 3 Sheen 7 3

Dahlet 2 1 Mem 5 1 Tav 7 4

Hay 2 2 Noon 5 2

Nahv 2 3 Sahmekh 5 3

Zahyeen 3 1 Ahyeen 6 1

Khet 3 2 Pay 6 2

Tet 3 3 Tsahdee 6 3

A Hebrew root can be coded as A3A2A1, where Al - the first letter of the root, A2 - the second letter of the root, A3 - the third letter of the root.

For example, letters Al and A2 are coded according to table 1, when Al=allal2al3, A2 = a21a22a23. Letter A3 is coded according to table 2, when A3 = blb2. Any three-letter Hebrew root can be coded as a pair that consists of two parts: L=al Ial2a21a22bl and P=al3a23b2.

L-root is the group of all possible root with identical value of vector L={ all, al2, a21, a22, bl}. Any Hebrew root can be coded as a pair (L, II), where "II" is the index of this root in the group of all possible roots that have the same L. The maximal number of L- roots is 252.

Most words in Hebrew can be coded as three elements (L, II, I).

Attributes L=al lal2a21a22bl can be coded as digital code K1K2K3, where Kl - the value from table 3, K2 - the value from table 4 and K3 = bl. Table 3.

Kl al2 a21

0 0 0

1 1 0

2 0 1

3 1 1

Table 4.

K2 al2 a22

1 1 1

2 1 2

3 1 3

4 2 1

5 2 2

6 2 3

7 3 1

8 3 2

9 3 3

4. Mono cell roots words in Hebrew (method 2).

Each word in Hebrew can be coded as (R, p, 12, 1), where "R" is the cell of the root, "p" is the type of the cell, "12" is the index of the root in the group of roots with the same cell and the same type of the cell, "I" is the index of the word in the group of words with the same root. Each root can be coded as the following three elements: (R, p, 12). Each cell root "R" consists of two letters Al and A2 and "p" can have one of three values: p = 1 - the cell of the root consists of the first and the second letters, p = 2 - the cell of the root consists of the second and the third letters, p = 3 - the cell of the root consists of the first and the third letters,

For example, letters Al and A2 are coded according to table 1, when Al=al lal2al3, A2 = a21a22a23, then a digital code K1K2K3K4 consist of Kl - the value from table 3, K2 - the value from table 4, K3 and K4 are defined according to the table 5. Table 5.

al3 a23 K3 K4

1 1 P 1

1 2 P 2

1 3 P 3

1 4 p+3 1

2 1 P 4

2 2 P 5

2 3 P 6

2 4 p+3 2

3 1 P 7

3 2 P 8

3 3 p+3 3

3 4 p+3 4

4 1 p+3 5

4 2 p+3 6

4 3 p+3 7

4 4 p+3 8

. 5. Mono LI - cceellllss rroooottss words in Hebrew (method 3).

For example, letters Al and A2 are coded according to table 1, where Al=allal2al3, A2 = a21a22a23.

Ll-sells roots is the group of all possible sells of roots with identical value of vector Ll= (all, al2, a21, a22}

Any Hebrew sell root can be coded as a pair (LI, 13), where "13" is the index of sell root in the group of all possible sell of roots that have the same LI.

Any three-letter root in Hebrew can be represented as (LI, 13, 12), where "12" is the index of this root in the group of all possible roots that have the same value LI of their sell roots.

Each word in Hebrew can be coded as (LI, 13, 12, 1), where T is the index of this word in the group of all possible words that have the same value LI of their sell roots.

Attributes: all,al2, a21 and a22 can be coded as digital code KlK2, where Kl - the value from table 3 and K2 - the value from table 4.

6. Mono LI - cells roots words in Hebrew (method 4).

Any three-letter root in Hebrew can be represented as a pair (LI, 14), where "14" is the index of this root in the group of all possible roots that have the same value LI of their sell roots.

Each word in Hebrew can be coded as (LI, 14, 1), where "I" is the index of this word in the group of all possible words that have the same value LI of their sells of roots.

Attributes: all,al2, a21 and a22 can be coded as digital code K1K2, where Kl - the value from table 3 and K2 - the value from table 4. 7. Mono LI - cells roots words in Hebrew (method 5).

For example, letters Al and A2 are coded according to table 1, when Al=al lal2al3, A2 = a21a22a23

Each word in Hebrew can be coded as (LI, 15), where "15" is the index of word in the group of all possible words that that have the same value LI of their sells of roots.

Attributes: al l,al2, a21 and a22 can be coded as digital code K1K2, where Kl - the value from table 3 and K2 - the value from table 4.

8. Mono R- sells roots and R- roots of words in Hebrew (method 6).

Each letter in Hebrew can be coded as a pair (Rn, 17), where "Rn" is the basic value of the letter and "17" is the index of this letter in the group consists of the letters with the same Rn, where n is a number 1 < n < 12. For example, basic values of letters R2 are represented in table 6 and basic values of letters R8 are represented in table 7.

Each sell root in Hebrew can be coded as (Rnl,Rn2, 18), where "Rnl " is the basic value of the first and "Rn2" - of the second letters of the sell root. 18" is the index of the sell root in the group of all possible sell roots that have the same value of vector {Rnl, Rn2}.

Each root in Hebrew can be coded as ( nl,Rn2, Rn3, 19), where "Rnl" is the basic value of the first, "Rn2" - of the second and "Rn3" - of the third letter of the root. 19 is the index of the root in the group of all possible roots that have the same value of vector {Rnl, Rn2, Rn3}.

Each root in Hebrew can be coded as the following elements: (Rnl,Rn2, 18, 110), where "HO" is the index of the root in the group of all possible roots that their sells of roots have the same value of vector{Rnl, Rn2}.

Each word in Hebrew can be coded as (Rnl,Rn2,Rn3, 19, 111) or (Rnl,Rn2, 18, 110, 111) where "111" is the index of the word in the group of all possible words that their roots have the same value of vector {Rnl, Rn2, Rn3} or the same value of vector {Rnl, Rn2}.

Table 6.

R2 R2 R2

Alef 0 Yood 0 Koof

Bayt 1 Kaff 1 Raysh 1 Geemel 0 Lahmed 0 Sheen 1

Dahlet 0 Mem 0 Tav 0

Hay 1 Noon 1 Nahv 0 Sahmekh 0

Zahyeen 0 Ahyeen 0

Khet 1 Pay 1

Tet 1 Tsahdee 1 Table 7.

R8 R8 R8

Alef 7 Yood 1 Koof 4

Bayt 6 Kaff 5 Raysh 1

Geemel 2 Lahmed 3 Sheen 4

Dahlet 7 Mem 1 Tav 4

Hay 0 Noon 5

Nahv 0 Sahmekh 3

Zahyeen 7 Ahyeen 1

Khet 6 Pay 5

Tet 2 Tsahdee 3

9. The method of coding of words or roots in Hebrew or words or expression in any language as stratified digital code.

For coding any root or word in Hebrew it is possible to use the following described above (six methods) alphabet attributes in Hebrew: Kl, K2, K3, K4, al, a2, a3, bl, b2, p, Rn, Rnl, Rn2, Rn3, all,al2,al3, a21, a22, a23, a31, a32, a33, bll, bl2, b21, b22, b31, b32.

For coding any root or word in Hebrew it is possible to use the following lexical attributes in Hebrew: root, binyan, model of root, model of verb, model of infinitive, model of word and other lexical models in Hebrew.

Each word in Hebrew can be coded by elements of the following sets: alphabet attributes, lexical attributes and mentioned above indexes of alphabet attributes in Hebrew.

The present invention is the method of coding words or roots in Hebrew as a stratified digital code a0.al.a2.a3 ... am,am+l...ax, ilil2..ik, where aO - am are alphabet attributes, am+1 - ax are lexical attributes in Hebrew and il - ik are indexes of alphabet attributes in Hebrew. Building of alphabet attributes is based on mentioned above kabalistic principals of alphabet, roots and sells of roots in Hebrew. The alphabet attributes are basic (main) attributes. The lexical attributes - binyans, models of roots, models of verbs, models of infinitives, models of words and others - are accessory attributes. The indexes can be used as additional attributes to alphabet and lexical attributes. Instead of indexes it is possible to use synthetic attributes which can be calculated from indexes manually or automatically. Synthetic attributes can be calculated from one or several indexes of words, roots, sell roots and other indexes.

The present invention is the method of coding words or expression in any language as stratified digital code a0.al.a2.a3 ... am,am+l...an,an+l... ax, il..ik where aO - am are alphabet attributes and am+1 - an are lexical attributes in Hebrew, an+1 - ax are lexical attributes in some language and il - ik are indexes for alphabet attributes in Hebrew.

10. The method of transformation of stratified digital code to combined color two- dimensional and linear bar code.

The present invention is the method of transformation of stratified digital code a0.al.a2.a3 ... am,am+l...an,an+l... ax, ilil2..ik to a combined color linear and two-dimensional bar code. In a combined color linear and two-dimensional bar code each attribute or index of stratified digital code is encoded to one or several pixels of element of combined color linear and two- dimensional bar code. Each attribute or index of stratified digital code corresponds to some position and color of such pixel or pixels. The number of colors in palettes for symbol and background of two-dimensional portion and in palette for bars in linear portion depends on the ways of transformation of attributes or indexes of stratified digital code to a combined color linear and two-dimensional bar code.

The present invention is directed to processing information in video memory for effective solution of problems of search, cryptography, analysis, classification, verification of information and other problems.

In mode EGA colors of pixels and bars can be implemented by 4, 8 or 16 colors. In mode VGA colors of pixels and bars can be implemented by 256 colors or 24 or 32 bit RGB colors. In mode RGB each pixel uses a combination of three different colours: red, green and blue. For 256 shades of red, green and blue are required 8 bits for each of the three primary colours, hence 24 bits in total. Some graphics cards can use 32 bits. Video memory of a 256-colour mode is a widely used standard.

The 24 bit RGB is a matrix of pixel 8x3 that consists of 8 lines and 3 columns. The 32 bit RGB is a matrix of pixel 8x4 that consist of 8 lines and 4 columns. The lines are numbered from 0 to 7. The columns correspond the colors: red, green and blue. The matrix of pixel 8x3 or 8x4 can be used for coding one or several attributes of stratified digital code. In one matrix (one pixel) several words can be encoded.

There are many ways of representation of information in the pages of video memory. Video memory consists of the pages of the following five types:

1. Three pages that correspond basic colors (red, green and blue).

2. 24 or 32 pages, each of them corresponds one bit (in 24 or 32 bit RGB mode).

3. Four pages, each of them corresponds one page in EGA video memory.

4. Eight pages correspond the lines of matrix of pixel 8x3 or 8x4.

5. «n» pages accordingly to «n» masks of matrix of pixel 8x3 or 8x4.

For each group of attributes reservation of pages of video memory is made in accordance to the types of the pages. For example, in the case of three pages it is possible to code alphabet attributes to different gradations of red color, lexical attributes to different gradations of green color and indexes to different gradations of blue color.

2-D portion of combined color two-dimensional and linear bar code is adjacent to a linear portion of this code. 2-D portion is placed to the left of a linear portion. A linear portion consists of a sequence of color bars. The area of a bar consists of identical pixels. It is possible not to use a linear portion.

The sizes of a combined color two-dimensional and linear bar code are: X,Y - the size of a matrix of two-dimensional portion, X1,Y1 - the size of a matrix of symbols, xl,yl - the size of elements, x2,y2,x3,y3 - the size of background and X2, Y2 - the size a linear portion.

If X=xl, Y=yl and X2=Y2=0 then a combined color linear and two-dimensional bar code consists of only one element. If X==xl=Y=yl=l and X2=Y2=0 then a combined color linear and two-dimensional bar code consists of only one pixel. In other cases a combined color linear and two-dimensional bar code can consist of two or more elements or pixels. In each page of video memory the parameters (sizes) of combined color two-dimensional and linear bar code can be the same. Thus, information encoded by this code can have the same addresses in different pages. In one combined color two-dimensional and linear bar structure several words can be encoded.

11. Information visualization and search of information according to prototype.

The present invention has been described with respect to combined color linear and two- dimensional bar code, but it is not limited to such embodiments. It is conceivable that the method of the present invention may also find application in solution of problems of verification, comparative analysis, search, search of according to prototype, selection, ranging and classification of information in various languages and information visualization. The problems of verification, comparative analysis, search, selection, ranging and classification of information and search of according to prototype are solved by the same way.

Information visualization and search of information according to prototype relate to processing of abstract data. The present invention can be used for implementation of such processing. One approach to this implementation is the algorithm consists of four steps:

1. Reduction of text.

2. Calculation of attributes.

3. Coding attributes to combined color linear and two-dimensional bar code.

4. Processing of combined color linear and two-dimensional bar code.

Information visualisation is directed to human visual analysing of abstract data. Information visualisation is processing of information that uses a human perception system. Search of information according to prototype is directed to machine analysing of abstract data and uses for this machine algorithms.

In order to process a document it is necessary to calculate the abstract data that characterizes the contents of this document. Reduction of information is calculation of abstract data. Stratification coding of abstract data provides development of simple and fast algorithms of search and visualization of information.

The present invention is the methods of stratification (the above-mentioned six methods). Each one of these methods is implemented by two stages: the stage of reduction of information and the stage of stratification coding. Reduction includes operations of normalization and simplification of information.

The stage of reduction is implemented by four steps:

1) Extraction and coding of idioms, phrases, terms and objects from the sentences of the text.

2) Reduction of verb-roots that is implemented by translation of sequence of words from the text in any language to the sequence of verb-roots in Hebrew.

3) Extraction and coding of prepositions, pronouns, conjunctions and other lexical elements from the text in any language.

4) Normalization of the text (using the synonyms and the antonyms).

In the stage of stratification processing of information can be implemented by many ways. Stratification coding is representing information in such a way that makes it possible to collect and to aggregate the main characteristics of the document which allow to find hidden and valuable nuggets of information quickly and powerfully.

Information visualization applies visual processing of abstract information. This area arises because of trends in technology and information scale. Visualisation enables people to use natural tools of observation. A typical analysis consists of examiiώig a set of documents in order to answer some specific question. In analysis texts a major is knowledge of the information space documents. For this purpose overview navigational views are very useful.

Visualization is the tool that provides quantitative and qualitative analysis and estimation of content of information. Visualization can be applied to navigation and comparative analysis of information. It is also possible to apply visualization to associative human perception of content of information.

The present invention is directed to development of information visualization software that will execute the following functions:

1. Adaptation to human perception by changing colors and forms of abstract icons of documents which are received by translation texts to pictures (abstract icons).

2. Calculation of abstract data by different mentioned above methods.

3. Simplification and reduction of information.

4. Multi-layers analysis of documents.

5. Visualization of contexts of key words.

6. Observation of information based on the map of observation that is used for visualization of content.

7. Viewing of information based on the map of viewing that is used for identification of pages of documents as abstract icons.

8. Navigation of information based on the map of navigation that is used for visual comparative analysis of pages.

These maps are a service for observation of a large number of pages of documents (books). Each icon of a map can accord to a page of a book. On one screen it is possible to arrange 30 - 250 icons that represent 30 - 250 pages of a book.

A map consists of icons that accord with the following types of pages:

1. Identical pages.

2. Pages that contain one or several identical parts.

3. Equivalent pages - pages that have identical contents.

4. Similar pages - pages that have similar contents.

5. Pages that have equivalent or similar parts.

Maps make it possible to see distinction between icons that reflects distinction between contents of pages.

Previous invented microscopic fonts were intended for representation of diminished picture of page. A color microscopic font is used for location of places or words in such picture of page. Microscopic fonts can be effectively used for perception of pages of the first and the second types. I-n other cases their use is not effective.

One way of solution of a problem of comparative analysis of equivalent or tolerant pages or parts of pages is to create abstracts of such pages or parts of pages and to write such abstracts in normalized language where all similarity and tolerant words are designated identically. Visualization by a color microscopic fonts is less effective than by color combined color linear and two-dimensional bar code. A combined color linear and two-dimensional bar code is more compact than microscopic fonts. A combined color linear and two-dimensional bar code is effective for the pages of 1 - 4 types and can be effective for the pages of the fifth type.

A combined color linear and two-dimensional bar code has the following advantages: compact representation of information and possibility to use various algorithms for transformation of combined color linear and two-dimensional bar code to abstract pictures (icons). Such icons are better for human perception than microscopic fonts. Information visualization by combined color linear and two-dimensional bar code can be used when preliminary preparation of documents is already executed (glossaries or terminology dictionaries are developed, lexical classification is executed, etc).

It is possible to solve the problems of verification, comparative analysis, search, search according to prototype, selection, ranging and classification of information in various languages using abstract data as stratified digital code a0.al.a2.a3 ... am,am+l...an,an+l... ax,lil2..ik. Such abstract data is represented by pages of video memory of one of five mentioned above types. Representation of information in video memory as stratified digital code a0.al.a2.a3 ... am,am+l...an,an+l... ax,lil2..ik is implemented by 3, 8, 24, 32, or n fields (pages).

For example, algorithms of search of information is implemented by several steps. The first step is scanning the first page of video memory that consists of basic attributes (K1K2, K1K2K3K4 or another set of basic attributes). If the basic attributes equivalent to appropriate elements of the prototype were found in the first page, then go to step 2. The second step is checking the second page of video memory that consists of the first layer attributes which are the addition to basic attributes. The first layer attributes from the second page are compared to the first layer attributes of the prototype. If these attributes are equivalent, then go to step 3, otherwise to stepl. The third step is checking the third page of video memory that consists of the second layer attributes which are addition to the first layer and basic attributes. The second layer attributes from the third page are compared to the second layer attributes of the prototype. If these attributes are equivalent, then go to step 4, otherwise to stepl. The fourth, fifth and other steps are executed by the same way.

Industrial Applicability.

The present invention has been described with respect to combined color linear and two- dimensional bar code, it is not limited to such embodiments. It is conceivable that the method of the present invention may also find application in solution of problems of using MPEG standards for coding information and using graphic cards and special video co-processors for processing information in unstructured text databases and E-publishing systems. This embodiments is directed to creating intellectual terminals and eBooks for unstructured text databases and E- publishing systems which use MPEG standards for storage data on DVD or other devices and for delivery information from internet or digital TV. And also to processing data in graphic cards and to using special video co-processors for this. And also to creation of special devices for verification, comparative analysis, search, search according to prototype, selection, ranging and classification of information in various languages and information visualization for unstructured text databases and E-pubHshing systems. These special devices can be used together with PS, digital TV decoders and other equipment as new means.

By the late 1990s the multimedia and 3D graphics has increased used and the rate of development in the graphics chip arena had reached levels unsurpassed in any other area of PC technology. The role of the graphics card has become ever more important and it has evolved into a highly efficient processing engine which can really be viewed as a highly specialised coprocessor. Incorporating the MPEG 2 decoder circuitry on one chip, it is possible to process high-resolution 3D graphics data. MPEG-1 is the official standard for delivery of video information from CD-ROM. MPEG-2 is used in digital TV and DVD-Video. MPEG-4 is the official international standard (ISO/IEC 14496) for interactive multimedia (including products, distributed on optical disks and through network), graphic applications, digital TV, Packet Video and etc. MPEG-4 includes BIFS language for description of objects, classes of objects and stages that provides animation of objects, change of their coordinates and sizes.

The suggest of the present invention is directed to provide using MPEG standards for coding iriformation from unstructured text databases and E-pubHsbing systems. These standards have many advantages and perspectives related to development of modern hardware and software. The suggest of the present invention is to use a combined color linear and two-dimensional bar code for coding texts in such modern hardware and software systems.

The other suggest of the present invention is directed to provide using graphic cards and special video co-processors for processing information which is encoded in combined color linear and two-dimensional bar code and is represented in video memory as described above. This suggest relates to a new full 128-bit CPU ("Emotion Engine") for use in the next generation of PlayStation. PlayStation processes multi-media information with the fastest possible speeds. This new CPU has application not only for games, but it can be also used as a media processor for search of textual data in unstructured text databases and E-publishing systems. In this cause it is possible to use the suggest of the present invention.

Still another feature of the present invention is to provide an illustrated electronic books that will use MPEG standards for storage and delivery information and will use graphic cards and special video co-processors for processing iriformation. Illustrated electronic book is a folder of illustrations. Illustration is a picture that contains one or several labels in combined color linear and two-dimensional bar code. Each label can be decoded to the text. This approach represents by one image both picture and text.

Still another feature of the present invention is to provide a service for accelerating human perception of information. Such a service provides observation, viewing and reading documents. Visualization of pages of documents is used for observation and viewing. In the mode of observation analyses and estimation of icons of pages is executed. In the mode of viewing it is possible to look at icons and to read abstracts of according pages. Thus there is a possibility to develop associative relations between icons and abstracts of pages. In the mode of reading complete texts of pages can be read, service can be used when preHminary preparation of documents is already executed (glossaries or terminology dictionaries are developed, lexical classification is executed, etc). «Helps» must also be prepared.

Still another feature of the present invention is to provide a multilingual & visualization browser consists of two components. The first component executes search of documents in Internet or in Data Base and their download in PC. The second component is an interface that provides comparative analysis of loaded information. Today there are many different kinds of software for search and download of documents. Multi lingual & visualization browsers will provide a multi-parametral analysis and vizualization of documents in any language and creating abstracts of documents in any language.

Still another feature of the present invention is to provide a service for active study of any foreign language.

Each way of visualization is observation of information from some point of view. Still another feature of the present invention is to provide a software of observation with a large number of different points of view and is to provide choosing from a large number of ways of visualization (points of view) one way that is the best for individual human perception. Still another feature of the present invention are to provide services for visualization of commercial information:

1. Service for creating various maps for e-commerce based on labels of documents in combined color linear and two-dimensional bar code for visualization of brief contents of documents (goods map, offers map, sales and purchases map, dealers map and etc.).

2. Service in Internet on the base of maps for e-commerce.

3. Service of global multi lingual catalogue - map of goods and offers.

4. Service for effective and quick implementation of search, comparative analysis, ranging, classification and selection of data and etc. in unstructured Data Base of E-commerce.

The present invention - Combined color linear and two-dimensional bar code - provides many ways of information visualization that support human perceptual system. If two texts are identical, their labels are also identical. If two texts are similar, their labels are also similar. Each way of visualization is some point of view, that supplies some quality of examination and estimation of identical and similar labels. In order to give the user the opportunity to find similar documents with the help of labels various ways of visualization based on of combined color linear and two- dimensional bar code are used. The present invention also provides five level of information security. In another, the present invention provides simple methods and algorithms of information reduction and normalization and effective and quick implementation of documents search, comparative analysis, ranging, classification and selection.

In order to compare the documents it is necessary to declare the factors that characterize the contents of documents. For any document it is possible to calculate the values of these factors. Thus, the problem of search and comparison of documents according to their contents is reduced to multi-parametral analysis which implementation is based on multi- layer texts. The present invention provides the following: semantic factoral analysis of information, search of documents according to their contents on the base of semantic factoral analysis, navigation map, mindmap and etc.

The present invention may be used for coding text in one language and decoding to another language. For example, if three language dictionary (English - Russian - Hebrew) is used, it is possible to code the texts in Russian and after that to decode it to English.

The present invention provides five level of information security.

Usually confidential documents consist of confidential and free data. Confidential data can have different priorities. The present invention provides coding confidential documents and their observation, viewing, reading and authorized protection and provides various levels of protection for confidential pages or data of documents. Thus different persons can have access to different pages or data of documents. It is also possible to organize free access to non confidential information and authorized access to confidential information depending on priorities of users. It is also possible to organize sales of information depending on prices of data.

Still another feature of the present invention is to provide development of a new and original kind of electronic books - textual electronic books set, which have the following features: a) Processing of all electronic books from a set as a whole unit. b) Visualization of pages of one or several electronic books. c) Cryptography (five levels of protection). d) Search, search according to prototype, ranging of texts in electronic books set. e) Comparative analysis of texts from one or several books. f) Creation of abstracts. Also the following services can be provided:

1. Active studying foreign languages.

2. Translation of information.

3. Service for acceleration of human perception of information.

4. Service for preparation textual electronic books set.

Claims

1. A combined color linear and two-dimensional bar code structure contains the following encoded information: alphabet and lexical attributes in Hebrew, lexical attributes of words, phrases and expressions from one or several natural languages and special designations; and a color two-dimensional bar code structure portion is a matrix consists of color elements; and a linear color bar code structure portion consists of a set of color bars; and each of such elements or bars is characterised by the placement, position and colours; and a plurality of elements and bars has a predefined relationship with a plurality of alphabet and lexical attributes in Hebrew and attributes in other languages; and calculation of alphabet and lexical attributes in Hebrew and lexical attributes in one or few natural languages is implemented by three steps: a) the first step - lexical analyses and coding of lexical elements of the text; b) the second step - extraction from the text in any language of the roots, words or expressions that can be translated to Hebrew expression per expression, word per word or root per root; c) the third step - calculation of alphabet and lexical attributes in Hebrew from roots, words or expressions in Hebrew; and building a stratified digital code from alphabet and lexical attributes in Hebrew and lexical attributes in one or few natural languages; and transformation of stratified digital code to combined color two-dimensional and linear bar code.

2 The combined colour linear and two-dimensional bar code structure of claim 1 in which a color two-dimensional bar code structure portion consists of elements of a symbol and elements of a background, the matrix of a symbol consists of four elements of a symbol.

3. The combined colour linear and two-dimensional bar code structure of claim 2 in which elements of a symbol can be of one of two types: elements of type A and elements of type B, and the umversal symbol consists of four elements of type A, and the empty symbol consists of four elements of type B, and a background consists of one or two elements: one element of type C plus one element of type D; or one element of type E which consists of element of type C and element of type D.

4. The combined colour linear and two-dimensional bar code structure of claim 3 in which elements of types A, B, C, D and E can be simple or combined, and all the pixels of a simple element encode the identical information, and the pixels of combined element encode different information so that the placement of the pixel in combined element and the color of the pixel encodes some information.

5. The combined colour linear and two-dimensional bar code structure of claim 4 in which a combined element can include several pixels that encode the same information,

6. The combined colour linear and two-dimensional bar code structure of claim 2 in which each element of a symbol has width xl and height yl in pixels, the matrix of a symbol has width XI and height Yl in pixels, and the matrix of two-dimensional portion has width X and height Y in pixels.

7. The combined colour linear and two-dimensional bar code structure of claim 3 i which an element of type C has width x2 and height y2 in pixels, an element of type D has width x3 and height y3 in pixels, an element of type E consists of an element of type C and an element of type D.

8. The combined colour linear and two-dimensional bar code structure of claim 1 in which a colour linear bar code structure portion can be of fixed or variable width, and each bar consists of pixels of the same color and has width x and height y, and the linear portion has width X2 , height Y2 and Y2=Y

9. The combined colour linear and two-dimensional bar code structure of claim 1 in which the parameters X,Y, Xl,Yl,xl,yl,x2,y2,x3,y3, X2 and Y2 can have different values, including the following combinations: a.) the mono two-dimensional bar code structure portion ( x2=x3=y2=y3^:=0,

X=Y=Xl=xl=Yl=yl=l ), b.) the W-mono two-dimensional bar code structure portion ( x2=x3=y2=y3=0, X=X1=2, xl=l-

Y=Yl=yl=l ), C.) the two-dimensional portion ( X=Y=3, xl=yl=l and X1=Y1=2 ), d.) the two-dimensional portion ( X = Y = Xl= Yl =2 and xl=yl=l ), e.) the two-dimensional portion ( X = XI = 1, Y = Yl =2 and xl=yl=l ), f.) the two-dimensional portion ( X = Y = 3, XI = Yl = 2 and xl=yl=l ), g.) the two-dimensional portion ( X = Y = 3, XI = Yl = 2 and xl=yl=2 ), h.) the two-dimensional portion ( X - Y = 5, XI = Yl = 4 and xl=y 1=2 ), i.) the two-dimensional portion ( X = Y = 7, XI = Yl = 6 and xl=yl=3 ), j.) the two-dimensional portion ( X = Y = 8, XI = Yl = 6 and xl= l=3 ).

10. The combined colour linear and two-dimensional bar code structure of claim 1 in which the coloring of pixels and bars can be implemented by 4, 8, 16, 256 colors or 24 or 32 bit RGB colors.

11. The combined colour linear and two-dimensional bar code structure of claim 10 in which various structures of video memory are used for representation of information.

12. The combined colour linear and two-dimensional bar code structure of claim 11 in which the structures of video memory pages of the following five types are used: a.) three pages that correspond basic colors (red, green and blue), b.) 24 or 32 pages, each of them corresponds one bit (in 24 or 32 bit RGB mode), c.) four pages, each of them corresponds one page in EGA video memory, d.) eight pages that correspond the lines of matrix of pixel 8x3 or 8x4, e.) «n» pages that correspond «n» masks of matrix of pixel 8x3 or 8x4.

13. The combined colour linear and two-dimensional bar code structure of claim 9 which provides coding texts according to appropriate bar code parameters, so that further the effective solution of one of the following problems is received: a) a high dense coding that is used for storage of electronic information; b) a high dense coding that is used for storage of information that can be read by optical devices; c) coding that is used for cryptography; d) preliminary coding of text for future secondary coding in MPEG standards; e) coding that is used for processing information in video memory (intellectual search, select, ranging, verification, collection and classification information); f) coding that is used for information visualization; g) coding that is used for translation text and active studying foreign languages.

14. The combined colour linear and two-dimensional bar code structure of claim 1 in which only stratified digital code is used for effective solution of the following problems: a) a high dense coding that is used for storage of iriformation; b) coding that is used for processing information in RAM (intellectual search, select, ranging, verification, collection and classification of information); c) coding that is used for cryptography; d) coding that is used for information visualization, e) coding that is used for translation text and active studying foreign languages.

15. The combined colour linear and two-dimensional bar code structure of claim 1 in which the following six methods of coding words or roots in Hebrew to alphabet attributes in Hebrew are used: a.) method of coding based on mono roots of words in Hebrew; b.) method of coding based on mono cell of roots of words in Hebrew; c.) three methods of coding based on mono Ll-cells of roots of words in Hebrew; d.) method of coding based on mono R- sells roots and R- roots of words in Hebrew.

16. The methods of coding words or roots in Hebrew to alphabet attributes in

Hebrew of claim 15 in which L-roots, Ll-cells of roots, R-sells of roots and R-roots of words in Hebrew are used.

17. The combined colour linear and two-dimensional bar code structure of claim 1 in which roots, cells of roots L-roots, Ll-cells of roots, R-sells of roots and R-roots in Hebrew are attributes for Hebrew and other languages.

18. Coding words or roots in Hebrew to alphabet attributes in Hebrew of claim 15 in which the following alphabet attributes in Hebrew are used: Kl, K2, K3, K4, al, a2, a3, bl, b2, p, Rn, Rnl, Rn2, Rn3, all,al2,al3, a21, a22, a23, a31, a32, a33, Ml, bl2, b21, b22, b31, b32.

19. The combined colour linear and two-dimensional bar code structure of claim 1 in which words or expression in Hebrew are encoded as a stratified digital code a0.al.a2.a3 ... am,am+l...ax, ilil2..iy, where aO - am are alphabet attributes, am+1 - ax are lexical attributes in Hebrew and il - iy are indexes of alphabet attributes in Hebrew.

20. The combined colour linear and two-dimensional bar code structure of claim 1 in which kabalistic properties of alphabet, roots and sells of roots in Hebrew are used for building alphabet attributes.

21. The combined colour linear and two-dimensional bar code structure of claim 1 in which the alphabet attributes are basic (main) attributes and the lexical attributes - binyans, models of roots, models of verbs, models of infiriitives, models of words and others - are accessory attributes.

22. The combined colour linear and two-dimensional bar code structure of claim 1 in which words or expression in any language are encoded as a stratified digital code a0.al.a2.a3 ... am,am+l...an,an+l... ax, il..ik, where aO - am are alphabet attributes and am+1 - an are lexical attributes in Hebrew, an+1 - ax are lexical attributes in some language and il - ik are indexes of alphabet attributes in Hebrew.

23. The combined colour linear and two-dimensional bar code structure of claim 13 which provides coding texts by one of several methods so that further effective solutions of one or several of the following problems of information visualization are received: a.) adaptation to human perception by changing colors and forms of abstract icons of documents which is attained by translation texts to pictures (abstract icons); b.) calculation of abstract data by various mentioned above methods; c.) simplification and reduction of information; d.) multi-layer analysis of documents; e.) visualization of contexts of key words; f.) observation of information based on the map of observation that is used for visualization of content; g.) viewing of information based on the map of viewing that is used for identification of pages of documents as abstract icons; h.) navigation of information based on the map of navigation that is used for visual comparative analysis of pages.

24. The combined colour linear and two-dimensional bar code structure of claim 12 in which representation of information in video memory as stratified digital code a0.al.a2.a3 ... am,am+l...an,an+l... ax,lil2..ik, ik+1 ..iy is implemented by 3, 8, 24, 32, or n fields (pages) and is used for intellectual search, select, ranging, verification, collection and classification information.

25. The representation of information in video memory as stratified digital code of claim 23 which provides using graphic cards and special video co-processor for processing information in video memory.

26. The combined colour linear and two-dimensional bar code structure of claim 1 which provides several methods of coding for development of illustrated electronic books, that will use MPEG standards for storage and delivery and graphic cards and special video co-processor for processing information in video memory.