Shishigin Mike : другие произведения.

The Conception Of Ftp Upload Manager

Самиздат: [Регистрация] [Найти] [Рейтинги] [Обсуждения] [Новинки] [Обзоры] [Помощь|Техвопросы]
Ссылки:
 Ваша оценка:
  • Аннотация:
    THE CONCEPTION OF FTP UPLOAD MANAGER

THE CONCEPTION OF FTP UPLOAD MANAGER

  
   The search system Google is deservedly a leader among the search systems, and the army of fans of this search system is growing steadily. Let's examine in short peculiarities of the search system, using an index base for the search. How is the search performed? The search Robot, to a certain extent, reminds a dexterous secretary-assistant, who, beforehand, looks though all periodicals, does all underlining and clipping of the most interesting materials, and then he puts all into the files with the proper inscriptions and, upon the first request of his Chief, immediately provide the necessary materials.
   The search Robot Googlebot `hunts' the Internet and seeks out the new documents (new URL-addresses), and it also visits the old ones and indexes their text contents. During the key-words search of documents, the reference to this data base takes place, and there are all URL-addresses of the points, in which there are documents, containing the combinations of the words specified.
   Let's note one important peculiarity of the context search, performed by the search system Google. In the search window, please, set up the sequence of four or five key-words and perform the search. Suppose, your key-words were so much unique that you got only a couple of the documents as the search result. Having changed the key-words order in the request window, you'll be pleasantly surprised having got the same couple of the documents as the search result.
   Let's ask ourselves: In what way can the mechanism of the request, in which the key-words order is inessential, be performed?
   Let's speak the hypothesis, based on the following fact. Any English word consisting of two and more symbols can be presented as a set of the adjacent symbols pairs.
  
   For example, the word OPTIMIZATION is presented in the following pairs:
  
   FTP UPLOAD MANAGER
  

op

pt

ti

im

mi

iz

za

at

ti

io

on

  
   One can easily make it certain that this set of the adjacent symbols pairs characterize uniquely the original word, which can be recovered on the grounds of the set of the above pairs.
  
   This set of adjacent symbols pairs can be presented as a square matrix consisting of 26 lines and 26 columns, A(i,j) (i=1,...26; j=1,...26).
  
   In the intersection of the 1-st line and the 20-th column, 1 (A(1,20)=1) is placed; the above specifies that the set of the adjacent symbols pairs contains the pair of symbols “at”.
  
   In the intersection of the 9-th line and 13-th column, 1 (A(9,13) = 1) is placed; the above specifies that the set of the adjacent symbols pairs contains the pair “im”.
  
   Thus, we have the following unified matrix for the word “Optimization”:
  

A(i,j) (i=1,...26; j=1,...26)

(Matrix 1)

   Let's write down the unified matrix B (i, j) (i=1,...26; j=1,...26) for the word SEARCH

  
  

B (i, j) (i=1,...26; j=1,...26)

  

(Matrix 2)

  
   Let's write down the unified matrix C (i, j) (i=1,...26; j=1,...26) for the word ENGINE
  

  
  

C (i, j) (i=1,...26; j=1,...26)

  

(Matrix 3)

  
   Having performed the component addition of the matrixes A(i, j), B(i, j), C (i, j), we'll have the unified matrix D (i, j), for the phrase: SEARCH ENGINE OPTIMIZATION.
  

D (i, j) = A (i, j) + B (i,j) + C (i,j)

  
  
   The unified matrix D (i,j) uniquely characterize the indigested set of words of the origin phrase SEARCH ENGINE OPTIMIZATIN and permits to reduce redundancy of the original text; the above redundancy is connected with the degree of order of the words.
  

D (i, j) (i=1,...26; j=1,...26)

  

(Matrix 4)

  
   Let's write down the unified matrix for the following phrase: GOOGLE USES LINK POPULARITY MORE HEAVILY THAN ANY OTHER SEARCH ENGINE.
  
  
  

(Matrix 5)

  
   Let's write down the unified matrix for the text: GOOGLE USES LINK POPULARITY MORE HEAVILY THAN ANY OTHER SEARCH ENGINE. RESULTS RANKING ALGORITHM.
   We have the unified matrix A (i,j).
  

  

A (i, j) (i=1,...26; j=1,...26)

  

(Matrix 6)

  
   Let's write down the unified matrix for the following phrase: LINK POPULARITY
  
   We have the unified matrix B (i, j).
  

B (i, j) (i=1,...26; j=1,...26)

  
  

(Matrix 7)

  
   One can perform operations, known from the theory of matrix, over the unified matrixes. Having performed the operation of the component multiplication over the matrixes A (i, j) and B (i, j), or the operation of the component logical multiplication, and having preliminary written the value 1 in the matrix components with values > 0, we can find out presence of the key words of the request LINK POPULARITY in the original text: GOOGLE USES LINK POPULARITY MORE HEAVILY THAN ANY OTHER SEARCH ENGINE. RESULTS RANKING ALGORITHM.
  
   Below is the matrix, confirming that the original text contains the key-words of the request. The general cells of the matrixes A (i, j) and B (i, j), having the value of component > 0, are darkened.
  
  

(Matrix 8)

   Let's ask ourselves, what the index of a document (site page) is in the Googlebot index base. This is the most important thing for achieving of which the search robot Googlebot works. The search system robot investigates the site and constructs its model. In the model the main content of the site and site pages is reflected. The page index is specified by the structure, which includes the following: the title text (title), heading, anchor texts, body text (body) of the hypertext page indexed.
   Thus, in the index all elements of hypertext are presented, and, which is very important, the search unit, unified matrix, is formed; the above matrix to be called the search concept C (P) of the indexed page P.
  
   Non-informative words to be previously deleted from the original text, contained on the page site (the procedure of stop-words is performed). Then a unified matrix is formed; its components uniquely characterize disordered set of the informative words of the original text of the site page. The unified matrix is the component of the indexed page, and it is placed in the corresponding base. The set of the unified matrixes forms the base of the resource tree for the key-words search. The unified matrixes of the tree base form the lower, the zero level of the resource-tree. Having performed the operation of the component addition of the unified matrixes of the separate groups of the 0-level, the unified matrixes of the I-st level are formed.
   Having performed the operation of the component addition of the unified matrixes of the separate groups of the I-st level, the unified matrixes of the 2-nd level are formed.
  
   Below is the figure (Figure 1), explaining the fact, that the unified matrix of the (i+1) level of the C(P) is the result of the component addition of the unified matrixes of the i-level C1(P), C2 (P), ... Ck (P).
  

C(P) = C1(P) + C2 (P) + ... +Ck(P).

  
  

Figure 1

  
   During the construction of the algorithm of the unified matrixes search, containing the key-words of the request, it is important that upon revealing of absence of the key-words in the unified matrix of the (i+1) level of the C(P), one can make a conclusion that the key-words are absent in the unified matrixes of the i-level C1(P), C2 (P), ... Ck (P).
  
   In figure 2 we can see the tree of the unified matrixes, designed for execution of the key-words search.
  

Figure 2

FTP UPLOAD MANAGER

  
   Conclusion: In the article the hypothesis of the search mechanism of the search server Google is enlightened. The supposition that the new special search construction, unified matrix, is used for execution of the key-words context search in the index base.
   The unified matrix is a peculiar, scale construction, permitting to evaluate uniquely presence of the words in the site page text.
  

  
 Ваша оценка:
Связаться с программистом сайта.

Новые книги авторов СИ, вышедшие из печати:
О.Болдырева "Крадуш. Чужие души" М.Николаев "Вторжение на Землю"

Как попасть в этoт список

Кожевенное мастерство | Сайт "Художники" | Доска об'явлений "Книги"