CN101069197A - Method of marking and apparatus - Google Patents
Method of marking and apparatus Download PDFInfo
- Publication number
- CN101069197A CN101069197A CNA2005800312515A CN200580031251A CN101069197A CN 101069197 A CN101069197 A CN 101069197A CN A2005800312515 A CNA2005800312515 A CN A2005800312515A CN 200580031251 A CN200580031251 A CN 200580031251A CN 101069197 A CN101069197 A CN 101069197A
- Authority
- CN
- China
- Prior art keywords
- code
- packing
- algorithm
- layering
- level
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07F—COIN-FREED OR LIKE APPARATUS
- G07F7/00—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus
Abstract
A method of marking packaged articles, in which the articles are packaged in packaging hierarchy, is disclosed. The method comprises generating a top-level code to be applied to a unit of packaging, such as a pallet, in the largest level of the packaging hierarchy. For each unit of packaging in the second-highest level, a code is generated to be applied to that unit of packaging, the codes being derived algorithmically from t top-level code. The second step may be repeated, whereby codes for a third-level package may be generated algorithmically from the code of the next-highest level package within which it is contained, and so on for further levels.
Description
The method of inspection that the present invention relates to the method for mark, the equipment that is used for mark, the goods that has been labeled and be used for the relation between the test package layering products to be packaged.
The fabricator of product wishes can enough their products of authentication code mark and their packing.These can help tracking of products and trace, and " parallel import " or the fake products of auxiliary prevention and test example such as product.
In order to realize these targets, can be with authentication code to product and pack and carry out mark.These codes can be with the form simple application of (for example) sequence number.The shortcoming of these methods is that the adulterator predicts easily, so the adulterator forges easily.In addition, for a large amount of products, the enormous amount of the code that is produced.Each code must be stored in the management database, and this means large-scale fabricator's storage and manage suitable lot of data.
The other shortcoming of this method is that for the fabricator, the Code Number that is stored in the database is represented security risk.If the safety of database suffers damage, the adulterator can be applied to effective code their product, perhaps false code is inserted in the authentication database.
In order to address these problems, determined disposal route, particularly the disposal route of describing among the WO 00/2395.This disposal route produces a large amount of codes, and it does not need to be stored in the database after using on product or packing.
Give an example, factory produces bulb on production line.The external packing of packing into of each bulb, and 30 external packings outer canister of packing into suppose that 20 canister are contained on the tray.
In this example, for each bulb of unique identification, and the identifier of record bulb packing external packing of placing and the tray that loads and transports bulb, need to produce, use and store many codes (suppose that the random number with unique is applied to the packing of each grade, and do not have code to be applied to bulb self).In addition, the end user readable and/or machine-readable code (for example bar code), code be applied at the starting point place of production line usually the packing.The next one of this bar code on production line collected and encoded point uses, and wherein, scanning is applied to the first tag entry destination code, and is recorded in the database.The code that is write down then is associated with the volume code that is applied to time packing etc. in database, up to the product of all grades or packing all has been labeled and all data are recorded.
Table 1 shows the quantity of the code of each required in exemplary type.
Table 1
| Project | Data recording | Remarks |
| The external packing code | 600 | (20 casees * 30 bulb) |
| The | 20 | One in each chest on the tray |
| The tray code | 1 |
In addition, need record safeguard following relation: which bulb which chest of packing into, which tray which chest belongs to.Required extra data are as shown in table 2.
Table 2
| Relation | Data recording |
| Bulb/outsourcing installs to chest | 600 |
| Canister is to tray | 20 |
This total memory capacity that needs is (600+20+1+600+20)=1241 record.
In addition, production line need be applied to code first project (external packing), then at the point of packing canister, code scans is advanced database.Because analyzing spot not only costliness but also unreliable (especially when higher production) be not so wish with them from the product line restore data.Fig. 1 schematic diagram this scheme of labelling, handles and to carry out, and the quantity of quoting only is example along downward direction.
The purpose of this invention provide a kind of safe, compare the known system that marks and need lower memory capacity and do not need, and the equipment that enables this method from the method for the marked product of production line scan-data.
According to first aspect, this invention provides a kind of method of mark connection with wrapping of piece, and wherein these article are packaged in the packing layering, and this method comprises: (a.) produce the top code that the highest packaging unit that is labeled in the level of described packing layering is used; And, produce next highest code (b.) at each packaging unit in next the highest packing level of wanting mark, wherein said time next highest code obtains from described top code according to algorithm.
The highest be labeled packing level be comprise all low be labeled the packing level be labeled the packing level.
Therefore, needn't store the data of the relation between the code of adjacent level of identification layering.In order to determine to be labeled in the higher grade packaged unit whether article be comprised in correct labeling, only need to check that marking whether on the article can obtain by use algorithm on the mark on the higher grade packaged unit.The record that algorithm is used to produce than low level code is saved.Best, top code also is stored in the storage arrangement so that use in checkout procedure.
This method is specially adapted to controlled packing and handles.Goods stream was predictable basically during controlled packing was handled, and made, for example arrived package station from the goods at mark station identical order when leaving the mark station with them basically.
This method may further include, at each packaging unit in the next stage of wanting mark, produce the next stage code being applied to this packaging unit, this code is from the higher level code acquisition of the more senior unit that is applied to will pack in it this unit according to algorithm.Can be for all are labeled level and repeat this step in the packing layering.This expands to this method the darker level in the packing layering effectively.
Code can utilize cryptographic algorithm to produce.In a preferred embodiment, cryptographic algorithm is reversible.This allows to obtain source code from the encrypted code that is marked on the packaging unit.
The denotation token of representing one or more codes (each code in the level of layering usually) is applied to code dependent packaging unit usually.These can be people's readable (for example, letter and number) and/or machine-readable (for example, bar code).Perhaps, the data of expression code can be stored in the storage arrangement related with product, for example, and in radio-frequency (RF) tag.Best, the code that is produced is stored in the scratchpad memory device so that be applied to product or connection with wrapping of piece, for example by at least one printer.
Best, before top code was applied to its connection with wrapping of piece, each next highest code was applied to its connection with wrapping of piece.For example, in a preferred embodiment, code can be according to being applied to product or connection with wrapping of piece with their by the order of the reversed in order that obtained, from the minimum packing level that is labeled, and is labeled the end of packing level with the highest.
In order to make system safer, the version of encrypted packaging code can be applied to connection with wrapping of piece.
In a preferred embodiment, next highest code obtains from top code and secret recognition data according to algorithm.For example, private data can be manufacturing time, item number or other unique data.In this embodiment, comprise that the top code and the data set of the private data that is associated are stored in the storage arrangement.Private data can comprise at least one private data group (for example, manufacturing time), and preferably includes a plurality of private data groups (for example, manufacturing time and item number).The next stage code is to obtain from higher level code and the secret verify data that is applied to more senior unit according to algorithm, and wherein this unit is packaged in more senior unit.Each higher level code and the secret recognition data that is associated are stored in the storage arrangement.
Advantageously, can use the algorithm different algorithm used to produce the code of next stage with producing the prime code.
According to second aspect, the invention provides the article of a plurality of layering packings, comprise top packing and one or more more rudimentary, each is more rudimentary to comprise a plurality of packings, wherein code is associated with each packing, wherein more rudimentary at each, the code of each packing is to obtain according to the higher grade packaged code that algorithm comprises it in it.
According to the third aspect, the invention provides the method that a kind of packing is labeled article, wherein article are packaged in the packing layering, and this method comprises: (a.) pack according to the said method mark; And each unit of the more rudimentary packing that (b.) will be associated according to the highest packing of algorithm and next this packing of packing into.
Each unit that preferably will be more rudimentary next highest packing of packing into comprises connection with wrapping of piece the moving from the mark station to package station that control is labeled, and the order that makes order that article arrive package station and them leave the mark station is identical.
According to fourth aspect, the invention provides a kind of equipment that is used for the mark connection with wrapping of piece, wherein article are packaged in the packing layering, and this equipment comprises: (a.) produce and be applied to pack the highest device that is labeled the top code of the packaging unit in the level of layering; And, produce the device of next highest code (b.) at each packaging unit in next the highest packing level of mark, wherein next highest code obtains from top code according to algorithm.
For example, the device that produces top code and next highest code can comprise computer system, this computer system comprise computing machine such as the permanent data storage device that is stored in the database on the hard disk drive and such as the temporary transient data memory devices of random access storage device.
Advantageously, described equipment comprises and produces the next stage code at each packaging unit in the next stage of wanting mark being applied to the device of packaging unit, and the next stage code is to obtain from the higher level code that is applied to its inner packing and changes the more senior unit of unit according to algorithm.Preferably this equipment is provided for all are labeled level and repeat this in the packing layering.
Advantageously, this equipment can comprise the label of print system code be applied to connection with wrapping of piece, product or wherein use.Preferably, code is being sent to print system so that be stored in the scratchpad memory device before being applied to pack level.
Preferably, this print system is provided to code make the lowermost level code at first be employed, and highest code to be employed at last according to being applied to connection with wrapping of piece with the order of their obtained reversed in order.
Advantageously, permanent memory device is provided to stored record, and wherein private data is associated with special code.
Advantageously, this equipment can comprise the inspection module that is provided with the relation between the products to be packaged in the test package layering.
According to the 5th aspect, the invention provides the method for inspection that is used for the relation between the test package layering products to be packaged, it comprises the products to be packaged of utilization according to the method mark of said method, whether and this method of inspection comprises that the applied cryptography test is applied in the relation between the code not at the same level of packing layering with foundation, relevant to determine different packing levels.
For example, this method can comprise by the algorithm that has been used to the relation between the subsequent packages code level that limits before packaging code is input to makes comparisons the packaging code on the products to be packaged and next superlative degree or next lowermost level packaging code, thereby obtains the check code that at least one can be the highest with next or next minimum packaging code compares.
In one embodiment, packaging code is used to position the record in the storage arrangement that comprises the secret recognition data at first, and wherein secret recognition data and packaging code are imported into algorithm to obtain at least one check code.
To and specifically describe embodiments of the invention with reference to the accompanying drawings by example now, wherein:
Fig. 1 is the process flow diagram of the above-mentioned traditional labeling process of diagram;
Fig. 2 is the process flow diagram of diagram according to the labeling process of the first embodiment of the present invention;
Fig. 3 is the labeling process synoptic diagram according to the first embodiment of the present invention;
Fig. 4-6 shows respectively and forms the packing of product (external packing), canister and the tray that is fit to the packing layering of use in the present invention; And
Fig. 7 is the synoptic diagram of labeling process according to a second embodiment of the present invention.
Fig. 2 and Fig. 3 illustrate the step according to the labeling process of the first embodiment of the present invention.Based on the understanding to the relation between product and its packing layering, Code Number is applied to the goods of layering packing, to alleviate the problem of aforesaid known method.In the layering packaging scheme, product is loaded into the packing of product 10 (referring to Fig. 4).A plurality of packings of product 10 can then be assembled into set, and it for example then is loaded in the canister 12 (referring to Fig. 5).A plurality of canister 12 are followed assembled and further are loaded in the shelf 14 on the tray 16 for example (referring to Fig. 6), up to certain maximum level.Layering can comprise from two-stage to any maximum level.
Begin to scan production run-be tray from demand, the terminal point of process might be predicted the coded message for production run.
The packaging scheme example of describing with reference to figure 1 above looking back (each bulb 10, three ten external packings of external packing outer canister 12 of packing into of packing into, and 20 canister 12 are contained on the tray 16), present process is from tray 16.Preferably, a data recording that is used for tray code 20 is stored in permanent storage 18, as Computer Database.Tray code 20 is unique for tray 16, and can be for example random number, pseudo random number, volume code or text, and it is in some way as order number, production quantity or manufacturing time and relevant with product.
Then, produce other code 26 by on tray code 20, using irreversible cryptographic algorithm 24 in 20 secondary package (canister 12) each.For example, can use data encryption standards (DES) algorithm.Can use the reversible algorithm of any adequate types, what comprise that those need encryption key does not need encryption key with those.These 20 canister codes 26 are stored in the scratchpad memory 22.The record that only needs canister code 26 has been applied to canister 12 up to canister code 26.Each canister code after this, no longer needs the record of canister code 26, because can obtain from tray code 20 by reversible algorithm.
Then, in 30 external packings 10 in each canister 12 each,, canister code 26 produces other code 28 (600 altogether) by being used irreversible cryptographic algorithms 30.This algorithm can be used with producing the canister code algorithm identical, although preferably differently use it.For example, if reversible algorithm uses key, can use different keys so.Perhaps, can use different irreversible cryptographic algorithms.External packing code 28 is stored in the scratchpad memory 22, has been applied to external packing 10 up to them.After this, no longer need the record of external packing code 28, because each external packing code can obtain from tray 20 by reversible algorithm 24,30.
It should be noted that described process begins when limit to need producing maximum packaged unit.In this example, be exactly when determine to need producing tray 16, but actual can be before producing beginning.When code was assembled with the order that is fit to packaging process, they were applied to packaging unit.For example, they can be printed in the external packing 10, perhaps are included on the label 32, with sign canister 12 or tray 16.Alternatively, perhaps additionally, code can be compiled code with memory storage that packaging unit is associated in, as radio-frequency (RF) tag 34.Best, code is applied to packing in the opposite direction according to the side with its generation code,, packs (being tray 16 in this example) from lowermost level packing (being external packing 10 this example) to the superlative degree that is.
30 external packings 10 with the code that obtains according to specific canister are through arrangement and be loaded into this canister 12.Repeat this process at each canister 12.Then, have 20 canister 12 of the code that obtains according to tray code 20 through putting in order and being loaded onto on the tray 16.Be preferably in control mark process between mark station and the package station, make the packaging unit that is labeled according to leaving the identical order arrival package station of order at mark station with them.This can make more rudimentary connection with wrapping of piece put in order easily and the higher grade packaged article relevant of packing into them in.Best, at whenever grade packaged, between mark station and package station, control logistics.
Code is after being applied to packing, and they are deleted from scratchpad memory 22.
It is because the authentication code that is applied to each is close code-type ground according to the code acquisition of the packing that is applied to comprise in it this that this process can be worked.Therefore, by the applied cryptography test, determine easily whether this should be from the packing that it is provided in it.In this model, needn't store those and make record code associated with each other in the Different Package level, yet, need to preserve the used algorithm of every grade of code of relevant generation and the record of the progression in the layering.Whether encrypt relation is enough to produce evidence, relevant to prove two codes.Best, storage tray code 20 is to use in checkout procedure subsequently.Known tray code 20 and produced the algorithm used, can produce all than low level code than low level code.
In the packing layering, there is the other packing level that is not labeled.If maintenance has packing to concern that the present invention will still can work between the level being labeled.
Comprise that use public data and private data are shown in Figure 7 with the second embodiment of the present invention that produces packaging code.The packaging scheme example of the prior art of describing with reference to figure 1 above looking back, active procedure is from tray authentication code 120.Tray authentication code 120 is unique for particular pallet 16.Then, at in 20 secondary package (canister 12) each, by to first data set, 121 application encipher algorithms 124, produce other code 126, wherein first data set 121 comprises tray code 120 (public data) and secret recognition data 123.Have only the fabricator to know secret recognition data 123.Secret recognition data 123 is unique for tray, and for example it can comprise date and time information, order number, item number, random number or pseudo random number.Cryptographic algorithm 1 24 can be reversible algorithm or irreversible algorithm.
Then, for in 30 set (external packing 10) in each canister 12 each, by second data set 125 is used algorithm 130, produce other code 128, wherein second data set 125 comprises canister code 126 and the secret recognition data 127 that has only the fabricator to know.Algorithm 130 can be identical with the algorithm 124 that is used to produce canister code 126, no matter whether used different keys.Alternatively, can use different algorithms.Secret recognition data 127 is unique for canister 12.Second data set 125 is stored in the permanent storage 118, makes to have association between case code 126 that is used for producing external packing code 128 and secret recognition data 127.
Each canister code 126 and each external packing code 128 are stored in the scratchpad memory, so as by printer applications in packing.
In the above example, the quantity that is stored in the record in the persistent database 120 is 21: a record is used for first data set 121, and 20 records are used for second data set 125.Need storage to be used for producing the algorithm of every grade of code and the number of stages in the layering equally.At similar packing layering, the quantity of the record of preserving in the prior art system is 1241.Therefore, the present invention has a lot of less advantage of record of the required storage of Mk system work.This is significant for a large amount of manufacture processes.
Table 3 is illustrated in the data that generated in the process that produces these codes.
Table 3
| {。##.##1}, | The data recording of being stored | Remarks |
| Sign tray coding | 1 | Public data and private data=data set, produce 1 tray code (1 * pallet code), and 20 case codes (20 * case codes), storage tray code |
| The | 20 | For in 20 chests each, use uses the bidirectional encipher function to encrypt from the authentication code reference of tray |
| Bulb/external packing | At in 20 casees each, use the bidirectional encipher process, for each set produces 30 item codes |
According to the similar mode of the first embodiment of the present invention, with code be applied to the packing and the finishing and packing unit.Similarly, code is after being applied to packing, and they are deleted from scratchpad memory 22.
In a second embodiment, check is by realizing packaging code incoming inspection interface.Packaging code is used to the data set that sign is associated with it in persistent database 120.Packaging code (for example the external packing code 128) and the secret recognition data that is associated then are transfused to and produce the used algorithm of external packing code 128, thereby produce case code 126.Make comparisons by the canister code that will print and the case code that is produced, can determine whether the external packing 10 that just is being verified is in the correct canister 12.
In order to check purpose, if, will produce 30 external packing codes 128 with canister code 126 and its secret data that is associated input cryptographic algorithm.Then can compare, whether be in the correct canister 12 to determine it with being printed on the external packing code in the external packing 10 and the tabulation of code.
Sum up:
1. code is based on the numerical relation of the packing of wanting mark or product item and obtain.
2. product/packing volume code obtains according to the requirement of entity last in the mark layering (being tray in our example) being carried out mark.This has been avoided necessary scanning or has for example fetched code by scanning from production line on the contrary.
3. (on-the-fly), production period before making or in transporting, numerical relation can be used for limiting and setting up code-group.
4. add density test and can be used for the relation of Test Application between the code not at the same level of packing layering, whether relevant to determine different packing levels.
Embodiments of the invention are effective especially when the production run Be Controlled.Mistake during the course (for example from the refusal product) is also effective especially when being left in the basket, and reason is that high reject rate can reduce accuracy, utilizes this accuracy can predict independent position.
Code can utilize alphanumeric character, bar code or any other known technology and be applied to connection with wrapping of piece.For ease of check, code can use in conjunction with known reading/scanister such as bar code reader.
Randomly, safer for making process, the version of encrypted code can be applied to packing.A kind of suitable encryption method has been described in US 6088456.This makes the adulterator more be difficult to copy.
Claims (23)
1. the method for a mark connection with wrapping of piece, wherein, described article are packaged in the packing layering, and this method comprises:
A. produce the top code that the highest packaging unit that is labeled in the level of described packing layering is used; And
B. at each packaging unit in next the highest packing level that will be labeled, produce next highest code, wherein, described next highest code obtains from described top code according to algorithm.
2. method according to claim 1, comprise that further step c will represent that the denotation token of top code is applied to the highest packing level that is labeled, and in the packaging unit in next the highest packing level that each next highest code is applied to be labeled one.
3. method according to claim 1 and 2, further comprise steps d. wherein, at each packaging unit in the described next stage that will be labeled, generation will be applied to the next stage code of this packaging unit, described next stage code is to obtain from the higher level code that is applied to more senior unit according to algorithm, and wherein this unit package is in described more senior unit.
4. method according to claim 3 wherein, is labeled a grade repeating step d at all of packing in the layering.
5. according to the described method of any one claim in the aforementioned claim, further comprise: with described code storage in the scratchpad memory device, so that be applied to described product or connection with wrapping of piece.
6. according to the described method of any aforementioned claim, wherein, before described top code was applied to its connection with wrapping of piece, each next highest code was applied to its connection with wrapping of piece.
7. method according to claim 6, wherein, code is applied to described product or connection with wrapping of piece according to the reverse order obtained with it.
8. according to the described method of any aforementioned claim, wherein, described code utilizes cryptographic algorithm to obtain according to algorithm.
9. method according to claim 8, wherein, described cryptographic algorithm is reversible.
10. according to the described method of any one claim in the aforementioned claim, wherein, the encrypted version of described code is applied to described connection with wrapping of piece.
11. according to the described method of any aforementioned claim, wherein, described next highest code obtains from described top code and secret recognition data according to algorithm.
12. method according to claim 11 wherein, comprises that the data set of described top code and the described private data that is associated is stored in the storage arrangement.
13. method according to claim 3, wherein, described next stage code is to obtain according to the higher level code and the secret recognition data of algorithm from the more senior unit that is applied to will to pack in it described unit.
14. method according to claim 13, wherein, each higher level code and the described secret recognition data that is associated are stored in the storage arrangement.
15. according to the described method of any one claim in the claim 3 to 14, wherein, the algorithms different with the algorithm that is used for producing the previous stage code are used to produce described next stage code.
16. a plurality of article of being packed by layering, comprise top packing and one or more more rudimentary, each is more rudimentary to comprise a plurality of packings, wherein, code is associated with each packing, wherein more rudimentary at each, the described code of each packing is to obtain according to the higher grade packaged code that algorithm includes it in it.
17. a plurality of article of being packed by layering according to claim 16, wherein, described code utilizes cryptographic algorithm to obtain according to algorithm.
18. a plurality of article of being packed by layering according to claim 17, wherein, described cryptographic algorithm is reversible.
19., wherein, represent that the denotation token of one or more codes is applied to described code dependent packaging unit according to the described a plurality of article of being packed by layering of any one claim in the claim 17 to 18.
20. according to the described a plurality of article of being packed by layering of any one claim in the claim 17 to 19, wherein, the private data that is associated with one or more codes is stored in the storage arrangement that is associated with packing or product.
21. the equipment of a mark connection with wrapping of piece, wherein, described article are packaged in the packing layering, and described equipment comprises:
A. be used to produce the device of top code, this code is applied to packing the highest packaging unit that is labeled in the level of layering; And
B. at each packaging unit in described next the highest packing level of wanting mark, produce the device of next highest code, wherein said next highest code obtains from described top code according to algorithm.
22. the method for inspection of the relation between the article that are used for test package layering packaging, it comprises the products to be packaged that are labeled by the method according to any one claim in the claim 1 to 15, and the described method of inspection comprises that the applied cryptography test is applied to described relation between the code not at the same level of packing layering with foundation, determines whether different packing levels is relevant.
23. the method for inspection according to claim 22, wherein, packaging code is used to position the record in the storage arrangement that comprises the secret recognition data at first, and wherein, described secret recognition data and described packaging code are imported in the algorithm to obtain at least one check code.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| GB0420682A GB0420682D0 (en) | 2004-09-17 | 2004-09-17 | Method for marking goods and packaging |
| GB0420682.7 | 2004-09-17 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101069197A true CN101069197A (en) | 2007-11-07 |
Family
ID=33306737
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2005800312515A Pending CN101069197A (en) | 2004-09-17 | 2005-09-19 | Method of marking and apparatus |
Country Status (5)
| Country | Link |
|---|---|
| EP (1) | EP1807799A1 (en) |
| JP (1) | JP2008513307A (en) |
| CN (1) | CN101069197A (en) |
| GB (1) | GB0420682D0 (en) |
| WO (1) | WO2006092544A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105160377A (en) * | 2015-08-13 | 2015-12-16 | 浪潮通用软件有限公司 | Real-time generation system and method of product package relation record |
| CN105790956A (en) * | 2010-09-22 | 2016-07-20 | 高通股份有限公司 | Product authentication using end-to-end cryptographic scheme |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2470900B (en) * | 2009-06-08 | 2017-06-14 | Kezzler As | Method and system for storage and retrieval of track and trace information |
| CN111444999B (en) * | 2017-06-08 | 2022-08-09 | 福建摩尔软件有限公司 | Packaging bar code generation method and system with high query efficiency |
| JP7121481B2 (en) * | 2017-11-17 | 2022-08-18 | サッポロビール株式会社 | cans and articles |
| CN111160503B (en) * | 2019-12-31 | 2023-03-10 | 上海中商网络股份有限公司 | Product packaging inspection method and device, storage medium and electronic equipment |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2342743B (en) * | 1998-10-17 | 2003-05-14 | Nicholas Paul Elliot | Verification method |
| AU2001263282A1 (en) * | 2000-05-18 | 2001-11-26 | Commwell, Inc. | Method and apparatus for remote medical monitoring incorporating video processing and system of motor tasks |
| US7131585B2 (en) * | 2003-12-15 | 2006-11-07 | Digimarc Corporation | Inventory management system and methods for secure identification document issuance |
-
2004
- 2004-09-17 GB GB0420682A patent/GB0420682D0/en not_active Ceased
-
2005
- 2005-09-19 EP EP05789297A patent/EP1807799A1/en not_active Withdrawn
- 2005-09-19 JP JP2007531835A patent/JP2008513307A/en not_active Withdrawn
- 2005-09-19 CN CNA2005800312515A patent/CN101069197A/en active Pending
- 2005-09-19 WO PCT/GB2005/003595 patent/WO2006092544A1/en not_active Application Discontinuation
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105790956A (en) * | 2010-09-22 | 2016-07-20 | 高通股份有限公司 | Product authentication using end-to-end cryptographic scheme |
| CN105160377A (en) * | 2015-08-13 | 2015-12-16 | 浪潮通用软件有限公司 | Real-time generation system and method of product package relation record |
| CN105160377B (en) * | 2015-08-13 | 2018-06-12 | 浪潮通用软件有限公司 | A kind of product packaging relation record generates system and method in real time |
Also Published As
| Publication number | Publication date |
|---|---|
| JP2008513307A (en) | 2008-05-01 |
| WO2006092544A1 (en) | 2006-09-08 |
| EP1807799A1 (en) | 2007-07-18 |
| GB0420682D0 (en) | 2004-10-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102930192B (en) | Security information generates and acquisition methods and relevant apparatus | |
| CN101069197A (en) | Method of marking and apparatus | |
| CN100369059C (en) | Matrix type two-dimensional bar code and its encoding and decoding method | |
| EP3823322B1 (en) | Methods and systems for preparing and performing an object authentication | |
| CN1728162A (en) | Method for anti false verification based on identification technique in radio frequency, and anti false system | |
| JP7343584B2 (en) | Systems and methods for identifying product identity | |
| CN106462777B (en) | Item identifier assignment | |
| CN103281386B (en) | A kind ofly provide the method for safeguard protection for article mark and analysis service thereof | |
| CN101038619A (en) | Radio frequency recognition system privacy identification method | |
| CN106408065B (en) | A kind of two dimension code encoding method and device | |
| JP2010515999A (en) | System and method for protecting supply chain management and inventory management | |
| TWI398153B (en) | Certification methods, authentication systems and electronic tags | |
| Guo | Fragile watermarking scheme for tamper detection of relational database | |
| US20150304103A1 (en) | Method of generating unique and hardly predictable numbers of coupons | |
| CN104616039B (en) | The hair fastener method and card-issuing device of a kind of RFID label tag | |
| CN102270312B (en) | Method for making point bitmap, and goods-fleeing prevention verification method | |
| CN105023136A (en) | Two-dimensional code operating method and apparatus of commodity | |
| CN109472150B (en) | Method for setting and reading file information | |
| CN111311284A (en) | Cosmetics traceability platform system based on block chain | |
| CN114760073B (en) | Block chain-based warehouse commodity distribution method and device, electronic equipment and medium | |
| CN1255757C (en) | Multi-dimension antifraud code using positions and number of deformed characters to express characteristic value of code | |
| JP5714785B2 (en) | How to encrypt multiple data in a protected set | |
| CN101856917A (en) | Method and device for computing outer container anti-fleeing codes by product anti-fleeing codes | |
| CN1598826A (en) | Magic square digital antifor method and its antiforge system | |
| US20150356324A1 (en) | Identifiers for mass serialization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20071107 |