利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.032 秒)

    BRINGING ACHIEVEMENTS TO AN OFFLINE WORLD
    2.
    发明申请
    BRINGING ACHIEVEMENTS TO AN OFFLINE WORLD 有权
    在离岸世界取得成就

    公开(公告)号：US20120277004A1

    公开(公告)日：2012-11-01

    申请号：US13095504

    申请日：2011-04-27

    申请人： MOHAMMED MOINUDDIN ,  JOSEPH FUTTY ,  MATTHEW GRAHAM DYOR ,  DAN E. WALTHER ,  SREENIVAS GOLLAPUDI ,  STELIOS PAPARIZOS ,  JOHN C. SHAFER

    发明人： MOHAMMED MOINUDDIN ,  JOSEPH FUTTY ,  MATTHEW GRAHAM DYOR ,  DAN E. WALTHER ,  SREENIVAS GOLLAPUDI ,  STELIOS PAPARIZOS ,  JOHN C. SHAFER

    IPC分类号： G06F17/00

    CPC分类号： G06Q30/02

    摘要： An achievement system tracks users' offline activities and awards achievements to users for participation in particular offline activities. The achievements that are awarded for particular activities and/or to particular users may be sponsored by merchants, who may compensate an achievement system provider for the opportunity to sponsor the achievements. To award users achievements, the users' offline activities are tracked. When a user participates in an offline activity for which achievements are available, the user is awarded an achievement. The achievement may be stored in an achievement profile for the user. In some embodiments, achievements earned by users may be converted into other benefits and alternative awards.

    摘要翻译： 成就系统跟踪用户的离线活动，并向用户颁发成绩以参与特定的离线活动。 为特定活动和/或特定用户授予的成就可能由商家赞助，商家可能会补偿成就系统提供商以获得成就的机会。 为了奖励用户成就，将跟踪用户的离线活动。 当用户参与可用成就的离线活动时，用户将获得成就。 成就可以存储在用户的成就简档中。 在一些实施例中，用户获得的成就可以被转换成其他利益和替代奖励。

    PATTERN GENERATION
    4.
    发明申请
    PATTERN GENERATION 审中-公开
    图案生成

    公开(公告)号：US20090327269A1

    公开(公告)日：2009-12-31

    申请号：US12163475

    申请日：2008-06-27

    申请人： STELIOS PAPARIZOS ,  CHRISTOPHER WALTER ANDERSON ,  WEI LIU ,  AJAY NAIR ,  NAGA SRINIVAS VEMURI

    发明人： STELIOS PAPARIZOS ,  CHRISTOPHER WALTER ANDERSON ,  WEI LIU ,  AJAY NAIR ,  NAGA SRINIVAS VEMURI

    IPC分类号： G06F17/30

    CPC分类号： G06F16/3322

    摘要： Generation of patterns used to facilitate search queries is provided herein. A pattern includes a sequence of token classes and new token classes. A sample query is parsed to identify tokens within the sample query that match a token associated with a referenced set of token classes. New token classes are generated for unidentified tokens within the sample query. A pattern is generated by substituting the identified tokens of the sample query with corresponding token classes and substituting the unidentified tokens of the sample query with corresponding new token classes.

    摘要翻译： 本文提供了用于促进搜索查询的模式的生成。 模式包括令牌类和新令牌类的序列。 解析示例查询以识别示例查询中与引用的令牌类集合相关联的令牌匹配的令牌。 在示例查询中为不明身份的令牌生成新的令牌类。 通过用相应的令牌类替换样本查询的识别令牌，并用对应的新令牌类替换样本查询的未识别令牌来生成模式。

    GRAMMAR COMPRESSION
    5.
    发明申请
    GRAMMAR COMPRESSION 有权

    公开(公告)号：US20110313993A1

    公开(公告)日：2011-12-22

    申请号：US13221227

    申请日：2011-08-30

    申请人： STELIOS PAPARIZOS ,  CHRISTOPHER WALTER ANDERSON ,  WEI LIU ,  AJAY NAIR ,  ALEXANDROS NTOULAS ,  NAGA SRINIVAS VEMURI

    发明人： STELIOS PAPARIZOS ,  CHRISTOPHER WALTER ANDERSON ,  WEI LIU ,  AJAY NAIR ,  ALEXANDROS NTOULAS ,  NAGA SRINIVAS VEMURI

    IPC分类号： G06F17/30 ,  G06F17/27

    CPC分类号： G06F17/271 ,  G06F17/30675

    摘要： Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars include a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.

    摘要翻译： 本文提供了压缩用于促进搜索查询的广泛的基于规则的语法。 基于规则的语法包括每个包含令牌类序列的规则列表。 每个令牌类是令牌的逻辑分组，每个令牌是一串字符。 语法被解析以识别规则和令牌类。 识别不重要的令牌类，并将不重要的令牌类的集合合并到生成的合并令牌类。 通过将合并的令牌类替换为用于生成合并的令牌类的相应的不重要令牌类的语法来生成压缩语法。

    PROVIDING QUERY SUGGESTIONS
    6.
    发明申请
    PROVIDING QUERY SUGGESTIONS 有权
    提供查询建议

    公开(公告)号：US20110184951A1

    公开(公告)日：2011-07-28

    申请号：US12695758

    申请日：2010-01-28

    申请人： STELIOS PAPARIZOS ,  CHRIS ANDERSON ,  JANINE CRUMB ,  David James GEMMELL ,  AJAY NAIR ,  GENNADII TERTYCHNYI ,  AN YAN

    发明人： STELIOS PAPARIZOS ,  CHRIS ANDERSON ,  JANINE CRUMB ,  David James GEMMELL ,  AJAY NAIR ,  GENNADII TERTYCHNYI ,  AN YAN

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864 ,  G06F17/3064

    摘要： Methods and computer-readable media are provided for determining suggested queries. A user enters a search website, and the user is identified based on a user identification. Suggested queries are determined based on a group associated with the user. This association is created by extracting queries from data logs, categorizing the queries into groups based on their respective subject matter, associating the user with one or more groups, and determining suggested queries for each group. The suggested queries are communicated for display.

    摘要翻译： 提供了方法和计算机可读介质来确定建议的查询。 用户输入搜索网站，并且基于用户标识识别用户。 建议的查询是基于与用户相关联的组确定的。 该关联是通过从数据记录中提取查询来创建的，根据各自的主题将查询分组成组，将用户与一个或多个组相关联，并确定每个组的建议查询。 传达建议的查询以供显示。

    GRAMMAR COMPRESSION
    7.
    发明申请
    GRAMMAR COMPRESSION 有权

    公开(公告)号：US20090327256A1

    公开(公告)日：2009-12-31

    申请号：US12147211

    申请日：2008-06-26

    申请人： STELIOS PAPARIZOS ,  CHRISTOPHER WALTER ANDERSON ,  WEI LIU ,  AJAY NAIR ,  ALEXANDROS NTOULAS ,  NAGA SRINIVAS VEMURI

    发明人： STELIOS PAPARIZOS ,  CHRISTOPHER WALTER ANDERSON ,  WEI LIU ,  AJAY NAIR ,  ALEXANDROS NTOULAS ,  NAGA SRINIVAS VEMURI

    IPC分类号： G06F17/30 ,  G06F17/27

    CPC分类号： G06F17/271 ,  G06F17/30675

    摘要： Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars includes a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.

    摘要翻译： 本文提供了压缩用于促进搜索查询的广泛的基于规则的语法。 基于规则的语法包括每个包含令牌类序列的规则列表。 每个令牌类是令牌的逻辑分组，每个令牌是一串字符。 语法被解析以识别规则和令牌类。 识别不重要的令牌类，并将不重要的令牌类的集合合并到生成的合并令牌类。 通过将合并的令牌类替换为用于生成合并的令牌类的相应的不重要令牌类的语法来生成压缩语法。