会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and arrangement for searching for strings
    • 用于搜索字符串的方法和布置
    • US07756847B2
    • 2010-07-13
    • US10547328
    • 2004-02-25
    • Steffen Clarence PauwsSebastian EgnerJohannes Henricus Maria KorstMarcel Van Vuuren
    • Steffen Clarence PauwsSebastian EgnerJohannes Henricus Maria KorstMarcel Van Vuuren
    • G06F17/30
    • G06F17/30985
    • This invention relates to methods of searching for a final number of result strings (30-33) having a partial or an exact match with a query string (34) in a database (80) comprised of many long strings or a long string, said method includes the steps of partitioning the query string in a first number of input query strings (35, 36, 37); determining a second number of neighboring strings (38-41, 42-45, 44-49, respectively) for each string in said first number of input query strings, wherein each string in said second number of neighboring strings has a predetermined first number of errors; searching the database for a third number of exact matches (50-61, 70-74) for each string in said second number of neighboring strings based on a search method; concatenating said searched exact matched strings from the database into a fourth number of intermediate strings (29, 30, 32, 33, 34) wherein said searched exact matched strings (50-61, 70-74) comprised in each of said intermediate strings are in succession to one another in said database; and determining the final number of result strings (30-33) based in said fourth number of intermediate strings, wherein each string in the final number of result strings has a maximum of predetermined second number of errors compared to said query string (34). This enables for a perfect match or a partial match containing only minor errors with respect to said query string, and for a fast search in larger databases with a relative low use of processing power.
    • 本发明涉及在包括许多长字符串或长字符串的数据库(80)中搜索具有与查询字符串(34)的部分或精确匹配的最终数量的结果字符串(30-33)的方法,所述数据库 方法包括以下步骤:在第一数量的输入查询字符串(35,36,37)中划分查询字符串; 为所述第一数量的输入查询串中的每个字符串确定第二数量的相邻串(38-41,42-45,44-49),其中所述第二数量的相邻串中的每个字符串具有预定的第一数量 错误; 基于搜索方法在所述第二数量的相邻串中搜索所述数据库中的每个字符串的第三数量的精确匹配(50-61,70-74); 将所述搜索到的完全匹配的字符串从数据库连接成第四数量的中间字符串(29,30,32,33,34),其中包括在每个所述中间字符串中的所述所搜索的精确匹配字符串(50-61,70-74)是 在所述数据库中彼此相继; 以及基于所述第四数量的中间字符串确定结果串(30-33)的最终数量,其中最终数量的结果串中的每个字符串与所述查询字符串(34)相比具有预定的第二数量的错误的最大值。 这使得能够完全匹配或仅包含相对于所述查询字符串的次要错误的部分匹配,以及对于处理能力较低的较大数据库中的快速搜索。
    • 3. 发明申请
    • Method and arrangement for searching for strings
    • 用于搜索字符串的方法和布置
    • US20060179052A1
    • 2006-08-10
    • US10547328
    • 2004-02-25
    • Steffen PauwsSebastian EgnerJohannes KorstMarcel Van Vuuren
    • Steffen PauwsSebastian EgnerJohannes KorstMarcel Van Vuuren
    • G06F17/30
    • G06F17/30985
    • This invention relates to methods of searching for a final number of result strings (30-33) having a partial or an exact match with a query string (34) in a database (80) comprised of many long strings or a long string, said method includes the steps of partitioning the query string in a first number of input query strings (35, 36, 37); determining a second number of neighboring strings (38-41, 42-45, 44-49, respectively) for each string in said first number of input query strings, wherein each string in said second number of neighboring strings has a predetermined first number of errors; searching the database for a third number of exact matches (50-61, 70-74) for each string in said second number of neighboring strings based on a search method; concatenating said searched exact matched strings from the database into a fourth number of intermediate strings (29, 30, 32, 33, 34) wherein said searched exact matched strings (50-61, 70-74) comprised in each of said intermediate strings are in succession to one another in said database; and determining the final number of result strings (30-33) based in said fourth number of intermediate strings, wherein each string in the final number of result strings has a maximum of predetermined second number of errors compared to said query string (34). This enables for a perfect match or a partial match containing only minor errors with respect to said query string, and for a fast search in larger databases with a relative low use of processing power.
    • 本发明涉及在包括许多长字符串或长字符串的数据库(80)中搜索具有与查询字符串(34)的部分或精确匹配的最终数量的结果字符串(30-33)的方法,所述数据库 方法包括以下步骤:在第一数量的输入查询字符串(35,36,37)中划分查询字符串; 确定所述第一数量的输入查询字符串中的每个字符串的第二数量的相邻串(38-41,42-45,44-49),其中所述第二数量的相邻串中的每个字符串具有预定的第一数量 错误; 基于搜索方法在所述第二数量的相邻串中搜索所述数据库中的每个字符串的第三数量的精确匹配(50-61,70-74); 将所述搜索到的完全匹配的字符串从数据库连接成第四数量的中间字符串(29,30,32,33,34),其中包括在每个所述中间字符串中的所述所搜索的精确匹配字符串(50-61,70-74)是 在所述数据库中彼此相继; 以及基于所述第四数量的中间字符串确定结果字符串(30-33)的最终数量,其中与所述查询字符串(34)相比,最终数量的结果字符串中的每个字符串具有预定的第二数量的错误的最大值。 这使得能够完全匹配或仅包含相对于所述查询字符串的次要错误的部分匹配,并且对于在相对较低使用处理能力的较大数据库中进行快速搜索。
    • 4. 发明申请
    • Data Storage and Replay Apparatus
    • 数据存储和重放设备
    • US20090150748A1
    • 2009-06-11
    • US11573192
    • 2005-07-22
    • Sebastian EgnerNicolaas LambertLudovicus M. G. M. TolhuizenVictor M. G. Van AchtMartinus W. Blum
    • Sebastian EgnerNicolaas LambertLudovicus M. G. M. TolhuizenVictor M. G. Van AchtMartinus W. Blum
    • G06F11/10
    • G06F11/1012G06F11/1068G11B20/1816G11B20/1833H03M13/35
    • A data storage and replay device uses measurements of the evolution of performance of the storage medium (typically a flash memory circuit) to predict an error rate of retrieval from a region of the storage medium. The prediction is used as a basis for dynamically selecting an ECC for encoding the data prior to storage of the data. The ECC is selected from a plurality of available ECC's so that a fastest encodable ECC is selected that is predicted to produce no more than a predetermined post-decoding error rate given said information. In this way the speed of transmission of data to the device can be maximized while keeping the error rate below an acceptable level in the predicted future after decoding. On decoding the data, which is typically audio or video data, is decoded and replayed at a predetermined speed. In another embodiment, the data stored using a plurality of ECC's together and an ECC is selected dynamically for decoding, so that an output data rate can be maximized or power consumption on replay can be minimized.
    • 数据存储和重放设备使用存储介质(通常为闪速存储器电路)性能演变的测量来预测从存储介质的区域检索的错误率。 该预测用作在存储数据之前动态选择用于对数据进行编码的ECC的基础。 从多个可用ECC中选择ECC,使得选择最快的可编码ECC,其被预测产生不超过给定所述信息的预定后解码错误率。 以这种方式,可以最大化数据传输到设备的速度,同时在解码之后将误差率保持在预测未来的可接受水平。 在对通常是音频或视频数据的数据进行解码时,以预定速度进行解码和重放。 在另一个实施例中,动态地选择使用多个ECC一起存储的数据和ECC,以进行解码,从而可以最大化输出数据速率或者可以最小化重播的功耗。
    • 5. 发明申请
    • Error Correcting Code
    • 纠错码错误
    • US20080282132A1
    • 2008-11-13
    • US11814283
    • 2006-01-12
    • Sebastian Egner
    • Sebastian Egner
    • H03M13/05G06F11/07
    • H03M13/134G06F11/1008G06F11/108H03M13/19H03M13/49
    • A system 100 for protecting a codeword u against an error in at least one 1, each information symbol representing an integer in the range {θ, 2w−1}, where w=n*r, n≧1. A processor 130 includes an integer processing unit 140 for, under control of a program, calculating a parity symbol 312 u[k] for protecting the information symbols, where the parity symbol includes −(α[0]
    • 一种用于保护码字u抵抗至少一个<7元符号中的错误的系统100,其中q是r 2,r> = 1(q = T)。 代码字u 300包括信息符号310 u [0],。 。 。 ,u [k-1],k> 1,每个信息符号表示范围{θ,2w-1}中的整数,其中w = n * r,n> = 1。 处理器130包括整数处理单元140,用于在程序控制下,计算用于保护信息符号的奇偶校验符号312 u [k],其中奇偶校验符号包括 - (α[0] << u [0] + α[1] << u [1] + ... ... + a [k-1] * u [k-1])mod M,其中乘法。 而加+是整数运算。 常数α[0],。 。 。 ,α[£-1]位于{0,。 。 。 ,M-1},M> = 1,并且被选择为使得元素a [i] * d * qJ modM对于ie {0,...而言是唯一的。 。 。 ,k-1},j e {0,... 。 。 ,n-1},-q 0。
    • 8. 发明授权
    • Data processing device with a memory location in which data is stored according to a WOM (write once memory) code
    • 具有根据WOM(一次写入存储器)代码存储数据的存储器位置的数据处理设备
    • US07177974B2
    • 2007-02-13
    • US10755238
    • 2004-01-12
    • Sebastian EgnerFranciscus Petrus Widdershoven
    • Sebastian EgnerFranciscus Petrus Widdershoven
    • G11C17/00G11C7/10
    • G11C17/005
    • A device contains a memory that stores a WOM codeword that encodes successive generations of data values. When the codeword must be updated to represent a new data value, the device determines which updates of the dataword can be realized by feasible single bit updates to the WOM (Write Once Memory) codeword. If no feasible single bit update is possible, feasible two-bit updates are considered. Under control of the new data values a connection circuit routes feasibility signals for various updates, that signal the single-bit feasibility of the updates. Routing brings together pairs of feasibility signals for updates that together produce a WOM codeword that encodes the new data value. A pair is selected in which both feasibility signals indicate feasibility and the codeword is updated according to the updates involved in the pair. Preferably, the routing is realized with a connection circuit that comprises a number of layers of subcircuits, each routing the feasibility signals dependent on a respective bit of the new dataword. Also preferably, the WOM code is designed so that each of a number of updates to the data word can be realized by setting singles ones of a plurality of bits.
    • 设备包含存储编码连续几代数据值的WOM码字的存储器。 当代码字必须被更新以表示新的数据值时,设备通过对WOM(一次写入存储器)码字的可行单位更新来确定可以实现数据字的哪些更新。 如果没有可行的单比特更新是可行的,则考虑可行的两比特更新。 在新的数据值的控制下,一个连接电路可以路由各种更新的可行性信号,这些信号表明更新的单位可行性。 路由汇总了可用信号对,用于一起生成编码新数据值的WOM码字的更新。 选择一对,其中两个可行性信号指示可行性,并且根据该对中涉及的更新来更新码字。 优选地,路由通过包括多个子电路层的连接电路实现,每个子电路依赖于新数据字的相应位来路由可行性信号。 还优选地,WOM码被设计为使得可以通过设置多个比特的单个数目来实现数据字的多个更新中的每一个。
    • 9. 发明授权
    • Method and system for retrieving blocks of data from a storage medium
    • 从存储介质检索数据块的方法和系统
    • US06643083B2
    • 2003-11-04
    • US09870065
    • 2001-05-30
    • Johannes Henricus Maria KorstSebastian Egner
    • Johannes Henricus Maria KorstSebastian Egner
    • G11B509
    • H04N21/2326G11B27/002G11B2220/415
    • A system (100) has a storage medium (110) that contains a number of storage units (108). A multimedia title is stored in the storage medium (110) as a number of blocks, whereby some of the blocks are stored multiple times such that different storage units (108) contain a copy of that block. Retrieving blocks from the storage medium (110) for supply to a user is executed in cycles and the system has for some of the blocks the freedom to choose from which of the storage units (108) the block is retrieved in order to balance the load on the storage units (108). Furthermore, the system (100) is arranged to look ahead a number of cycles to determine what blocks in the near future are necessary and to retrieve these future blocks earlier if the storage units are not yet fully occupied. The additional freedom to schedule retrieval of a block at earlier moments in time provides a further mechanism to balance the load on the storage units.
    • 系统(100)具有包含多个存储单元(108)的存储介质(110)。 多媒体标题作为多个块存储在存储介质(110)中,由此一些块被多次存储,使得不同的存储单元(108)包含该块的副本。 从存储介质(110)中提取用于提供给用户的块被执行为循环,并且系统使得某些块可以自由地选择从哪个存储单元(108)检索块,以便平衡负载 在存储单元(108)上。 此外,系统(100)被布置为向前看多个周期以确定在不久的将来是什么块是必需的,并且如果存储单元尚未完全占用,则更早地检索这些未来块。 在较早的时刻安排对块的检索的额外的自由度提供了平衡存储单元上的负载的另外的机制。