RU2295763C2 - Automated complex for structuring computer codes, adequate to undefined objects - Google Patents

Abstract

FIELD: computer technologies, possible use during automatic structuring of computer codes adequate to information being processed.

SUBSTANCE: complex contains interconnected input block for forming n channels for processing computer codes, block for forming autonomous databases of sets of computer codes, block for selecting auxiliary databases of subsets of computer codes, block for transformation of computer codes, composed of unit for dividing sets of computer codes on subsets, unit for encoding subsets of computer codes, unit for matching subsets of computer codes, and block for processing subsets of computer codes, consisting of unit for determining volumes of intersecting parts of subsets, unit for cutting out intersecting parts of subsets and unit for distributing intersecting parts of subsets.

EFFECT: increased speed of structuring of computer codes.

1 dwg

Description

The invention relates to the field of computer technology and can be used for automatic structuring of computer codes adequate to arbitrary objects.

A well-known automated system for creating and maintaining virtual storages, as well as search and visual display of the location of storage units in them (RF Patent for utility model No. 21059, IPC E 04 H 3/06, 06/18/2001), containing hardware and software, providing the formation of three-dimensional graphic representations and / or projections of buildings, structures and storage facilities, equipment and devices located in them (racks, containers, stands, cabinets, safes, etc.) for warehousing, storage and / or delivery x items (storage units).

There is an automated system for structuring computer codes that are adequate for arbitrary objects (RF Patent for Utility Model No. 22250, IPC E 04 H 3/06, 08/20/2001), containing hardware and software that provide the formation of computer codes that are adequate to three-dimensional graphic representations and / or projections of arbitrary objects, address and / or coordinate markup of these representations and / or projections, placement of storage units in storages at the specified addresses and / or coordinates, loading and saving graphic images storage locations and data about storage units located in them in an external information array, visual display of graphic representations of storage facilities, their layout and graphic images of storage units placed in them, search for addresses and / or coordinates in storage facilities where these storage units are located, or are free, printing and / or distribution of information about storage facilities and storage units located in them is the closest analogue.

The disadvantages of the known devices are the imperfection of the processing of computer codes adequate to arbitrary objects and the relatively low rate of structuring of computer codes.

The problem solved by the invention is the improvement of devices for automatic structuring of computer codes adequate to arbitrary objects, while achieving a technical result in relation, in particular, to increase the speed of structuring of computer codes. The use of a generally automated complex of structuring computer codes adequate to arbitrary objects can significantly save the consumption of computational resources (memory, number of processor operations, etc.), and increase the speed and accuracy of structuring computer codes.

As a brief information revealing the essence of the device, it should be noted that the achieved technical result is provided using the proposed automated complex for structuring computer codes adequate to arbitrary objects, containing interconnected functional blocks, in particular, an input formation unit (hereinafter referred to as FC) n ₁ - channels for processing computer codes, where n _{1 is} selected from 1 to 2 ²⁵⁶ , with the option to select from them n ₂ channels in an amount within 0.39 + 1 / n ₁ ≤ (α ₁ n ₁ + α ₂ n ₂ ) / n ₁ ) ≤15,7, where α ₁ - Expo imentalny factor chosen depending on the type of the objects within 0,16≤α ₁ ≤8,3, α ₂ - experimental factor, selected according to their source of origin between ₂ 0,23≤α ≤6,4. The inputs and outputs of the FC are interconnected with the inputs and outputs of the unit for generating autonomous databases of sets of computer codes (hereinafter referred to as FCK), adequate to arbitrary objects, and the inputs and outputs of the FCK are connected to the inputs and outputs of the allocation unit of auxiliary databases of subsets of computer codes (hereinafter CCC) with the possibility highlighting the maximum V ₁ and minimum V ₂ number of elements in the VCC databases of subsets of computer codes within 0.31≤ (V ₂ + α ₃ V ₁ ) / V ₁ ≤ 2.9, where α ₃ is the experimental coefficient, chosen depending from data types to computer codes ranging from 0.31≤α ₃ ≤1.9.

The I / Os of the VCC are connected to the inputs and outputs of the computer code conversion unit (hereinafter referred to as the PAC) composed of interconnected subdivisions of the set of computer codes into subsets (hereinafter RAC), a coding unit of the subsets of computer codes (hereinafter CCC), a node for matching subsets of computer codes (hereinafter CCM). Moreover, the RKK is made with the possibility of dividing sets of volume V ₁ into subsets of volumes V _3i , the values of which are selected from the relation 0.27≤ (V _3i + α ₄ V ₂ ) / V ₂ ≤3,1, where α ₄ is the experimental coefficient, selected depending on the features of their partition (into minimum and maximum volumes) in the range from 0.27≤α ₄ ≤2.1, ai is selected in the range 1≤i≤2 ²⁵⁶ . The constructive performance of the CCC is determined by converting the obtained subsets according to a given algorithm to obtain a set of N-dimensional subsets, A _j elements of the form {B _m , X ₁ , X ₂ , ... X _n }, where j is the serial number of the subset ranging from 1 to 2 ²⁵⁶ , In _m is the identifier, X ₁ -X _n are the coordinates of the element relative to the origin, am and n are selected from 1 to 2 ²⁵⁶ . The constructive implementation of the CCM is determined by the number of channels and the algorithm for comparing the converted received subsets with the already accumulated subsets and / or with the newly arriving sets on different channels.

The inputs and outputs of the RKK, KKK, CCM are connected to the inputs and outputs of the node for determining the volumes of intersecting parts of the subsets (hereinafter referred to as the HFC), the node for cutting out the intersecting parts of the subsets (hereinafter referred to as the HPV) and the node of the distribution of the intersecting parts of the subsets (hereinafter referred to as the HPV) are used computer codes (hereinafter OCC). Moreover, the constructive implementation of the HRE is determined by the ratio of the minimum V ₄ and maximum V ₅ volumes of the intersecting parts of the subsets selected within 0.29≤ (V ₄ + α ₅ V ₅ ) / V ₅ ≤3.1, where α ₅ is the experimental coefficient, selectable depending on the types of data of computer codes ranging from 0.29≤α ₅ ≤2.1. The constructive performance of HPV is determined by the ratio of the minimum V ₆ and maximum V ₇ volumes of the cut-out parts of the subsets selected within 0.42≤ (V ₆ + α ₆ V ₇ ) / V ₇ ≤ 3.4, where α ₆ is the experimental coefficient selected in depending on the size of the used computer codes ranging from 0.42≤α ₆ ≤2.4. The constructive implementation of the RHF is determined by the ratio of the minimum W ₁ and maximum W ₂ distribution speeds of parts of the subsets, selected within 0.38≤ (W ₁ + α ₇ W ₂ ) / W ₂ ≤3,3, where α ₇ is the experimental coefficient selected in depending on the speed of the database ranging from 0.38≤α ₇ ≤2.3. The inputs and outputs of the HRC, HPV, and RFI are connected to the inputs and outputs of the storage unit of the central database (hereinafter CBD) of subsets of computer codes composed of nodes of interconnected autonomous databases (hereinafter DBA) of storing subsets of computer codes adequate to arbitrary objects, subsets of cut computer codes, including the subsets of the computer codes and identifiers of the subsets of the cut out computer codes left after cutting, with the possibility of placing autonomous databases in the central database, in which on the site of the cut subsets accommodated database identifiers with stored therein data subsets cut.

It is advisable to explain the proposed device with a drawing, which shows a block diagram of a complex of an automated complex for structuring computer codes adequate to arbitrary objects. In the drawing, the notation:

1 - FC - channel forming unit,

2 - FKK - block the formation of autonomous databases of sets of computer codes,

3 - VKK - block allocation of auxiliary databases of subsets of computer codes,

4 - PAC - block conversion of computer codes,

4a - RKK - node splitting sets of computer codes into subsets,

4b - KKK - node encoding subsets of computer codes,

4c - CCM - node matching subsets of computer codes,

5 - OKK - block processing subsets of computer codes,

5a - HRE - node for determining the intersecting parts of subsets,

5b - HPV - node cutting intersecting parts of the subsets,

5c - RPC - distribution node of the intersecting parts of the subsets,

6 - CDB - a block of a central database storing subsets of computer codes,

6a - DBA No. 1 - node of an autonomous database for storing subsets of computer codes,

6b - DBA No. 2 - node of an autonomous database for storing subsets of computer codes,

6s - ...,

6d — DBA No. k-1 — node of an autonomous database for storing subsets of computer codes,

6e - DBA No. k - node of an autonomous database for storing subsets of computer codes.

When presenting information confirming the possibility of carrying out the invention, it is advisable to describe in more detail the proposed automated complex for structuring computer codes adequate to arbitrary objects, in the description of which it is inappropriate to dwell in detail on the features of its operations known from published data. In this case, it is advisable to bring definitions of the concepts used for the convenience of perception of information.

A computer code is a machine-converted representation of a piece of information (the original), in particular, in the form of electromagnetic signals.

A criterion is a factor by which recognition is performed, for example, a parameter, coordinate, logical condition, etc.

A system of criteria is a set of criteria interconnected by their target orientation, in particular, their suitability for use in the recognition process.

Memory is a functional unit of the device’s implementation means, fixing processed information for a certain period of time with the possibility of its further reproduction, reading, and other uses.

A preset algorithm is a set of rules by which the source information arriving on each channel is transformed, materialized in the form of computer codes adequate to arbitrary objects.

A set is a combination of certain completely distinguishable objects, which are called elements of the set formed by them [Mathematical Handbook, I. Bronstein, K. A. Semendyaev, Moscow: Nauka, 1986, p. 380, p. .4.1.2.1].

The subset is part of the set, and the subsets are part of the subset.

The intersection of two sets A _j and A _{j + k} is a set that consists of elements that belong to each of the sets A _j and A _{j + k} ["Mathematics Reference", I. N. Bronstein, K. A. Semendyaev, M .: Science, 1986, p.381, clause 4.1.3.1], where j and j + k are the numbers of sets taken from the range from 1 to 2 ²⁵⁶ , or, by analogy, the intersection of any number of sets structured according to the claimed method.

A distinguishable arbitrary object is computer codes adequate to the corresponding pieces of information.

Further, it is advisable to dwell in detail only on the distinguishing essential structural features of the proposed complex (as applied to the implementation example of the device according to the drawing), which contains interconnected functional blocks, in particular, the input block of the FC n ₁ -channels for processing computer codes, where n _{1 is} selected from 1 to 2 ²⁵⁶ , with the possibility of choosing from them n ₂ channels in an amount within 0.39 + 1 / n ₁ ≤ (α ₁ n ₁ + α ₂ n ₂ ) / n ₁ ≤15.7, where α ₁ is the experimental coefficient chosen depending on the type of objects ranging from 0.16≤α ₁ ≤8.3, α ₂ is the experimental coefficient, selected depending on the sources of their origin in the range from 0.23≤α ₂ ≤6.4. In practice, these can be, for example, varieties of digital, textual, symbolic, graphic and mixed information. Thus, a wide choice of channels is provided, which satisfies almost all real-world requirements. The inputs and outputs of the FC are interconnected with the inputs and outputs of the FCC block, adequate to arbitrary objects, and the inputs and outputs of the FCC are connected to the inputs and outputs of the HCC allocation block with the possibility of extracting the maximum V ₁ and minimum V ₂ number of elements in the HCC databases of subsets of computer codes within 0.31≤ (V ₂ + α ₃ V ₁ ) / V ₁ ≤2.9, where α ₃ is the experimental coefficient selected depending on the types of data of computer codes ranging from 0.31≤α ₃ ≤1.9.

Inputs and outputs of the CCC are connected to the inputs and outputs of the PAC unit, composed of interconnected RCC node, CCC node, CCM node. Moreover, the RKK is made with the possibility of dividing sets of volume V ₁ into subsets of volumes V _3i , the values of which are selected from the relation 0.27≤ (V _3i + α ₄ V ₂ ) / V ₂ ≤3,1, where α ₄ is the experimental coefficient, selected depending on the features of their partition (into minimum and maximum volumes) ranging from 0.27≤α ₄ ≤2.1, and i is selected within 1≤i≤2 ²⁵⁶ . The constructive performance of the CCC is determined by converting the obtained subsets according to a given algorithm to obtain a set of N-dimensional subsets, A _j elements of the form {B _m , X ₁ , X ₂ , ... X _n }, where j is the serial number of the subset ranging from 1 to 2 ²⁵⁶ , In _m is the identifier, X ₁ -X _n are the coordinates of the element relative to the origin, and m and n are selected from 1 to 2 ²⁵⁶ . The constructive implementation of the CCM is determined by the number of channels and the algorithm for comparing the converted received subsets with the already accumulated subsets and / or with the newly arriving sets on different channels.

The inputs and outputs of the RCC, CCC, CCM are connected to the inputs and outputs of the HFC unit, the HPV unit, and the RPC unit, of which the OCC unit is composed. Moreover, the constructive implementation of the HRE is determined by the ratio of the minimum V ₄ and maximum V ₅ volumes of the intersecting parts of the subsets selected within 0.29≤ (V ₄ + α ₅ V ₅ ) / V ₅ ≤3.1, where α ₅ is the experimental coefficient, selectable depending on the types of data of computer codes ranging from 0.29≤α ₅ ≤2.1. The constructive performance of HPV is determined by the ratio of the minimum V ₆ and maximum V ₇ volumes of the cut-out parts of the subsets selected within 0.42≤ (V ₆ + α ₆ V ₇ ) / V ₇ ≤ 3.4, where α ₆ is the experimental coefficient selected in depending on the size of the used computer codes ranging from 0.42≤α ₆ ≤2.4. The constructive implementation of the RHF is determined by the ratio of the minimum W ₁ and maximum W ₂ distribution speeds of parts of the subsets selected within 0.38 ≤ (W ₁ + α ₇ W ₂ ) / W ₂ <3.3, where α ₇ is the experimental coefficient selected in depending on the speed of the database ranging from 0.38≤α ₇ ≤2.3. The inputs and outputs of the HRC, HPV, and RFI are connected to the inputs and outputs of the storage unit of the central database of the CDB of subsets of computer codes composed of nodes of interconnected autonomous databases of the DBA of storage of subsets of computer codes adequate to arbitrary objects, subsets of cut out computer codes, including the subsets of the computer codes and identifiers left after cutting out the computer codes, with the possibility of placing in the CDB autonomous databases in which of the subsets placed, the identifiers of the databases are stored with the data cut out in the subsets stored in them. The described constructive implementation is one of the best options for the practical implementation of the claimed automated complex for structuring computer codes adequate to arbitrary objects.

It is also advisable to briefly characterize the work of the proposed automated complex in the form of a method for automatically structuring computer codes adequate to arbitrary objects, for example, in the form of pieces of information, which includes a set of operations carried out, for example, on N ₁ channels, where N _{1 is} selected from 1 up to 2. Moreover, in each of the N ₂ channels, chosen in an amount satisfying the inequality 0.39 + 1 / n ₁ ≤ (α ₁ n ₁ + α ₂ n ₂ ) / n ₁ ≤15.7, where α ₁ - experimental coefficient selected depending on type of objects ranging from 0.16≤α ₁ ≤8.3, α ₂ - experimental coefficient, selected depending on the sources of their origin in the range from 0.23≤α ₂ ≤6.4. At the same time, it is isolated from the volume V ₈ that arrives per unit of time of information, its part of the volume V ₉ , which is selected from the ratio within 0.56≤ (V ₉ + V ₈ ) / V ₈ ≤2.8. The received information is divided into logically completed fragments, the volumes of V _{10i of} which are selected from the ratio in the range of 0.45≤ (V _10i + V ₉ ) / V ₉ ≤2.7, where i is selected in the range of 1≤i≤2 ²⁵⁶ . Among the simplest features of dividing the received information into logically complete fragments, it is possible to indicate, for example, equal volumes of fragments or non-equal fractions.

Then, the obtained pieces of information are encoded, transforming them according to a predetermined algorithm to obtain a set of N-dimensional sets adequate to the transformed initial information, A _j elements of the form {B _m , X ₁ , X ₂ , ... X _n }, where j is the serial number sets ranging from 1 to 2 ²⁵⁶ , B _m is the identifier, X ₁ -X _n is the coordinate of the element relative to the origin of the element, am and n are selected in the range from 1 to 2 ²⁵⁶ . It is worth noting here that these elements are often called frames and each element has its own coordinate system. The resulting set of N-dimensional sets is compared with already accumulated sets and / or with newly arriving sets through different channels, intersecting parts of the sets are determined and cut out. Comparison with already accumulated sets and / or with new entrants is carried out simultaneously or sequentially in time. After that, the cut-off intersections of the sets and the sets remaining after the cut-out are distributed across the databases, placing each of the same sets in its corresponding database and each of the sets that differ in some parameter in the corresponding sets of the database, and put the identifiers in place of the cut-out sets storing these sets of databases.

Considering the use of a number of analytical relations, it should be noted that for practical implementation, from sets satisfying the analytical relations of the parameter values within the stated limits, they are chosen for the parameters, for example, n ₁ or n ₂ are positive integers, and for the remaining parameters they are real numbers, excluding irrational, transcendental, complex, negative and other technically incorrect or practically inapplicable or not reproducible values of interrelated parameters .

Compliance with the criterion of industrial applicability of the claimed object is proved both by the widespread receipt and use of the described means for the implementation of computer technologies on a massive scale, and the absence of any practically difficult features in the claimed claims. The technical result achieved, as shown by the experimental data, can only be realized by an interconnected set of all the essential features of the claimed device, reflected in the claims. For example, when you search using one of the options for the practical implementation of the claimed device, the word “Example” in an unsorted, non-indexed database of 100 million records or 100 billion records, the number of operations will be approximately the same, i.e. the search speed will be the highest compared to the known methods under adequate conditions for their use, it depends only on the length of the request and very weakly depends on the size of the database.

The lower and upper values of the declared limits were obtained on the basis of statistical processing of the results of experimental studies, analysis and generalization of them and known from published data sources, as well as inventive intuition, based on the conditions for achieving the specified technical result. The differences indicated in the claims give grounds to conclude that the technical solution is new, and the totality of the claimed claims is about its inventive step, which is proved by the above detailed description of the claimed object.

As an example, it is advisable to characterize a variant of the device that forms a structured database of text, graphic and audio information, designed to store large arrays of text, graphic and audio information, arriving, for example, simultaneously through 10 channels in the form of 6 text, 2 graphic and 2 audio. The set of operations of the method implemented in this embodiment of the device can be characterized as follows: N _{1 is} chosen equal to 10, N ₂ from 2 to 6, with α ₁ = 1 for textual information, α ₁ = 0.9 for graphic information, α ₁ = 1.1 for audio information. Allocated from the volume V ₈ = 10000 Kb / s of information coming in per time unit, its part of the volume V ₉ = 1000 Kb / s. The received information is divided into logically complete fragments, the volumes of which are selected from the ratio 1.4 ≤ (V _10i + α ₃ V ₉ ) / V ₉ ≤1.6, where i is selected within the range 1≤i≤2 ²⁰ .

Encode the obtained pieces of information, transforming them according to a given algorithm to obtain a set of N-dimensional sets of A _j elements, of the form {B _m , X ₁ , X ₂ , ... X _n }, where B _m is the identifier, X ₁ -X _n is the coordinate of the element, aj is the serial number of the set in the range from 1 to 2 ⁶³ , relative to the origin of the element (each element has its own coordinate system), adequate to the converted initial information, where the type is selected in the range from 1 to 2 ⁶³ . The resulting set of N-dimensional sets is compared with already accumulated sets and / or with newly arriving (simultaneously or sequentially in time) sets in different channels, intersecting parts of the sets are extracted and cut out, after which the cut out intersections of the sets and the sets remaining after cutting are distributed over the databases , placing each of the same sets in its corresponding database and each of the sets differing in some parameter in the corresponding database sets, and place identifiers storing these sets of databases in place of cut sets.

Experimentally, when implementing this option, we obtained the speed of automatic structuring of computer codes adequate to the processed information, equal to 930.55 Kb / s on a computing device with four Pentium III 800 MHz processors, and 1024 MB RAM.

In addition to the above technical result, the practical implementation of the claimed object allows you to significantly expand the possibilities of its use as applied, for example, to various types and volumes of incoming information, provides an additional opportunity for highly efficient hardware implementation (price / quality / speed) using a variety of types of element base, and also automatic adaptation of the device to solve problems of various types, unlike neural networks that require a predetermined topology for zhduyu specific task.

Claims (1)

An automated complex for structuring computer codes adequate to arbitrary objects, containing interconnected input block for generating (hereinafter FC) n ₁ -channels for processing computer codes, where n _{1 is} selected from 1 to 2 ²⁵⁶ , with the possibility of choosing from them n ₂ channels in the amount of within 0.39 + 1 / n ₁ ≤ (α ₁ n ₁ + α ₂ n ₂ ) / n ₁ ≤15.7, where α ₁ is the experimental coefficient selected depending on the type of objects in the range from 0.16≤α ₁ ≤8,3, α ₂ - experimental factor chosen depending on the source of origin within t 0,23≤α ₂ ≤6,4, FC inputs and outputs interconnected with inputs-outputs unit forming offline databases computer code sets (hereinafter FCC) adequate arbitrary objects, and inputs and outputs connected to inputs of the CFC-output allocation unit auxiliary databases of subsets of computer codes (hereinafter VCC) with the possibility of extracting the maximum V ₁ and minimum V ₂ number of elements in the databases of the VCC subsets of computer codes within 0.31≤ (V ₂ + α ₃ V ₁ ) / V ₁ ≤2, 9, where α ₃ is the experimental coefficient, chosen depending on the ty of data of computer codes ranging from 0.31≤α ₃ ≤1.9, I / O inputs and outputs are connected to the inputs and outputs of a computer code conversion unit (hereinafter referred to as PAC) composed of interconnected subdivisions of sets of computer codes into subsets (hereinafter RKK), a node for encoding subsets of computer codes (hereinafter CCK), a node for comparing subsets of computer codes (hereinafter CCM), moreover, the RCC is configured to decompose sets of volume V ₁ into subsets of volumes V _3i , the values of which are selected from the relation 0.27≤ (V _3i + α ₄ V ₂ ) / V ₂ ≤3,1, where α ₄ is the experimental coefficient, selected depending on the features of their partition (into minimum and maximum volumes) in the range from 0.27≤α ₄ ≤2,1, ai is selected in the range 1≤i≤2 ²⁵⁶ , the constructive implementation of the KKK is determined by converting the obtained subsets according to a given algorithm to obtain a set of N-dimensional subsets, A _j elements of the form {B _m , X ₁ , X ₂ , ... X _n }, where j is the serial number of the subset ranging from 1 to 2 ^256, V _m - identifier, X ₁ -X _n - element coordinates relative to the origin, am and n are chosen under the assumption ah 1 to 2 ^256, and a constructive arrangement CCM determined number of channels and the algorithm matching the transformed received subsets already accumulated subsets and / or with a newly incoming sets on different channels, the inputs and outputs RCM SSC CCM connected to the inputs-outputs unit determining the volumes of intersecting parts of the subsets (hereinafter referred to as the HRE), the node for cutting out the intersecting parts of the subsets (hereinafter referred to as the HPV) and the node of the distribution of the intersecting parts of the subsets (hereinafter referred to as the HPV), of which the processing unit of the subsets is composed in computer codes (hereinafter OCC), wherein the constructive implementation of the HRE is determined by the ratio of the minimum V ₄ and maximum V ₅ volumes of the intersecting parts of the subsets selected within 0.29≤ (V ₄ + α ₅ V ₅ ) / V ₅ <3.1, where α ₅ is the experimental coefficient selected depending on the types of data of computer codes ranging from 0.29≤α ₅ ≤2.1, and the design of HPV is determined by the ratio of the minimum V ₆ and maximum V ₇ volumes of the cut parts of the subsets selected within 0,42≤ (V ₆ + α _{6 7} V) / V ₇ ≤3,4, where α ₆ - experimental Prevalence t, chosen depending on the size of computer code used in the range of ₆ 0,42≤α ≤2,4 and constructive arrangement defined RPCH minimum ratio W ₁ and W ₂ maximal velocity distribution parts subsets selected within 0,38≤ (W ₁ + α ₇ W ₂ ) / W ₂ ≤3.3, where α ₇ is the experimental coefficient, selected depending on the speed of the database in the range from 0.38≤α ₇ ≤2.3, I / O, HPV and RPCh are connected to the inputs and outputs of the storage unit of the central database (hereinafter CBD) of the subsets of computer codes composed one of the nodes of interconnected autonomous databases (hereinafter referred to as the DBA) storing subsets of computer codes adequate to arbitrary objects, subsets of the cut computer codes, including the subsets of the codes that remained after cutting the computer codes, and identifiers of the subsets of the cut computer codes, with the possibility of placing autonomous databases in the CBD data in which the identifiers of the databases are placed at the place of the cut out subsets, with the data cut out of the subsets stored in them.