CN107580240A - A kind of efficiently Advertisement arrangement method and system - Google Patents
A kind of efficiently Advertisement arrangement method and system Download PDFInfo
- Publication number
- CN107580240A CN107580240A CN201710817406.2A CN201710817406A CN107580240A CN 107580240 A CN107580240 A CN 107580240A CN 201710817406 A CN201710817406 A CN 201710817406A CN 107580240 A CN107580240 A CN 107580240A
- Authority
- CN
- China
- Prior art keywords
- character
- array
- advertising message
- compiled
- arrangement method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Abstract
The present invention relates to Advertisement arrangement technical field, more particularly to a kind of efficiently Advertisement arrangement method and system；Advertisement arrangement method comprises the following steps：S1：Corresponding bit array is established according to the waiting key element of system, and bit array is subjected to secondary coding, forms character array；S2：Receive the advertising message that user submits；S3：The advertising message received is compiled into corresponding bit array, and bit array secondary coding is formed into corresponding character array；S4：The character array of conversion is matched with the character array of system corresponding channel position.The present invention provides a kind of new efficient Advertisement arrangement method and system, the waiting key element of system is compiled character array by the Advertisement arrangement method and system, and the advertising message received is compiled into character array, and the character array that advertising message is compiled is matched with the character array of system, substantially reduce operand, the appearance of advertisement conflict is avoided, improves Consumer's Experience.
Description
Technical field
The present invention relates to Advertisement arrangement technical field, more particularly to a kind of efficiently Advertisement arrangement method and system.
Background technology
In EPG ad systems, it is desirable to same channel, same position, the same time can only one advertisement of layout, that
When each new advertisement of layout enters system, the Advertisement arrangement that new advertisement is vented and originally set may all clash simultaneously
Cause system data disorderly.
Patent CN102006522B discloses a kind of Advertisement arrangement method and system, and the Advertisement arrangement method and system need
Compared with the new waiting added every time is carried out once with the bit array of the corresponding channel position in waiting statistical module；But certain
The data volume of the bit array of 1 year some position is 525600, it is meant that has 525600 digits to be compared, operand still compares
It is larger, and need according to book waiting on demand, it is impossible to matched according to time span, cause Advertisement arrangement unreasonable, influence to use
Experience at family.
The content of the invention
In view of the above-mentioned problems, the present invention provides a kind of new efficient Advertisement arrangement method and system, the Advertisement arrangement method
The character of character array is matched with system, reduces operand, Advertisement arrangement is reasonable, improves Consumer's Experience.
Concrete technical scheme of the present invention is as follows：
The present invention provides a kind of efficiently Advertisement arrangement method, Advertisement arrangement method and comprised the following steps：
S1：Corresponding bit array is established according to the waiting key element of system, and bit array is subjected to secondary coding, forms character
Array；
S2：Receive the advertising message that user submits；
S3：The advertising message received is compiled into corresponding bit array, and bit array secondary coding is formed accordingly
Character array；
S4：The character array of conversion is matched with the character array of system corresponding channel position.
Further to improve, step S1 specific method is：
S11：The waiting key element of system is compiled to the bit array being made up of 1 and 0, one minute in 1 expression 1 year is occupied
With one minute in 0 expression 1 year is unoccupied；
S12：Bit array is subjected to secondary coding, forms the character array being made up of multiple characters, the identification position of character is 0
Or 1, number of bits is 0 or 1 number.
Further to improve, step S1 also comprises the following steps：
S13：Separator F is added between each character.
Further to improve, step S1 also comprises the following steps：
S14：Identifier is converted to by 0 or the 1 of each character recognition position.
Further to improve, step S3 specific method is：
S31：The advertising message received is compiled by 1 bit array formed；
S32：Bit array is subjected to secondary coding, forms the character array being made up of multiple characters, the identification position of character is
1, number of bits is 1 number；
S33：Separator F is added between each character.
Further to improve, step S4 specific method is：
S41：In the character array of system corresponding channel position, the character that identification position is 0 is picked out；
S42：The character that advertising message is compiled is matched with the character picked out in above-mentioned steps；
S43：Judge the data of the number of bits for the character that advertising message is compiled and the number of bits for the system characters picked out
Data it is whether equal, if equal, carry out step S44, if unequal, carry out step S42；
S44：In the character array for the character insertion system corresponding channel position that the advertising message is compiled.
Further to improve, Advertisement arrangement method includes also following steps：
S5：Delete advertising message.
Further to improve, step S5 includes：
S51：Select the advertising message to be deleted；
S52：Establish the character array of the advertising message to be deleted；
S53：The character bit of character array to be deleted is negated to the character bit of rear and corresponding channel position character array
Carry out logical AND operation；
S54：Advertising message corresponding to deletion.
The present invention provides a kind of efficiently Advertisement arrangement system, including the database in server and the server, described
Server includes：
Waiting management module：For establishing corresponding bit array according to the waiting key element of system, and bit array is carried out two
Secondary coding, form character array；
Receiving module：For receiving the advertising message of user's submission；
Editor module：For the advertising message received to be compiled into corresponding bit array, and by bit array secondary coding
Form corresponding character array；
Matching module：The character array of conversion is matched with the character array of system corresponding channel position.
Further to improve, the server also includes：
Removing module：For deleting advertising message.
Beneficial effects of the present invention are as follows：
The present invention provides a kind of new efficient Advertisement arrangement method and system, and the Advertisement arrangement method and system is by system
Waiting key element compiles character array, and the advertising message received is compiled into character array, and advertising message is compiled
Character array matched with the character array of system, substantially reduce operand, avoid the appearance of advertisement conflict, improve
Consumer's Experience.
Brief description of the drawings
Fig. 1 is the flow chart of efficient Advertisement arrangement method in embodiment 1；
Fig. 2 is the flow chart of step S1 in embodiment 2；
Fig. 3 is the flow chart of step S1 in embodiment 3；
Fig. 4 is the flow chart of step S3 in embodiment 4；
Fig. 5 is the flow chart of step S4 in embodiment 5；
Fig. 6 is the flow chart of step S5 in embodiment 6；
Fig. 7 is the structured flowchart of efficient Advertisement arrangement system in embodiment 7.
Embodiment
The present invention is described in further detail with following examples below in conjunction with the accompanying drawings.
Embodiment 1
The embodiment of the present invention 1 provides a kind of efficiently Advertisement arrangement method, as shown in figure 1, the Advertisement arrangement method is included such as
Lower step：
S1：Corresponding bit array is established according to the waiting key element of system, and bit array is subjected to secondary coding, forms character
Array；
S2：Receive the advertising message that user submits；
S3：The advertising message received is compiled into corresponding bit array, and bit array secondary coding is formed accordingly
Character array；
S4：The character array of conversion is matched with the character array of system corresponding channel position；
S5：Delete advertising message.
The present invention provides a kind of new efficient Advertisement arrangement method and system, and the Advertisement arrangement method and system is by system
Waiting key element compiles character array, and the advertising message received is compiled into character array, and advertising message is compiled
Character array matched with the character array of system, substantially reduce operand, avoid the appearance of advertisement conflict, improve
Consumer's Experience.
Advertising message includes waiting key element and ad material in the present invention, and waiting key element includes：Channel description, location expression
Described with the time；, it is necessary to which part advertising message is deleted after the completion of character array matching, the repeated matching of character array is avoided,
Reduce operand.
Embodiment 2
The embodiment of the present invention 2 provides a kind of efficiently Advertisement arrangement method, and this method is essentially identical with embodiment 1, different
, as shown in Fig. 2 step S1 specific method is：
S11：The waiting key element of system is compiled to the bit array being made up of 1 and 0, one minute in 1 expression 1 year is occupied
With one minute in 0 expression 1 year is unoccupied；
S12：Bit array is subjected to secondary coding, forms the character array being made up of multiple characters, the character bit of character is 0
Or 1, number of bits is 0 or 1 number；
S13：Separator F is added between each character.
Corresponding one of each bit array is with by channel information, positional information, annual from date or time in the present invention
The key value (Key) of composition, this bit array can be navigated to by this Key, each bit value in bit array represents one
Whether one minute in year is occupied, and 1 represents occupied, and 0 represents unoccupied, and the length of bit array is 1 year the number of minutes.
In the present invention character bit can in the character bit of character, can also in the last position of character, even interposition, according to
Depending on actual conditions；At least one character bit and number of bits are provided with the present embodiment, depending on actual conditions.
The waiting character of 2009 for not adding separator of the waiting bit array table of 2009, table 2 below in conjunction with table 1
The waiting character array table of 2009 of the addition separator of array list and table 3 illustrates to the embodiment.
The table waiting bit array table of 1 2009 years
Table 2 does not add the waiting character bit array list of 2009 of separator
Table 3 adds the waiting character bit array list of 2009 of separator
Wherein Sn represents some channel, and Pn represents some location advertising of the channel, and 20090101 represent 2009
From date January 1, first represent 2009 first minute of bit array, second represent second point of corresponding date
Clock, the rest may be inferred, and n is natural number, and first character 06 of the character array of the position of 2 channel 3 indicates continuous six in sequence number 6
Minute is unoccupied, and the second character 18 represents occupied by continuous eight minutes.
Character array is using character bit as character bit in table 2 and table 3, and secondary position is to illustrate exemplified by number of bits.
Each character is separated using separator F in the present invention, can also be separated each character with space, avoids and is
The disorder of data in system, it is therein such as the character array 1601218010112021401... of the position of 3 channel 1 in the sequence number 7 of table 2
01011 expression is two characters 010 and 11, but is only so seen, may regard 01 and 011 two character as, it may appear that be
The disorder for data of uniting, therefore the two characters are separated into F010 and F11 plus separator, so can be clearly by each character
Show；0 or 1 is character bit in F0n or F1n, and n is number of bits, represents 0 or 1 number, n is natural number.
The character array that advertising message is compiled can be matched with the character array of system in the present invention, be contracted significantly
Short operand, avoids the appearance of advertisement conflict.
Embodiment 3
The embodiment of the present invention 3 provides a kind of efficiently Advertisement arrangement method, and this method is essentially identical with embodiment 1, different
, as shown in figure 3, step S1 also comprises the following steps：
S11：The waiting key element of system is compiled to the bit array being made up of 1 and 0, one minute in 1 expression 1 year is occupied
With one minute in 0 expression 1 year is unoccupied；
S12：Bit array is subjected to secondary coding, forms the character array being made up of multiple characters, the character bit of character is 0
Or 1, number of bits is 0 or 1 number；
S14：Identifier is converted to by 0 or the 1 of each character recognition position.
0 or 1 are converted to identifier by the present invention, can need not so add separator, capital and small letter that identifier is 0 or 1,
Other characters such as X or Y, the disorder of system data will not also be caused by being so added without separator, can easily distinguish number of characters
Each character in group.
Below will be using X or Y as identifier, that is, identify that position illustrates exemplified by being X or Y, such as 2009 of table 4
Waiting character array table.
The table waiting character bit array list of 4 2009 years
One minute during Y is represented 1 year in character array of the present invention is occupied, and one minute during X is represented 1 year is not occupied
With.
Embodiment 4
The embodiment of the present invention 4 provides a kind of efficiently Advertisement arrangement method, and this method is essentially identical with embodiment 1, different
, as shown in figure 4, step S3 specific method is：
S31：The advertising message received is compiled by 1 bit array formed；
S32：Bit array is subjected to secondary coding, forms the character array being made up of multiple characters, the identification position of character is
1, number of bits is 1 number；
S33：Separator F is added between each character.
Advertising message is compiled by 1 character array formed in the present invention, simply the advertising programme of waiting as needed
Time span edit, such as one needs to be discharged to the advertising programme of the position 1 of channel 1, reproduction time is 8 minutes, then its digit
Group is：11111111, character array F18, so, during waiting advertising programme, it is only necessary to which the number of bits of operational character array is
Can, reduce operand.
Embodiment 5
The embodiment of the present invention 5 provides a kind of efficiently Advertisement arrangement method, and this method is essentially identical with embodiment 1, different
, as shown in figure 5, step S4 specific method is：
S41：In the character array of system corresponding channel position, the character that identification position is 0 is picked out；
S42：The character that advertising message is compiled is matched with the character picked out in above-mentioned steps；
S43：Judge the data of the number of bits for the character that advertising message is compiled and the number of bits for the system characters picked out
Data it is whether equal, if equal, carry out step S44, if unequal, carry out step S42；
S44：In the character array for the character insertion system corresponding channel position that the advertising message is compiled.
The character that advertising message is compiled is matched with the character of system corresponding channel position in the present invention, subtracted significantly
Small operand, improves Consumer's Experience；Character as character bit is 0 in the character array of the position of 2 channel 2 in the sequence number 6 of table 3 has
F06F014F021, character F16 matches with the character F06 in system characters array in the character array that advertising message is compiled,
Because number of bits is all 6, data are equal, therefore the match is successful, can insert character F16 in the character array of the position of 2 channel 2
The position corresponding with character F06；Character F114 is matched with F014, and because number of bits is all 14, data are equal, therefore
With success, character F114 can be inserted to position corresponding with character F114 in the character array of the position of 2 channel 2, if character
It is unequal with 21 for F18,18, then mismatched with F021, the character compiled for reselecting advertising message is matched, computing
Amount is few, and method is simple, greatly accelerates waiting speed.
Embodiment 6
The embodiment of the present invention 6 provides a kind of efficiently Advertisement arrangement method, and this method is essentially identical with embodiment 1, different
, as shown in fig. 6, step S5 includes：
S51：Select the advertising message to be deleted；
S52：Establish the character array of the advertising message to be deleted；
S53：The character bit of character array to be deleted is negated to the character bit of rear and corresponding channel position character array
Carry out logical AND operation；
S54：Advertising message corresponding to deletion.
, it is necessary to corresponding advertising message be deleted, remaining advertisement letter after the completion of character array matching in the present invention
Cease the character compiled to continue to match, the character not matched is had an impact this avoid the character matched；Delete
When, the computing of character bit in character array need to be only carried out, greatly reduces operand, this method is simple, easy to use.
Embodiment 7
The embodiment of the present invention 7 provides a kind of efficiently Advertisement arrangement method and system, as shown in fig. 7, comprises server 1 and institute
The database in server 1 is stated, the server 1 includes：
Waiting management module 10：For establishing corresponding bit array according to the waiting key element of system, and bit array is carried out
Secondary coding, form character array；
Receiving module 20：For receiving the advertising message of user's submission；
Editor module 30：For the advertising message received to be compiled into corresponding bit array, and by the secondary volume of bit array
Code forms corresponding character array；
Matching module 40：The character array of conversion and the character array of system corresponding channel position are entered according to time span
Row matching；
Removing module 50：For deleting advertising message.
A kind of new efficient Advertisement arrangement method and system of the present invention, the search management system and method are by the waiting of system
Key element compiles character array, and the advertising message received is compiled into character array, and the word that advertising message is compiled
Symbol array is matched with the character array of system according to time span, is substantially reduced operand, is avoided advertisement conflict
Occur, improve Consumer's Experience.
Embodiment described above is only that the preferred embodiment of the present invention is described, and not the scope of the present invention is entered
Row limits, and on the premise of design spirit of the present invention is not departed from, those of ordinary skill in the art make to technical scheme
The various modifications gone out and improvement, it all should fall into the protection domain of claims of the present invention determination.
Claims (10)
- A kind of 1. efficiently Advertisement arrangement method, it is characterised in that Advertisement arrangement method comprises the following steps：S1：Corresponding bit array is established according to the waiting key element of system, and bit array is subjected to secondary coding, forms number of characters Group；S2：Receive the advertising message that user submits；S3：The advertising message received is compiled into corresponding bit array, and bit array secondary coding is formed into corresponding character Array；S4：The character array of conversion is matched with the character array of system corresponding channel position.
- 2. efficiently Advertisement arrangement method according to claim 1, it is characterised in that step S1 specific method is：S11：The waiting key element of system is compiled to the bit array being made up of 1 and 0, one minute in 1 expression 1 year is occupied, and 0 One minute in representing 1 year is unoccupied；S12：Bit array is subjected to secondary coding, forms the character array being made up of multiple characters, the identification position of character is 0 or 1, Number of bits is 0 or 1 number.
- 3. efficiently Advertisement arrangement method according to claim 1, it is characterised in that step S1 also comprises the following steps：S13：Separator F is added between each character.
- 4. efficiently Advertisement arrangement method according to claim 1, it is characterised in that step S1 also comprises the following steps：S14：Identifier is converted to by 0 or the 1 of each character recognition position.
- 5. efficiently Advertisement arrangement method according to claim 1, it is characterised in that step S3 specific method is：S31：The advertising message received is compiled by 1 bit array formed；S32：Bit array is subjected to secondary coding, forms the character array being made up of multiple characters, the identification position of character is 1, number Measure the number that position is 1；S33：Separator F is added between each character.
- 6. efficiently Advertisement arrangement method according to claim 1, it is characterised in that step S4 specific method is：S41：In the character array of system corresponding channel position, the character that identification position is 0 is picked out；S42：The character that advertising message is compiled is matched with the character picked out in above-mentioned steps；S43：Judge the number of the data of the number of bits for the character that advertising message is compiled and the number of bits for the system characters picked out According to whether equal, if equal, step S44 is carried out, if unequal, carries out step S42；S44：In the character array for the character insertion system corresponding channel position that the advertising message is compiled.
- 7. efficiently Advertisement arrangement method according to claim 1, it is characterised in that Advertisement arrangement method includes also following step Suddenly：S5：Delete advertising message.
- 8. efficiently Advertisement arrangement method according to claim 1, it is characterised in that step S5 includes：S51：Select the advertising message to be deleted；S52：Establish the character array of the advertising message to be deleted；S53：The character bit that the character bit of character array to be deleted is negated to rear and corresponding channel position character array is carried out Logical AND operates；S54：Advertising message corresponding to deletion.
- A kind of 9. efficiently Advertisement arrangement system, it is characterised in that including the database in server (1) and the server (1), The server (1) includes：Waiting management module (10)：For establishing corresponding bit array according to the waiting key element of system, and bit array is carried out two Secondary coding, form character array；Receiving module (20)：For receiving the advertising message of user's submission；Editor module (30)：For the advertising message received to be compiled into corresponding bit array, and by bit array secondary coding Form corresponding character array；Matching module (40)：The character array of conversion is matched with the character array of system corresponding channel position.
- 10. efficiently Advertisement arrangement system according to claim 9, it is characterised in that the server (1) also includes：Removing module (50)：For deleting advertising message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710817406.2A CN107580240B (en) | 2017-09-12 | 2017-09-12 | A kind of efficient Advertisement arrangement method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710817406.2A CN107580240B (en) | 2017-09-12 | 2017-09-12 | A kind of efficient Advertisement arrangement method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107580240A true CN107580240A (en) | 2018-01-12 |
| CN107580240B CN107580240B (en) | 2019-06-28 |
Family
ID=61033108
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710817406.2A Active CN107580240B (en) | 2017-09-12 | 2017-09-12 | A kind of efficient Advertisement arrangement method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107580240B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020069404A1 (en) * | 2000-11-28 | 2002-06-06 | Navic Systems, Incorporated | Targeted promotion deployment |
| CN101727638A (en) * | 2009-11-13 | 2010-06-09 | 深圳市同洲电子股份有限公司 | Advertisement scheduling method and device and advertisement system |
| CN102004997A (en) * | 2010-11-25 | 2011-04-06 | 深圳市同洲电子股份有限公司 | Advertisement broadcasting method and related system |
| CN102006522A (en) * | 2010-11-04 | 2011-04-06 | 深圳市同洲电子股份有限公司 | Advertisement scheduling method and system |
| CN102542438A (en) * | 2011-12-31 | 2012-07-04 | 北京亿赞普网络技术有限公司 | Network advertising serving scheduling system and scheduling method |
| CN105025336A (en) * | 2015-06-30 | 2015-11-04 | 广州西维尔计算机系统有限公司 | Intelligent visual advertisement scheduling method and system |
| CN105869383A (en) * | 2016-04-13 | 2016-08-17 | 北京精益理想科技有限公司 | Infrared data processing method, infrared instruction calling method and infrared instruction calling system |
-
2017
- 2017-09-12 CN CN201710817406.2A patent/CN107580240B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020069404A1 (en) * | 2000-11-28 | 2002-06-06 | Navic Systems, Incorporated | Targeted promotion deployment |
| CN101727638A (en) * | 2009-11-13 | 2010-06-09 | 深圳市同洲电子股份有限公司 | Advertisement scheduling method and device and advertisement system |
| CN102006522A (en) * | 2010-11-04 | 2011-04-06 | 深圳市同洲电子股份有限公司 | Advertisement scheduling method and system |
| CN102004997A (en) * | 2010-11-25 | 2011-04-06 | 深圳市同洲电子股份有限公司 | Advertisement broadcasting method and related system |
| CN102542438A (en) * | 2011-12-31 | 2012-07-04 | 北京亿赞普网络技术有限公司 | Network advertising serving scheduling system and scheduling method |
| CN105025336A (en) * | 2015-06-30 | 2015-11-04 | 广州西维尔计算机系统有限公司 | Intelligent visual advertisement scheduling method and system |
| CN105869383A (en) * | 2016-04-13 | 2016-08-17 | 北京精益理想科技有限公司 | Infrared data processing method, infrared instruction calling method and infrared instruction calling system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107580240B (en) | 2019-06-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5875263A (en) | Non-edit multiple image font processing of records | |
| EP0752673B1 (en) | Information processing method and apparatus for searching image or text information | |
| US6507678B2 (en) | Apparatus and method for retrieving character string based on classification of character | |
| CN107609356B (en) | Text carrier-free information hiding method based on label model | |
| JPH10207912A (en) | Method for retrieving character and character string and recording medium to be used for the same | |
| CN107633081A (en) | A kind of querying method and system of user profile of breaking one's promise | |
| CN101159704A (en) | Microcontent similarity based antirubbish method | |
| CN101558405A (en) | Migration apparatus which convert database of mainframe system into database of open system and method for thereof | |
| CN101751430A (en) | Electronic dictionary fuzzy searching method | |
| CN107153469B (en) | Method for searching input data for matching candidate items, database creation method, database creation device and computer program product | |
| CN113127621A (en) | Dialogue module pushing method, device, equipment and storage medium | |
| CN115116082B (en) | One-key gear system based on OCR (optical character recognition) algorithm | |
| CN109284362B (en) | Content retrieval method and system | |
| CN110825919B (en) | ID data processing method and device | |
| CN113704406A (en) | Chinese paraphrase matching system and method for popular abbreviations | |
| JP2009098952A (en) | Information retrieval system | |
| US7076423B2 (en) | Coding and storage of phonetical characteristics of strings | |
| CN107580240A (en) | A kind of efficiently Advertisement arrangement method and system | |
| CN112784585A (en) | Abstract extraction method and terminal for financial bulletin | |
| Belaïd et al. | Morphological tagging approach in document analysis of invoices | |
| JP2003505770A (en) | Method for forming and / or updating a dictionary for automatic address reading | |
| CN111723142A (en) | Data processing method and device | |
| CN102841988A (en) | System and method for matching nucleotide sequence information | |
| CN110245215B (en) | Text retrieval method and device | |
| US20050154703A1 (en) | Information partitioning apparatus, information partitioning method and information partitioning program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: An efficient advertisement scheduling method and system Effective date of registration: 20210622 Granted publication date: 20190628 Pledgee: Beijing culture science and technology financing Company limited by guarantee Pledgor: CBC CLOUD TECHNOLOGY Co.,Ltd. Registration number: Y2021980005035 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |