CN115391475A - Method for searching space containing arithmetic operator based on ElasticSearch technology - Google Patents
Method for searching space containing arithmetic operator based on ElasticSearch technology Download PDFInfo
- Publication number
- CN115391475A CN115391475A CN202211058993.9A CN202211058993A CN115391475A CN 115391475 A CN115391475 A CN 115391475A CN 202211058993 A CN202211058993 A CN 202211058993A CN 115391475 A CN115391475 A CN 115391475A
- Authority
- CN
- China
- Prior art keywords
- code
- platform
- retrieval
- password
- plot
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000005516 engineering process Methods 0.000 title claims abstract description 14
- 238000012795 verification Methods 0.000 claims description 141
- 238000013507 mapping Methods 0.000 claims description 83
- 238000004458 analytical method Methods 0.000 claims description 61
- 230000004927 fusion Effects 0.000 claims description 23
- 230000008569 process Effects 0.000 claims description 12
- 238000004364 calculation method Methods 0.000 claims description 4
- 239000000284 extract Substances 0.000 claims description 3
- 238000010200 validation analysis Methods 0.000 description 13
- 238000010586 diagram Methods 0.000 description 11
- 238000010422 painting Methods 0.000 description 4
- 238000009500 colour coating Methods 0.000 description 2
- 238000012952 Resampling Methods 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 239000003973 paint Substances 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
- G06K17/0022—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisions for transferring data to distant stations, e.g. from a sensing device
- G06K17/0025—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisions for transferring data to distant stations, e.g. from a sensing device the arrangement consisting of a wireless interrogation device in combination with a device for optically marking the record carrier
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
- G06K19/06037—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking multi-dimensional coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3226—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using a predetermined code, e.g. password, passphrase or PIN
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
- H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Signal Processing (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- Power Engineering (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method for searching a space containing an operator based on an ElasticSearch technology, which comprises the following steps: s1, a retrieval user logs in a retrieval platform; and S2, after the retrieval user logs in the retrieval platform, the retrieval platform retrieves the display result of the spatial graph included in the spatial graph according to the spatial graph imported by the retrieval user. According to the invention, after the search platform is safely logged in, the search result is displayed in a color-coated mode to search the space graph imported by the search user to obtain the space graph contained in the search result on the client, so that the search user can conveniently identify the space graph.
Description
Technical Field
The invention relates to the technical field of geographic information, in particular to an arithmetic operator-containing space searching method based on an elastic search technology.
Background
The explosion of data has grown, placing more demand on searches. Among many requirements, fast search response and accurate results are the most basic and most concerned. In the fast aspect, there are numerous underlying search engines that provide good solutions, with open source Solr and elastic search making important contributions to the search field. Patent application No. 2014107312790, entitled "a method for organizing and publishing mass topographic data", discloses including the following steps: reading the terrain data, unifying the coordinates of the terrain data, selecting a terrain data range, establishing index information, resampling the terrain data, fusing the terrain data and releasing the terrain data to form a complete flow. The advantages are as follows: the technical problems that a massive terrain data organization structure is constructed, data can be updated conveniently, retrieval and acquisition can be conducted rapidly and the like can be solved at the same time. Meanwhile, images can be compressed, connected and fused, storage space is reduced, access efficiency is improved, and updating and maintenance are facilitated; mass topographic data can be published and shared by multiple platforms; the method provides safe, reliable, accurate and efficient data support for deep application in different industries.
Disclosure of Invention
The invention aims to at least solve the technical problems in the prior art, and particularly provides an arithmetic operator-containing space search method based on the ElasticSearch technology.
In order to achieve the above object, the present invention provides a method for searching a space containing operators based on an elastic search technology, comprising the following steps:
s1, a retrieval user logs in a retrieval platform;
and S2, after the retrieval user logs in the retrieval platform, the retrieval platform retrieves the display result of the spatial graph contained in the spatial graph according to the spatial graph imported by the retrieval user.
In a preferred embodiment of the present invention, step S2 includes the following steps:
s21, the client judges whether a trigger command for uploading the spatial pattern is received:
if the client receives the trigger command of uploading the spatial pattern, executing the next step;
if the client does not receive the spatial graph uploading trigger command, continuing to wait, and returning to the step S21;
s22, the client acquires the space graph imported in the uploading frame by the retrieval user, and after the client acquires the space graph imported in the uploading frame by the retrieval user, the client sends the acquired space graph to the retrieval platform;
s23, after receiving the space graph sent by the client, the retrieval platform extracts the graph coordinates of the received space graph to obtain a graph coordinate set;
s24, the retrieval platform retrieves the graph contained in the received space graph according to the graph coordinate set;
and S25, displaying the graph data searched by the search platform on the client, wherein the graph data comprises an area and a perimeter.
In a preferred embodiment of the present invention, step S24 includes the following steps:
S241，H＝{H 1 ,H 2 ,H 3 ,…,H h h denotes a graphic coordinate set, H 1 Representing the 1 st coordinate, H, extracted from the received spatial pattern 2 Representing the 2 nd coordinate, H, extracted from the received spatial pattern 3 Representing the 3 rd coordinate, H, extracted from the received spatial pattern h Representing the h coordinate extracted from the received space graph, wherein h represents the total number of coordinates in the received space graph; [ H ] 1 ∪H 2 ∪H 3 ∪…∪H h ]For the spatial pattern received by the retrieval platform, U represents a union of the set logics; let the self-increment value h' =1;
s242, judging the H' th coordinate H h′ Whether pattern set G = { G = { (G) } 1 ,G 2 ,G 3 ,…G g In (v), G 1 Showing the graphic of the No. 1 land, G 2 Representing the 2 nd plot, G 3 Representing the 3 rd plot pattern, G g Representing the g plot graph, wherein g represents the total number of plots; g 1 ∪G 2 ∪G 3 ∪…∪G g For the whole plot graph, U represents a union of the set logics;
if the H' th coordinate H h′ In graphic set G = { G = { (G) 1 ,G 2 ,G 3 ,…G g In the H ', the H' th coordinate is represented by H h′ The corresponding plot is used as the plot to be verifiedForm, h '= h' +1; executing the next step;
if the H' th coordinate is H h′ Out of the graphic set G = { G = { (G) 1 ,G 2 ,G 3 ,…G g In the method, a graph contained in the received space graph is not retrieved;
s243, judging the size relation between h' and h:
if h 'is less than or equal to h, h' represents the self-increment, and h represents the total number of coordinates in the received space graph, executing the next step;
if h '> h, h' represents the self-increment, and h represents the total number of coordinates in the received space graph, executing S245;
s244, judging the H' th coordinate H h′ Whether in the plot to be verified:
if the H' th coordinate is H h′ In the plot to be verified, h '= h' +1; returning to step S243;
if the H' th coordinate H h′ If the map is not in the plot to be verified, the received space plot does not contain the searched graph;
and S245, the plot to be verified is the plot contained in the received space pattern.
In a preferred embodiment of the present invention, in step S245, the area of the block pattern intersecting with the block pattern to be verified is calculated by:
wherein, plex u Representing the area of the pixel point u;
U s representing the total number of pixel points of the s plot pattern intersected with the plot pattern to be verified;
S s representing the area of the s-th plot pattern intersected with the plot pattern to be verified; s =1, 2, 3, 8230, S ', S' represents the total number of land parcel patterns intersecting with the land parcel pattern to be verified;
the calculation method of the perimeter of the plot intersecting with the plot to be verified comprises the following steps:
wherein, plex u Representing the area of the pixel point u;
l s representing the total number of pixel points on the contour line of the s plot intersected with the plot to be verified;
L s representing the perimeter of the s-th plot intersecting the plot to be verified; s =1, 2, 3, \8230;, S' indicates the total number of plot patterns intersecting the plot pattern to be verified.
In a preferred embodiment of the present invention, step S1 includes the following steps:
s11, acquiring a retrieval account number, a retrieval password, an authentication code and a client ID code input by a retrieval user;
s12, fusing the retrieval password and the verification code obtained in the step S11 to obtain a two-code fusion code;
s13, mapping the two-code fusion code obtained in the step S12 into a two-code mapping code;
s14, converting the two-code mapping code obtained in the step S13 into a two-code security code and a two-code security image;
and S15, uploading the two-code security code and the two-code security image obtained in the step S14 and the retrieval account number and the client ID code obtained in the step S11 to a retrieval platform for verification.
In a preferred embodiment of the present invention, the method for converting the two-code mapping code into the two-code security code in step S14 includes the steps of:
s141, converting the two-code mapping code in the step S13 into a two-dimensional code;
s142, converting the two-code mapping code in the step S13 into a binary numerical value;
s143, sequentially writing the binary numerical values in the step S142 into the black frame of the two-dimensional code in the step S142 from left to right and from top to bottom;
s144, writing the numerical value 1 into a white frame of the two-dimensional code, and taking the last written black frame as an end point;
s145, sequentially taking out numerical values in the two-dimensional code from left to right and from top to bottom;
s146, converting the numerical value taken out in the step S145 into a security character with the same scale as the binary code mapping code, wherein the security character is the binary code security code;
and S147, extracting the image of the two-dimensional code written with the numerical values 0 and 1, wherein the image is the two-code security image.
In a preferred embodiment of the present invention, the method of retrieving the platform verification in step S15 includes the steps of:
s151, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code;
s152, converting the two-code security platform code obtained in the step S151 into a binary platform numerical value;
s153, sequentially writing the binary platform numerical values into the frame of the two-code safety platform image in the step S151 from left to right and from top to bottom;
s154, sequentially taking out numerical values from the black frame of the two-code security platform image according to the sequence from left to right and from top to bottom;
s155, converting the numerical value extracted in the step S154 into a binary code mapping platform code with the same system as the binary code mapping code; then the two-code mapping platform code is inversely mapped into a two-code platform code;
s156, searching and obtaining the verification code sent by the retrieval platform according to the client ID platform code obtained in the step S151;
s157, according to the verification code obtained in the step S156 and the two-code platform code obtained in the step S155, obtaining an analysis password and an analysis verification code;
s158, determining whether the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156:
if the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156, executing the next step;
if the analysis verification code obtained in step S157 is not consistent with the verification code obtained in step S156, re-inputting the verification code, or re-inputting the search account number, the search password, and the verification code, and returning to step S11;
s159, searching for the retrieval platform password corresponding to the retrieval platform account according to the retrieval platform account obtained in step S151, and determining whether the retrieval platform password matches the analysis password obtained in step S157:
if the search platform password is consistent with the analysis password obtained in the step S157, the search user successfully logs in the search platform;
if the search platform password is not consistent with the analysis password obtained in step S157, the search password and the verification code are input again, or the search account number, the search password and the verification code are input again, and the process returns to step S11.
In a preferred embodiment of the present invention, the obtaining manner of the two-code fusion code in step S12 includes the following steps:
s121, judging the relationship between the digit of the retrieval password obtained in the step S11 and the digit of the verification code obtained in the step S11:
if A 1 -A 2 ≤A 0 ，and
Wherein A is 1 Number of digits, A, of the search code obtained in step S11 2 Indicating the number of digits, A, of the authentication code obtained in step S11 0 Representing a first threshold of a preset number of bits, and represents a logical relationship and,
indicating that the element set symbol does not belong to, Z + Representing a positive integer set, step S122 is performed;
if A 1 -A 2 ≥A 0 ′，and
Wherein A is 1 Number of digits, A, of the search code obtained in step S11 2 Indicating the number of digits, A, of the authentication code obtained in step S11 0 ' represents a second threshold of a preset number of bits, A 0 ′-A 0 =1, and denotes a logical relationship and,
indicating that the element set symbol does not belong to, Z + Representing a positive integer set, step S123 is performed;
if it is
Wherein, A 1 Number of digits, A, of the search code obtained in step S11 2 Representing the number of bits of the captcha obtained in step S11, e representing the element set symbol belongs to, Z + Representing a positive integer set, and executing step S124;
S122，
wherein B represents a two-code fusion code;
B 1 a 1 st character indicating that the retrieval password obtained in step S11 is counted from left to right; that is, the top character of the retrieval password obtained in step S11 counted from left to right;
B 2 a 2 nd character indicating that the retrieval password obtained in step S11 is counted from left to right;
B 3 a 3 rd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
b 1 a 1 st character indicating that the verification code obtained in step S11 is counted from left to right; that is, the first character of the verification code obtained in step S11 counted from left to right;
b 2 a 2 nd character indicating that the verification code obtained in step S11 is counted from left to right;
b 3 a 3 rd bit character indicating that the verification code obtained in the step S11 is counted from left to right;
S123，
wherein, B represents a two-code fusion code;
B 1 a 1 st character indicating that the retrieval password obtained in step S11 is counted from left to right; that is, the top character of the retrieval password obtained in step S11 counted from left to right;
B 2 a 2 nd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
B 3 a 3 rd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
b 1 a 1 st character indicating that the verification code obtained in step S11 is counted from left to right; that is, the first character of the verification code obtained in step S11 counted from left to right;
b 2 a 2 nd-bit character indicating that the verification code obtained in the step S11 is counted from left to right;
b 3 a 3 rd bit character indicating that the verification code obtained in the step S11 is counted from left to right;
S124，
wherein B represents a two-code fusion code;
B 1 a 1 st character indicating that the search password obtained in step S11 is counted from left to right; that is, the top character of the retrieval password obtained in step S11 counted from left to right;
B 2 a 2 nd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
B 3 a 3 rd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
b 1 a 1 st character indicating that the verification code obtained in step S11 is counted from left to right; that is, the first character of the verification code obtained in step S11 counted from left to right;
b 2 a 2 nd character indicating that the verification code obtained in step S11 is counted from left to right;
b 3 a 3 rd bit character indicating that the verification code obtained in step S11 is counted from left to right;
In a preferred embodiment of the present invention, the method for obtaining the parsed password and the parsed verification code in step S157 includes the following steps:
s1571, determining a relationship between the digits of the two-code platform code obtained in step S155 and the digits of the verification code obtained in step S156:
if A 1 ′-2A 2 ′≤A 0 ，and
Wherein A is 1 ' indicating stepThe number of digits, A, of the two-code platform code obtained in S155 2 ' indicates the number of bits of the authentication code obtained in step S156, A 0 Representing a first threshold of a preset number of bits, and represents a logical relationship and,
indicating that the element set symbol does not belong to, Z + Representing a positive integer set, executing step S1572;
if A 1 ′-2A 2 ′≤A 0 ′，and
Wherein, A 1 ' indicates the number of bits of the two-code platform code obtained in step S155, A 2 ' indicates the number of digits of the authentication code obtained in step S156, A 0 ' represents a second threshold of a preset number of bits, A 0 ′-A 0 =1, and denotes a logical relationship and,
indicating that the element set symbol does not belong to, Z + Representing the positive integer set, executing step S1573;
if it is
Wherein, A 1 ' indicates the number of bits of the two-code platform code obtained in step S155, A 2 ' represents the number of bits of the captcha obtained in step S156, and e represents the element set symbol belonging to, Z + Representing the positive integer set, executing step S1574;
S122，
wherein B' represents a two-code platform code;
B 1 ' 1 st character indicating that the analysis password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
B 2 ' represents the 2 nd digit character from left to right of the analytic password obtained in step S157;
B 3 ' a 3 rd digit character indicating that the analysis password obtained in step S157 is counted from left to right;
b 1 ' 1 st character indicating that the analytic password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
b 2 ' a 2 nd character indicating that the parsing validation code obtained in step S157 is counted from left to right;
b 3 ' a 3 rd bit character indicating that the parsing validation code obtained in step S157 is counted from left to right;
S123，
wherein, B' represents a two-code platform code;
B 1 ' 1 st character indicating that the analysis password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
B 2 ' 2 nd bit word indicating that the parsed password obtained in step S157 is counted from left to rightSymbol;
B 3 ' a 3 rd digit character indicating that the analysis password obtained in step S157 is counted from left to right;
b 1 ' 1 st character indicating that the analysis password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
b 2 ' represents the 2 nd digit character from left to right of the analytic verification code obtained in step S157;
b 3 ' a 3 rd bit character indicating that the parsing validation code obtained in step S157 is counted from left to right;
S124，
wherein B' represents a two-code platform code;
B 1 ' 1 st character indicating that the analysis password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
B 2 ' represents the 2 nd digit character from left to right of the analytic password obtained in step S157;
B 3 ' indicates the analysis obtained in step S157The 3 rd bit character of the password counted from left to right;
b 1 ' 1 st character indicating that the analytic password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
b 2 ' a 2 nd character indicating that the parsing validation code obtained in step S157 is counted from left to right;
b 3 ' a 3 rd bit character indicating that the parsing validation code obtained in step S157 is counted from left to right;
In a preferred embodiment of the present invention, step S141 is to convert the two-code mapping code in step S13 into a two-dimensional code; and rotating the obtained two-dimensional code clockwise or anticlockwise by alpha, wherein the alpha = pi/2, pi and 3 pi/2.
In a preferred embodiment of the present invention, in step S159, the secret analysis password is obtained by encrypting the analysis password obtained in step S157, and the method for obtaining the secret analysis password comprises:
wherein the secure partial actual password represents a secret resolution password;
the MD5 hash rule method | | | | represents that the MD5 hash algorithm is adopted;
B 1 ' bit 1 character which represents the number from left to right of the resolved password; that is, the first character of the password is analyzed from left to right;
B 2 ' bit 2 character from left to right of the resolved password;
B 3 ' represents the 3 rd digit character of the analyzed password counted from left to right;
a search platform password corresponding to the search platform account is obtained by searching the search platform account obtained in step S151, and it is determined whether the search platform password matches the confidential analysis password obtained in step S159:
if the search platform password is consistent with the secret analysis password obtained in the step S159, the search user successfully logs in the search platform;
if the search platform password does not match the confidential analysis password obtained in step S159, the search password and the authentication code are input again, or the search account number, the search password, and the authentication code are input again, and the process returns to step S11.
In summary, due to the adoption of the technical scheme, after the search platform is safely logged in, the search result can be displayed in a color painting mode to search the space graph imported by the search user, and the space graph included with the search result is obtained at the client, so that the search user can conveniently identify the space graph.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 is a schematic block diagram of the process of the present invention.
FIG. 2 is a schematic diagram of a two-dimensional code image according to the present invention.
FIG. 3 is a schematic diagram of the present invention for writing binary values into a two-dimensional code image.
FIG. 4 is a diagram of writing a value 1 into a two-dimensional code image according to the present invention.
Fig. 5 is a schematic diagram of a two-code security image of the present invention.
FIG. 6 is a diagram of a binary platform value written into a two-code security platform image according to the present invention.
Fig. 7 is a schematic diagram of the two-dimensional code image of the present invention rotated 90 ° counterclockwise.
FIG. 8 is a diagram of binary value writing into a two-dimensional code image according to the present invention.
FIG. 9 is a diagram of writing a value 1 into a two-dimensional code image according to the present invention.
Fig. 10 is a schematic diagram of a two-code security image of the present invention.
FIG. 11 is a diagram of a binary platform value written into a binary secure platform image according to the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention.
The invention provides an arithmetic operator-containing space search method based on an ElasticSearch technology, which comprises the following steps as shown in figure 1:
s1, a retrieval user logs in a retrieval platform;
and S2, after the retrieval user logs in the retrieval platform, the retrieval platform retrieves the display result of the spatial graph contained in the spatial graph according to the spatial graph imported by the retrieval user.
In a preferred embodiment of the present invention, step S2 includes the following steps:
s21, the client judges whether a trigger command for uploading the spatial pattern is received:
if the client receives the spatial graph uploading trigger command, executing the next step;
if the client does not receive the spatial graph uploading trigger command, continuing to wait, and returning to the step S21;
s22, the client acquires the space graph imported in the uploading frame by the retrieval user, and after the client acquires the space graph imported in the uploading frame by the retrieval user, the client sends the acquired space graph to the retrieval platform;
s23, after receiving the space graph sent by the client, the retrieval platform extracts the graph coordinates of the received space graph to obtain a graph coordinate set;
s24, the retrieval platform retrieves the graph contained in the received space graph according to the graph coordinate set;
and S25, displaying the graph data searched by the search platform on the client, wherein the graph data comprises an area and a perimeter.
In a preferred embodiment of the present invention, step S24 includes the following steps:
S241，H＝{H 1 ,H 2 ,H 3 ,…,H h h denotes a graphic coordinate set, H 1 Representing the 1 st coordinate, H, extracted from the received spatial pattern 2 Representing the 2 nd coordinate, H, extracted from the received spatial pattern 3 Representing the 3 rd coordinate, H, extracted from the received spatial pattern h Representing the h coordinate extracted from the received space graph, wherein h represents the total number of coordinates in the received space graph; [ H ] 1 ∪H 2 ∪H 3 ∪…∪H h ]For the space pattern received by the retrieval platform, the U represents that the set logic accords with the union set; let the self-increment value h' =1;
s242, judging the H' th coordinate H h′ Whether pattern set G = { G = { (G) } 1 ,G 2 ,G 3 ,…G g In (v), G 1 Showing the graphic of the No. 1 land, G 2 Representing the 2 nd plot, G 3 Representing the 3 rd plot pattern, G g Representing the g plot graph, wherein g represents the total number of plots; g 1 ∪G 2 ∪G 3 ∪…∪G g For the whole plot pattern, the U represents the union of the set logics;
if the H' th coordinate H h′ In graphic set G = { G = { (G) 1 ,G 2 ,G 3 ,…G g In the H ', the H' th coordinate is represented by H h′ The corresponding plot pattern is used as a plot pattern to be verified, h '= h' +1; executing the next step;
if it is firstH' coordinate H h′ Out of the graphic set G = { G = { (G) 1 ,G 2 ,G 3 ,…G g In the method, a graph contained in the received space graph is not retrieved;
s243, judging the size relation between h' and h:
if h 'is less than or equal to h, h' represents the self-increment, and h represents the total number of coordinates in the received space graph, executing the next step;
if h '> h, h' represents self-increment, and h represents the total number of coordinates in the received space graph, executing S245;
s244, judging the H' th coordinate H h′ Whether the map is in the plot to be verified:
if the H' th coordinate is H h′ In the plot to be verified, h '= h' +1; returning to step S243;
if the H' th coordinate is H h′ If the map is not in the plot to be verified, the received space plot does not contain the searched graph;
and S245, the plot to be verified is the plot contained in the received space plot.
In a preferred embodiment of the present invention, in step S245, the method for calculating the area of the land pattern intersecting with the land pattern to be verified is:
wherein, plex u Representing the area of the pixel point u;
U s representing the total number of pixel points of the s plot pattern intersected with the plot pattern to be verified;
S s representing the area of the s plot intersecting the plot to be verified; s =1, 2, 3, 8230, S ', S' represents the total number of land parcel patterns intersecting with the land parcel pattern to be verified;
the calculation method of the perimeter of the plot intersecting with the plot to be verified comprises the following steps:
wherein, plex u Representing the area of the pixel point u;
l s representing the total number of pixel points on the contour line of the s plot intersected with the plot to be verified;
L s representing the perimeter of the s-th plot intersecting the plot to be verified; s =1, 2, 3, \8230;, S' indicates the total number of plot patterns intersecting the plot pattern to be verified.
In a preferred embodiment of the present invention, the step S245 further includes painting the plot pattern intersecting the plot pattern to be verified, where the painting method includes the following steps:
s2451, acquiring a plot graph intersected with the plot graph to be verified, and marking the acquired plot graph intersected with the plot graph to be verified on a space map as a marking point;
s2452, acquiring RGB values of pixel points of the space map corresponding to the mark points and RGB values of adjacent pixel points of the space map corresponding to the mark points;
s2453, calculating a color coating value according to the RGB value of the pixel point of the space map corresponding to the mark point obtained in the step S2452 and the RGB value of the adjacent pixel point of the space map corresponding to the mark point obtained in the step S2452; the calculation method of the color coating value comprises the following steps:
wherein, GRAY (X) i ,Y i ,Z i ) The pixel value of the ith pixel point of the space map corresponding to the mark point is represented;
(X i ,Y i ,Z i ) Representing the position coordinates of the ith pixel point on the space map;
i represents the total number of pixel points of the space map corresponding to the mark points;
GRAY max representing the maximum pixel value of all pixel points of the space map corresponding to the mark point;
GRAY min representing the minimum pixel value of all pixel points of the space map corresponding to the mark point;
GRAY′(X j ′,Y j ′,Z j ') the pixel value of the j-th adjacent pixel point of the space map corresponding to the mark point is represented;
(X j ′,Y j ′,Z j ') represents the position coordinates of the j adjacent pixel point on the space map;
j represents the total number of adjacent pixel points of the space map corresponding to the mark points;
GRAY m ′ ax representing the maximum pixel value of all adjacent pixel points of the space map corresponding to the mark point;
GRAY m ′ in representing the minimum pixel value in all adjacent pixel points of the space map corresponding to the mark point;
Q(X i ,Y i ,Z i ) Representing a color value of the paint;
s2454, color number Q (X) i ,Y i ,Z i ) Painting as the pixel value of the corresponding mark point;
s2455, displaying the painted plot on the client.
In a preferred embodiment of the present invention, step S1 includes the following steps:
s11, acquiring a retrieval account, a retrieval password, an authentication code and a client ID code input by a retrieval user; the client ID code is not limited to a mainboard ID code, a CPUID code, a display card ID code and a hard disk ID code, but also can be a Bluetooth ID code, an ICCID code and an IMEIID code, when the client is a PC computer, the client ID code is preferably the CPUID code, and when the client is a smart phone, the client ID code is preferably the Bluetooth ID code; the search account number, the search password and the verification code input by the user are 92-system characters, and numerical values represented by the characters are shown in table 2.
S12, fusing the retrieval password and the verification code obtained in the step S11 to obtain a two-code fusion code; the safety factor of the password is improved by adjusting the position sequence of the retrieval password and the verification code.
S13, mapping the two-code fusion code obtained in the step S12 into a two-code mapping code; the safety factor of the password can be improved by mapping the two-code fusion code into the two-code mapping code.
S14, converting the two-code mapping code obtained in the step S13 into a two-code security code and a two-code security image; and converting the two-code mapping code into a two-code security code and a two-code security image to realize the secure transmission of the password.
And S15, uploading the two-code security code and the two-code security image obtained in the step S14 and the retrieval account number and the client ID code obtained in the step S11 to a retrieval platform for verification.
In a preferred embodiment of the present invention, the method for converting the two-code mapping code into the two-code security code in step S14 includes the steps of:
s141, converting the two-code mapping code in the step S13 into a two-dimensional code;
s142, converting the two-code mapping code in the step S13 into a binary numerical value;
s143, sequentially writing the binary numerical values in the step S142 into the black frames of the two-dimensional codes in the step S142 from left to right and from top to bottom;
s144, writing the numerical value 1 into a white frame of the two-dimensional code, and taking the last written black frame as an end point;
s145, sequentially taking out numerical values in the two-dimensional code from left to right and from top to bottom;
s146, converting the numerical value taken out in the step S145 into a security character with the same system as the binary code mapping code, wherein the security character is the binary code security code;
and S147, extracting the image of the two-dimensional code written with the numerical values 0 and 1, wherein the image is the two-code security image.
In a preferred embodiment of the present invention, the method of retrieving the platform verification in step S15 includes the steps of:
s151, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code;
s152, converting the two-code security platform code obtained in the step S151 into a binary platform numerical value;
s153, sequentially writing the binary platform numerical values into the frame of the two-code safety platform image in the step S151 from left to right and from top to bottom;
s154, sequentially taking out numerical values from the black frame of the two-code security platform image from left to right and from top to bottom;
s155, converting the numerical value extracted in the step S154 into a binary code mapping platform code with the same system as the binary code mapping code; then the two-code mapping platform code is inversely mapped into a two-code platform code;
s156, searching according to the client ID platform code obtained in the step S151 to obtain a verification code sent by a retrieval platform;
s157, according to the verification code obtained in the step S156 and the two-code platform code obtained in the step S155, obtaining an analysis password and an analysis verification code;
s158, determining whether the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156:
if the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156, executing the next step;
if the analysis verification code obtained in step S157 is not consistent with the verification code obtained in step S156, re-inputting the verification code, or re-inputting the search account number, the search password, and the verification code, and returning to step S11;
s159, searching for the retrieval platform password corresponding to the retrieval platform account according to the retrieval platform account obtained in step S151, and determining whether the retrieval platform password matches the analysis password obtained in step S157:
if the search platform password is consistent with the analysis password obtained in the step S157, the search user successfully logs in the search platform;
if the search platform password is not consistent with the analysis password obtained in step S157, the search password and the verification code are re-input, or the search account number, the search password and the verification code are re-input, and the process returns to step S11.
In a preferred embodiment of the present invention, the obtaining of the two-code fusion code in step S12 includes the following steps:
s121, judging the relationship between the digit of the retrieval password obtained in the step S11 and the digit of the verification code obtained in the step S11:
if A is 1 -A 2 ≤A 0 ，and
Wherein A is 1 Number of digits, A, of the search password obtained in step S11 2 Indicating the number of digits, A, of the authentication code obtained in step S11 0 Representing a first threshold of a preset number of bits, and represents a logical relationship and,
indicating that the element set symbol does not belong to, Z + Representing a positive integer set, step S122 is performed;
if A is 1 -A 2 ≥A 0 ′，and
Wherein, A 1 Number of digits, A, of the search code obtained in step S11 2 Indicating the number of digits of the authentication code obtained in step S11, A 0 ' represents a second threshold of a preset number of bits, A 0 ′-A 0 =1, and denotes a logical relationship and,
indicating that the element set symbol does not belong to, Z + Representing a positive integer set, and executing step S123;
if it is
Wherein A is 1 Number of digits, A, of the search code obtained in step S11 2 Representing the number of bits of the captcha obtained in step S11, e representing the element set symbol belonging, Z + Representing a positive integer set, step S124 is performed;
S122，
wherein, B represents a two-code fusion code;
B 1 a 1 st character indicating that the search password obtained in step S11 is counted from left to right; that is, the top character of the retrieval password obtained in step S11 counted from left to right;
B 2 a 2 nd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
B 3 a 3 rd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
b 1 a 1 st character indicating that the verification code obtained in step S11 is counted from left to right; that is, the first character of the verification code obtained in step S11 counted from left to right;
b 2 a 2 nd-bit character indicating that the verification code obtained in the step S11 is counted from left to right;
b 3 a 3 rd bit character indicating that the verification code obtained in step S11 is counted from left to right;
S123，
wherein B represents a two-code fusion code;
B 1 a 1 st character indicating that the retrieval password obtained in step S11 is counted from left to right; that is, the top character of the retrieval password obtained in step S11 counted from left to right;
B 2 a 2 nd character indicating that the retrieval password obtained in step S11 is counted from left to right;
B 3 a 3 rd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
b 1 a 1 st character indicating that the verification code obtained in step S11 is counted from left to right; that is, the first character of the verification code obtained in step S11 counted from left to right;
b 2 a 2 nd-bit character indicating that the verification code obtained in the step S11 is counted from left to right;
b 3 a 3 rd bit character indicating that the verification code obtained in the step S11 is counted from left to right;
S124，
wherein B represents a two-code fusion code;
B 1 a 1 st character indicating that the retrieval password obtained in step S11 is counted from left to right; that is, the top character of the retrieval password obtained in step S11 counted from left to right;
B 2 a 2 nd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
B 3 a 3 rd digit character indicating that the retrieval password obtained in step S11 is counted from left to right;
b 1 represents the step S11, acquiring a 1 st character of the verification code counted from left to right; that is, the first character of the verification code obtained in step S11 counted from left to right;
b 2 a 2 nd-bit character indicating that the verification code obtained in the step S11 is counted from left to right;
b 3 a 3 rd bit character indicating that the verification code obtained in step S11 is counted from left to right;
In a preferred embodiment of the present invention, the method for obtaining the parsed password and the parsed verification code in step S157 includes the following steps:
s1571, determining a relationship between the digits of the two-code platform code obtained in step S155 and the digits of the verification code obtained in step S156:
if A 1 ′-2A 2 ′≤A 0 ，and
Wherein, A 1 ' indicates the number of bits of the two-code platform code obtained in step S155, A 2 ' indicates the number of digits of the authentication code obtained in step S156, A 0 Representing a first threshold of a predetermined number of bits, and representing a logical relationship and,
indicating that the element set symbol does not belong to, Z + Representing a positive integer set, executing step S1572;
if A is 1 ′-2A 2 ′≤A 0 ′，and
Wherein A is 1 ' indicates the number of bits of the two-code platform code obtained in step S155, A 2 ' indicates the number of bits of the authentication code obtained in step S156, A 0 ' represents a second threshold of a preset number of bits, A 0 ′-A 0 =1, and denotes a logical relationship and,
indicating that the element set symbol does not belong to, Z + Representing the positive integer set, executing step S1573;
if it is
Wherein A is 1 ' indicates the number of bits of the two-code platform code obtained in step S155, A 2 ' represents the number of bits of the authentication code obtained in step S156, and e represents that the element set symbol belongs to, Z + Representing the positive integer set, executing step S1574;
S122，
wherein B' represents a two-code platform code;
B 1 ' 1 st character indicating that the analytic password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
B 2 ' represents the 2 nd digit character from left to right of the analytic password obtained in step S157;
B 3 ' a 3 rd digit character indicating that the analysis password obtained in step S157 is counted from left to right;
b 1 ' 1 st character indicating that the analysis password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
b 2 ' represents the 2 nd digit character from left to right of the analytic verification code obtained in step S157;
b 3 ' a 3 rd bit character indicating that the parsing validation code obtained in step S157 is counted from left to right;
S123，
wherein B' represents a two-code platform code;
B 1 ' 1 st character indicating that the analytic password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
B 2 ' represents the 2 nd digit character from left to right of the analytic password obtained in step S157;
B 3 ' a 3 rd digit character indicating that the analysis password obtained in step S157 is counted from left to right;
b 1 ' indicates that acquisition in step S157The 1 st character of the obtained analysis password counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
b 2 ' a 2 nd character indicating that the parsing validation code obtained in step S157 is counted from left to right;
b 3 ' a 3 rd bit character indicating that the parsing validation code obtained in step S157 is counted from left to right;
S124，
wherein, B' represents a two-code platform code;
B 1 ' 1 st character indicating that the analytic password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
B 2 ' represents the 2 nd digit character from left to right of the analytic password obtained in step S157;
B 3 ' a 3 rd digit character indicating that the analysis password obtained in step S157 is counted from left to right;
b 1 ' 1 st character indicating that the analytic password obtained in step S157 is counted from left to right; that is, the first character of the analyzed password obtained in step S157 counted from left to right;
b 2 ' represents the 2 nd digit character from left to right of the analytic verification code obtained in step S157;
b 3 ' represents the 3 rd bit character from left to right of the parsing validation code obtained in step S157;
Assume that a search account number, a search password and an authentication code input by a search user are admin, 0 and 01, respectively. The number of bits of a typical captcha is four bits, and the number of password bits is no less than six, but the number of bits of the search password and the captcha is shortened here for illustration.
Firstly, acquiring a retrieval account, a retrieval password and a verification code which are respectively admin, 0 and 01 and input by a retrieval user.
In the second step, since the digit of the search code 0 is 4, the digit of the verification code 01 is 2, that is, the two digits are matched
Thus, the two-code fusion code B = B 1 b 1 B 2 b 2 B 3 B 4 ＝？01？0。
Third, do two-code fusion codes according to table 1? 01?0 is mapped to the two-code mapping code 010201.
TABLE 1 mapping of character 1 to character 2
| |
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | a | b | c | d | e | f | g | h | i |
| Character 2 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | a | b | c | d | e | f | g | h | i | j |
| Character 1 | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | A | B |
| Character 2 | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | A | B | C |
| Character 1 | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U |
| Character 2 | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V |
| Character 1 | V | W | X | Y | Z | ) | ！ | @ | # | $ | ％ | ^ | & | * | ( | - | ＝ | [ | ] |
| Character 2 | W | X | Y | Z | ) | ！ | @ | # | $ | ％ | ^ | & | * | ( | - | ＝ | [ | ] | |
| Character | |||||||||||||||||||
| 1 | \ | ； | ‘ | , | . | / | _ | + | { | } | | | : | “ | < | > | ？ | |||
| Character 2 | ； | ‘ | , | . | / | _ | + | { | } | | | : | “ | < | > | ？ | 0 |
Fourthly, the two-code mapping code 010201 is converted into binary value 0100010001010110001100100001 according to the table 2, and the decimal value is 071656225.
TABLE 2 numerical values corresponding to characters
| Character(s) | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | a | b | c | d | e | f | g | h | i |
| |
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 |
| Character(s) | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | A | B |
| Numerical value | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 |
| Character(s) | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U |
| Numerical value | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 |
| Character(s) | V | W | X | Y | Z | ) | ！ | @ | # | $ | ％ | ^ | & | * | ( | - | ＝ | [ | ] |
| Numerical value | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 |
| Character(s) | \ | ； | ‘ | , | . | / | _ | + | { | } | | | : | “ | < | > | ？ | |||
| Numerical value | 76 | 77 | 78 | 79 | 81 | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 | 90 | 91 |
Fifthly, converting the two-code mapping code 010201 into a two-dimensional code image, as shown in fig. 2.
Sixthly, sequentially writing the binary value 0100010001010110001100100001 into the black frame of the two-dimensional code from left to right and from top to bottom, as shown in fig. 3.
And seventhly, writing the numerical value 1 into a white frame of the two-dimensional code, as shown in fig. 4.
And eighthly, sequentially taking out the numerical values 0100010111001110101100111110111011101110100011 in the two-dimensional code from left to right and from top to bottom.
Ninth, the fetched value 0100010111001110101100111110111111011101110100011 is converted into a security character 02&fk [: (L, decimal 153508168720291) of the same system as the binary code mapping code, the security character 02&fk [: (L is a binary code security code).
And a tenth step of extracting an image of the two-dimensional code written with the values 0 and 1, wherein the image is a two-code security image, as shown in fig. 5.
And step ten, uploading the two-code security code 02&fk [ (L and the two-code security image obtained in the step ten as well as the retrieval account admin and the client ID code obtained in the step one) obtained in the step ninth to a retrieval platform.
The verification process of the retrieval platform comprises the following steps:
a twelfth step, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code; the method comprises the following steps that a retrieval platform receives a two-code security code 02&fk [ (L is a two-code security platform code, a two-code security image sent by a client is received by the retrieval platform and is a two-code security platform image, a retrieval account number admin sent by the client is received by the retrieval platform and is a retrieval platform account number, and a client ID code sent by the client is received by the retrieval platform and is a client ID platform code;
step ten, the two-code security platform code 02&fk [: in step ten (L is converted into binary platform numerical value 0100010111001110101100111011101110100011;
fourteenth, writing the binary platform values into the boxes of the two-code security platform image in the twelfth step in sequence from left to right and from top to bottom, as shown in fig. 6;
fifthly, sequentially taking out numerical values from a black frame of the two-code security platform image from left to right and from top to bottom, wherein the numerical values are 0100010001010110001100100001;
sixthly, converting the numerical value 0100010001010110001100100001 extracted in the fifteenth step into a binary code mapping platform code 010201 in the same system as the binary code mapping code;
seventeenth, according to table 3, the two-code mapping stage code 010201 is demapped into a two-code stage code? 01?0.
TABLE 3 character 1 demaps to character 2
| |
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | a | b | c | d | e | f | g | h | i |
| Character 2 | ？ | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | a | b | c | d | e | f | j | h |
| Character 1 | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | A | B |
| Character 2 | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | A |
| Character 1 | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U |
| Character 2 | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T |
| Character 1 | V | W | X | Y | Z | ) | ！ | @ | # | $ | ％ | ^ | & | * | ( | - | ＝ | [ | ] |
| Character 2 | U | V | W | X | Y | Z | ) | ！ | @ | # | $ | ％ | ^ | & | * | ( | - | ＝ | [ |
| |
； | ‘ | \ | , | . | / | _ | + | { | } | : | “ | | | < | > | ？ | |||
| Character 2 | ] | ； | ‘ | \ | , | . | / | _ | + | { | } | : | “ | | | < | > |
Eighteen, searching according to the client ID platform code obtained in the twelve steps to obtain a verification code 01 sent by the retrieval platform;
nineteenth step, is two-code platform code? 01? The digit of 0 is 6, and the digit of the verification code sent by the retrieval platform is 2, namely the verification code is in line with
Thus, it is possible to provide
So that the password B is parsed 1 ′B 2 ′B 3 ′B 4 ' = 0, parsing verification code b 1 ′b 2 ′＝01。
Twentieth, because the analysis verification code 01 obtained in the nineteenth step is identical to the verification code 01 obtained in the tenth step, executing the next step;
twenty-first, searching to obtain a retrieval platform password 0 corresponding to the retrieval platform account according to the retrieval platform account admin obtained in the twelfth step.
And a twentieth step, because the retrieval platform account number obtained in the twentieth step searches for the retrieval platform password 0 corresponding to the retrieval platform account number admin and the analysis password 0 obtained in the nineteenth step are consistent, the retrieval user successfully logs in the retrieval platform.
In a preferred embodiment of the present invention, step S141 is to convert the two-code mapping code in step S13 into a two-dimensional code; and rotating the obtained two-dimensional code clockwise or anticlockwise by alpha, wherein the alpha = pi/2, pi and 3 pi/2.
In another embodiment: firstly, acquiring a retrieval account, a retrieval password and a verification code which are respectively admin, 0 and 01 and input by a retrieval user.
In the second step, since the digit of the search code 0 is 4, the digit of the verification code 01 is 2, that is, the two digits are matched
Thus, the two-code fusion code B = B 1 b 1 B 2 b 2 B 3 B 4 ＝？01？0。
Third, do two-code fusion codes according to table 1? 01?0 is mapped into a two-code mapping code 010201;
the fourth step is to convert the binary mapping code 010201 into binary value 0100010001010110001100100001 with decimal value 071656225 according to table 2.
Fifthly, converting the two-code mapping code 010201 into a two-dimensional code image, as shown in fig. 2; the two-dimensional code image is rotated 90 deg. counterclockwise as shown in fig. 7.
Sixthly, sequentially writing the binary value 0100010001010110001100100001 into the black frame of the two-dimensional code from left to right and from top to bottom, as shown in fig. 8.
And seventhly, writing the value 1 into a white frame of the two-dimensional code, as shown in fig. 9.
And eighthly, sequentially taking out the numerical values 01000101110101111101111111101111101011110101100101101 from the left to the right and from the top to the bottom in sequence.
And step nine, converting the extracted numerical value 01000101110101111101111111111111101011110101100101101 into a security character I4$ PTmn =withthe same scale as the binary code mapping code, wherein the decimal is 247389155871533, and the security character I4$ PTmn = is the binary code security code.
And a tenth step of extracting an image of the two-dimensional code written with the values 0 and 1, which is the two-code security image, as shown in fig. 10.
And step eleven, uploading the two-code security code I4$ PTmn = obtained in the step nine, the two-code security image obtained in the step eleven, the retrieval account admin obtained in the step one and the client ID code to a retrieval platform.
The verification process of the retrieval platform comprises the following steps:
a twelfth step, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code; the retrieval platform receives a two-code security code I4$ PTmn = a two-code security platform code sent by a client, the two-code security image sent by the client is a two-code security platform image, the retrieval platform receives a retrieval account number admin sent by the client as a retrieval platform account number, and the retrieval platform receives a client ID code sent by the client as a client ID platform code;
a tenth step, converting the two-code security platform code I4$ PTmn = in the twelfth step into a binary platform numerical value 01000101110101111101111101011110101100101101;
fourteenth, writing the binary platform values into the frames of the two-code security platform image in the twelfth step in sequence from left to right and from top to bottom, as shown in fig. 11;
fifthly, sequentially taking out numerical values from a black frame of the two-code security platform image from left to right and from top to bottom, wherein the numerical values are 0100010001010110001100100001;
sixthly, converting the numerical value 0100010001010110001100100001 extracted in the fifteenth step into a binary code mapping platform code 010201 in the same system as the binary code mapping code;
seventeenth, according to table 3, the two-code mapping platform code 010201 is demapped into a two-code platform code? 01?0;
eighteen, searching according to the client ID platform code obtained in the twelve steps to obtain a verification code 01 sent by the retrieval platform;
nineteenth step, is two-code platform code? 01? The digit of 0 is 6, and the digit of the verification code sent by the retrieval platform is 2, namely the verification code is in line with
Thus, it is possible to provide
So that the password B is parsed 1 ′B 2 ′B 3 ′B 4 ' = 0, parsing verification code b 1 ′b 2 ′＝01。
Twentieth, because the analysis verification code 01 obtained in the nineteenth step is identical to the verification code 01 obtained in the tenth step, executing the next step;
twenty-first, searching to obtain a retrieval platform password 0 corresponding to the retrieval platform account according to the retrieval platform account admin obtained in the twelfth step.
And a twentieth step, because the retrieval platform account number obtained in the twentieth step searches for the retrieval platform password 0 corresponding to the retrieval platform account number admin and the analysis password 0 obtained in the nineteenth step are consistent, the retrieval user successfully logs in the retrieval platform.
In a preferred embodiment of the present invention, in step S159, the secret analysis password is obtained by encrypting the analysis password obtained in step S157, and the method for obtaining the secret analysis password comprises:
wherein the secure partial actual password represents a secret analytic password;
the MD5 hash rule method | | | | represents that the MD5 hash algorithm is adopted;
B 1 ' bit 1 character which represents the number from left to right of the resolved password; that is, the first character of the password is analyzed from left to right;
B 2 ' bit 2 character from left to right of the resolved password;
B 3 ' means the 3 rd digit character from left to right of the resolved password;
searching the retrieval platform account obtained in step S151 to obtain a retrieval platform password corresponding to the retrieval platform account, and determining whether the retrieval platform password matches the confidential analysis password obtained in step S159:
if the search platform password is consistent with the secret analysis password obtained in the step S159, the search user successfully logs in the search platform;
if the search platform password does not match the confidential analysis password obtained in step S159, the search password and the authentication code are input again, or the search account number, the search password, and the authentication code are input again, and the process returns to step S11. The retrieval platform password is stored instead of the stored retrieval password input in the step S11, so that the client platform can not log in the platform even if the client platform takes the retrieval platform password, and the effect of safety guarantee is achieved.
In another embodiment: firstly, acquiring a retrieval account, a retrieval password and a verification code which are respectively admin, 0 and 01 and input by a retrieval user.
In the second step, since the digit of the search code 0 is 4, the digit of the verification code 01 is 2, i.e. the match is obtained
Thus, the two-code fusion code B = B 1 b 1 B 2 b 2 B 3 B 4 ＝？01？0。
Third, do two-code fusion codes according to table 1? 01?0 is mapped into a two-code mapping code 010201;
the fourth step is to convert the binary mapping code 010201 into binary value 0100010001010110001100100001 with decimal value 071656225 according to table 2.
Fifthly, the two-code mapping code 010201 is converted into a two-dimensional code image, as shown in fig. 2.
Sixthly, sequentially writing the binary value 0100010001010110001100100001 into the black frame of the two-dimensional code from left to right and from top to bottom, as shown in fig. 3.
And seventhly, writing the numerical value 1 into a white frame of the two-dimensional code, as shown in fig. 4.
And eighthly, sequentially taking out the numerical values 0100010111001110101100111110111011101110100011 in the two-dimensional code from left to right and from top to bottom.
Ninth, the fetched value 0100010111001110101100111110111111011101110100011 is converted into a security character 02&fk [: (L, decimal 153508168720291) of the same system as the binary code mapping code, the security character 02&fk [: (L is a binary code security code).
And step ten, extracting the image of the two-dimensional code written with the values 0 and 1, wherein the image is the two-code security image, as shown in fig. 5.
And step eleven, uploading the two-code security code 02&fk [: obtained in the step nine (L and the two-code security image obtained in the step ten as well as the retrieval account admin and the client ID code obtained in the step one) to a retrieval platform.
The verification process of the retrieval platform comprises the following steps:
a twelfth step, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code; the method comprises the following steps that a retrieval platform receives a two-code security code 02&fk [ (L is a two-code security platform code, a two-code security image sent by a client is received by the retrieval platform and is a two-code security platform image, a retrieval account number admin sent by the client is received by the retrieval platform and is a retrieval platform account number, and a client ID code sent by the client is received by the retrieval platform and is a client ID platform code;
step ten, the two-code security platform code 02&fk [: in step ten (L is converted into binary platform numerical value 0100010111001110101100111011101110100011;
fourteenth, writing the binary platform values into the frames of the two-code security platform image in the twelfth step sequentially from left to right and from top to bottom, as shown in fig. 6;
fifthly, sequentially taking out numerical values from a black frame of the two-code security platform image from left to right and from top to bottom, wherein the numerical values are 0100010001010110001100100001;
sixthly, converting the numerical value 0100010001010110001100100001 extracted in the fifteenth step into a binary code mapping platform code 010201 which is the same as the binary code mapping code;
seventeenth, according to table 3, the two-code mapping stage code 010201 is demapped into a two-code stage code? 01?0;
eighteen, searching according to the client ID platform code obtained in the twelve steps to obtain a verification code 01 sent by the retrieval platform;
nineteenth step, is due to the two-code platform code? 01? The digit of 0 is 6, and the digit of the verification code sent by the retrieval platform is 2, namely the verification code is in line with
Thus, it is possible to provide
So that the password B is parsed 1 ′B 2 ′B 3 ′B 4 ' = 0, parsing verification code b 1 ′b 2 ′＝01。
Twentieth, since the analysis verification code 01 obtained in the nineteenth step is identical to the verification code 01 obtained in the tenth step, the next step is executed;
twenty-first, a retrieval platform password 03234EF598DA6686 corresponding to the retrieval platform account is obtained by searching according to the retrieval platform account admin obtained in the twelfth step.
Twenty-second step, performing MD5 hash algorithm on the analytic password 0 obtained in the nineteenth step to obtain a concealed analytic password:
the Securely parse actual password＝MD5 hash rule method||B 1 ′B 2 ′B 3 ′B 4 ′||
＝MD5 hash rule method|| 0||
＝03234EF598DA6686
in the twentieth step, since the retrieval platform password 03234EF598DA6686 corresponding to the retrieval platform account admin obtained by searching the retrieval platform account obtained in the twentieth step is consistent with the confidential resolution password 03234EF598DA6686 obtained in the twentieth step, the retrieval user successfully logs in the retrieval platform.
In another embodiment: firstly, acquiring the searching account number, the searching password and the verification code input by the searching user as admin, 0 and 01 respectively.
In the second step, since the digit of the search code 0 is 4, the digit of the verification code 01 is 2, i.e. the match is obtained
Thus, the two-code fusion code B = B 1 b 1 B 2 b 2 B 3 B 4 ＝？01？0。
Third, do two-code fusion codes according to table 1? 01?0 is mapped into a two-code mapping code 010201;
fourthly, the two-code mapping code 010201 is converted into binary value 0100010001010110001100100001 according to the table 2, and the decimal value is 071656225.
Fifthly, converting the two-code mapping code 010201 into a two-dimensional code image as shown in fig. 2; the two-dimensional code image is rotated 90 deg. counterclockwise as shown in fig. 7.
Sixthly, sequentially writing the binary value 0100010001010110001100100001 into the black frame of the two-dimensional code from left to right and from top to bottom, as shown in fig. 8.
And seventhly, writing the value 1 into a white frame of the two-dimensional code, as shown in fig. 9.
And eighthly, sequentially taking out the numerical values 01000101110101111101111111101111101011110101100101101 from the left to the right and from the top to the bottom.
And step nine, converting the extracted numerical value 01000101110101111101111111111111101011110101100101101 into a security character I4$ PTmn =withthe same scale as the binary code mapping code, wherein the decimal is 247389155871533, and the security character I4$ PTmn = is the binary code security code.
And a tenth step of extracting an image of the two-dimensional code written with the values 0 and 1, wherein the image is a two-code security image, as shown in fig. 10.
And step eleven, uploading the two-code security code I4$ PTmn = obtained in the step nine, the two-code security image obtained in the step eleven, the retrieval account admin obtained in the step one and the client ID code to a retrieval platform.
The verification process of the retrieval platform comprises the following steps:
a twelfth step, after receiving the two-code security code and the two-code security image, the retrieval account and the client ID code sent by the client, the retrieval platform respectively obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account and the client ID platform code; the retrieval platform receives a two-code security code I4$ PTmn = a two-code security platform code sent by a client, the two-code security image sent by the client is a two-code security platform image, the retrieval platform receives a retrieval account number admin sent by the client as a retrieval platform account number, and the retrieval platform receives a client ID code sent by the client as a client ID platform code;
a tenth step, converting the two-code security platform code I4$ PTmn = in the twelfth step into a binary platform numerical value 01000101110101111101111101011110101100101101;
fourteenth, writing the binary platform values into the frames of the two-code security platform image in the twelfth step in sequence from left to right and from top to bottom, as shown in fig. 11;
fifthly, sequentially taking out numerical values from a black frame of the two-code security platform image from left to right and from top to bottom, wherein the numerical values are 0100010001010110001100100001;
sixthly, converting the numerical value 0100010001010110001100100001 extracted in the fifteenth step into a binary code mapping platform code 010201 in the same system as the binary code mapping code;
seventeenth, according to table 3, the two-code mapping stage code 010201 is demapped into a two-code stage code? 01?0;
eighteen, searching according to the client ID platform code obtained in the twelve steps to obtain a verification code 01 sent by the retrieval platform;
nineteenth step, is due to the two-code platform code? 01? The digit of 0 is 6, and the digit of the verification code sent by the retrieval platform is 2, namely the verification code is in line with
Thus, it is possible to provide
So that the password B is parsed 1 ′B 2 ′B 3 ′B 4 ' = 0, parsing verification code b 1 ′b 2 ′＝01。
Twentieth, because the analysis verification code 01 obtained in the nineteenth step is identical to the verification code 01 obtained in the tenth step, executing the next step;
twenty-first, searching to obtain a retrieval platform password 03234EF598DA6686 corresponding to the retrieval platform account according to the retrieval platform account admin obtained in the twelfth step.
A twenty-second step, performing an MD5 hash algorithm on the analytic password 0 obtained in the nineteenth step to obtain a hidden analytic password:
the Securely parse actual password＝MD5 hash rule method||B 1 ′B 2 ′B 3 ′B 4 ′||
＝MD5 hash rule method|| 0||
＝03234EF598DA6686
and a twentieth step, because the retrieval platform account number obtained in the twentieth step searches for the retrieval platform password 03234EF598DA6686 corresponding to the retrieval platform account number admin and the confidential resolution password 03234EF598DA6686 obtained in the twentieth step are consistent, the retrieval user successfully logs in the retrieval platform.
On a retrieval platform, the method for obtaining the password of the retrieval platform comprises the following steps:
s01, acquiring a retrieval password input by a retrieval user in a password registration box during registration;
s02, mapping the retrieval password obtained in the step S01 into a retrieval mapping code;
s03, converting the retrieval mapping code obtained in the step S02 into a password security code and a password security image; the method for converting the retrieval mapping code into the password security code and the password security image comprises the following steps:
s031, converting the retrieval mapping code in step S03 into a two-dimensional code;
s032, converting the search mapping code in step S03 into a binary value;
s033, writing the binary values in step S032 into the black frames of the two-dimensional codes in step S032 sequentially from left to right and from top to bottom;
s034, writing the numerical value 1 into a white frame of the two-dimensional code, and taking the last written black frame as an end point;
s035, sequentially taking out numerical values in the two-dimensional codes from left to right and from top to bottom;
s036, converting the numerical value extracted in the step S035 into a security character with the same scale as the retrieval mapping code, wherein the security character is a password security code;
s037, extracting an image of the two-dimensional code written with the numerical values 0 and 1, wherein the image is the password security image.
And S04, uploading the client ID code, the password security code obtained in the step S03 and the password security image to a retrieval platform for verification and registration. The method for verifying registration of the retrieval platform comprises the following steps:
s041, after receiving the password security code, the password security image and the client ID code sent by the client, the retrieval platform respectively obtains a password security platform code, a password security platform image and a client ID platform code;
s042, the password security platform code obtained in the step S041 is converted into a binary platform numerical value;
s043, sequentially writing the binary platform values into the frame of the password security platform image in the step S041 from left to right and from top to bottom;
s044, sequentially taking out numerical values from the black frame of the password security platform image from left to right and from top to bottom;
s045, converting the numerical value extracted in the step S044 into a password mapping platform code with the same scale as the retrieval mapping code; then, the password mapping platform code is inversely mapped into a password platform code; or, converting the value extracted in step S044 into a password mapping platform code with the same system as the retrieval mapping code; then, the password mapping platform code is inversely mapped into a password platform code;
and S046, generating a registration account according to the client ID platform code obtained in the step S041, associating the registration account with the password platform code, storing the registration account in a retrieval platform database, and returning the registration account to the retrieval user, wherein the registration process of the retrieval user is completed at this moment.
Or, in S041, after receiving the password security code, the password security image, and the client ID code sent by the client, the retrieval platform obtains the password security platform code, the password security platform image, and the client ID platform code, respectively;
s042, the password security platform code obtained in the step S041 is converted into a binary platform numerical value;
s043, sequentially writing the binary system platform values into the frame of the password security platform image in the step S041 from left to right and from top to bottom;
s044, sequentially taking out numerical values from the black frame of the password security platform image from left to right and from top to bottom;
s045, converting the numerical value extracted in the step S044 into a password mapping platform code with the same scale as the retrieval mapping code; then, the password mapping platform code is inversely mapped into a password platform code; or, converting the value extracted in step S044 into a password mapping platform code with the same system as the retrieval mapping code; then the password mapping platform code is inversely mapped into a password platform code;
s046, obtaining a hidden password platform code by the password platform code in the step S045 by using the MD5 hash algorithm;
s047, generating a registration account according to the client ID platform code obtained in the step S041, associating the registration account with the platform code of the secret password, storing the registration account in a retrieval platform database, and returning the registration account to the retrieval user, wherein the registration process of the retrieval user is completed at this moment.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
Claims (7)
1. A method for searching a space containing an operator based on an ElasticSearch technology is characterized by comprising the following steps:
s1, a retrieval user logs in a retrieval platform;
and S2, after the retrieval user logs in the retrieval platform, the retrieval platform retrieves the display result of the spatial graph included in the spatial graph according to the spatial graph imported by the retrieval user.
2. The method for searching the space containing arithmetic operators based on the ElasticSearch technology according to the claim 1, characterized in that the step S2 comprises the following steps:
s21, the client judges whether a trigger command for uploading the spatial pattern is received:
if the client receives the spatial graph uploading trigger command, executing the next step;
if the client does not receive the spatial graph uploading trigger command, continuing to wait, and returning to the step S21;
s22, the client acquires the space graph imported in the uploading frame by the retrieval user, and after the client acquires the space graph imported in the uploading frame by the retrieval user, the client sends the acquired space graph to the retrieval platform;
s23, after receiving the space graph sent by the client, the retrieval platform extracts graph coordinates of the received space graph to obtain a graph coordinate set;
s24, the retrieval platform retrieves the graph contained in the received space graph according to the graph coordinate set;
and S25, displaying the graphic data retrieved by the retrieval platform on the client, wherein the graphic data comprises an area and a perimeter.
3. The method for searching the space containing arithmetic operators based on the ElasticSearch technology according to the claim 2, characterized in that the step S24 comprises the following steps:
S241，H＝{H 1 ,H 2 ,H 3 ,…,H h h denotes a set of graphic coordinates, H 1 Representing the 1 st coordinate, H, extracted from the received spatial pattern 2 Representing the 2 nd coordinate, H, extracted from the received spatial pattern 3 Representing the 3 rd coordinate, H, extracted from the received spatial pattern h Representing the h coordinate extracted from the received space graph, wherein h represents the total number of coordinates in the received space graph; [ H ] 1 ∪H 2 ∪H 3 ∪…∪H h ]For the spatial pattern received by the retrieval platform, U represents a union of the set logics; let the self-increment value h' =1;
s242, judging the H' th coordinate H h′ Whether pattern set G = { G = { (G) } 1 ,G 2 ,G 3 ,…G g In (v), G 1 Representing the 1 st plot pattern, G 2 Representing the 2 nd plot, G 3 Representing the 3 rd plot pattern, G g Representing the g plot graph, wherein g represents the total number of plots; g 1 ∪G 2 ∪G 3 ∪…∪G g For the whole plot pattern, the U represents the union of the set logics;
g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；
if the H' th coordinate is H h′ In graphic set G = { G = { (G) 1 ,G 2 ,G 3 ,…G g In the H ', the H' th coordinate is represented by H h′ The corresponding plot pattern is used as a plot pattern to be verified, h '= h' +1; executing the next step;
if the H' th coordinate H h′ Out of the graphic set G = { G = { (G) 1 ,G 2 ,G 3 ,…G g In the previous step, a graph contained in the received space graph is not retrieved;
s243, judging the size relation between h' and h:
if h 'is less than or equal to h, h' represents the self-increment value, and h represents the total number of coordinates in the received space graph, executing the next step;
if h '> h, h' represents self-increment, and h represents the total number of coordinates in the received space graph, executing S245;
s244, judging the H' th coordinate H h′ Whether in the plot to be verified:
if the H' th coordinate is H h′ In the plot to be verified, h '= h' +1; returning to step S243;
if the H' th coordinate is H h′ If the map is not in the plot to be verified, the received space plot does not contain the searched graph;
and S245, the plot to be verified is the plot contained in the received space plot.
4. The method for searching the space containing arithmetic operators based on the ElasticSearch technology as claimed in claim 2, wherein in step S245, the method for calculating the area of the plot intersecting with the plot to be verified is as follows:
wherein, plex u Representing the area of the pixel point u;
U s representing the total number of pixel points of the s plot pattern intersected with the plot pattern to be verified;
S s representing the area of the s plot intersecting the plot to be verified; s =1, 2, 3, \8230;, S' represents the total number of plot patterns intersecting the plot pattern to be verified;
the calculation method of the perimeter of the plot intersecting with the plot to be verified comprises the following steps:
wherein, plex u Representing the area of the pixel point u;
l s representing the total number of pixel points on the contour line of the s plot intersected with the plot to be verified;
L s representing the perimeter of the s-th plot intersecting the plot to be verified; s =1, 2, 3, 8230\8230, and S ', S' represents the total number of land parcel patterns intersecting with the land parcel pattern to be verified.
5. The method for searching the space containing operators based on the ElasticSearch technology according to claim 1, characterized in that the step S1 comprises the following steps:
s11, acquiring a retrieval account number, a retrieval password, an authentication code and a client ID code input by a retrieval user;
s12, fusing the retrieval password and the verification code obtained in the step S11 to obtain a two-code fusion code;
s13, mapping the two-code fusion code obtained in the step S12 into a two-code mapping code;
s14, converting the two-code mapping code obtained in the step S13 into a two-code security code and a two-code security image;
and S15, uploading the two-code security code and the two-code security image obtained in the step S14 and the retrieval account number and the client ID code obtained in the step S11 to a retrieval platform for verification.
6. The method for searching a space containing operators based on the ElasticSearch technology according to claim 5, wherein the method for converting the two-code mapping code into the two-code security code in step S14 comprises the following steps:
s141, converting the two-code mapping code in the step S13 into a two-dimensional code;
s142, converting the two-code mapping code in the step S13 into a binary numerical value;
s143, sequentially writing the binary numerical values in the step S142 into the black frames of the two-dimensional codes in the step S142 from left to right and from top to bottom;
s144, writing the numerical value 1 into a white frame of the two-dimensional code, and taking the last written black frame as an end point;
s145, sequentially taking out numerical values in the two-dimensional code from left to right and from top to bottom;
s146, converting the numerical value taken out in the step S145 into a security character with the same system as the binary code mapping code, wherein the security character is the binary code security code;
and S147, extracting the image of the two-dimensional code written with the numerical values 0 and 1, wherein the image is the two-code security image.
7. The method for searching the space containing arithmetic operators based on the ElasticSearch technology according to claim 5, wherein the method for retrieving the platform verification in step S15 comprises the following steps:
s151, after receiving a two-code security code and a two-code security image, a retrieval account and a client ID code sent by a client, a retrieval platform respectively obtains a two-code security platform code and a two-code security platform image, and a retrieval platform account and a client ID platform code;
s152, converting the two-code security platform code obtained in the step S151 into a binary platform numerical value;
s153, sequentially writing the binary platform numerical values into the frame of the two-code safety platform image in the step S151 from left to right and from top to bottom;
s154, sequentially taking out numerical values from the black frame of the two-code security platform image from left to right and from top to bottom;
s155, converting the numerical value extracted in the step S154 into a binary code mapping platform code with the same system as the binary code mapping code; then the two-code mapping platform code is inversely mapped into a two-code platform code;
s156, searching and obtaining the verification code sent by the retrieval platform according to the client ID platform code obtained in the step S151;
s157, according to the verification code obtained in the step S156 and the two-code platform code obtained in the step S155, obtaining an analysis password and an analysis verification code;
s158, determining whether the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156:
if the analysis verification code obtained in step S157 is consistent with the verification code obtained in step S156, performing the next step;
if the analysis verification code obtained in step S157 is not consistent with the verification code obtained in step S156, re-inputting the verification code, or re-inputting the search account number, the search password, and the verification code, and returning to step S11;
s159, searching for the retrieval platform password corresponding to the retrieval platform account according to the retrieval platform account obtained in step S151, and determining whether the retrieval platform password matches the analysis password obtained in step S157:
if the search platform password is consistent with the analysis password obtained in the step S157, the search user successfully logs in the search platform;
if the search platform password is not consistent with the analysis password obtained in step S157, the search password and the verification code are input again, or the search account number, the search password and the verification code are input again, and the process returns to step S11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211058993.9A CN115391475B (en) | 2022-08-31 | 2022-08-31 | Space searching method containing operator based on elastic search technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211058993.9A CN115391475B (en) | 2022-08-31 | 2022-08-31 | Space searching method containing operator based on elastic search technology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115391475A true CN115391475A (en) | 2022-11-25 |
| CN115391475B CN115391475B (en) | 2023-05-12 |
Family
ID=84124808
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211058993.9A Active CN115391475B (en) | 2022-08-31 | 2022-08-31 | Space searching method containing operator based on elastic search technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115391475B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001975A (en) * | 2012-12-26 | 2013-03-27 | 百度在线网络技术（北京）有限公司 | Method, system and device used for controlling login and based on two-dimensional code |
| CN104537098A (en) * | 2015-01-09 | 2015-04-22 | 南京朗坤自动化有限公司 | CAD blueprint search method based on GIS technology |
| CN110113329A (en) * | 2019-04-28 | 2019-08-09 | 北京信安世纪科技股份有限公司 | A kind of verification method and device of identifying code |
| CN110392054A (en) * | 2019-07-23 | 2019-10-29 | 网易（杭州）网络有限公司 | Log in method of calibration, device, system, equipment and readable storage medium storing program for executing |
| EP3690686A1 (en) * | 2019-02-01 | 2020-08-05 | Idemia Identity & Security France | Authentication procedure, server and electronic identity device |
| CN113515738A (en) * | 2021-06-29 | 2021-10-19 | 新华三大数据技术有限公司 | Security authentication method and device based on two-dimensional code and storage medium |
| CN113630241A (en) * | 2020-05-09 | 2021-11-09 | 杭州海康威视数字技术股份有限公司 | Password recovery method and system, cloud server and electronic equipment |
| CN113987024A (en) * | 2021-11-02 | 2022-01-28 | 中科星图智慧科技有限公司 | Non-inductive intelligent retrieval method based on remote sensing space big data |
| CN114006743A (en) * | 2021-10-27 | 2022-02-01 | 重庆市规划和自然资源信息中心 | Method for extracting and querying land use state in real time based on big data |
-
2022
- 2022-08-31 CN CN202211058993.9A patent/CN115391475B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001975A (en) * | 2012-12-26 | 2013-03-27 | 百度在线网络技术（北京）有限公司 | Method, system and device used for controlling login and based on two-dimensional code |
| CN104537098A (en) * | 2015-01-09 | 2015-04-22 | 南京朗坤自动化有限公司 | CAD blueprint search method based on GIS technology |
| EP3690686A1 (en) * | 2019-02-01 | 2020-08-05 | Idemia Identity & Security France | Authentication procedure, server and electronic identity device |
| US20200252395A1 (en) * | 2019-02-01 | 2020-08-06 | Idemia Identity & Security France | Method of authentication, server and electronic identity device |
| CN110113329A (en) * | 2019-04-28 | 2019-08-09 | 北京信安世纪科技股份有限公司 | A kind of verification method and device of identifying code |
| CN110392054A (en) * | 2019-07-23 | 2019-10-29 | 网易（杭州）网络有限公司 | Log in method of calibration, device, system, equipment and readable storage medium storing program for executing |
| CN113630241A (en) * | 2020-05-09 | 2021-11-09 | 杭州海康威视数字技术股份有限公司 | Password recovery method and system, cloud server and electronic equipment |
| CN113515738A (en) * | 2021-06-29 | 2021-10-19 | 新华三大数据技术有限公司 | Security authentication method and device based on two-dimensional code and storage medium |
| CN114006743A (en) * | 2021-10-27 | 2022-02-01 | 重庆市规划和自然资源信息中心 | Method for extracting and querying land use state in real time based on big data |
| CN113987024A (en) * | 2021-11-02 | 2022-01-28 | 中科星图智慧科技有限公司 | Non-inductive intelligent retrieval method based on remote sensing space big data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115391475B (en) | 2023-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102368237B (en) | Image retrieval method, device and system | |
| US6904430B1 (en) | Method and system for efficiently identifying differences between large files | |
| CN111626124B (en) | OCR image sample generation and printing experience verification method, device, equipment and medium | |
| KR102388698B1 (en) | Method for enrolling data in a base to protect said data | |
| CN104462990B (en) | Character string encipher-decipher method and device | |
| CN115801262B (en) | Intersection operator space retrieval method based on elastic search technology | |
| CN112232171B (en) | Remote sensing image information extraction method and device based on random forest and storage medium | |
| CN107634765A (en) | A kind of Internet of Things coding method and system | |
| Rahman et al. | A novel steganography technique for digital images using the least significant bit substitution method | |
| Alkhafaji et al. | Payload capacity scheme for quran text watermarking based on vowels with kashida | |
| CN110135413A (en) | Method for generating character recognition image, electronic equipment and readable storage medium | |
| CN110677552B (en) | Carrier-free information hiding method based on complete packet bases | |
| CN118094587A (en) | Encryption storage method and system for images | |
| CN111178615B (en) | Method and system for constructing enterprise risk identification model | |
| CN115391475A (en) | Method for searching space containing arithmetic operator based on ElasticSearch technology | |
| CN115329319B (en) | Space operator searching system based on elastic search technology | |
| CN111881444A (en) | Identity verification system based on encrypted tag algorithm and working method thereof | |
| CN111431876A (en) | Method and device for accessing database, computer equipment and storage medium | |
| CN115481387B (en) | Spatial data retrieval method based on elastic search technology | |
| CN117217973B (en) | Three-dimensional point cloud data watermarking method using mahalanobis distance and ISS feature points | |
| CN114140307B (en) | Vector map lossless watermarking method and system based on stored sequence modulation | |
| CN110728345A (en) | Identification code resisting background character interference and generation method thereof | |
| CN117278343B (en) | Data multi-level output processing method based on big data platform data | |
| CN113505137B (en) | Real estate space graph updating method | |
| US11816756B1 (en) | Anti-leak digital document marking system and method using distributed ledger |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |