Methods and means for setting up connection between data files

FIELD: technology for setting up logical connections between a set of data files, such as files in Internet.

SUBSTANCE: device contains: display means; means for determining area of display for first file, made with possible selection of second area, which represent second files logically connected to first files, and for determining additional display files for other files, logically connected to first file; input means, made with possible selection of display area, appropriate for one of files. Procedures for assigning display areas may be performed iteratively, so that a certain diagram of interconnections between these areas is formed.

EFFECT: simplified setting up of connections between data files of various types.

6 cl, 34 dwg

 

The area is open

This opening is connected with the methods of establishing relationships between the data files (or parts of the same file data), methods of moving between data files (or inside a data file), and devices designed to implement these methods. The opening is associated with a device, including a display which displays the map data files, in particular a device with small screen resolution either in absolute terms or in comparison with the number of data files, among whom should be contacted (for example, 100 or 1000 files).

The files referenced in the following document may be an electronic file, but can be, in the alternative, the files stored on any other recording device, such as optical or holographic media storage. As discussed in more detail below, the opening is particularly suitable, for example, to display relationships between data files included in the global Internet system.

The preceding discussion of the situation

An enormous amount of information stored in the global Internet is divided into data files, each of which has an "address", and is stored on your computer called "server". One of the types of files referred to as "page" and consists of a simple set of information. The format of the display of the of the information differs from page to page, for example, some pages may contain text only, while others can, for example, contain links to audio or visual files in certain places on the page. Using a program called "viewer", the user of the global Internet system can obtain images of these pages are part of his or her monitor, referred to as the "table viewer", for example, on one page. Specifically, we can say that the user is on the Internet at the place corresponding to the location of the page from the Internet, and that he is viewing the page corresponding to its location.

As the pages of a regular book, organized in numbered order, page world Internet have certain logical relationships with each other, but the logical relationship between pages in the world of Internet is much more complicated than a simple numbered sequence. The purpose of these logical relations is to link to pages that contain related among themselves information. For example, a page containing information on the first topic (say, "patents"), may be logically associated with one or more pages containing information on similar topics (e.g., "attorneys on patents").

The logical relationships m is waiting for pages defined logical connectives, known as "hyperspace". Hyperspace usually defined in a hypertext programming language (or, perhaps, in a more complex presentation of content, such as a Flush or lingo) file type of the language

based world system Internet (the term hypertext is typically used with the inclusion of hypertext markup language (HTML), dynamic HTML, wireless markup language (WML), Active Server Pages, etc. and the term "hyperspace" is used hereinafter to refer to communication in the AWT, such as defined in JAVA or any other language used for representing text and interactive operations. Only one page can contain one or more "hypervisor, each

which is associated with part of the page (for example, a few words on this page), known as "binding". Hyperspace defines the logical relationship between "connecting" part of the page and the second page of the Internet (or, perhaps, a certain place on this second page). The user can access the second page by simply positioning the cursor in connecting the cover image and

pressing the button, for example button mouse. Thus the page he was reading, is automatically replaced with a second page associated with pomoschnitsei. Thus, we can say that the second page is located at the distance of a single click from the first page, which means that the user is connected to the first page, you may access the second page (i.e. to monitor some or all of the information contained on the second page, in the table viewer by single clicking (excluding clicks performed by the user on the scroll zone). First page

can contain any number of bindings, each of which is associated with the corresponding part of the first page and each of which leads through a suitable hyperspace corresponding to the second page.

Of course, the second page may also have bindings, each of which leads to the third page. Third page, thus, the distance that can be overcome in "two clicks", and it first takes the user from the first to the second page (i.e. changes the display of the viewer, displaying the second page, or is the second page on the second viewer of the display), and the second click takes the user from the second to the third page. Hyperspace, therefore, provide an efficient way to navigate through the myriad of pages represented in the global Internet in search of the special the specific information, by moving between pages logically associated with hypervisor. Since each page can contain multiple bindings can be multiple of the second page associated with each first page, and many third pages associated with each of the second page. In fact, the number of pages on the length n of clicks from the set of the first page of exponential increases in proportion with increasing n.

A further difficulty is the presence of a file type called "recruitment". While the system page of the Internet can be unstructured in the sense that they consist of a list of stored information, "recruitment" has its own structure and can be understood as the file that shares the table viewer into several sections and shows another specified file in each of these sections, for example, so that different types of information on a given topic are classified in different sections. Any number of bindings can be in any of the files listed in these sections. Assume that the user uses the browser to access the first file, which is the "recruitment"that area of the viewer display is divided into several sections corresponding to the number of sections in the "recruitment". When the user clicks on the attachment the full-time position within one of the sections, this (or another) section area of the viewer on the display, or perhaps a area of the viewer display or a whole new area of the viewer of the display) is replaced by the second file (e.g., page)associated with the tie-in position by means of hyperspace. However, the remaining part of the display (i.e. other section "recruitment") remains visible to the user.

The global Internet is one example of a network of computer files based on hypertext. Other examples of systems based on the hypertext are other systems of the Internet, for any reason, is not classified as part of the global Internet system (for example, due to the fact that they belong to a large company or government departments and not available to the public), the so-called system of "intranet", or any other system that uses hypertext language (such as HTML or Dynamic HTML) to identify and resolve to move between files. These systems, in turn, are examples of so-called "hyperspace", i.e. a set of data files, each with his name or address, and these sets of files that have logical relationships with other members of this set.

For example, the typical structure of a directory is an example of hyperspace. The directory structure consists of data files of two types: a) is ili data referred to in this text "otvetami nodes"containing (usually only contain logical connection, other data files, and b) the data files referred to in this text "boundary nodes"containing information, but not containing bundles with other data files in the hyperspace. An empty directory is an example of a "regional hub", as well as a text file, file, image, video, or audio file, and not an empty directory is an example of "vetalog site.

Such a logically related set of data files can be a pure hierarchy (tree structure). This means that one directory ("root directory") is intended for the top of the hierarchy. The maximum number of logical hyperswitch for each directory one (although the directory can have any number of logical links with other data files, each data file (including directories) can be achieved through the root directory on the same path, through a series of the above-described logical relationships. Data files, which can be accessed through one logical link from this directory, are considered to be "in" directory. In this text we will refer to the data file, which can be accessed through the upper directory by following the i logical connectives as being the (i+1) level (root directory per the initial level).

In fact, the directory structure can have a pure tree structure due to the presence of "shorthand ways", for example, or due to the fact that some HTML files and hyperspace included in the definition of this hyperspace. Thus, the directory structure may be an example of the logical relationship between the files that make up the structure of the tree (which is close to the tree structure), in which, for example, over 90% of the logical relationships fit the structure of the tree.

By the usual method of navigation of a hierarchy of data files (for example, the Microsoft Windows or Microsoft Explorer) separate data file (for example, edge node) can be accessed through the path logical relationships from the root directory, for example through one or more intermediate directories, for example, using the following procedure. Starting with the root directory (or any other initial position), for each data file is portrayed character in the root directory. These characters are portrayed selected column. The user clicks on the symbol representing the staging directory, which is on the path to the data file he wants to open. Then the process is repeated, only now the staging directory replaces higher. To access the file on the (i+1)-th level, i need clicks. The last of them - on the symbol representing the data file that the user wants to achieve.

During this process the user sees only a symbol that represents a specific file, if this file is located in one of the intermediate directories in the path. Thus, the user does not actually able to get an idea about the General form of a directory structure, for example, about whether distributed leaves (end nodes) uniformly in the directory. In other words, this navigation tool is not suitable for visualization of directory structure.

To solve the visualization of the hierarchical structure of the directory Brian Johnson and Ben shneyderman (Maps Trees" Space-Filling Approach to the Visualization of Hierarchical Information Structures", proceedings of the Annual Conference on Visualization, San Diego, str-291, IEEE, 1991) proposed to create two-dimensional chart depicting the data files within the directory. Each of the data files on the diagram as a rectangle; the rectangle representing the data files in a particular directory, drawn inside the rectangle that represents the directory (i.e. the socket corresponds to the hierarchy)in the same row or column, and in the case of leaf nodes, all the rectangles depict the same shape and area.

In the structure d is rectorie normal size by value say, 3,000 files (maybe 20 levels), the areas of the leaves (end nodes)become very small. Therefore, since this document focuses only on the visualization of the distribution of foliage nodes, Johnson, and he recommended that the rectangles symbolizing the data files in any directory was such a size to completely cover the rectangle symbolizing the directory. Thus, the proposed chart contains only the areas of listlive files. Thus, in the case of a typical directory structure (in which most of the leaves is at a distance of several ligaments from the top directory) the result is a chart consisting of myriads of tiny rectangles (shown on Fig of this document, in the case of a directory with 1000 files). Despite the complexity of this picture, it is possible to quickly display statistical information about the distribution of leaves in the structure information.

Since this method for the allocation of statistical information about the full directory structure, it does not offer any way of focusing on one part of the hierarchy.

Even if the method of Johnson and Shneiderman there were variations (material no offers), such as the inclusion of the possibility of changing only one of the branches of the it hierarchy (i.e. data files, which can be accessed through logical connectives directory, which is not the top directory), it would result in the second chart, in which all the files in one branch of the hierarchy have a form that is different from their form in the first diagram. Thus, a detailed correspondence between the first and second charts will be difficult to understand, but at the statistical level.

John Lamping and Ramana RAO ("Hyperbolic Viewer: Focus and Contextual Way of Visualizing Large Hierarchies", Journal of Visual Languages and computing, 1996, 7, 33-35) offer a fundamentally different way of visualizing hierarchical structure, in which the data files directory is represented by small areas that do not intersect, and logical connections between them using lines. Small regions laid out on hyperbolic space, moved to the area of the display, to cause broken image called "fish eye". The user can choose the linkages between hyperbolic display area of the display, in order to make possible the visualization of the branches of the hierarchy, but again in this case there is no exact match between the first and second charts. The angles between the branches change as the user focuses on different is Yonah card.

Neither the document does not describe the use of charts, for the purpose of in addition to visualization. None of the documents does not offer a scheme that can be applied to distribute to hyperspace, which are not hierarchical. Thus, neither the document does not offer a method that is well adapted to establish links between the pages of an Internet system, which is rather an information network than a hierarchy.

Further, in both cases, the proposed chart of necessity very complex and because of this requires that the display device has a high resolution screen, high enough to reflect the details. "Map-tree requires that the regions were represented on a scale depending on the number of levels in the directory, and type the directory to which the proposed tree-map, it may mean that even the largest region is much less than one twentieth of the area of the image, while the smallest area may be significantly less than one thousandth of the area of the image. Similarly, hyperbolic map requires to display chords used thin line.

Summary of invention

This invention seeks to provide a new way of representing the relationships between the various data files in the Yes.

It is preferably seeks to provide a method of establishing a logical relationship between data files, which can be used in the device with the image of the limited resolution (e.g., a low number of pixels in each direction with respect to the number of files, between which it is necessary to establish links).

It then tries preferable to provide devices that allow you to capture and/or to navigate relationships between data files.

It further tries, it is preferable to provide a mechanism of tolerance to different levels of limited information about the files (e.g., headings), which allows the user to get an idea of the importance of this file before opening it.

In a broader sense, this invention provides, for the first of this file (for example, the file viewer), representing (for example, on the screen) image that includes characters representing the second set of files with only one click, and in or near the symbol for each of the second file, the following symbol depicting a third file (two clicks from the first file). This display can be generalized to move beyond the third file (two clicks from the first) and include files that are located at a distance any number of clicks (for example, the specified number is TBA clicks) from the first file. At any level files that are logically associated with the file may be presented further characters (for example, smaller size) in or around the symbol of this file. The display can be used to navigate between data files, allowing the user to open one of the data files (i.e., to obtain information from a data file).

Accordingly, the first aspect of the present invention is a method of establishing a logical relationship between a plurality of data files, consisting of:

step, for the first file, in the area of the display showing the first region and one or more second regions, and these second regions respectively represent one or more second files logically related to the first file and spatially associated with the first region, and the size data of the second regions correspond to the first distance scale, and for a given value of n (n-1) further steps, i=2, ..., n, from, to/or each i-th file representing one or more (i+n)-x regions, and these (i+1)-e regions are, respectively, one or more (i+1)-th files which are logically related to the i-th file, and being spatially related to the first region representing that i-th file, the size of the specified (i+1)-th regions are, in accordance with the i-th distance scale size is anise, than (i-1)-I distance scale. Hiperspace this is preferable hypertext links.

The value of n may be the smallest and equal to 2, but it is desirable that it was more (e.g., at least 3, at least 4, or at least 10), and can be infinitely great. n may depend on one or more factors: 1) the resolution of the user's screen, 2) computer resources available to create the display, 3) number of files on the distance of a certain number of clicks from the first file, or (4) selection by the user.

The preferred case is when the map has a certain value of n specified by the user and then the user has the possibility to increase n by 1, so the map is modified in accordance with the first aspect of the invention, with this new value of n, thus including files located at a distance of one logical connectives from the first file.

Since the value of n can be chosen small (regardless of the number of data files), the map can be displayed even on the screen, with a very low capacity. Below is the preferred display features that further improve the potential of this method of engagement, particularly in specific technical case display limited technical capacity (either absolutely is, or on a relative scale).

The "size" of the region may be, for example, the length of the region in a given direction. The length of one or more (or all) of the regions may be almost equal in the two orthogonal directions, and in this case "size" may be stretching in either direction. It may also be the area of the region.

Data files can be a part of the hyperspace data files. For example, the data files and the logical relationships between them can be hierarchical or derevoobrobnij) directory structure; in this case, the logical relationships between data files can be bundles directory structure. For example, they can be part of a directory structure consisting of at least 4, at least 6, at least 10, at least 20 or at least 30 levels. In this case, the number of data files in the directory is well defined (difficult to count) and can be at least 30, at least 100, at least 500, at least 1000, or at least 2000.

In another case, the data files may be system files on the Internet. In this case, the total number of data files, if the value of n is very large, almost impossible to count.

Alternatively, the data file can be part of any other hyperspace, which is not the only (or not necessarily) hierarchy, for example, the internal network of a large company or government Department. For example, the data files can be data files, related hyperspace (preferably hypertext links), which is a logical relationship.

The plurality of files is preferably provided at a plurality of sites of the network (i.e. on the plurality of regions of the Internet). The files may, for example, include files world of the Internet, provided on different sites spatially segregated servers.

Logical relationships may be any logical relationships (e.g., defining a tree structure or an approximate tree structure). They can also be logical relationship (pre)specified by the user or automatically, for example based on the value of the file.

The logical relationships are preferred, any type or types that are suitable for the determination of hyperspace. Thus, the logical relationships between files can be (or at least include) hyperspace (preferably hypertext links) and, in addition, can be the ligaments between the frames and the file(s)that they represent. More preferably, the logical relationships are such that each i-th file is one or more (I+1)-th files are each (i+1)-th file can be available to the i-th file with one click. That is, they are associated with the i-th file one hyperspace.

Thus, if n is infinitely large, the entire global system of Internet (all the files that you can open any number of clicks) can, in principle, be represented in the image reproduced by this method. In practice, only the pages of, say, at a distance of, say, n=10 can be demonstrated (or those that produce regions having a radius of, say, more than 5 pixels), but it can mean a very large number of pages.

Note that the i-I distance scale may be different for different i, for example, depending on the number (i+1)-x files. For example, in the case where there are a large number (i+1)-th files logically related to the i-th file, the i-I distance scale can be small, such that there is space for the presentation of all (i+1)-th files.

Now we Dene some important terms: for a given data file, its "parent" files are all the files (for example, in a particular map), from which it can be achieved one logical connection (e.g., a single click), while files "ancestors" are all the files (for example, in a particular map), from which it can be accessed through any number of logical what their steps. Files "brothers" are files that he has at least one common "parent". His "children" files are files that he is the parent. His "heirs" files are files for which it is an ancestor.

For any map created in accordance with the opening (in any of its aspects), the "source" of the map data is a file, from which is measured the distance in clicks (for example, "root" directory of the directory structure, or, in some forms, the location of the viewer). "Base" is defined in relation to a particular map and equivalent to first open the file. "Focus" is the location of the user at the moment within the map. "Lit" is the area, stamp, or other identifying means for, though at the moment, or to achieve an immediate choice by the user.

Also, since the method does not attract regions located at a distance greater than n from the first file, the method does not necessarily attract the regions for all files within a distance of n clicks from the first file. For example, if there are a large number (i+1)-x files logically related to the i-th file, and each of the (i+1)-regions is small (e.g. less than a specified value), (i+2)-e files that are logically associated with these (i+1)-mi files may not have highlighted Itsa on the screen.

Thus, it is possible criterion for some files were not represented. Another possible criterion is that if the same file will be presented more than once (since it can be reach from the first file in more than one way), then all references, except one, can be released. Otherwise, the regions representing the "children"can be omitted from all but one of the views (i.e. criterion of the dropped file is that: 1) the file will be shown in another place, and that 2) "parent" will be presented more than once).

Note that logical relations are preferable such that originate from the same directory. That is, even if the first file is linked logically to the second file, it does not mean that the second file is logically related to the first. An example of such relationship is hyperspace.

The concept of establishing relationships between the data files associated with hyperspace (and thus could not be part of the hierarchical directory structure), is independent of the second aspect of the invention.

According to this second aspect of the invention the invention provides a method of establishing relations hyperspace between the plurality of data files, consisting of:

step, for the first file, in the area of the image, oobrajaya the first region and one or more second regions, moreover, the mentioned second regions respectively represent one or more second files that are available from the i-th file through hyperspace, and spatially connected to the first region; and the dimensions mentioned second region correspond to the first spatial scale; and

(n-1) further steps, i=2, ...n, from, for the or each i-th file, expressing one or more (i+1)-th regions data (i+1)-e regions respectively represent one or more (i+1)-x files, accessible through the i-th file using hyperspace with the i-th file, and being spatially related to the i-th file, and the dimensions of the mentioned regions correspond to the distance scale smaller than the (i-1)-I remote scale. Hyperspace are preferably hypertext links.

The term "file"as used in this text includes the "recruitment". If this file is a set of frames, the region that represents a file, preferably indicates this. For example, if the 1st file is a set of frames that are divided into sections j (numbered here as K=1, ...j), then the i-th region representing the i-th file, preferably presents divided into j partitions, denoted here as K=1, ...j, (i+1) regions are then portrayed, respectively, so that (i+1) regions representing these files associated with i-th file using bindings inside k is the partition of the i-th file, inside the k-th section of the i-th region.

A further alternative is that logical relations can be predefined (for example, hyperspace), and depends on the value of files (e.g., dictionary), and there are even selected by the user. For example, if the information is stored in files, applies to companies or their employees, then the user could define a rule so that:

"Secondary data file is logically associated with the first data file, if and only if the first file is an employee, and the second company, where he last worked, or is the first company and the second employee working in it now."

The concept of defining (or redefining) the logical relationship is the third independent aspect of the invention, which is a method of establishing a logical relationship between a plurality of data files, consisting of:

the step of determining the rule that determines whether there is a logical relationship between one of these data files with any more of these data files;

step, for the first file, in the area of the display, which shows a first region representing that i-th file, and one or more secondary regions, called second regions respectively represent one or more second the files and spatially associated with the first region; and

(n-1) further steps, i=2, ..., n, from, for the or each i-th file representing one or more (i+1)-x regions, and data (i+1) regions respectively represent one or more (i+1)-th files logically related to the i-th file, and spatially related to the i-th region. Preferably, in this third aspect of the invention, the second regions was in accordance with the first distance scale (e.g., dimensions, spatial relationships correspond to the first distance scale), and all mentioned (i+1)-e regions of the i-th region is depicted in accordance with the i-th distance scale smaller than the (i-1)-I distance scale (i.e. the size or spatial relationships correspond to the i-th distance scale).

The user may, in addition to choose the logical relationships among the given alternatives.

In any of the aspects of the invention defined above, the first file may be a file that is currently displayed to the user (for example, the data file that corresponds to this location in real time viewer (system or network)). Or it may be the one that is selected by the user as described above. In any case, the above-described methods of the invention create a map based on the first file and indicating the presence and distance (for example, expressed the built in mouse clicks) other files associated with the first file.

Now we will move on to discuss some of the geometric characteristics of the cards that have important technical investigation and are the preferred characteristics of the map, reproduced in accordance with all aspects of the invention.

The number of i-x files increases approximately exponentially with n, so for large n, in order to avoid that the image is increased to a value greater than the user's screen, the distance scale should be reduced accordingly. For example, the distance scale can be reduced so that the entire area of the card is restricted, by which we mean that, no matter how great the value of n, the total area of the display never exceeds a given value. It is a preferred feature maps produced by the method of the invention.

As an example, limited map distance scale can be chosen so that the total area of one or more (i+1)-th regions for each i-th file is less (e.g., half) of the square of the i-th region representing the i-th file.

In this case, (i+1) regions for each i-th file may not overlap and fit fully in the i-th region representing the i-th file. However, this is not the only possibility: for example, (i+1) regions for each of the th i-th file can be organized they are concentrated around the i-th region representing the i-th file, or each of the (i+1)-th regions may partially overlap with the i-th region.

The display produced by this method can, thus, be kind, resembling a fractal form, which means that it has more detailed (scale) structure (room i-x regions, increasing with i) the increasingly decreasing distance scale (value, for example, in the middle of the i-th region). For high enough values of n each file, available by clicking through the Internet, will be represented by one or more regions on the fractal display.

For example, as described above, if (i+1)-th regions for each i-th file is always located inside the i-th region representing that i-th file, the map will be created entirely within the first region, and the total area covered by the regions (for example, the sum of all points lying within at least one of the regions), is equal to the area of the first region. This statement is true regardless of the size of n and the number of regions for each value of i.

This feature, that the total area occupied by the regions of the map, does not depend on the value of n is referred to herein as "intensity". Any map where the total area occupied by the regions of the map (i.e. the total area, n is confined within at least one region), does not depend on n (at least for n greater than a certain value, in this case, n=1), referred to herein as "intense".

For each i-th file (i+1)-e regions preferably do not overlap with each other and their area preferably equal to each other, but (i+1)-e regions for the first i-th file can be a value that is different from the (i+1)-th region of the second file. More generally, the i-e scale distance can be different for different i-x regions. For example, if there are 20 files at one click away from a first of the i-th file, the size of 20 (i+1)-th regions of the first i-th file may be smaller than, for example, half of the square 10 (i+1) regions of the second i-th file. More generally, the area of each of the (i+1)-th regions for the i-th file is preferably chosen to be smaller than the area of the i-th region, which represents the i-th file, the proportion of which is specified by the number (i+1) regions for that i-th file. For example, if (i+1)-e regions for a given i-th file are inside the corresponding i-th region (i+1) regions can be as high as possible within the constraints of a given magnitude and rules of the organization.

Further, it is possible that (i+1)-th regions associated with the i-th region can be identical or different from each other in size (for example, for indicating the number of the and their visits), but determined in accordance with the same distance scale. For example, the relevant dimensions (e.g. diameter) of the regions (i+1)-th regions of the given i-th file can be defined as the i-th distance scale, multiplied by an amount which is a function of a variable characterizing the corresponding (i+1)-th file (for example, the number of visits to the corresponding (i+1)-th file).

(i+1)-e regions are preferably arranged along the path (for example, inside the corresponding i-th region), which continues (for example, a path independent from the number displayed (i+1) regions) and closed, or discrete path (for example, for each possible number (i+1) regions up to a maximum value exists given the organization of this number (i+1) regions). For example, some values, some or all of the regions may have the shape of a circle, and in this case, (i+1)-th regions may be circular regions, organized around the inner periphery of the circular of the i-th region in contact with the outer side of the i-th region and every (i+1)-th region adjoining or nearby to the two adjacent (i+1)-th regions. This description is an example of a closed continue the path.

Property-related, but logically distinct from the organization of the regions (described above), referred to in this text "angular invariance" and is before occhialini feature of all maps created in accordance with the invention. "Angular invariance" means that for all i (or at least i, certain limits) the organization (i+1)-th regions is a spatial relationship with the corresponding i-th region, independent of size i (if not to take into account the scale of distance). This feature means that if the map linkages painted over using a data file that is different from the first file of the first file, then the result will be the second card, which is (significantly) increase the first part of the map corresponding to the first file.

For example, suppose the first card includes a second region (representing a file "A") and that there are a number of files, logically associated with the file "A" and thus is depicted as the third regions on the first map. If the card drawn again, taking "file And" for the first file data, the spatial relationship of the new second regions (i.e. regions that represent files) is equivalent to the spatial correlation of regions representing the files In the first map. Similarly, the fourth regions on the first map representing the files that are logically related files are transformed into third regions of the second card, while maintaining their relative PR the spatial organization and/or appearance. And so on. To sum up, the first part of the map, which is the second region representing a file, and all (or most) of the files that are spatially related to expanding, but without changing the relative organization. Thus, although the size of regions, respectively, representing the files, changes the distance between these regions is changed accordingly, the angular correlation between the two (and preferably also between them and the region representing the file is not changed.

Angular invariance may include invariance (invariance direction") with respect to a given direction on the map (for example, the horizontal axis on the screen), so that the relative angle of the location (i+1)-x regions of the second map relative to a given direction the same as the angular location on the first map with respect to a given direction (for example, if we imagine a polygon, the vertices of which are the centers of the (i+1)-x regions, this polygon is enlarged or moved on the second map, but in General is not deformed and in General, not retiremen with respect to a given direction).

The method of angular invariance (especially in the case of invariance direction) has the technical advantage that when prerisovanje card, starting from a certain heir, he p raisoviet this region and his heirs in the same way (i.e. significantly, they would have been if part of the original map covering the region and its derivatives would be simply enlarged (scale). This prevents confusion of the card user transformation occurred.

This concept is independent of the fourth aspect of the present invention, freely compatible with any of the above features, which is a method of establishing maps the logical relationships between the plurality of data files, consisting of:

step for the first file, in a display area displaying a first region and one or more second regions, these second regions respectively represent one or more second files logically related to the first file being spatially organized in a two-dimensional formation with respect to the first region and spatially organized in relation to each other at an angle defined by the rule, and (i-1) further steps, i=2, ..., n, from, for the or each i-th file, pointing to one or more (i+1)-x regions, and mentioned (i+1)-e regions are, respectively, one or more (i+1)-x files logically related to the i-th file, and spatially organized in a two dimensional format, with respect to the i-th region, and being spatially placed in relation to each other at an angle calculated by providing utomo rule.

Preferably, the rule was set in relation to a given direction on the map, and relative angular location (i+1)-x regions in relation to specific areas on the map, in General, independent of i (whereas invariant map for directions).

Alternatively, the expression based on the invariance of the directions, this aspect can be defined as a method of establishing a map of the logical relationships between the plurality of data files, consisting of:

step, for the first file, in a display area displaying a first region and one or more second regions mentioned second regions are thus respectively represent one or more second files logically interconnected with the first file, spatially organized in relation to the first region, the second regions are drawn in accordance with the first remote scale, but their relative orientation does not depend on the first scale distance; and

(n-1) further steps, i=2, ..., n, from, for the or each i-th file, expressing one or more (i+1)-x regions, and data (i+1)-e regions respectively represent one or more (i+1) files that are logically related to the i-th file, and spatially organized in relation to the i-th region representing that i-th file, mentioned the second regions, for example, in accordance with the i-escalay distances less than (i-1) distance scale distances, but their relative orientation are largely independent of the i-th scale distances.

In any case, the rule may depend on the number of regions in need of organization, but in General does not depend on the length scale (i.e. the value of i). As in other aspects of the invention, the distance scale is preferable to use for determining the size of the regions.

Note that for determining the angular relationship between the two regions clearly and unambiguously helps define the "source" item in each region and that the angular relationship in each of the regions are used to indicate the angular relationship of the respective original points. The "source" item can be explicitly defined any number of ways, for example: (a) the center of gravity of the regions, b) the center of gravity of the convex hull around the regions, (C) if the regions have a predetermined size and orientation specified by the position of the region (e.g., lower left corner). Note that the concept of two-dimensional regions can also be specified as such, when not all the centers of the regions are located on a straight line on the map.

Further preferred features of the card (in any aspect) is that:

1) at least one (preferably most, or even more site is citicoline all region(s) other, than home district, and preferably also their "children", and even more preferably also their descendants) do not change their appearance when the map is redrawn with the region as a starting point ("morphic invariance"). This feature greatly simplifies "deepening" (or departure from) the card without losing orientation. This advantage is particularly advantageous in combination with the invariance of angles and directions.

2) the children (and in addition, in order of preference, "parents", "ancestors", "children" and/or "descendants") region, representing that the file does not change its form in the redrawing of the map, excluding the situation in which is redrawing the map of the region ("stability"). This is useful, for example, if, while the card is in operation, a new data file is added or removed from the directory or network, or if any of the cards described below, for which there is a possibility of redrawing the maps without the representation of a specific file.

3) "children" ((i+1)-e files) at least most or each of the i-x files laid continuing along a closed path (for example, a closed loop around the periphery of the i-th region) or sequentially on the target number of ordered set of positions (for example, positions corresponding to the keys from 1 to 9 on a standard numeric keypad 3× 3). It is highly preferred feature maps, developed in accordance with the invention.

4) the area of the map that represents the specified i-th region (excluding common areas, representing all of his "children" and "the descendants"), at least half more than, preferably at least the same size (for example at least twice), the area representing any of the "children" and "descendants" of this child ("perspective").

This feature facilitates the indication (for example, by clicking on any of the i-x regions at any level, and, in contrast with the card type of wood, on which the region representing the given directory, usually fully filled for its descendants.

These four preferred conditions allow expression of the invention in an alternative way (see below) to describe methods of creating a map, so that the desired behavior above was obtained when the same method is used to create a new map (for example, starting with a different initial position, or with one or more data files that are added or withdrawn from a set designed for mapping).

Thus, an alternative expression of the invention is a method of mapping a logical relationship between a plurality of data files, consisting of:

step, for the first file, in the district from the expression, displaying the first region and one or more second regions, and named the second region, respectively, represents one or more second files logically interconnected with the first file, and being spatially related to the first region, the size data of the second regions correspond to the first distance scale, and the shape of this second region defined by rule; and

for a given value of n, (n-1) further steps, i=2, ..., n for the or each i-th file representing one or more (i+1)-x regions mentioned (i+1) regions respectively represent one or more (i+1)-th files logically related to the i-th file, and spatially related to the i-th region representing that i-th file, the size mentioned (i+1)x regions correspond to the i-th distance scale size less than (i-1)-I distance scale, and shape mentioned (i+1)-th regions, set the said rule, and the above rule does not depend on i and/or the number specified (i+1)-x regions.

The first of opportunities (independence i) corresponds morphic invariance. The second option (the independence number (i+1)x regions) corresponds to "stability". It is preferable to form the (largely) was independent from, and the number (i+1) regions.

Method of creating a map of the logical relationships between the plurality of data files, the status is of ASCII from:

step, for the first file, in the area of display of the first region, and, for M an integer greater than one, and q is an integer from 1, ...M, q second regions mentioned second regions respectively representing one or more second files logically related to the first file, organized in relation to the first region, having a relative angular relationship in accordance with the first q positions given order M given position,

(n-1) further steps, n=2, ..., n from the or each i-th file, for q(i) for an integer in the range 1,...M, representing q(i) (i+1)-x regions, representing, respectively, one or more (i+1)-x files that are logically related to the i-th file, being arranged with respect to the i-th region, and having a relative angular relationship according to the first q(i) positions the aforementioned sequence of preset positions.

This feature reduces the risk of user confusion after Perricone card, or when a file is added or removed from the map. This is particularly true if the positions correspond to the arrangement of keys (or other means of indication)used to specify one of the regions (for example, a portion of the device used to create the image in accordance with this method).

For example, it is convenient in this condition the device (for example, the mobile phone)with a standard 3×3 numeric keyboard, to have M=8 preset positions corresponding to 9 clicks on the numeric keypad (except 5) and the order of the items is a sequence 1, 2, 3, 6, 9, 8, 7, 4 (that is, clockwise along the outer side of the keyboard).

Although, as explained above, in any aspect of the invention it is possible that all (i+1) regions correspond to one (i-1)-th distance scale, even if they are "descendants" of other i-x files (for example, have exactly or approximately the same diameter), it is not a necessary feature of any aspect of the invention. On the contrary, (i+1)-e regions, representing the files that are logically related to the various i-mi files can have different (and even unrelated) dimensions. I.e. i-I distance scale may be different for different respective i-x files. However, in this case, the area of regions preferably has a limited volume, and, more preferably, intense, discussed previously.

The user may have the right to modify the definitions of rules that defines the shape of the region, and/or to distribute them on the display. For example, it may be a choice between circular regions, and any other shapes, such as squares.

It is also possible that the rules of form and/or i-x region is s depend on i, for example, can differ for i=n or depend on any other factor. For example, if the circular regions for all i to n-1, n-th regions can be chosen so that they are complementary sectors corresponding (i-1)-x regions. Next, (i+1)-e for different regions i-x files can be correspondingly different guises.

In addition, methods may not represent the regions for all (i+1)-th files logically related to the i-th file, but can ignore some of these files, for example in accordance with one or more specified or pereizdavaemye criteria.

For example, it is possible that hyperspace leads from the first to the second file and that hyperspace from this second file that leads back to the first file, so in a sense, the first file is also a third file. In that case, the methods may not display the first file as the third region. As a second example, it often happens that in this third file can be accessed through the first file by two clicks through two different second file. Methods can in this case represent only one third region, at or near only one of the two possible second regions. In other words, the method may include the steps of determining whether already displayed on the display regions corresponding to the i-th file (equal or less value (i), and the option is ciruit display accordingly.

A further possibility is the existence of a particular (for example, user-selectable) maximum number (i+1)-x regions are displayed for each of the i-th region. For example, if there are more than a specified number M (i+1)-th data files logically related to the i-th file, the method may display only M (i+1)-e regions, respectively, representing only M of these (i+1)-x files. For example, if the i-th region is a square, then the method can only display 8 square regions (i+1), built around a square path along the inner periphery of the i-th region.

The card may include one or more (or even all) shows the regions that are not only appropriate file in the source data structure, but rather represent a collection (or even collections of collections) (i+1)-x files. For example, if there are 15 (i+1)-x file intended for display on the map in the example above, then 7 (i+1) regions can represent 7 of the (i+1)x files and the eighth region may represent the remaining 8 (i+1)x files and have depicted inside eight regions, respectively, representing the remaining 8 (i+1) files. In the alternative, as a second example, suppose there is, for example, 64 (i+1)x files need to view each of the 8 (i+1) is an alternative present is eight of these (i+1) files (i.e. the first (1+1)th region of the first eight (i+1) file, the second (i+1)th region - second 8 (i+1) files, etc.

The user can use the display generated in accordance with the invention, to create a map of the network, not far from his current position (for example, for navigating the Internet). Suppose, for example, that the user has just changed his position in his program search system (or network) to read this file. He might, there is the possibility, for example, by the work of a particular mouse click to initiate your terminal to operate according to the method described above of the invention, using a file readable by the user as the first file to generate a map file, located at a distance of n clicks. This will immediately inform him of the fact, for example, how many files is at the distance of a given number of clicks from its particular location and will allow him to quickly open any of them in your search (for example, by clicking the mouse in the area of the corresponding region).

Of course, the process according to the first, second, third or fourth aspect of the invention preferably is performed automatically when you change a user's location.

If the user wants to obtain more detailed description, he m is et to be able to select a specific file, for example, by moving your mouse over the region of the display that represents that file, which then stimulates the terminal to the product of the above process of the invention, thereby creating the image using the selected file as the first. The user terminal may be arranged to image the trail (or trails) (and/or the distance between the user location and selected the first file. For example, it can display the path (and/or distance) maximum short value.

The user can mark this file, for example, in order to be able to quickly return to it later. This operation is similar to the introduction of a bookmark in a book. In this case, the user may mark their location in the network at the moment, the file, which is the first in real time (i.e. the first file, which is based on the network map, depicted at the moment), or the file selected from the image by selecting the appropriate region. Then, as depicted by region, may indicate whether the file it is marked this way, for example, the marked region can be displayed.

The methods described above are expressions of the invention may further include image characteristics of the files represented by some or all regions in order to facilitate the aviatio the Internet or other file structure.

For example, regions can be depicted in a color that indicates a characteristic of the corresponding file, for example, the location of this file, or server, which it provides.

Further, the user can call or receive automatic image for more information about the file, using the appropriate region, for example, by moving the mouse over this region, and possibly, in addition producing an operation of clicking the mouse. These actions can lead to display information such as the file name. The user can also call up additional information, for example, by another or complex operations with the mouse. This more detailed information can be displayed in part of the display outside the first region, for example, as a separate space in the box presented to the user in another part of the screen. More detailed information may, for example, include any combination of file names, address, summary, parts of the file specification (for example, technical information, including data format, for example, images referenced in the file).

The information displayed by using the method of the invention, such as the presence of files that can be accessed by any number of clicks, along with any characteristics of these files can be obtained at the time when the ID is t the implementation of actions in accordance with the invention (i.e. as an additional step of the method). Alternatively, they can be made in advance, for example, during idle time of the apparatus, so as to be available immediately upon completion of the implementation of the map.

The method may include the step of storing information so that it could be invoked again if the user will return to this section of the network. Storage may, for example, be in a location that is accessible to only one user (for example, on the user's device), or in a location that is accessible to multiple users. Stored information may be collected and maintained on the basis of the movements of the one or more users, or on any other basis, such as maintaining a modern map of pages on a particular site or those stored on one or more servers. The collection can be accessed on demand or automatically by one or more (spatial remote) device. For example, each modular unit can be placed on the server whose information it collects. In this and similar cases, there is normally a step of collecting together all the information collected by different devices.

Such stored information can be automatically removed, for example, after a certain period, if the user is not returned (or if no users are vernors is in the area of hyperspace. Alternatively, if the user frequently visits a particular area network, the information on this site, may be stored so as to prevent its destruction. If the network after the time changes in this area, for example, by adding a new file or bindings stored information can be updated or regenerated.

Although, as explained above, the feature of gradually decreasing scale distances with increasing i and feature limited cards (and, as an additional feature, the intensity of the card) is particularly suitable for image hyperspace, they are not necessary features of the invention. The invention can be an alternative expressed as the creation of the map of the set of data files specified by the given user's location, and facilitate movement between files.

Accordingly, a fifth aspect of the invention is a method of movement between data files, consisting of the following steps:

creating display relationships between data files by:

step, for the first file, in the area of the display, depicting the first region and one or more second regions, which respectively represent one or more second files logically related to the first file, and which are spatially connected to the first region, p is item dimensions mentioned second regions correspond to the first distance scale; and

(n-1) further steps, n=2, ..., n, from, or for each file representing one or more (i+1)-x regions, which respectively represent one or more (i+1) files that are logically related to the i-th file, and which are spatially connected to the i-th region representing that i-th file, the size mentioned (i+1) regions at the same time meet the i-th distance scale smaller than the (i-1) distance scale;

the file selection on the basis of the display; and moving the selected file. The movement to this file can be accessed by issuing instructions, for example, by clicking on the region of the display associated with the selected file.

The term "moving file data" is used herein to indicate that the user can get at least some information about the file. For example, it includes a registered user of special interest to a particular file, in response to which the method generates at least some amount of information about the file, such as a title or summary file. The term "transfer" also includes "open" file, i.e. the receipt of complete information from a file (for example, in conjunction with another program). Preferably, in all aspects of this invention, when the user has the possibility to obtain information about the file, and he and she are also able to open it.

If the file that stores information for interaction with the application (for example, a graphics file may contain information in a format that the graphics file can be opened by the graphical program; ward file can be opened ward etc.); "opening" includes the transfer data of the data file in the combined program, so the user (or another user) can receive data in the data file through this program use.

Thus, the user can navigate to any file data. For example, if the data files have the directory structure, the user can navigate to any directory directory structure and to any littlemama site. Preferably, the user had the opportunity to open this file.

In addition to the map prepared by any of the aspects of the invention, the display area may include a further portion having a plurality of areas, each of which is correlated with the corresponding region of the map (for example, the area for each of the (i+1) regions that are logically related to the i-th area). Preferably, these areas had relatively geometric relationships that corresponded to the relative geometric relationship of the areas they represent, but they can later transfer them to have (for example, these areas can be arranged in a column). Areas can be marked in such a way as to indicate the importance of the corresponding region (for example, the appropriate designations). In the case of the fifth aspect of the invention, the selection of a particular data file can be by means of actions in relation to the relevant area (for example, clicking on the area may open the data file represented by the region corresponding to the area).

The sixth aspect of the invention is a method of representing relationships between a plurality of data files, comprising, changing a user's location to match with the first file:

step, for the first file, in the district display that displays the first region and one or more second regions, which respectively represent one or more second files logically related to the first file, and which are spatially connected to the first region; and

(n-1) further steps, i=2, ..., n, from, or for each file, showing one or more (i+1) region, respectively representing one or more (i+1) files that are logically related to the i-th file, and which are spatially connected to the i-th region representing these i-e files.

Thus, the display can be automatically updated as progress user hyperspace.

Preferably,in the methods used according to the 6th aspect of the invention, the regions were created in accordance with the distance scale, which decreases with increasing 1i, as described above in relation to the first and second aspects of the invention (for example, by reducing the size of the regions and/or map, drawn in accordance with a given value of n). Preferably, also, in the methods in accordance with the fifth and sixth aspects of the invention that regions are restricted (and in addition the quality of intensity), described above.

All the methods described above, may include the further step of creating a second card for display simultaneously with the above cards. For example, if the user receives a display map that you created in the above manner, using a specific file as the first, the method may include creating a second map that point to other files associated with that particular file. In some cases, for example, if the first file has been reached by selecting file from the map created by the above method, the second map may represent, for example, as respective regions) files of the card that the user has not selected.

The second card increases the dimensionality of the entire image. For example, the user can see along the lines of hyperspace, which is n't chose, and/or "back" to the files to which the first file is logically associated.

Although these aspects of the invention relate to a "plurality" of files, methods in accordance with any of the above aspects of the invention may alternatively, or additionally, to plot on the map the relationship between the plurality of parts of one or more (e.g., large) files. In this case, the logical connection is a link between the parts of the file. For example, if a single large file contains the diary, representing a plurality of days, the method can be used to create maps logical relationships (cross-references) between days. In other words, although in some forms of the invention the separate data files (for example, electronic files provided by different respective servers and/or files associated only logical relationship), one or more of the plurality of files, referenced in the above aspects of the invention can alternatively be relevant component parts of a larger volume of data file (or files). For example, it should be understood that in the sixth aspect of the invention, the term "moving between data files" should be understood as including not only move between the individual data files (e.g., provided by the hypoxia servers), but also data files, which themselves are parts of a single larger volume of data file.

Accordingly, in the seventh aspect of the invention is the method of creating a map of relationships between the plurality of segments of one or more data file, consisting of:

step, for the first segment in the display area, reflecting the first region and one or more second regions, which respectively represent one or more second segments that are logically associated with the first segment, and which are spatially connected to the first region, and

(n-1) further steps, n=2, ..., n from, for the or each i-th part of the file showing one or more (i+1)-x regions, which respectively represent one or more (i+1) segments that are logically related to the i-th segment, and which are spatially connected to the i-th region representing that i-th segment.

The invention in this aspect is compatible with any of the other above-described aspects, so that, for example, one or more of the following factors may be used:

1) i-e regions are formed on the i-th distance scale, which is greater than the (i+1)-I distance scale, which are formed in regions (i+1). This distance scale can be characterized by the size of the regions.

2) the Map is such that the total area of the regions (sum of all points contained in KRA is least in one region) is limited (i.e. less than specified value) independent of n (and in addition there can be an intense, i.e. does not depend on n).

3) the Method used to move to the part of the file for which the user specifies (for example, when using a mouse) on the relevant area of the map.

The segments can, for example, to represent part of the structural element of a computer language (e.g., software) in any programming language (or presentation of the contents)stored in one or more data files, and the logical relationships can be conceptual structure element (e.g., what percentage of the program "calls" kind).

Although it is preferable in the context of this invention, to the regions depicted on the user's screen, an alternative method is the presence of "sensitive" areas on the screen that are not necessarily shown. The user can then initiate the effect by specifying a point on the screen.

Thus, the eighth aspect of the invention is a method of moving the data file, the data file is one of the plurality of data files associated logical relationship, and the method consists of:

step, for the first file, in the district display that defines the first region and one or more second regions, these latter regions are logically associated with the first region, and the size of these second regions of n which are in accordance with the first remote scale;

for a given value of n (n-1) further steps, i=2, ..., n from, for the or each i-th file that defines one or more (i+1) regions indicated (i+1) regions respectively representing one or more (i+1) files that are logically related to the i-th file, and spatially related to the i-th region representing that i-th file, the size mentioned (i+1) regions are located in accordance with the i-th remote scale, which is less than (i-1)-I distance scale;

indication (for example, when using a mouse) to a position on said display region within one of the specified regions; and moving the file represented by the region; containing the mentioned position.

All the features of the geometric characteristics of the regions described above in relation to other aspects of the invention are also applicable to these aspects. Preferably, the user is provided the information notifying them about which of the regions points his mouse at any given moment (and more preferably, that he was informed about the "parent" of this region and/or brothers/sisters and/or children, for example, as described below), so that he could quickly and easily indicate which file he/she is interested in the time spent in the region corresponding to this file.

The following three aspects of the invention share a common principle works [daln] is ISA information and/or regions, associated with the selected subset of files, such as children of a particular data file.

The ninth aspect of the invention features, in General, to representation ("control keyboard") was generated by the user to indicate the presence of a set of siblings, and the user uses this representation to move to another file. As a possible add-ons, the representation may include information about brothers-files.

Specifically, the ninth aspect of the invention is a method of moving a data file consisting of the following steps:

generating a display of relationships between a plurality of data files by:

using step, in which for the first file, in the area of the display indicating the first region and one or more second regions, which respectively represent one or more second files logically related to the first file, and which are spatially connected to the first region; and

(n-1) further steps, i=2, ...n from, for the or each i-th file, expressing one or more (i+1) regions, which respectively represent one or more (i+1) files that are logically related to the i-th file, and spatially connected with the i-th region representing that region.

Favorite j-th data file (1<j≤n), presents one of the mentioned re the ions, generating for each of the above-mentioned one or more (j+1)-x files, which are logically associated with the j-th file, the respective additional region; and

as instructed by the user that the respective additional region, moving to the appropriate data file.

It is preferable that each region was represented by information indicating the importance of the (j+1)-th file.

In the tenth aspect of the invention provides, in General, to use the indicator device to move the map on the principle described above, in order to cause the image information on the selected subset of files (i.e. without having to create a new map). This concept allows for a new way to use the indicator device to move to the file based on the map in accordance with the invention.

Specifically, the tenth aspect of the invention provides a method of moving the data file by carrying out the following steps:

generating a display of relationships between a plurality of data files by:

step, for the first file, in a display area displaying a first region and one or more second regions, which respectively represent one or more second files logically related to the first file, and which are spatially connected with the PE the new region, and

(n-1) further steps, i=2, ..., n from, for the or each i-th file, pointing to one or more (i+1) regions, which respectively represent one or more (i+1)-x files logically related to the i-th file, and spatially related to the i-th region representing that file; and

in the above, when the user control the display unit so that the position inside the map is determined by the physical organization of the above-mentioned display unit is within the above region, representing the j-th data file generated for one or more data file having a predetermined logical relationship with the (j)th file of the respective additional region, including information indicating the value of the mentioned linked file.

Preferably, the specified logical relationship was such that the associated data file were children (i.e. (j+1)-mi files of the j-th file). Alternatively, it can be all of the files with which the j-th file are logically connected (for example, all of the files from which the j-th file can be achieved with a single click).

Thus, the user can specify a subset of files (for example, movement of the mouse pointer) and to cause display of information about these files without creating a card from scratch. Additional regions can be derived only for a limited period of time (e.g. the measures until the user presses a certain key).

The tenth aspect of the invention further allows a method of opening files, which is the method according to the 9th aspect of the invention, further comprising an additional step, namely, that by submitting user control signal, when the position specified by the physical position of the mentioned indicators, the position corresponding to one of the above (j+1)-x files, moving the said (j+1)-th file.

This can be indicated by the term "sliding click. The user first specifies a position which causes the call sequence information for the image as a subset of files (without redrawing the map) and then, based on this information, the choice (and instructions via Poynter) of this sub-group files.

In the eleventh aspect of the invention proposes the creation of a card according to the invention, the user can select one of the files (for example, (n+1)-th file) and generate a map of his descendants, including those that have not been previously presented (i.e. to identify the "hidden level" descendants).

Specifically, in the eleventh aspect, a method of displaying a relationship between the plurality of data files, comprising the following steps:

generating a display of relationships IU the remote files by:

step, for the first file, in a display area displaying a first region and one or more second regions, which respectively represent one or more second files logically related to the first file, and spatially associated with the first region; and

(n-1) further steps, i=2, ..., n, from the or each i-th file, displaying one or more (i+1) regions respectively representing one or more (i+1)-th files which are logically related to the i-th file, and spatially connected with the i-th region representing that i-th file; and

as instructed by the user on the mentioned file j generates for each of one or more (j+1)-th data file that is logically associated with the aforementioned j-th file, and which before were not provided, the respective additional region representing a region (j+1).

The value of j can be, for example, equal to (n+1), so that shows a new hidden layer is one layer deeper than the deepest of the previously presented on the map layers. In the alternative, (j+1)-th files can be made before are not presented in accordance with any of visualsourcesafe criteria (for example, as the number of (j+1)-x files was above a specified value). An additional region(s) can be depicted as a continuation of the map (for example, with decreasing distance scale, continued on additional ur the level) (this feature is especially convenient if (j=n+1), or in the alternative to painted differently, for example as mark described above and below, carrying information about the value (j+1)-x files).

The twelfth aspect of the invention is a device comprising a means of images, such as screen, and organized for the implementation of the method in accordance with any of the first, second, third, fourth, fifth, sixth or seventh, eighth, ninth, tenth or eleventh aspects of the invention.

The device can be from the category of consumer electronics, such as portable device of any size ("micro" size, such as a mobile phone, a "mini" size, such as a personal digital assistant ("OCA"), or "macro" amount, such as a portable computer, a fixed installation, such as a personal computer, a digital TV, kiosk, public means of treatment or home network. In the alternative it can be embedded as a component of the consumer information network, such as an entertainment system on the plane, train, car, etc. or in relation to the world system of the Internet as a side server software, client software or the development of operating a specialized website. Further, the device may be part of, to provide access to or to contribute to the UE is to t any other data collection or network which may, for example, be based on the functioning of the physical network equipment (satellite, Telecom, cable or broadcast networks, systems, traffic control or information, intranets, or other private or public network such as the Reuter and data libraries such as Corbis) or can be a way to access content (for example, Internet sites, CD-ROMs, reference tools), or as a component of special software (for example, network software, e-Commerce, menu or menu symbols of operations, analysis tools information) or equipment (for example, for integrated circuits or create a circuit Board).

In one embodiment, this device is a mobile phone. The latest generation of mobile phones has memory (organized in a directory)and the (radio) access to a remote station, where additional information and devices to access e-mail and other systems on the Internet. However, the benefits of these services is significantly limited by the size of the display of the mobile phone, which is itself limited by engineering constraints and modern technology.

By providing mobile phone display generated in accordance with any of the methods of the invention described above, - the benefits of the mobile phone apparatus of a data transfer can be significantly improved.

Typically, such a device includes a mechanism for entering data (instructions), such as a screen that responds to touch. Alternatively or in addition, it may include a device for mechanical input, such as a joystick or a set of keys. In this case, the organization of some or all of the regions, such as additional regions on the control keyboard, preferably corresponds to the organization of the device by a mechanical input.

For example, a mobile phone can have buttons, organized as a keyboard, and in this case, the organization of the regions may correspond to the arrangement of keys.

For example, if there are 9 buttons on the keyboard, organized in the order of 3×3 (in addition to any other buttons that may be present), then for each i-th region to 9 (1+1)-x, the regions may be arranged in the image corresponding to the position of the buttons (square 3×3), or eight (i+1)-x regions can be laid along (e.g., square) along the periphery of the i-th region, for example in accordance position 8 of 9 buttons. The benefits of such an organization is not restricted to mobile phone: the eight-dimensional organization may also facilitate user selection of one of the regions (files)using mechanical device input, such to the (octagonal) joystick or mouse buttons, which are not necessarily part of the mobile phone. The number of buttons, thus, may be determined by the value of M the maximum number of shows (i+1)-x regions. If there are more than M (i+1) files that are logically related to the i-th file, the additional regions may be shown separately (in another place) or omitted (as an option, the symbol or symbols can be created to point to it and even to provide tolerance to lowered files).

The thirteenth aspect of the invention is a product in the form of a computer program, which can be read by the processing unit in order to initiate the processing unit to implement one of the processes described in the first, second, third, fourth, fifth, sixth, seventh, eighth, ninth, tenth, eleventh, twelfth aspects of the invention. This product is a computer program may be a computer program for applying one of the methods of the invention, stored on a recordable device, such as electronic (or optical) read the recording device.

Under the "small screen resolution" may be understood the low screen resolution in absolute value (for example, not more than 500×500 pixels, with no more than 200×200 pixels or even not more than 100×100 pixels or screen with low the resolution in relation to the number of files, designed for communication (for example, a total of not more than 10, 25 or 100 pixels on the file).

In any of the above aspects, the method may be able to reject (i.e. not to include on the map) files corresponding to this type. For example, especially in the context of the Internet, the card can continually ignore the audio or image files, so the distance was long click can be displayed without undue complication of the card, or can create additional region to represent the file (or include files) definite (i.e. the specified type.

The preferred embodiment of the invention presented below, for example only with reference to the accompanying drawings, in which:

figure 1 shows a window screen including a map generated according to the first method in accordance with the invention;

figure 2 shows how the distance of a click can be presented as part of the window on the screen, depicted in figure 1;

figure 3 shows the map generated by the second method according to the invention;

figure 4 shows the map generated by the third method according to the invention;

figure 5 shows the map generated by the fourth method according to the invention;

6 (a-d) shows the map generated by the fifth method according to the invention;

Fig.7 (a-b) de will onstreet use of the card in accordance with the invention for image 96 of the files in the directory structure;

Fig (a-b) demonstrates three different ways to display information describing the data file;

Fig.9 shows the map generated by the method in accordance with the invention and suitable for use in a mobile phone;

figure 10 (a) demonstrates how a mobile phone, equipped with a map of figure 9, can be used to make a phone call;

11 demonstrates how the phone has maps, depicted in figure 10, can be used to access the Internet;

Fig shows a mobile telephone in accordance with the invention;

Fig shows schematically as a map for your phone and pig may be submitted in accordance with the invention on the screen with a low resolution;

Fig shows schematically part of a map in accordance with the invention;

Fig shows schematically part of a different card according to the invention;

Fig shows schematically part of a different card according to the invention;

Fig demonstrates another card according to the invention;

Fig demonstrates another card according to the invention;

Fig demonstrates another card according to the invention;

Fig demonstrates another card according to the invention;

figa and 21B show the corresponding displays are offered to the user, which displays sootvetstvuyushie (invisible) areas of the screen, shown in Fig; and

Fig shows another device according to the invention.

Figure 1 depicts a box 1 having the name 3, panel 5, panel 7, the area of the image 9 and the area information output 11. The title panel 3 includes keys 12, that is, areas on the screen that responds to appropriate the possible location of the mouse of the user or other input devices, so that by placing the mouse on these places and carrying out an operation of clicking, the user can operate the manual control device. These buttons are used for operations with Windows, such as opening and closing Windows, by the usual method. Similarly, menu 5 allows the user to switch between the various activities and promotions in the usual way.

The area of the image 9 shows containing a map generated by the method proposed by the invention. This method starts with the definition of this file Internet as the "first" file and depicts the first region 13 in the form of a circle as large as possible, let this area of the image. The circle of the first region is the first file.

In this example, the first file is the page that contains 4 bindings, each of which leads to a potential "second" file.

On the display the second set of files are represented in a circular regions 15, 16, 17, 18. The second file 15 - e is on the page, contains two bindings, leading respectively to two thirds of the files, which are respectively represented on the display in a circular third regions 21, 23 within the second region 15, representing the second file. Similarly, the second file, presents a circular second region 16 contains 6 bindings, and accordingly, the range contains 16 6 corresponding circular third regions 25, each of which represents one of the respective third regions. The second file, presents a circular second region 17 is "recruitment", which divides the area of the search program into two sections. On the map is represented by a horizontal line 29, which divides the circular region 17 into two halves. One of the two sections of this recruitment does not contain bindings, while the other section contains 2 binding, leading to the corresponding third files presented on the display in a circular regions 31, 33.

As mentioned above, a circular region 13 is depicted as large as possible, while remaining within the area of the display 9. Similarly, each of the second regions 15, 16, 17 and 18 are depicted as large as possible, while touching the perimeter of the first circular area 13 and each other. Similarly, the third circular regions 31, 33 within the same section of the second circular region 17 shows a maximum in the potential size.

However, the second file, presents the second circular region 18 contains only one reference to one third file.

This third file is represented by one circular region 27, which is concentric with the second region 18, but has only half of its radius. Thus, the third circular region 27 is different from the circular regions associated with other second file because it has the largest possible size that corresponds to a location within a circular region 18. This means that, for example, the card performs the fourth numbered preferred line described above in the description of the fourth aspect, and allows the user, for example, to select a region with a single click, by positioning the mouse over the visible part of the region and the implementation of the click.

The third file, presents the third circular region 27, is a set of frames with two sections, the first section containing a single binding, and the second section containing nine bindings. Accordingly, the third circular region 27 is divided into two parts by a line crossing its diameter and one and a half drawn so as to create one-fourth circular region 28, while the second half of the third circular region 27 includes nine fourth circular the regions 30 around its inner periphery.

In this image, it was decided to depict only the fourth circular regions 28, 30 inside the third circular region 27. This may indicate that none of the other third circular regions not associated with a file containing any binding. Or perhaps it is a consequence of the rules of image maps, requiring, for example, to the fourth circular regions were shown only inside the third circular regions, which are the only third circular regions within their respective second circular regions.

Although it is not shown on this chart, any of the above regions can be any shape (circles, ellipses, lenses, diamonds, triangles, squares, pentagons, hexagons, and so on), they can be and/or colored, shaded, to blink, to move (e.g. rotate) and be within the image of characters (for example, squares or triangles) is possible, therefore, that these characters dominate or are the only marks shown on the map (see Fig) - in order to indicate to the server that hosts this the file, when it was visited for the last time whether he was selected as the primary file, visited his name and brief information about the content, are protected whether he word password, and/or the two who is it "page" or any other file type (for example, the audio file or list).

One algorithm that generates the map in figure 1 (omitting for simplicity the possibility of "recruitment"), the opportunity of which can be directly taken into account by an experienced person, consists of the following five steps:

1. Draw a circle (the first region), representing the first file as large as possible in the center of the display.

2. Count the number of bindings N to other pages of the web page included in the first file.

3. Presenting the center of the circle vector P and its radius as R, if N is not equal to 1, then around the inner edge of this circle draw circles representing these N files, and these new circles are in the ring, each of which has a radius r, where

r=Rsin(π/N)/(I+sin(π/N)

and the center of the new circle with position vector (R), is set

p=P+(R-r)cos(2πI/N)x+(R-r)sin(2πI/N)y, where x and y are parts of the vector in the directions x and y, and I (I=1, ...N) calculates the new circles.

If N=1, draw only one circle with

R=R/2

p=P

4. Follow steps two and three for each of the new circles on the queue.

5. Continue until you reach the required degree of dealerevanston.

Information display 11 contains the information about the first file, such as its name (inside the frame 40), address (inside the frame 41), summary (inside the frame 43) and (inside the frame 44) file specification (EmOC is emer, indicates, if the displayed image file on the display, or even shown in the video).

Of course, the global network Internet contains many protected pages, in the sense that some users are not allowed access (e.g., protected pages that require a password or other form of identification). Even the directory structure within the firm may contain such pages. If the ligaments inside pages are not closed to the public, its embodiment may display a map on the basis of the information which is available, for example, the region may indicate the presence of a page without specifying the structure within this region. How this region is depicted, may indicate that this page is secure. The user can provide a password or identification of the embodiment of the file, so that if the user has access to view these files, the personification of the file can query the site, server, etc. to obtain information about the page, under the protection, and thus to complement the map. The embodiment may alternatively or in addition include pre-written file password or identification information, in order to obtain information about any of the files that are allowed for viewing by the user, without user intervention the index.

Although it is not shown in figure 1, any or all of the circular regions can be represented graphically, for example, by using colouring. This feature is explained below in more detail in footnote 4.

Although in figure 1 for simplicity, not shown, the regions located at a distance of more than 3 clicks from the first file (n=3), other avatars files at a distance a large number of clicks from the first file will be included in order to represent complex fractal pattern, consisting of a total of up to several thousand regions. This method can even be done continuously (continuous or accumulated) on the basis of the first series of related files in order to produce the effect of increasing the image as you move the user over the network. This image may be used as a screen saver on the monitor screen.

Now we will describe one way in which can be used by the box in figure 1. To start may be generated by the image when opening search programs (e.g., automatically or by user command) to generate a map based on this first file (such as a file, which he reads at the moment). Then displays the image within the display area 9. This immediately indicates to the user that RMS who are bindings of its associate this file with others. Using input device, such as a mouse, the user can specify one of the regions of this image. For example, he can move the mouse until the cursor on the screen associated with the mouse position, not come to one of the regions. Further, the display indicates the name of the file corresponding to the selected region, for example, as text in a frame around the region. By a specific command (such as a mouse click), the user can instruct the device to display further information based on the selected file. For example, information in the area of the display 11 can be updated to now be based on the selected file. If the user decides that the image of the file ("open" this file), the user can issue an additional command instruction of this order (e.g., mouse click), then the file will be opened either as a new window on the user's screen or as a window update, previously demonstrated the first file.

Further command from the user (which may or may not be associated with the opening of the selected file) can regenerate the display based on the selected file as the first file. Or the image may be changed automatically when you change a user's location (or at least the above-described movement of the user, is because by entering a new address in the program search).

Another option is to mark a particular file ("tab"). This enables automatic return to this file later. The bookmark can be done by the command through the mouse (i.e. by moving the cursor associated with the mouse, so that it lay over the region representing the file you want to mark, and click the mouse keys in the proper sequence) or in combination with one of the keys 45, 47, 49, 51, located inside the box 1.

A further possibility is to update the image by the user based on the location of the first file at the moment, but instead on the file selected (for example) from the display. Updated the display may then indicate the distance in clicks between the user's location at the moment and the first file based on the image.

Such a display is shown in figure 2, which shows only the area of the display 9 box 1 and where for simplicity all the details in the first circular region 13 have been omitted. Figure 2 differs from figure 1 that the display area 9 is wider and includes five areas 52, 53, 54, 55, 56 (separated by horizontal lines) between the outer border area of the display 9 and the first circular first region 13 (each district in this case continues on both sides of the circle 13. It is de what anstralia, the first file on the display can be achieved with the location of a user in real time along the path through hyperspace, including 5 intermediate files (i.e. the first file on the display is at a distance of 6 clicks from the user's location at the moment).

In deciding that the first file is at a distance of 6 clicks from this position, the method could search all possible ways among the files, to choose the path that had the least amount of clicks. For example, even if the user has selected the first file on the display by creating images based on your location at the moment and it clicks on, say, the seventh region, it is possible that the file represented by this seventh region, can in fact be achieved in just 6 clicks from the present location of the user (for example, another path through hyperspace than the one that knew the user), and therefore, the method has established six areas (one for each of the intermediate files and one for the initial file). The user can get information about one of the five files on the shortest path found by this method, and/or may choose to implement any of the operations that it can produce over circular regions by specifying (example is, clicks) in the corresponding region 52, 53, 54, 55, 56. Of course, there are often several different equally short paths between the user's position at the moment and the first file on the display, so the method can choose one of them according to some criterion, in order to make only the Association between the first loop 13, the area of the display 9 and the corresponding files on the shortest path. Alternative mapping using more than one path, for example, in this case, on either side of the circle 13.

Referring now to figure 3, the second embodiment shown on the map created by the method in accordance with the invention. In this case, the display region is fully occupied square the first region, representing that the first file. The first file is linked using bindings with three second files, which are represented by circular regions 61, 63, 65. The second file, presents circular region 61, contains 4 binding to the third file, presents the third circular regions 67, which are located outside the second circular region 61 and relate to its external periphery. The second file, represented by the second region 63, contains a set of frames, dividing the second file into two parts, which respectively indicate sections 69, 71, a second circular region 63. The section is which file submitted by section 71 of the second circular region 63, contains two binding files, presents the third circular regions 73, 75.

Figure 4 depicts a map created on the third method according to the invention. It is different from the first two methods the fact that regions have a square shape, not round. The region of the global network of the Internet, presented in figure 4, the same as shown in figure 3 (i.e. 4 logically equivalent to figure 3, in addition to differences in color, explained below). That is, this first file (represented by the first region, occupying the entire area of the display 9) is associated with three second file (represented by square areas 76, 77, 78). The second file represented by the second area 76, containing the following four district 79, endowed with the maximum size, in order to fill the second region 76, in addition to a small space around each of the third region. The second region 77 is shown divided into two parts and represents the set of frames, which divides the second file into two sections, one of which contains two bindings (indicating, respectively, by two-thirds files, presents the third region 81) and one section, which contains no binding. The second region 78 is a file that has five bindings to the third file, presents the third square area 83. Note that the organization of the four districts 79 resembles the location of the points on the dice, as well as the organization of district 83 inside the area 78. This is an example of a principle that can be applied to all aspects of the invention is that the method may include for each number (i+1)-th files which can be represented by a given i-th file, the corresponding path separate points, the orientation of which with respect to each other and to their parents determines how this number (i+1)-x regions should be arranged inside the corresponding i-th region. That is, if it finds that there is a certain number (for example 4) (i+1)-x files, the method finds the appropriate path of this number (4) and outputs (i+1)-e regions in accordance with this way. As shown in figure 4, the path may, for example, to match the sample location points on the dice, or can be made available for compliance with the numeric keypad, described above.

Two types of shading in this drawing represent the colors that can be represented in reality the image created in accordance with the invention. Two possible colors may, for example, to indicate which of the two servers has provided the appropriate file or some degree anticipated match of this file for the purposes of the user.

Another part of the window 1 (for example, the left panel 7, which is not shown in figure 4), can be included in with the BOJ is the key to the meaning of these symbols. For example, for each color used for these plots, the panel 7 may include the area that has the color. Thus, the user can find out the value of a color, turning to the right place panel 7 (directing to the location of the cursor)to cause the indicator color values.

In contrast to the colors of various parts of the panel can be differentiated by their structure (e.g., shading, as shown in the illustration), flash, form, or other graphic method.

Figure 5 shows the pattern formed by the fourth method, in which each file is represented in a special plot - point (all points are the same size), so that this scheme was not in the area of the first aspect, but, for example, in the area of the third aspect. The first file is represented by a point 90, connected by hyperlinks, represented by lines 91, 92, 93, with the following three files, respectively, are represented by points 94, 95, 96. The second file, represented by a point 95, connected (three hyperlinks, represented by lines 100, 101, 102) with points 97, 98, 99, which respectively represent the third file. Lines 100, 101 and 102 each is less than half of the lines 91, 92, 93. Simply put, taking into account the continuation of the charts next third file, the line representing the hyperlinked between each plot of each (i+1) plot, longer by a constant factor (in this case, the AE 2), than each line representing hyperlinked between each plot (i+1) and each segment (i+1). Of course, with increasing number of mouse clicks points in each section will start to overlap points are logically related to each other (i+1) plots. This problem can be solved, for example, by reducing the diameter of the dots by a constant factor or by limiting n, as described above with respect to the first aspect (e.g., the same factor that sets the ratio of the lengths of the lines), and increasing distance between the mouse and the first point 90. For simplicity, this scheme is not given the ability of the system framework (i.e. this scheme represents files that are pages and systems framework), although experienced person can generalize this mapping to include a systems framework.

All diagrams shown in figures 1 and 3-5 are "limited"in the sense that discussed above. Moreover, we can say that all of the circuits shown in figures 1, 3 and 4, "intensive", meaning regardless of how much a mouse-click away between the nearest and farthest file, the total area occupied areas, remains constant (i.e. equal to the first plot). In contrast, figure 5 shows the display that is not intense, but still limited. I.e., although the display size of the increase is provided as as we increase the total distance of the mouse between the nearest and farthest file, it remains less than the given target size for any number of mouse clicks. This can be understood by observing the amount of series:

1+1/2+1/4+1/8+...=2

The display of figure 5 would not be limited if, for example, the length of the branches has not decreased (or not reduced quickly enough) relative to the distance of the click from the first file.

Referring to Fig.6, Fig.6(a) shows the pattern formed by the method according to the invention, in which within the display area 9, the first section 13 is the first file (or, for example, context-sensitive search function), and four secondary plot, 17, 18, 19, respectively, represent the four files logically related to the first file. The plot is not a file, it allows the user to return to the old system, by clicking the mouse on this site. For example, section 105 may be a predetermined state of the system, which can be recreated by clicking on this site. For example, a particular state could be marked "bookmark" user, or is it a pre-condition set by programming. Although shown only one section 105, in another embodiment, it is possible to provide a plurality of, for example, in the form of schema cos the tub areas with decreasing distance scales, associated respectively with predetermined conditions.

The user clicks the mouse on the area 17. Then, the method forms the diagram in Fig.6(b), which extends the second section 17, and the third region 107, respectively, represent 28 third of the files is done from the file represented by the area 17. It should be noted that although the areas 107 are mainly the same distance scale, some are dots, and the other circles, but not necessarily. For example, if dot (or similar, but different methods, lenses or diamonds) were designed to allow you to fit the marking with long names under the relevant section, then the ellipsis 17 can contain only other multipoint stations 107. The insert in the lower left corner of the diagram is a diagram in Fig.6(a)that is adapted to the removal of section 17 of the area around section 13.

The user then clicks on one of the sections 107. The circuit is redrawn as shown in Fig.6(C). Section 107 is redrawn in expanded view. Section 17 become the external border of the insert, thus showing the history of the movements of the user within the set of files; you can also click to return to the diagram shown in Fig.6(b).

The user then clicks the mouse on the section 18. Schema conversion is provided, as shown in Fig.6(b). The files presented in section 18 (third selected area) is projected, in accordance with a predetermined logical value, files are presented in section 17, the selected initially, the file is selected from this area as a starting point. For example, if the first selected area 17 includes companies, one of which would be selected, and the second - workers, and if the Boolean value would be that which is described above ("the First and second files may be logically related, only if the first is the employee, and the second - the company that first worked in the past, or the first represents the company, and the second of this employee for this company"), then the areas within the larger area 18 would be the employees of the company, and the circles in them would other companies for which they worked, etc. Insert, limited area 17, now shows only two second sections 16, 19 adjacent section 13, in addition to section 105, which allows the user to return to the previous state of the system.

The user can click on any of the smaller circles within the larger plots to redraw the circuit in which this site will be the biggest or will be starts the th point. Section 17 can be changed to represent the main plot, which belongs to the selected file.

The user can also click on the sections 16 or 19, instead, to project the ratio between the selected file and a set of files that represent a selected area. In this case, the selected area will be, as it was advanced, and the plot that it replaces, will be again the area around section 13.

At any time the user can click on the white outer area to return to the first image.

As is clear to the skilled person that many variations of the method of projection, explained above, is possible. For example, although, as shown earlier, the plot size is reduced in accordance with the distance (measured by number of clicks) between the files they represent and the first file, it is not necessarily. For example, the schema can be reduced to files using a small number of clicks (e.g., 2-click), or some part of the scheme, which falls from the area of the image may not be shown.

In addition, as described above, not necessarily all the parts (i+1) in or around this area I are the same size or shape. For example, referring to Fig.6(b), this scheme can be changed so that one of the participants 107 would be the biggest, Sosa is in the area 107 is slightly less section 107 near this even less, etc. to each of the sections 107 had a different size. This opportunity applies to all aspects of the invention throughout the document but the options of size and shape preferably formed on the basis of rules (e.g., number of times watched file or a file type).

Referring to Fig.7, we can see that the method accordingly to the invention shows the files in the computer about the resolution miniature laptop computer. The user controls this step-by-step method. First, as shown in Fig.7(a), visible single area, representing the whole potential memory PC user. This is how the directory can be considered a data file. Then, figure 7(b) shows the functions of the computer (or which are data files, or are regulated on the basis of the data files). Finally, figure 7(C) illustrates the hierarchical structure of the following two levels of data files, although they can reveal more or less rapidly (for example, one or three levels at the same time). The diagram shown in Fig.7(C), the scheme in accordance with the invention, but it includes smaller schemes, which are produced individually in accordance with the invention and disclosed or individually (for example, when the user points the mouse on a particular region)or in groups (the example layer by layer, as described above). Table 1 compares the file is opened in the directory structure using the system browser, in accordance with the expanding tree method.

"Windows", discussed above, using the hyperbolic view files "Inxight" directory (as mentioned above, research paper John Lamping and Ramana RAO, discussed above, which introduced the concept of hyperbolic schemes, does not specifically mention the open file, but here we will take into account the variant of this technique, in which the clicking in a certain way on the point of the hyperbolic scheme representing the file, moves to (i.e. opens) this file), and using the scheme ("fractal spatial schema"), similar to the one shown in figure 1, i.e. in accordance with the present invention.

Table 1
Expanding the tree WindowsThe hyperbolic tree InxightFractal spatial schema
Mouse clicks to open the deepest directory642
Mouse clicks from the deep katal. prior to his top level331
The directory levels achieved one y is locom 124/5*
The percentage of directory opened with a single click of the mouse71763/80*
The maximum number of directories that are opened with a single click of the mouse17901200/9600*
features- There is no sense of integrity- There is some sense of integrity- Excellent overview
- Require precise mouse clicks- The details are fuzzy- Easy selection process
*Using a sliding click

The values in table 1 are calculated using the specific directory structure, which has 200 components, arranged in 6 levels (the directory structure is not selected with the provision of preferences this technique). The term "sliding clicking"used in table 1, means that the user moves the indicator device (e.g. a mouse) in a given direction until it reaches the area, which will stimulate the change of the image (for example, by opening the display panel, as described below), and then clicks and holds the mouse button down, thus locking the display panel, and allowing the user is, for example, when the display panel shows the names of the children of a particular site, select the file of the child by moving the mouse pointer to the appropriate label name, or in her direction, until it is highlighted, and then release the mouse button. Thus, "sliding mouse click" - is a generalized form of the movement of the mouse click. There is a known manifestation of the hyperbolic tree in which the user may make such dragging move the mouse, but it causes continuous redraw the entire diagram with a changing point of view until the mouse button is released. In contrast, moving the mouse clicks, previously described, refer to the snap movement of the mouse, the caller is displayed adjacent to or superimposed on the unchanging part of the scheme, and the second snap movement of the mouse is performed later, for example, to open a file corresponding to the section.

The file to which to apply the invention in all its aspects, can be classified in different ways. The first classification of local versus network where local files are files within a single device (or a number close spatial devices), and network files stored in more distant locations, e.g., included in the network via telecommunications. Another possible classification "content is the W against functionality", where the file contents are files that have the content displayed to the user, and functional files - files containing the program to perform the function. Thus, the reference file in the user's PC is a local file content (the user reads the text in the help file to understand the function of the PC), Web site showing the price of the article is the network file content (the user has access to the server file to read the content); the driver software in the PC to the printer is a local functional of the file; an application program stored on the Web site is functional network file. Another example of network content file may be a file related to, say, modern public relations generated by equipment operating in the network, n-R switching line.

In many aspects the method described above, since the distance scale is gradually reduced (e.g., with increasing distance from the first page), areas representing the files I, decreases with increasing I and correspondingly more difficult to see. As described above, the user can redraw this diagram, starting with a new data file as the first file data, in order to increase the distance scale. However, there are other methods that allow the user best is to understand the value of small parts.

The first possibility is to allow the user to increase the part of the circuit (i.e. the main basic diagram is not drawn again, but draws a new scheme, which is designed or simply by increasing the portion of the circuit selected by the user, or by creating a new schema using the file method on a number of levels selected by the user (e.g., by a mouse), the top of the main circuit, for example, aligned in the center of the mouse pointer in the center of the selected area, or some other point). For example, the user can define the region ("lens") on the diagram, which is then portrayed as if it was visible through the lens on an enlarged scale distances. Note that the lens and the other increases may be accompanied by sliding click and/or a mechanism that allows sequential increase without redrawing the base schema.

Another possibility (which can be combined with the first) - when plots (I+I) section I presents respectively the areas in another part of the display, with the relevant provisions relating to the relevant provisions of sections I+I, as shown in figure 10(g), for example. This is called a "great increase".

In addition, the selection of one of these sites (e.g., a mouse, or pressing a key), has the same function as the selection of the appropriate area on the diagram. In this case, the AE, this part of the scheme is referred to as "control panel".

Fig shows a variety of alternative (or additional) methods to explain to the user the value (e.g., name) of the data files on the scheme, in accordance with the invention. On Fig(a) the value of the data files specified "icons" (presented in illustration of uppercase and lowercase letters, though, can be used and other symbols, of course). Icons for files I+I, depicted inside the file I can become visible only (it is also possible that the icon representing the file may disappear entirely, as shown), when the user somehow allocates highlight this file I, for example, by a mouse. This is called "following icons" and can help the user to focus on the right part of the schema.

On Fig(b) shows the value of data files by using a single display panel. As for the file, which the user is interested in (the 4th file, highlighted by the arrow), the display is given a name ("Humanities") 3rd file that is logically linked with the 4th file, and all nine of the 4 files, related 3-m file. Of them, the name of the 4th file, which the user is interested in ("booksellers") is highlighted. This selection can also be shown using the line going from the plot of silent hill is we, which is currently allocated to the corresponding part of the display panel (for example, if the display panel is located in any part of the scheme, and not from the bottom as shown), and/or circuit and the display panel may be a color code, for example, in addition to link all 4 parts with their names.

On Fig(C) shows an alternative method, when information (e.g., names, as shown)on the respective data files produced in specific areas, which links with relevant sites, and are drawn on top of the base schema. The location can be defined so that they do not go beyond the image. Any of these methods allows the user to read information from a file without opening it, thereby greatly accelerating, for example, move to the desired file. Moreover, other two methods can be used along with the technique of moving the clicking above.

As mentioned previously, in all the schemes, in accordance with the invention, when the site can be reached from (e.g., logically linked by an arbitrary number of steps) of the first file in two or more ways, it can be represented by only single plots (showing one possible way), and plots that show other ways can be skipped. In alternate the nom version more than one such plot can be drawn for this file. In the latter case, (i) the descendant nodes of this file can be painted only in one part or more than one, and/or (ii) when the user points to one such site (e.g., moving a mouse), the plots represents a single file that can be highlighted, inserted in the circuit, have their descendant nodes, drawn inside them, and/or have some or all of the specified parent parcel (even if a copy of a particular area, in question, is not drawn). Thus, the network rather than the hierarchical nature of logical relationships can be clarified to the user.

The scheme may display (e.g., using a separate panel display) information relating to data files, in which the value I is greater than n (i.e., those data files that are not represented in the diagram of the invention). For example, the user may be able to display information relating to data files, in which I=n+1, say, clicking the mouse on the file, in which I=n. This layer I, usually referred to as the "invisible layer".

Fig.9-12 refer to the mobile phone including the display 200".

In most parts of the control telephone device display displays the standard information, but the mobile phone is, m is Nisha least one way to use (shown in Fig), in which the display 200 includes circuit 202, made in accordance with the invention.

This display also includes 3×3 grid of icons 204, which may represent the assignment of sections in the circuit 202 (e.g., icons can represent values files (I+I)is logically associated with a particular data file (I), or may be a special grid that allows you to enter control commands relating to parts of the scheme 202 (e.g., to insert a bookmark) through the keyboard in a manner similar to that described below (hereinafter will be referred to as "command-grid").

Detailed structure of the fractal spatial pattern 202 includes a range of distance scales, and each scale scheme is a net 3×3. This is especially useful, because the configuration of the digits from 1 to 9 on the handset also is a net 3×3. That is, when the ways of usage, when the user selects an object based on a fractal spatial schema 202, it may be done at any distance scale by pressing the part of the additional numeric keypad, which runs the numbers from 1 to 9.

This display also shows "reduce" ("the system" and "cancel"), i.e. functions that can be controlled by pressing other keys. In this case, both "system" and "tmenu are managed with the help of clicking the top two numeric keypad. With their help, you may also receive a second command grid instead of the first, and the first in its turn can be substituted, for example, an enlarged version of the allocated site schema 202.

Figure 9 shows the scheme made in accordance with the invention, which can be used as a fractal spatial schema 202 (Fig). As will be seen later, it has multiple scales of distances, the biggest of which is the width of Fig.9. Another scale of distances (or the first distance scale") is slightly less than one-third of it, and is a distance scale on which painted eight second sections- 204, 206, 208, 210, 212, 214, 216 and 218 (i.e. the distance scale is the horizontal length of these sections).

On a smaller "second distance scale" drawn three sections - 220, 222, 224 (for example), and it represents approximately one third of the first scale distances. "Thirds the distance scale", which constitutes about one third from the second, drawn fourth sections - 226 etc.

Referring to Fig.9, the user can see immediately that there are at least eight second data files submitted by the regions 204, 206, 208, 210, 212, 214, 216, 218, and that there are at least eight third data files 220, 222, 224, logically associated with the second data file, presents the 2nd section 204. There is one file (represented uchastka is 226), which, in turn, logically associated with a 3-m data file presents the 3rd section 220.

Also, for example, there are only four 3 file data logically associated with a 2-m presented by section 210.

As explained earlier, the scheme corresponding to the invention, shown in Fig.9, can display a maximum of 8 directory (I+1)associated with each directory I (the Central area of each square can be left for icons). This raises the question: what to do in the framework of the method of the invention, if there are more files (I+1)than the predefined upper limit M Has two possibilities. First, in section I, or near it, you can draw a symbol (e.g., in the Central part of the square 204 figure 9), showing that some of the files (I+1), which are not represented. This symbol can be placed, for example, in the Central part of the square 204. Alternatively, the plot representing the data file, can be extended (i.e. covering both square 204 and 206)to give enough space to display all files (I+1). For example, when the site I is a combination of squares 204 and 206, the image may present the user with up to 16 data files logically related data file I.

The value of M may be selected in accordance with the physiological and psychological data. For example, believes the I, in many situations, the person does not like to choose from a large number of alternatives. Thus, it is preferable that values of M was not more than 5, 6, 10, or 20 in all aspects.

Figure 10 shows two of the telephone operations, figure 10(f)-10(j) shows how to use a mobile phone to make a phone call. The initial configuration is shown in figure 10(a) and 10(f). The display area specified number 232. The additional panel numeric keypad presents part 230. The upper part of the display area - ring 233 of the 8 squares that displays the functions available to the computer. Although it is not shown in the illustration, each square has a symbol, signifying function. For example, the symbol related to key 2, has an icon indicating "telephone directory". In the display area there are two cut - "search" and "speed" in the display, which relates to the two upper keys added numeric keypad.

The mobile phone is provided with a directory of files that can be stored in a mobile phone or, alternatively, in a separate place. Additional files, there is at least one that stores the names and corresponding phone numbers.

In this example, the names are divided into eight separate files (all names are respectively the letters a-C, D-E, F-H, etc)that are in a single kata is of God.

The selected range of location names may depend on the number of names that are in these categories. For example, if the number of names beginning with the letters a, b and C, are not proportional to each other, they may be redistributed so that the first file only included names beginning with the letters a and b, while names beginning with the letter s, would be in a separate file.

To call the person whose number is stored on the mobile phone, the user has two options.

First, he can press the button 2 (because it correlates with the phone symbol in the grid 233. Then the phone generates the schema 234, as shown in figure 10(g). Circuit 234 corresponds to the invention and shows the directory structure of the data files available to the user. Further, in the display enters the ring 235 of the eight icons corresponding to different functions. Then, the user can press 7 to access the tool "search names" (function represented by the icon at position 7 on the grid 235).

Thus is formed the display shown in figure 10(h). The grid of squares 238 shows the values of level directory of data files, which shows the range of letters, reflected in the diagram 234.

The user can move directly from one mode (figure 10(f)) in the other (figure 10(h))by pressing the left from the top two keys to quickly priest is to drink to "search" (i.e., search names).

Suppose the user wants to call a person by the name of "Raiskinen". In this case, the user presses a key 7 (related to the range of P-R), to go to the state shown in figure 10(i), i.e. the list of names in this range. In this case, all the names of this range can be fitted on the same screen, when the user requests a scrollable list of all the matching names (if the number of names in the address book, beginning with a certain letter, large, file structure can be formed using the second letter of these names, and then the user will have to specify the second letter of the name of this person). Pressing the appropriate key 8, the user can automatically call the person by name Raiskinen.

Figure 10(a)-(e) shows how the user can transfer the call. Starting from the initial configuration shown in figure 10(a), a double press or short press and hold 5 (about half a second), gives a list of phone functions. The user selects 3 to cause the call register (telephone function)to produce the configuration shown in figure 10(C). Then, seeing that the icon for redirection is shown in position 3, the user clicks on 3 to get the configuration of figure 10(d). The user can either directly enter the number (of a man named n-R Ilka Raiskinen), where you want to divert calls, thus reaching the configuration 10(e), or press the key that corresponds to accelerate the search to return to figure 10(h) and be able to locate the person to whom you should be redirected calls, among people in the address book as described above. This shows how you can use the invention to facilitate the execution of complex functions of the firmware.

Figure 11 shows how, in accordance with the invention, to use a mobile phone to connect to the Internet. On figa, 11b, 11C, 11d and 11th consistently shows five stages.

First, 11(a), the phone is not connected to the Internet and is in the mode of relating, mainly, to figure 10(a). On the display 332 given General information. The square at position 4 of the ring 233 (i.e. in the middle of the left side) there is a icon that means "function of the Internet". The user clicks twice at 4 to go to the state shown in 11(b).

At this point the phone is not connected to the Internet, but the display area is formed a circuit 234, according to the invention, which shows the files of the phone (and the equivalent circuit shown in figure 10(C)). The display area also includes a second section 236, consisting of 8 square plots are drawn in the same form as the areas on the circuit 234. In addition, the display includes the cuts "search" and "connection", located in places that are coincident with the top two buttons.

Click on the upper right key, or perhaps one of the icons in the grid below, by keyboard, it activates the function "connect", and the mobile phone connects to the Internet.

First, the mobile phone connects to the base page "portal", as shown figure 11(C), which is based on the circuit 234. The base page or word(s) (e.g., "Portal"), which it can display in a frame 238. Pressing "I" on the numeric keypad gives the move (but in this case, still does not open, i.e. not retrieve the data in the direction of the file represented by the upper left second section 240). This gives the image shown figure 11(d)where section 240 highlighted (e.g., red) or flashes, and the lower part of the display 232 shows the name of the open file.

Pressing the bottom right button (usually #) opens (retrieves) the file represented by section 240, in this case, the weather forecast for the day. This is displayed in figure 11(e). The upper area of the screen is now fully deployed in a grid 3×4, with user-accessible data - Name", "Communication" and "Information" and the bottom row keys on the numeric keypad of the phone. The invention can be combined with any is the eat (in the form of a grid or otherwise) any number of keys, and the keys that are active at the same time, may change, in obedience to a user action.

As mentioned above, the minimum number of picture elements is limited. On Fig shows how to display all the information that is on figure 10, can be made on this screen. Section 2041 (corresponding to the value section 204 figure 10) can be depicted as shown in figure 11(b), on a grid of 11×11 (note that this location leaves a pixel (one minimum element of the image) between the blocks corresponding to portions 220 and 222 of figure 9, and between the blocks corresponding to the sections 222 and 224). In order to present the scheme, which is equivalent to figure 9, three of the grids 11×11, shown in 11(b), are arranged with a space equal to one pixel among themselves, as Fig(a), with a total minimum width of 35 elements in the picture. In other words, the chart containing all of the information Fig.9, may be represented by not more than about 35×35 minimum image elements.

In practice, the author of the present invention found out that the order of this size, in principle, difficult to read, if pixels have more than two States (e.g., not only black and white, and one or more other colors). It was decided that the acceptable number of States of each pixel is three.

That is locsite clarity (especially when the pixel is limited to two States, e.g., black and Belm), you can insert additional pixels between blocks corresponding to portions 204 and 206, and between the blocks corresponding to portions 206 and 208 (and vertical space of the second areas, respectively, increases); the grid becomes 37×37. It is preferable that the number of pixels along each side of the scheme was less than 150, and better still less than 100. Special preference to the case when the number of pixels used to create the image - 77×77 (as in Fig.9).

Additional rows of pixels can be inserted either between the blocks of the image, or around their other sides to gradually increase the sharpness in accordance with the capabilities of the display device (taking into account other information that the display device needs to represent simultaneously with the circuit of the invention). The diagram shown in Fig the phone uses depicted on Fig. Note that at any level of depth q (up to eighth) data files located in the first position q, the sequence of positions of the M=8, correspond to the positions of the numeric keys 1-4 and 6-9. In this case, the sequence means a closed branch of the eight positions clockwise. This branch is associated with a predetermined direction in the diagram (for example, the first three positions is the horizontally relative to the screen).

Now we describe in detail the various methods of drawing diagrams in the framework of the invention.

While figure 1 plots 25 is of such size that exactly matches the inner circle of area 1, Fig the data file represented by the section 316, and (I+1) data files presents overlapping circular areas 325. To reduce the likelihood of confusion, the user can specify one of them (e.g., mouse), select it by highlighting and shifting the mode of the background (e.g., invisible) other areas 325, which it overlaps.

Alternative overlapping sections 325 may be an option when they are compressed (e.g., from circles to ellipses or as shown in Fig), in the same way that was described above relative to Fig. The compression ratio can be selected so that the desired number of circles could be drawn within the inner circumference of the section 316, and not to their radial extension became too small. On Fig also reflects the use of an incrementally changing the gray scale to distinguish these areas on the display. Toning can be between two colors, and areas that need paint, can be divided into two or more segments, each of which uses the full (or your own special set of colors. For example, children are to the right of the parent can be filled from Blagov black, when the user moves clockwise, and those children that left from black to white. This allows you to toned areas gradually or incrementally, thus avoiding interrupting color change.

Although in figures 1, 14 and 15 all areas can be colored the same, actually any plan coloring. For example, the second areas located within the first sections can be painted according to the plan of gradual coloring (e.g., gray level, when he consistently comes up around the circumference of section I; or consistently rising multicolor level).

On Fig shows an example of "implicit intensive" method of drawing areas, in which 332 parts (I+1) are located inside a circular section 334 (which you can use to build interaction with the scheme, thus, apply, remaining possibly invisible to the user).

On Fig shows another scheme established in accordance with the invention. Section 340 is the first file, while four second section 350, 351, 352 and 353 are second files. Each of the four sections 350, 351, 352 and 353 are drawn in accordance with the same distance scale, so that each is drawn to the maximum size, limited to the appropriate form within an imaginary circle 347, identical for each of the four second is Chertkov, as shown in Fig. Note that the second section 353 - circular and thus, can completely fill his imaginary circular border. This shows that, although the sizes of the four plots drawn on Fig depend on the same scale distances, it does not mean that they are automatically the same maximum diameter, for example, or form.

On Fig shown the following diagram corresponding to the invention, drawn with a triangular symmetry. In this case, the value M is equal to 3, since the method does not represent more than 3 children 1 parent, and it's fixed, because the first two sections are drawn inside any one parent parcel, shown in the position which corresponds to their parent, regardless of whether two or three children has a parent (this is the case when, as a rule, the segment has only one child, which is different from the others).

11 is another diagram corresponding to the invention, in which parts (I+1) each site I have a width (as viewed in the orientation of the illustration, which should be identical with the display), equal to half the width of the section I, and a height equal to the height of the area I divided by the number of sites (I+1). One of the three second file is a career, as marked by interrupted line. The set of data files presented on the Phi is .19, identical to that shown in figure 3 and 4. This scheme nemastoma in directions and demonstrates the preferred chetyrehurovnevuju feature described above under the fourth aspect of the invention. Accordingly, it differs from a tree schema.

Fig shows another diagram corresponding to the invention, depicting a set of files, which are equivalent to those shown in Fig. This time the rule is that all files are dots, with their long axis horizontal lines (as seen in the illustration) through the middle of the screen. The HR series is represented by a vertical line that divides the ellipses in two. All third sections have the same length along the long axis, and, obeying all the previously described limitations, each dot is as long as possible. The result of this is that the size of each of the second segment depends on the number of third sections, which respectively contain.

As explained previously, the invention is not limited shamovym displaying the plurality of data files, but can produce a diagram of the segments of individual data files or multiple segments of data files. One possibility is when the segments of the data files are the relevant portions of the computer program. For example, each segment could the be a part of the data file, contains a special subroutine. The logical relationships between parts of a program (e.g., when a subroutine can be called) are a different number of logical relations, which can create a schema using the method of the present invention. Any programming, meaningful presentation of the grammar of the language or code examples can be represented in this way, for example, the inventor has discovered that it is particularly suitable to the HTML structure.

This program may be distributed among one or more data files so that is not associated with the conceptual structure of the program (e.g., some subroutines may be a complete data file; other subroutines may be only a segment of the file; the other routines can be distributed among several files). Despite this, the user can select a logical relationship between the segments of data files (or entire data files) as the conceptual framework of the program so that the parts of the diagram correspond to the routines and painted scheme is based on a single subroutine (playing the role of the first data file).

The use of schemes of this type can facilitate the design of the page (Internet), including its markup, such as HTML. If the playback display, including the schema generated on the again of the invention, the subsequent part of the display area may be a page(s), which is the language that forms on the user's screen. The user may select highlight any part of the schema (e.g., moving the mouse or pressing one or more keys), and in this case the image of the part of the page(s), which is associated with a part of the program, the relevant part of the schema created by the user, can be highlighted.

As mentioned previously, the circuit of the present invention is not obliged to take all the image created on the user's screen. Moreover, when projecting a set of data files, the scheme according to the invention, can be used to create the schema files with size up to I=n, and some other projection methods can be used to create a schema file with a higher value I.

Summarizing the above, in this invention, these methods can create a schema files (I+1), having a logical relationship with the files I as described previously, when I in the range 1, ..., n, where j is an integer higher than 1, and in accordance with another plan (e.g., not having diminishing scale distance) when I is outside this range. In principle, the scheme can be formed even so, within the scope of this invention that the plots will be decreasing scale (HP, the decreasing size) values of I within the plurality of ranges, and in accordance with another drawing the plan (e.g., plan hyperbolic schemes) I will be outside these ranges. Here this type of scheme is called "partial".

All aspects of this invention, the user has the possibility of introducing information in order to choose a special area within the scheme. For this he can use the computer keyboard (if the diagram is formed on a device that is a computer or connected to it), slider, two-dimensional clip, button, keypad, touch screen, grid or other pattern of keystrokes (e.g., mobile phone or any other device.

Especially easy-to-understand manner navigation scheme is one in which the user makes it level by level (i.e. increasing values of I). Because the stations (I+1) each site I is placed along a one-dimensional branches, the user can in each level to choose the file using the one-dimensional movement. Thus, having selected areas (I+1), the user can then select (e.g., pressing) what he wants to manage within plots (I+2)associated with the plot (I+1). Thus, selecting any file in the plurality of data files can be completed simply by using a one-dimensional display, followed by what ndicela changing level incremental I.

This can make navigation much easier, because one-dimensional movement is physically natural to man, in comparison with two-dimensional movement. One-dimensional movement in some situations, it may be, for example, the movement of the mouse in the hand of the user in the form of one-dimensional wave (e.g., movement of a hand of a user with a stationary elbow), or movement emitting device, which in itself is one-dimensional, such as a button or slider.

To further facilitate this movement, a section of the display area may select a set of files from which the user selects the one-dimensional movement, using symbols in a substantially straight one-dimensional line. For example, there may be provided a number of forms (squares), (as always together in the same screen area, regardless of how many files may be required to portray), its corresponding number to the number of files (I+1)from which the user selects. The inventor has found that it is easiest when the display area is in a horizontal position, as seen by the user in some contexts, for physiological reasons described above: in this case, the probability of user confusion is much less because of the curvature of the branches of the projection of the invention, along which built areas (I+1).

In fact, we mo is going to make the difference between the three methods of accessing files. The first method, "serial access" movement through the list of files, one after the other with the action (e.g., pressing a button or moving the roller indicator on one mark for each movement. The following method, "concurrent access" is a series of one-dimensional motion (as in the previous paragraph). And the third method, "fractal access - two- (or more) dimensional choice, for example, with the mouse in the diagram shown in figure 1, jumped to the file located at the distance of several logical connections. Usually concurrent access is the fastest that can be achieved without the two-dimensional display, such as a mouse.

Fig shows two-line scheme (respectively Fig(a) and 21(b))in which the positions of the apexes coincide with the centers of the circles fractal spatial schema, depicted respectively on Fig(a) and 22(b). Plots, recorded Fig(a) or (b)may be "sensitive" in the sense that if the user indicates a position on the display, which in this case is inside a circular area one of the schemes, this may indicate the display of the data file is represented with a circle. For example, placing the cursor inside the area, you can force the display to move in the direction of the file. However, instead of display the display 22(a) and (b), this method may alternatively reflect appropriate to estwenno displays 21(a) and (b), but the functionality of this image may correspond to Fig(b). I.e., although circular areas on Fig invisible to the user, he or she can use their functionality.

Figure 10 additional digital panel includes a grid of 3×3 nine numbered buttons, and the scheme and the panel both painted to match this hidden keyboard. However, the concept of indicator controlled by the user with the parts corresponding to the parts of the schema, and/or the control panel is not limited to this hidden event. For example, the indicator may include an area in which there is a sensitive area, which is capable of detecting movement of the user with the help of a distance scale high precision. When you use this indicator to select one of a finite number of possibilities (e.g., one of the children (I+1) this file I or one of the sites control panel), corresponding to the number of lots can be (automatically) defined within the sensitive area of the display, whereby the user can indicate the possibility of movement in this area.

An example of a device corresponding to the invention that includes this feature, shown in Fig. This emitting device is a circular emitting device 40, which is capable of detecting pressing by the user at any point of its circumference. The inner part of the indicator device 400 includes a screen 406 that displays fractal scheme. The user has already allocated the second section 407 on the fractal scheme, which includes 5 third sections 401, 402, 403, 404, 405 for this second section 407. Circular plot 400 is automatically divided into 5 zones (these 5 zones preferably selected visually to the user, e.g., different corresponding colors inside the ring 407), so the user can choose one of the third areas 401, 402, 403, 404, 405, selecting one of the 5 sensitive areas.

It is believed that the device shown in Fig may be in the form of the clock with the control device 400, which is, e.g., in the position of the rim of the clock. Naturally, when the fractal scheme is not displayed, the device can display the time on the screen 406 (perhaps by another fractal scheme). Although not shown in Fig shown the device may also include a name system that specifies the value of five sites 401, 402, 403, 404, 405 (e.g., one written in the ring 407, the district provisions relating to sensitive areas of the frame 400).

The user also has the ability to change your choice, for example, by clicking (or just a touch) to a point on the circumference, thereby highlighting pods the rigid specific position. The user has the possibility of rotation of the rim, at the same time, still pressing, whereby releasing the backlight to go to the adjacent (or other) site, then releasing the frame to select a new highlight in this section.

All of the embodiments presented previously, there was only an example, and the scope and spirit of the present invention should be understood in connection with the additional requirements.

1. The device establishing logical relationships between multiple data files containing

(a) display device having a display area,

(b) at least one tool

(i) determining for the first file in the first area, with the possibility of choice in the display area and one or more second regions, with a choice of specified second region, respectively, represent one or more second files logically related to the first file, and spatially related to the first area, the second area are determined in accordance with the first scale;

(ii) for each i-th file, where i=2, ..., n, (n-1), optionally define one or more (i+1)-th regions, with the choice specified (i+1)-th regions, respectively, represent one or more (i+1)-th files logically related to the i-th file, and p is strastveno related to the i-th region, the (i+1)-th field are determined in accordance with the i-th scale smaller than the (i-1)-I scale; and

(c) the input tool, designed to log a user selection of one of the areas with the choice specified in the display area and corresponding to one of the files;

the device is configured to, in response to the received selection area selectable by the user re-executing the steps (i) and (ii)using as a first file corresponding to the selected area.

2. The device according to claim 1, characterized in that the value of n is at least 3.

3. The device according to claim 1 or 2, characterized in that the value of n depends on at least one of (i) resolution display, (ii) available to create a display of computer resources, (iii) the number of clicks from the first file, (iv) the previously made selection.

4. Device according to any one of the preceding paragraphs, characterized in that the input means allows the user to select any file.

5. Device according to any one of the preceding paragraphs, characterized in that at least one of (i+1)-th regions for the (i+1)-th files logically related to a given i-th file, determines the rule, and referred to the rule, regardless i and/or numbers mentioned (i+1)-x region the TEI.

6. Device according to any one of the preceding paragraphs, characterized in that it contains means to define a rule that specifies that does logically any of the data files with any other one of these files.

7. Device according to any one of the preceding paragraphs, characterized in that it contains a tool made with the possibility for the selected j-th file (where 1≤j≤n), presents one of the areas, creating additional areas for each file that is pre-associated logically with the j-th file, with each additional field includes data that indicates the importance of the associated file.

8. The device according to claim 7, wherein selecting one of the optional fields is equivalent to selecting the area corresponding optional field.

9. The device according to claim 7, characterized in that the preliminary logical relationship is defined by the fact that the data files, for which see the area, are the j-th files logically related to the same (j-1)-th data file, the selected j-th data file.

10. The device according to claim 7, characterized in that the preliminary logical relationship is defined by the fact that the data files, for which see region are (j+1)-th files logically related to the same selected j-m is ILOM data.

11. Device according to any one of the preceding paragraphs, characterized in that the second region have a size corresponding to the first scale, and (i+1)-th regions have a size corresponding to the i-th scale.

12. Device according to any one of the preceding paragraphs, characterized in that the scale (i+1)-th regions for the (i+1)-th files logically related to a given i-th file, represents the i-th scale, multiplied by an amount which is a function of a variable characterizing the corresponding (i+1)-th file.

13. The device according to claim 1, characterized in that the scale is chosen in such a way that they decrease with i, in accordance with a given communication so that regardless of n, the total area of the display areas defined in the display area does not exceed a specified amount.

14. Device according to any one of the preceding paragraphs, characterized in that the (i+1)-th region (i+1) files that are logically related to the i-th file, spatially positioned relative to each other at an angle specified by the rule, this rule depends on i.

15. Device according to any one of the preceding paragraphs, characterized in that the first file is a data file that corresponds to the current location of the viewer user.

16. The device according to item 15, wherein steps (i) and (ii) are performed when the current IU is confortini viewer user.

17. Device according to any one of the preceding paragraphs, characterized in that it uses at least one criterion for the identification of subgroups (i+1)-th regions that are logically related to the i-th file, and do not display region identified by the (i+1)-th files.

18. The device according to 17, characterized in that at least one criterion is that the identified file is already represented on the map or the logical connection identified file to another data file, from which it logically follows, that is already displayed on the map.

19. The device according to 17, characterized in that at least one criterion is that if (i+1)-x files there are more than a predefined number M appears only M (i+1)-th regions respectively representing only M of all (i+1)-th files.

20. The device according to claim 1, wherein the graphical characteristics of the at least one region correspond to the characteristics of the file represented by the given scope.

21. The device according to claim 1, characterized in that for i=1,...n (i+1)-th region (i+1)-th files logically related to the i-th file, spatially arranged in a two-dimensional form, in accordance with the i-th area for the i-th file.

22. The device according to claim 1, characterized in that the (i+1)-th region have the largest size within the limitations given certain size is ω and the location.

23. The device according to claim 1, characterized in that the input means allows the user to change the rules that define the graphical characteristics of the regions and/or their size, and/or their location within the display area.

24. The device according to claim 1, characterized in that it contains a tool to create a second map including areas, respectively, representing (i+1)-th region of the selected i-th field, and the data field have the relative positions corresponding to relative positions (i+1)-th regions.

25. Device according to any one of claims 1 to 23, characterized in that it contains a tool to create a second map and the logical connection between the i-th file, and (i+1)-mi files of the second card are different from the logical connections between the i-th file, and (i+1)-mi files first card.

26. The device according to p. 25, wherein the logical links between files of the second card are in reverse form logical links between files on the first map.

27. The device according to claim 1, characterized in that the (i+1)-th region (i+1)-th files logically related to the i-th file, located inside the i-th region for the i-th file.

28. The device according to claim 1, characterized in that the first region for the i-th file has a periphery and (i+1)-th region (i+1)-th files logically related to the i-th file are located near the periphery of the i-th region for the i-th file.

29. The device according to claim 1, otlichayushiesya, what i-I the region corresponding to the i-th file has a center and (i+1)-th region (i+1)-th files logically related to the i-th file are located around the center of the i-th region.

30. The device according to claim 1, characterized in that the (i+1)-th region (i+1)-th files logically related to the i-th file are relative to the i-th field in the regulations, depending on the number (i+1)-th files.

31. The device according to claim 1, characterized in that it includes display areas in the display area.

32. The device according to claim 1, characterized in that at least some (i+1)-th region (i+1)-x files associated with i-th file, combined.

33. The device according to claim 1, characterized in that when a region is the open file represented by the region.

34. The device according to claim 1, characterized in that the (i+1)-th region respectively represent one or more (i+1)-th files which are hierarchically dominated by or subject to the i-th file, so that the areas corresponding to dominant and subordinate files simultaneously available for selection.

35. The device according to claim 1, characterized in that it contains means of change of scale, which when re-executing the steps (i) and (ii)using as a first file corresponding to the selected area, changes the scale associated with the selected area.

36. The device according to p, characterized in that the change of the scale VK is uchet the scale, associated with the selected area.

37. The device according to p, characterized in that it contains the means of establishing the size of the selected region on the size of the largest region, which when re-executing the steps (i) and (ii)using, as a first file corresponding to the selected area, sets the size of the selected area on the size of the largest region.

38. The device establishing logical relationships between multiple segments of one or more data files containing

(a) display device having a display area,

(b) at least one tool

(i) determining for the first segment of the first region, with the possibility of choice in the display area and one or more second regions, with a choice of specified second region, respectively, represent one or more second segments that are logically associated with the first segment, and spatially related to the first area, the second area are determined in accordance with the first scale; and

(ii) for each i-th segment, where i=2, ..., n, (n-1) further steps of determining one or more (i+1)-th regions, with the choice specified (i+1)-th regions, respectively, represent one or more (i+1)-th segments that are logically related to the i-th segment, and space of the public related to the i-th region, the (i+1)-th field are determined in accordance with the i-th scale smaller than the (i-1)-I scale;

(c) the input tool, designed to log a user selection of one of the areas with the choice specified in the display area and corresponding to one of the segments;

the device is configured to, in response to the received selection of the area the user re-executing the steps (i) and (ii)using the first segment, the segment corresponding to the selected area.

39. The device according to § 38, characterized in that the display area is executed on a portable device.

40. The device according to § 38, characterized in that the display area is executed on the mobile phone.

41. The device establishing logical relationships between multiple data files containing

(a) display device having a display area,

(b) at least one tool

(i) determining for the first file in the first area, with the possibility of choice in the display area and one or more second regions, with a choice of specified second region, respectively, represent one or more second files logically related to the first file, and spatially related to the first area, the second area is and shall be determined in accordance with the first scale; and

(ii) for each i-th file, where i=2, ..., n, (n-1) optionally define one or more (i+1)-th regions, with the choice specified (i+1)-th regions, respectively, represent one or more (i+1)-th files logically related to the i-th file, and spatially related to the i-th region, at said (i+1)-th field are determined in accordance with i-th scale smaller than the (i-1)-I scale;

(c) the input tool, designed to log a user selection of one of the areas with the choice specified in the display area and corresponding to one of the files;

the device is made with the possibility of spatial locations to each other at an angle in accordance with a specified rule, (i+1)-th regions for the (i+1) files that are logically related to the i-th file, with the specified rule depends on i.

42. The device establishing logical relationships between multiple data files containing

(a) display device having a display area,

(b) at least one tool

(i) determining for the first file in the first area, with the possibility of choice in the display area and one or more second regions, with a choice of specified second region, respectively, represent one or more second files, logicism is associated with the first file, and spatially related to the first area, the second area are determined in accordance with the first scale; and

(ii) for each i-th file, where i=2, ..., n, (n-1) optionally define one or more (i+1)-th regions, with the choice specified (i+1)-th regions, respectively, represent one or more (i+1)-th files logically related to the i-th file, and spatially related to the i-th region, at said (i+1)-th field are determined in accordance with i-th scale smaller than the (i-1)-I scale;

(c) the input tool, designed to log a user selection of one of the areas with the choice specified in the display area and corresponding to one of the files;

the device is made with the possibility of spatial location in two-dimensional form in accordance with the i-th area for the i-th file, (i+1)-th regions for the (i+1)-th files logically related to the i-th file, for i=1, ...n.

43. The device establishing logical relationships between multiple data files containing

(a) display device having a display area,

(b) at least one tool

(i) determining for the first file in the first area, with the possibility of choice in the display area and one or more second regions, with the possibility of choice is, these second regions, respectively, represent one or more second files logically related to the first file, and spatially related to the first area, the second area are determined in accordance with the first scale; and

(ii) for each i-th file, where i=2, ..., n, (n-1) optionally define one or more (i+1)-th regions, with the choice specified (i+1)-th regions, respectively, represent one or more (i+1)-th files logically related to the i-th file, and spatially related to the i-th region, at said (i+1)-th field are determined in accordance with i-th scale smaller than the (i-1)-I scale;

(C) the input tool, designed to log a user selection of one of the areas with the choice specified in the display area and corresponding to one of the files;

the device is made with the ability to set the center of the i-th region, corresponding to the i-th file, and the location (i+1)-th regions for the (i+1)-th files logically related to the i-th file, around the center of the i-th region.

44. The device establishing logical relationships between multiple data files containing

(a) display device having a display area,

(b) at least one tool

(i) determining for the first falabellas region, with the possibility of choice in the display area and one or more second regions, with a choice of specified second region, respectively, represent one or more second files logically related to the first file, and spatially related to the first area, the second area are determined in accordance with the first scale; and

(ii) for each i-th file, where i=2, ..., n, (n-1) optionally define one or more (i+1)-th regions, with the choice specified (i+1)-th regions, respectively, represent one or more (i+1)-th files logically related to the i-th file, and spatially related to the i-th region, at said (i+1)-th field are determined in accordance with i-th scale smaller than the (i-1)-I scale;

(C) the input tool, designed to log a user selection of one of the areas with the choice specified in the display area and corresponding to one of the files; and

includes a tool made with the possibility for the selected j-th file (where 1≤j≤n), presents one of the areas, creating additional areas for files, pre-connected logically with the j-th file, with each additional field includes data that indicates the importance of the associated file.

45. The device according to item 44,characterized in that that the choice of one of the optional fields is equivalent to selecting the area corresponding optional field.

46. The device according to item 44, wherein the pre-logical link is defined by the fact that the data files, for which see the area, are the j-th files logically related to the same (j-1)-th data file, the selected j-th data file.

47. The device according to item 44, wherein the pre-logical link is defined by the fact that the data files, for which see region are (j+1)-th files logically related to the same selected j-th data file.



 

Same patents:

FIELD: computer engineering, in particular, engineering of automated system for controlling fighting funds of national automatic system "Elections".

SUBSTANCE: system contains block for receiving input transactions, block for identification of addresses of fighting funds, block for modification of record addresses and reading data of fighting funds, block for identification of name parameters of deputy candidates, block for selection of type of financial operators, block for selection of upper limit of values of fighting funds, computing block, block for receiving data from server database, block for selecting lower limit of values of fighting funds, block for setting data dispensing modes, and block for integration of information signals.

EFFECT: increased speed of operation of system due to localization of addresses of documental data of fighting funds in database of system by identifiers of surname, name and patronymic name of deputy candidates and calculation of volumes of fighting funds directly in process of receipt of transaction data.

10 dwg

FIELD: index structure of meta-data, provided for finding information about content.

SUBSTANCE: in accordance to first variant of method, information about position is determined, key search is performed, and meta-data are extracted using found key, and in accordance to second variant of method, access to list of combinations is performed, in which meta-data key is searched for, identification information of meta-data is determined, and meta-data are extracted using found identification information. Devices for realization of these methods contain input block and control block.

EFFECT: possible fast search for information about content.

4 cl, 12 dwg, 6 tbl

FIELD: index structure of meta-data, provided for finding information about content.

SUBSTANCE: in accordance to first variant of method, a list of keys is provided, appropriate for fields of meta-data, and information about position for determining key; in accordance to second variant, section of key index list is provided, section of key index and section of key sub-index. In accordance to third variant, a list of keys and values of keys is provided, and in accordance to fourth variant, values of keys and identification information of meta-data is provided as well as list of keys.

EFFECT: provision of simplified indexation of data fragments, realization of fast search and decreased search time.

4 cl, 12 dwg, 6 tbl

FIELD: computer engineering, possible use in devices for controlling informational streams to monitor informational traffic.

SUBSTANCE: method includes preliminarily forming a base of standard informational signs, receiving informational stream, serially selecting and recording fragments of informational stream, selecting identification signs from these, comparing them to standard ones. Base of standard informational signs is formed by computing morphological coefficient d of identification sign and its address A with utilization of hash-function. For identification signs received from informational stream, morphological coefficients d and identification addresses A are additionally computed, after that on basis of computed address, identification sign selected from informational stream is compared to standard one.

EFFECT: increased information processing speed due to shorter time needed for identification of addresses of signs in base of standard informational signs.

4 cl, 2 dwg, 2 tbl

FIELD: computer engineering, in particular, informational-reference system of industrial-economical characteristics of airlifts.

SUBSTANCE: system contains two registers, data commutation block, block for selecting automated workplace of user, block for identification of type of data being requested, block for selection of viewing direction of reference data, block for commutation of synchronization signals, reverse counter, block for receiving database update files, block for identification of type of data being updated, two blocks for comparing codes.

EFFECT: increased speed of system operation due to no need for searching information across whole volume of server database.

10 dwg, 1 app

FIELD: computer science, in particular, engineering of automatic system for controlling routing of text documents in data processing network.

SUBSTANCE: system contains first, second, third, fourth, fifth and sixth registers, first and second blocks for identification of text documents, block for integration of control signals, two counters, adder, block for forming base address for recording finished documents and commutator.

EFFECT: increased speed of system operation by localizing range of data search addresses in server database by means of identifiers of text documents.

6 dwg

FIELD: computer engineering, possible use as device for structural-statistical analysis of information arrays.

SUBSTANCE: device contains generator of signals of current estimate, discriminator of zones of estimate values, distributor of impulses, counter of temporal intervals, commutator, first and second generators of search variable, first and second adding counters, first and second memory blocks, division block, classification device, register of search strategy, signals generator, timer of current day, block for generation of cutting threshold, structural analyzer and third memory block.

EFFECT: possible recognition of target determined combinations, representing n-digit binary numbers.

2 cl, 2 dwg

FIELD: engineering of automated libraries for data storage with loading, unloading and movement of data carriers.

SUBSTANCE: library contains robotized transporting device, for moving data carriers, and multiple universal sockets with means for connecting accumulators positioned in sockets or other devices to transporting device, to which commands from main computer are sent for moving data carriers. Robotized device is programmed for recognition, whether each socket is free or occupied with a certain component, such as an accumulator or command port, and following realization of appropriate communication with component occupying the socket.

EFFECT: decreased hardware costs with adjustable configuration and use of different system components.

6 cl, 5 dwg

FIELD: computer science, in particular, automated identification of data of voting sheets of voters in national automatic system "Elections".

SUBSTANCE: system contains block for receiving data from voting sheets, block for receiving records of server database, block for setting type of signatures, block for selecting supporting addresses of server database, counter of signatures number, comparators, blocks for selecting supporting addresses of signature types, blocks for modification of addresses for recording and reading signatures, block for selecting types of signatures, block for selecting number of checked signatures of voters and block for forming signals for recording and reading signatures of voters.

EFFECT: increased speed of operations due to localization of addresses of documentary data of civilians in database of system by identifiers of their surname, name and patronymic.

12 dwg

FIELD: radio engineering, possible use as mobile communication system for realizing contact with a celebrity in form of a game.

SUBSTANCE: system contains at least two receiving-transmitting personal devices, local control device, and central control device. At least one additional transmitting-receiving device of a celebrity is provided. Receiving-transmitting personal devices are made in form of mobile communication terminals of users, local control device - in form of station of mobile cell phone communications operator, and central control device - in form of a server.

EFFECT: increased efficiency, realized game effect during making of contacts.

6 cl, 3 dwg, 2 tbl

FIELD: data access technologies.

SUBSTANCE: method includes assignment of simplified network address, recording URL and converting numbers into storage system with net access, inputting assigned number into computer, transferring inputted number to storage system, converting number to URL, receiving page matching URL, and displaying it. Method for use in operation systems for message transfer include intercepting system level messages to certain objects and forming pseudonym messages during that. Systems realize said methods.

EFFECT: broader functional capabilities.

12 cl, 30 dwg

FIELD: computers.

SUBSTANCE: system has entries memory block, words memory block, control block, substitutions block, n blocks for searching and replacing.

EFFECT: broader functional capabilities.

17 dwg

FIELD: computers.

SUBSTANCE: system has nine registers, four address selectors, triggers, AND elements, OR elements and delay elements.

EFFECT: higher speed.

8 dwg

FIELD: computers.

SUBSTANCE: system has operation mode setting block, first and second blocks for selecting records addresses, block for forming addresses for reading records, data output block, first and second record codes comparison blocks, records quality comparison block, year intervals comparison block, records selection control block, register, adder and OR elements.

EFFECT: higher speed of operation.

10 dwg

FIELD: computers.

SUBSTANCE: system has memory for programs, including browser, display block, database for storing documents, addressing control block, while each document of base has at least one link with indicator of its unique number and indicator with address of program for control stored in addressing control block, system contains also, connected by data buses and control of other blocks of system, memory for links of couples of unique numbers of links and forming means for lists of unique numbers of documents links, which are interconnected.

EFFECT: higher efficiency.

2 cl, 1 dwg

FIELD: telecommunication networks.

SUBSTANCE: messages, sent by cell phones, are formed by means of printed and public-distributed classifier, wherein at least one category is made with possible detection of at least one identifier of individual mark of object, identifier is sent by sender via at least one message to computer server with software, which transfers such message into database record at server for its transfer to at least one receiver, or searches for such record in database at server in accordance to received message and transfers to sender of such message at least one found database record.

EFFECT: broader functional capabilities.

2 dwg

FIELD: web technologies.

SUBSTANCE: method for integration of printed business documents, requiring original signature, with electronic data concerning these documents and later extraction of data, inputted for forming documents, is characterized by steps for forcing end user or agent to input all necessary data for forming of required document, saving collected data in database, linking saved data to unique ID code and printing unique ID code on printed document during printing. Printed documents is signed by end user and sent together with supporting documentation. When document is received by business-client, business-client inputs ID code, which is then used for access to saved data, and updates private database of business-client with all data, used for creation of original documents.

EFFECT: higher efficiency.

2 cl, 7 dwg

FIELD: computer science.

SUBSTANCE: device has string memory block, comparator, memory block for words and substitutes, block for analysis and forming of displacement results, block for storing string address, control block.

EFFECT: broader functional capabilities, higher reliability.

10 dwg

FIELD: data bases.

SUBSTANCE: method includes presenting operations at all levels of company in form typical product life cycle tree, wherein existing objective functional-technological connections of each manufacture stage are decomposed, and forming information system in form of pertinent-relevant complex information system and search, for which typical structure-information modules of information system are formed, system objective information requirements of data consumers, being a result of decompositions by levels of operations and problems, are determined as precisely as possible, data base of found documents in form of files is formed of key nodes with set of elementary data block for each system information requirement and files of information system modules, starting from lower levels of current stage and then upwards, while each data block has a list of pertinent documents ordered by determined information requirements.

EFFECT: higher search efficiency.

13 cl, 11 dwg

FIELD: computer science.

SUBSTANCE: system has first, second, third, fourth and fifth registers, first and second memory blocks, first, second and third decoders, triggers, elements AND, OR and delay elements.

EFFECT: higher speed of operation.

1 dwg

Up!