CN114337681A - A Compression Algorithm for Handling Multiple Time Limits - Google Patents

Abstract

The invention provides a compression algorithm for processing multiple time interval limitation, which comprises the following steps: s1, initializing a numerical value field; s2, defining the year, month and day of consumption as a sub-domain A, the remaining number of consumption available per month as a sub-domain B, the remaining number of consumption available per day as a sub-domain C, the maximum number of consumption available per month as Max B and the maximum number of consumption available per day as Max A; s3, selecting factors b and c; s4, performing negation operation on the subdomain A, and defining the subdomain A as a subdomain A1; s5, performing compression calculation to obtain a numerical value X, and storing the numerical value X; s6, decomposing the inverse operation of the numerical value X to obtain a subdomain A, B, C; and S7, the consumption end judges the consumption result according to the obtained subdomains A, B and C. The invention does not need to carry out additional recharging or reinitialization operation every month, thereby reducing the operation, facilitating the user on one hand, saving the handling business for handling cards in the handling center every month, reducing the crowd gathering in handling cards in the handling center on the other hand, and reducing the workload of workers.

Description

A Compression Algorithm for Handling Multiple Time Limits

technical field

The invention belongs to the field of computer technology, and in particular relates to a compression algorithm for processing multiple time period restrictions.

Background technique

At present, the relevant state departments have clearly proposed to promote the aging-friendly transformation of Internet applications, eliminate the "digital divide" of the elderly, and speed up the "aging-friendly" reform, which can make the life of the elderly simpler, more convenient, and smarter. It is also a "sunset industry", which is conducive to Stimulating consumption and expanding domestic demand is a win-win move;

Electronic tickets in the form of IC cards are suitable for financial consumption in an offline state, and do not require high real-time networking for processing IC card financial payment terminals, so they are generally applicable to bus, subway, light rail, park tickets and other application scenarios; In order to improve user stickiness for special user groups represented by the elderly, many public application fields have introduced policies such as preferential tickets, but the merchants providing such preferential products have also imposed certain restrictions on preferential tickets in order to balance the interests of both parties. Measures: For example, a limit of 4 times a day and a limit of 100 times a month is proposed, but users need to go to the handling center to handle the recharge business on a regular basis. Time-limited compression algorithm.

SUMMARY OF THE INVENTION

In view of this, the present invention aims to propose a compression algorithm for processing multiple time limit, so as to solve the problem that special groups need to regularly go to the handling center to handle the recharge business.

In order to achieve the above object, the technical scheme of the present invention is achieved in this way:

A compression algorithm for processing multiple time-period restrictions, comprising the following steps: S1, initializing a numerical field, so that it decreases monotonically according to consumption rules;

S2. Define the consumption year, month and day as subdomain A, the monthly available remaining consumption times as subdomain B, the daily available remaining consumption times as subdomain C, the monthly maximum available consumption times as Max B and the daily maximum available consumption times is Max A;

S3. Select factors b and c, the value of factor b and c are positive integers, the value of factor b is greater than Max B, and the value of factor c is greater than Max C;

S4, perform an inversion operation on the subfield A in step S2, and define it as subfield A1;

S5, carry out compression calculation through the parameters obtained in step S2, step S3 and step S4, obtain numerical value X, and store numerical value X;

S6, decompose the inverse operation of the numerical value X to obtain subfield A, subfield B, and subfield C;

S7, the consumer judges the consumption result according to the acquired subdomain A, subdomain B, and subdomain C.

Further, the compression calculation algorithm of step S5 is X=A1*b*c+B*c+C.

Further, in step S6, the inverse operation of the numerical value X is decomposed, and the specific method is:

The factor c takes the remainder operation on the value X to obtain the subfield C;

The factor c rounds the value X to obtain the value Y;

The factor b takes the remainder operation on the value Y to obtain the subfield B;

The factor b rounds the value Y to obtain the subfield A1;

Subdomain A1 performs the negation operation to obtain subdomain A.

Further, step S7 specifically includes the following steps:

S71, the consumer judges whether the sub-domain A is the current year, month, and day; if it is the current year, month, and day, jump to step S73; if it is not the current year, month, and day, proceed to step S72;

S72, set subfield A2 as the current year, month and date, subfield B2=Max B, and subfield C2=Max C;

S73, determine whether the sub-field B is greater than 0, and whether the sub-field C is greater than 0; if the conditions are met, proceed to the next step; if the conditions are not met, jump to step S75;

S74. Subdomain B2 and subdomain C2 are subtracted by 1, and consumption is allowed;

S75. The consumption restriction condition is met, and the consumption is rejected.

Compared with the prior art, the compression algorithm for processing multiple time period restrictions described in the present invention has the following beneficial effects:

(1) The compression algorithm described in the present invention for processing multiple time-period restrictions is a monotonically decreasing operation, which eliminates the need to perform additional recharge or re-initialization operations every month. Reducing this operation is convenient for users on the one hand, and saves the need for monthly The card office of the acceptance center handles business, on the other hand, it reduces the crowd gathering in the acceptance center office and reduces the workload of the staff;

(2) According to the compression algorithm for processing multiple time period restrictions, the consumption terminal can limit the daily and monthly consumption times of users by performing consumption processing according to the rules, which balances the balance of interests between users and merchants, and can better To complete the cultivation of users' travel habits and expand the user's consumer group;

(3) The compression algorithm for processing multiple time-period restrictions described in the present invention can be applied to various application scenarios such as bus, subway, park, canteen, movie ticket, membership ticket, etc., and has great promotion value.

Description of drawings

The accompanying drawings constituting a part of the present invention are used to provide further understanding of the present invention, and the exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the attached image:

Fig. 1 is the transaction flow chart of using a compression algorithm for processing multiple time limit according to an embodiment of the present invention;

FIG. 2 is an interface diagram of a small program of the YYMMDD compression and decompression converter according to an embodiment of the present invention.

Detailed ways

It should be noted that the embodiments of the present invention and the features of the embodiments may be combined with each other under the condition of no conflict.

In the description of the present invention, it should be understood that the terms "center", "portrait", "horizontal", "top", "bottom", "front", "rear", "left", "right", " The orientation or positional relationship indicated by vertical, horizontal, top, bottom, inner, outer, etc. is based on the orientation or positional relationship shown in the drawings, and is only for the convenience of describing the present invention and The description is simplified rather than indicating or implying that the device or element referred to must have a particular orientation, be constructed and operate in a particular orientation, and therefore should not be construed as limiting the invention. In addition, the terms "first", "second", etc. are used for descriptive purposes only, and should not be construed as indicating or implying relative importance or implying the number of indicated technical features. Thus, a feature defined as "first", "second", etc., may expressly or implicitly include one or more of that feature. In the description of the present invention, unless otherwise specified, "plurality" means two or more.

In the description of the present invention, it should be noted that the terms "installed", "connected" and "connected" should be understood in a broad sense, unless otherwise expressly specified and limited, for example, it may be a fixed connection or a detachable connection Connection, or integral connection; can be mechanical connection, can also be electrical connection; can be directly connected, can also be indirectly connected through an intermediate medium, can be internal communication between two elements. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood through specific situations.

The present invention will be described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.

A compression algorithm for processing multiple time-period restrictions, comprising the following steps: S1, initializing a numerical field, so that it decreases monotonically according to consumption rules;

S2. Define the consumption year, month and day as subdomain A, the monthly available remaining consumption times as subdomain B, the daily available remaining consumption times as subdomain C, the monthly maximum available consumption times as Max B and the daily maximum available consumption times is Max A;

S3. Select factors b and c, the value of factor b and c are positive integers, the value of factor b is greater than Max B, and the value of factor c is greater than Max C;

S4. Perform an inversion operation on the subfield A in step S2, which is defined as subfield A1; since the consumption year, month, and day values are monotonically increasing according to the natural law, through the inversion operation, the value is monotonically decreasing, and the remaining consumption per month is available. The values of the number of times and the daily available remaining consumption times are monotonically decreasing, and the combination of the three monotonically decreasing subfield values ensures the monotonically decreasing characteristics of the consumption terminal;

S5, carry out compression calculation through the parameters obtained in step S2, step S3 and step S4, obtain numerical value X, and store numerical value X;

S6, decompose the inverse operation of the numerical value X to obtain subfield A, subfield B, and subfield C;

S7, the consumer judges the consumption result according to the acquired subdomain A, subdomain B, and subdomain C.

The compression calculation algorithm of step S5 is X=A1*b*c+B*c+C.

In step S6, the inverse operation of the numerical value X is decomposed, and the specific method is:

The factor c takes the remainder operation on the value X to obtain the subfield C;

The factor c rounds the value X to obtain the value Y;

The factor b takes the remainder operation on the value Y to obtain the subfield B;

The factor b rounds the value Y to obtain the subfield A1;

Subdomain A1 performs the negation operation to obtain subdomain A.

Step S7 specifically includes the following steps:

S71, the consumer judges whether the sub-domain A is the current year, month, and day; if it is the current year, month, and day, jump to step S73; if it is not the current year, month, and day, proceed to step S72;

S72, set subfield A2 as the current year, month and date, subfield B2=Max B, and subfield C2=Max C;

S73, determine whether the sub-field B is greater than 0, and whether the sub-field C is greater than 0; if the conditions are met, proceed to the next step; if the conditions are not met, jump to step S75;

S74. Subdomain B2 and subdomain C2 are subtracted by 1, and consumption is allowed;

S75. The consumption restriction condition is met, and the consumption is rejected;

S75 If consumption allows, compress the adjusted sub-domain A2, sub-domain B2 and sub-domain C2, calculate a new value X, and write it into the encryption-side IC card.

As shown in FIG. 1, the overall transaction process of applying the compression algorithm in the embodiment is as follows:

K1. In the equipment management system, according to the compression algorithm, the information fields such as factor b, factor c, Max B and Max C are sent to the vehicle-mounted card machine through wireless downloading;

K2. The passenger presents the certificate and applies for a special consumption card to the customer service center;

K3. The customer service center starts to make cards, and writes the X compressed from the three groups of information fields of the consumption year, month and day A, the monthly available remaining consumption times B and the daily available remaining consumption times C into the IC card according to the compression algorithm;

K4. The customer service center completes the paper card;

K5. Passengers complete card collection;

K6. When passengers are on the bus, use a special consumption card to swipe the card at the card machine for consumption;

K7. The card machine reads the X value in the IC card, calculates the values of subfield A, subfield B and subfield C according to the inverse operation of the compression algorithm, and verifies whether the IC card consumption is allowed according to the rules;

K8. After the verification is passed, the passenger will be prompted that the consumption is successful; if the verification is not passed, the passenger will be prompted to put in coins.

As shown in the following table, taking some values as an example, select b=16, c=32, the value is 4 bytes, a total of 8 nibbles, 32 bits;

31-28 27-12 11-4 3-0 0 INV_YMD YYC DDC

YYC: Monthly limit, 60, maximum 255.

DDC: Daily limit, 4, max 15.

YY: Year with lower 2 digits, hexadecimal number.

MM: month, hexadecimal number.

DD: day, hexadecimal number.

INV_YMD:=0xFFFF-(DD+32*((MM+16*(YY))))

where DD+32*((MM+16*(YY)))=YY*16*32+MM*32+DD,

<=99*16*32+12*32+31=51103=C79F;

After the above program design, an interface as shown in Figure 2 is formed (year month day compression and decompression converter applet).

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included in the scope of the present invention. within the scope of protection.

Claims (4)

1. A compression algorithm that handles multiple time interval constraints, comprising the steps of: s1, initializing a numerical value field, and enabling the numerical value field to be monotonically decreased according to a consumption rule;

s2, defining the year, month and day of consumption as a sub-domain A, the remaining number of consumption available per month as a sub-domain B, the remaining number of consumption available per day as a sub-domain C, the maximum number of consumption available per month as Max B and the maximum number of consumption available per day as Max A;

s3, selecting factors B and C, wherein the numerical values of the factors B and C are positive integers, the numerical value of the factor B is larger than Max B, and the numerical value of the factor C is larger than Max C;

s4, performing inversion operation on the subfield A in the step S2 to define the subfield A as a subfield A1;

s5, performing compression calculation through the parameters obtained in the steps S2, S3 and S4 to obtain a value X, and storing the value X;

s6, decomposing the numerical value X in an inverse operation manner to obtain a sub-field A, a sub-field B and a sub-field C;

and S7, the consumption end judges the consumption result according to the obtained subdomain A, the subdomain B and the subdomain C.

2. A compression algorithm for handling multiple temporal limits as claimed in claim 1, characterized in that: the compression calculation algorithm of step S5 is X ═ a1 × B × C + C.

3. A compression algorithm for handling multiple temporal limits as claimed in claim 1, characterized in that: in step S6, the inverse operation of the value X is decomposed, and the specific method is as follows:

the factor C carries out remainder operation on the numerical value X to obtain a subdomain C;

the factor c carries out integer operation on the numerical value X to obtain a numerical value Y;

the factor B carries out remainder operation on the value Y to obtain a sub-field B;

the factor b carries out integer operation on the value Y to obtain a subdomain A1;

subfield A1 performs the inversion operation to obtain subfield A.

4. The compression algorithm for handling multiple time interval limitation as claimed in claim 1, wherein the step S7 comprises the following steps:

s71, the consumer side judges whether the subdomain A is the current year, month and day; if the current year, month and day is reached, jumping to step S73; if not, go to step S72;

s72, setting the sub-field a2 as the current year, month and day, the sub-field B2 being Max B, and the sub-field C2 being Max C;

s73, judging whether the sub-field B is larger than 0 and whether the sub-field C is larger than 0; if the conditions are met, the next step is carried out; if the condition is not met, jumping to step S75;

s74, subfield B2, subfield C2 subtract 1 operation, consumption allows;

and S75, if the consumption limiting condition is met, refusing consumption.

Images