RU2285949C2 - Methods and means for setting up connection between data files - Google Patents

Abstract

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

Description

Opening area

This discovery is associated with methods for establishing relationships between data files (or parts of a single data file), methods for 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 that displays a map of data files, in particular a device having a low resolution screen either in absolute value or in comparison with the number of data files between which communication must be established (for example, 100 or 1000 files).

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

Discussion of the previous situation

The colossal amount of information stored in the global Internet system is divided into data files, each of which has an “address”, and is stored on a computer called a “server”. One of the types of files is called a “page” and is a simple set of information. The information display format differs from page to page, for example, some pages may contain only text, while others may, for example, contain links to audio or visual files in certain places on the page. Using a program called a “viewer,” a user of the world’s Internet system can receive an image of these pages on a part of his or her monitor called a “viewer table”, for example, one page at a time. Specifically, it can be said that the user is on the Internet in a place corresponding to the location of the page from the Internet, and that he is viewing a page corresponding to his location.

Like the pages of a regular book, organized in numbered order, the pages of the world’s Internet system have certain logical relationships with each other, but the logical relationship between the pages in the world’s Internet system is much more complicated than a simple numbered sequence. The purpose of these logical relationships is to connect pages containing related information. For example, a page containing information on the first topic (say, “patents”) can be logically linked to one or more pages containing information on similar topics (for example, “patent attorneys”).

Logical relationships between pages are determined by logical connectives, known as “hyperlinks”. Hyperlinks are usually defined in a hypertext programming language (or, possibly, in a more complex presentation of content, such as a Flash or Lingo file), the type of language in which

the world’s Internet system is based (the term hypertext is usually used to include "hypertext marking language (HTML), dynamic HTML, wireless marking language (WML), Active Server Pages, etc., and the term" hyperlink "is used hereinafter to mean communication in AWT such as defined in JAVA or any other language used to represent text and interactive operations. One single page may contain one or more "hyperlinks", each of

which is associated with a part of the page (for example, a few words on this page), known as “anchor”. Hyperlinking defines the logical relationship between the “anchor” part of the page and the second page of the Internet system (or perhaps a specific place on this second page). The user can access this second page by simply positioning the cursor in the snap compartment of the image and

button clicks, such as mouse buttons. Thus, the page that he was reading is automatically replaced by the second page associated with it using hyperlink. Thus, we can say that the second pages are located at a “one-click” distance from the first page, which means that a user connected to the first page can access the second page (that is, display part or all of the information on the monitor, contained on the second page, within the table of the viewer by a single click (excluding clicks made by the user on the scroll area).

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 the corresponding hyperlink to the corresponding second page.

Of course, the second page can also have bindings, each of which leads to the corresponding third page. Thus, the third pages are at a distance that can be overcome in two clicks, namely the first transfers the user from the first to the second page (ie, changes the display of the viewer to display the second page, or represents the second page on the second program viewing the display), and a second click takes the user from the second to the third page. Hyperlinks, therefore, provide an effective way to navigate through the myriad of pages presented on the global Internet system in search of specific information by moving between pages that are logically linked using hyperlinks. Since each page can contain many links, there can be many second pages associated with each first page, and many third pages associated with every second page. In fact, the number of pages at a distance of n clicks from a given first page increases exponentially with an increase in n.

A further complication is the existence of a type of file called a “frameset”. While the pages of the Internet system can be unstructured in the sense that they consist entirely of a list of stored information, a “set of frames” has its own structure and can be understood as a file that divides the viewer table 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 into different sections. Any number of bindings can be in any of the files presented in these sections. Suppose the user uses a viewer to access the first file, which is a “frame set”, that the area of the display viewer program is divided into several sections corresponding to the number of sections in the “frame set”. When the user clicks on the anchor position inside one of the sections, this (or the other) section of the display viewer area (or perhaps the whole display viewer area or the whole new display viewer area) is replaced by a second file (for example, a page) associated with anchor position using hyperlink. However, the remainder of the display area (i.e. other sections of the “frame set”) remains visible to the user.

The global Internet system is one example of a network of computer files based on hypertext. Other examples of hypertext-based systems are other Internet systems, for some reason not classified as part of the global Internet system (for example, because they belong to a large company or government departments and are not accessible to the public), the so-called . Intranet systems, or any other system that uses a hypertext language (such as HTML or Dynamic HTML) to determine and allow movement between files. These systems, in turn, are examples of so-called "hyperspaces", i.e. a set of data files, each with its own name or address, and these sets of files have logical connections with other members of this set.

For example, the usual directory structure is an example of hyperspace. The directory structure consists of two types of data files: a) data files referred to in this text as “branch nodes” containing (usually only containing) logical connections by other data files, and b) data files referred to in this text as “edge nodes” containing information but not bundles with other data files in hyperspace. An empty directory is an example of a "boundary node", just like a text file, a picture file, a video file or an audio file, and not an empty directory is an example of a "branch node".

Such a logically related set of data files can be a pure hierarchy (tree structure). This means that one directory (the "root directory") is for the very top of the hierarchy. The maximum number of logical hyperlinks for each directory is one (although the directory itself can have any number of logical links to other data files), and each data file (including all directories) can be reached through the root directory along one path, through a series of the logical links described above. Data files that can be accessed through one logical connective from this directory are considered to be "in" the directory. In this text, we will refer to a data file that can be accessed through the highest directory by following i logical connectives as being at the (i + 1) level (the root directory is the first level).

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

In the usual way of navigating a hierarchy of data files (for example, Microsoft Windows or Microsoft Explorer), a separate data file (for example, an edge node) can be accessed through the logical relationship path from the root directory, for example, through one or more intermediate directories, for example, using the following procedure . Starting from the root directory (or from any other starting position), a symbol in the root directory is displayed for each data file. These characters are shown highlighted in a column. The user clicks on the symbol representing the intermediate directory, which is located on the path to the data file that he wants to open. Then the process repeats, only now the intermediate directory replaces the highest. To access the file at the (i + 1) -th level, i clicks are required. The last one is on the symbol denoting the data file that the user wants to reach.

During the implementation of this process, the user sees only a symbol representing a specific file if this file is located in one of the intermediate directories on the path. Thus, the user is actually not able to get an idea of the general form of the directory structure, for example, whether the leaves (leaf nodes) are evenly distributed across the directory. In other words, this navigation tool is not suitable for visualizing the directory structure.

To solve the problem of visualizing the hierarchical structure of the directory, Brian Johnson and Ben Schneiderman ("Tree Maps" Space-Filling Approach to Visualizing the Hierarchical Information Structure ", Materials of the Annual Visualization Conference, San Diego, pp. 284-291, IEEE, 1991) proposed creating a two-dimensional A diagram depicting data files in a directory. Each of the data files is represented in the diagram as a rectangle; rectangles representing data files in a specific directory are drawn directly inside. the rectangle representing this directory (i.e., the nest corresponds to the hierarchy), in the same row or column, and in the case of leaf nodes, all the rectangles are depicted with the same shape and area.

In a regular-sized directory structure of, say, 3,000 files (possibly at 20 levels), the areas representing the leaves (leaf nodes) become very small. Therefore, since this document focuses only on visualizing the distribution of leaf nodes, Johnson and Schneiderman recommend that the rectangles symbolizing data files in any directory be sized to completely cover the rectangle symbolizing the directory. Thus, the proposed diagram contains only areas representing leaf files. Thus, in the case of a typical directory structure (in which most of the leaves are located at a distance of several ligaments from the highest directory), the result is a diagram consisting of a myriad of tiny rectangles (shown in Fig. 8 of this document, in the case of a directory of 1000 files). Despite the complexity of this picture, it is possible to quickly derive statistical information about the distribution of leaves in the information structure from it.

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

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

John Lamping and Ramana Rao ("Hyperbolic Viewer: A Focus and Contextual Method for Visualizing Large Hierarchies", Journal of Visual Languages and Computerization, 1996, 7, 33-35) offer a fundamentally different way of visualizing a hierarchical structure in which directory data files are represented in small areas that do not intersect, and the logical connections between them using lines. Small regions are laid out on a hyperbolic area transferred to the display area to lead to a disturbed image called a fisheye. The user can choose to establish links between the hyperbolic display and the display area in order to make it possible to visualize the branches of the hierarchy, but again in this case there is no exact correspondence between the first and second diagrams. The angles between the branches change as the user focuses on different areas of the map.

Neither document describes the use of the chart for purposes other than visualization. None of the documents offers a scheme that can be applied to extend to hyperspaces that are not hierarchical. Thus, neither one nor the other document offers a method well suited for establishing links between pages of the Internet system, which is more a network of information than a hierarchy.

Further, in both cases, the proposed diagram is necessarily very complex, and because of this, it requires the device display to have a high resolution and a screen high enough to reflect the details. A “tree map” requires that the regions be displayed on a scale depending on the number of directory levels, and in the type of directory for which the tree map is proposed, this can mean that even the largest region is much smaller than one twentieth of the image area, then as the smallest area can be significantly less than one thousandth of the image area. Similarly, a hyperbolic map requires that thin lines be used to display ligaments.

SUMMARY OF THE INVENTION

The present invention seeks to provide a new way of displaying relationships between data files of various kinds.

It preferably seeks to provide a method for establishing logical relationships between data files that can be used in a device with a limited resolution image (for example, a low number of pixels in each direction relative to the number of files between which links need to be established).

It further attempts to preferably present devices that allow image acquisition and / or navigation of relationships between data files.

It further attempts to preferably provide a mechanism for accessing various levels of limited information about files (for example, headers), which allows the user to gain an idea of the importance of a given file before it is opened.

In a broader sense, this invention provides, for a first given file (for example, a given viewer file), depicting (for example, on a screen) an image including characters representing second files at the click of a button and, at or near a symbol for every second file, the next character representing the third file (two clicks from the first file). This display can be generalized to go beyond the third files (two clicks from the first) and include files located at a distance of any number of clicks (for example, a given number of clicks) from the first file. At any level, files that are logically associated with a given file can be represented by further symbols (for example, a smaller size) inside or around the symbol of a given file. The display can be used to navigate between data files, allowing the user to open one of the data files (i.e., get information from the data file).

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

steps, for the first file, in the display area showing the first region and one or more second regions, wherein said second regions respectively represent one or more second files logically associated with the first file and spatially related to the first region, and the sizes of the data of the second regions correspond to the first distance scale, and for a given value n (n-1) of further steps, i = 2, ..., n, from, for or / of each ith file representing one or more (i + n) -x regions, moreover, the indicated (i + 1) -e regions represent Specifically, one or more (i + 1) -th files that are logically connected with the i-th file, and being spatially related to the I region, representing this i-th file, the sizes of the indicated (i + 1) -th regions, are, in accordance with the i-th distance scale, smaller in size than the (i-1) -th distance scale. Hyperlinks in this case are preferable hypertext links.

The value of n can be the smallest and equal to 2, but it is desirable that it be greater (for example, at least 3, at least 4, or at least 10), and can be infinitely large. n may depend on one or more factors: 1) the resolution of the user’s screen, 2) the computer resources available to create the display, 3) the number of files within a certain number of clicks from the first file, or 4) the choice of the user.

The preferred case is when the card has a certain value n specified by the user, and then the user has the opportunity to increase n by 1, so that the map changes in accordance with the first aspect of the invention to take into account this new value n, thus including files still at a distance one logical bundle 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 a screen that has very small capabilities. The preferred display characteristics are indicated below, which further improve the potential of the communication method, especially in the specific technical case of having a display of limited technical capabilities (either in absolute or relative scale).

The “size” of a region may be, for example, the extent of the region in a given direction. The length of one or more (or all) regions can be almost equal in two orthogonal directions, in which case the “size” can be the length in either direction. It may also be the area of a region.

Data files can be part of the hyperspace of data files. For example, data files and the logical relationships between them can be (hierarchical or tree-like) directory structures; in this case, the logical relationships between the data files may be bundles of the 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 (countable) and can be at least 30, at least 100, at least 500, at least 1000, or at least 2000.

Alternatively, the data files may be Internet system files. In this case, the total number of data files, if n is very large, is practically impossible to calculate.

Alternatively, the data file may be part of any other hyperspace that is not (or is not necessarily) a hierarchy, such as the internal network of a large company or government department. For example, data files can be hyperlinked data files (preferably hypertext links), which are logical relationships.

The plurality of files is preferably provided on a plurality of network sites (i.e., on a plurality of regions of the Internet). Files can, for example, include files of the global Internet system provided on different sites by spatially separated servers.

Logical relationships can be any logical relationships (for example, determining the structure of a tree or an approximate tree structure). They can also be logical relationships (pre) defined by the user or automatically, for example, based on the meaning of the files.

Logical relationships are preferably of any type or types suitable for defining hyperspace. Thus, the logical relationships between files can be (or at least include) hyperlinks (preferably hypertext links) and, in addition, can be links between frames and the file (s) they represent. More preferably, the logical relationships are such that each i-th file and its one or more (I + 1) -th files are such that each (i + 1) -th file can be accessed by the i-th file with one click. That is, they are associated with the ith file with one hyperlink.

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

Please note that the i-th distance scale may differ for different i, for example, depending on the number of (i + 1) -x files. For example, in the case where there are a large number of (i + 1) -th files logically connected with this i-th file, the i-th distance scale can be small, for example, such that there is a space for representing all (i + 1 ) x files.

Now we will define some important terms: for a given data file, its “parent” files are all files (for example, on a specific card) from which it can be reached with one logical link (for example, with one click), while its files “ ancestors ”- these are all files (for example, on a specific map) from which it can be accessed through any number of logical steps. His “brothers” files are files with which he has at least one common “parent”. His “children” files are the files to which he is the parent. His “heirs” files are files for which he is the ancestor.

For any card created in accordance with the opening (in any of its aspects), the “source” of the data card is the file from which the distance in clicks is measured (for example, the “root” directory of the directory structure, or, in some of the guises location of the viewer). A “base” is defined with respect to a specific map and is equivalent to the first open file. “Focus” is the user's current location within the map. “Highlighted” is the area, mark or other identifying means currently highlighted or provided for immediate selection 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 regions for all files located at a distance of n clicks from the first file. For example, if there are a large number of (i + 1) -x files logically associated with this i-th file, and each of the (i + 1) -regions is small (for example, less than a given value), (i + 2 ) -e files logically associated with these (i + 1) -th files may not be displayed on the screen.

Thus, this is a possible criterion for some files not to be submitted. Another possible criterion is that if the same file is presented more than once (since it can be reached from the first file in more than one path), then all references except one can be released. Otherwise, regions representing “children” may be omitted from all but one of the representations (ie, the criterion for omitting a file is that: 1) the file will be shown elsewhere and that 2) the “parent” will be presented more than once).

Note that logical relationships are preferable to those that come from the same directory. That is, even if the first file is logically linked to the second file, this does not mean that the second file is logically linked to the first. An example of such a relationship is hyperlinking.

The concept of establishing links between data files linked by hyperlinks (and thus might not be part of the hierarchical structure of the directory) constitutes an independent second aspect of the invention.

According to this second aspect of the invention, the invention provides a method for establishing hyperlink relationships between a plurality of data files, consisting of:

steps, for the first file, in the region of the image displaying the first region and one or more second regions, said second regions correspondingly representing one or more second files that are accessible from the i-th file via a hyperlink and are spatially linked to the first region; wherein the dimensions of said second region correspond to a first spatial scale; and

(n-1) further steps, i = 2, ... n, from, for or each i-th file expressing one or more (i + 1) -th regions data (i + 1) -e regions respectively represent one more (i + 1) -x files accessible via the i-th file using hyperlink to the i-th file and being spatially linked to this i-th file, and the sizes of the mentioned regions correspond to a distance scale less than (i-1) distance scale. Hyperlinks are preferably hypertext links.

The term “file”, as used in this text, includes a “set of frames”. If the file is a set of frames, then the region that the file represents preferably indicates this. For example, if the 1st file is a set of frames divided into sections j (numbered here as k = 1, ... j), then the i-th region representing the i-th file is preferably represented divided into j sections, designated here as k = 1, ... j, (i + 1) regions are then depicted accordingly, so that (i + 1) regions representing these files associated with the i-th file using the bindings, inside the k-th section i-th file, are located inside the k-th section of the i-th region.

A further alternative is that logical relationships may not be predetermined (for example, by hyperlinks), but depend on the meaning of the files (for example, a dictionary), and are even selected by the user. For example, if the information stored in the files relates to companies or their employees, then the user could designate the rule in such a way that:

"A secondary data file is logically linked to the first data file if and only if the first file represents the employee, the second company in which he worked in the past, or the first represents the company, and the second the employee currently working in it."

The concept of determining (or overriding) logical relationships constitutes the third independent aspect of the invention, which is a method for establishing logical relationships between a plurality of data files, consisting of:

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

steps, for the first file, in the display area, where the first region representing this i-th file is displayed, and one or more secondary regions, said second regions respectively represent one or more second files and spatially associated with the first region; and

(n-1) further steps, i = 2, ..., n, from, for or each i-th file representing one or more (i + 1) -x regions, and these (i + 1) regions, respectively represent one or more (i + 1) -th files logically associated with the i-th file and spatially related to the i-th region. It is desirable that in this third aspect of the invention, the second regions are in accordance with the first distance scale (for example, the dimensions of the spatial relationships correspond to the first distance scale), and all the mentioned (i + 1) -e regions of the i-th region are depicted in accordance with the i-th distance scale is less than the (i-1) -th distance scale (i.e. the dimensions or spatial relationships correspond to the i-th distance scale).

The user can in addition choose logical relationships from among the given alternatives.

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

Now we turn to a discussion of some of the geometric characteristics of the map, which have important technical implications and are 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 the fact that the image grows to a value larger than the user's screen, the distance scale should be reduced accordingly. For example, the distance scale can optionally be reduced in such a way that the entire area of the map is limited, by which we mean that, no matter how large the value of n, the total display area never exceeds a predetermined value. This is the preferred feature of the cards produced by the method of the invention.

As an example of a limited map, the 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 than (for example, half) the area of the i-th region representing i- th file.

In this case, (i + 1) regions for each i-th file may not intersect and fit completely into the i-th region representing the i-th file. However, this is not the only possibility: for example, (i + 1) regions for each i-th file can be organized so that they concentrate 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 have a form resembling a fractal shape, which means that it has an increasingly detailed (scaled) structure (the number ix of regions increasing from i) to an ever-decreasing distance scale (a value, for example , in the middle i-th region). For a sufficiently high value of n, each file accessible by clicking through the Internet will be represented by one or more regions on a fractal display.

For example, as described above, if (i + 1) -th regions for each i-th file are always inside the i-th region representing this i-th file, a map will be created entirely inside this first region, and the general the area covered by the regions (for example, the sum of all points inside at least one of the regions) is equal to the area of the first region. This situation is true, regardless of the value of n and how many regions exist for each value of i.

This feature, the fact that the total area occupied by the map regions does not depend on the value of n, is hereinafter referred to as “intensity”. Any map on which the total area occupied by the regions of the map (i.e., the total area inside at least one region) is independent of n (at least for n, a larger specific value, in this case, n = 1 ), hereinafter referred to as "intense."

For each i-th file, the (i + 1) -e regions are preferably not intersected with each other and their areas are preferably equal to each other, but the (i + 1) -e regions for the first i-th file may be different from ( i + 1) of the region of the second file. More generally, the i-e distance scales may be different for different i-x regions. For example, if there are 20 files at a click distance from the first i-th file, then the area of 20 (i + 1) -th regions of the first i-th file may be less than, for example, half of the area of 10 (i + 1) regions of the second i-th file. More generally, the areas of each of the (i + 1) -th regions for the i-th file are preferably chosen so as to be smaller than the area of the i-th region, which represents the i-th file in a proportion that depends in a given way on the number (i + 1) regions for this i-th file. For example, if (i + 1) -e regions for a given i-th file are inside the corresponding i-th region, then (i + 1) regions can be as large as possible within the limits of a given size and organization rules.

Further, it is possible that the (i + 1) -th regions associated with this ith region may be of identical size or different sizes (for example, to indicate the number of visits), but determined in accordance with one and the same the same distance scale. For example, the corresponding sizes (for example, diameters) of the regions of the (i + 1) -th regions of a given i-th file can be defined as the i-th distance scale multiplied by a value that is a function of the 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 organized along a path (for example, inside the corresponding i-th region) that continues (for example, the path is independent of the number of displayed (i + 1) regions) and is closed, or a discrete path (for example, for each possible number of (i + 1) regions up to the maximum value there is a given organization of this number (i + 1) regions). For example, in some values, some or all regions may have the shape of a circle, and in this case, the (i + 1) -th regions can be circular regions organized around the inner periphery of the circular ith region, in contact with the outer side of the ith region and with each (i + 1) th region that is in contact with or adjacent to two neighboring (i + 1) th regions. This description is an example of a closed continued path.

Property associated with, but logically different from, the organization of regions (described above) is referred to in this text as "angular invariance" and is the preferred feature of all maps created in accordance with the invention. “Angular invariance” means that for all i (or at least for i within certain limits) the organization of (i + 1) -th regions is a spatial relationship with the corresponding i-th region, independent of the quantity i (if not taken into distance scale attention). This trait means that if the linking map is redrawn using a data file that is different from the first file at the location of the first file, the result will be a second map, which is (for example, a significant) increase in the portion of the first map corresponding to the first file.

For example, suppose the first map includes a second region (representing file “A”) and that there are a number of files “B” that are logically linked to file “A” and thus are depicted as third regions on the first map. If the map is drawn again, taking “file A” as the first data file, then the spatial relationship of the new second regions (ie, the regions representing files B) is equivalent to the spatial ratio of the regions representing files B on the first map. Similarly, the fourth regions on the first map, representing files logically associated with files B, are transformed into the third regions of the second map, preserving their relative spatial organization and / or appearance. And so on. Summing up, the part of the first map, which is the second region representing file A, and all (or most) of the files spatially associated with them are expanded, but without changing the relative organization. Thus, although the size of the regions correspondingly representing files B varies and the distance between these regions changes accordingly, the angular relationships between them (and preferably also between them and the region representing file A) do not change.

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

The method of angular invariance (especially in the case of direction invariance) has the technical advantage that when redrawing a map, starting with a certain heir, he redraws this region and its heirs in the same way (i.e. significantly), what they would be if would be part of the original map covering the region, and its derivatives would simply be increased (in scale). This prevents the user of the card from being disoriented by the transformation.

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

steps for the first file, in the area of the display showing the first region and one or more second regions, wherein said second regions respectively represent one or more second files logically associated with the first file, being spatially organized in a two-dimensional formation with respect to the first region and spatially organized with respect to each other at an angle defined by the rule and (i-1) further steps, i = 2, ..., n, from, for or each i-th file pointing to one or more (i + 1 ) -x regions, moreover, mentioned (i + 1) -e regions represent, respectively, one or more (i + 1) -x files logically associated with the i-th file and spatially organized in a two-dimensional format with respect to the i-th region, and being spatially distributed in relation to each other at an angle calculated according to the mentioned rule.

It is preferable that the rule be defined in relation to a given direction on the map, and the relative angular locations of (i + 1) -x regions with respect to the given directions on the map are generally independent of i (while the map is directionally invariant).

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

steps, for the first file, in the display area showing the first region and one or more second regions, said second regions respectively represent one or more second files that are logically interconnected with the first file, spatially organized with respect to the first region, the second regions are drawn in accordance with the first distance scale, but their relative orientation does not depend on the first distance scale; and

(n-1) further steps, i = 2, ..., n, from, for 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 logically associated with the i-th file and spatially organized with respect to the i-th region representing this i-th file, the mentioned second regions, for example, in accordance with i- The ith distance scale is smaller than the (i-1) distance distance scale, but their relative orientation is mostly independent of the ith distance scale.

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

Note that to determine the angular relationships between the two regions, it is clear and unequivocal that the definition of the “starting” point in each region and the setting that the angular relationships in each region are used to indicate the angular relationships between the corresponding “starting” points. The "starting point" can be unambiguously determined by any of a number of methods, 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 defined by the position of the region (for example, the bottom left corner). Note that the concept of two-dimensional regions can also be defined as such in which not all centers of the regions are located on a straight line on the map.

Further preferred features of the map (in any aspect) are that:

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

2) children (and in addition, in order of preference, “parents”, “ancestors”, “children” and / or “descendants”) of the region representing this file do not change their shape when redrawing the map, except in a situation in which 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 deleted from the directory or network, as well as in the case of any of the cards described below for which it is possible to redraw the map without representing a specific file .

3) “children” ((i + 1) -e files) of at least most or each of ix files are laid along an ongoing closed path (for example, a closed loop around the periphery of the i-th region) or sequentially on a finite number of specified ordered positions ( for example, positions corresponding to keys 1 through 9 on a standard 3 × 3 numeric keypad). This is a highly preferred feature of cards designed in accordance with the invention.

4) the map area representing the given i-th region (excluding the total areas representing all its “children” and “descendants”) is at least half larger than, preferably at least the same size (for example, at least twice as much), the area representing any of the “children” and “descendants” of this child (“perspective”).

This feature makes it easier to indicate (for example, by clicking) on any of the i-x regions at any level, and, in contrast to a tree-type map, on which the region representing this directory is usually completely filled with its “descendants”.

These four preferred conditions allow you to express the invention in alternative ways (see below) to describe the methods of creating a map so that the desired behavior above is obtained when the same method is used to create a new map (for example, starting from a different starting position, or with one or more data files added or removed from the set intended for mapping).

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

steps, for the first file, in the region of the image displaying the first region and one or more second regions, wherein said second region respectively represents one or more second files logically interconnected with the first file and, being spatially related to the first region, the sizes of the data of the second regions correspond to the first distance scale, and the form of this second region is given by the rule; and

for a given value n, (n-1) further steps i = 2, ..., n for or each i-th file representing one or more (i + 1) -x regions, the mentioned (i + 1) regions, respectively represent one or more (i + 1) -th files logically connected with the i-th file and spatially related to the i-th region representing this i-th file, the sizes of the mentioned (i + 1) x regions correspond to the i-th remote a scale smaller than the (i-1) -th distance scale, and the shape of the mentioned (i + 1) -th regions is defined by the said rule, and the said rule does not depend on i and / or the number of decree these (i + 1) -x regions.

The first of the possibilities (independence i) corresponds to morphic invariance. The second possibility (independence of the number of (i + 1) x regions) corresponds to “stability”. It is preferable that the form (to a large extent) be independent of both the number and the number of (i + 1) regions.

A method for creating a map of logical relationships between a plurality of data files, consisting of:

steps, for the first file, in the area of the display showing the first region, and, for M, an integer greater than one, and q, which is an integer in the area from 1, ... M, q of the second regions, the second regions mentioned, respectively, representing one or more second files logically associated with the first file, organized in relation to the first region, having relative angular relations in accordance with the first q positions of a given sequence of M given positions,

(n-1) subsequent steps, n = 2, ..., n from or for each i-th file, for q (i) by an integer within 1, ... M, representing q (i) (i +1) -x regions representing respectively one or more (i + 1) -x files, which are logically connected with the i-th file, being organized with respect to the i-th region, and having a relatively angular ratio in accordance with the first q (i) the positions of said sequence of predetermined positions.

This feature reduces the risk of user disorientation after redrawing the map, or when a file is added or removed from the map. This is especially applicable if the positions correspond to the location of the keys (or other means of indication) used to indicate one of the regions (for example, part of the device used to create an image in accordance with this method).

For example, it is convenient in such a device (for example, a mobile phone) that has a standard 3 × 3 numeric keypad to have M = 8 preset positions corresponding to 9 clicks on the numeric keypad (excluding 5) and the order of positions is a sequence of 1, 2, 3, 6, 9, 8, 7, 4 (i.e., clockwise along the outside 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 ix files (for example, have exactly or approximately the same diameter), this is not a mandatory feature of any aspect of the invention. On the contrary, (i + 1) -e regions representing files logically connected with different i-files can have different (and even not connected) sizes. Those. The i-th distance scale can be different for different corresponding i-x files. However, in this case also, the region of regions preferably has a limited volume, and, more preferably, the intensive nature discussed earlier.

The user may have the right to change the definition of the rules defining the shape of the region, and / or for their distribution on the display. For example, he may have a choice between circular regions and regions of any other shape, such as squares.

It is also possible that the rules of the form and / or organization of i-x regions depend on i, for example, they may differ for i = n or depend on some other factor. For example, if the regions are circular for all i to n-1, then the nth regions can be chosen so that they are complementary sectors of the corresponding (i-1) -x regions. Further, (i + 1) -e regions for different i-x files can be, respectively, of different guises.

In addition, methods may not depict regions for all (i + 1) -th files logically associated with the ith file, but may ignore some of these files, for example, according to one or more specified or redefined criteria.

For example, it is possible that a hyperlink leads from the first to the second file, and that a hyperlink from this second file leads back to the first file, so that, in a sense, the first file is also the 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 a given third file can be accessed through the first file by two clicks through two different second files. Methods in this case can depict only one third region, in or near only one of the two possible second regions. In other words, the method may include steps that determine whether the regions corresponding to the ith files (equivalent or less than the value of i) have already been displayed, and modify the display accordingly.

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

A map may include one or more (or even all) of the depicted regions that do not represent the only relevant file in the original data structure, but rather represent collections (or even collections of collections) (i + 1) -x files. For example, if there are 15 (i + 1) -x files intended to be displayed on a map according to the example above, then 7 (i + 1) regions may represent 7 of (i + 1) x files and the eighth region may represent the remaining 8 (i + 1) x files and have eight regions depicted inside it, respectively representing the 8 remaining (i + 1) files. Alternatively, as a second example, suppose that, for example, there are 64 (i + 1) x files that need to be presented, each of the 8 (i + 1) regions can alternatively represent eight of these (i + 1) files (t i.e., the first (1 + 1) th region is the first eight (i + 1) files, the second (i + 1) th region is the second 8 (i + 1) files, etc.

The user can use the display created in accordance with the invention to create a map of a part of the network that is not far from its current position (for example, to navigate within the Internet). Suppose, for example, that a user has just changed his position in his search program on a (system or network) to read this file. He possibly has the opportunity, for example, by executing a certain mouse click to initiate his terminal to perform actions according to the method of the invention described above, using a file read by the user as the first file to generate a map of files located at a distance of n clicks. This will immediately notify him of, for example, how many files are within a given number of clicks from his given location and will be able to allow him to quickly open any of them in his search program (for example, by clicking in the region of the corresponding region).

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

If the user wants to get a more detailed description, he may be able to select a specific file, for example, by moving his mouse to the display region representing this file, thereby stimulating the terminal to perform the above process of the invention, thereby creating an image using the selected file as the first . A user terminal may be arranged to also image trails (or trails) (and / or distance) between the user's location and the selected first file. For example, it can display the path (and / or distance) of the shortest possible value.

The user can mark this file, for example, in order to be able to quickly return to it in the future. This operation is similar to bookmarking a regular book. In this case, the user can mark his current location on the network, the file that is the first at the moment (i.e. the first file on which the network map currently displayed is based), or the file selected from the image by selecting relevant region. The way the region is depicted may indicate whether the file that it represents was marked in this way, for example, the marked region may be highlighted.

The above methods of expressing the invention may further include depicting the characteristics of files represented by some or all regions so as to facilitate navigation of the Internet or other file structure.

For example, regions can be displayed in a color that indicates the characteristics of the corresponding file, for example, the location of a given file, or the server that provides it.

Further, the user can call up or receive an automatic image of additional information about the file using the corresponding region, for example, by moving the mouse to this region and, possibly, in addition, performing a mouse click operation. These actions may cause the display to display information such as a file name. The user can also call up additional information, for example, by another or complex mouse operation. This more detailed information can be displayed in a part of the display outside the first region, for example, as a separate place in a frame presented to the user in another part of the screen. More detailed information may, for example, include any combination of file names, its address, summary, details of the file specification (for example, technical information, including the format of the data, say, the images that the file refers to).

Information displayed using the method of the invention, such as the availability of files that are accessible by any number of clicks, together with any characteristics of these files, can be obtained while the process of carrying out actions in accordance with the invention is ongoing (i.e., as additional method steps). Alternatively, they can be implemented in advance, for example, during the inactivity of the apparatus, so as to be available immediately upon completion of the creation of the card.

The method may include the step of storing information so that it can be called again if the user returns to this section of the network. Storage may, for example, be in a place accessible only to one user (for example, on a user's device), or in a place accessible to several users. Stored information may be collected and maintained based on the movements of one or more users or on some other basis, such as maintaining a modern page map on a particular site or those stored on one or more servers. Collection can be carried out on demand or automatically by one or more (spatially remote) devices. For example, each assembled device may reside on a server whose information it collects. In this and similar cases, there is usually a step of collecting together all the information collected by various devices.

Such stored information can be automatically removed, for example, after a certain period, if the user has not returned (or if none of the users have returned) to this area of hyperspace. Alternatively, if the user frequently visits a specific area of the network, then information regarding this section of the network may be stored so that it does not occur. If the network changes over time in this area, for example, due to the addition of an additional new file or link, the stored information can be updated or regenerated.

Although, as explained above, the feature of gradually decreasing distance scales with increasing i and the feature of limitedness of the map (and, as an additional feature, the intensity of the map) are particularly suitable for representing hyperspace, they are not necessary features of the invention. The invention can alternatively be expressed as creating a map of a set of data files defined by a given location of a user and facilitating movement between files.

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

creating a display of relationships between data files by:

steps, for the first file, in the display area depicting the first region and one or more second regions, which respectively represent one or more second files logically associated with the first file, and which are spatially related to the first region, and the dimensions of said second regions correspond to the first distance scale; and

(n-1) further steps, n = 2, ..., n from, for or each file representing one or more (i + 1) -x regions, which respectively represent one or more (i + 1) files, which are logically related to the i-th file, and which are spatially related to the i-th region representing this i-th file, the sizes of the mentioned (i + 1) regions correspond to the i-th distance scale less than (i-1) distance scale;

file selection based on the display; and moving to the selected file. Moving to this file can be accomplished by issuing instructions, for example, by clicking on the display region corresponding to the selected file.

The term "move to data file" is used in this document to indicate that the user can get at least some information about the file. For example, this involves the user registering a particular interest in a particular file, in response to which the method generates at least some amount of information about the file, such as the name or summary of the file. The term “moving” also includes “opening” a file, i.e. obtaining full information from a file (for example, together with another program). It is preferable that in all aspects of this invention, when the user is able to obtain information about this file, he or she also has the ability to open it.

If a file that stores information for interaction with the application (for example, a graphic file can contain information in such a format that the graphic file can be opened by a graphic program; the Ward file can be opened by the Ward program, etc.); “opening” involves translating the data of this data file into a combination program so that a user (or another user) can receive data in the data file through this use program.

Thus, the user can navigate to any data file. For example, if the data files have a directory structure, the user can navigate to any directory structure directory and to any leaf node. Preferably, the user is able 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 part having a plurality of areas, each of which corresponds to a corresponding map region (for example, a region for each of the (i + 1) regions logically associated with this i-th district). It is preferable that these areas have relatively geometric relationships that correspond to the relative geometric relationships of the areas they represent, but they may not have them (for example, these areas can be arranged in a column). Areas may be marked in such a way as to indicate the importance of the region concerned (for example, appropriate designations). In the case of the fifth aspect of the invention, the selection of a specific data file may be an action in relation to the corresponding region (for example, clicking on a region may open a data file represented by the region corresponding to that region).

The sixth aspect of the invention is a method for depicting the relationships between the plurality of data files, consisting, by changing the location of the user to correspond with the first file, from:

steps, for the first file, in the display area, where the first region and one or more second regions are displayed, which respectively represent one or more second files logically associated with the first file, and which are spatially related to the first region; and

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

Thus, the display can be “automatically” updated as the user moves through hyperspace.

It is preferable that in the methods used in accordance with the 6th aspect of the invention, regions are created in accordance with the distance scale, which decreases with an increase in 1i, as described above with respect to the first and second aspects of the invention (for example, with a decrease in the size of regions and / or with a card drawn in accordance with a given value n). It is also preferable in the methods in accordance with the fifth and sixth aspects of the invention that the regions are limited (and in addition the quality of intensity) described above.

All of the methods described above may include a further step in creating a second card, for display simultaneously with the above cards. For example, if a user receives on a display a map created by the above method using a specific file as the first, then the method may include creating a second map pointing to other files associated with that specific file. In some cases, for example, if the first file was reached by selecting a file from a map created using the method described above, the second map may represent (for example, as the corresponding regions) files of that map that the user did not select.

The second map increases the dimension of the entire image. For example, the user can see along the hyperspace directions that he has not selected and / or “back” to the files with which the first file is logically linked.

Although these aspects of the invention relate to the “plurality” of files, methods in accordance with any of the above aspects of the invention may alternatively, or additionally, map relationships between the plurality of parts of one or more (eg, large) files. In this case, logical connections are the links between parts of a file. For example, if a single large file contains a diary representing a plurality of days, then the method can be used to create a map of logical relationships (cross-references) between days. In other words, although in some forms of the invention, the data files are separate (for example, electronic files provided by various respective servers and / or files connected only by logical relationships), one or more of the plurality of files referenced in the above aspects of the invention may alternatively be the relevant components of a larger data file (or files). For example, it should be understood that in the sixth aspect of the invention, the term “move between data files” should be understood as including not only movement between separate data files (for example, provided by different servers), but also data files, which are themselves parts one larger data file.

Accordingly, in a seventh aspect of the invention, there is provided a method for creating a map of the relationships between the plurality of segments of one or more data files, 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, logically associated with the first segment, and which are spatially related to the first region, and

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

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

1) i-e regions are formed on the i-th distance scale, which is more than the (i + 1) -th distance scale on which the regions (i + 1) are formed. This distance scale can characterize the size of the regions.

2) The map is such that the total area of the regions (the sum of all points contained in at least one region) is limited (i.e., less than a given value) regardless of n (and in addition is possibly intense, i.e., does not depend on n )

3) The method is used to move to part of the file, for which the user points (for example, using the mouse) to the corresponding area of the map.

Segments can, for example, represent parts of a structural element of a computer language (for example, a program) in any programming language (or presentation of content) stored in one or more data files, and logical relationships can be a conceptual structure of an element (for example, what proportion of the program “causes "What).

Although it is preferable in the context of this invention that regions are displayed on a user's screen, an alternative way is to have “sensitive” areas on the screen that are not necessarily depicted. The user can then initiate the effect by pointing to a point on the screen.

Thus, the eighth aspect of the invention is a method of moving to a data file, the data file being one of a plurality of data files connected by logical relationships, and the method consists of:

steps, for the first file, in the display area defining the first region and one or more second regions, wherein said second regions are logically connected with the first region, and the sizes of these second regions are in accordance with the first distance scale;

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

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

All features of the geometric characteristics of the regions described above with respect to other aspects of the invention are also applicable to these aspects. It is preferable that the user is provided with information notifying him of which region his mouse is pointing to at any given moment (and more preferably, he will be informed about the “parent” of this region and / or brothers / sisters and / or children, for example, as described below) so that he can quickly and easily indicate in which file he / she is interested in when he is in the region corresponding to this file.

The following three aspects of the invention share the general principle of producing further information and / or regions associated with a selected subset of files, for example children of a particular data file.

A ninth aspect of the invention provides, in general terms, that a representation (“control keyboard”) is generated by a user to indicate a set of siblings, and the user uses this representation to move to another file. As a possible complement, the representation may include information about the file brothers.

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

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

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

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

For the selected j-th data file (1 <j≤n), represented by one of the mentioned regions, generating for each of the mentioned one or more (j + 1) -x files, which are logically connected with the j-th file, corresponding to the additional region ; and

as indicated by the user that this corresponding additional region, moving to the corresponding data file.

It is preferable that each additional region provides information indicating the importance of the corresponding (j + 1) -th file.

In a tenth aspect, the invention proposes, in general terms, to use an indicator, a device for moving a map according to the above-described principle, in order to bring up an image of information about a selected subgroup of files (i.e., without the need to create a new map). This concept allows a new way to use the indicator device to move to a map-based file in accordance with the invention.

Specifically, a tenth aspect of the invention provides a method for moving to a data file by performing the following steps:

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

steps, for the first file, in the display area showing the first region and one or more second regions, which respectively represent one or more second files logically associated with the first file, and which are spatially related to the first region, and

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

according to the above, when the user controls the display device in such a way that the position inside the card is determined by the physical organization of the indicated display device, it is inside the region representing the jth data file generated for one or more data files having a given logical connection with (j) -m file of the corresponding additional region, including information indicating the value of the referenced related file.

Preferably, the predetermined logical connection is such that the associated data file is children (i.e., (j + 1) -th files of the j-th file). Alternatively, it can be all files with which the j-th file is logically connected (for example, all files: from which the j-th file can be reached with one click).

Thus, the user can point to a subgroup of files (for example, by moving the mouse pointer) and call up the display of information about these files without creating a map again. Additional regions can only be displayed for a limited period of time (for example, while the user presses a certain key).

The tenth aspect of the invention further allows a method for opening files, which is a method in accordance with the 9th aspect of the invention, further consisting of an additional step, which is that when the user gives a control signal when the position specified by the physical position of the said indicator is the position corresponding to one of the mentioned (j + 1) th files moving to the mentioned (j + 1) th file.

This may be referred to as a “sliding click”. The user first points to a position that leads to a sequence of information for the image as a subgroup of files (without redrawing the map) and then, based on this information, selects (and indicates through a pointer) one of this subgroup of files.

In an eleventh aspect, the invention provides for the creation of a map according to the invention, wherein the user can select one of the files (for example, the (n + 1) th file) and generate a map of its descendants, including those that were not previously presented (i.e. to reveal the "hidden level" of descendants).

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

generating a display of relationships between files by:

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

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

as indicated by the user on the mentioned file, j generates, for each one or more (j + 1) -th data files, logically associated with the said j-th file, and which had not been submitted before, the corresponding additional region representing the region (j + 1 )

The value of j can be, for example, equal to (n + 1), so the new hidden layer shown is one layer deeper than the deepest layer previously shown on the map. Alternatively, the (j + 1) -th files may be from previously not submitted, in accordance with any of the criteria discussed above (for example, since the number of (j + 1) -x files was higher than a given value). Additional region (s) can be represented as a continuation of the map (for example, with a decrease in the distance scale, continued to an additional level) (this feature is especially convenient if (j = n + 1), or alternatively is drawn differently, for example, as marks described above and below, carrying information on the meaning of (j + 1) -x files).

A twelfth aspect of the invention is an apparatus including image means, such as a screen, and arranged to implement a 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 may be from the category of consumer electronics, such as a portable device of any size (“micro” sizes, such as a mobile phone, “mini” sizes, such as a personal digital assistant (“PDA”), or a “macro” size, such as a portable a computer, a fixed installation, such as a personal computer, digital television, kiosk, public media or home network, in the alternative, it can be integrated as a component of a consumer information network, such as an entertainment system by plane, train, car, etc., or in relation to the world’s Internet system as side software for the server, client software, or the development of a specialized service site, further, the device can be part of, provide access to or facilitate the management of any other data collection or a network, which may, for example, be based on the operation of a physical network of equipment (satellite, telecom, cable or broadcast networks, traffic or information control systems, intran you or other private or public networks such as Reuters and data libraries such as Corbis) or may be a way to access content (for example, Internet sites, CD-ROMs, help tools), or as a component of specialized software (for example, software network, e-commerce, menus or menus of operation symbols, information analysis tools) or equipment (for example, for microchips or creating a circuit board).

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

By providing the mobile phone with a display device according to any of the methods of the invention described above, the technical utility of the mobile phone as a data transmission apparatus can be significantly improved.

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

For example, a mobile phone may have buttons arranged as a keyboard, in which case the organization of regions may correspond to the layout of the keys.

For example, if there are 9 buttons on the keyboard organized in 3 × 3 order (in addition to any other buttons that may be present), then for each i-th region up to 9 (1 + 1) -x, regions can be organized by an image corresponding to the position of the buttons (in a 3 × 3 square), or eight (i + 1) -x regions can be laid along a (for example, square) path along the periphery of the i-th region, for example, in accordance with the position of 8 out of 9 buttons . The benefit of such an organization is not limited to the case of a mobile phone: an eight-dimensional organization can also make it easier for the user to select one of the regions (files) using a mechanical data entry device, such as a (octagonal) joystick or mouse with buttons that are not necessarily part of the mobile phone. The number of buttons, thus, can be determined by the value M of the maximum number of depicted (i + 1) -x regions. If there are more than M (i + 1) files logically associated with the i-th file, then additional regions can be displayed separately (in another place) or omitted (alternatively, a symbol or symbols can be created to indicate this and even grant access to omitted files).

The thirteenth aspect of the invention is a product in the form of a computer program that can be read by a data processing device in order to initiate a data processing device to perform one of the processes described in the first, second, third, fourth, fifth, sixth, seventh, eighth, ninth, the tenth, eleventh, twelfth aspects of the invention. This product — a computer program — may be a computer program for applying one of the methods of the invention stored on a recording device, such as an electronically (or optically) readable recording device.

A “low resolution screen” can be understood as an absolute low resolution screen (for example, with no more than 500 × 500 pixels, with no more than 200 × 200 pixels, or even with no more than 100 × 100 pixels) or a low resolution screen in relation to the number of files intended to establish communication (for example, with a total number of not more than 10, 25 or 100 pixels per file).

In any of the above aspects, the method may be able to reject (i.e. not include in the card) files matching this type. For example, especially in the context of the Internet, a map can constantly ignore audio or image files, so that a long click distance can be displayed without unnecessarily complicating the map, or it can create an additional region for representing files (or containing files) of a certain (i.e. e. of a given) type.

Preferred embodiments of the invention are presented below by way of example only with reference to the accompanying drawings, in which:

figure 1 shows a screen window including a card generated by the first method in accordance with the invention;

figure 2 shows how the distance in a click can be represented as part of the window on the screen shown in figure 1;

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

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

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

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

Fig. 7 (a-c) shows the use of a card in accordance with the invention for displaying 96 files in a directory structure;

Fig. 8 (a-c) shows three methods for displaying information characterizing a data file;

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

figure 10 (a-and) shows how a mobile phone equipped with a card in figure 9, can be used to make a phone call;

11 shows how a telephone equipped with the card of FIG. 10 can be used to access the Internet;

12 shows a mobile phone in accordance with the invention;

Fig.13 shows schematically how the card for the phone in Fig.12 can be represented in accordance with the invention on a screen with a low resolution;

Fig.14 schematically shows a portion of a card in accordance with the invention;

Fig. 15 schematically shows part of another card according to the invention;

Fig.16 schematically shows part of another card according to the invention;

17 shows another card according to the invention;

Fig. 18 shows another card according to the invention;

Fig.19 shows another card according to the invention;

Fig. 20 shows another map according to the invention;

figa and 21b show the corresponding displays offered to the user, which displays the corresponding (invisible) areas of the screen shown in Fig.22; and

Fig.23 shows another device according to the invention.

Figure 1 depicts a window 1 having a name of 3, a menu bar 5, a panel 7, an image area 9 and an output area 11. The title panel 3 includes keys 12, that is, areas on the screen that respond to the corresponding possible location of the user's mouse, or another input device, so that by placing the mouse in these places and performing a click operation, the user can activate the control instruction on the device. These buttons are used for window operations, such as opening and closing windows, in the usual way. Similarly, menu 5 allows the user to switch between various actions and promotions in the usual way.

The image area 9 is shown containing a map created by the method proposed by the invention. This method begins by defining a given Internet file as the “first” file and depicting the first region 13 as a circle as large as possible with a given image area. The circle of the first region represents the first file.

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

On the display, the second files are represented by circular regions 15, 16, 17, 18. The second file 15 is a page containing two links leading respectively to two-thirds of the files, which are respectively represented on the display by circular third regions 21, 23 inside the second region 15, representing this second file. Similarly, the second file represented by the circular second region 16 contains 6 bindings, and accordingly the circle 16 contains 6 respective circular third regions 25, each of which represents one of the corresponding third regions. The second file, represented by the circular second region 17, is a “frame set” that divides the search program area into two sections. On the map, this is represented by horizontal line 29, which divides circular region 17 into two halves. One of the two sections of this frameset does not contain any bindings, while the other section contains 2 bindings leading to the corresponding third files shown on the display by circular regions 31, 33.

As mentioned above, the circular region 13 is shown to be as large as possible while remaining within the display region 9. Similarly, each of the second regions 15, 16, 17 and 18 is shown to be as large as possible, while touching the perimeter of the first circular region 13 and each friend. Similarly, the third circular regions 31, 33 within one section of the second circular region 17 are depicted as large as possible.

However, the second file, represented by the second circular region 18, contains only one binding 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 its radius. Thus, the third circular region 27 differs from the circular regions associated with the other second files in that it is not as large as possible, which corresponds to the location within the circular region 18. This means, for example, that the map fulfills the fourth numbered preferred feature described above in the description of the fourth aspect, and allows the user, for example, to select a region with one click, by positioning the mouse on the visible part of this region and clicking.

The third file, represented by 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 intersecting its diameter and one half drawn so as to create a single fourth circular region 28, while the second half of the third circular region 27 contains nine fourth circular regions 30 around its inner periphery.

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

Although this is not indicated on this diagram, any of the above regions can be of any shape (circles, ellipses, lenses, rhombuses, triangles, squares, pentagons, hexagons, etc.), they can be colored and / or shaded, blinked , move (for example, rotate) and have symbols inside the image (for example, squares or triangles) - it is possible in such a way that these symbols dominate or are the only marks depicted on the map (see Fig. 17) - in order to indicate to the server where this file is located when it was last visited, whether it was selected as the main file, whether its name and brief information about the contents were visited, whether it is protected by a password, and / or whether it is a “page” or some other type of file (for example, audio file or sheet).

One algorithm that creates the map of FIG. 1 (omitting for simplicity the possibility of having a “set of frames”), the possibility of which can be directly taken into account by an experienced person, consists of the following five steps:

1. Draw a circle (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 Internet on the page included in the first file.

3. Representing the center of the circle as the vector P, and its radius as R, if N is not equal to 1, then draw circles around the inner edge of this circle 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 having the vector position (p) is given

p = P + (Rr) cos (2πI / N) x + (Rr) sin (2πI / N) y, where x and y are parts of the vector in the x and y directions, and I (I = 1, ... N) counts 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 in turn.

5. Continue until you reach the required level of detail.

The information display 11 contains information about the first file, such as its name (inside frame 40), its address (inside frame 41), a summary (inside frame 43), and (inside frame 44) the file specification (for example, indicating whether the image of the file is on the display, or even depicted in the video).

Of course, the global Internet network contains many secure pages, in the sense that some users are not allowed access (for example, secure pages that require a password or some other form of identification). Even the directory structure within the firm may contain such pages. If the links within the page are not closed to the public, its implementation can draw a map on the basis of the information that is available, for example, the region may indicate the presence of a page without indicating the structure within this region. The way the region is depicted may indicate that this page is protected. The user can provide a password or identification form to the file embodiment, so if this user has the right to access the viewing of these files, the file can be impersonated by a site, server, etc. to receive information about the page under protection, and thus supplement the card. The impersonation may alternatively or in addition include a pre-written password or identification file in order to obtain information about any of the files that are allowed to be viewed by a given user without user intervention.

Although not shown in FIG. 1, any or all circular regions can be graphically represented, for example, by staining. This possibility is explained below in more detail in the footnote in Fig. 4.

Although, for simplicity, Fig. 1 does not depict regions located more than 3 clicks from the first file (n = 3), in other impersonations files located at a large number of clicks from the first file will be included in order to present a complex fractal picture, including a total of up to several thousand regions. This method can even be implemented continuously (continuously or incrementally) based on the sequence of linked first files in order to produce the effect of enlarging the image as the user moves around the network. Such an image can be used as a screen saver on a monitor screen.

Now, we describe one of the ways in which the window of FIG. 1 can be used. For starters, an image can be generated when you open the search program (for example, automatically, or at the command of the user) to generate a map based on this first file (such as the file that it is currently reading). Then the image is displayed inside the display area 9. This immediately tells the user how many bindings this file connects to others. Using an input device, such as a mouse, the user can point to one of the regions of this image. For example, it can move the mouse until the cursor on the screen associated with the mouse position approaches 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 near the region. By means of 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, the information in the area of the display 11 may be updated to now be based on the selected file. If the user decides that for the image of this file ("opening" this file) the user can issue an additional instruction command of this order (for example, by clicking with the mouse), then the file will be opened either as a new window on the user's screen, or as an update of the window, previously showing the first file.

A further command from the user (which may or may not be related to the very opening of the selected file) can regenerate the display based on the selected file as the first file. Or the image can be changed automatically as the user's location changes (either as the user moves above, or by entering a new address in his search program).

Another option is to mark a specific file (“bookmark”). This makes it possible to automatically return to this file later. The bookmark can be made by command through the mouse (i.e., by moving the cursor associated with the mouse so that it lies above the region representing the file to be marked and with a mouse click in the proper sequence) or in combination with one of keys 45, 47, 49, 51 located inside window 1.

A further possibility is to update the image by the user, based not on the location of the first file at the moment, but instead on the file selected (for example) from the display. The updated display may then contain an indication of the distance in clicks between the user's current location and the first file on which the image is based.

Such a display is shown in FIG. 2, which shows only the display area 9 of window 1 and on which, for simplicity, all details in the first circular region 13 were omitted. Figure 2 differs from Figure 1 in that the display area 9 is wider and includes five areas 52, 53, 54, 55, 56 (separated by horizontal lines) between the outer boundary of the display area 9 and the first circular first region 13 (each area in this case continues on both sides of circle 13. This is a demonstration that the first file on the display can be reached from the user's current location along the path through hyperspace, including 5 intermediate files (i.e. the first file on the display is at a distance 6 clicks from place user's current location).

In deciding that the first file is 6 clicks from this position, the method could search all the possible paths among the files to select the path that had the fewest clicks. For example, even if the user selects the first file on the display by creating an image based on his current location and clicking on, say, the seventh region, it is possible that the file represented by this seventh region can actually be reached in just 6 clicks from the present the user's location (for example, on a different path through hyperspace than the one the user knew about), and therefore the method created six areas (one for each of the intermediate files along the path and one for the initial file a). The user can obtain information about one of the five files by the shortest path found by this method, and / or can select and perform any of the operations that he can perform on circular regions by indicating (for example, clicks) on the corresponding region 52, 53, 54 , 55, 56. Of course, there are often several different equally short paths between the user's current position and the first file on the display, so the method can select one of them according to some criteria in order to make a single GOVERNMENTAL association between the first circle 13, a display area 9 and the corresponding files on the shortest path. An alternative is to display more than one path by the method, for example, in this case, on either side of circle 13.

Turning now to FIG. 3, a second embodiment is shown on a map created by the method of the invention. In this case, the display region is completely occupied by the square first region representing this first file. The first file is linked by bindings to three second files, which are represented by circular regions 61, 63, 65. The second file, represented by circular regions 61, contains 4 bindings to the third files, represented by third circular regions 67, which are located outside the second circular region 61 and relate to its outer periphery. The second file, represented by the second region 63, contains a set of frames dividing the second file into two parts, which are respectively indicated by sections 69, 71, of the second circular region 63. The section of the second file, represented by section 71 of the second circular region 63, contains two file bindings represented by the third circular regions 73, 75.

Figure 4 depicts a map created by the third method according to the invention. It differs from the first two methods in that the regions are square in shape, rather than round. The region of the global Internet network shown in FIG. 4 is the same as that shown in FIG. 3 (i.e., FIG. 4 is logically equivalent to FIG. 3, in addition to the color differences explained below). That is, this first file (represented by the first region, which occupies the entire display area 9) is connected by three second files (represented by square regions 76, 77, 78). The second file is represented by the second region 76, containing the four following regions 79, allocated with the maximum size in order to fill the second region 76, in addition to a small space around every third region. The second region 77 is shown divided into two parts and represents a set of frames that divides the second file into two sections, one of which contains two bindings (indicating, respectively, two-thirds of the files represented by the third region 81) and one section that does not contain any bindings. The second region 78 represents a file with five links to the third files represented by the third square region 83. Notice that the organization of the four regions 79 resembles the location of the dots on the dice, as does the organization of the region 83 inside the region 78. This is an example of a principle that may be applicable to all aspects of the invention and consists in the fact that for each number of (i + 1) -th files that can be represented by a given i-th file, the method can include the corresponding path of separate points, whose orientation along The ratio of each other and their parents determines how this number of (i + 1) -x regions should be organized within the corresponding i-th region. That is, if it is discovered that there is a certain number (for example 4) (i + 1) -x files, the method finds the corresponding path for this number (4) and displays (i + 1) -e regions in accordance with this path. As shown in FIG. 4, paths may, for example, correspond to a pattern of the location of points on the dice, or may be laid out to correspond with the numeric keypad described above.

Two types of hatching in this drawing represent colors that can actually be represented in an image created in accordance with the invention. Two possible colors may, for example, indicate which of the two servers provided the corresponding file or some degree of expected correspondence of the given file for the user's purposes.

Another part of window 1 (for example, the left panel 7, which is not shown in FIG. 4), may include a key to the meaning of these symbols. For example, for each color used for these sections, panel 7 may include a section having that color. Thus, the user can find out the color value by referring to the desired location of the panel 7 (by pointing the cursor to that place) to call up the color value indicator.

Unlike colors, different sections of the panel can be differentiated by their structure (for example, hatching, as shown in the illustration), blinking, shape, or other graphic means.

Figure 5 shows a diagram formed by the fourth method, in which each file is represented by a special section - a point (all points are of the same size), so that this diagram is not in the region of the first aspect, but, for example, in the region of the third aspect. The first file, represented by point 90, is connected by hyperlinks represented by lines 91, 92, 93, with the following three files, respectively represented by points 94, 95, 96. The second file, represented by point 95, is connected (by three hyperlinks, represented by lines 100, 101, 102) with points 97, 98, 99, which respectively represent the third files. Lines 100, 101, and 102 are each half smaller than lines 91, 92, 93. Simply put, taking into account the continuation of the diagram further than the third files, the line representing the hyperlink between each section of each (i + 1) section is longer by a constant coefficient ( in this case 2) than each line representing a hyperlink between each section (i + 1) and each section (i + 1). Of course, as the number of mouse clicks increases, the points in each section will begin to overlap with the points of (i + 1) sections logically interconnected. This problem can be solved, for example, by reducing the diameter of the points by a constant coefficient or by limiting n, as described above in relation to the first aspect (for example, the same coefficient setting the ratio of the line lengths), and increasing the distance between the mouse click and the first point 90. For simplicity, the framework system is not given in this diagram (that is, this diagram is files that are both pages and framework systems), although an experienced person can generalize this mapping to also include into it a frame system.

All schemes shown in figures 1 and 3-5 are "limited", in the sense that was discussed above. In addition, we can say that all the circuits shown in figures 1, 3 and 4 are “intensive”, i.e. no matter how far the mouse click distance between the nearest and the far file, the total area occupied by the sections remains constant (i.e., equal to the first section). In contrast, FIG. 5 shows a display that is not intense, but still limited. That is, although the display size increases as the total distance of the mouse click between the nearest and the far file increases, it remains smaller than the given final size for any number of mouse clicks. This can be understood by observing the sum of the series:

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

The display in FIG. 5 would not be limited if, for example, the branch lengths did not decrease (or did not decrease fast enough) with respect to the distance of the mouse click from the first file.

Referring to FIG. 6, FIG. 6 (a) shows a diagram formed by a method according to the invention, in which, in the context of displaying a region 9, the first section 13 represents a first file (or, for example, a context-sensitive search function), and four secondary sections , 17, 18, 19, respectively, are four files logically associated with the first file. The site is not a file; it allows the user to return to the previous system by clicking on the site. For example, section 105 may be a predefined system state that can be recreated by clicking on that section. For example, a certain state could be marked with a “bookmark” by the user, or this state was preset by programming. Although only one section 105 is shown, in another embodiment it is possible to provide multiplicity, for example, in the form of a diagram based on areas with decreasing distance scales associated with correspondingly predetermined states.

The user clicks on region 17. Then, by the method, forms the circuit in FIG. 6 (b), in which the second region 17 expands, and the third regions 107 respectively represent 28 third files obtained from the file represented by region 17. It is worth noting that although sections 107 are mainly on the same distance scale, some are ellipses and others are circles, but this is not necessary. For example, if dots (or in similar but different methods, lenses or rhombuses) were created in such a way as to allow labeling with long names within the corresponding section, then ellipsis 17 may contain only other multipoint sections 107. Insert in the lower left corner The diagram is a diagram in FIG. 6 (a) adapted to remove a portion 17 from an area around a portion 13.

Then the user clicks on one of the sections 107. The diagram is redrawn, as shown in Fig.6 (c). Section 107 is redrawn in an expanded form. Section 17 becomes the outer border of the insert, i.e. showing the history of user movements within a number of files; it can also be clicked to return to the circuit shown in FIG. 6 (b).

Then the user clicks on the site 18. The circuit is transformed, as shown in Fig.6 (b). The files presented in section 18 (the third selected section) are projected, in accordance with a predetermined logical ratio, in relation to the files presented in section 17, originally selected, to the file selected from this section as the starting point. For example, if the first selected site 17 included companies, one of which would be selected, and the second - employees, and if the logical relationship would be the one described above (“The first and second files can be logically linked only if the first represents the employee, and the second represents the company for which the first worked in the past, or the first represents the company, and the second represents the present employee for this company ”), then the sections inside the largest section 18 would represent the employees of this company, and the circles in them would be would make other companies for which they worked, etc. The insert, limited to region 17, now shows only two second sections 16, 19 adjacent to 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 inside the larger sections to redraw the diagram in which this section will be the largest or will be the starting point. Section 17 may vary to represent the main section to which the selected file belongs.

The user can also click on sections 16 or 19 to instead project the relationships between the selected file and the set of files that represent the selected section. In this case, the selected section will, as it was, be expanded, and the section that it replaces with itself will again become the section around section 13.

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

As an experienced person understands, many of the projection method options explained above are possible. For example, although, as shown earlier, the size of the sections decreases in accordance with the distance (measured by the number of clicks) between the files that they represent and the first file, this is not necessary. For example, schemes can be reduced to files with a few clicks (eg, 2 clicks), or some parts of the scheme that fall out of the image area may not be shown.

In addition, as described above, not all sections (i + 1) inside or around a given section I are necessarily of the same size or shape. For example, referring to Fig. 6 (b), this scheme can be changed so that one of the participants 107 is the largest, the neighboring section 107 is slightly smaller, the section 107 next to it is even smaller, etc., so that each of the sections 107 had a different size. A similar possibility applies to all aspects of the invention throughout the document, but size and shape options are preferably formed based on the rule (for example, how many times a file has been viewed, or a file type).

Turning to Fig. 7, we see that the method according to the invention illustrates files in a computer at about the resolution of a miniature laptop computer. The user controls this step-by-step method. First, as shown in FIG. 7 (a), a single area is visible representing the whole potential memory of the user's PC. This, like a directory, can be considered a data file. Then, FIG. 7 (b) shows computer functions (which are either data files or are adjusted based on data files). Finally, FIG. 7 (c) illustrates the hierarchical structure of the following two levels of data files, although they can be opened more or less quickly (for example, one or three levels at the same time). The diagram shown in Fig. 7 (c) is a diagram in accordance with the invention, but it includes smaller circuits, which are themselves individually produced in accordance with the invention and are opened either individually (for example, when a user points to a mouse with a mouse special area), or in groups (for example, layer by layer, as described above). Table 1 compares the opening of a file in a directory structure using a system browser, in accordance with an expanding tree-based method.

The “Windows” discussed above using the hyperbolic representation of the “Inxight” files of the directory (as mentioned above, the scientific report by John Lamping and Raman Rao discussed above, which introduced the concept of a hyperbolic scheme, does not specifically mention opening the file, but here we take into account that A variant of this technique in which clicking in a certain way on a point of a hyperbolic diagram representing a file moves to (ie, opens) this file) and using a diagram (“fractal spatial diagram”) similar to that shown in FIG. 1, i.e. in accordance with the present invention.

Table 1 Expanding Windows Tree Hyperbolic Inxight Tree Fractal spatial pattern Mouse clicks to open the deepest directory 6 four 2 Mouse clicks from the deepest rolled. to its top level 3 3 one One-Click Directory Levels one 2 4/5 * Percentage of directory opened with one click 7 17 63/80 * Maximum number of directories opened with one click 17 90 1200/9600 * characteristics - No sense of integrity - There is some sense of integrity - Great review - Requires accurate mouse clicks - The details are very fuzzy - Easy selection process * Using a sliding mouse click

The values in table 1 are calculated using a specific directory structure, which has 200 components arranged at 6 levels (the directory structure is not selected with preference for this technique). The term “sliding click” used in table 1 means that the user moves the indicator device (for example, a mouse) in a given direction until it reaches the area in which it will stimulate a change in image (for example, by opening the display panel, as described below ), and then clicks and holds the mouse button, thus fixing the display panel, and allowing the user, for example, when the display panel shows the names of children of a certain section, to select the child’s file by moving the mouse pointer to a suitable inscription of the name, or in its direction, until it is highlighted, and then release the mouse button. T.O. “Sliding mouse click” is a generalized form of mouse click movement. There is a well-known manifestation of the hyperbolic tree, in which the user can make such dragging movements with the mouse, but this causes a continuous redrawing of the entire scheme from a changing point of view until the mouse button is released. In contrast, the sliding mouse clicks described earlier relate to a click movement of the mouse that brings up information adjacent to or superimposed on parts of a non-changing circuit, and the second click movement of the mouse is subsequently performed, for example, to open a file corresponding to the area.

Files to which this invention is applied in all its aspects can be classified in various ways. The first classification is “local versus network”, in which local files are files inside one device (or a number of spatially close devices), and network files stored in more distant locations, for example, included in the network via telecommunications. Another possible classification is “content versus functionality”, where “content” files are files in which the content itself is displayed to the user, and “functional files” are files containing programs for performing the function. Thus, the help file in the user's PC is a local content file (the user reads the text in the help file to understand the function of the PC); A web site showing article prices is a network content file (the user has access to the file server to read the content); the software driver in the PC for controlling the printer is a local function file; the application program stored on the Web site is a network function file. Another example of a network content file may be a file relating, for example, to modern open connections formed by equipment operating on a network, for example, a switching communication line.

In many aspects of the method described above, since the distance scale decreases gradually (for example, with increasing distance from the first page), the areas representing files I decrease with increasing I and therefore are more difficult to see. As described above, the user can redraw this diagram, starting with the new data file as the first data file, to increase the distance scale. However, there are other methods that allow the user to better understand the meaning of small sections.

The first possibility is to allow the user to increase part of the scheme (i.e., the main base scheme is not drawn again, but a new scheme is drawn, which is created either simply by increasing the part of the scheme selected by the user, or by creating a new scheme, applying a certain number method to the file levels selected by the user (eg, by mouse), on top of the main scheme, for example, aligned with the center of the mouse pointer, the center of the selected area, or at another point). For example, a user can define an area (“lens”) in a diagram, which is then displayed as if it was visible through the lens on an enlarged distance scale. Note that the lens and other magnifications may be accompanied by a sliding click, and / or a mechanism that allows successive magnifications without redrawing the base circuit.

Another possibility (which can be combined with the first) is when sections (I + I) of section I are represented respectively by areas in another part of the display, with corresponding positions related to the corresponding positions of sections I + I, as shown in Fig. 10 (g) , eg. This is called "excellent magnification."

In addition to this, selecting one of these sections (eg, by mouse, or by pressing a key) has the same function as selecting the corresponding section in the diagram. In this case, this part of the circuit is referred to as a “control panel”.

Fig. 8 shows a variety of alternative (or additional) methods to explain to a user the meaning (eg, name) of data files in a diagram in accordance with the invention. In Fig. 8 (a), the meaning of the data files is indicated by “pictograms” (upper and lower case letters shown in the illustration, although other symbols may be used, of course). The icons for the I + I files shown inside the file I can only become visible (it is also possible that the icon representing the file can completely disappear, as shown), when the user somehow highlights this file I, for example, by mouse. This is called a “thumbnail trace” and can help the user focus on a suitable part of the circuit.

Fig. 8 (b) shows the meaning of data files using a separate display panel. As for the file that the user is interested in (the 4th file highlighted by the arrow), the display gives the name (“humanities”) of the 3rd file, which is logically associated with the 4th file, and all nine of the 4 files, associated with this 3rd file. Of these, the name of the 4th file that the user is interested in (“book sellers”) is highlighted. This selection can also be shown using a line from the portion of the diagram that is currently selected 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 the scheme and the display panel may have a color code, for example, to additionally associate all 4 sections with their names.

Fig. 8 (c) shows an alternative method when information (eg, names, as shown) regarding the respective data files is generated in separate areas that are connected by lines to the corresponding areas and drawn on top of the main circuit. The location of the plots can be determined 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, moving to the desired file. In addition, the other two methods can be used along with the sliding click technique described above.

As previously mentioned in all the schemes, in accordance with the invention, when a section can be reached from (e.g. logically connected by an arbitrary number of steps) of the first file in two or more ways, this can be represented only by single sections (showing one possible path), and sections that show other paths may be skipped. Alternatively, more than one such patch may be drawn for this file. In the latter case, (i) the descendant nodes of this file can be drawn only on one of the plots or more than one, and / or (ii) when the user points to one such plot (eg, moving the mouse over it), plots, representing a single file, they can be highlighted, inserted into the scheme, have their own descendant nodes drawn inside them, and / or have some or all of the specified parent sections (even if a copy of the specific section in question is not drawn). Thus, the network rather than the hierarchical nature of the logical connections can be clarified to the user.

The circuit can display (eg, using a separate display panel) information regarding data files for which the value of I is greater than n (i.e., those data files that are not represented in the scheme of the invention). For example, a user may have the ability to display information regarding data files for which I = n + 1, for example, by placing a mouse on a file in which I = n. This layer I is generally referred to as the “invisible layer”.

9-12 relate to a mobile phone device, including a “display 200”.

In most telephone device controls, the display displays standard information, but the mobile phone has at least one use method (shown in FIG. 12), in which the “display 200” includes a circuit 202 made in accordance with the invention.

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

The detailed structure of the fractal spatial scheme 202 includes a number of distance scales, and on each scale, the scheme is a 3 × 3 grid. This is especially convenient since the configuration of the digits from 1 to 9 on the handset is also a 3 × 3 grid. That is, with those use methods, when the user selects an object based on the fractal spatial scheme 202, he can do this on any distance scale by pressing the key of that part of the additional numeric keypad that manages the numbers from 1 to 9.

This display also shows “abbreviations” (“system” and “cancel”), i.e. functions that can be controlled by pressing other keys. In this case, both the “system” and “cancel” functions are controlled by pressing the upper two keys of the numeric keypad. With their help, a second command grid may also appear instead of the first, and the first, in turn, can be replaced, for example, by an enlarged version of the selected section of the circuit 202.

Fig.9 shows a diagram made in accordance with the invention, which can be used as a fractal spatial scheme 202 (Fig.12). As will be shown below, it has several distance scales, the largest of which is the width of Fig. 9. The other distance scale (or “the first distance scale”) is slightly less than one third of it and is the distance scale on which eight second sections are drawn - 204, 206, 208, 210, 212, 214, 216 and 218 (i.e. this distance scale - the horizontal length of these sections).

On the smaller “second distance scale” three sections are drawn - 220, 222, 224 (for example), and it represents about one third of the first distance scale. On the "Third distance scale", which is approximately one third of the second, the fourth sections are drawn - 226, etc.

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

Also, for example, there are only four 3 data files logically linked to the 2nd represented by section 210.

As explained previously, the circuit of the invention shown in FIG. 9 can display a maximum of 8 directories (I + 1) associated with each directory I (the central portion of each square can be left for an icon). 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 predetermined upper limit of M. There are two possibilities. Firstly, in section I or next to it, you can draw a symbol (for example, in the central part of square 204 in Fig. 9), indicating that there are files (I + 1) that are not represented. Such a symbol can be located, for example, in the central part of square 204. Alternatively, the area representing the data file can be expanded (i.e., covering both squares 204 and 206) to give enough space for the image of all files (I + one). For example, in the case where section I is a combination of squares 204 and 206, the image may present the user with up to 16 data files logically associated with data file I.

The value of M can be selected in accordance with physiological and psychological data. For example, it is believed that in many situations a person does not like to choose from a large number of alternatives. T.O. it is preferred that the values of M be no 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 FIGS. 10 (a) and 10 (f). The display area is indicated by the number 232. The panel of the optional numeric keypad is represented by part 230. The upper part of the display area is a ring 233 of 8 squares representing the functions available to the computer. Although not shown in the illustration, each square has a symbol representing a function. For example, a character related to key 2 has an icon meaning “telephone directory”. There are two abbreviations in the display area - “search” and “speed” in that place of the display, which refers to the two upper keys of the additional numeric keypad.

The mobile phone is equipped with a file directory that can be stored on the mobile phone or, alternatively, in a separate place. Among the files there is at least one in which names and corresponding phone numbers are stored.

In this example, the names are divided into eight separate files (all names are located according to the letters AC, D-E, F-H, etc.), which are located in a single directory.

The range of names that you select may depend on the number of names in these categories. For example, if the number of names starting with the letters A, B and C are not proportional to each other, the names can be redistributed so that the first file only contains names starting with the letters A and B, while names starting with the letter C, would be in a separate file.

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

Firstly, he can press the key 2 (because it corresponds to the telephone symbol in the grid 233. Then the phone forms a circuit 234, as shown in Fig. 10 (g). The circuit 234 corresponds to the invention and shows the structure of the data file directory accessible to the user. Next, a ring 235 of eight icons corresponding to various functions enters the display. Then, the user can press the 7 key to have access to the “name search” function (the function represented by the icon in position 7 on grid 235).

This forms the display shown in FIG. 10 (h). A grid of squares 238 shows the values of the directory level of the data files, which shows the range of letters reflected in the diagram 234.

The user can move directly from one mode (Fig. 10 (f)) to another (Fig. 10 (h)) by pressing the left of the two upper keys in order to start “searching” (ie, searching for names) faster.

Suppose a user wants to call a person named "Raiskinen". In this case, the user presses the key 7 (belonging to the range P-R) to go to the state shown in FIG. 10 (i), i.e. to the list of names in this range. In this case, all the names of this range can be accommodated on one screen, when the user needs a scrollable list of all matching names (if the number of names in the address book starting with one specific letter is large, then the 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). By pressing the corresponding key 8, the user can automatically call a person named Raiskinen.

10 (a) - (e) show how a user can forward a call. Starting from the initial configuration shown in FIG. 10 (a), double-pressing or short-holding the key 5 (about half a second) gives a list of phone functions. The user selects 3 to call the call register (telephone functions), so that the configuration shown in Fig. 10 (c) is obtained. Then, seeing that the forwarding icon is shown at position 3, the user clicks 3 to obtain the configuration of FIG. 10 (d). The user can either directly enter the number (a person named eg, Ilka Raiskinen) where to forward calls, i.e. having reached configuration 10 (e), or press the key corresponding to the accelerated search to return to FIG. 10 (h) and be able to search for the person to whom calls should be forwarded among people in the address book, as described above. This shows how the invention can be used to facilitate the execution of complex firmware functions.

11 shows how you can, in accordance with the invention, use a mobile phone to connect to the Internet. 11a, 11b, 11c, 11d, and 11e, five steps are sequentially shown.

First, FIG. 11 (a), the telephone is not connected to the Internet and is in a mode mainly related to FIG. 10 (a). Display 332 provides general information. The square at position 4 of ring 233 (that is, in the middle of the left side) has an icon meaning “Internet features”. The user double-clicks 4 to go to the state shown in FIG. 11 (b).

At this point, the telephone is not yet connected to the Internet, but the display area has formed a circuit 234 according to the invention, which shows the telephone files (and the equivalent of the circuit shown in FIG. 10 (c)). The display area also includes a second section 236, consisting of 8 square sections drawn in the same form as the sections on the diagram 234. In addition, the display includes the abbreviations "search" and "connection", which are located in places matching the top two keys.

Clicking on the upper right button or, possibly, one of the icons in the grid below, using the keyboard, activates the “connect” function, and the mobile phone connects to the Internet.

First, the mobile phone connects to the base page of the “portal” shown in FIG. 11 (c), on which the circuit 234 is based. This base page itself or the word (a) (eg, “Portal”) representing it can be shown in frame 238. Pressing the “I” key on the additional numeric keypad gives you movement (but in this case, it does not open yet, that is, it does not extract data in the direction of the file represented by the upper left second section 240). This gives the image shown in FIG. 11 (d), in which a portion 240 is highlighted (e.g., red) or blinks, and the lower portion of the display 232 shows the name of the open file.

Pressing the right bottommost button (usually #) opens (retrieves data) the file represented by section 240, in this case, the weather forecast for the day. This is shown in FIG. 11 (e). The upper area of the screen is now fully expanded in the form of a 3 × 4 grid, with data available to the user - “Name”, “Communication” and “Information” and the lower row of keys on the additional numeric keypad of the phone. The invention can be combined with any arrangement (in the form of a grid or in another way) of any number of keys, and keys that are active at the same time can change, obeying the user's actions.

As mentioned above, the number of minimal image elements is limited. FIG. 13 shows how a display showing all the information that is in FIG. 10 can be produced on such a screen. Section 2041 (corresponding to the value of section 204 in FIG. 10) can be depicted, as shown in FIG. 11 (b), on an 11 × 11 grid (note that this arrangement leaves a pixel (one minimal image element) between blocks corresponding to sections 220 and 222 in FIG. 9, and between blocks corresponding to sections 222 and 224). In order to present a circuit equivalent to FIG. 9, three of the 11 × 11 grids shown in FIG. 11 (b) are arranged with a space equal to one pixel between each other, as in FIG. 13 (a), with a total width 35 minimal picture elements. In other words, a diagram containing all the information in FIG. 9 can be represented in no more than 35 × 35 minimum picture elements.

In practice, the author of this invention has found out that the arrangement of this size is, in principle, difficult to read if the pixels have more than two states (for example, not only black and white, but one or more other colors). It was decided that an acceptable number of states of each pixel is three.

To improve clarity (especially when pixels are limited to two states, for example, black and white), you can insert an additional pixel between the blocks corresponding to sections 204 and 206, and between the blocks corresponding to sections 206 and 208 (and the vertical space of the second sections, respectively increases); the grid becomes 37 × 37. It is preferable that the number of pixels along each side of the circuit is less than 150, and even better, less than 100. A particular preference is when the number of pixels used to create the image is 77 × 77 (as in FIG. 9).

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

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

While in Fig. 1, sections 25 are of a size that exactly matches the inner circumference of section 1, in Fig. 14, the data file is represented by section 316, and (I + 1) data files are represented by overlapping circular sections 325. To reduce the likelihood of confusion, the user can point to one of them (eg, using the mouse), highlighting it and shifting to the background mode (eg, invisible) other sections 325, with which it overlaps.

An alternative to overlapping portions 325 may be when they are compressed (e.g. from circles to ellipses or as shown in FIG. 15), in the same manner as described above with respect to FIG. 13. The compression ratio can be selected so that the desired number of circles can be drawn inside the inner circumference of section 316, without their radial extension becoming too small. 15 also depicts the use of a step-by-step gray scale to distinguish these areas on the display. Toning can be between two colors, and the areas that need to be painted can be divided into two or more segments, each of which uses a full (or its own special) set of colors. For example, children to the right of the parent can be painted over from white to black when the user moves clockwise, and those children to the left from black to white. This allows you to toned areas gradually or step by step, i.e. avoiding intermittent color change.

Although in FIGS. 1, 14 and 15, all sections can be painted the same way, in fact any coloring plan is possible. For example, the second sections located inside the first sections can be painted according to the plan of gradual coloring (for example, at a gray level when it successively rises around the circumference of section I; or a successively rising multicolor level).

On Fig shows an example of an “implicit intensive” method of drawing sections, in which 332 sections (I + 1) are inside the circular section 334 (which can be used to build interaction with the circuit, that is, "apply", while remaining as invisible as possible for the user).

On Fig shows another diagram created in accordance with the invention. Section 340 represents the first file, while the four second sections 350, 351, 352 and 353 represent the second files. Each of the four sections 350, 351, 352 and 353 is drawn in accordance with the same distance scale, so that each is drawn in the maximum size limited by the corresponding shape inside the imaginary circle 347, identical for each of the four second sections, as shown in FIG. Note that the second section 353 - circular, and so on, can completely fill its imaginary circular border. This shows that although the sizes of the four sections drawn in FIG. 17 depend on the same distance scale, this does not mean that they automatically have the same maximum diameter or, for example, shape.

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

11 is another diagram corresponding to the invention, in which the sections (I + 1) of each section I have a width (as viewed in the orientation of the illustration, which should be the same with the display itself), equal to half the width of section I, as well as the height equal to the height of section I divided by the number of sections (I + 1). One of the three second files is personnel, as indicated by the broken line. The set of data files shown in FIG. 19 is identical to that shown in FIGS. 3 and 4. This diagram is non-directional and shows a preferred four-digit feature, shown above under the fourth aspect of the invention. Accordingly, this differs from the tree structure.

Fig.20 shows another diagram corresponding to the invention, depicting a set of files that are equivalent to those shown in Fig.19. This time the rule is that all files are ellipses, having their long axes on a horizontal line (as seen in the illustration) through the middle of the screen. The frame row is represented by a vertical line dividing the ellipsis in two. All third sections have the same length along the long axis, and, subject to all the previously described restrictions, each ellipsis is as long as possible. The result of this is that the size of each second site depends on the number of third sites that they respectively contain.

As explained previously, the invention is not limited to a schematic representation of a plurality of data files, but, on the contrary, can produce a diagram of segments of single data files or segments of multiple data files. One possibility is when segments of data files represent the corresponding parts of a computer program. For example, each segment could be part of a data file containing a particular routine. Logical relationships between parts of a program (e.g., in cases where a subprogram can be called up) represent another series of logical relationships by which you can create a circuit using the method of this invention. Any programming, a meaningful presentation of the grammar of a language, or code examples can be represented in this way, for example, the inventor discovered that he is particularly suitable for the structure of HTML.

A given program can be distributed among one or more data files in a way that is not related to the conceptual structure of the program (for example, some routines can be a complete data file; other routines can only be a file segment; other routines can be distributed among multiple files). Despite this, the user can choose the logical relationship between the segments of the data files (or entire data files) as the conceptual structure of the program so that sections of the circuit correspond to subprograms, and the drawn diagram is based on a single subprogram (playing the role of the first data file).

Using this type of scheme can facilitate the design of the page (Internet), including its layout, for example in HTML. In the case of reproducing a display including a circuit created on the basis of the invention, the subsequent part of the display area may represent the page (s) that the language forms on the user's screen. The user may have the choice of highlighting any part of the scheme (for example, by moving the mouse or pressing one or more keys), and in this case, the image of that part of the pages (s) that is associated with the part of the program corresponding to the part of the scheme formed by the user, can be highlighted.

As mentioned earlier, the scheme of the present invention is not required to occupy the entire image created on the user's screen. Moreover, when projecting a set of data files, a scheme according to the invention can be used to create a file scheme with a value up to I = n, and some other projection methods can be used to create file schemes with a higher value I.

Summarizing the above, in the framework of the present invention, these methods can create file schemes (I + 1) that have a logical connection with the files I in the form described above, when I is in the range 1, ..., n, where j is an integer a number higher than 1, and in accordance with another plan (for example, not having a decreasing distance scale) - when I is outside this range. In principle, a diagram can even be formed so, within the scope of this invention, that the plots will have a decreasing scale (e.g., decreasing size) of I values within the multiplicity of ranges, and in accordance with another drawing plan (e.g., plan hyperbolic scheme) I will be outside these ranges. Here, this type of circuit is called "partial."

In all aspects of this invention, the user has the ability to enter information in order to select a particular area within the circuit. To do this, he can use a computer keyboard (if this diagram is formed in a device that is a computer or connected to it), a sliding marker, a two-dimensional roller, a button, a keypad, a touch screen, a grid, or another order of keys (e.g., mobile phone ) or any other device.

A particularly easy-to-understand manner of navigating the scheme is one in which the user does this level by level (i.e., with gradually increasing values of I). Since sections (I + 1) of each section I are placed along a one-dimensional branch, the user can select a file at each level using one-dimensional movement. Thus, by selecting sections (I + 1), the user can then select (e.g., by pressing a key) what he wants to control inside the sections (I + 2) associated with that section (I + 1) . Thus, the selection of any file in a plurality of data files can be completed simply using a one-dimensional display, accompanied by an indication of a changing level of a gradually increasing I.

This can make navigation much easier, since one-dimensional movement is physically natural for humans, compared to two-dimensional movement. One-dimensional movement in some situations may be, for example, a mouse movement in the user's hand in the form of a one-dimensional sweep (for example, movement of the user's hand with a fixed elbow), or the movement of a highlighting device, which itself is one-dimensional, such as a button or a sliding marker.

To further simplify this movement, a section of the display area can highlight a set of files from which the user selects with one-dimensional movement, using characters in a substantially straight one-dimensional line. For example, a number of shapes (squares) can be provided, (if possible, as always, placing in the same screen area no matter how many files are to be displayed), corresponding to the number of files (I + 1) from which the user selects . The inventor found that it is easiest when this screen area is in a horizontal position, as seen by the user in some contexts for the physiological reasons described above: in this case, the probability of disorientation of the user is much less due to the curvature of the projection branch of the invention along which sections are aligned (I + 1).

In fact, we can distinguish between the three file access methods. The first method, “serial access”, is moving through a list of files, one after another with an action (for example, pressing a button or moving the roller indicator one mark) for each movement. The next method, “parallel access,” is a series of one-dimensional movements (as in the previous paragraph). And the third method, “fractal access” - according to two- or more-dimensional choice, for example, using the mouse in the diagram shown in figure 1, jumping to a file located at the distance of several logical links. Usually, parallel access is the fastest, which can be achieved without a two-dimensional indicator, such as a mouse.

Fig. 21 shows two-line diagrams (Figs. 21 (a) and 21 (b), respectively), in which the positions of the tops coincide with the centers of the circles of fractal spatial patterns shown in Figs. 22 (a) and 22 (b), respectively. The areas shown in Fig. 22 (a) or (b) can be “sensitive” in the sense that if the user indicates a position on the display, which in this case is located inside the circular section of one of the diagrams, this may indicate a file indication data represented by a circle. For example, by placing the cursor inside a section, you can make the display move in that file direction. However, instead of displaying displays 22 (a) and (b), this method can alternatively display displays 21 (a) and (b), respectively, but the functionality of this image may correspond to FIG. 22 (b). That is, although the circular sections in FIG. 22 are not visible to the user, he or she can use their functionality.

10, an additional digital panel includes a 3 × 3 grid of nine numbered buttons, and the circuit and control panel are both drawn to fit this hidden keyboard. However, the concept of a user-driven indicator having sections corresponding to sections of the circuit and / or a control panel is not limited to this hidden case. For example, the indicator may include an area in which there is a sensitive area that is capable of detecting user movements using a high accuracy distance scale. When the use of this indicator is required to highlight one of the final numbers of possibilities (for example, one of the children (I + 1) of this file I or one of the sections of the control panel), the corresponding number of sections can be (automatically) determined inside the sensitive section of the indicator, whereby the user can indicate this possibility by movement in this section.

An example of a device according to the invention incorporating this feature is shown in FIG. This highlighting device is a circular highlighting device 400 that is capable of detecting pressure by a user at any point in his circle. The interior of the indicator device 400 includes a screen 406 that displays a fractal pattern. The user has already allocated the second section 407 in a fractal diagram, which includes 5 third sections 401, 402, 403, 404, 405 for this second section 407. The circular section 400 is automatically divided into 5 zones (these 5 zones are preferably visually highlighted for the user, n- p, with different corresponding colors inside the ring 407), i.e. the user can select one of the third sections 401, 402, 403, 404, 405, choosing one of 5 sensitive areas.

It is believed that the device shown in Fig. 23 may be in the form of a watch with a control device 400 located, for example, in the position of the frame of the watch. Naturally, when the fractal pattern is not displayed, the device can display the time on the screen 406 (possibly through another fractal pattern). Although not shown in FIG. 23, the illustrated device may also include a naming system indicating the meaning of five sections 401, 402, 403, 404, 405 (e.g., one is written in ring 407, in circumferential positions relating to sensitive sections of the frame 400 )

The user also has the opportunity to change his choice, for example, by clicking (or simply touching) a point on a circle, thereby highlighting a certain position. The user is able to rotate the frame, while still pressing, whereby highlighting to go to an adjacent (or other) section, then releasing the frame to select a new highlighting as that section.

All the embodiments presented earlier took place only as an example, and the scope and spirit of the present invention should be understood in connection with additional requirements.

Claims (47)

1. A device for establishing logical relationships between multiple data files containing (a) a display means having a display area, (b) at least one agent intended for (i) the definitions for the first file of the first area, with a choice, in the display area and one or more second areas, with a choice, these second areas, respectively, represent one or more second files logically associated with the first file, and are spatially related the first area, wherein said second areas are determined in accordance with the first scale; (ii) for each i-th file, where i = 2, ..., n, (n-1), additionally definitions of one or more (i + 1) -h areas, with a choice, specified (i + 1 ) -th regions, respectively, represent one or more (i + 1) -th files logically associated with the i-th file, and are spatially related to the i -th region, while the indicated (i + 1) -th regions are determined in accordance with an i-th scale less than the (i-1) -th scale; and (c) an input means for registering a user’s choice of one of the areas, with a choice defined in the display area and corresponding to one of the files; however, the device is configured to respond to the accepted selection of the region with the possibility for the user to select the repeated execution of steps (i) and (ii) using the file corresponding to the selected region as the first file. 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) the resolution of the display means, (ii) available to create a display of computer resources, (iii) the number of clicks from the first file, ( iv) previously made user selection. 4. The device according to any one of the preceding paragraphs, characterized in that the input means allows the user to select any file. 5. The device according to any one of the preceding paragraphs, characterized in that at least one of the (i + 1) -th areas for the (i + 1) -th files logically associated with a given i-th file is determined by the rule, and the aforementioned the rule is independent of i and / or the number of (i + 1) -x regions mentioned. 6. The device according to any one of the preceding paragraphs, characterized in that it contains means for determining a rule that determines whether any of the data files are logically linked to any other one of the specified files. 7. The device according to any one of the preceding paragraphs, characterized in that it contains means configured for the selected j-th file (where 1≤j≤n), represented by one of the areas, create an additional area for each file, previously logically associated with j-th file, with each additional area includes data indicating the importance of the corresponding linked file. 8. The device according to claim 7, characterized in that the selection of one of the additional areas is equivalent to the selection of the area corresponding to the additional area. 9. The device according to claim 7, characterized in that the preliminary logical connection is determined by the fact that the data files for which an additional area is displayed are j-th data files logically linked to the same (j-1) th data file, as the selected j-th data file. 10. The device according to claim 7, characterized in that the preliminary logical connection is determined by the fact that the data files for which an additional area is displayed are (j + 1) -th data files logically linked to the same selected j-th data file . 11. The device according to any one of the preceding paragraphs, characterized in that the second regions have a size corresponding to the first scale, and the (i + 1) -th regions have a size corresponding to the i-th scale. 12. The device according to any one of the preceding paragraphs, characterized in that the corresponding scale of (i + 1) -th areas for (i + 1) -th files logically associated with a given i-th file is the i-th scale multiplied by a value that is a function of the variable characterizing the corresponding (i + 1) th file. 13. The device according to claim 1, characterized in that the said scales are selected in such a way that they decrease with i, in accordance with a given relationship so that regardless of n, the total display area of the areas defined in the display area does not exceed a predetermined value . 14. The device according to any one of the preceding paragraphs, characterized in that the (i + 1) -th areas for (i + 1) files logically associated with the i-th file are spatially located to each other at an angle specified by the rule, while this rule depends on i. 15. The device according to any one of the preceding paragraphs, characterized in that the first file is a data file corresponding to the current location of the user viewer. 16. The device according to p. 15, characterized in that steps (i) and (ii) are performed when the current location of the user viewing program is changed. 17. The device according to any one of the preceding paragraphs, characterized in that it uses at least one criterion to identify a subgroup of (i + 1) -th areas logically associated with the i-th file, and do not display areas identified (i + 1) - x files. 18. The device according to 17, characterized in that at least one criterion is that the identified file is already presented on the map or the logical connection of the identified file with another data file with which it is logically connected 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 predetermined number M, then only M (i + 1) -x areas are displayed , respectively, representing only M from all (i + 1) -th files. 20. The device according to claim 1, characterized in that the graphic characteristics of at least one area correspond to the characteristics of the file represented by this area. 21. The device according to claim 1, characterized in that for i = 1, ... n (i + 1) -th areas for (i + 1) -th files logically associated with the i-th file are spatially located in two-dimensional view, in accordance with the i-th region for the i-th file. 22. The device according to claim 1, characterized in that the (i + 1) -th region has the largest size within the limits defined by a specific size and location rule. 23. The device according to claim 1, characterized in that the input means allows the user to change the rules that determine the graphic characteristics of the areas, and / or their size, and / or their location inside the display area. 24. The device according to claim 1, characterized in that it contains means for creating a second map including regions correspondingly representing the (i + 1) th regions of the selected i-th region, while these regions have relative positions corresponding to relative positions (i +1) s areas. 25. The device according to any one of claims 1 to 23, characterized in that it contains means for creating a second map and the logical connections between the i-th file and (i + 1) -th files of the second card are different from the logical connections between the i-th file and (i + 1) -m files of the first map. 26. The device according A.25, characterized in that the logical connections between the files of the second card represent in the reverse form the logical connections between the files on the first card. 27. The device according to claim 1, characterized in that (i + 1) -th areas for (i + 1) -th files logically associated with the i-th file are located inside the i-th area for the i-th file. 28. The device according to claim 1, characterized in that the i-th region for the i-th file has a periphery and (i + 1) -th region for the (i + 1) -th files logically associated with the i-th file, located near the periphery of the i-th region for the i-th file. 29. The device according to claim 1, characterized in that the i-th region corresponding to the i-th file has a center and (i + 1) -th regions for (i + 1) -th files logically associated with the i-th file, located around the center of the i-th area. 30. The device according to claim 1, characterized in that (i + 1) -th areas for (i + 1) -th files logically associated with the i-th file are located relative to the i-th area in positions depending on the number (i + 1) files. 31. The device according to claim 1, characterized in that it includes the display of areas in the display area. 32. The device according to claim 1, characterized in that at least some (i + 1) -th areas for (i + 1) -th files associated with the i-th file are combined. 33. The device according to claim 1, characterized in that when selecting an area, the file represented by the area is opened. 34. The device according to claim 1, characterized in that the (i + 1) -th regions respectively represent one or more (i + 1) -th files that are hierarchically dominant or subordinate to the i-th file, so that the regions corresponding to the dominant and sub files are simultaneously available for selection. 35. The device according to claim 1, characterized in that it contains means for changing the scale, which, when repeating steps (i) and (ii), using the file corresponding to the selected area as the first file, changes the scale associated with the selected area. 36. The device according to clause 35, wherein the change in scale includes an increase in the scale associated with the selected area. 37. The device according to p. 35, characterized in that it contains means for determining the size of the selected area by the size of the largest area, which, when performing steps (i) and (ii) again, using the file corresponding to the selected area as the first file, sets the size selected area to the size of the largest area. 38. A device for establishing logical relationships between multiple segments of one or more data files containing (a) a display means having a display area, (b) at least one agent intended for (i) the definitions for the first segment of the first region, with a choice, in the display area and one or more second regions, with a choice, these second regions, respectively, represent one or more second segments, logically associated with the first segment, and spatially related the first area, wherein said second areas are determined in accordance with the first scale; and (ii) for each i-th segment, where i = 2, ..., n, (n-1) additionally steps for determining one or more (i + 1) -h areas, with a choice, the indicated (i + 1 ) -th regions, respectively, represent one or more (i + 1) -th segments, logically connected with the i-th segment, and spatially related to the i -th region, while the indicated (i + 1) -th regions are determined in accordance with an i-th scale less than the (i-1) -th scale; (c) an input means for registering a user’s choice of one of the areas, with a choice defined in the display area and corresponding to one of the segments; however, the device is configured to, in response to the accepted region selection by the user, repeat steps (i) and (ii), using as a first segment a segment corresponding to the selected region. 39. The device according to § 38, wherein the display area is made on a portable device. 40. The device according to § 38, wherein the display area is performed on a mobile phone. 41. A device for establishing logical relationships between multiple data files containing (a) a display means having a display area, (b) at least one agent intended for (i) the definitions for the first file of the first area, with a choice, in the display area and one or more second areas, with a choice, these second areas, respectively, represent one or more second files logically associated with the first file, and are spatially related the first area, wherein said second areas are determined in accordance with the first scale; and (ii) for each i-th file, where i = 2, ..., n, (n-1) additionally defines one or more (i + 1) -h areas, with a choice, specified (i + 1) -th regions, respectively, represent one or more (i + 1) -th files logically associated with the i-th file, and are spatially related to the i-th region, while the indicated (i + 1) -th regions are determined in accordance with i-th scale, less than (i-1) -th scale; (c) an input means for registering a user’s choice of one of the areas, with a choice defined in the display area and corresponding to one of the files; wherein the device is configured to be spatially positioned to each other at an angle, in accordance with a given rule, of (i + 1) -th areas for (i + 1) files logically associated with the ith file, and this rule depends on i. 42. A device for establishing logical relationships between multiple data files containing (a) a display means having a display area, (b) at least one agent intended for (i) the definitions for the first file of the first area, with a choice, in the display area and one or more second areas, with a choice, these second areas, respectively, represent one or more second files logically associated with the first file, and are spatially related the first area, wherein said second areas are determined in accordance with the first scale; and (ii) for each i-th file, where i = 2, ..., n, (n-1) additionally defines one or more (i + 1) -h areas, with a choice, specified (i + 1) -th regions, respectively, represent one or more (i + 1) -th files logically associated with the i-th file, and are spatially related to the i-th region, while the indicated (i + 1) -th regions are determined in accordance with i-th scale, less than (i-1) -th scale; (c) an input means for registering a user’s choice of one of the areas, with a choice defined in the display area and corresponding to one of the files; wherein the device is arranged with the possibility of spatial arrangement in two-dimensional form in accordance with the i-th region for the i-th file, (i + 1) -th regions for (i + 1) -th files, logically associated with the i-th file, for i = 1, ... n. 43. A device for establishing logical relationships between multiple data files containing (a) a display means having a display area, (b) at least one agent intended for (i) the definitions for the first file of the first area, with a choice, in the display area and one or more second areas, with a choice, these second areas, respectively, represent one or more second files logically associated with the first file, and are spatially related the first area, wherein said second areas are determined in accordance with the first scale; and (ii) for each i-th file, where i = 2, ..., n, (n-1) additionally defines one or more (i + 1) -h areas, with a choice, specified (i + 1) -th regions, respectively, represent one or more (i + 1) -th files logically associated with the i-th file, and are spatially related to the i -th region, while the indicated (i + 1) -th regions are determined in accordance with i-th scale, less than (i-1) -th scale; (c) an input means for registering a user’s choice of one of the regions, with a choice defined in the display region and corresponding to one of the files; wherein the device is configured to set the center of the i-th area corresponding to the i-th file, and the location of (i + 1) -th areas for (i + 1) -th files logically associated with the i-th file, around the center of the i-th file area. 44. A device for establishing logical relationships between multiple data files containing (a) a display means having a display area, (b) at least one agent intended for (i) the definitions for the first file of the first area, with a choice, in the display area and one or more second areas, with a choice, these second areas, respectively, represent one or more second files logically associated with the first file, and are spatially related the first area, wherein said second areas are determined in accordance with the first scale; and (ii) for each i-th file, where i = 2, ..., n, (n-1) additionally defines one or more (i + 1) -h areas, with a choice, specified (i + 1) -th regions, respectively, represent one or more (i + 1) -th files logically associated with the i-th file, and are spatially related to the i-th region, while the indicated (i + 1) -th regions are determined in accordance with i-th scale, less than (i-1) -th scale; (c) an input means for registering a user’s choice of one of the regions, with a choice defined in the display region and corresponding to one of the files; and contains means configured for the selected j-th file (where 1≤j≤n), represented by one of the regions, to create an additional area for files previously logically associated with the j-th file, each additional area includes data indicating the importance of the associated linked file. 45. The device according to item 44, wherein the selection of one of the additional areas is equivalent to the selection of the area corresponding to the additional area. 46. The device according to item 44, wherein the preliminary logical connection is determined by the fact that the data files for which an additional area is displayed are j-th data files logically associated with the same (j-1) th data file, as the selected j-th data file. 47. The device according to item 44, wherein the preliminary logical connection is determined by the fact that the data files for which an additional area is displayed are (j + 1) -th data files logically linked to the same selected j-th data file .

Images