会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method for correcting a mailing address
    • 纠正邮寄地址的方法
    • US07590544B2
    • 2009-09-15
    • US10384915
    • 2003-03-06
    • Robert F. Snapp
    • Robert F. Snapp
    • G06Q10/00G06F17/00
    • G06Q10/08G06Q30/018G07B17/00024G07B17/00435G07B2017/00443G07B2017/00451
    • A method for the Postal Service to provide updated address information to its customers such as mass mailers. The method includes comparing information on old delivery point files with information on current delivery point files. The delivery point files include unique identifiers that are keyed to each delivery point. Thus a comparison of older and newer files identifies delivery points that have been changed by, for example, changes in street name or renumbering of address numbers. The comparison of files generates a file with updated delivery and address information. In modified format this updated address information can be made available to mass mailers so that mass mailers will have the most up-to-date address information for mailings.
    • 邮政服务提供更新的地址信息给其客户的方法,例如群发邮件。 该方法包括将关于旧的传送点文件的信息与当前传送点文件的信息进行比较。 交付点文件包括唯一的标识符,这些标识符被键入到每个交付点。 因此,较旧和较新文件的比较可识别通过例如街道名称更改或地址号码重新编号进行更改的传送点。 文件的比较生成一个具有更新的传送和地址信息的文件。 以修改后的格式,这个更新的地址信息可以提供给群发邮件服务商,以便群发邮件人员拥有最新的邮件地址信息。
    • 3. 发明授权
    • Delivery point validation system
    • 交货点验证系统
    • US07302582B2
    • 2007-11-27
    • US10344990
    • 2001-08-21
    • Robert F. SnappJames D. Wilson
    • Robert F. SnappJames D. Wilson
    • G06F7/00
    • G06F21/602G06Q10/08G07B17/00435G07B2017/00725
    • Systems and methods consistent with the present invention encode a list so users of the list may make inquires to the coded list without the entire content of the list being revealed to the users. Each item in the list turns on one or more bits in the array 110. Once each item in the list has been encoded by an encoder, a bit array with high and low values is used to represent the items in the list. The bit array may be embodied in a validation system for allowing users to query the list to determine whether an inquiry item is on the list 105. The validation system determines which bits to check by executing the same coding process executed by the encoder. If all the bits are high, then the inquiry item is determined to be part of the list, if at least one of the bits is low, then the inquiry item is determined not to be part of the original list. An exemplary encoder and validation system comprises a standardizer, a hashing function unit, an extraction circuit, and an offset circuit.
    • 与本发明一致的系统和方法对列表进行编码,使得列表的用户可以查询编码列表,而不会向用户显示列表的整个内容。 列表中的每个项目打开阵列110中的一个或多个位。 一旦列表中的每个项目都被编码器编码,则使用高和低值的位数组来表示列表中的项目。 位阵列可以体现在验证系统中,以允许用户查询列表以确定查询项目是否在列表105上。 验证系统通过执行由编码器执行的相同的编码处理来确定要检查哪些位。 如果所有比特都为高,则查询项目被确定为列表的一部分,如果该比特中的至少一个为低,则查询项目被确定为不是原始列表的一部分。 示例性编码器和验证系统包括标准器,散列函数单元,提取电路和偏移电路。
    • 4. 发明授权
    • Method and apparatus for alphanumeric recognition
    • 用于字母数字识别的方法和装置
    • US07171049B2
    • 2007-01-30
    • US10450470
    • 2001-12-13
    • Robert F. Snapp
    • Robert F. Snapp
    • G06K9/64G06K9/00
    • G06K9/723G06K2209/01
    • A method and apparatus for recognizing alphanumeric characters in which a set of unknown characters is received from an imaging system and a set of known characters from a storage device. A first set of pairs of characters is created from the set of unknown characters (302) and a second set of pairs of characters is created from the set of known characters (304). A matrix is generated having a plurality of cells, each cell containing a pair of characters. The matrix is interrogated with the first set to generate a first result, and the matrix is interrogated with the second set to generate a second result (302, 304). The first result is compared with the second result (306). A first predetermined action is taken if the first result matches the second result, while a second predetermined action is taken if the first result does not match the second result (308).
    • 一种用于识别字母数字字符的方法和装置,其中从存储装置接收来自成像系统和一组已知字符的一组未知字符。 从所述一组未知字符(302)创建第一组对字符,并且从所述一组已知字符(304)创建第二组字符。 生成具有多个单元的矩阵,每个单元包含一对字符。 该矩阵与第一组询问以产生第一结果,并且与第二组询问矩阵以产生第二结果(302,304)。 将第一个结果与第二个结果进行比较(306)。 如果第一结果与第二结果匹配,则采取第一预定动作,而如果第一结果与第二结果不匹配则采取第二预定动作。
    • 5. 发明授权
    • Method and system for sequencing deliverables using combined delivery codes and partial delivery point bar codes (DPBCs)
    • 使用组合的递送代码和部分递送点条形码(DPBC)对可交付物排序的方法和系统
    • US06865443B2
    • 2005-03-08
    • US10358440
    • 2003-02-04
    • Robert F. SnappDavid J. PayneJames D. Wilson
    • Robert F. SnappDavid J. PayneJames D. Wilson
    • B07C3/00G06F7/00
    • B07C3/00Y10S209/90
    • A method and system for sequencing deliverables using combined delivery codes and partial delivery point bar codes (DPBCs) provides pre-sequencing of deliverables for delivery carriers that has improved ordering with respect to the actual delivery route and accounts for un-coded new delivery points in the ordering process. A partial DPBC field is combined with a delivery code to generate the ordering sequence. The DPBC field is combined by generating delivery sequencing tables having sequence numbers splitting ZIP+4 codes into multiple entries delineated by ranges of the last two digits of the DPBC, that can then be flagged for ascending or descending delivery and assigned unique sequence numbers. The full address of actual delivery points is thereby concealed by the table, while providing more accurate sequencing conforming to actual deliver routes. New delivery points within a ZIP+4 code can be assigned a sequence number by reference to the last two digits of the actual address, providing further utility to the method.
    • 使用组合的交付代码和部分交付点条形码(DPBC)对可交付成果进行排序的方法和系统为交付运营商提供可交付成果的预先排序,这些交付运营商对于实际交货路线有改进的订单,并且对未编码的新交货点 订购流程。 部分DPBC字段与传送代码组合以生成排序顺序。 DPBC字段通过生成具有将ZIP + 4代码分割成由DPBC的最后两位数的范围描绘的多个条目的序列号的递送排序表来组合,然后可以将其标记为递增或递减递送和分配的唯一序列号。 实际交付点的完整地址由此被隐藏,同时提供符合实际交付路线的更准确的排序。 可以通过引用实际地址的最后两位数字为ZIP + 4代码中的新交货点分配序列号,为该方法提供了进一步的实用性。
    • 9. 发明授权
    • Method and system for storing and retrieving data using hash-accessed multiple data stores
    • 使用哈希访问的多个数据存储来存储和检索数据的方法和系统
    • US07664731B2
    • 2010-02-16
    • US11231989
    • 2005-09-22
    • Robert F. SnappDavid J. PayneJames D. Wilson
    • Robert F. SnappDavid J. PayneJames D. Wilson
    • G06F17/30
    • G06F17/30949G06F21/62
    • A method and system for storing and retrieving data using hash-accessed multiple data stores, provides data protection while requiring low computational overhead and further provides storage and retrieval access based on only a single piece of access information, which is generally public. The algorithms provide high security against data-mining and other examination of the data stores. The access information is hashed and is split into offset fields used as indices into a plurality of data stores, generating a quasi-random relationship between the access information and the location of portions of a stored data element. Further protection may be provided by striping the data across the data stores in conformity with a striping order selected by a field of the hashed access information.
    • 使用散列访问多个数据存储来存储和检索数据的方法和系统提供数据保护,同时需要低的计算开销,并且还基于通常是公共的单个访问信息进一步提供存储和检索访问。 这些算法为数据挖掘和数据存储的其他检查提供了高度的安全性。 访问信息被散列,并且被分割成用作多个数据存储中的索引的偏移字段,从而在访问信息和存储的数据元素的部分的位置之间产生准随机关系。 可以通过根据由散列访问信息的字段选择的条带化顺序跨数据存储区分割数据来提供进一步的保护。