CN112183697B - Garbage classification two-dimensional code batch generation method - Google Patents

Abstract

The invention discloses a garbage classification two-dimensional code batch generation method, which comprises the following steps: extracting an identity code and a hidden code from certain garbage bag identity information, and respectively carrying out conversion and combination operation to obtain a combined binary matrix B and high and low combined binary sequences B1 and B2; generating chaotic signal sequences by relying on the identity codes and the hidden codes and utilizing chaotic mapping, and respectively scrambling, grouping and diffusing the high-order binary sequences B1 and the low-order binary sequences B2 to finish the uniform encryption of the identity hidden codes of a certain batch of garbage bags; the chaos signal sequence is generated by relying on the batch identity codes of the single garbage bags and utilizing chaos mapping, and the identity hidden code unified encryption result is respectively scrambled according to different rules according to garbage categories, so that garbage classification two-dimensional codes are generated in batches. The garbage classification two-dimensional code batch generation method is simple and feasible, has strong safety, and generates garbage classification codes with uniqueness, safety and garbage classification guiding performance.

Description

Garbage classification two-dimensional code batch generation method

Technical Field

The invention relates to the technical field of garbage classification, in particular to a garbage classification two-dimensional code batch generation method.

Background

With the rapid development of science and technology and economic society and the further promotion of urbanization process, the annual output of domestic garbage in cities in China is over hundred million tons at present, and a plurality of cities face a severe situation of 'refuse surrounding cities'. The 'garbage enclosing city' has become a stumbling stone for the development of cities in China. The problem of breaking the 'garbage enclosing city' is that firstly, the generation of urban domestic garbage is reduced from the source, and secondly, the resource treatment of the garbage is also an indispensable key link, so that the classification of the garbage is pushed to the forefront. As early as 1992, the 'garbage bagging classification' is proposed for the first time in Yichang city in China, and a special legislation is proposed for the first time to manage the classification of municipal domestic garbage. Subsequently, garbage classification is gradually developed nationwide, and since the garbage classification in the nineties of the last century is carried out, the theoretical research of urban garbage classification in China has achieved obvious effect, because urban residents lack garbage classification knowledge, the environmental protection consciousness is insufficient, and the activity participation enthusiasm is not high at present. In addition, various problems such as too crude infrastructure of the garbage recycling station, too extensive garbage recycling and transportation process, negative or even unwilling participation caused by worries of residents about personal private information exposure of garbage bags and the like gradually appear, and obviously, implementation of urban garbage classification in China faces many difficulties and challenges. In view of the above problems, it is urgent to develop a safe and reliable method for generating garbage classification codes, so as to ensure generation of garbage classification codes with "uniqueness", safety and garbage classification guidance "from the source, and promote effective development of garbage classification work.

Disclosure of Invention

The purpose of the invention is as follows: the invention aims to solve the defects in the prior art and provides a garbage classification two-dimensional code batch generation method, which comprises the steps of extracting an identity identification code and an identity hidden code from uniform identity codes of a certain batch of garbage bags, relying on the identity identification code and the hidden code and utilizing chaotic mapping to generate a chaotic signal sequence, scrambling, grouping and diffusing high-order and low-order binary sequences formed by converting and combining the identity hidden codes respectively to complete uniform encryption of the identity hidden codes of the certain batch of garbage bags, relying on the batch identity codes of a single garbage bag and utilizing chaotic mapping to generate the chaotic signal sequence, scrambling the uniform encryption result of the identity hidden codes according to garbage categories and different rules respectively, and further generating the garbage classification two-dimensional codes in batches. The garbage classification two-dimensional code batch generation method is simple and feasible, has strong safety, and generates garbage classification codes with uniqueness, safety and garbage classification guiding performance.

The technical scheme is as follows: a garbage classification two-dimensional code batch generation method is characterized by comprising the following steps:

(1) coding and transcoding

Firstly, identity information of a certain batch of garbage bags is coded, and the identity information comprises a uniform identity code of the certain batch of garbage bags and a batch identity code of a single garbage bag, so that a unique Chinese and English character type garbage bag identity code of the certain batch of single garbage bags is generated, and is expressed as M₁M₂...M_kM_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+pM_k+L+p+1M_k+L+p+2...M_k+L+p+nM_k+L+p+n+1M_{k+L+p+n+ 2}M_k+L+p+n+3M_k+L+p+n+4Wherein M is₁M₂...M_kIs a city region, M_k+1M_k+2...M_k+LTo a specific residential address, M_k+L+1M_{k+L+ 2}...M_k+L+pFor contacts and contact phones, M_k+L+p+1M_k+L+p+2...M_k+L+p+nFor coding time (in the form of year-month-day, wherein the last two bits M_k+L+p+n-1M_k+L+p+nAs date), M_k+L+p+n+1M_k+L+p+n+2Classifying color information for garbage (characterizing garbage classes), M_k+L+p+n+3M_k+L+p+n+4The garbage classification serial number information (serial number representing a certain class of garbage bags on a certain day) is mutually spaced by English blank spaces, and the unified identity code of a corresponding garbage bag batch is M₁M₂...M_kM_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+pM_{k+L+p+ 1}M_k+L+p+2...M_k+L+p+n-3M_k+L+p+n-2The batch identity code of the corresponding single garbage bag is M_k+L+p+n-1M_k+L+p+nM_{k+L+p+n+ 1}M_k+L+p+n+2M_k+L+p+n+3M_k+L+p+n+4，

Then, extracting the identification code (M) from the uniform identification code of a certain batch of garbage bags₁M₂...M_kM_{k+L+p+ 1}M_k+L+p+2...M_k+L+p+n-2) And identity hiding code (M)_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+p) And make the body feel beautifulThe identification code is converted into numerical data one by one to obtain corresponding numerical sequence

Simultaneously converting the identity hiding code into numerical data P one by one_i1,P_i2]Obtaining a high-order numerical value sequence P1 ═ { P1 ═ P1₁,P1₂,…,P1_L+p,P1_L+p+1}＝{P₁₁,P₂₁,…,P_(L+p)1,P_(L+p+1)1H and a low order bit value sequence P2 ═ { P2 }₁,P2₂,…,P2_L+p,P2_L+p+1}＝{P₁₂,P₂₂,…,P_(L+p)2,P_(L+p+1)2}，

Finally, sequentially combining the elements S in the numerical sequence S_iOne by one conversion into a binary sequence of 8bits BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8The element P1 in the numerical sequence P1_iOne by one into a binary sequence of 8bits BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8The element P2 in the numerical sequence P2_iOne by one into a binary sequence of 8bits BP2_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8}，

And will be

A binary sequence BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8Are combined, wherein

Resulting in a combined binary matrix B,

simultaneously combining L + p +1 binary sequences { BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8Combine, where i is 1, 2.., L + p +1, resulting in a high-order combined binary sequence B1 { B1 ═ B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8}＝{BP1_{1 1},BP1_{1 2},BP1₁₃,BP1₁₄,BP1₁₅,BP1₁₆,BP1₁₇,BP1₁₈,BP1₂₁,BP1₂₂,...,BP1₂₇,BP1₂₈,...,BP1_i1,BP1_i2,...,BP1_i7,BP1_i8,...,BP1_L+p+11,BP1_L+p+12,BP1_L+p+13,BP1_L+p+14,BP1_L+p+15,BP1_{L+p+1 6},BP1_{L+p+1 7},BP1_L+p+18And the L + p +1 binary sequences { BP 2}_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8Combine, where i is 1, 2.., L + p +1, resulting in a low-bit combined binary sequence B2 { B2 ═ B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8}＝{BP2₁₁,BP2₁₂,BP2₁₃,BP2₁₄,BP2₁₅,BP2₁₆,BP2₁₇,BP2₁₈,BP2₂₁,BP2₂₂,...,BP2₂₇,BP2₂₈,...,BP2_i1,BP2_i2,...,BP2_i7,BP2_i8,...,BP2_L+p+11,BP2_L+p+12,BP2_L+p+13,BP2_L+p+14,BP2_{L+p+1 5},BP2_{L+p+1 6},BP2_L+p+17,BP2_L+p+18}，

The garbage bag identity code comprises double-byte coded Chinese characters in a GB2312 character set and ASCLL code value E [32,126 ]]The length of the identity code of the garbage bag is k + L + p + n +6, and the length of the numerical sequence S is

The length of the numerical sequences P1, P2 is L + P +1, the binary moments are combinedThe size of matrix B is

The length of the combined binary sequences B1 and B2 is 8L +8p + 8;

(2) identity hidden code unified encryption of certain batch of garbage bags

The identity hiding codes of a certain batch of garbage bags are uniformly encrypted to show that the identity identification codes (M) are utilized₁M₂…M_kM_{k+L+p+ 1}M_k+L+p+2...M_k+L+p+n-2) To identity hiding code (M)_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+p) The encryption is carried out, a certain batch of garbage bags need to be subjected to the identity hiding code unified encryption operation only once,

firstly, an initial value x of the Logistic chaotic map is respectively calculated and obtained according to the following formulas (1) - (5) by utilizing a numerical sequence S and a binary matrix B converted from the numerical sequence S, binary sequences B1 and B2 converted from the numerical sequences P1 and P2, and external keys alpha and beta₁A sum parameter mu, an extraction start position m, and an extraction interval number n₁、n₂，

Order to

Then

x₁＝α+mod(α+kp, 1-α)， (1)

μ＝β+mod(β+1.5×kp, 4-β)， (2)

Wherein, B_1,i,B_2,i,B_3,i,B_4,i,B_5,i,B_6,i,B_7,i,B_8,iDenotes the ith column of the binary matrix B or the binary sequence BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8The number of binary bits '1',<B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8>representing a binary sequence B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8Number of binary bits '1', B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>Representing a binary sequence B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8The number of binary bits '1', the external key satisfies the relation of alpha e (0,1) and beta e (3.57,4),

initial value x mapped by chaos₁And an external key mu, iterating the Logistic chaotic mapping shown in the following formula (6), wherein k represents iteration times (k is 1, 2), x_k+1Represents the chaotic signal obtained by the k-th iteration,

x_k+1＝μ×x_k×(1-x_k) (6)

obtaining a chaotic signal sequence X ═ X₁,x₂,., spaced by n from the m-th element in the sequence X₁Taking 1 element as each element to form a chaotic signal sequence with the length of 8L +8p +8

At the same time, the m-th element in the sequence X is sequentially spaced by n₂Taking 1 element as one element to form a chaotic signal sequence Z ═ Z with the length of 8L +8p +8₁,Z₂,...,Z_8L+8p+7,Z_8L+8p+8}，

Then, the chaotic signal sequence Y is sorted in descending order, and the high-order combined binary sequence B1 is scrambled according to the position change scrambling rule before and after the chaotic signal sequence Y is sorted to obtain a scrambled high-order binary sequence

Simultaneously, the chaotic signal sequence Z is sorted in a descending order, and the low-order combined binary sequence B2 is scrambled according to the position change scrambling rule before and after the chaotic signal sequence Z is sorted to obtain a low-order binary sequence after scrambling

Next, let LB be mod (6-mod (8L +8p +8,6),6), and scramble the higher binary sequence

LB binary bits '0' are added at the end of the sequence, the lower binary sequence after scrambling is carried out

LB binary bits '1' are added at the end of the sequence to obtain a binary sequence

And binary sequence

Wherein

For binary sequences

And

grouping the binary sequences separately

The middle elements are sequentially and positively grouped by taking 6 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as

Simultaneously converting binary sequences

The middle elements are sequentially and positively grouped by taking 6 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as

Wherein each binary block sequence comprises 6 binary bits, an

Finally, each binary packet sequence BF1{ i }, BF2{ i }, in turn, is subjected to the following diffusion operation:

s0: let i equal to 1, and

k1_switch＝mod(3×<B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8>+2×(8L+8p+8-<B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8>),8)，

k2_switch＝mod(3×<B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>-2×(8L+8p+8-<B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>),25)，

s1: the binary packet sequences BF1{ i }, BF2{ i } are calculated according to the following formulas (7), (8),

CP1_i＝bin2dec(BF1{i})+176+k1_switch， (7)

CP2_i＝bin2dec(BF2{i})+161+k2_switch， (8)

s2: numerical data CP1 calculated from binary packet sequence BF1{ i }_iAnd numerical data CP2 calculated from a binary packet sequence BF2{ i }_iAnd k1_ switch mod is calculated (CP 1)_i+2×CP2_i+3×k1_switch,8)、k2_switch＝mod(CP2_i+2×CP1_i+3 × k2_ switch,25), and let i equal i +1, then judge the size of i if it is

The process proceeds to step S1, otherwise, to step S3,

s3: finishing the diffusion operation of the binary grouping sequence to obtain diffused numerical value sequences CP1 and CP2, namely the encrypted information of the identity hidden codes of a certain garbage bag batch, which is represented as

(3) Batch generation of garbage classification numbers of certain batch of garbage bags

According to the different batch identity codes (code making date of each garbage classification code, garbage classification and garbage classification serial number information) of the single garbage bags in the batch of garbage bags, respectively executing a single garbage classification number generation step to realize the batch generation of the garbage classification numbers of the batch of garbage bags, wherein the garbage classification number generation step of the single garbage bags is described as follows,

firstly, extracting the code making date (M) of the garbage classification code from the identity code of the garbage bag_k+L+p+n-1M_k+L+p+n) Garbage category (M)_k+L+p+n+1M_k+L+p+n+2) Garbage classification serial number information (M)_k+L+p+n+3M_k+L+p+n+4) Converting the code date into numerical data by using bin2dec () function one by one to obtain numerical sequence R ═ { R }₁,R₂Converting the garbage classification serial number information into numerical data by using a bin2dec () function one by one to obtain a numerical sequence F ═ F { (F })₁,F₂}，

Then, respectively calculating according to the following formulas (9) and (10) to obtain initial values of Logistic chaotic mapping

And parameters

Order to

Then

Initial values mapped by chaos

And an external key

Iterating a Logistic chaotic mapping shown in a formula (11), wherein k represents iteration times (k is 1, 2.),

represents the chaotic signal obtained by the k-th iteration,

obtaining a chaotic signal sequence

Slave sequence

The m-th element is sequentially spaced by n₁Each element is 1 element to form a length of

Chaotic signal sequence of (1)

Simultaneous slave sequence

The m-th element is sequentially spaced by n₂Each element is 1 element to form a length of

Of the chaotic signal sequence

Next, the garbage classification (M) is used_k+L+p+n+1M_k+L+p+n+2) For encrypting the identity hidden code encryption information of a certain batch of garbage bags, the numerical value sequences CP1 and CP2 take the following operations,

if M is_k+L+p+n+1M_k+L+p+n+2If it is 01, the chaotic signal sequence is applied

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If M is_k+L+p+n+1M_k+L+p+n+2When the signal sequence is '02', the chaotic signal sequence is processed

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If M is_k+L+p+n+1M_k+L+p+n+2When the signal sequence is 03, the chaotic signal sequence is firstly generated

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If it is not

The chaotic signal sequence is first generated

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously firstly chaotic signal sequence

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

Wherein,

the operation means obtaining a value not greater than

The number of the integer (c) of (d),

finally, the numerical value sequence is

Element-by-element combination and conversion into Chinese character to obtain Chinese character sequence

I.e. the garbage classification number, wherein the length of the Chinese character sequence C is

Sequentially generating the garbage classification numbers of the garbage bags according to the generation process of the single garbage classification number in the garbage bags;

(4) garbage classification code combination and garbage classification two-dimensional code generation of certain batch of garbage bags

Identify the identity code (M) of the garbage bag₁M₂...M_kM_k+L+p+1M_k+L+p+2...M_k+L+p+n-2) Code making date (M)_{k+L+p+n- 1}M_k+L+p+n) Garbage classification number

Garbage category (M)_k+L+p+n+1M_k+L+p+n+2) Garbage classification serial number information (M)_k+L+p+n+3M_k+L+p+n+4) And combining to generate a single garbage classification Code in the garbage bags, then generating a QR Code, namely a garbage classification two-dimensional Code, and combining in batches to generate the garbage classification two-dimensional codes of the garbage bags according to the rule.

Further, the step (1) of converting the identity codes into numerical data one by one in the garbage classification two-dimensional code batch generation method means that the identity codes are converted into ASCII code values one by adopting a unicode2native () function to belong to [32,126 ]]Converting the visible characters into single numerical data, or converting double-byte coded Chinese characters in GB2312 character set into two numerical data, thereby obtaining corresponding numerical sequence

Further, in the garbage classification two-dimensional code batch generation method, the identity hidden codes are converted into numerical data [ P ] one by one in the step (1)_i1,P_i2]The method is to adopt unicode2native () function to belong the ASCII code value to [32,126 ]]Is converted into single numerical data and recombined, denoted as P_i1,P_i2]＝[0,unicode2native(M_i)]Or converting double-byte coded Chinese characters in GB2312 character set into two numerical data, which are expressed as [ P ]_i1,P_i2]＝unicode2native(M_i) So as to obtain the high-order numerical value sequence P1 ═ { P1 ═ P1₁,P1₂,…,P1_L+p,P1_L+p+1}＝{P₁₁,P₂₁,…,P_(L+p)1,P_(L+p+1)1And low order value sequence P2 ═ P2₁,P2₂,…,P2_L+p,P2_L+p+1}＝{P₁₂,P₂₂,…,P_(L+p)2,P_(L+p+1)2}。

Further, in the method for generating the two-dimensional code for garbage classification in batches, the element S in the numerical sequence S is used in the step (1)_iOne by one conversion into a binary sequence of 8bits BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8Means that dec2bin (S) is used_i8) the function yields a binary sequence BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8}。

Further, in the method for batch generation of two-dimensional codes for garbage classification, in step (1), the element P1 in the numerical sequence P1 is used_iOne by one into a binary sequence of 8bits BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8Means that dec2bin (P1) is used_i8) the function yields a binary sequence { BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8}。

Further, in the method for batch generation of two-dimensional codes for garbage classification, in step (1), the element P2 in the numerical sequence P2 is used_iOne by one into a binary sequence of 8bits BP2_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8Means that dec2bin (P2) is used_i8) the function yields a binary sequence { BP2_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8}。

Further, the numerical sequence in step (3) of the garbage classification two-dimensional code batch generation method

Element by element combination and conversion into Chinese characters areRefer to element-by-element combination [ CP1 ]_i,CP2_i]Then converted into kanji characters, i.e. C_i＝native2unicode([CP1_i,CP2_i])。

Further, the garbage classification two-dimensional code batch generation method is characterized in that the garbage bag identity identification code (M) in the step (4) is used₁M₂...M_kM_k+L+p+1M_k+L+p+2...M_k+L+p+n-2) Code making date (M)_k+L+p+n-1M_k+L+p+n) Garbage classification number

Garbage category (M)_k+L+p+n+1M_k+L+p+n+2) Garbage classification serial number information (M)_k+L+p+n+3M_k+L+p+n+4) The step of combining to generate the single garbage classification code in the garbage bag batch refers to the step of generating the single garbage classification code in the garbage bag batch by adopting a combination mode of inserting and connecting the garbage bag identity identification code, the code making date, the garbage classification number, the garbage classification and the garbage classification serial number information, and the code is expressed as

Wherein M is₁M₂...M_k、

M_k+L+p+1M_k+L+p+2...M_k+L+p+n-2M_k+L+p+n-1M_k+L+p+n、M_k+L+p+n+1M_k+L+p+n+2And M_k+L+p+n+3M_k+L+p+n+4The English spaces are mutually spaced.

Has the advantages that: the invention relies on the identity identification code and the hidden code extracted from the identity code of the garbage bag and utilizes chaotic mapping to generate a chaotic signal sequence, carries out scrambling, grouping and diffusion on the high-order binary sequence and the low-order binary sequence formed by converting and combining the identity hidden codes respectively to finish the uniform encryption of the identity hidden codes of a certain batch of garbage bags, relies on the batch identity code of a single garbage bag and utilizes chaotic mapping to generate the chaotic signal sequence, and carries out scrambling with different rules respectively on the uniform encryption result of the identity hidden code according to garbage categories, thereby generating the garbage classification two-dimensional codes in batches.

Drawings

FIG. 1 is a schematic diagram of a batch generation process of a two-dimensional code for garbage classification according to the present invention;

fig. 2 is a schematic diagram of a garbage classification two-dimensional code of the present invention, which includes a "recyclable" green background mark in the middle.

Detailed Description

As shown in fig. 1, a method for batch generation of two-dimensional codes for garbage classification includes the following steps:

(1) coding and transcoding

Firstly, identity information of a certain batch of garbage bags is coded, and the identity information comprises a uniform identity code of the certain batch of garbage bags and a batch identity code of a single garbage bag, so that a unique Chinese and English character type garbage bag identity code of the certain batch of single garbage bags is generated, and is expressed as M₁M₂...M_kM_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+pM_k+L+p+1M_k+L+p+2...M_k+L+p+nM_k+L+p+n+1M_{k+L+p+n+ 2}M_k+L+p+n+3M_k+L+p+n+4Wherein M is₁M₂...M_kIs a city region, M_k+1M_k+2...M_k+LTo a specific residential address, M_k+L+1M_{k+L+ 2}...M_k+L+pFor contacts and contact phones, M_k+L+p+1M_k+L+p+2...M_k+L+p+nFor coding time (in the form of year-month-day, wherein the last two bits M_k+L+p+n-1M_k+L+p+nAs date), M_k+L+p+n+1M_k+L+p+n+2Classifying color information for garbage (characterizing garbage classes), M_k+L+p+n+3M_k+L+p+n+4The garbage classification serial number information (serial number for representing a certain class of garbage bags on a certain day) is mutually separated by English blank spaces, and the corresponding garbage bags of a certain batch are unifiedThe share code is M₁M₂...M_kM_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+pM_{k+L+p+ 1}M_k+L+p+2...M_k+L+p+n-3M_k+L+p+n-2The batch identity code of the single garbage bag is M_k+L+p+n-1M_k+L+p+nM_k+L+p+n+1M_{k+L+p+n+ 2}M_k+L+p+n+3M_k+L+p+n+4，

Then, extracting the identification code (M) from the uniform identification code of a certain batch of garbage bags₁M₂...M_kM_{k+L+p+ 1}M_k+L+p+2...M_k+L+p+n-2) And identity hiding code (M)_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+p) And the identity code is subjected to character-by-character adoption of unicode2native () function to belong the value of ASCII code to 32,126]Converting the visible characters into single numerical data, or converting double-byte coded Chinese characters in GB2312 character set into two numerical data, thereby obtaining corresponding numerical sequence

Simultaneously, the identity hiding code adopts unicode2native () function to belong the ASCII code value to [32,126 ]]Is converted into single numerical data and recombined, denoted as P_i1,P_i2]＝[0,unicode2native(M_i)]Or converting double-byte coded Chinese characters in GB2312 character set into two numerical data, which are expressed as [ P ]_i1,P_i2]＝unicode2native(M_i) So as to obtain the high-order numerical value sequence P1 ═ { P1 ═ P1₁,P1₂,…,P1_L+p,P1_L+p+1}＝{P₁₁,P₂₁,…,P_(L+p)1,P_(L+p+1)1And low order value sequence P2 ═ P2₁,P2₂,…,P2_L+p,P2_L+p+1}＝{P₁₂,P₂₂,…,P_(L+p)2,P_(L+p+1)2}，

Finally, sequentially combining the elements S in the numerical sequence S_iAdopt dec2bin (S) one by one_i8) function conversionBinary sequence BS of 8bits_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8H, dividing the element P1 in the numerical value sequence P1_iAdopt dec2bin (P1) one by one_i8) conversion of the function into a binary sequence of 8bits { BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8The element P2 in the numerical sequence P2_iAdopt dec2bin (P2) one by one_i8) conversion of the function into a binary sequence of 8bits { BP2_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8}，

And will be

A binary sequence BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8Are combined, wherein

Resulting in a combined binary matrix B,

simultaneously combining L + p +1 binary sequences { BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8Combine, where i is 1, 2.., L + p +1, resulting in a high-order combined binary sequence B1 { B1 ═ B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8}＝{BP1_{1 1},BP1_{1 2},BP1₁₃,BP1₁₄,BP1₁₅,BP1₁₆,BP1₁₇,BP1₁₈,BP1₂₁,BP1₂₂,...,BP1₂₇,BP1₂₈,...,BP1_i1,BP1_i2,...,BP1_i7,BP1_i8,...,BP1_L+p+11,BP1_L+p+12,BP1_L+p+13,BP1_L+p+14,BP1_L+p+15,BP1_{L+p+1 6},BP1_{L+p+1 7},BP1_L+p+18And the L + p +1 binary sequences { BP 2}_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8Combine, where i is 1, 2.., L + p +1, resulting in a low-bit combined binary sequence B2 { B2 ═ B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8}＝{BP2₁₁,BP2₁₂,BP2₁₃,BP2₁₄,BP2₁₅,BP2₁₆,BP2₁₇,BP2₁₈,BP2₂₁,BP2₂₂,...,BP2₂₇,BP2₂₈,...,BP2_i1,BP2_i2,...,BP2_i7,BP2_i8,...,BP2_L+p+11,BP2_L+p+12,BP2_L+p+13,BP2_L+p+14,BP2_L+p+15,BP2_L+p+16,BP2_L+p+17,BP2_L+p+18}，

The garbage bag identity code comprises double-byte coded Chinese characters in a GB2312 character set and ASCLL code value E [32,126 ]]The length of the identity code of the garbage bag is k + L + p + n +6, and the length of the numerical sequence S is

The length of the numerical sequences P1, P2 is L + P +1, and the size of the combined binary matrix B is

The length of the combined binary sequences B1, B2 is 8L +8p + 8;

(2) identity hidden code unified encryption of certain batch of garbage bags

The identity hiding codes of a certain batch of garbage bags are uniformly encrypted to show that the identity identification codes (M) are utilized₁M₂…M_kM_{k+L+p+ 1}M_k+L+p+2...M_k+L+p+n-2) To identity hiding code (M)_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+p) Encryption is carried out, and a certain batch of garbage bags need to be processed only onceThe identity hiding code is subjected to unified encryption operation,

firstly, an initial value x of Logistic chaotic mapping is respectively calculated and obtained by utilizing a numerical sequence S and a binary matrix B converted from the numerical sequence S, binary sequences B1 and B2 converted from the numerical sequences P1 and P2, and external keys alpha and beta according to the following formula₁A sum parameter mu, an extraction start position m, and an extraction interval number n₁、n₂，

Order to

Then

x₁＝α+mod(α+kp,1-α)，

μ＝β+mod(β+1.5×kp,4-β)，

Wherein, B_1,i,B_2,i,B_3,i,B_4,i,B_5,i,B_6,i,B_7,i,B_8,iDenotes the ith column of the binary matrix B or the binary sequence BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8The number of binary bits '1',<B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8representing a binary sequence B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8The number of binary bits '1',<B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>representing a binary sequence B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8The number of binary bits '1', the external key satisfies the relation of alpha e (0,1) and beta e (3.57,4),

initial value x mapped by chaos₁And an external key mu, and iterating the Logistic chaotic mapping shown in the following formula, wherein k represents iteration times (k is 1,2, and.) and x_k+1Represents the chaotic signal obtained by the k-th iteration,

x_k+1＝μ×x_k×(1-x_k)

obtaining a chaotic signal sequence X ═ X₁,x₂,., spaced by n from the m-th element in the sequence X₁Taking 1 element as one element to form a chaotic signal sequence with the length of 8L +8p +8

At the same time, the m-th element in the sequence X is sequentially spaced by n₂Taking 1 element as one element to form a chaotic signal sequence Z with the length of 8L +8p +8 ═ Z₁,Z₂,...,Z_8L+8p+7,Z_8L+8p+8}，

Then, the chaotic signal sequence Y is sorted in descending order, and the high-order combined binary sequence B1 is scrambled according to the position change scrambling rule before and after the chaotic signal sequence Y is sorted to obtain a scrambled high-order binary sequence

Simultaneously, the chaotic signal sequence Z is sorted in a descending order, and the low-order combined binary sequence B2 is scrambled according to the position change scrambling rule before and after the chaotic signal sequence Z is sorted to obtain a low-order binary sequence after scrambling

Next, let LB be mod (6-mod (8L +8p +8,6),6), and scramble the higher binary sequence

LB binary bits '0' are added at the end of the sequence, the lower binary sequence after scrambling is carried out

LB binary bits '1' are added at the end of the sequence to obtain a binary sequence

And binary sequence

Wherein

For binary sequences

And

grouping the binary sequences separately

The middle elements are sequentially and positively grouped by taking 6 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as

Simultaneously converting binary sequences

The middle elements are sequentially and positively grouped by taking 6 elements as a unit from the beginning to the end to obtain a grouped binary sequence which is expressed as

Wherein each binary block sequence comprises 6 binary bits, an

Finally, each binary packet sequence BF1{ i }, BF2{ i }, in turn, is subjected to the following diffusion operation:

s0: let i equal to 1, and

k1_switch＝mod(3×<B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8>+2×(8L+8p+8-<B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8>),8)，

k2_switch＝mod(3×<B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>-2×(8L+8p+8-<B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>),25)，

s1: the binary packet sequences BF1{ i }, BF2{ i } are calculated according to the following formula,

CP1_i＝bin2dec(BF1{i})+176+k1_switch，

CP2_i＝bin2dec(BF2{i})+161+k2_switch，

s2: numerical data CP1 calculated from binary packet sequence BF1{ i }_iAnd numerical data CP2 calculated from a binary packet sequence BF2{ i }_iAnd k1_ switch mod is calculated (CP 1)_i+2×CP2_i+3×k1_switch,8)、k2_switch＝mod(CP2_i+2×CP1_i+3 × k2_ switch,25), and let i equal i +1, then judge the size of i if it is

Go to step S1, otherwise go to stepS3，

S3: finishing the diffusion operation of the binary grouping sequence to obtain diffused numerical value sequences CP1 and CP2, namely the encrypted information of the identity hidden codes of a certain garbage bag batch, which is represented as

(3) Batch generation of garbage classification numbers of certain batch of garbage bags

According to the different batch identity codes (code making date of each garbage classification code, garbage classification and garbage classification serial number information) of the single garbage bags in the batch of garbage bags, respectively executing a single garbage classification number generation step to realize the batch generation of the garbage classification numbers of the batch of garbage bags, wherein the garbage classification number generation step of the single garbage bags is described as follows,

firstly, extracting the code making date (M) of the garbage classification code from the identity code of the garbage bag_k+L+p+n-1M_k+L+p+n) Garbage category (M)_k+L+p+n+1M_k+L+p+n+2) Garbage classification serial number information (M)_k+L+p+n+3M_k+L+p+n+4) Converting the code date into numerical data by using bin2dec () function one by one to obtain numerical sequence R ═ { R }₁,R₂Converting the garbage classification serial number information into numerical data by using a bin2dec () function one by one to obtain a numerical sequence F ═ F { (F })₁,F₂}，

Then, respectively calculating to obtain initial values of Logistic chaotic mapping according to the following formulas

And parameters of

Order to

Then

Initial value mapped by chaos

And an external key

Iterating the Logistic chaotic mapping shown in the following formula, wherein k represents iteration times (k is 1, 2.) (k is equal to 1, 2.),

Represents the chaotic signal obtained by the k-th iteration,

obtaining a chaotic signal sequence

Slave sequence

The m-th element is sequentially spaced by n₁Each element is 1 element to form a length of

Of the chaotic signal sequence

Simultaneous slave sequence

The m-th element is sequentially spaced by n₂Each element is 1 element to form a length of

Of the chaotic signal sequence

Next, the garbage classification (M) is used_k+L+p+n+1M_k+L+p+n+2) For encrypting the identity hidden code encryption information of a certain batch of garbage bags, the numerical value sequences CP1 and CP2 take the following operations,

if M is_k+L+p+n+1M_k+L+p+n+2If it is 01, the chaotic signal sequence is applied

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If M is_k+L+p+n+1M_k+L+p+n+2When the signal sequence is '02', the chaotic signal sequence is processed

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If M is_k+L+p+n+1M_k+L+p+n+2When the signal sequence is 03, the chaotic signal sequence is firstly generated

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If M is_k+L+p+n+1M_k+L+p+n+2When the signal sequence is 04', the chaotic signal sequence is firstly generated

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously firstly chaotic signal sequence

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

Wherein,

the operation means obtaining a value not greater than

The number of the integer (c) of (d),

finally, the numerical value sequence is

Element-by-element combination [ CP1 ]_i,CP2_i]Then converted into kanji characters, i.e. C_i＝native2unicode([CP1_i,CP2_i]) To obtain the Chinese character sequence

I.e. the garbage classification number, wherein the length of the Chinese character sequence C is

Sequentially generating the garbage classification numbers of the garbage bags according to the generation process of the single garbage classification number in the garbage bags;

(4) garbage classification code combination and garbage classification two-dimensional code generation of certain batch of garbage bags

Identify the identity code (M) of the garbage bag₁M₂...M_kM_k+L+p+1M_k+L+p+2...M_k+L+p+n-2) Code making date (M)_{k+L+p+n- 1}M_k+L+p+n) Garbage classification number

Garbage category (M)_k+L+p+n+1M_k+L+p+n+2) Garbage classification serial number information (M)_k+L+p+n+3M_k+L+p+n+4) The combination mode of inserting connection is adopted to generate a single garbage classification code in the garbage bags of the batch, which is expressed as

Wherein M is₁M₂...M_k、

M_k+L+p+1M_k+L+p+2...M_k+L+p+n-2M_k+L+p+n-1M_k+L+p+n、M_k+L+p+n+1M_k+L+p+n+2And M_k+L+p+n+3M_k+L+p+n+4The English blank spaces are mutually used for spacing, a single garbage classification Code in the garbage bags is generated, then a QR Code, namely a garbage classification two-dimensional Code, is generated, and the garbage classification two-dimensional codes of the garbage bags can be generated in batch combination according to the rule.

The invention is further illustrated by the following specific examples:

example 1

The method for generating the garbage classification two-dimensional codes in batches comprises the following steps:

(1) coding and transcoding

The identity information of a certain batch of garbage bags is encoded, the identity information comprises a uniform identity code of a certain batch of garbage bags and a batch identity code of a single garbage bag, and a unique Chinese and English character type garbage bag identity code of the certain batch of garbage bags is generated, wherein the unique Chinese and English character type garbage bag identity code is ' Jiangsu province-Nantong city-south century city-12 # Li Xiaoqiang 150057099992020-08-020103 ', the length is k + L + p + n +9 ═ 11+13+14+10+9 ═ 57 ', wherein ' Jiangsu province-Nantong city-Chuan area ' is a province region, ' Zhongnan century city-12 #1201 ' is a specific living address (such as a district-house brand), ' 2020 strong Li Xiao 15005709999 ' is a contact and a contact telephone, ' 2020-08-02 ' is a code making time, ' 01 ' is garbage classification color information (such as green recyclable garbage classification sequence number information), ' 03 ' is garbage classification sequence number information, correspondingly, the unified identity code of a certain batch of garbage bags is 'Jiangsu province-Nantong City-Haimen region in the south century City-12 #1201 Li Xiaoqiang 150057099992020-08-', the batch identity code of a single garbage bag is '020103',

then, respectively extracting an identity code (2020-08-) and an identity hiding code (12 #1201 Li Xiao Qiang 15005709999) from the uniform identity codes of a certain batch of garbage bags, converting the identity code character by character into numerical data by using a unicode2native () function to obtain a corresponding numerical sequence S {189,173,203,213,202,161,45,196,207,205,168,202,208,45,186,163,195,197,199,248,32,50,48,50,48,45,48,56,45}, and simultaneously converting the identity hiding code character by character into numerical data to obtain a corresponding high-digit numerical valueSequence P1 ═ {214,196,202,188,179,0,0,0,0,0,0,0,0,0,192,207,199,0,0,0,0,0,0,0,0,0,0,0} and low bit number sequence P2 ═ 208,207,192,205,199,45,49,50,35,49,50,48,49,32,238,254,191,49,53,48,48,53,55,48,57,57,57 }, where the length of the number sequence S is equal to {208,207,192, 199,0,0,0,0,0, 0}, and low bit number sequence P2 ═ 208, 23 }, where the length of the number sequence S is equal to the length of the sequence S

The length of the numerical sequences P1, P2 is L + P + 1-13 +14+ 1-28,

finally, sequentially combining the elements S in the numerical sequence S_iOne by one, converting the numerical value sequence P1 into a binary sequence of 8bits, and converting the numerical value sequence P1 into an element P1_iOne by one, converting the numerical value sequence P2 into a binary sequence of 8bits, and converting the numerical value sequence P2 into an element P2_iAre converted into binary sequences of 8bits one by one,

and 29 binary sequences BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8Are combined, resulting in a combined binary matrix B,

simultaneously combining 28 binary sequences { BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8Are combined to obtain a high-order combined binary sequence B1 ═ B1₁,B1₂,...,B1₂₂₃,B1₂₂₄}＝{1,1,0,1,0,1,1,0,1,1,0,0,0,1,0,0,1,1,0,0,1,0,1,0,1,0,1,1,1,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,1,1,1,1,1,1,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}，

28 binary sequences { BP2_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8Are combined to obtain a low-order combined binary sequence B2 ═ B2₁,B2₂,...,B2₂₂₃,B2₂₂₄}＝{1,1,0,1,0,0,0,0,1,1,0,0,1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,1,0,0,1,1,0,0,0,1,0,0,1,1,0,0,1,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0,0,1,0,0,1,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,1,0,0,1,0,0,0,0,0,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1,0,1,0,1,1,1,1,1,1,0,0,1,1,0,0,0,1,0,0,1,1,0,1,0,1,0,0,1,1,0,0,0,0,0,01,1,0,0,0,0,0,0,1,1,0,1,0,1,0,0,1,1,0,1,1,1,0,0,1,1,0,0,0,0,0,0,1,1,1,0,0,1,0,0,1,1,1,0,0,1,0,0,1,1,1,0,0,1,0,0,1,1,1,0,0,1}；

(2) Identity hidden code unified encryption of certain batch of garbage bags

The identity hiding codes of a certain batch of garbage bags are uniformly encrypted, which means that identity identification codes (China, south China, City, Haimen region 2020-08-) are used for encrypting the identity hiding codes (China, south China, 12#1201 LiXiaoqiang 15005709999), a certain batch of garbage bags need to be subjected to identity hiding code uniform encryption operation only once,

first, using the value sequence S and the binary matrix B converted from the value sequence S, the binary sequences B1 and B2 converted from the value sequences P1 and P2, and the external keys α -0.12345 and β -3.75, the initial value x of the Logistic chaotic map is calculated according to the following formula₁A sum parameter mu, an extraction start position m, and an extraction interval number n₁、n₂，

Order to

Then

x₁＝0.12345+mod(0.12345+0.527325318380424,1-0.12345)＝0.774225318380424，

μ＝3.75+mod(3.75+1.5×0.527325318380424,4-3.75)＝3.790987977570636，

m＝987+mod(13295951060,67)＝1037,

n₁＝1+mod(13295951060,57)＝18，

n₂＝1+mod(13295951060,47)＝36，

Initial value x mapped by chaos₁And an external key mu, and iterating the Logistic chaotic mapping shown in the following formula, wherein k represents iteration times (k is 1,2, and.) and x_k+1Represents the chaotic signal obtained by the k-th iteration,

x_k+1＝μ×x_k×(1-x_k)

obtaining a chaotic signal sequence X ═ X₁,x₂,., taking 1 element at intervals of 18 elements in sequence from the 1037 th element in the sequence X to form a chaotic signal sequence Y with the length of 224 ═ Y }₁,Y₂,...,Y₂₂₃,Y₂₂₄And simultaneously taking 1 element from the 1037 th element in the sequence X at intervals of 36 elements to form a chaotic signal sequence Z with the length of 224 (Z-Z)₁,Z₂,...,Z₂₂₃,Z₂₂₄}，

Then, the chaotic signal sequence Y is sorted in descending order, and the high-order combined binary sequence B1 is scrambled according to the position change scrambling rule before and after the chaotic signal sequence Y is sorted to obtain a scrambled high-order binary sequence

0,0,1,1,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,1,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0, 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 1,0,1,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0, 0,0,0,0,1,0,0,0,0, 1,0,0,0,0,0,0, and the chaotic signal sequence Z is sorted in descending order, the chaotic signal sequence Z is sorted according to the position change scrambling rule before and after the chaotic signal sequence Z is sorted, the low-bit combination binary sequence B2 is scrambled to obtain the low-bit binary sequence B2 after scrambling

Next, let LB be mod (6-mod (224,6),6 be 4, and scramble the high binary sequence

Adds 4 binary bits '0' at the end of the sequence, and carries out scrambling on the lower binary sequence

Adds 4 binary bits '1' at the end of the sequence to obtain a binary sequence

And binary sequence

In which binary sequence

Has a length of

Will binary sequence

The middle elements go forward in sequence from head to tail by taking 6 elements as a unitThe lines are grouped to obtain a binary sequence after grouping, BF1{1} - {1,1,0,0, 0}, BF1{2} - {0,0,0,0, 0}, …, BF1{19} - {0,1,0,0,0,0}, …, BF1{37} - {0,0,0,1,0,0, 0}, BF1{38} - {0,0,0,0,0,0}, and the binary sequence is simultaneously grouped, and the binary sequence is further grouped into a binary sequence, wherein BF1{1} - {0,1,0,0, 0}, and BF1{38} - { 0}, 0

The middle elements are sequentially grouped in the forward direction from beginning to end by 6 elements to obtain a binary sequence after grouping, wherein BF2{1} {0,0,1,0,1,1}, BF2{2} {1,0,1,0, 0}, …, BF2{19} {1,1,0,0,0,1}, …, BF2{37} {1,0,0,0,1,1}, BF2{38} {1,1,1,1, 1}, and BF2{38}, wherein {38}, 1,1,1,1,1}, and so on,

finally, sequentially performing diffusion operation on each binary grouping sequence BF1{ i }, BF2{ i }, so as to obtain a diffused numerical value sequence, namely encryption information of identity hiding codes of a certain batch of garbage bags, wherein CP1 is {227,176,182,184,188,206,180,182,178,182,176,234,178,213,178,177,182,178,194,197,190,181,176,186,217,179,178,178,178,190,184,178,178,182,181,185,184,180} and CP2 is {194,215,175,195,177,204,241,237,235,200,178,202,220,206,178,202,162,177,230,218,212,166,225,223,192,222,184,193,222,174,228,229,191,189,190,195,212,227 };

(3) batch generation of garbage classification numbers of certain batch of garbage bags

According to the different batch identity codes (code making date of each garbage classification code, garbage classification and garbage classification serial number information) of the single garbage bags in the batch of garbage bags, respectively executing a single garbage classification number generation step to realize the batch generation of the garbage classification numbers of the batch of garbage bags, wherein the garbage classification number generation step of the single garbage bags is described as follows,

firstly, extracting garbage classification code making date '02', garbage category '01' and garbage classification serial number information '03' from the garbage bag identity code, converting the code making date into numerical data by utilizing bin2dec () function one by one to obtain numerical value sequence R ═ 48,50}, converting the garbage classification serial number information into numerical value data by utilizing bin2dec () function one by one to obtain numerical value sequence F ═ 48,51},

then, order

Then

Initial values mapped by chaos

And an external key

Iterating the Logistic chaotic mapping, wherein k represents iteration times (k is 1, 2.) (k is equal to 1, 2.)

Represents the chaotic signal obtained by the k-th iteration,

obtaining a chaotic signal sequence

Slave sequence

The 1037 th element in the sequence is sequentially spaced by 18 elements and takes 1 element to form a chaotic signal sequence with the length of 38

Simultaneous slave sequence

The 1037 th element is sequentially spaced by 36 elements from the beginning to take 1 element as a shapeInto a chaotic signal sequence of length 38

Then, according to the garbage category '01', the identity hidden code of a certain batch of garbage bags is encrypted, and the numerical value sequences CP1 and CP2 take the following operation that the chaotic signal sequence is processed

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

Finally, the numerical value sequence is

Firstly, element combination is carried out one by one and then the element combination is converted into Chinese character characters, a Chinese character sequence is obtained, namely the garbage classification number is a code marking squatting station ginseng, such as' quiet neck cut step pattern lake night neck color ancient covered wagon arc Fuyang elevation night table,

sequentially generating the garbage classification numbers of the garbage bags according to the generation process of the single garbage classification number in the garbage bags;

(4) garbage classification code combination and garbage classification two-dimensional code generation of certain batch of garbage bags

The method comprises the steps of generating a single garbage classification Code in a garbage bag as a Code of a Thyssal province, a Nantong city, a Haimen district 2020-08- ", a Code making date (02), a garbage classification Code (a static leftover neck and Cui tailored step, a tall oil jacket, a neck color ancient covered wagon, an isolated furo, a boil, a tail poking, a dry pooh, a short Baphich and Thalasi book and other Code squatting stations), a garbage classification (01) and garbage classification serial number information (03) in an inserting and connecting combination mode, generating a single garbage classification Code in the garbage bag as a Code of a Jiangsu province, a Nantong city, a static leftover neck and Cui tailored step, a tall oil jacket, a short pooh and Hosta book and other Code squatting stations 2020-08-020103", generating a single garbage classification Code in the garbage bag, then generating a Code of a Quick Response (QR) in the garbage bag, the garbage classification two-dimensional codes can be combined in batches according to the rule to generate the garbage classification two-dimensional codes of the garbage bags.

Example 2

According to the method for generating the two-dimensional codes for garbage classification in batches, the steps for generating the two-dimensional codes for garbage classification of a certain batch of garbage bags and the information of the external secret key, the code making date, the garbage category and the serial number of the garbage classification are similar to those in embodiment 1, and as for the identification code of the garbage bag ("Jiangsu province-Nantong city-Haiman district 2020-08-", or "Engineer province-Nantong city-Haiman district 2020-08-", or "Jiangsu province-Nantong city-Haiman district 2020-09-"), only the identity hidden code in the original identity information of the garbage bag ("Zhongnan century city-12 # Lixiaoqiang 15005709999") is slightly changed: "southern century city-12 #1201 Li Xiaoqiang 15005709999"; or "the city of the century of the middle and south china-12 #1211 Lixiaoqiang 1500570999"; or "city of the middle and south century-12 #1201 li xiao qiang 15005709998", the two-dimensional code generation result of garbage classification of a certain garbage bag is shown in table 1. As can be seen from the following table, the identity hidden code of a certain batch of single garbage bags changes slightly, which causes a great change in the two-dimensional code for garbage classification, and thus it can be seen that the batch generation method for the two-dimensional code for garbage classification provided by the patent has sensitivity to the hidden part (i.e., the identity hidden code for garbage bags) in the identity information of the garbage bags.

TABLE 1 micro-variation of hidden ID codes of garbage bags in a certain batch

Example 3

According to the method for generating the two-dimensional codes for garbage classification in batches, the steps for generating the two-dimensional codes for garbage classification of a certain batch of single garbage bags and the information of the identity hidden codes, the code making dates, the garbage categories and the garbage classification serial numbers of the garbage bags are similar to those in embodiment 1, and as for the identification codes of the garbage bags ("2020-08-" of Jiangsu province-Nantong city-Haiman district, or "2020-08-" of Engineer province-Nantong city-Haiman district, or "2020-08-" of Jiangsu province-Nantong city-Haiman district), only the external keys (alpha-0.12345 and beta-3.75) are slightly changed singly: 0.123450000000001; or β 3.750000000000001, the two-dimensional code of garbage classification of a certain single garbage bag is generated as shown in table 2. As can be seen from the following table: once the external key changes slightly, namely, the external key is lost in millicentimetres, the generated two-dimensional code for garbage classification can be within kilometres of difference, and therefore it can be seen that the method for generating the two-dimensional code for garbage classification in batches has the key sensitivity.

TABLE 2 Generation results of garbage classification two-dimensional codes when the external key is slightly changed

Example 4

According to the batch generation method of the garbage classification two-dimensional codes, the generation step of the garbage classification two-dimensional codes of a certain batch of single garbage bags, the identity identification codes of the garbage bags, the identity hidden codes of the garbage bags and the external secret keys are similar to those in embodiment 1, and the garbage classification color information of a certain batch of garbage bags is respectively '01', '02', '03', '04'; or the code making dates of a certain batch of garbage bags are respectively '02', '06', '12', '16', '22' and '26'; or the garbage classification serial number information of a certain batch of garbage bags is respectively "01", "02", "03", "04", "05" and "06", and the corresponding three-batch garbage classification two-dimensional code generation results are shown in table 3. The following table shows that the garbage classification color information, the code making date and the garbage classification serial number information of a certain batch of garbage bags are sequentially changed, so that the garbage classification two-dimensional codes of the certain batch of garbage bags can be generated in batches, and the garbage classification two-dimensional code batch generation method provided by the patent has sensitivity on the garbage classification color information, the code making date and the garbage classification serial number information in the garbage bag identity information.

TABLE 3 batch Generation of two-dimensional codes for garbage Classification

As can be seen from the analysis of the above specific embodiments 1-4, the garbage classification codes generated in batch by the garbage classification code batch generation method provided by the present invention are not only closely related to the external secret key, but also depend on the identity information of the garbage bags (the uniform identity code of a certain batch of garbage bags, the batch identity code of a single garbage bag), so that the garbage classification code batch generation method provided by the present invention has strong security, so as to ensure that the garbage classification codes generated in batch have "uniqueness", security, and garbage classification guidance ".

Although the present invention has been described with reference to a preferred embodiment, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (8)

1. A garbage classification two-dimensional code batch generation method is characterized by comprising the following steps:

(1) coding and transcoding

Firstly, identity information of a certain batch of garbage bags is coded, and the identity information comprises a uniform identity code of the certain batch of garbage bags and a batch identity code of a single garbage bag, so that a unique Chinese and English character type garbage bag identity code of the certain batch of single garbage bags is generated, and is expressed as M₁M₂...M_kM_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+pM_k+L+p+1M_k+L+p+2...M_k+L+p+nM_k+L+p+n+1M_{k+L+p+n+ 2}M_k+L+p+n+3M_k+L+p+n+4Wherein M is₁M₂...M_kIs a city region, M_k+1M_k+2...M_k+LTo a specific residential address, M_k+L+1M_{k+L+ 2}...M_k+L+pFor contacts and contact phones, M_k+L+p+1M_k+L+p+2...M_k+L+p+nFor coding time (in the form of year-month-day, wherein the last two bits M_k+L+p+n-1M_k+L+p+nAs date), M_k+L+p+n+1M_k+L+p+n+2Classifying color information for garbage (characterizing garbage classes), M_k+L+p+n+3M_k+L+p+n+4The garbage classification serial number information (serial number representing a certain class of garbage bags on a certain day) is mutually spaced by English blank spaces, and the unified identity code of a corresponding garbage bag batch is M₁M₂...M_kM_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+pM_{k+L+p+ 1}M_k+L+p+2...M_k+L+p+n-3M_k+L+p+n-2The batch identity code of the corresponding single garbage bag is M_k+L+p+n-1M_k+L+p+nM_{k+L+p+n+ 1}M_k+L+p+n+2M_k+L+p+n+3M_k+L+p+n+4，

Then, extracting the identification code (M) from the uniform identification code of a certain batch of garbage bags₁M₂...M_kM_k+L+p+1M_{k+L+p+ 2}...M_k+L+p+n-2) And identity hiding code (M)_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+p) And converting the ID code into numerical data one by one to obtain corresponding numerical sequence

Simultaneously converting the identity hiding code into numerical data P one by one_i1,P_i2]Obtaining a high-order numerical value sequence P1 ═ { P1 ═ P1₁,P1₂,...,P1_L+p,P1_L+p+1}＝{P₁₁,P₂₁,...,P_(L+p)1,P_(L+p+1)1And low order value sequence P2 ═ P2₁,P2₂,...,P2_L+p,P2_L+p+1}＝{P₁₂,P₂₂,...,P_(L+p)2,P_(L+p+1)2}，

Finally, sequentially combining the elements S in the numerical sequence S_iOne by one conversion into a binary sequence of 8bits BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8The element P1 in the numerical sequence P1_iOne by one into a binary sequence of 8bits BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8The element P2 in the numerical sequence P2_iOne by one into a binary sequence of 8bits BP2_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8}，

And will be

A binary sequence BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8In combination, where i is 1, 2.,

resulting in a combined binary matrix B,

simultaneously combining L + p +1 binary sequences { BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8Combine, where i is 1, 2.., L + p +1, resulting in a high-order combined binary sequence B1 { B1 ═ B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8}＝{BP1₁₁,BP1₁₂,BP1₁₃,BP1₁₄,BP1₁₅,BP1₁₆,BP1₁₇,BP1₁₈,BP1₂₁,BP1₂₂,...,BP1₂₇,BP1₂₈,...,BP1_i1,BP1_i2,...,BP1_i7,BP1_i8,...,BP1_L+p+11,BP1_L+p+12,BP1_L+p+13,BP1_L+p+14,BP1_L+p+15,BP1_L+p+16,BP1_L+p+17,BP1_L+p+18And the L + p +1 binary sequences { BP 2}_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8Combine, where i is 1, 2.., L + p +1, resulting in a low-bit combined binary sequence B2 { B2 ═ B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8}＝{BP2₁₁,BP2₁₂,BP2₁₃,BP2₁₄,BP2₁₅,BP2₁₆,BP2₁₇,BP2₁₈,BP2₂₁,BP2₂₂,...,BP2₂₇,BP2₂₈,...,BP2_i1,BP2_i2,...,BP2_i7,BP2_i8,...,BP2_L+p+11,BP2_L+p+12,BP2_L+p+13,BP2_L+p+14,BP2_L+p+15,BP2_L+p+16,BP2_L+p+17,BP2_L+p+18}，

The garbage bag identity code comprises double-byte coded Chinese characters in a GB2312 character set and ASCLL code value E [32,126 ]]The length of the identity code of the garbage bag is k + L + p + n +6, and the length of the numerical sequence S is

The length of the numerical sequences P1, P2 is L + P +1, and the size of the combined binary matrix B is

The length of the combined binary sequences B1, B2 is 8L +8p + 8;

(2) identity hidden code unified encryption of certain batch of garbage bags

The identity hiding codes of a certain batch of garbage bags are uniformly encrypted to show that the identity identification codes (M) are utilized₁M₂...M_kM_k+L+p+1M_{k+L+p+ 2}...M_k+L+p+n-2) To identity hidden code (M)_k+1M_k+2...M_k+LM_k+L+1M_k+L+2...M_k+L+p) The encryption is carried out, a certain batch of garbage bags need to be subjected to the identity hiding code unified encryption operation only once,

firstly, an initial value x of the Logistic chaotic map is respectively calculated and obtained according to the following formulas (1) - (5) by utilizing a numerical sequence S and a binary matrix B converted from the numerical sequence S, binary sequences B1 and B2 converted from the numerical sequences P1 and P2, and external keys alpha and beta₁A sum parameter mu, an extraction start position m, and an extraction interval number n₁、n₂，

Order to

Then

x₁＝α+mod(α+kp,1-α)， (1)

μ＝β+mod(β+1.5×kp,4-β)， (2)

Wherein,<B_1,i,B_2,i,B_3,i,B_4,i,B_5,i,B_6,i,B_7,i,B_8,i>representing the ith column or binary sequence BS of the binary matrix B_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8The number of binary bits '1',<B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8>representing a binary sequence B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8The number of binary bits '1',<B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>representing a binary sequence B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8The number of binary bits '1' in the key, the external key satisfies a e (0,1), ss e (3.57,4),

initial value x mapped by chaos₁And an external key mu, iterating the Logistic chaotic mapping shown in the following formula (6), wherein k represents iteration times (k is 1, 2), x_k+1Represents the chaotic signal obtained by the k-th iteration,

x_k+1＝μ×x_k×(1-x_k) (6)

obtaining a chaotic signal sequence X ═ X₁,x₂,., spaced by n from the m-th element in the sequence X₁Taking 1 element as one element to form a chaotic signal sequence with the length of 8L +8p +8

At the same time, the m-th element in the sequence X is sequentially spaced by n₂Taking 1 element from each element to form a length of 8L +8p+8 chaotic signal sequence Z ═ { Z ═ Z₁,Z₂,...,Z_8L+8p+7,Z_8L+8p+8}，

Then, the chaotic signal sequence Y is sorted in descending order, and the high-order combined binary sequence B1 is scrambled according to the position change scrambling rule before and after the chaotic signal sequence Y is sorted to obtain a scrambled high-order binary sequence

Simultaneously, the chaotic signal sequence Z is sorted in a descending order, and the low-order combined binary sequence B2 is scrambled according to the position change scrambling rule before and after the chaotic signal sequence Z is sorted to obtain a low-order binary sequence after scrambling

Then, let LB be mod (6-mod (8L +8p +8,6),6), and scramble the higher binary sequence

LB binary bits '0' are added at the end of the sequence, the lower binary sequence after scrambling is carried out

LB binary bits '1' are added at the end of the sequence to obtain a binary sequence

And binary sequence

Wherein

For binary sequences

And

grouping the binary sequences separately

The middle elements are sequentially grouped by taking 6 elements as a unit in the forward direction from beginning to end to obtain a grouped binary sequence which is expressed as BF1{1}, BF1{2},.

Simultaneously converting binary sequences

The middle elements are sequentially grouped by taking 6 elements as a unit in the forward direction from beginning to end to obtain a grouped binary sequence which is expressed as BF2{1}, BF2{2},.

Wherein each binary block sequence comprises 6 binary bits, an

Finally, each binary packet sequence BF1{ i }, BF2{ i }, in turn, is subjected to the following diffusion operation:

s0: let i equal to 1, and

k1_switch＝mod(3×<B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8>+2×(8L+8p+8-〈B1₁,B1₂,...,B1_8L+8p+7,B1_8L+8p+8>),8)，

k2_switch＝mod(3×〈B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>-2×(8L+8p+8-<B2₁,B2₂,...,B2_8L+8p+7,B2_8L+8p+8>),25)，

s1: the binary packet sequences BF1{ i }, BF2{ i } are calculated according to the following formulas (7), (8),

CP1_i＝bin2dec(BF1{i})+176+k1_switch， (7)

CP2_i＝bin2dec(BF2{i})+161+k2_switch， (8)

s2: numerical data CP1 calculated from binary packet sequence BF1{ i }_iAnd numerical data CP2 calculated from a binary packet sequence BF2{ i }_iAnd k1_ switch mod is calculated (CP 1)_i+2×CP2_i+3×k1_switch,8)、k2_switch＝mod(CP2_i+2×CP1_i+3 × k2_ switch,25), and let i equal i +1, then judge the size of i if it is

The process proceeds to step S1, otherwise, to step S3,

s3: finishing the diffusion operation of the binary grouping sequence to obtain diffused numerical value sequences CP1 and CP2, namely the encrypted information of the identity hidden codes of a certain garbage bag batch, which is represented as

(3) Batch generation of garbage classification numbers of certain batch of garbage bags

According to the different batch identity codes (code making date of each garbage classification code, garbage classification and garbage classification serial number information) of the single garbage bags in the batch of garbage bags, respectively executing a single garbage classification number generation step to realize the batch generation of the garbage classification numbers of the batch of garbage bags, wherein the garbage classification number generation step of the single garbage bags is described as follows,

firstly, extracting the code making date (M) of the garbage classification code from the identity code of the garbage bag_k+L+p+n-1M_k+L+p+n) Garbage category (M)_k+L+p+n+1M_k+L+p+n+2) Garbage classification serial number information (M)_k+L+p+n+3M_k+L+p+n+4) Converting the coding date into numerical data by using bin2dec () function one by one to obtain numerical sequence R ═ { R }₁,R₂Converting the garbage classification serial number information into numerical data by using a bin2dec () function one by one to obtain a numerical sequence F ═ F { (F })₁,F₂}，

Then, respectively calculating according to the following formulas (9) and (10) to obtain initial values of Logistic chaotic mapping

And parameters

Order to

Then

Initial values mapped by chaos

And an external key

Iterating a Logistic chaotic mapping shown in a formula (11), wherein k represents iteration times (k is 1, 2.),

represents the chaotic signal obtained by the k-th iteration,

obtaining a chaotic signal sequence

Slave sequence

The m-th element is sequentially spaced by n₁Each element is 1 element to form a length of

Of the chaotic signal sequence

Simultaneous slave sequence

The m-th element is sequentially spaced by n₂Each element is 1 element to form a length of

Of the chaotic signal sequence

Next, the garbage classification (M) is used_k+L+p+n+1M_k+L+p+n+2) For encrypting the identity hidden code encryption information of a certain batch of garbage bags, the numerical value sequences CP1 and CP2 take the following operations,

if M is_k+L+p+n+1M_k+L+p+n+2If it is 01, the chaotic signal sequence is applied

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If M is_k+L+p+n+1M_k+L+p+n+2When the signal sequence is '02', the chaotic signal sequence is processed

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the sequencing is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If M is_k+L+p+n+1M_k+L+p+n+2When the signal sequence is 03, the chaotic signal sequence is firstly generated

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously converting the chaotic signal sequence

In ascending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

If M is_k+L+p+n+1M_k+L+p+n+2When the signal sequence is 04', the chaotic signal sequence is firstly generated

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the numerical value sequence CP1 to obtain a scrambled numerical value sequence

Simultaneously firstly chaotic signal sequence

Recombining to obtain a recombined chaotic signal sequence

Then, the chaotic signal sequence is processed

In descending order, according to chaotic signal sequence

The position change scrambling rule before and after the ordering is used for scrambling the low-order combined binary sequence CP2 to obtain a scrambled numerical sequence

Wherein,

the operation means obtaining a value not greater than

The number of the integer (c) of (d),

finally, the numerical value sequence is

Element-by-element combination and conversion into Chinese character to obtain Chinese character sequence

I.e. the garbage classification number, wherein the length of the Chinese character sequence C is

Sequentially generating the garbage classification numbers of the garbage bags according to the generation process of the single garbage classification number in the garbage bags;

(4) garbage classification code combination and garbage classification two-dimensional code generation of certain batch of garbage bags

Identify the identity code (M) of the garbage bag₁M₂...M_kM_k+L+p+1M_k+L+p+2...M_k+L+p+n-2) Code making date (M)_{k+L+p+n- 1}M_k+L+p+n) Garbage classification number

Garbage category (M)_k+L+p+n+1M_k+L+p+n+2) Garbage classification serial number information (M)_k+L+p+n+3M_k+L+p+n+4) And combining to generate a single garbage classification Code in the garbage bags, then generating a QR Code, namely a garbage classification two-dimensional Code, and combining in batches to generate the garbage classification two-dimensional codes of the garbage bags according to the rule.

2. The garbage classification two-dimensional code batch generation method according to claim 1, characterized in that: the step (1) of converting the ID codes into numerical data one by one means that the ID codes belong to the ASCII code value [32,126 ] by adopting a unicode2native () function one by one]Converting the visible characters into single numerical data, or converting double-byte coded Chinese characters in GB2312 character set into two numerical data, thereby obtaining corresponding numerical sequence

3. The garbage classification two-dimensional code batch generation method according to claim 1, characterized in that: converting the identity hidden code into numerical data [ P ] one by one in the step (1)_i1,P_i2]The method is to adopt unicode2native () function to belong the ASCII code value to [32,126 ]]Is converted into single numerical data and recombined, denoted as P_i1,P_i2]＝[0,unicode2native(M_i)]Or converting double-byte coded Chinese characters in GB2312 character set into two numerical data, which are expressed as [ P ]_i1,P_i2]＝unicode2native(M_i) So as to obtain the high-order numerical value sequence P1 ═ { P1 ═ P1₁,P1₂,...,P1_L+p,P1_L+p+1}＝{P₁₁,P₂₁,...,P_(L+p)1,P_(L+p+1)1And low order value sequence P2 ═ P2₁,P2₂,...,P2_L+p,P2_L+p+1}＝{P₁₂,P₂₂,...,P_(L+p)2,P_(L+p+1)2}。

4. The garbage classification two-dimensional code batch generation method according to claim 1, characterized in that: the step (1) of converting the element S in the numerical sequence S_iOne by one conversion into a binary sequence of 8bits BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8Means that dec2bin (S) is used_i8) the function yields a binary sequence BS_i1,BS_i2,BS_i3,BS_i4,BS_i5,BS_i6,BS_i7,BS_i8}。

5. The garbage classification two-dimensional code batch generation method according to claim 1, characterized in that: the element P1 in the numerical value sequence P1 described in the step (1)_iOne by one into a binary sequence of 8bits BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8Means that dec2bin (P1) is used_i8) the function yields a binary sequence { BP1_i1,BP1_i2,BP1_i3,BP1_i4,BP1_i5,BP1_i6,BP1_i7,BP1_i8}。

6. The garbage classification two-dimensional code batch generation method according to claim 1, characterized in that: the element P2 in the numerical value sequence P2 described in the step (1)_iOne by one into a binary sequence of 8bits BP2_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8Means that dec2bin (P2) is used_i8) the function yields a binary sequence { BP2_i1,BP2_i2,BP2_i3,BP2_i4,BP2_i5,BP2_i6,BP2_i7,BP2_i8}。

7. The garbage classification two-dimensional code batch generation method according to claim 1, characterized in that: sequencing the values as described in step (3)

Element-by-element combination and conversion to Chinese characters means that element-by-element combination is firstly carried out [ CP1 ]_i,CP2_i]Then converted into kanji characters, i.e. C_i＝native2unicode([CP1_i,CP2_i])。

8. The garbage classification two-dimensional code batch generation method according to claim 1, characterized in that: the identification code (M) of the identity of the garbage bag in the step (4)₁M₂...M_kM_k+L+p+1M_k+L+p+2...M_k+L+p+n-2) Code making date (M)_{k+L+p+n- 1}M_k+L+p+n) Garbage classification number

Garbage category (M)_k+L+p+n+1M_k+L+p+n+2) Garbage classification serial number information (M)_k+L+p+n+3M_k+L+p+n+4) Combining to generate a single garbage classification code in the garbage bag, namely generating the single garbage classification code in the garbage bag by inserting and connecting the information of the garbage bag identity identification code, the code making date, the garbage classification number, the garbage category and the garbage classification serial number, which is expressed as M₁M₂...M_k

M_k+L+p+1M_k+L+p+2...M_{k+L+p+n- 2}M_k+L+p+n-1M_k+L+p+nM_k+L+p+n+1M_k+L+p+n+2M_k+L+p+n+3M_k+L+p+n+4Wherein M is₁M₂...M_k、

M_{k+L+p+ 1}M_k+L+p+2...M_k+L+p+n-2M_k+L+p+n-1M_k+L+p+n、M_k+L+p+n+1M_k+L+p+n+2And M_k+L+p+n+3M_k+L+p+n+4The English spaces are mutually spaced.

Images