会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • 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)相比具有预定的第二数量的错误的最大值。 这使得能够完全匹配或仅包含相对于所述查询字符串的次要错误的部分匹配,以及对于处理能力较低的较大数据库中的快速搜索。
    • 7. 发明申请
    • METHOD OF PROCESSING A SET OF CONTENT ITEMS, AND DATA- PROCESSING DEVICE
    • 处理一组内容项的方法和数据处理装置
    • US20090144253A1
    • 2009-06-04
    • US11719314
    • 2005-11-15
    • Fabio VignoliSteffen Clarence Pauws
    • Fabio VignoliSteffen Clarence Pauws
    • G06F17/30
    • G11B27/034G06F16/4387G06F16/634G06F16/635G06F16/639G06F16/68G06F16/683
    • A method of processing a set of content items, the method comprising the steps of: (150) selecting a particular one (sX, 210) of the set of content items, (160) selecting a first content item (sY, 220) on the basis of a first distance value (dXY, 211) representative of the distance between the particular content item and the first content item, and (180) selecting a second content item (sZ, 230) on the basis of a second distance value (dYZ, 221) representative of the distance between the first content item and the second content item. The particular, first and second content items may be sequentially included in a sequence of content items, e.g. for creating a playlist of content items. The invention also relates to a data-processing device for processing a set of content items, as well as to a distance data structure and a computer program product.
    • 一种处理一组内容项的方法,所述方法包括以下步骤:(150)选择所述一组内容项的特定一个(sX,210),(160)选择第一内容项(sY,220) 代表特定内容项目与第一内容项目之间的距离的第一距离值(dXY,211)的基础,以及(180)基于第二距离值(...)选择第二内容项目(sZ,230) dYZ,221)代表第一内容项和第二内容项之间的距离。 特定的第一和第二内容项目可以顺序地包括在内容项目的序列中,例如 用于创建内容项目的播放列表。 本发明还涉及一种用于处理一组内容项目以及距离数据结构和计算机程序产品的数据处理设备。
    • 9. 发明申请
    • Hierarchical Playlist Generator
    • 分层播放表生成器
    • US20080256032A1
    • 2008-10-16
    • US10597277
    • 2005-01-17
    • Fabio VignoliSteffen Clarence Pauws
    • Fabio VignoliSteffen Clarence Pauws
    • G06F17/30
    • G06F17/30772G06F17/30029G06F17/30053G06F17/30749G06F17/30766G06F17/30867G11B27/105Y10S707/99945
    • A playlist generator partitions the playlist generation process into a multi-stage, hierarchical process. At an example highest hierarchical level, the user's “general” preferences are applied. These general preferences reflect the user's “tastes”, and are relatively constant. At a lower level of the hierarchy, the user's “specific” preferences are applied. These specific preferences reflect the dynamic time-dependent or event dependent aspects of a user's entertainment preferences. The high-level preferences generate a subset of material from the global collection of material, and the lower-level preferences are applied to this subset of material as the user's immediate preferences change. By segregating the playlist generation process hierarchically, efficiency is gained by applying immediate preference changes to a smaller subset of material, and coherency is improved by limiting the subsequent selection processes to a given subset of the material.
    • 播放列表生成器将播放列表生成处理分割成多级分层处理。 在最高级别的例子中,应用用户的“一般”偏好。 这些一般偏好反映了用户的“口味”,并且相对不变。 在层次结构的较低级别,应用用户的“特定”首选项。 这些具体的偏好反映了用户娱乐偏好的动态时间依赖或事件依赖的方面。 高级偏好从全局材料集合中生成材料的子集,并且当用户的即时偏好改变时,较低级别的偏好将应用于该材料子集。 通过分层分隔播放列表生成过程,通过对较小的材料子集应用即时偏好改变来获得效率,并且通过将随后的选择过程限制到材料的给定子集来提高一致性。