RU2724788C1 - Information search device - Google Patents

Abstract

FIELD: computer equipment.

SUBSTANCE: invention relates to the computer equipment. Information search device comprises N≥2 mask storage units, N selection units, frequency divider, time interval generator, search strategy register, transition mask address generating unit, indication unit, N selection controllers of search time, main search time controller, clock pulse generator, fuzzy search script analysis unit and fuzzy search script conversion unit.

EFFECT: technical result consists in improvement of reliability of determining type of expected blocks of binary information.

3 cl, 13 dwg

Description

The invention relates to the field of telecommunications and can be used for searching and prompt identification of information in packet-switched data networks, in information-reference (search) systems and in intellectual content analysis systems for searching, evaluating and categorizing the semantic content of information objects in the interests of effective Detection and counteraction of unwanted, doubtful and malicious information circulating in social networks and on the global Internet.

A device is known according to RF Patent No. RF №2115952 "Information Search Device" IPC G06F 17/40, published July 20, 1998 and includes boundary registers that add up and subtract counters, comparison circuits, memory blocks and calculation blocks. This analogue during the reception of a digital message and the search for a specific digital sequence allows you to determine the parameters and the correspondence of the transmission sequence to the data exchange rules established for this protocol.

The disadvantage of this device is the relatively large time required for packet identification (since identification is carried out by sequential analysis of the characteristic values) and the narrow scope is only for the TFTP protocol analysis for compliance of the observed packet sequence with the rules established for this protocol. All this limits the use of an analog device for protocol analysis in modern high-speed computer networks.

A device is known according to RF Patent No. 2313128 "Information Search Device" IPC G06F 9/46, published on December 20, 2007, Bull. Number 35. This device contains N≥2 mask storage blocks, N selection blocks, a frequency divider, a time interval shaper, a search strategy register, a transition mask address generation block, and an indication block. The device provides an extension of the scope and speed of analysis of the incoming packets of the prototype device by identifying the packets by parallel analysis of the values of the signs of identification and monitoring the sequence of their exchange for compliance with any a priori specified rules.

However, this device has a drawback - a relatively low probability of timely information retrieval in the context of continuous dynamics of changing states of different priority requests for information search and taking into account influencing factors.

Of the known closest analogue (prototype) in its technical essence to the claimed device is the device according to RF Patent No. 2553093 "Information Search Device" IPC G06F 9/46, published on June 10, 2015, Bull. No. 16.

The prototype device includes N≥2 mask storage blocks, N selection blocks, a frequency divider, a time interval shaper, a search strategy register, a transition mask address generation block, an indication block, N search selection time controllers, a main search time controller and a clock generator.

In the prototype device, the clock input of the frequency divider is the first clock input of the device, and the output of the frequency divider is connected to the clock input of the time slot driver, and K-bit, where K = (log ₂ N) +1, the “Event code” output of the formation unit transition mask addresses are connected to the K-bit inputs “Event code” of the search strategy register and display unit, respectively, the write permission inputs of the N mask storage units are combined and are the device write enable input, L-bit information inputs, where L≥2, N are selection blocks combined and are the L-bit information input of the device. The first L-bit inputs "Mask 1" and "Mask 2" of N mask storage units are the first L-bit inputs, respectively, "Mask 1" and "Mask 2" of the device, the second L-bit outputs are "Mask 1" and "Mask 2 "N mask storage units are connected to the second L-bit inputs" Mask 1 "and" Mask 2 "of the corresponding selection blocks, the input" Initial reset "of the time interval generator is connected to the input" Initial reset "of the transition mask address generation unit and is the input" Initial resetting the device, at the same time, the M-bit input “Time-out code” of the time slot generator, where M≥2 is the bit length of the time-out code, is the M-bit input “Time-out code” of the device, and the output of the time interval generator is connected to the input “Reset” of the transition mask address generation unit, the search strategy register register output is connected to the signal inputs of the time interval generator and the transition mask address generation unit, K-bit address input, control The main input, the N-bit information input and the enable input of the search strategy register are respectively the K-bit address input that controls the input, the N-bit information input and the enable input of the device, the “Choice of crystal” and “Read / write” inputs of the search strategy register are respectively, the “Choice of crystal” and “Read / write” inputs of the device, the N-bit input “Search completion rule” and the “Search result” output of the display unit are respectively the N-bit input “Search completion rule” and the “Search result” output of the device. In this case, the output “Comparison Result” of the nth selection block, where n = 1, 2, ..., N, is connected to the input “Comparison Result” of the n-th selection search time controller, the output “Comparison Result” of which is connected to the nth the “Result of comparison” input of the search strategy register and with the nth input “Comparison result” of the transition mask address generating unit, the output of the clock generator is connected to the clock input of the nth selection block, whose “Zeroing” input is the nth “Zeroing” input "The device, and the S-bit correcting input, where S≥2 is the bit depth of the correcting code for the search time, of the nth selection block is combined with the S-bit test input of the nth selection search time controller and is connected to the nth S-bit output the main controller of the search time, N S-bit inputs of which are the corresponding N S-bit inputs "Correction of the maximum search time" of the device.

Such a scheme, in comparison with analogue devices, makes it possible to increase the likelihood of timely information retrieval in the conditions of continuous dynamics of changing state of search queries and taking into account influencing factors, due to decryption, dynamic correction and synchronization of values (boundaries) of the maximum search time for each specific scenario ( search query).

However, the prototype has a drawback - the relatively low reliability of determining the type of expected blocks of binary information (BDI), in conditions typical of search processes that occur in real systems, when the parameters of the search script (values of identification signs (bit masks) and their sequence) can be fuzzy.

This device allows you to implement search queries taking into account the dynamics of control actions and external factors, taking into account the current requirements of subscribers to the timeliness of information retrieval, while searching for information in real systems, models are widely used [1-5], objectively based on qualitatively, fuzzy given values of the parameters of the search script, where the values of identification signs (bit masks) and the order of their sequence is not only quantitative - unambiguously, clearly identifiable, but also fuzzy (identifiable only at a qualitative level) character, traditionally described using linguistic variable and math fuzzy sets.

By “search” is meant a parallel analysis of the values of the BDI identification signs and control of their order for compliance with the given rules - determination of a code of the BDI type.

By “search script” is meant the classical method of formal graphics that defines the given rules for following the BDI.

Under the "sign of identification" refers to the values of the bits in the corresponding positions of the BDI.

Under the "code type BDI" refers to the code corresponding to the search script and, from the point of view of the physics of the process, the address at which the transition mask is stored in the random access memory that defines this particular type of expected BDI.

By “search script parameters” is meant a set of parameters that describe the rules for following blocks of binary information — a set (set of code bits) of identification signs (bit masks) of these blocks and the order in which they follow.

Under the "implementation of search queries" is understood the totality of the information and inquiry (search) system, including fetching a query to search for information from the queue, allocating a resource to this query, and actually searching for information in accordance with a given search script, as well as conducting final operations. Search request - sending a search signal that initiates a response.

The aim of the invention is to develop a device that improves the reliability of determining the type of expected blocks of binary information by providing the ability to search for information, taking into account the presence of not only unambiguously defined, but also unclearly set (observable) values for the parameters of the search script (address of bit masks) - values of a code like BDI and the order of their sequence, the creation of an information search device that can with high reliability implement search queries specific to real search engines - when search scripts have both quantitative and qualitative, fuzzy (involving a linguistic variable) pronounced physical meaning when these scenarios are implemented in conditions of fuzzy data on the true values of the search parameters.

This goal is achieved by the fact that in a known information search device containing N≥2 mask storage units, N selection blocks, a frequency divider, a time shaper, a search strategy register, a transition mask address generating unit, an indication unit, N search time selector controllers, the main search time controller and a clock generator, an analysis unit for the fuzzy search script is also included, designed for preliminary analysis of the mathematical nature of a code of the BDI type - it is specified parametrically (quantitatively or probabilistically) or using the membership function characteristic of fuzzy sets, and a fuzzy transformation unit search script, designed to transform the source data (code type BDI) specified in fuzzy form to a form suitable for obtaining clear, unambiguous (reliable) results of a specific search script. In this case, the clock input of the frequency divider is the first clock input of the device, and the output of the frequency divider is connected to the clock input of the time slot generator, the recording permission inputs of N mask storage units are combined and are the recording permission input of the device, L-bit information inputs, where L≥2, N selection blocks are combined and are the L-bit information input of the device. Moreover, the first L-bit inputs "Mask 1" and "Mask 2" N mask storage units are the first L-bit inputs, respectively, "Mask 1" and "Mask 2" of the device. The second L-bit outputs "Mask 1" and "Mask 2" of the N mask storage units are connected to the second L-bit inputs "Mask 1" and "Mask 2" of the corresponding selection blocks. The “Initial reset” input of the time interval generator is connected to the “Initial reset” input of the transition mask address generation unit and is the “Initial reset” input of the device. At the same time, the M-bit input “Time-out code” of the time slot generator, where M≥2 is the bit depth of the time-out code, is the M-bit input “Time-out code” of the device, and the output of the time interval generator is connected to the “Reset” input of the block the formation of the address of the mask transitions, the signal output of the register of the search strategy is connected to the signal inputs of the shaper time intervals and the block forming the address of the mask transitions. Moreover, the K-bit address input, where K = (log ₂ N) +1, the control input, the N-bit information input, and the search register enable input are the K-bit address input, the control input, the N-bit information input, and enable the input of the device, the inputs “Choice of Crystal” and “Read / Write” of the search strategy register are respectively the inputs “Choice of Crystal” and “Read / Write” of the device, the N-bit input “Rule of completion of the search” and the output “Search Result” of the display unit are accordingly, the N-bit input "Search termination rule" and the output "Search result" of the device. In this case, the output “Comparison Result” of the nth selection block, where n = 1, 2, ..., N, is connected to the input “Comparison Result” of the n-th selection search time controller, the output “Comparison Result” of which is connected to the nth input “Comparison Result” of the search strategy register and with the nth input “Comparison Result” of the transition mask address generation unit. The output of the clock generator is connected to the clock input of the nth selection block, the “Zeroing” input of which is the nth “Zeroing” input of the device. In this case, the S-bit correction input, where S≥2 is the bit depth of the search time correction code, of the nth selection block is combined with the S-bit verification input of the nth selection search time controller and connected to the nth S-bit output of the main controller search time, N S-bit inputs of which are the corresponding N S-bit inputs "Correction of the maximum search time" of the device. Moreover, the K-bit output “Event code” of the transition mask address generation unit is connected to the K-bit information input of the fuzzy search script analysis unit, K test outputs of which are connected to the corresponding K test inputs of the fuzzy search script conversion block, whose K-bit output and K -digit transit output of the fuzzy search script analysis unit are interconnected and are K-bit inputs “Event code” of the search strategy register and display unit, respectively.

The fuzzy search script analysis unit consists of a storage register and a counter. In this case, the K-bit input of the counter is the K-bit information input of the block, K outputs of the counter are connected to the corresponding K inputs of the storage register. Moreover, the K-bit transit output of the storage register is the K-bit transit output of the block, K test outputs of the storage register are the corresponding K test outputs of the analysis block of the fuzzy search script.

The fuzzy search script conversion block consists of a register, augmentation calculation element, main and auxiliary storage elements, main and auxiliary analyzers, a union calculation element, and a calculator. In this case, the bits of the K-bit output of the computer and the corresponding bits of the K-bit output of the register are combined and are the K-bit output of the conversion block of the fuzzy search script, K inputs of the register are the corresponding K test inputs of the block, K primary outputs of the register are connected to the corresponding K primary inputs of the element calculating additions to the corresponding K inputs of the main storage element, K secondary outputs of the register are connected to the corresponding K secondary inputs of the calculation element of additions and to the corresponding K direct inputs of the auxiliary storage element, K outputs of the main storage element are connected to the corresponding K main inputs of the main analyzer, K outputs auxiliary storage element is connected to the corresponding K main inputs of the auxiliary analyzer, K additional inputs of the main analyzer are connected to the corresponding K primary outputs of the complement calculation element. Moreover, K secondary outputs of the complement analysis element are connected to the corresponding K additional inputs of the auxiliary analyzer, K outputs of the main analyzer are connected to the corresponding K primary inputs of the union analysis element, K secondary inputs of which are connected to the corresponding K outputs of the auxiliary analyzer, K outputs of the union calculation element are connected to the corresponding K additional inputs of the complement calculation element corresponding to K additional inputs of the auxiliary storage element and corresponding K inputs of the calculator.

Thanks to a new set of essential features, due to the introduction of an analysis block for a fuzzy search script that provides a consistent comparison (by the number of binary numbers that describe any of the K bits of the code of the BDI type) the source data (code of the BDI type) coming in the binary code and the decision on their mathematical nature (a BDI type code is set parametrically or using the membership function characteristic of fuzzy sets), as well as a fuzzy search script conversion unit that transforms a BDI type code specified in fuzzy form to a form suitable for obtaining clear, unambiguous (reliable) results a specific search script, in the claimed device, it is possible to increase the reliability of the implementation of search queries by providing the possibility of additional verification of the search script parameters (code type BDI), taking into account the presence of not only quantitative, but also fuzzy (involving a linguistic variable) data on the values of these parameters.

The claimed device is illustrated by drawings, on which are presented:

in FIG. 1 is a structural diagram of an information retrieval device;

in FIG. 2 is a block diagram of a fuzzy search script analysis unit;

in FIG. 3 is a block diagram of a fuzzy search script conversion unit;

) блока хранения маски;in FIG. 4 is a block diagram of the nth (

) mask storage unit;

) блока селекции;in FIG. 5 is a block diagram of the nth (

) selection block;

in FIG. 6 is a structural diagram of a shaper of time intervals;

in FIG. 7 is a block diagram of a search strategy register;

in FIG. 8 is a block diagram of a transition mask address generating unit;

in FIG. 9 is a structural diagram of a display unit;

) селекционного контроллера времени поиска;in FIG. 10 is a block diagram of the nth (

) selection controller search time;

in FIG. 11 is a block diagram of a main search time controller;

in FIG. 12 is an example search script;

in FIG. 13 is an example of filling transition masks, script start masks and script end masks.

The device (see Fig. 1) consists of N, where N≥2, mask storage blocks 1 ₁ -1 _N , N selection blocks 2 ₁ -2 _N , frequency divider 3, time slot former 4, search strategy register 5, block the formation of the address of the transition mask 6, display unit 7, N selection search time controllers 8 ₁ -8 _N , the main search time controller 9, the clock generator 10, the fuzzy search script analysis unit 11 and the fuzzy search script conversion unit 12.

The elements are interconnected as follows (see Fig. 1). The clock input 38 of the frequency divider 3 is the first clock input 08 of the device, and the output 39 of the frequency divider 3 is connected to the clock input 41 of the time interval shaper 4. The recording permission inputs 10 ₁ -10 _N N mask storage units 1 ₁ -1 _{N are} combined and are the input write permissions 01 device. L-bit information inputs 21 ₁ -21 _N , where L≥2, N selection blocks 2 ₁ -2 _{N are} combined and are L-bit information input 04 of the device. The first L-bit inputs “Mask 1” 12 _n and “Mask 2” 13 _{n of the} n-th block storage unit mask 1 _n , where n = 1, 2, ..., N, are the n-th first L-bit inputs respectively “Mask 1 ”02 _n and“ Mask 2 ”03 _n devices. The second L-bit outputs “Mask 1” 14 _n and “Mask 2” 15 _{n of the} n-th storage unit of mask 1 _{n are} connected to the corresponding second L-bit inputs “Mask 1” 22 _n and “Mask 2” 23 _n n-th selection block 2 _n . The input “Initial reset” 42 of the shaper of time intervals 4 is connected to the input “Initial reset” 63 of the unit for generating the address of the transition mask 6 and is the input “Initial reset” 05 of the device. At the same time, the M-bit input “Time-out code” 43 of the time slot generator 4, where M≥2 is the bit length of the time-delay code, is the M-bit input “Time-out code” 06 of the device, and the output 44 of the time interval generator 4 is connected to the “Reset” input 64 of the transition mask address generation unit 6. The signal output 59 of the search strategy register 5 is connected to the signal inputs 45 and 65 of the time slot generator 4 and the transition mask address generation unit 6, respectively. K-bit, where K = (log ₂ N) +1, address input 53, control input 54, N-bit information input 55 and enable input 58 of the search strategy register 5 are respectively K-bit address input 09, control input 010, N-bit information input 011 and enable input 014 of the device. The “Choice of Crystal” inputs 56 and “Read / Write” 57 of the search strategy register 5 are the inputs of the “Choice of Crystal” 012 and “Read / Write” 013 of the device, respectively. The N-bit input “Search completion rule” 72 and the “Search result” output 73 of the display unit 7 are respectively the N-bit input “Search completion rule” 07 and the “Search result” output 015 of the device. The outputs “Comparison result” 26 ₁ -26 _N selection blocks 2 ₁ -2 _{N are} connected to the corresponding inputs “Comparison result” 81 ₁ -81 _{N of the} corresponding selection controllers for search time 8 ₁ -8 _N , the outputs “Comparison result” 83 ₁ -83 _{N of} which are connected to the corresponding inputs “Comparison Result” 51 ₁ -51 _{N of the} search strategy register 5 and to the corresponding inputs “Comparison Result” 61 ₁ -61 _{N of the} block for generating the address of the transition mask 6. The output 101 of the clock generator 10 is connected to the clock inputs 25 ₁ -25 _{N of} each of the N selection blocks 2 ₁ -2 _N , the inputs of “Zeroing” 24 ₁ -24 _{N of} which are the corresponding inputs of “Zeroing” 017 ₁ -017 _{N of the} device. Moreover, S-bit, where S≥2 is the bit depth of the search time correction code, the correction input 27 _{n of the} n-th selection block 2 _{n is} connected to the S-bit test input 82 _{n of the} n-th selection search time controller 8 _n and connected to n- S-bit output 92 _{n of the} main controller of the search time 9, N S-bit inputs 91 ₁ -91 _{N of} which are the corresponding N S-bit inputs "Correction of the maximum search time" 016 device. In this case, the K-bit output "Event Code" 62 of the block for generating the address of the transition mask 6 is connected to the K-bit information input 111 of the analysis block for the fuzzy search script 11, K of the test outputs 112 ₁ -112 _{K of} which are connected to the corresponding K test inputs 121 ₁ - 121 _K of the conversion block of the fuzzy search script 12, the K-bit output 122 of which and the K-bit transit output 113 of the analysis block of the fuzzy search script 11 are interconnected and are K-bit inputs "Event code" 52 and 71 of the search strategy register 5 and block indications 7 respectively.

The number “N, (N≥2)” (blocks, bits, inputs, outputs, etc.) is determined in accordance with the possible number of types of BDIs (they determine the total number of transition masks characterizing the composition of the search scripts) and, as a rule, ranges from 2 (two) to 500 (five hundred).

The number "K, (where K = (log ₂ N) +1)" characterizes the capacity of the code of the address of the transition mask, the address at which the transition mask is stored in the random access memory, which determines the type of data expected according to the search script. In other words, this number of bits is sufficient for addressing N transition masks and the mask of the beginning of the search script, as a rule, ranges from 2 (two) to 20 (twenty).

The number "M, (M≥2)" characterizes the length of the time-out code — the code of the valid time interval during which the next BDI is expected, specified by the search script and, as a rule, ranges from 2 (two) to 10 (ten).

The number "L, (L≥2)" characterizes the maximum possible number of bits in the BDI used in the search script and ranges from 2 (two) to 10 (ten).

The number "S, (S≥2)" characterizes the capacity of the correcting code for the search time, the capacity of the code that determines the initial or corrected (new) value of the maximum search time for each specific scenario (search query) and, as a rule, is from 2 (two ) to 10 (ten).

The fuzzy analysis script analysis unit 11 shown in FIG. 2, is intended for preliminary sequential comparison (by the number of binary numbers characterizing any of the K bits of the code of the BDI type) of the input data in the binary code (the code of the BDI type) and the decision on their mathematical nature - the BDI type code is specified parametrically or using the function belonging to fuzzy sets.

The analysis block fuzzy search script 11 (Fig. 2) consists of a storage register 11.1 and a counter 11.2. The K-bit input 11.2-1 of the counter 11.2 is the K-bit information input 111 of the block 11, K outputs 11.2-2 ₁ -11.2-2 _{K of the} counter 11.2 are connected to the corresponding K inputs 11.1-2 ₁ -11.1-2 _K of the storage register 11.1. Moreover, the K-bit transit output 11.1-3 of the storage register 11.1 is the K-bit transit output 113 of the block 11, K test outputs 11.1-1 ₁ -11.1-1 _K of the storage register 11.1 are the corresponding K test outputs 112 ₁ -112 _K of the fuzzy analysis unit search script 11.

The storage register 11.1 of the analysis block of the fuzzy search script 11 is intended to store data and make decisions about the mathematical nature of the source data - a code of the type BDI, this parameter of the search script is observed (set) parametrically: quantitatively, probabilistically or qualitatively, using the membership function characteristic of fuzzy sets. Storage register 11.1 can be implemented on the basis of a typical memory register described in the literature [Averchenkov O.E. Circuitry: equipment and programs. - M .: DMK Press, 2012 .-- 588 p., S. 443-445, Fig. 12.8].

The counter 11.2 of the fuzzy search script block 11 is intended for registration and sequential comparison (by the number of binary numbers describing any of the K bits of the BDI type code) received in the binary data code (BDI type code) characterizing the address at which the strategy register has a random access memory a search mask is stored transition mask that determines the type of expected, according to the search script, BDI. The technical implementation of counter 11.2 is possible on the basis of a commercially available synchronous binary counter, as shown in [Averchenkov O.E. Circuitry: equipment and programs. - M .: DMK Press, 2012 .-- 588 p., S. 459-460, fig. 13.5].

The fuzzy conversion script search unit 12 shown in FIG. 3, is intended to transform a code of the BDI type specified in fuzzy form to a form suitable for obtaining clear, unambiguous (reliable) results of a specific search scenario.

The fuzzy search script conversion block 12 (Fig. 3) consists of a register 12.1, an element of calculation of addition 12.2, a main 12.3 and an auxiliary 12.4 storage elements, a main 12.5 and an auxiliary 12.6 analyzers, an element of calculation of the union 12.7 and a calculator 12.8. Moreover, the bits of the K-bit output 12.8-2 of the calculator 12.8 and the corresponding bits of the K-bit output 12.1-4 of the register 12.1 are combined and are the K-bit output 122 of the conversion block of the fuzzy search script 12, K inputs 12.1-1 ₁ -12.1-1 _K register 12.1 are the corresponding K test inputs 121 ₁ -121 _{K of the} block 12, K primary outputs 12.1-2 ₁ -12.1-2 _{K of the} register 12.1 are connected to the corresponding K primary inputs 12.2-1 ₁ -12.2-1 _K of the calculation element of addition 12.2 and to corresponding K inputs 12.3-1 ₁ -12.3-1 _{K of the} main storage element 12.3, K secondary outputs 12.1-3 ₁ -12.1-3 _{K of the} register 12.1 are connected to the corresponding K secondary inputs 12.2-2 ₁ -12.2-2 _K of the calculation element of addition 12.2 and to the corresponding K direct inputs 12.4-1 ₁ -12.4-1 _{K of the} auxiliary storage element 12.4, K outputs 12.3-2 ₁ -12.3-2 _{K of the} main storage element 12.3 are connected to the corresponding K main inputs 12.5-1 ₁ -12.5-1 _K main analyzer 12.5, K outputs 12.4-2 ₁ -12.4 -2 _K auxiliary storage element 12.4 connected to the corresponding K main inputs 12.6-1 ₁ -12.6-1 _K auxiliary analyzer 12.6, K additional inputs 12.5-2 ₁ -12.5-2 _K main analyzer 12.5 connected to the corresponding K primary outputs 12.2-3 ₁ -12.2-3 _K of the calculation element of appendix 12.2. Moreover, K secondary outputs 12.2-4 ₁ -12.2-4 _K of the calculation element of addition 12.2 are connected to the corresponding K additional inputs 12.6-2 ₁ -12.6-2 _{K of the} auxiliary analyzer 12.6, K outputs 12.5-3 ₁ -12.5-3 _{K of the} main analyzer 12.5 connected to the corresponding K primary inputs 12.7-1 ₁ -12.7-1 _K of the calculation element of the combination 12.7, K of the secondary inputs 12.7-2 ₁ -12.7-2 _{K of} which are connected to the corresponding K outputs 12.6-3 ₁ -12.6-3 _{K of the} auxiliary analyzer 12.6 , K outputs 12.7-3 ₁ -12.7-3 _K of the combination calculation element 12.7 are connected to the corresponding K additional inputs 12.2-5 ₁ -12.2-5 _K of the calculation element of addition 12.2, corresponding to K additional inputs 12.4-3 ₁ -12.4-3 _{K of the} auxiliary storage element 12.4 and the corresponding K inputs 12.8-1 ₁ -12.8-1 _{K of the} calculator 12.8.

Register 12.1 of the conversion block of the fuzzy search script 12 is intended for recording and sorting the incoming fuzzy information into two components, according to the initial number of expert opinions about each of K fuzzy observable (set) values of the BDI type code, characterizing the address at which the strategy register is in the RAM a search mask is stored transition mask that determines the type of expected, according to the search script, BDI. In addition, register 12.1 is intended for recording the fuzzy search script coming from the analysis unit, registering and setting logical zero values on all bits of its K-bit output and on the corresponding bits of the K-bit output of the fuzzy search script conversion block. Register 12.1 can be technically implemented on the basis of a commercially available binary synchronous counter with serial transfer on T-flip-flops, as described in [Ugryumov EP Digital circuitry: textbook. manual for universities. - 3rd ed., Revised. and add. - SPb .: BHV-Petersburg, 2010 .-- 816 p., Pp. 240-242, fig. 4.28].

The calculation element of addition 12.2 of the transformation block of the fuzzy search script 12 is intended to implement the procedure of arithmetic subtraction from the unit of values of membership functions of fuzzy sets. A special case of the technical implementation of the calculation element of Appendix 12.2 can be the usual arithmetic logic unit (ALU), described, for example, in [Fundamentals of Electronics: a textbook for open source software / O.V. Milovzorov, I.G. Punk - 5th ed., Revised. and add. - M.: Yurayt Publishing House, 2016 .-- 407 p. S. 186-189, fig. 3.8.1].

The main 12.3 and auxiliary 12.4 storage elements of the conversion block of the fuzzy search script 12 are intended, respectively, to store fuzzy initial information coming from the first and second expert (from expert U ₁ and U ₂ ), i.e. for storing quantitatively expressed two (according to the initial number of experts) expert opinions about each of K fuzzy observable (set) values of a code of the BDI type, characterizing the address at which a transition mask is stored in the RAM of the search strategy register that determines the type of BDI expected according to the scenario search. The main storage element 12.3 can be technically implemented in the form of a commercially available dynamic random-access memory device, as shown in the literature [Fundamentals of Electronics: textbook for open source software / O.V. Milovzorov, I.G. Punk - 5th ed., Revised. and add. - M.: Yurayt Publishing House, 2016 .-- 407 p. S. 229-231, Fig. 4.3.2]. Auxiliary storage element 12.4 differs from the main storage element 12.3 only in the presence of additional K inputs (12.4-3 ₁ -12.4-3 _K ), which technically can be easily combined with the corresponding K direct inputs (12.4-1 ₁ -12.4-1 _K ), which allows for the implementation of an auxiliary storage element 12.4 similarly to the main storage element 12.3, in the form of dynamic random access memory, as described in [Fundamentals of Electronics: textbook for STR / OV Milovzorov, I.G. Punk - 5th ed., Revised. and add. - M.: Yurayt Publishing House, 2016 .-- 407 p. S. 229-231, Fig. 4.3.2].

The main analyzer 12.5 of the transformation block of the fuzzy search script 12 is designed to determine the intersection of fuzzy sets — the intersection of the complement of the fuzzy set formulated by the expert U ₁ with the fuzzy set formulated by the expert U ₂ . The main analyzer 12.5 can be technically implemented on the basis of a digital comparison node, as shown in [Ugryumov EP Digital circuitry: textbook. manual for universities. - 3rd ed., Revised. and add. - SPb .: BHV-Petersburg, 2010 .-- 816 p., S. 102-104, fig. 2.6].

The auxiliary analyzer 12.6 of the fuzzy search script transformation block 12 is intended to determine the intersection of fuzzy sets — the intersection of the fuzzy set formulated by the expert U ₁ with the addition of the fuzzy set formulated by the expert U ₂ . The auxiliary analyzer 12.6 can also be technically implemented on the basis of a digital comparison node, as described in [Ugryumov EP Digital circuitry: textbook. manual for universities. - 3rd ed., Revised. and add. - SPb .: BHV-Petersburg, 2010 .-- 816 p., S. 102-104, fig. 2.6].

The element for calculating the union 12.7 of the transformation block of the fuzzy search script 12 is intended to implement the final cycle of disjunctive summation - determining the union of fuzzy sets. The union calculation element 12.7 is a digital comparison node and can be technically implemented as a commercially available high-speed digital comparator, as shown in [Averchenkov O.E. Circuitry: equipment and programs. - M .: DMK Press, 2012 .-- 588 p., S. 428-429, Fig. 11.9].

The calculator 12.8 of the fuzzy search script conversion block 12 is intended for the final obtaining of clear, unambiguous (reliable) values of the parameters of a specific search script - for the unambiguous selection (assignment) of quantitative values of the code of the BDI type, characterizing the address at which the mask is stored in the RAM of the search strategy register transitions, which determines the type of NDI expected according to the search script. The computer 12.8 is a commercially available programmable TTL comparator type 74LS85, described in the reference [TTL chips. Volume 1 .: Per. with him. - M.: DMK Press, 2001 .-- 384 p. (reference book), S. 143-144, fig. b / n].

) блока хранения маски, на фиг. 4.The mask storage blocks 1 ₁ -1 _N included in the general block diagram are identical and are designed to store bit masks used to identify elements of the incoming data stream. The principle of operation and the structure of mask storage units are known, described in the prototype (see RF Patent No. 2553093 “Information Search Device” IPC G06F 9/46, published June 10, 2015, Bull. No. 16, Fig. 5), the structural diagram is illustrated , by the example of the nth (

) of the mask storage unit, in FIG. 4.

) БС, на фиг. 5. The selection blocks 2 ₁ -2 _N included in the general block diagram are identical and designed to control and identify the corresponding elements of the incoming data stream, generate a search result, control the remaining search time, and generate control signals after a set initial or newly entered into the dynamics search time controls for each search query. The structure of the selection blocks (BS) and their operation algorithm are known, described in detail in the prototype (see RF Patent No. 2553093 "Information Search Device" IPC G06F 9/46, published June 10, 2015, Bull. No. 16, Fig. 4) , the structural diagram is shown, for example, n-th (

) BS, in FIG. five.

The frequency divider 3, which is part of the general block diagram, is designed to increase the period of the sequence of pulses arriving at its input. The implementation scheme of the frequency divider is known and described in the prototype (see RF Patent No. 2553093 "Information Retrieval Device" IPC G06F 9/46, published June 10, 2015, Bull. No. 16). In particular, the frequency divider 3 can be implemented as a counter of pulse duration and frequency based on the KR155IE6 chip, as described in [Averchenkov O.E. Circuitry: equipment and programs. - M .: DMK Press, 2012 .-- 588 p., S. 468-469, Fig. 13.3]. In this case, the input of the divider will be the counter input of the counter, and the output of the divider will be one of the outputs of the counter.

Shaper time intervals 4, which is part of the general structural diagram, is designed to control the time interval between the elements of the incoming data stream and the formation of the signal after it. The structure and operation principle of the time interval shaper are known, described in detail in the prototype (see RF Patent No. 2553093 “Information Search Device” IPC G06F 9/46, published June 10, 2015, Bull. No. 16, Fig. 6), the diagram is shown in FIG. 6.

The search strategy register 5, which is part of the general block diagram, is designed to verify that the sequence of the verified elements of the incoming data stream (code type BDI) follows the given rules and generates a signal when an element arrives expected in accordance with the rules. The composition of the elements and the principle of operation of the search strategy register are known, described in detail in the prototype (see RF Patent No. 2553093 “Information Search Device” IPC G06F 9/46, published June 10, 2015, Bull. No. 16, Fig. 7), structural a register circuit is shown in FIG. 7.

The block for generating the address of the transition mask 6, which is part of the general block diagram, is designed to generate and store a code of the BDI type corresponding to the mask defining the next element that should be verified in the incoming data stream. The principle of operation, composition and interconnection of the elements of the transition mask address forming unit are known and described in detail in the prototype (see RF Patent No. 2553093 “Information Search Device” IPC G06F 9/46, published June 10, 2015, Bull. No. 16, FIG. 8), a block diagram is shown in FIG. 8.

Indication block 7, which is part of the general block diagram, is designed to detect signs (values of search script parameters) that indicate the completion of the sequence of elements of the incoming data stream (code of type BDI) specified by the rules and the formation of the corresponding signal. The structure and operation of the display unit are known, described in the prototype (see RF Patent No. 2553093 "Information Search Device" IPC G06F 9/46, published June 10, 2015, Bull. No. 16, Fig. 9), the structural diagram is shown in FIG. nine.

) СКВП, на фиг. 10.Selective search time controllers 8 ₁ -8 _N , included in the general structural diagram, are identical and are intended for decryption, additional comparison and control of a new S-bit code that introduces a new value (limits) of the maximum time, introduced into the dynamics of controlling the process of implementing search queries search for each specific search query. The structure of the selection search time controllers (SKVP) and the algorithm of their operation are known and described in detail in the prototype (see RF Patent No. 2553093 “Information Search Device” IPC G06F 9/46, published June 10, 2015, Bull. No. 16, FIG. 2), the structural diagram is depicted, for example, n-th (

) SCVP, in FIG. ten.

The main search time controller 9 is designed for dynamic correction of values (boundaries) of the maximum search time for each search query from any combination of N transition masks (search scripts). The principle of operation, composition, purpose and relationship of the elements of the main search time controller are known, described in detail in the prototype (see RF Patent No. 2553093 “Information Search Device” IPC G06F 9/46, published June 10, 2015, Bull. No. 16, FIG. . 3), a block diagram is shown in FIG. eleven.

The clock generator 10, which is part of the general block diagram, is designed to generate a synchronizing sequence of pulses. Technical implementation of the clock generator 10 is possible on the basis of a commercially available clock distributor described in [Averchenkov O.E. Circuitry: equipment and programs. - M .: DMK Press, 2012. - 588 p., S. 472-473].

The information retrieval device operates as follows.

It is known [1-5] that from the point of view of verification of a code of the BDI type, it is possible to recognize (determine) the data characterizing this code, observed and given both quantitatively and qualitatively, vaguely (with the use of a linguistic variable). This possibility is realized using the mathematics of fuzzy sets, fuzzy computational methods and algorithms that allow, through successive transformations, to carry out the transition from fuzzy recognized (observable, defined) data characterizing a BDI type code to a data type suitable for a clear, unambiguous decision on the values elements of this code as part of a specific search script. At the same time, the code characterizing the type of expected BDI - a specific search scenario and determining the appropriate transition masks can be verified on the basis of mathematical decision-making methods in poorly formalized problems - fuzzy computational methods and algorithms that can be quite easily implemented in hardware.

Fuzzy computational methods and algorithms work on the basis of expert estimates, and to solve the problem of combining the opinions of experts whose knowledge is used, for example, to verify code of the BDI type, one of the typical computational algorithms of the theory of fuzzy sets is used - the disjunctive summation algorithm of fuzzy sets. Given the fact that in the prototype the set of values of the code type BDI can be represented in the form

C = {s ₁ , s ₂ , ..., s _K }, (1)

then from the point of view of the approach to recognition (determination) of data characterizing this code, it is possible to represent the values of a code of type BDI not only quantitatively, numerically, but also fuzzy, in the form of a fuzzy set of values of a code of type BDI of the form:

, (2)

, (2)

- нечеткое значение кода типа БДИ.Where

- fuzzy value of the code type BDI.

In this case, the number K corresponds to the capacity of the code of the address of the transition mask (which determines the type of expected, according to the search script, BDI), is equal to (K = (log ₂ N) +1) and depends on the number of bits that are sufficient for addressing N transition masks and the start mask search script, from the number of experts and the corresponding number of inputs of devices for the hardware implementation of a computational fuzzy algorithm. In our case, K can take values from 2 (two) to 20 (twenty), corresponding to the number of inputs of a programmable TTL comparator type 74LS85, on the basis of which the calculator 12.8 of the fuzzy search script transformation block 12 is built.

In other words, the analysis of the results of [1-5] allows us to provide the device with the possibility of setting the code values of the BDI type described (observed) both quantitatively and vaguely (using a linguistic variable).

Formally, only the key expression (1) will change to expression (2), which characterizes, in our case, the fuzzy knowledge of the operators operating the device about the set of values of a code of the BDI type, the elements of which were obtained with the help of experts. This interpretation allows us to introduce an algorithm for sequentially reducing fuzzy identified data (code values of the type BDI) to a form that makes it possible to parametrically specify a search script.

To solve the problem of combining the opinions of experts on the values of a code of type BDI, one of the typical operations on fuzzy sets is used - the operation of disjunctive summation [1-5]. Moreover, the disjunctive sum, for example, of two fuzzy sets (by the number of experts), is determined in terms of associations and intersections as follows:

(3)

(3)

- нечеткое множество, характеризующее мнение первого U₁ (второго U₂) эксперта о конкретном k-ом (k=

) нечетко заданном (наблюдаемом) значении кода типа БДИ

;

- дополнения этих нечетких множеств.Where

is a fuzzy set characterizing the opinion of the first U ₁ (second U ₂ ) expert on a particular kth (k =

) fuzzy given (observable) value of the code of the BDI type

;

- complements of these fuzzy sets.

характеризует объединенное мнение (в нашем случае двух, U₁ и U₂) экспертов о значениях нечетко заданного (наблюдаемого) кода типа БДИ.Disjunctive Amount Received

characterizes the joint opinion (in our case of two, U ₁ and U ₂ ) of experts on the values of a fuzzy given (observed) code of the BDI type.

For the final identification (unambiguous choice) of the quantitative values of fuzzy parameters of the code type BDI, use the function [5]:

, (4)

, (4)

- функции принадлежности (степень уверенности) интегрированного мнения экспертов о значениях каждого из нечетко заданных (наблюдаемых) кода типа БДИ.characterizing the maximum value

- membership functions (degree of confidence) of the integrated expert opinion on the values of each of the fuzzy given (observable) code of the BDI type.

Thus, the analysis of works [1-5], the analysis of expressions (1) - (4) allow us to conclude that it is technically feasible to implement an unambiguous verification of a code such as the expected BDI with quantitative and fuzzy specified parameters. The computational fuzzy algorithm considered in [1-4] and described in detail in [5] (the disjunctive summation algorithm for fuzzy sets) allows mathematically correcting the fuzziness of the data characterizing the type of expected BDI, it allows one to unambiguously recognize (verify) the true code defined by a specific search scenario and appropriate transition masks at the current time, and ultimately, increase the reliability of determining the type of expected blocks of binary information, and, as a result, increase the reliability of performing search queries in conditions inherent in the real dynamics of the process of searching for information in packet-switched data networks, information and reference (search) systems, in social networks and in the global Internet - in conditions of fuzzy data on the true values of the search script parameters.

The input of the computational fuzzy algorithm receives data characterizing the values of a code of the BDI type and recognized (defined) both quantitatively and fuzzy. It is determined which of the data characterizing the BDI type code at a given time is quantified, and which data is not clearly identified. In order to verify the values of a code of the BDI type, it is necessary, mathematically correct, using the disjunctive summation of fuzzy sets, to transform the fuzzy data recognized. The stages of functioning of a computational fuzzy algorithm are described in detail, algorithmically and analytically in [5]. At the output of the computational fuzzy algorithm, we have an output image - data that clearly (reliably) characterizes the integrated opinion of experts about the belonging of code values of the BDI type to the space of reliable, verified code values.

With this in mind, the claimed device reliably recognizes fuzzy code values of the BDI type and, in accordance with the verified code values, implements a search script (implements search queries).

The technical implementation of the principle of increasing the reliability of recognition of fuzzy-set (observable) values of a BDI-type code in the claimed device is carried out by introducing a preliminary analysis (identification) of fuzzy values of a BDI-type code, as well as converting these values using fuzzy mathematics methods to a form that allows you to clearly verify and clearly (reliably) interpret the values of this code characterizing the type of specific expected BDI (in the claimed device, respectively, are implemented as part of the analysis block fuzzy search script 11 and the conversion block fuzzy search script 12).

может быть представлен следующей схемой:At the same time, as in the prototype, the claimed device implements a syntactic approach to pattern recognition [6], based on the identification of individual elements of the incoming data stream - BDI, by parallel analysis of the values of identification signs and control of their sequence for compliance with the given rules. As signs of identification, bit values are used in the corresponding positions of the BDI. The rules for following the BDI are set by the formal grammar - the search script. To explain the parallel analysis of the values of identification signs and control the order of their sequence, it is necessary to consider the rules for specifying a search script. Search script

can be represented by the following diagram:

,

,

Where:

,

- множество типов БДИ, входящих в состав сценария;

,

- many types of BDI included in the script;

,

- множество масок переходов;

,

- many transition masks;

- маска начала сценария поиска;

- mask of the beginning of the search script;

- маска окончания сценария поиска;

- mask for the end of the search script;

- время ожидания очередного БДИ.

- waiting time for the next BDI.

The identification of the type of BDI in the device is carried out by comparing the values of the identification bits of the BDI with their reference values. By identification bits are meant bits of the BDI, the values of which allow you to identify the type of BDI. For each type of BDI, a plurality of identification bits may be individual. In this regard, two bit masks are associated with each type of BDI:

,

,

Where:

- первая битовая маска БДИ

-го типа;

- first bit mask BDI

th type;

- вторая битовая маска БДИ

-го тип.

- second bit mask BDI

type.

Bit masks contain L bits, where L is the maximum possible number of bits in the BDI used in the search script. The first bitmask is intended to indicate the positions of the IDI identification bits. The values of the logical unit in the bits of the first bitmask correspond to the positions of the identification bits. In all other bits of the bitmask, logical zero values are set. The second bitmask is used to set the reference values to which the values of the identification bits must correspond. In this case, the bits of the second bitmask, which are not identification, can have arbitrary values, since they do not affect the process of identifying the BDI.

содержит информацию о типах БДИ, которые согласно сценария поиска ожидаются после наблюдения БДИ n-го типа. Указанная информация задается путем установки значения логического нуля в разрядах маски переходов, порядковые номера которых соответствуют типам ожидаемых БДИ. Во всех остальных разрядах маски переходов устанавливаются значения логической единицы.Many transition masks are used to set the order of the BDI in the script. The set contains N transition masks, each of which contains N binary digits. Thus, each type of BDI has its own transition mask. In this case, the nth transition mask

contains information about the types of data in the database that are expected according to the search script after observing the data in the n-th type. The specified information is set by setting the value of logical zero in the bits of the transition mask, the sequence numbers of which correspond to the types of expected BDI. In all other digits of the transition mask, the values of the logical unit are set.

The mask of the beginning of the search script is intended to indicate the types of the database that are expected first in the search script - the initial database. The MB mask contains N binary bits. In the bits of the mask at the beginning of the search script, the numbers of which correspond to the initial types of BDIs, logical zero values are set. In all other digits of the mask, the beginning of the search script sets the values of the logical unit.

The mask of the end of the search script is intended to indicate the types of BDI, the observation of which indicates the completion of the search script - the final BDI. The MF mask contains N binary bits. In the bits of the mask of the end of the search script, the numbers of which correspond to the final types of the BDI, the logical zero values are set. In all other bits of the mask of the end of the search script, the values of the logical unit are set.

In contrast to the search time, the waiting time for the next BDI T sets the maximum allowable time interval during which the next BDI specified by the type search script is expected. In the event that during the specified time interval the expected type of the BDI is not detected, the search script is interrupted and the transition to waiting for the initial BDI is performed. The waiting time for the next BDI is set in the form of an M-bit code. In this case, the smallest waiting time corresponds to the largest code, which is an addition to the maximum number represented in the M-bit code.

With this in mind, the claimed device provides controlled servicing of search queries and the implementation of user needs for reliable identification of elements of the incoming data stream.

,

, устройства соответствует множеству типов БДИ, входящих в состав сценария. При обнаружении очередного, заданного сценарием типа БДИ, устройство переходит в состояние, номер которого соответствует типу обнаруженного БДИ. Находясь в одном из состояний устройство ожидает появления БДИ, типы которых определяются маской переходов, номер которой соответствует номеру текущего состояния устройства.In general, the operation of the information retrieval device can be considered as the process of transition of this device from state to state. Many states

,

, the device corresponds to the many types of BDI that are part of the script. When it detects the next one specified by the script, the type of BDI, the device goes into a state whose number corresponds to the type of detected BDI. Being in one of the states, the device expects the appearance of a BDI, the types of which are determined by the transition mask, the number of which corresponds to the number of the current state of the device.

In FIG. 12 shows an example search script including N = 8 types of BDI. The transition mask filling, the script start mask, and the script end mask corresponding to the search scenario shown are shown in FIG. 13.

Initialization of the device includes the following operations:

initial reset of the device;

installation of the first and second bit masks;

setting the mask for the beginning of the script and transition masks;

setting the mask for ending the search script;

setting the waiting time for the next BDI;

setting the initial maximum search time.

The initial reset of the device is as follows. At the enable input 014 of the device, the value of the logical unit is set, which goes to the corresponding input 58 of the search strategy register 5. The logical unit at the enable input 58 of the register of search strategy 5, arriving at the third inputs 5.3 ₁ -3-5.3 _N -3 of all three-input elements OR- NOT 5.3 ₁ -5.3 _N (see Fig. 7), provides a logical zero at their outputs 5.3 ₁ -4-5.3 _N -4, regardless of the logical values set on the first 5.3 ₁ -1-5.3 _N -1 and second 5.3 ₁ -2-5.3 _N -2 inputs. In this regard, the signal output 59 of the register of the search strategy 5 will be set to a logical zero. Logical zero from the signal output 59 of the search strategy register 5 is fed to the corresponding input 45 of the time interval shaper 4 (see Fig. 6) and then to the first information input 4.2-1 (input J) of the JK trigger 4.2. At the input "Initial reset" 05 devices set the value of the logical unit, which is fed to the inputs 42 and 63 of the shaper time intervals 4 and the unit for generating the address of the transition mask 6, respectively. The value of the logical unit from the input "Initial reset" 42 of the shaper of time intervals 4 (see Fig. 6) through the first two-input element OR 4.1 is fed to the second information input 4.2-2 (input K) of the JK trigger 4.2, and through the second two-input element OR 4.6 - to the reset input (input R) of the counter 4.7. The logical unit at the input 4.2-2 (input K) of the JK-trigger 4.2 in the presence of a logical zero at its input 4.2-1 (input J) leads to the setting of a logical zero at the output 4.2-3 of the JK-trigger 4.2, which, arriving at the second input 4.3-2 of the two-input element AND 4.3, leads to the setting of a logical zero value at its output 4.3-3, regardless of the logical values at its first input 4.3-1. The logical unit at the reset input R of the counter 4.7 provides a logic zero at its overflow output P. The logical zero value from the overflow output P of the counter 4.7 goes to the second input 4.5-2 of the second two-input element And 4.5, which leads to the unconditional installation of 4.5- 3, and, accordingly, at the output "Reset" 44 of the shaper of time intervals 4, the value of logical zero. The logical unit from the input "Initial reset" 63 of the block forming the address of the transition mask 6 (see Fig. 8) through a two-input element OR 6.3 is fed to the reset input 6.4-3 (input R) of register 6.4, which leads to a logical zero at its outputs 6.4-4 (Q ₁ -Q _K ), and, accordingly, on all bits of the K-bit output "Event code" 62 of the block for generating the address of transition mask 6, on all K test outputs 112 ₁ -112 _K and on all bits of the K-bit transit 113 of the output of the analysis block of the fuzzy search script 11, as well as on all bits of the K-bit output 122 of the conversion block of the fuzzy search script 12.

Upon completion of the initial reset operation at the input “Initial reset” 05, the device sets a logical zero value, which leads to a logical zero value at the second information input 4.2-2 (input K) of the JK trigger 4.2 and at the reset input R of the counter 4.7 of the time interval shaper 4.

The installation of the first and second bit masks, providing identification of each of the N types of BDI, is carried out in the corresponding blocks of mask storage 1 ₁ -1 _N. For this, the first L-bit inputs of Mask 1 02 ₁ -02 _{N of the} device and the corresponding first L-bit inputs of Mask 1 12 ₁ -12 _{N of} each of N mask storage blocks 1 ₁ -1 _N are set to the corresponding first bit masks, and at the first L-bit inputs “Mask 2” 03 ₁ -03 _{N of the} device and the corresponding first L-bit inputs “Mask 2” 13 ₁ -13 _{N of} each of the N storage blocks of the mask 1 ₁ -1 _N set the corresponding second bit masks. At the write enable input 01 of the device and at the corresponding write enable inputs 10 ₁ -10 _{N of} each of the N mask storage units 1 ₁ -1 _N set the value of the logical unit, which goes to the initialization inputs (inputs C) of the first and second registers 1.1 and 1.2 of each from N mask storage blocks (see Fig. 4) and provides the recording of the first and second bit masks in the corresponding registers. At the end of the write operation, the write enable input 01 of the device and the corresponding write enable inputs 10 ₁ -10 _{N of} each of the N storage units of the mask 1 ₁ -1 _N set the value of logical zero.

,

, должна быть записана по адресу, соответствующему ее порядковому номеру, то есть адресу, значение которого равно n. Для этого на управляющем входе 010 устройства и, соответственно, на управляющем входе 54 регистра стратегии поиска 5 устанавливают значение логической единицы, которая, поступая на управляющий вход 5.1-3 (вход SE) селектора-мультиплексора 5.1 (см. фиг. 7), обеспечивает коммутацию второй группы информационных входов 5.1-2 (B₁-B_K) селектора-мультиплексора 5.1 на его выходы 5.1-4 (Q₁-Q_K), где K=(log₂N)+1 - количество двоичных разрядов, достаточное для адресации N масок переходов и маски начала сценария поиска. На K-разрядном адресном входе 09 устройства и, соответственно, на K-разрядном адресном входе 53 регистра стратегии поиска 5 устанавливают K-разрядный адрес, по которому в оперативное запоминающее устройство 5.2 должна быть записана маска начала сценария поиска. С выходов 5.1-4 (Q₁-Q_K) селектора-мультиплексора 5.1 K-разрядный адрес поступает на адресные входы 5.2-2 (A₁-A_K) оперативного запоминающего устройства 5.2. На N-разрядном информационном входе 011 устройства и, соответственно на N-разрядном информационном входе 55 регистра стратегии поиска 5 устанавливают маску начала сценария поиска, которая поступает на информационные входы 5.2-3 (D₁-D_N) оперативного запоминающего устройства 5.2. Запись осуществляется путем установки логического нуля на входах «Выбор кристалла» 012 и «Чтение/запись» 013 устройства, с которых логический ноль через входы «Выбор кристалла» 56 и «Чтение/запись» 57 регистра стратегии поиска 5 поступает на соответствующие входы 5.2-1 (

) и 5.2-4 (

) оперативного запоминающего устройства 5.2. По окончании записи маски на входе «Выбор кристалла» 012 устанавливают значение логической единицы. Затем на K-разрядном адресном входе 09 устройства устанавливают K-разрядный адрес, по которому в оперативное запоминающее устройство 5.2 должна быть записана первая маска переходов

(значение адреса равно 1), а на N-разрядном информационном входе 011 устройства устанавливают маску переходов

, после чего путем установки значения логического нуля на входе «Выбор кристалла» 012 инициируют операцию записи в оперативное запоминающее устройство 5.2. Аналогичным образом в оперативное запоминающее устройство записывают все

масок переходов. По окончании записи масок переходов в оперативное запоминающее устройство 5.2 на входе «Чтение/запись» 013 устанавливают значение логической единицы, а на управляющем входе 010 устройства устанавливают значение логического нуля, что обеспечивает коммутацию первой группы информационных входов 5.1-1 (A₁-A_K) селектора-мультиплексора 5.1 на его выходы 5.1-4 (Q₁-Q_K).The mask of the beginning of the search script and transition masks are set in the random access memory 5.2 of the search strategy register 5. In this case, the mask of the beginning of the search script MB must be written to the random access memory at the zero address, and the nth transition mask

,

, must be recorded at the address corresponding to its serial number, that is, an address whose value is n. To this end, at the control input 010 of the device and, respectively, at the control input 54 of the search strategy register 5, a value of a logical unit is set, which, when supplied to the control input 5.1-3 (input SE) of the selector-multiplexer 5.1 (see Fig. 7), provides switching of the second group of information inputs 5.1-2 (B ₁ -B _K ) of the selector-multiplexer 5.1 to its outputs 5.1-4 (Q ₁ -Q _K ), where K = (log ₂ N) +1 is the number of binary bits sufficient for addressing N transition masks and start script masks. On the K-bit address input 09 of the device and, accordingly, on the K-bit address input 53 of the search strategy register 5, a K-bit address is set at which the mask for the start of the search script should be written to the random access memory 5.2. From the outputs 5.1-4 (Q ₁ -Q _K ) of the selector-multiplexer 5.1, the K-bit address is supplied to the address inputs 5.2-2 (A ₁ -A _K ) of the random access memory 5.2. At the N-bit information input 011 of the device and, respectively, at the N-bit information input 55 of the search strategy register 5, a start script for the search script is set, which is fed to the information inputs 5.2-3 (D ₁ -D _N ) of the random access memory 5.2. Writing is performed by setting a logical zero at the inputs “Choice of crystal” 012 and “Read / write” 013 of the device from which a logical zero through the inputs “Choice of crystal” 56 and “Read / write” 57 of the search strategy register 5 is fed to the corresponding inputs 5.2- 1 (

) and 5.2-4 (

) random access memory 5.2. At the end of the recording mask at the input of "Crystal Select" 012 set the value of the logical unit. Then, a K-bit address is set at the K-bit address input 09 of the device, at which the first transition mask should be written to the random access memory 5.2

(the value of the address is 1), and on the N-bit information input 011 devices set the transition mask

then, by setting the value of logical zero at the input "Choice of crystal" 012 initiate the operation of writing to random access memory 5.2. Similarly, everything is written to the random access memory

transition masks. After writing the transition masks to the random access memory 5.2, the value “logical / 1” is set at the “Read / write” input 013, and the value 0 is set at the control input 010 of the device, which ensures switching of the first group of information inputs 5.1-1 (A ₁ -A _K ) selector-multiplexer 5.1 to its outputs 5.1-4 (Q ₁ -Q _K ).

Setting the mask for the end of the MF search script consists in setting the device and, therefore, on the bits of the N-bit input "Search completion rule" 72 of display unit 7 (see Fig. 9) the corresponding logical values corresponding to the values of the bits of the mask end of the search script.

Setting the waiting time for the next BDI is to set the device on the bits of the M-bit input "Time-out code" 06 and, therefore, on the bits of the M-bit input "Time-out code" 43 of the time interval shaper 4 (see Fig. 6), logical values corresponding to the digits of the timeout code.

) поискового запроса - набора конкретных типов БДИ (определяющего соответствующие маски переходов и характеризующего конкретный сценарий поиска).Setting the initial maximum search time consists in installing on bits of each of the N S-bit inputs “Correction of the maximum search time” 016 ₁ -016 _N devices (see Fig. 11) through S-bit inputs 27 ₁ -27 _N selection blocks 2 ₁ -2 _N to S-bit inputs 2.7 ₁ -1-2.7 _N -1 correction registers 2.7 ₁ -2.7 _N logical values of the code that sets the initial maximum search time for each n-th

) search query - a set of specific types of BDI (defining the appropriate transition masks and characterizing a specific search scenario).

After performing these operations, the device is ready for operation.

In the initial period, when the BDIs to be analyzed do not arrive at the input of the device, clock pulses are received from the external generator to the input 38 of the frequency divider 3 through the first clock input 08 of the device. From the output 39 of the frequency divider 3, clock pulses are fed to the second clock input 41 of the shaper of time intervals 4. As a result of the initial reset operation of the device at all information outputs 6.4-4 (Q ₁ -Q _K ) of register 6.4, and, accordingly, at all digits K -bit output “Event code” 62 of the transition mask generation unit 6 and, accordingly, at all K test outputs 112 ₁ -112 _K and at all bits of the K-bit transit 113 output of the fuzzy search script analysis block 11, as well as at all bits K -bit output 122 of the conversion block fuzzy search script 12, the value is set to logical zero. A logical zero value is set at the control input 54 of the search strategy register 5, which ensures switching of logical zero values from the bits of the K-bit input “Event code” 52 of the search strategy register 5 to the corresponding address inputs 5.2-2 (A ₁ -A _K ) of the random access memory devices 5.2. Thus, a zero address is set at the address input of the random access memory pointing to the mask of the beginning of the search script.

The values of logical zero from the bits of the K-bit output "Event code" 62 of the block forming the address of the transition mask 6 are supplied to the corresponding bits of the K-bit information input 111 of the analysis block of the fuzzy search script 11 (see Fig. 2). In this case, a code containing logical zero values in all digits is supplied through the K-bit information input 111 to the K-bit input 11.2-1 of the counter 11.2 and then from K outputs 11.2-2 ₁ -11.2-2 _{K of the} counter 11.2 to the corresponding K inputs 11.1-2 ₁ -11.1-2 _K of the storage register 11.1 of the fuzzy search script analysis block 11, which provides for the transit conversion (overwriting) of code values in the counter 11.2 and in the storage register 11.1 and the setting of logical zero values on all K test outputs 11.1-1 ₁ -11.1-1 _K of the storage register 11.1 and at the corresponding K test outputs 112 ₁ -112 _K of the analysis block of the fuzzy search script 11, as well as at all bits of the K-bit transit output 11.1-3 of the storage register 11.1 and at the corresponding bits of the K-bit transit exit 113 of block 11.

Logical zero values from K test outputs 112 ₁ -112 _K of the fuzzy search scenario analysis block 11 are supplied through K test inputs 121 ₁ -121 _{K of} block 12 to the corresponding K inputs 12.1-1 ₁ -12.1-1 _{K of} register 12.1 (see Fig. 3), which ensures the registration and establishment of logical zero values on all bits of the K-bit output 12.1-4 of register 12.1 and on the corresponding bits of the K-bit output 122 of the conversion block of the fuzzy search script 12.

) будет установлено значение логической единицы. Значения логической единицы с инверсных выходов 7.1-2₁-7.1-2_N (

) дешифратора 7.1 поступает на первые входы 7.2₁-1-7.2_N-1 соответствующих двухвходовых элементов ИЛИ 7.2₁-7.2_N. В результате на выходах 7.2₁-3-7.2_N-3 всех двухвходовых элементов ИЛИ 7.2₁-7.2_N устанавливается значение логической единицы вне зависимости от логических значений на их вторых входах. Это приводит к установке значения логической единицы на выходе 7.3-2 N-входового элемента И 7.3, а соответственно и на выходе «Результат поиска» 015 устройства. Логические значения на выходе «Результат поиска» 015 устройства имеют следующее значение: логический ноль на указанном выходе означает, что во входящем потоке БДИ обнаружен заданный сценарий поиска, а логическая единица - отсутствие заданного сценария поиска. На входе «Чтение/запись» 57 регистра стратегии поиска 5 установлено значение логической единицы, что обеспечивает перевод оперативного запоминающего устройства 5.2 в режим чтения информации. При этом на входе «Выбор кристалла» 56 регистра стратегии поиска 5 также установлено значение логической единицы. На разрешающем входе 014 устройства и, соответственно на разрешающем входе 58 регистра стратегии поиска 5 установлено значение логической единицы, что обеспечивает установку на сигнальном выходе 59 регистра стратегии поиска 5 значения логического нуля. При этом на выходе 4.2-3 JK-триггера 4.2 формирователя временных интервалов 4 (см. фиг. 6), на его первом 4.2-1 (вход J) и втором 4.2-2 (вход K) информационных входах установлено значение логического нуля.The values of logical zero from the bits of the K-bit transit output 113 of the analysis block of the fuzzy search script 11 and from the corresponding bits of the K-bit output 122 of the conversion block of the fuzzy search script 12, go to the corresponding bits of the input "Event code" 71 of the display unit 7 and then to the inputs 7.1-1 ₁ -7.1-1 _K (F ₁ -F _K ) of the 7.1 decoder (see Fig. 9). If there is a logical zero value at all inputs 7.1-1 ₁ -7.1-1 _K (F ₁ -F _K ) of the decoder 7.1, at all its inverse outputs 7.1-2 ₁ -7.1-2 _N (

) the logical unit value will be set. The values of the logical unit from the inverse outputs 7.1-2 ₁ -7.1-2 _N (

) of the decoder 7.1 is supplied to the first inputs 7.2 ₁ -1-7.2 _N -1 of the corresponding two-input elements OR 7.2 ₁ -7.2 _N. As a result, at the outputs 7.2 ₁ -3-7.2 _N -3 of all two-input elements OR 7.2 ₁ -7.2 _N , the value of the logical unit is set regardless of the logical values at their second inputs. This leads to setting the value of the logical unit at the output 7.3-2 of the N-input element AND 7.3, and, accordingly, at the output “Search result” 015 of the device. Logical values at the output “Search Result” 015 of the device have the following meaning: a logical zero at the specified output means that a specified search script has been detected in the incoming BDI stream, and a logical unit is the absence of a specified search script. At the input "Read / write" 57 of the register of the search strategy 5, the value of the logical unit is set, which ensures the transfer of random access memory 5.2 to the reading mode. At the same time, at the input “Choice of crystal” 56 register search strategy 5 also set the value of the logical unit. At the enable input 014 of the device and, respectively, at the enable input 58 of the search strategy register 5, a logical unit value is set, which ensures that the logic output 59 of the search strategy register 5 is set to a logical zero. At the same time, the output 4.2-3 of the JK-trigger 4.2 of the shaper of time intervals 4 (see Fig. 6), the first 4.2-1 (input J) and the second 4.2-2 (input K) information inputs are set to logical zero.

Upon receipt of the BDI to be analyzed, logical values corresponding to the values of the binary bits of the BDI are set at the L-bit information input 04 of the device. The moment of time corresponding to the installation of the BDI on the L-bit information input 04 of the device is denoted by T ₁ . From the L-bit information input 04 of the device BDI is fed to the L-bit information inputs 21 ₁ -21 _N selection blocks 2 ₁ -2 _N. Each selection block identifies the BDI of the corresponding type. The type of BDI is determined by the first and second bit masks, respectively, supplied to the second L-bit inputs "Mask 1" 22 ₁ -22 _N and the second L-bit inputs "Mask 2" 23 ₁ -23 _N selection blocks 2 ₁ -2 _N. In comparators 2.3 of each selection block 2 ₁ -2 _N (see Fig. 4), the values of the identification bits of the received BDI are compared with the values of the corresponding bits of the second bit mask. Identification bits are allocated in the first and second groups of two-input elements AND 2.1 ₁ -2.1 _L , 2.2 ₁ 1-2.2 _{L of} each selection block based on the corresponding first bit mask. If the compared values are equal, at the output of the equality “A = B” 2.3-3 of comparator 2.3, the value of the logical unit is set, otherwise, the value of the logical zero. The logical value corresponding to the comparison result from the output “A = B” 2.3-3 of comparator 2.3 in the case when only the initial maximum search time is set and there is no external dynamic control of the search time (there are no signals on the bits of each of the N S-bit inputs “Correction maximum search time "016 ₁ -016 _N devices), is inverted by the inverter 2.4 and goes to the output" Result of comparison "26 block selection 2.

In other words, if, during the analysis of incoming BDIs, there is no external dynamic control of the search time for all N search queries, on S-bit correcting inputs 27 ₁ -27 _N selection blocks 2 ₁ -2 _N , and therefore on S-bit inputs 2.7 ₁ -1-2.7 _N -1 correction registers 2.7 ₁ -2.7 _N , no code signals. In this case, the correction registers 2.7 ₁ -2.7 _N selection blocks 2 ₁ -2 _N (see Fig. 4) identify the initial search time codes as non-correctable and translate (rewrite) them each through its S outputs (2.7 ₁ -2 ₁ -2.7 ₁ -2 _S ) - (2.7 _N -2 ₁ -2.7 _N -2 _S ) to the corresponding S information inputs (D ₁ -D _S ) of the corresponding counters 2.5 ₁ -2.5 _N selection blocks 2 ₁ -2 _N.

) поискового запроса - набора конкретных типов БДИ, с внешнего устройства в S-разрядном коде (либо с помощью человека-оператора, либо с помощью специального управляющего устройства), через N S-разрядных входов «Коррекция максимального времени поиска» 016₁-016_N устройства на N S-разрядных входов 91₁-91_N главного контроллера времени поиска 9 (см. фиг. 3) поступают новые, дополнительно вводимые в динамике управления поиском, значения максимального времени поиска для конкретных поисковых запросов абонентов информационно-справочной (поисковой) системы.If during the identification of elements of the incoming data stream, external dynamic control of the search time for any nth (

) a search query - a set of specific types of BDIs, from an external device in an S-bit code (either using a human operator, or using a special control device), through N S-bit inputs "Correction of the maximum search time" 016 ₁ -016 _N devices on the N S-bit inputs 91 ₁ -91 _{N of the} main controller of the search time 9 (see Fig. 3) new, additionally entered in the dynamics of search control, values of the maximum search time for specific search queries of subscribers of the information-reference (search) system are received .

Additionally entered in the dynamics of search control, the values of the maximum search time for specific search queries of subscribers in the S-bit code are supplied through N S-bit inputs 91 ₁ -91 _{N of the} main controller of the search time 9 (see Fig. 11) to N S- bit inputs 9.1-1 ₁ -9.1-1 _{N of the} recording element of the search time 9.1 for monitoring and registration. From N S-bit outputs 9.1-2 ₁ -9.1-2 _{N of the} recording element of the search time 9.1 new values of the maximum search time are supplied to the corresponding N S-bit inputs 9.2-1 ₁ -9.2-1 _N of the storage element of the new value of the search time 9.2, which writes and stores these values in an S-bit code until the next control action is introduced, as well as from its N S-bit outputs 9.2-2 ₁ -9.2-2 _N , through the corresponding N S-bit outputs 92 ₁ -92 _{N of the} main search time controller 9, transmits these new values of the maximum search time to the correcting inputs 27 ₁ -27 _{N of the} corresponding selection blocks 2 ₁ -2 _N and to the test inputs 82 ₁ -82 _{N of the} corresponding selection controllers of the search time 8 ₁ -8 _N.

At the same time, on S-bit correcting inputs 27 ₁ -27 _N selection blocks 2 ₁ -2 _N , and therefore on S-bit inputs 2.7 ₁ -1-2.7 _N -1 correcting registers 2.7 ₁ -2.7 _N , there are S-bit code signals. The corrective registers 2.7 ₁ -2.7 _N selection blocks 2 ₁ -2 _N (see Fig. 5) register the initial code (recorded when preparing the device for operation, i.e., the initial maximum search time) and pre-compare it with the newly entered dynamics control S-bit code, which is supplied through the correction inputs 27 ₁ -27 _N selection blocks 2 ₁ -2 _N to S-bit inputs 2.7 ₁ -1-2.7 _N -1 correction registers 2.7 ₁ -2.7 _N.

) блока селекции 2_n . Если на S-разрядном входе 2.7_n-1 корректирующего регистра 2.7_n нет S-разрядного сигнала, обуславливающего новое, вводимое в динамике управления максимальное время поиска, то приоритетными признаются ранее записанные значения кода, задающего начальное максимальное время поиска. Correction (formation based on the results of preliminary comparison) at S outputs 2.7 _n -2 ₁ -2.7 _n -2 _S for example, a correction register 2.7 _n of a selection block of 2 _n code characterizing a preliminary decision on the value of the maximum search time for each specific nth query is carried out as follows (see Fig. 5). If there is an S-bit signal at the S-bit input 2.7 _n -1 of the correction register 2.7 _n , which causes a new maximum search time entered in the control dynamics, this signal is identified as priority, and it is it from S outputs 2.7 _n -2 ₁ -2.7 _n -2 _{S of the} correction register 2.7 _{n is} supplied to the corresponding S information inputs (D ₁ -D _S ) of the counter 2.5 _n n-th (

) selection block 2 _n . If at the S-bit input 2.7 _n -1 of the correction register 2.7 _n there is no S-bit signal causing a new maximum search time entered in the control dynamics, the previously recorded values of the code specifying the initial maximum search time are considered priority.

) блока селекции 2_n либо изначально введенное, либо новое, вводимое в динамике управления процессом идентификации элементов входящего потока данных, значение кода, задающие максимальное время поиска. Тем самым обеспечивается инициализация счетчиков 2.5₁-2.5_N блоков селекции 2₁-2_N . Причем наименьшему времени поиска соответствует наибольший код, являющийся дополнением до максимального числа, представимого в S-разрядном коде.Thus, from S outputs 2.7 _n -2 ₁ -2.7 _n -2 _{S of the} correction register, 2.7 _n goes to the corresponding S information inputs (D ₁ -D _S ) of the counter 2.5 _n n-th (

) of the selection block 2 _n, either initially introduced or new, introduced in the dynamics of controlling the process of identification of elements of the incoming data stream, the code value that sets the maximum search time. This ensures the initialization of the counters 2.5 ₁ -2.5 _N selection blocks 2 ₁ -2 _N. Moreover, the smallest search time corresponds to the largest code, which is an addition to the maximum number represented in the S-bit code.

In the initial period, when the BDIs to be analyzed do not enter the input of the device, the logical value corresponding to the comparison results does not have a comparator 2.3 _n at the output “A = B” 2.3 _n -3. Three-input elements And 2.6 ₁ -2.6 _{N of} all selection blocks are closed, clock pulses from the clock generator 10 through three-input elements And 2.6 ₁ -2.6 _N to the counting inputs Z of counters 2.5 ₁ -2.5 _N selection blocks 2 ₁ -2 _{N are} not received. At the outputs “Comparison result” 26 ₁ -26 _N selection blocks 2 ₁ -2 _N signal is absent.

счетчиков 2.5₁-2.5_N через установленный интервал времени, определяемый кодами начального заполнения счетчиков и частотой тактовых импульсов.If the logical values corresponding to the comparison results from the outputs “A = B” 2.3 ₁ -3-2.3 _N -3 comparators 2.3 ₁ -2.3 _N selection blocks 2 ₁ -2 _N are received, at the outputs 26 ₁ -26 _N these blocks through inverters 2.4 ₁ -2.4 _N preset low level signals. To the counting inputs Z of counters 2.5 ₁ -2.5 _N selection blocks 2 ₁ -2 _N , pulses are received from the output of 101 clock pulses 10 along the circuit: clock inputs 25 ₁ -25 _N selection blocks 2 ₁ -2 _N , open three-input elements And 2.6 ₁ -2.6 _N selection blocks 2 ₁ -2 _N. Counters 2.5 ₁ -2.5 _{N of} each selection block perform the function of timers that control the expiration of the allowable time (initial or entered as part of the control) of the search by summing the clock pulses arriving at their counting input Z and generate an overflow signal at the inverse outputs

counters 2.5 ₁ -2.5 _N after a set time interval determined by the codes for the initial filling of the counters and the frequency of the clock pulses.

Signals from the outputs “Comparison Result” 26₁-26_N selection blocks 2₁-2_N come through the inputs “Comparison Result” 81₁-81_N selection search time controllers 8₁-8_N (see Fig. 10) to the signal inputs 8.2₁-1-8.2_N-1 registers comparison-correction of the maximum search time 8.2₁-8.2_N , to test inputs 8.2₁-2-8.2_N-2 which come in binary code from test outputs 8.1₁-2-8.1_N-2 decoders code corrected maximum search time 8.1₁-8.1_N signals characterizing a new value introduced during the control process (value) of the maximum search time for a particular request. At the same time, decoders of the corrected code of the maximum search time 8.1₁-8.1_N they convert the S-bit code, which determines the new values (boundaries) of the maximum search time entered in the control process into binary code and transmit this code for verification of truth to the comparison-correction registers of the maximum search time 8.2₁-8.2_N.

Registers comparison-correction of the maximum search time 8.2₁-8.2_N carry out additional verification (comparison) of the fulfillment of the requirements for timeliness in accordance with the initial and newly introduced maximum search time and, acting as relay nodes, form 8.2 at their outputs₁-3-8.2_N-3 and at the outputs of “Comparison Result” 83₁-83_N selection search time controllers 8₁-8_N a sequence of signals describing logical values corresponding to the comparison results.

Thus, at the outputs “Comparison Result” 83 ₁ -83 _{N of the} selection time controllers 8 ₁ -8 _N have logical values corresponding to the results of the comparison and obtained taking into account the dynamic correction of the maximum search time.

After satisfying the need for information search, the nth search query is removed, at the output “A = B” 2.3 _n -3 of the comparator 2.3 _{n there is} no signal, the counter 2.5 _{n of the} corresponding selection block 2 _n are reset at the nth input “Zeroing” 017 _n device and input "Zeroing" 24 _{n of the} corresponding block selection 2 _n .

, а, следовательно и на выходах «Результат сравнения» 26₁-26_N соответствующих блоков селекции 2₁-2_N сигнала переполнения, инициирующего блокирование выхода 2.4_n-2 инвертора 2.4_n и разовое поступление с данного инверсного выхода логических значений, соответствующих результатам сравнения на данный, конкретный момент времени, без возможности продолжения поиска, что соответствует процедуре динамического управления поиском - переносу поисковых запросов заново в очередь на места, соответствующие их приоритетам.In the event that one or more search queries have reached the maximum search time or the maximum search time has decreased as a result of dynamic correction (control), overflows of counters 2.5 ₁ -2.5 _{N of the} corresponding selection blocks 2 ₁ -2 _N , formation of overflow on their inverse outputs

, and, consequently, at the “Comparison Result” outputs 26 ₁ -26 _{N of the} corresponding selection blocks 2 ₁ -2 _{N of} the overflow signal, which initiates the blocking of the output 2.4 _n -2 of the inverter 2.4 _n and the one-time input of logical values corresponding to the comparison results from this inverse output at this particular moment in time, without the possibility of continuing the search, which corresponds to the dynamic search management procedure - transferring search queries again to the queue at the places corresponding to their priorities.

In this case, the corresponding three-input elements AND 2.6 ₁ -2.6 _N are locked (Fig. 5), prohibiting the arrival of clock pulses to the counting inputs Z of the corresponding counters 2.5 ₁ -2.5 _N of the selection blocks 2 ₁ -2 _N.

Logical values corresponding to the comparison results and obtained taking into account the dynamic correction of the maximum search time from the “Comparison Result” outputs 83 ₁ -83 _N selection search time controllers 8 ₁ -8 _N are sent to the corresponding “Comparison Result” inputs 51 ₁ -51 _N strategy register search 5 and the corresponding inputs "Result of comparison" 61 ₁ -61 _N block formation of the address of the transition mask 6.

Upon receipt of the BDI, the type of which corresponds to one of the BDI types provided in the search script, the output “Comparison result” is 26 _n , for example, a selection block 2 _n and the corresponding output is “Comparison result” 83 _{n of the} selection controller of the search time 8 _n , where a match was found between the values of the identification bits of the received BDI and the corresponding values of the second bitmask, a logical zero value will be set, and at the outputs of all other selection blocks and, as a result, selection time controllers, the value of a logical unit. Upon receipt of a BDI that is not provided by the search script, the logical unit value will be set at the outputs “Comparison result” of all selection blocks and, as a result, outputs “Comparison result” of selection search time controllers.

In the search strategy register 5 (see Fig. 7), the correspondence identified by the selection blocks 2 ₁ -2 _N and checked, taking into account the dynamic correction of the maximum search time, by the selection controllers of the search time 8 ₁ -8 _N , of the BDI type, expected according to search script. The check is carried out regardless of the results of identification of the BDI in the selection blocks 2 ₁ -2 _N and correction (verification) in the selection controllers search time 8 ₁ -8 _N. The type of expected BDI is determined by the mask of the beginning of the search script or by transition masks stored in the random access memory 5.2. The mask, the compliance of which is checked, is determined by the K-bit address installed on the address inputs 5.2-2 (inputs A ₁ -A _K ) of the random access memory 5.2. The verified code coming from the bits of the K-bit transit output 113 of the fuzzy search script analysis block 11 and the corresponding bits of the K-bit output 122 of the fuzzy search script conversion block 12 and the “Event code” 52 installed on the K-bit input is used as the address search strategies 5 (see Fig. 1). From the K-bit input "Event Code" 52, the specified code is fed to the first group of information inputs 5.1-1 (A ₁ -A _K ) of the selector-multiplexer 5.1 (see Fig. 7), where if there is a 5.1-3 ( SE) of the selector-multiplexer 5.1 values of logical zero, is switched to the address inputs 5.2-2 of random access memory 5.2. The corresponding mask is read out by setting a logic zero value at the input “Crystal Choice” 56 of the search strategy register 5. Setting a logical zero value at the input “Crystal Choice” 56 of the search strategy register 5 should be carried out with a time delay relative to the time T ₁ determined by the delay time signal in the selection block and in the selection controller of the search time. Let us designate the time of setting a logic zero at the input “Choice of Crystal” 56 of the register of search strategy 5 as T ₂ . Verification of the correspondence of the identified BDI type to the type expected according to the search script is carried out by three-input elements OR-NOT 5.3 ₁ -5.3 _N. In this case, the first inputs 5.3 ₁ -1-5.3 _N -1 of the three-input elements OR NOT 5.3 ₁ -5.3 _N receive logical values from the outputs 83 ₁ -83 _{N of the} corresponding selection controllers for the search time 8 ₁ -8 _N , and the second inputs logical values corresponding to the mask read from random access memory 5.2. The test results come from the outputs 5.3 ₁ -4-5.3 _N -4 of the three-input elements OR NOT 5.3 ₁ -5.3 _N to the corresponding inputs 5.4-1 ₁ -5.4-1 _{N of the} N-input element OR 5.4 after setting the logic zero value on the enable input 014 devices. Setting the value of logical zero at the enable input 014 of the device should be carried out with a time delay relative to time T ₂ , determined by the time of reading information from random access memory 5.2. Let us designate the time of setting a logical zero at the enable input 014 of the device as T ₃ . If the identified type of BDI coincides with one of the types expected according to the search scenario, the output of the corresponding three-input OR-NOT element, and, therefore, the signal output 59 of the search strategy register 5, will be set to the value of the logical unit, which is fed to the signal input 65 block forming the address of the mask transitions 6 and the signal input 45 of the shaper time intervals 4.

) шифратора 6.1 (нулевой вход

шифратора 6.1 не используется, при этом на нем всегда должно быть установлено значение логической единицы «1»). Если поступивший БДИ идентифицирован одним из блоков селекции 2₁-2_N с учетом максимального времени поиска, на инверсном входе шифратора 6.1, номер которого соответствует номеру блока селекции, идентифицировавшего БДИ и номеру соответствующего селекционного контроллера времени поиска, будет установлено значение логического нуля, а на всех остальных инверсных входах - значение логической единицы. При этом на инверсных выходах 6.1-2₁-6.1-2_K (

) дешифратора 6.1 установится код, соответствующий инверсному представлению номера входа дешифратора, на котором установлено значение логического нуля. Инверторами 6.2₁-6.2_K данный код преобразуется в код типа БДИ, то есть код, соответствующий номеру блока селекции, идентифицировавшего поступивший БДИ и номеру соответствующего селекционного контроллера времени поиска. If you find, in a time not exceeding the set (maximum search time), that the type of incoming BDI matches the type expected according to the search script, in the block for generating the address of transition mask 6, based on the identification results of the received BDI, the address is generated by which in the random access memory 5.2 of the search strategy register 5, a transition mask is stored that determines the next type of BDI. Logical values corresponding to the results of identification of the BDI from the outputs “Comparison Result” 83 ₁ -83 _{N of the} selection time controllers 8 ₁ -8 _N are supplied to the corresponding inputs “Comparison Result” 61 ₁ -61 _{N of the} block for generating the address of the transition mask 6 onwards (see Fig. 8) - to the corresponding inverse inputs 6.1-1 ₁ -6.1-1 _N (

) encoder 6.1 (zero input

6.1 encoder is not used, while the logical unit value “1” must always be set on it). If the received BDI is identified by one of the selection blocks 2 ₁ -2 _N , taking into account the maximum search time, at the inverse input of the encoder 6.1, whose number corresponds to the number of the selection block that identifies the BDI and the number of the corresponding selection search time controller, the value will be set to logical zero, and all other inverse inputs - the value of the logical unit. Moreover, at the inverse outputs 6.1-2 ₁ -6.1-2 _K (

) of the decoder 6.1, a code is set corresponding to the inverse representation of the input number of the decoder, on which the value of logical zero is set. Inverters 6.2 ₁ -6.2 _K, this code is converted into a code of type BDI, that is, a code corresponding to the number of the selection block that identified the incoming BDI and the number of the corresponding selection controller for the search time.

This code type BDI is used as the address at which the corresponding transition mask is stored in the random access memory 5.2 of the search strategy register 5.

In the claimed device, this code is subject to preliminary analysis (identification) of fuzzy-set (observable, identifiable) values, as well as computational fuzzy conversion and recognition of these values using fuzzy set mathematics to a form that allows it to be verified - clearly (quantitatively, unambiguously, reliably) determine and interpret the values of this code characterizing the type of specific expected BDI.

From the outputs 6.2 ₁ -2-6.2 _K -2 of inverters 6.2 ₁ -6.2 _{K the} K-bit code of the BDI type is supplied to the corresponding information inputs 6.4-2 ₁ -6.4-2 _K (D ₁ -D _K ) of register 6.4. Writing a code of type BDI in register 6.4 is carried out only when the logical unit value 6 is received at the signal input 65 of the unit for generating the transition mask address 6, that is, only if a preliminary correspondence of the type of incoming BDI to the type expected according to the scenario is detected in the search strategy block 5 search. Otherwise, in register 6.4, the previous value of the code of the BDI type is stored. Thus, on the K-bit output “Event Code” 62 of the transition mask address generation unit 6, a code requiring additional verification is always set corresponding to the address at which the transition mask is stored in the random access memory 5.2 of the search strategy register 5, which determines the type of expected according to the scenario search, BDI.

Values of a code of type BDI, which a priori (initially, prior to verification) are identified as the address at which the corresponding transition mask is stored in the search strategy register 5, from the bits of the K-bit output "Event Code" 62 of the formation block of the address of transition mask 6 are received and written to binary code through the K-bit information input 111 to the K-bit input 11.2-1 of the counter 11.2 of the analysis block fuzzy search script 11 (see Fig. 2).

The fuzzy search scenario analysis unit 11 may be implemented in accordance with the circuit proposed in FIG. 2. A code of the BDI type, which a priori (initially, prior to verification) is identified as the address where the corresponding transition mask is stored in the search strategy register 5, is sent to the K-bit input 11.2-1 of the counter 11.2, which is designed for registration in each cell ( bit) one binary number (bit) of the incoming information.

A sequential comparison (by the number of binary numbers characterizing any of the K bits of the code of the BDI type) of the input data in the binary code and the decision on their mathematical nature - the BDI type code is set parametrically or using the membership function characteristic of fuzzy sets, is carried out in the block analysis of fuzzy search scenario 11 as follows.

If the number of binary numbers characterizing any of the K digits of the BDI type code exceeds one, then, from the point of view of fuzzy mathematics, this code sequence contains redundancy (since it contains, among other things, the values of membership functions of fuzzy sets), which makes the data fuzzy describing the features of a search script (bitmask addresses).

In other words, the initially qualitative and quantitative information coming from the K-bit output “Event Code” 62 of the transition mask address generating unit 6 may differ in the number of binary numbers that characterize any of the K bits of the BDI type code: to record quantitative information in binary code one binary number is sufficient, while fuzzy (qualitative) information carries, in addition to the usual number, a characteristic of the membership function, which objectively requires the use of more than one binary number to record and store fuzzy information (ambiguously (fuzzy) given values of a code of type BDI). If one binary number is received characterizing any of the K bits of the code of the BDI type, then this code does not need to be verified, clearly (unambiguously) corresponds to the type of the expected block of binary information and reliably determines the address at which the corresponding transition mask is stored in the search strategy register 5.

In view of this fact, storage register 11.1 and counter 11.2 of block 11 are constructed. Both of these circuit elements are designed to register, analyze and store one binary number that characterizes any of the K bits of the code type BDI, if the number of binary numbers exceeds one, then from the point of view fuzzy mathematics - this information (values of code elements of the BDI type) comes in fuzzy form. In this case, both the storage register 11.1 and the counter 11.2 of the block 11 perform the functions of a transit node, moreover, with K test outputs 11.1-1 ₁ -11.1-1 _K of the storage register 11.1 this information is in binary code immediately, via test outputs 112 ₁ -112 _K unit 11, is supplied to the corresponding K test inputs 121 ₁ -121 _K of the conversion unit of the fuzzy search script 12.

If the K-bit information input 111 and the K-bit input 11.2-1 of the counter 11.2 of the fuzzy search script analysis block 11 receive information in binary code (BDI type code values) in the amount of one binary number characterizing any of the K bits of this code, then this information comes in a clear form, has a quantitative meaning, and the counter 11.2 registers this information and sends it from its K outputs 11.2-2 ₁ -11.2-2 _K to the K corresponding inputs 11.1-2 ₁ -11.1-2 _K storage register 11.1, which through its transit K-bit output 11.1-3 and transit output 113 of the analysis block of the fuzzy search script 11 sends this information (the initial data specified in a clear form - quantitatively specified, which do not require additional verification of the value of the code of the BDI type) to the K-bit inputs Event code ”52 and 71 of the search strategy register 5 and display unit 7, respectively.

Information that requires additional verification (initial data specified in a fuzzy form - fuzzy specified values of a code of the BDI type), in binary code, through K test inputs 121 ₁ -121 _{K is} supplied to the corresponding inputs 12.1-1 ₁ -12.1-1 _{K of} register 12.1 of the conversion unit a fuzzy search scenario 12, which can be implemented in accordance with the scheme proposed in FIG. 3. The transformation (transformation) of the source data specified in fuzzy form to a form suitable for obtaining clear, unambiguous (reliable) results of a specific search scenario occurs in the conversion unit of the fuzzy search scenario 12 as follows. In general, the essence of the operation of the fuzzy search script transformation block 12, from the point of view of mathematics, is to correctly calculate the integrated expert opinion (expression (3)) and decide on the maximum value of the membership function (degree of confidence) of this integrated opinion (expression (4) ), which determines the unambiguous choice of the quantitative value of the fuzzy parameter - the quantitative value of a particular k-th code of the BDI type.

) к пространству истинных (однозначно, четко определенных) значений. Первичные 12.1-2₁-12.1-2_K и вторичные 12.1-3₁-12.1-3_K выходы регистра 12.1 соответствуют данным от первого U₁ и второго U₂ экспертов, с этих выходов информация в двоичном коде поступает соответственно на входы 12.3-1₁-12.3-1_K главного элемента хранения 12.3 и прямые входы 12.4-1₁-12.4-1_K вспомогательного элемента хранения 12.4, а также соответственно на первичные входы 12.2-1₁-12.2-1_K и вторичные входы 12.2-2₁-12.2-2_K элемента расчета дополнения 12.2. Элемент расчета дополнения 12.2 реализует функцию арифметического вычитания из единицы значений функций принадлежности нечетких множеств, в соответствии с алгоритмом, описанным в [1, 5], например, еслиThe fuzzy code sequence (fuzzy set values of the code type BDI), is fed to the inputs 12.1-1 ₁ -12.1-1 _{K of the} register 12.1 of the conversion unit of the fuzzy search script 12 (see Fig. 3). Register 12.1 registers and sorts information into two components, in accordance with the number of expert opinions (number of experts) on the degree to which the value of a particular k-th code of the BDI type belongs (

) to the space of true (uniquely, clearly defined) meanings. The primary 12.1-2 ₁ -12.1-2 _K and the secondary 12.1-3 ₁ -12.1-3 _K outputs of the register 12.1 correspond to the data from the first U ₁ and second U ₂ experts, from these outputs the information in binary code goes to the inputs 12.3-1, respectively ₁ -12.3-1 _{K of the} main storage element 12.3 and direct inputs 12.4-1 ₁ -12.4-1 _{K of the} auxiliary storage element 12.4, as well as the primary inputs 12.2-1 ₁ -12.2-1 _K and secondary inputs 12.2-2 _1, respectively 12.2-2 _K of the calculation element of appendix 12.2. The calculation element of Appendix 12.2 implements the function of arithmetic subtraction of the membership functions of fuzzy sets from a unit, in accordance with the algorithm described in [1, 5], for example, if

, (5)

, (five)

then

, (6)

, (6)

и

- дополнения нечетких множеств

и

, сформулированных экспертами U₁ и U₂ по поводу степени принадлежности значения конкретного k-ого нечетко заданного (наблюдаемого) кода типа БДИ

, к пространству истинных (однозначно, четко определенных) значений. Главный 12.3 и вспомогательный 12.4 элементы хранения хранят нечеткую информацию от эксперта U₁ и U₂ и через свои соответствующие выходы 12.3-2₁-12.3-2_K и 12.4-2₁-12.4-2_K в двоичном коде выдают значения функций принадлежности нечетких множеств на основные входы 12.5-1₁-12.5-1_K главного анализатора 12.5 и на основные входы 12.6-1₁-12.6-1_K вспомогательного анализатора 12.6 соответственно. Каждый из главного 12.5 и вспомогательного 12.6 анализаторов, получая в двоичном коде на свои дополнительные входы 12.5-2₁-12.5-2_K и 12.6-2₁-12.6-2_K соответственно значения элементов дополнения нечетких множеств с первичных 12.2-3₁-12.2-3_K и вторичных 12.2-4₁-12.2-4_K выходов элемента расчета дополнения 12.2, выполняет функцию пересечения нечетких множеств, как описано в [1, 5]: главный анализатор 12.5 выполняет операцию

, а вспомогательный анализатор 12.6 выполняет операцию

. С выходов 12.5-3₁-12.5-3_K главного анализатора 12.5 и выходов 12.6-3₁-12.6-3_K вспомогательного анализатора 12.6 полученные значения в двоичном коде поступают соответственно на первичные 12.7-1₁-12.7-1_K и вторичные 12.7-2₁-12.7-2_K входы элемента расчета объединения 12.7, выполняющего завершающий цикл дизъюнктивного суммирования в соответствии с выражением (3). С выходов 12.7-3₁-12.7-3_K элемента расчета объединения 12.7 полученные итоговые значения (обобщенное мнение экспертов о значении)

- функции принадлежности значения конкретного k-ого нечетко заданного (наблюдаемого) кода типа БДИ

, к пространству истинных (однозначно, четко определенных) значений, в двоичном коде поступают на соответствующие входы 12.8-1₁-12.8-1_K вычислителя 12.8, дополнительные входы 12.2-5₁-12.2-5_K элемента расчета дополнения 12.2 и дополнительные входы 12.4-3₁-12.4-3_K вспомогательного элемента хранения 12.4.Where

and

- complements of fuzzy sets

and

formulated by experts U ₁ and U ₂ regarding the degree of belonging of the value of a particular k-th fuzzy given (observable) code of type BDI

, to the space of true (uniquely, clearly defined) meanings. The main 12.3 and auxiliary 12.4 storage elements store fuzzy information from the expert U ₁ and U ₂ and through their respective outputs 12.3-2 ₁ -12.3-2 _K and 12.4-2 ₁ -12.4-2 _K in binary code give the values of membership functions of fuzzy sets to the main inputs 12.5-1 ₁ -12.5-1 _{K of the} main analyzer 12.5 and to the main inputs 12.6-1 ₁ -12.6-1 _{K of the} auxiliary analyzer 12.6, respectively. Each of the main 12.5 and auxiliary 12.6 analyzers, receiving in binary code on their additional inputs 12.5-2 ₁ -12.5-2 _K and 12.6-2 ₁ -12.6-2 _K, respectively, the values of the elements of the complement of fuzzy sets from the primary 12.2-3 ₁ -12.2 -3 _K and secondary 12.2-4 ₁ -12.2-4 _K outputs of the element of calculation of addition 12.2, performs the function of crossing fuzzy sets, as described in [1, 5]: the main analyzer 12.5 performs the operation

, and the auxiliary analyzer 12.6 performs the operation

. From outputs 12.5-3 ₁ -12.5-3 _{K of the} main analyzer 12.5 and outputs 12.6-3 ₁ -12.6-3 _{K of the} auxiliary analyzer 12.6, the obtained values in binary code are respectively sent to primary 12.7-1 ₁ -12.7-1 _K and secondary 12.7- 2 ₁ -12.7-2 _K inputs of the calculation element of the union 12.7, performing the final cycle of disjunctive summation in accordance with expression (3). From the outputs 12.7-3 ₁ -12.7-3 _{K of the} element for calculating the union 12.7, the resulting total values (the generalized opinion of experts on the value)

- the membership function of the value of a particular k-th fuzzy given (observable) code of type BDI

, to the space of true (unambiguously, clearly defined) values, in binary code, they go to the corresponding inputs of 12.8-1 ₁ -12.8-1 _{K of the} calculator 12.8, additional inputs 12.2-5 ₁ -12.2-5 _K of the calculation element of addition 12.2 and additional inputs 12.4 -3 ₁ -12.4-3 _K auxiliary storage element 12.4.

The calculator 12.8 of the conversion block of the fuzzy search script 12 uniquely selects (assigns) quantitative values to the fuzzy-set values of a particular k-th fuzzy-set (observable) code of the BDI type, in accordance with expression (4). Being, in fact, a programmable comparison scheme (programmable TTL comparator of type 74LS85), in which binary values of the membership function of the concrete kth fuzzy given (observable) code of the BDI type obtained from the calculation element of the union 12.7 are compared, the calculator 12.8, based on determining the maximum of the membership function, uniquely, clearly and finally assigns (verifies) the numerical value of this code that defines the address at which the transition mask is stored in the random access memory of the search strategy register, which determines the type of OBD expected according to the search script.

The transfer of information to the additional inputs 12.2-5 ₁ -12.2-5 _{K of the} element for calculating additions 12.2 and the additional inputs 12.4-3 ₁ -12.4-3 _{K of the} auxiliary storage element 12.4 is intended for the case when the number of experts is more than two. In this case, the complement of the union calculation element 12.7 obtained from the outputs 12.7-3 ₁ -12.7-3 _{K of the} fuzzy set in the complement calculation element 12.2 and the outputs of the union calculation element 12.7-3 ₁ -12.7-3 _K of the union calculation element 12.7 are overwritten into the auxiliary element storage 12.4, playing the role of information from the first expert. Information from a new (for example, third) expert is recorded through register 12.1 to the main storage element 12.3 and the calculation cycle is repeated again.

Thus, an unambiguous verification of the quantitative values of the fuzzy parameters of the search script is carried out in accordance with expression (4) - the calculator 12.8 outputs on its K-bit output 12.8-2 in binary code a verified, quantitative value of the specific k-th fuzzy given (observed) code of the type BDI, which is the address where, in the random access memory of the search strategy register, a transition mask is stored that determines the type of BDI expected according to the search script.

In other words, certain (recognized) fuzzy source data characterizing the type of BDI are converted to a form suitable for unambiguous adoption of a reliable decision about the address at which the corresponding transition mask is stored in the search strategy register 5.

As a result, at the corresponding bits of the K-bit output of the calculator 12.8 and at the corresponding bits of the K-bit output 122 of the conversion block of the fuzzy search script 12, we obtain information characterizing (based on the analysis of the fuzzy sets integrated in the mathematics of experts' opinions) the true type of expected BDI, transformed (verified) in the interests of increasing the reliability of the implementation of search queries.

The calculator 12.8 records, stores and issues from the corresponding bits of its K-bit output 12.8-2 through the corresponding bits of the K-bit output 122 of the conversion block of the fuzzy search script 12 to the corresponding bits of the K-bit inputs "Event code" 52 and 71 of the search strategy register 5 and display unit 7, respectively, a code (not a null code) containing verified results of the analysis of the type of expected BDI - a code that clearly and unambiguously defines the address at which the corresponding transition mask characterizing the search scenario is stored in the search strategy register 5.

In the case of finding the correspondence of the verified code — the type of the received BDI to the expected code (type), the value of the logical unit from the signal output 59 of the search strategy register 5 goes to the corresponding signal input 45 of the time interval shaper 4 (see Fig. 6). From the signal input 45 of the time interval shaper 4, the value of the logical unit is fed to the write enable input V of the counter 4.7 and the first information input 4.2-1 (input J) of the JK trigger 4.2. At the same time, the code for the waiting time for the next BDI installed on the M-bit input “Time-out code” 06 of the device is recorded in the counter 4.7 and generation of the logical unit value at the output 4.2-3 of the JK-trigger 4.2 (since at its second information input 4.2 -2 (input K) set to logical zero). The value of the logical unit from the output 4.2-3 of the JK trigger 4.2, arriving at the second input 4.3-2 of the first two-input element And 4.3, allows the receipt of clock pulses from the second clock input 41 of the shaper of time intervals 4 to the counting input C of the counter 4.7. Thus, in the shaper of time intervals 4, a countdown of the waiting time of the next BDI is initiated.

The end of the analysis of the received BDI and the transition to waiting for the next BDI for a given time determined by the maximum search time code is carried out by setting the value of the logical unit at the enable input 014 of the device, which leads to the unconditional setting of the value of logical zero at the signal output 59 of the search strategy register 5. For the correct operation of the device, setting the value of the logical unit at the enable input 014 of the device should be carried out with a time delay ΔT relative to the time T ₃ determined by the delay time of the parallel operation of the three-input elements OR NOT 5.3 ₁ -5.3 _N and N-input element OR 5.4 of the search strategy register 5 , the maximum of the delay time for writing to the register 6.4 of the block for generating the address of the transition mask 6, the delay time for the operation of the JK trigger 4.2 and the delay time for writing to the counter 4.7 of the shaper of time intervals 4:

ΔT = ΔT _5.3 + ΔT _5.4 + max [ΔT _6.4 , ΔT _4.2 , ΔT _4.7 ],

where: ΔT _5.3 is the delay time of the parallel operation of the three-input elements OR NOT 5.3 ₁ -5.3 _N register search strategy 5; ΔT _5.4 is the delay time of the N-input element OR 5.4 register search strategy 5; ΔT _6.4 is the delay time of writing to the register 6.4 of the block forming the address of the transition mask 6; ΔT _4.2 is the delay time of the JK trigger 4.2 of the shaper time intervals 4; ΔT _4.7 - the delay time of recording in the counter 4.7 of the shaper time intervals 4.

Simultaneously with setting the value of the logical unit at the enable input 014 of the device, the setting of the value of the logical unit at the input “Crystal Choice” 012 of the device is carried out.

If before the waiting time for the next BDI expires, but within the maximum search time set through the main search controller 9, the next BDI arrives, the type verified (from the point of view of blurring) corresponds to the type expected according to the search scenario, then the value of the logical unit on the signal the output 59 of the search strategy register 5 will lead to the re-initialization of the counter 4.7 of the shaper time intervals 4 (re-recording in the counter of the code waiting time for the next BDI). In this case, the logical value at the output 4.2-3 of the JK-trigger 4.2 of the shaper of time intervals 4 will not change (since its second information input 4.2-2 (input K) is set to a logical zero), and clock pulses will continue to be supplied to the counting input C counter 4.7. Thus, the countdown of the waiting time for the next BDI within the specified maximum search time will begin again.

If the next BDI corresponding to the search scenario does not arrive before the timeout expires, but within the specified maximum search time, then overflow of counter 4.7 of the time interval shaper 4 will occur. At the same time, the output of the overflow P of counter 4.7 of the time interval shaper 4 will be set to a logical unit, which will go to the second input 4.5-2 of the second two-input element AND 4.5 and through the first two-input element OR 4.1 to the second information input 4.2-2 (input K) of the JK trigger 4.2. The values of the logical unit at the overflow output P of the counter 4.7 and at the signal input 45 of the shaper of time intervals 4 can be set at arbitrary times, but within the specified maximum search time. In this regard, at the information inputs 4.2-1 (input J) and 4.2-2 (input K) of the JK-trigger 4.2 of the shaper of time intervals 4, the following combinations of logical values may appear:

at the first information input 4.2-1 (input J) of the JK-trigger 4.2, a logic zero value is set, and at its second information input 4.2-2 (input K), the value of a logical unit is set;

on the first 4.2-1 (input J) and second 4.2-2 (input K) information inputs of the JK trigger 4.2, the values of the logical unit are set.

In the first case, at the output 4.2-3 of the JK-trigger 4.2 of the time interval shaper 4, a logic zero value is set, which will go to the second input 4.3-2 of the first two-input element And 4.3 and to the input 4.4-1 of the inverter 4.4. The value of logical zero at the second input 4.3-2 of the first two-input element And 4.3 will lead to the termination of the receipt of clock pulses from the second clock input 41 of the shaper time intervals 4 to the counting input C of the counter 4.7 (see Fig. 6). The value of logical zero at the input 4.4-1 of the inverter 4.4 will lead to the setting of the value of the logical unit at the first input 4.5-1 of the second two-input element AND 4.5, which, if there is a value of the logical unit at its second input 4.5-2, will lead to the setting of the value of the logical unit at the second input 4.6-2 of the second two-input element OR 4.6 and the output "Reset" 44 of the time interval shaper 4. The value of the logical unit at the second input 4.6-2 of the second two-input element OR 4.6 will reset the counter 4.7, and the value of the logical unit at the output "Reset" 44 will reset the register 6.4 of the transition mask address generation block 6. Resetting the counter 4.7 of the time interval shaper 4 will cause the overflow P to be set to a logic zero value which will go to the second information input 4.2-2 (input K) of the JK trigger 4.2 and to the second input 4.5-2 of the second two-input element AND 4.5. In this case, the output "Reset" 44 of the shaper of time intervals 4 sets the value of logical zero. Resetting the register 6.4 of the transition mask address generation block 6 (see Fig. 8) will result in the installation of address inputs 5.2-2 (inputs A ₁ -A _K ) of random access memory 5.2 of the search strategy register 5 (see Fig. 7) of zero address . Thus, the search for the next BDI, determined by the current, within the specified maximum search time, verified (from the point of view of blurring) the transition mask, is interrupted and the device proceeds to wait for the BDI, the types of which are determined by the mask of the beginning of the search script (initial BDI).

In the second case, the logical value at the output 4.2-3 of the JK-trigger 4.2 of the shaper time slots 4 will not change. In this case, clock pulses will continue to be supplied to the counting input C of counter 4.7, and the output of 4.5-3 of the second two-input element And 4.5 will remain the value of logical zero (despite the value of the logical unit at its second input 4.5-2). The value of the logical unit at the signal input 45 of the shaper time intervals 4 (see Fig. 6) will lead to the recording of the waiting code of the next BDI installed on the M-bit input "Code timeout" 06 of the device in the counter 4.7. At the same time, at the output of the overflow P of counter 4.7, a logic zero value will be set, which will go through the first two-input element OR 4.1 to the second information input 4.2-2 (input K) of the JK trigger 4.2 and to the second input 4.5-2 of the second two-input element AND 4.5. Thus, the reset of register 6.4 of the block for generating the address of the transition mask 6 (see Fig. 8) will not occur and the address corresponding to the address 5 will be set on the address inputs 5.2-2 (inputs A ₁ -A _K ) of the random access memory 5.2 of the search strategy register 5 another verified (from the point of view of eliminating fuzziness) transition mask. In this regard, the operation of the device to search for next (according to the search script) BDI, within the specified maximum search time, will continue.

) инверсном выходе 7.1-2_n (выходе

из

выходов) дешифратора 7.1, номер n которого соответствует коду типа БДИ, установится значение логического нуля, а на всех остальных выходах дешифратора - значение логической единицы. Логические значения с выходов 7.1-2₁-7.1-2_N (выходов

) дешифратора 7.1 блока индикации 7 поступают на первые входы 7.2₁-1-7.2_N-1 соответствующих двухвходовых элементов ИЛИ 7.2₁-7.2_N, где происходит их сравнение со значениями маски окончания сценария поиска, установленными на N-разрядном входе «Правило завершения поиска» 07 устройства. При совпадении логических значений на входах двухвходового элемента ИЛИ, номер которого соответствует коду типа БДИ, на его выходе установится значение логического нуля, которое через N-входовый элемент И 7.3 поступит на выход «Результат поиска» 015 устройства, что соответствует четкому (достоверному) обнаружению во входящем потоке БДИ, соответствующего сценарию поиска.Upon receipt of the BDI, the type of which corresponds to one of the verified (from the point of view of blurring) BDI types specified in the mask for the end of the search script (final BDI), the value “logical zero” is generated at the output “Search Result” 015 of the device. The formation of the value of logical zero at the output "Search Result" 015 of the device is as follows (see Fig. 9). From the bits of the K-bit input "Event Code" 71 of the display unit 7, the verified results of a fuzzy analysis of a code such as the expected BDI are received at the corresponding inputs 7.1-1 ₁ -7.1-1 _K (inputs F ₁ -F _K ) of the decoder 7.1. Moreover, on the nth (

) inverse output 7.1-2 _n (output

of

outputs) of the decoder 7.1, the number n of which corresponds to the code of the BDI type, the value of logical zero is set, and at all other outputs of the decoder - the value of the logical unit. Logical values from outputs 7.1-2 ₁ -7.1-2 _N (outputs

) of decoder 7.1 of indication block 7 are fed to the first inputs 7.2 ₁ -1-7.2 _N -1 of the corresponding two-input elements OR 7.2 ₁ -7.2 _N , where they are compared with the values of the mask for the end of the search script set at the N-bit input "Search termination rule »07 devices. If logical values coincide at the inputs of a two-input OR element, the number of which corresponds to a code of type BDI, a logical zero value will be set at its output, which through the N-input element AND 7.3 will go to the output “Search result” 015 of the device, which corresponds to a clear (reliable) detection in the input stream of the BDI corresponding to the search script.

Thus, the proposed information retrieval device provides an increase in the reliability of the implementation of search queries, taking into account situations when search scenarios specified by the type of the next expected BDI (bitmask addresses) are implemented in conditions of fuzzy data on the true values of the search parameters. The reliability of determining the type of expected BDI under conditions of fuzziness increases due to the preliminary analysis, identification (selection) of fuzzy specified (observed) code values of the BDI type and mathematically correct verification of these data implemented in the fuzzy search script analysis unit and the fuzzy search conversion unit; converting fuzzy code values to a form suitable for a clear, unambiguous decision on the type of specific expected BDI. This result is due to obtaining at the outputs “Comparison Result” 83 ₁ -83 _N search time selection controllers 8 ₁ -8 _N sequences of signals from verified search query results - a sequence of logical values corresponding to the results of conversion of BDI code values based on fuzzy analysis and data processing characterizing fuzzy set values of identification features (address of bit masks).

Analysis of the principle of operation of the claimed device shows the evidence of the fact that, along with the saved and described in the prototype capabilities for the implementation of search queries, taking into account the dynamics of control actions, external factors that change in time of the current requirements of subscribers to the timeliness of information retrieval, the device is able to reliably determine the type of expected airborne information (bitmask addresses) taking into account fuzzy given (observed) preliminary values of the code for a particular type of binary information blocks.

This device provides increased reliability of the implementation of search queries in conditions typical of real modern informational (search) systems - when the search script is implemented in conditions of fuzzy data on the true values of the parameters of this scenario, which significantly expands the scope of the device, expands the functionality of the search subsystems queuing in packet-switched data networks and in modern information and reference systems, as well as in intellectual content analysis systems for the effective detection and counteraction of unwanted, dubious and harmful information circulating on social networks and the global Internet, where the claimed search device information will be used.

SOURCES OF INFORMATION

1. Kofman A. Introduction to the theory of fuzzy sets: Per. with french - M .: Radio and communications, 1982, - 432 p .;

2. Fuzzy sets and the theory of possibilities. Recent achievements: Per. from English / Ed. Yager R.R. - M .: Radio and communications, 1986, - 408 p .;

3. Voronov M.V. Fuzzy sets in models of organizational management systems. - L .: VMA, 1988, - 54 p .;

4. Martynov V.I. The mathematical foundations of managing primary communication networks using fuzzy parameters. - M .: "Elf-M", 1997, - 48 p .;

5. Paraschuk I. B., Bobrik I. P. Fuzzy sets in the analysis of communication networks. - SPb .: VUS, 2001. - 80 p.

6. Gonzalez R., Tu J. Principles of pattern recognition. - M .: Mir, 1978.- 411 p.

Claims (3)

1. An information retrieval device containing N mask storage units (1₁-1_N), where N≥2 is the number of types of binary information blocks (BDI), N selection blocks (2₁-2_N), frequency divider (3), time interval generator (4), search strategy register (5), transition mask address generation unit (6), display unit (7), N search time selector controllers (8₁-8_N), the main search time controller (9), the clock generator (10), and the clock input (38) of the frequency divider (3) is the first clock input (08) of the device, and the output (39) of the frequency divider (3) is connected to the clock the input (41) of the shaper time intervals (4), the inputs enable recording (10₁-ten _N ) N mask storage units (1₁-1 _N ) are combined and are the recording permission input (01) of the device, L-bit, where L≥2 is the maximum number of bits in the binary information block, information inputs (21₁-21 _N ) N selection blocks (2₁-2 _N ) are combined and are the L-bit information input (04) of the device, the first L-bit inputs "Mask 1" (12_n) and Mask 2 (13_n) nth mask storage unit (1_n), where n = 1, 2, ..., N, are n-mi first L-bit inputs respectively "Mask 1" (02_n) and Mask 2 (03_n) devices, the second L-bit outputs "Mask 1" (14_n) and Mask 2 (15_n) nth mask storage unit (1_n) are connected to the corresponding second L-bit inputs “Mask 1” (22_n) and Mask 2 (23_n) n-th selection block (2_n), the “Initial reset” input (42) of the time interval shaper (4) is connected to the “Initial reset” input (63) of the transition mask address generation unit (6) and is the “Initial reset” input (05) of the device, while M- the bit input “Code of time-out” (43) of the time slot generator (4), where M≥2 is the bit depth of the code of the time interval, is the M-bit input “Code of time-out” (06) of the device, and the output (44) of the generator of time intervals (4) is connected to the “Reset” input (64) of the transition mask address generation unit (6), and the signal output (59) of the search strategy register (5) is connected to the signal inputs (45) and (65) of the time interval shaper (4) and the block for generating the address of the transition mask (6), respectively, K-bit, where K = (log₂N) + 1 - the width of the code of the address of the transition mask, the address input (53), the control input (54), the N-bit information input (55) and the enable input (58) of the search strategy register (5) are respectively the K-bit address input (09), the control input (010), the N-bit information input (011) and the enable input (014) of the device, the “Choice of crystal” (56) and “Read / write” (57) inputs of the search strategy register (5) are respectively, the inputs “Choice of crystal” (012) and “Read / write” (013) of the device, the N-bit input “Rule of completion of the search” (72) and the output “Search result” (73) of the display unit (7) are respectively N- bit input “Search completion rule” (07) and output “Search result” (015) of the device, outputs “Comparison result” (26₁-26 _N ) selection blocks (2₁-2 _N ) are connected to the corresponding inputs “Comparison Result” (81₁-81 _N ) corresponding selection search time controllers (8₁-8 _N ), outputs “Comparison Result” (83₁-83 _N ) which are connected to the corresponding inputs “Comparison Result” (51₁-51 _N ) of the search strategy register (5) and with the corresponding inputs “Comparison result” (61₁-61 _N ) of the block for generating the address of the transition mask (6), while the output (101) of the clock generator (10) is connected to the clock inputs (25₁-25 _N ) of each of the N selection blocks (2₁-2 _N ), the “Zeroing” inputs (24₁-24 _N ) which are the corresponding inputs “Zeroing” (017₁-017 _N ) devices, moreover, S-bit, where S≥2 is the bit depth of the search time correction code, the correction input (27_n) n-th selection block (2_n) is connected to the S-bit test input (82_n) nth selection search time controller (8_n) and connected to the nth S-bit output (92_n) of the main search time controller (9), N S-bit inputs (91₁-91_N) of which are the corresponding N S-bit inputs “Correction of the maximum search time” (016) of the device, characterized in that an additional block for analyzing the fuzzy search script (11) is introduced for preliminary sequential comparison (by the number of binary numbers describing any of K bits of the code of the BDI type) of the initial data (code of the BDI type) and deciding on their mathematical nature - the code of the BDI type is specified parametrically or using the membership function characteristic of fuzzy sets, and the conversion block of the fuzzy search script (12), designed for mathematically correct converting this code specified in fuzzy form to a form suitable for obtaining clear, unambiguous (reliable) results of a specific search, and the K-bit output "Event Code" (62) of the transition mask address generating unit (6) is connected to the K-bit information input (111) of the fuzzy search script analysis block (11), K test outputs (112₁-112_K) which are connected to the corresponding K test inputs (121₁-121_K) of the conversion block of the fuzzy search script (12), the K-bit output (122) of which and the K-bit transit output (113) of the analysis block of the fuzzy search script (11) are interconnected and are K-bit inputs "Event code" (52 ) and (71) of the search strategy register (5) and display unit (7), respectively. 2. The device according to claim 1, characterized the fact that the fuzzy search script analysis block (11) consists of a storage register (11.1) and a counter (11.2), the K-bit input (11.2-1) of which is the K-bit information input (111) of the fuzzy search script analysis block (11 ), K outputs (11.2-2₁-11.2-2_K) of the counter (11.2) are connected to the corresponding K inputs (11.1-2₁-11.1-2_K) the storage register (11.1), the K-bit transit output (11.1-3) of which is the K-bit transit output (113) of the fuzzy search script analysis block (11), K test outputs (11.1-1₁-11.1-1_K) of the storage register (11.1) are the corresponding K test outputs (112₁-112_K) analysis block fuzzy search script (11). 3. The device according to claim 1, characterized the fact that the conversion block of the fuzzy search script (12) consists of a register (12.1), an element for calculating the addition (12.2), the main (12.3) and auxiliary (12.4) storage elements, the main (12.5) and auxiliary (12.6) analyzers, the calculation element combining (12.7) and a computer (12.8), the bits of the K-bit output (12.8-2) of which and the corresponding bits of the K-bit output (12.1-4) of the register (12.1) are combined and are the K-bit output (122) of the fuzzy conversion unit search script (12), K inputs (12.1-1₁-12.1-1_K) of the register (12.1) are the corresponding K test inputs (121₁-121_K) conversion block fuzzy search script (12), K primary outputs (12.1-2₁-12.1-2_K) of the register (12.1) are connected to the corresponding K primary inputs (12.2-1₁-12.2-1_K) of the element of calculation of the supplement (12.2) and to the corresponding K inputs (12.3-1₁-12.3-1_K) of the main storage element (12.3), K secondary outputs (12.1-3₁-12.1-3_K) of the register (12.1) are connected to the corresponding K secondary inputs (12.2-2₁-12.2-2_K) of the element of calculation of the supplement (12.2) and to the corresponding K direct inputs (12.4-1₁-12.4-1_K) auxiliary storage element (12.4), K outputs (12.3-2₁-12.3-2_K) of the main storage element (12.3) are connected to the corresponding K main inputs (12.5-1₁-12.5-1_K) of the main analyzer (12.5), K outputs (12.4-2₁-12.4-2_K) auxiliary storage element (12.4) are connected to the corresponding K main inputs (12.6-1₁-12.6-1_K) auxiliary analyzer (12.6), K additional inputs (12.5-2₁-12.5-2_K) of the main analyzer (12.5) are connected to the corresponding K primary outputs (12.2-3₁-12.2-3_K) of the element of calculation of the addition (12.2), K of the secondary outputs (12.2-4₁-12.2-4_K) which are connected to the corresponding K additional inputs (12.6-2₁-12.6-2_K) auxiliary analyzer (12.6), K outputs (12.5-3₁-12.5-3_K) of the main analyzer (12.5) are connected to the corresponding K primary inputs (12.7-1₁-12.7-1_K) of the element of calculation of the union (12.7), K secondary inputs (12.7-2₁-12.7-2_K) which are connected to the corresponding K outputs (12.6-3₁-12.6-3_K) auxiliary analyzer (12.6), K outputs (12.7-3₁-12.7-3_K) of the calculation element of the union (12.7) are connected to the corresponding K additional inputs (12.2-5₁-12.2-5_K) of the element of calculation of the addition (12.2) corresponding to K additional inputs (12.4-3₁-12.4-3_K) auxiliary storage element (12.4) and the corresponding K inputs (12.8-1₁-12.8-1_K) calculator (12.8).

Images