A two-dimensional code check-in system, method and device

Abstract

The specification relates to the technical field of computers, in particular to a two-dimensional code check-in system, method and device and a two-dimensional code generation method. The system comprises a server, a check-in client and an attending client. The server is used to extract at least one character in a first token string corresponding to each conference scene, divide the first token string into multiple sub-strings; after determining that the check-in client and the attending client correspond to the same conference scene, analyze a first sub-string in a check-in client two-dimensional code and a second sub-string in an attending client two-dimensional code; according to a conference scene number, restore the first sub-string and the second sub-string to generate a second token string; judge whether the first token string and the second token string are consistent; the check-in client is used to generate a check-in two-dimensional code; and the attending client is used to generate an attending two-dimensional code according to a current time and a conference scene number of the attending client. The scheme enhances the security of the generated two-dimensional code and avoids false check-in by photographing and scanning the code.

Description

Technical Field

[0001] This specification relates to the field of computer technology, and in particular to a QR code check-in system, method, apparatus, and QR code generation method. Background Technology

[0002] With the rapid development of mobile internet, mobile devices are becoming increasingly popular.

[0003] In traditional in-person meetings, organizers require all attendees to sign in. Typically, the organizer provides a printed or electronic QR code image of the meeting at the venue, which attendees scan using their mobile devices to sign in.

[0004] However, this check-in method has the following drawbacks: The person is not physically present; they remotely obtain the meeting's QR code image through others, save the image, and then use a mobile smart device to scan the code for check-in. This creates a risk of fraudulent attendance, poses meeting management risks, and is detrimental to production operations. Summary of the Invention

[0005] To address the problems of the prior art, embodiments of this specification provide a QR code check-in system, method, apparatus, and QR code generation method.

[0006] This specification discloses a QR code check-in system, which includes a server, a check-in client, and a meeting participant client. The server is used to extract at least one character from a first token string corresponding to each meeting scenario, and divide the first token string into multiple substrings. When it is determined that the QR codes generated by the check-in client and the meeting participant client correspond to the same meeting scenario, the server parses the first substring from the check-in client's QR code and the second substring from the meeting participant client's QR code. Based on the meeting scenario number of the same meeting scenario, the server reconstructs the first and second substrings to generate a second token string. The server then determines whether the first token string and the second token string are consistent; if they are consistent, the check-in of the meeting participant client is deemed valid. The check-in client is used to generate a check-in QR code based on the current time and the meeting scenario number of the check-in client. The meeting participant client is used to generate a meeting participant QR code based on the current time and the meeting scenario number of the meeting participant client.

[0007] According to one aspect of the embodiments of this specification, after the participating client generates a QR code, the check-in client is further configured to: scan and parse the QR code generated by the participating client to obtain the meeting scene number of the scanning client, and determine whether the meeting scene number of the check-in client is the same as the meeting scene number of the scanning client.

[0008] According to one aspect of an embodiment of this specification, the check-in client is further configured to: determine the meeting scenario number of the check-in client based on the meeting scenario to which the check-in client belongs; obtain a first substring and the valid time of the first substring from the mapping relationship between meeting scenario numbers and substrings in the location mapping set of the server based on the meeting scenario number and the current time; and generate a check-in client QR code based on the current time, the valid time of the first substring, the first substring, and the meeting scenario number.

[0009] According to one aspect of an embodiment of this specification, the participating client is further configured to: determine the meeting scenario number of the participating client based on the meeting scenario to which the participating client belongs; obtain a second substring and the valid time of the second substring from the mapping relationship between meeting scenario numbers and substrings in the location mapping set of the server based on the meeting scenario number and the current time; and generate a QR code for the participating client based on the current time, the valid time of the second substring, the second substring, and the meeting scenario number of the participating client.

[0010] This specification discloses a QR code check-in method, which includes: extracting at least one character from a first token string corresponding to each meeting scenario; dividing the first token string into multiple substrings, wherein the first token string is generated periodically according to a timestamp and meeting scenario number; when it is determined that the QR codes generated by the check-in client and the participating client correspond to the same meeting scenario, parsing to obtain the first substring in the check-in client's QR code and the second substring in the participating client's QR code; reconstructing the first substring and the second substring to generate a second token string according to the meeting scenario number of the same meeting scenario; determining whether the first token string and the second token string are consistent; if they are consistent, determining that the check-in of the participating client is valid.

[0011] According to one aspect of the embodiments of this specification, the step of restoring the first substring and the second substring to generate the second token string based on the meeting scenario number of the same meeting scenario includes: recording the position of each character in a plurality of substrings corresponding to each update cycle and each meeting scenario in the first token string, wherein the update cycle, the meeting scenario number and the position form a position mapping set; and restoring the first substring and the second substring to generate the second token string based on the meeting scenario number and the position mapping set.

[0012] According to one aspect of the embodiments of this specification, the step of restoring the first substring and the second substring to generate the second token string based on the meeting scene number of the same meeting scene and the location mapping set includes: determining the positions of the first substring and the second substring in the first token string from the location mapping set according to the meeting scene number and the update cycle of the current time; and rearranging the characters in the first substring and the second substring according to the positions to generate the second token string.

[0013] According to one aspect of the embodiments of this specification, extracting at least one character from a first token string corresponding to each meeting scenario and dividing the first token string into multiple substrings includes: randomly extracting multiple characters from the first token string in a forward-backward order to obtain a first token substring; and sequentially moving the remaining characters in the first token string forward to form a second token substring.

[0014] This specification discloses a QR code generation method applied to a check-in client located in a meeting scenario. The method includes: determining the meeting scenario number of the check-in client based on the meeting scenario to which the check-in client belongs; obtaining a first substring and its validity time from the mapping relationship between meeting scenario numbers and substrings in the location mapping set of the server based on the meeting scenario number and the current time; and generating a QR code for the check-in client based on the current time, the validity time of the first substring, the first substring, and the meeting scenario number.

[0015] According to one aspect of the embodiments of this specification, generating a client QR code based on the current time, the validity period of a first substring, the first substring, and the meeting scenario number includes: calculating the remaining validity period of the first substring based on the current time and the validity period of the first substring; if the remaining validity period does not reach a preset time threshold, generating a check-in QR code based on the first substring and the meeting scenario number of the check-in client; if the remaining validity period reaches the preset time threshold, retrieving the first substring of the next update cycle from the server and generating a check-in QR code.

[0016] This specification also discloses a QR code generation method. The method is applied to a participating client located in a meeting scenario. The method includes: determining the meeting scenario number of the participating client based on the meeting scenario to which the participating client belongs; obtaining a second substring and its validity time from the mapping relationship between meeting scenario numbers and substrings in the location mapping set of the server based on the meeting scenario number and the current time; and generating a QR code for the participating client based on the current time, the validity time of the second substring, the second substring, and the meeting scenario number of the participating client.

[0017] According to one aspect of the embodiments of this specification, generating a QR code for the participating client based on the current time, the validity period of the second substring, the second substring, and the meeting scenario number of the participating client includes: calculating the remaining validity period of the second substring based on the current time and the validity period of the second substring; if the remaining validity period does not reach a preset time threshold, generating a participation QR code based on the second substring and the meeting scenario number of the participating client; if the remaining validity period reaches the preset time threshold, retrieving the second substring for the next update cycle from the server and generating a check-in QR code.

[0018] This specification also discloses a QR code check-in device, comprising: a substring determination unit, configured to extract at least one character from a first token string corresponding to each meeting scenario, and divide the first token string into multiple substrings, wherein the token strings are generated periodically according to a timestamp and meeting scenario number; an acquisition unit, configured to parse the first substring from the check-in client's QR code and the second substring from the meeting client's QR code after determining that the QR codes generated by the check-in client and the meeting client correspond to the same meeting scenario; a generation unit, configured to reconstruct the first substring and the second substring to generate a second token string based on the meeting scenario number of the same meeting scenario; and a judgment unit, configured to judge whether the first token string and the second token string are consistent; if they are consistent, the check-in of the meeting client is determined to be valid.

[0019] This specification also provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the QR code check-in method and the verification method.

[0020] This specification also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the QR code check-in method and the verification method.

[0021] This manual enhances the security of the generated QR code, preventing fake check-ins through photo scanning. The check-in process requires no manual intervention. Attached Figure Description

[0022] To more clearly illustrate the technical solutions in the embodiments or prior art of this specification, the drawings used in the description of the embodiments or prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this specification. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0023] Figure 1The diagram shown is a schematic diagram of a QR code check-in system according to an embodiment of this specification;

[0024] Figure 2 The diagram shown is a flowchart of a QR code check-in method according to an embodiment of this specification;

[0025] Figure 3 The diagram shown is a flowchart of a method for restoring and generating a second token string according to an embodiment of this specification.

[0026] Figure 4 The diagram shown is a flowchart of another method for generating a second token string according to an embodiment of this specification.

[0027] Figure 5 The diagram shown is a flowchart of a method for dividing a first token string into substrings according to an embodiment of this specification.

[0028] Figure 6 The diagram shown is a flowchart of a method for generating a check-in client QR code according to an embodiment of this specification.

[0029] Figure 7 The diagram shown is a flowchart of another method for generating a check-in QR code according to an embodiment of this specification.

[0030] Figure 8 The diagram shown is a flowchart of a method for generating a QR code for a conference participant according to an embodiment of this specification.

[0031] Figure 9 The above is a flowchart of a method for generating a meeting participation QR code according to an embodiment of this specification;

[0032] Figure 10 The diagram shown is a structural schematic of a QR code check-in device according to an embodiment of this specification.

[0033] Figure 11 The diagram shown is a schematic representation of the specific structure of the QR code check-in device in this embodiment.

[0034] Figure 12 The diagram shown is a structural schematic of a computer device according to an embodiment of this specification.

[0035] Explanation of symbols in the attached drawings:

[0036] 101. Server-side;

[0037] 102. Check-in client;

[0038] 103. Participating client software;

[0039] 1001. Substring determination unit;

[0040] 1002, Analysis Unit;

[0041] 1003, Generation Unit;

[0042] 10031. Location Mapping Set Determination Module;

[0043] 10032, QR code generation module;

[0044] 1004. Judgment Unit;

[0045] 1202. Computer equipment;

[0046] 1204, Processor;

[0047] 1206. Memory;

[0048] 1208. Drive mechanism;

[0049] 1210. Input / output module;

[0050] 1212. Input devices;

[0051] 1214. Output devices;

[0052] 1216. Presentation equipment;

[0053] 1218. Graphical User Interface;

[0054] 1220. Network interface;

[0055] 1222. Communication link;

[0056] 1224. Communication bus. Detailed Implementation

[0057] To enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this specification will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this specification, and not all embodiments. Based on the embodiments in this specification, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this specification.

[0058] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, apparatus, product, or device that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or devices.

[0059] This specification provides the operational steps of the methods described in the embodiments or flowcharts, but based on conventional or non-inventive labor, more or fewer operational steps may be included. The order of steps listed in the embodiments is merely one possible execution order among many and does not represent the only possible execution order. In actual system or device products, the methods shown in the embodiments or drawings can be executed sequentially or in parallel.

[0060] It should be noted that the methods described in this specification can be used in the fields of computer technology and fintech. This specification does not limit the application areas of the QR code check-in system, methods, and QR code generation methods. The acquisition, storage, use, and processing of data in the technical solutions described in this specification all comply with relevant national laws and regulations.

[0061] Figure 1 The diagram illustrates a QR code check-in system as shown in some embodiments of this specification. The QR code check-in system includes: a server 101, a check-in client 102, and a participant client 103. The QR code check-in system described in this specification is applicable to both online and offline meetings; however, this specification does not limit the application scenarios of the QR code check-in system.

[0062] The server 101 is used to extract at least one character from the first token string corresponding to each meeting scenario, and divide the first token string into multiple substrings. In some embodiments of this specification, the server is used to generate a mixed token string composed of numbers, letters, characters, etc., based on the timestamp and the unique meeting scenario number when starting meeting check-in. This token string is referred to as the first token string.

[0063] Once it is determined that the QR codes generated by the check-in client and the participating client correspond to the same meeting scenario, the first substring in the check-in client's QR code and the second substring in the participating client's QR code are parsed. Based on the meeting scenario number of the same meeting scenario, the first substring and the second substring are restored to generate a second token string. It is then determined whether the first token string and the second token string are consistent. If they are consistent, the check-in of the participating client is determined to be valid.

[0064] The check-in client 102 generates a check-in QR code based on the current time and the meeting scenario number of the client. Specifically, after requesting a first token substring from the server based on the current time, check-in client 102 combines this with the meeting scenario number to which the client belongs to generate a JSON string value, and then generates a check-in QR code based on this string value. The check-in client generates different QR codes at different times. By requesting different first token substrings from the server based on the different first token strings updated at different times, and thus generating different QR codes at different times, the system avoids offline attendees taking a picture of the QR code generated by the check-in client at a certain moment and then providing it to other attendees not present at the venue for virtual check-in at later times, thereby improving check-in security.

[0065] Participating client 103 generates a participation QR code based on the current time and the meeting scenario number of the participating client. Specifically, check-in client 102 generates a JSON string value based on the current time, a second token substring requested from the server, and the meeting scenario number to which the check-in client belongs, and then generates a check-in QR code based on the string value. Different QR codes are generated for different times. Specifically, participating client 103 generates a JSON string value based on the current time, a second token substring requested from the server, and the meeting scenario number to which the check-in client belongs, and then generates a check-in QR code based on the string value.

[0066] In some embodiments of this specification, after the participating client generates a QR code, the check-in client is further configured to: scan and parse the QR code generated by the participating client to obtain the meeting scene number of the scanning client, and determine whether the meeting scene number of the check-in client is the same as the meeting scene number of the scanning client. That is, it determines whether the participating client and the check-in client belong to the same meeting, to prevent participants attending other meetings from mistakenly entering or going to this meeting. This specification enhances the security of QR code generation, prevents false check-in through photo scanning, and the check-in process requires no manual intervention.

[0067] Figure 2 The diagram shown is a flowchart of a QR code check-in method according to an embodiment of this specification. This QR code check-in method is applied to the server side and includes:

[0068] Step 201: Extract at least one character from the first token string corresponding to each meeting scenario, and divide the first token string into multiple substrings. The first token string is generated periodically according to the timestamp and meeting scenario number. The meeting scenario in this step can be an offline meeting or an online meeting; this specification does not limit the format of the meeting.

[0069] In this step, the server randomly generates a first token string based on the timestamp and meeting scenario number. In this embodiment, the first token string can be a 16-character string of other lengths, including but not limited to combinations of letters, characters, and numbers. Furthermore, the server generates the first token string according to a certain valid time period; that is, the first token string is valid for a certain period of time, and will expire if this time period is exceeded. For example, the valid time period could be once per minute, 10 times per minute, 20 times per minute, or 30 times per minute. Taking 10 times per minute as an example, after the first token string is generated, the server will randomly generate a new first token string every 6 seconds.

[0070] This specification's embodiments generate a first token string based on a timestamp and a meeting scenario number. In this specification's embodiments, different meetings have unique and independent meeting scenario numbers. Specifically, a first token string can be generated at different times based on the same meeting scenario number. Therefore, if there are multiple meetings, each with a corresponding meeting scenario number, multiple first token strings corresponding to different meetings can be generated at different times. For example, if the server manages 10 meetings, each with a different meeting scenario number, and if the server updates the first token string 20 times per minute, then within one minute, 10 first token strings corresponding to these 10 meetings are generated every 3 seconds, resulting in a total of 200 first token strings corresponding to these 10 meetings generated within one minute.

[0071] Step 202: After determining that the QR codes generated by the check-in client and the meeting client correspond to the same meeting scenario, the first substring in the check-in client's QR code and the second substring in the meeting client's QR code are parsed. In the embodiments of this specification, the check-in client and the meeting client generate QR codes according to their respective meeting scenario numbers.

[0072] The server will analyze the QR codes of the check-in client and the meeting client, parsing them to obtain the meeting scenario number from both the check-in client's QR code and the meeting scenario number from the meeting client's QR code, and then determine whether the two meeting scenario numbers are the same. If the meeting scenario number in the check-in client's QR code is the same as the meeting scenario number in the meeting client's QR code, then it is determined that the meeting to which the check-in client belongs and the meeting to which the meeting client belongs are the same meeting.

[0073] Step 203: Based on the meeting scenario number of the same meeting scenario, reconstruct the first substring and the second substring to generate the second token string. If the check-in client and the participating client are determined to belong to the same meeting based on the previous steps, then reconstruct the first substring in the check-in client's QR code and the second substring in the participating client's QR code into token strings.

[0074] Step 204: Determine whether the first token string and the second token string are consistent. In this step, it is determined whether the second token string generated in step 203 is completely consistent with the first token string.

[0075] Step 205: If the records match, the participant's check-in is confirmed as valid. If the records do not match, the participant's check-in is confirmed as invalid, which poses a risk.

[0076] Figure 3 The diagram shown is a flowchart of a method for restoring and generating a second token string according to an embodiment of this specification, which specifically includes the following steps:

[0077] Step 301: Record the position of each character in the multiple substrings corresponding to each update cycle and each meeting scenario in the first token string. The update cycle, meeting scenario number and the position form a position mapping set.

[0078] In some embodiments of this specification, to prevent substrings from being cracked and to improve the security of meeting attendance, the server will randomly extract substrings from the first token string. This requires recording the position of each character in the substring within the original first token string. A position mapping set is formed by combining the update period / current timestamp, meeting scenario number, and position, and stored. For example, at 10:00 AM on July 13th, in the first token string corresponding to Meeting 1, which is 1234567890qwerty, a first token substring and a second token substring are randomly generated: 260werty and 1345789q, respectively. Furthermore, the position of each character in the first token string within the first token string is recorded in the server's database. For example, if the first substring is 260werty, then the position of each character in the first token substring within the original first token string recorded in the server's database is the 1st, 3rd, 4th, 5th, 7th, 8th, 9th, or 11th character. Correspondingly, the position of each substring in the second token substring within the first token string can also be determined and recorded.

[0079] In the embodiments described in this specification, the first token string is updated according to a certain update cycle. Therefore, the positions of the first token substring and the second token substring in the server database within the first token string are also updated according to the update cycle. Thus, the update cycle, the meeting scenario number, and the position of each character in the substring within the first token string form a position mapping set.

[0080] For example, with an update cycle of 2 times per minute, the server manages 3 meetings simultaneously, each with a corresponding meeting scenario number M01, M02, and M03. The position mapping set formed by the update cycle, meeting scenario number, first token substring, and second token substring is shown below:

[0081] 2023-07-15-0800-M01-(1,3,4,5,7,8,9,11);

[0082] 2023-07-15-0800-M01-(2,6,10,12,13,14,15,16);

[0083] 2023-07-15-0800-M02-(1,2,4,6,9,10,12,16);

[0084] 2023-07-15-0830-M02-(3,5,7,8,11,13,14,15);

[0085] 2023-07-15-0800-M03-(2,5,6,7,8,11,13,15);

[0086] 2023-07-15-0830-M03-(1,3,4,9,10,12,14,16).

[0087] Step 302: Based on the meeting scenario number and the location mapping set, reconstruct the first substring and the second substring to generate the second token string. Figure 2 For the same meeting scenario number determined in the location mapping set, the current time is determined, and the positions of the first substring and the second substring corresponding to the meeting scenario number in the first token string are determined, thereby restoring the first substring and the second substring into the second token string.

[0088] Figure 4 The diagram shows another method for generating a second token string according to an embodiment of this specification, which specifically includes the following steps:

[0089] Step 401: Based on the meeting scenario number and the current update cycle, determine the positions of the first substring and the second substring within the first token string from the location mapping set. For example... Figure 3 As shown in the example, if the current time is 8:00:18 AM on July 15, 2023, and the meeting scene number is M01, then the positions of the first substring and the second substring in the first token string can be determined from the position mapping set as (1,3,4,5,7,8,9,11) and (2,6,10,12,13,14,15,16).

[0090] Step 402: Based on the positions, rearrange the characters in the first substring and the second substring to generate a second token string. In this step, based on the positions obtained in step 401, arrange the characters in the first substring and the second substring in order according to their positions in the first token string to restore and generate a new token string, which can be called the second token string.

[0091] In some other embodiments of this specification, the first token string can be divided into a first token substring and a second token substring according to a fixed format. For example, the 16-bit first token string can be divided into a first substring and a second substring according to a fixed format of the first 8 characters followed by the last 8 characters. Then, the position of each character in the first substring and the second substring within the first token string is known. Therefore, when reconstructing the second token string from the first substring and the second substring, it is not necessary to separately obtain the positions of the characters in the first substring and the second substring within the first token string; the second token string can be reconstructed without performing actions such as... Figure 4 The embodiment includes the step of restoring and generating the second token string based on the location mapping set.

[0092] Figure 5 The diagram shown is a flowchart of a method for dividing a first token string into substrings according to an embodiment of this specification, which specifically includes the following steps:

[0093] Step 501: Randomly extract multiple characters from the first token string in a forward-to-back order to obtain the first token substring. In this step, multiple consecutive or non-consecutive characters are randomly selected from the first token string from front to back to form the first token substring. For example, if the first token string is 1234567890qwerty, and 1345789q is randomly selected as a substring of the first token string, then another substring of the first token substring is 260werty, which becomes the second token substring.

[0094] Step 502: Move the remaining characters in the first token string forward sequentially to form the second token substring. Then, move the remaining characters in the first token string forward sequentially after extracting the first token substring to form another substring, which is the second token substring.

[0095] Figure 6 The diagram shown is a flowchart of a method for generating a check-in client QR code according to an embodiment of this specification. This method is applied to a check-in client and specifically includes the following steps:

[0096] Step 601: Determine the meeting scene number of the check-in client based on the meeting scene to which the check-in client belongs. In this embodiment of the specification, the check-in client can be a smart mobile device held by the person in charge of check-in at the meeting, or it can be a smart terminal provided by the meeting organizer. This embodiment of the specification does not limit the form of the check-in client.

[0097] In the embodiments of this specification, in offline or online meeting scenarios, the check-in client device of the meeting venue is manually turned on, and the APP in the check-in client device can be opened to automatically generate and refresh the QR code.

[0098] In the embodiments described in this specification, the check-in client should be aware of the meeting it represents. Specifically, the check-in client records specific information about the meeting it represents, including: meeting name, meeting location, composition of the meeting organizers, meeting start time, meeting end time, meeting scenario number, etc. This information can be collectively referred to as the meeting scenario. Furthermore, the specific meeting information may also include: the units, organizations, and personnel who should attend this meeting, etc.

[0099] Step 602: Based on the meeting scene number and the current time, obtain the first substring and the valid time of the first substring from the mapping relationship between the meeting scene number and the substring in the location mapping set of the server.

[0100] In the embodiments described in this specification, the server-side location mapping set records not only the positions of characters in the substrings of the first token string within the first token string, but also the validity period of the substrings. Similar to the validity period of the first token string, the substrings split from the first token string also have validity periods; therefore, the QR code generated by the check-in client is dynamically updated. The validity period of the first substring can be obtained from the server-side location mapping set.

[0101] Step 603: Generate a check-in client QR code based on the current time, the valid time of the first substring, the first substring, and the meeting scenario number. In this step, the current time is compared with the valid time of the first substring to determine if the first substring is valid. Further, a check-in client QR code is generated based on the first substring, the meeting scenario number of the participating client, and the current time. For a detailed description of this step's client QR code generation, see [link to step 603]. Figure 7 describe.

[0102] Figure 7 The diagram shown is a flowchart of another method for generating a check-in QR code according to an embodiment of this specification, which specifically includes the following steps:

[0103] Step 701: Calculate the remaining effective time of the first substring based on the current time and the effective time of the first substring. For example, if the effective time of the first substring is 30 seconds, and the first substring is updated every 30 seconds, and the last update time of the first substring can be determined, then the time difference between the current time and the effective time of the first substring can be determined. For example, if the last update time of the first substring was 18:00:00, and the effective time of the first substring is 30 seconds, and the current time is 18:00:29, then the next update time of the first substring can be determined to be 18:00:30, and the remaining effective time of the first substring is calculated to be 1 second.

[0104] Step 702: If the remaining effective time has not reached the preset time threshold, generate a check-in QR code based on the first substring and the meeting scenario number of the check-in client. In this embodiment, the preset time threshold is used to determine whether to generate a QR code for the check-in client based on the current first substring. The preset time threshold can be set to a time length of 1 second, 2 seconds, 5 seconds, etc., and this embodiment does not limit it. In this step, if the preset time threshold is 0.5 seconds and the remaining effective time calculated in step 701 is 1 second, and the remaining effective time has not reached the preset event threshold, then a check-in QR code can be directly generated based on the current first substring and the meeting scenario number of the check-in client.

[0105] Step 703: If the remaining effective time reaches a preset time threshold, retrieve the first substring of the next update cycle from the server and generate a check-in QR code. In this step, if the preset time threshold is 1 second and the remaining effective time calculated in step 701 is 1 second, and the remaining effective time has reached the preset event threshold, then it is necessary to retrieve the first substring of the next cycle again, and generate a check-in QR code based on the first substring of the next cycle.

[0106] Figure 8 The diagram shown is a flowchart of a method for generating a QR code for a conference participant client according to an embodiment of this specification. This method is applied to the conference participant client and specifically includes the following steps:

[0107] Step 801: Determine the meeting scene number of the participating client based on the meeting scene to which the participating client belongs. In this embodiment of the specification, the participating client can be a smart mobile terminal held by the participant, and the participating client has the function of generating and scanning QR codes.

[0108] In some embodiments of this specification, participating clients are aware of the meetings they are required to attend. Specifically, participants know the specific information of the meetings they will be attending, including: meeting name, meeting location, meeting start time, meeting end time, etc. This specific meeting information can be collectively referred to as the meeting scenario, and the meeting scenario information has been pre-recorded in the participating client's database. Based on the existing meeting scenario-related data in the participating client's database, the participating client's meeting scenario number can be determined. Specifically, the participating client's current meeting scenario number can be retrieved from a pre-stored mapping relationship or mapping table between meeting scenarios and meeting scenario numbers, based on the meeting scenario / meeting name.

[0109] In other embodiments of this specification, the participating client is unaware of the specific meeting information it should attend, but the meeting organizer / check-in client has pre-defined the attendees' information and stored it in the check-in client's database. The participating client can then scan the check-in client's QR code, and the scanned result will determine whether the participating client is associated with that check-in client.

[0110] For example, the scanning client pre-stores information about attendees who should be attending the meeting, and after recording this information, converts it into a QR code. When an attendee scans the QR code generated by the check-in client, the system parses the attendee's information and determines that the attendee should attend the meeting organized by that check-in client. Therefore, the attendee can determine the meeting scenario number based on the scan result of the check-in client's QR code.

[0111] Step 802: Based on the meeting scenario number and the current time, obtain the second substring and its validity period from the mapping relationship between the meeting scenario number and the substring in the server's location mapping set. In this embodiment, the server's location mapping set records not only the positions of the characters in the substrings of the first token string within the first token string, but also the validity period of the substrings of the first token string. Similar to the validity period of the first token string, the substrings split from the first token string also have validity periods; therefore, the QR codes generated by the participating client and the check-in client are dynamically updated.

[0112] In the embodiments described in this specification, the validity period of the second substring can be set to a time range of the same length as the first token string, or it can be set to a time range of other lengths. For example, the validity period of the second substring can be set according to the time required for a participating client to scan a check-in client once. This specification does not impose any limitations on this.

[0113] Step 803: Generate a QR code for the participating client based on the current time, the validity period of the second substring, the second substring, and the meeting scenario number of the participating client. Specifically, this step determines whether the second substring is valid based on the current time and the validity period of the second substring. Then, it generates a QR code for the participating client based on the second substring, the current time, and the meeting scenario number.

[0114] Figure 9 The above is a flowchart of a method for generating a meeting participation QR code according to an embodiment of this specification, which specifically includes the following steps:

[0115] Step 901: Calculate the remaining valid time of the second substring based on the current time and the valid time of the second substring. This step 701 is similar and will not be described in detail here. The valid times of the first and second substrings can be the same or different.

[0116] Step 902: If the remaining valid time has not reached the preset time threshold, generate a participation QR code based on the second substring and the meeting scenario number of the participating client. This step is similar to step 702, and will not be described in detail here.

[0117] Step 903: If the remaining valid time reaches a preset time threshold, retrieve the second substring of the next update cycle from the server and generate a check-in QR code. This step is similar to step 702, and will not be described in detail here.

[0118] like Figure 10 The diagram shown is a structural schematic of a QR code check-in device according to an embodiment of this specification. The basic structure of the QR code check-in device is illustrated in this diagram. The functional units and modules can be implemented in software, or using general-purpose chips or specific chips. Specifically, the QR code check-in device includes:

[0119] The substring determination unit 1001 is used to extract at least one character from the first token string corresponding to each meeting scenario, and divide the first token string into multiple substrings, wherein the token string is generated periodically according to the timestamp and meeting scenario number according to the update cycle;

[0120] The parsing unit 1002 is used to parse the first substring in the QR code of the check-in client and the second substring in the QR code of the participant client after determining that the QR codes generated by the check-in client and the participant client correspond to the same meeting scenario.

[0121] The generation unit 1003 is used to restore the first substring and the second substring to generate the second token string based on the meeting scene number of the same meeting scene;

[0122] The judgment unit 1004 is used to determine whether the first token string and the second token string are consistent; if they are consistent, the sign-in of the participating client is determined to be valid.

[0123] As one embodiment of this specification, reference may also be made to, for example, Figure 11 The diagram shown is a schematic representation of the specific structure of the QR code check-in device in this embodiment.

[0124] As an embodiment of this specification, the generation unit 1003 further includes: a position mapping set determination module 10031, used to record the position of each character in multiple substrings corresponding to each update cycle and each meeting scenario in the first token string, forming a position mapping set.

[0125] As an embodiment of this specification, the generation unit 1003 further includes: a QR code generation module 10032, used to obtain a first substring and its valid time, a second substring and its valid time from the mapping relationship between the meeting scene number and the substring in the location mapping set of the server, based on the meeting scene number and the current time.

[0126] like Figure 12 The diagram illustrates a computer device provided in an embodiment of this specification. The QR code check-in method described in this specification can be applied to the computer device. The computer device 1202 may include one or more processors 1204, such as one or more central processing units (CPUs), each of which can implement one or more hardware threads. The computer device 1202 may also include any memory 1206 for storing information of any kind, such as code, settings, data, etc. Non-limitingly, for example, the memory 1206 may include any type of RAM, any type of ROM, flash memory, hard disk, optical disk, etc. More generally, any memory can use any technology to store information. Furthermore, any memory can provide volatile or non-volatile retention of information. Furthermore, any memory can represent a fixed or removable component of the computer device 1202. In one case, when the processor 1204 executes associated instructions stored in any memory or combination of memories, the computer device 1202 can perform any operation of the associated instructions. The computer device 1202 also includes one or more drive mechanisms 1208 for interacting with any memory, such as a hard disk drive mechanism, an optical disk drive mechanism, etc.

[0127] Computer device 1202 may also include an input / output module 1210 (I / O) for receiving various inputs (via input device 1212) and providing various outputs (via output device 1214). A specific output mechanism may include a presentation device 1216 and an associated graphical user interface (GUI) 1218. In other embodiments, the input / output module 1210 (I / O), input device 1212, and output device 1214 may be omitted, and the device may function solely as a computer device within a network. Computer device 1202 may also include one or more network interfaces 1220 for exchanging data with other devices via one or more communication links 1222. One or more communication buses 1224 couple the components described above together.

[0128] Communication link 1222 can be implemented in any way, such as via a local area network, a wide area network (e.g., the Internet), a point-to-point connection, or any combination thereof. Communication link 1222 may include any combination of hardwired links, wireless links, routers, gateway functions, name servers, etc., governed by any protocol or combination of protocols.

[0129] Corresponding to Figures 2 to 9 In addition to the methods described above, embodiments of this specification also provide a computer-readable storage medium storing a computer program that, when executed by a processor, performs the steps of the methods described above.

[0130] This specification also provides computer-readable instructions, wherein when a processor executes the instructions, the program therein causes the processor to perform the following... Figures 2 to 9 The method shown.

[0131] This specification also provides a computer program product, which includes a computer program that, when executed by a processor, implements... Figures 2 to 9 The method shown.

[0132] It should be understood that in the various embodiments of this specification, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this specification.

[0133] It should also be understood that, in the embodiments of this specification, the term "and / or" is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Additionally, the character " / " in this specification generally indicates that the preceding and following related objects have an "or" relationship.

[0134] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed in this specification can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of each example have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this specification.

[0135] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0136] In the several embodiments provided in this specification, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the couplings or direct couplings or communication connections shown or discussed may be indirect couplings or communication connections through some interfaces, devices, or units, or they may be electrical, mechanical, or other forms of connection.

[0137] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of the embodiments described in this specification, depending on actual needs.

[0138] Furthermore, the functional units in the various embodiments of this specification can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0139] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this specification, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this specification. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random-access memory (RAM), magnetic disks, or optical disks.

[0140] This specification uses specific embodiments to illustrate the principles and implementation methods of this specification. The descriptions of the above embodiments are only for the purpose of helping to understand the methods and core ideas of this specification. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this specification. Therefore, the content of this specification should not be construed as a limitation of this specification.

Claims

1. A QR code check-in system, characterized in that, The system includes a server, a check-in client, and a meeting participation client: The server is used to extract at least one character from the first token string corresponding to each meeting scenario and divide the first token string into multiple substrings. Once it is determined that the QR codes generated by the check-in client and the participation client correspond to the same meeting scenario, the first substring in the check-in client's QR code and the second substring in the participation client's QR code are parsed to obtain the following: Based on the meeting scenario number of the same meeting scenario, the first substring and the second substring are restored to generate the second token string; Determine whether the first token string and the second token string are the same; If they match, the sign-in of the participating client is confirmed as valid; The check-in client is used to determine the meeting scenario number of the check-in client based on the meeting scenario to which the check-in client belongs; based on the meeting scenario number of the check-in client and the current time, it obtains the first substring and the valid time of the first substring from the mapping relationship between meeting scenario number and substring in the location mapping set of the server; and generates a check-in client QR code based on the current time, the valid time of the first substring, the first substring and the meeting scenario number. The participating client is used to determine the meeting scenario number of the participating client based on the meeting scenario to which the participating client belongs; based on the meeting scenario number of the participating client and the current time, it obtains a second substring and the valid time of the second substring from the mapping relationship between meeting scenario numbers and substrings in the location mapping set of the server; and generates a participating client QR code based on the current time, the valid time of the second substring, the second substring and the meeting scenario number of the participating client. The check-in client is also used to scan and parse the QR code generated by the participating client to obtain the meeting scene number of the participating client, and to determine whether the meeting scene number of the check-in client is the same as the meeting scene number of the participating client.

2. A QR code check-in method, characterized in that, Applied to the server side, the method includes: Extract at least one character from the first token string corresponding to each meeting scenario, and divide the first token string into multiple substrings; the step of extracting at least one character from the first token string corresponding to each meeting scenario and dividing the first token string into multiple substrings includes: randomly extracting multiple characters from the first token string in a forward-backward order to obtain the first token substring; The remaining characters in the first token string are sequentially shifted forward to form the second token substring; wherein, the first token string is generated periodically according to the timestamp and meeting scenario number; Once it is determined that the QR codes generated by the check-in client and the participation client correspond to the same meeting scenario, the first substring in the check-in client's QR code and the second substring in the participation client's QR code are parsed to obtain the following: Based on the meeting scenario number of the same meeting scenario, the first substring and the second substring are restored to generate a second token string; the process of restoring the first substring and the second substring to generate a second token string based on the meeting scenario number of the same meeting scenario includes: recording the position of each character in multiple substrings corresponding to each update cycle and each meeting scenario in the first token string, wherein each update cycle, the meeting scenario number, and the position form a position mapping set; determining the positions of the first substring and the second substring in the first token string from the position mapping set based on the meeting scenario number of the same meeting scenario and the update cycle of the current time; and rearranging the characters in the first substring and the second substring according to their positions in the first token string to generate a second token string; Determine whether the first token string and the second token string are the same; If they match, the attendance of the participating client is confirmed to be valid.

3. A QR code check-in device, characterized in that, The device includes: The substring determination unit is used to extract at least one character from the first token string corresponding to each meeting scenario and divide the first token string into multiple substrings. The step of extracting at least one character from the first token string corresponding to each meeting scenario and dividing the first token string into multiple substrings includes: randomly extracting multiple characters from the first token string in a forward-backward order to obtain a first token substring; and sequentially moving the remaining characters in the first token string forward to form a second token substring, wherein the first token string is generated periodically according to the timestamp and the meeting scenario number according to the update cycle. The parsing unit is used to parse the first substring in the QR code of the check-in client and the second substring in the QR code of the participant client after determining that the QR codes generated by the check-in client and the participant client correspond to the same meeting scenario. A generation unit is configured to reconstruct a second token string from a first substring and a second substring based on the meeting scenario number of the same meeting scenario. This reconstruction includes: recording the position of each character in multiple substrings corresponding to each update cycle and each meeting scenario within the first token string; the update cycle, meeting scenario number, and the position forming a position mapping set; determining the positions of the first substring and the second substring within the first token string from the position mapping set based on the meeting scenario number of the same meeting scenario and the current update cycle; and rearranging the characters in the first substring and the second substring based on their positions within the first token string to generate the second token string. The judgment unit is used to determine whether the first token string and the second token string are consistent; if they are consistent, the sign-in of the participating client is determined to be valid.

4. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, The processor implements the method of claim 2 when executing the computer program.

5. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the method of claim 2.

6. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the method of claim 2.

Images