专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20100318546A1 SYNOPSIS OF A SEARCH LOG THAT RESPECTS USER PRIVACY 有权
标题翻译：搜索记录的概要，以表达用户隐私
公开(公告)号：US20100318546A1
公开(公告)日：2010-12-16
申请号：US12485058
申请日：2009-06-16
申请人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
发明人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： Described is releasing output data representing a search log, in which the data is suitable for most data mining/analysis applications, but is safe to publish by preserving user privacy. The search log is processed such that a query is only included if a sufficient count of that query is present; noise may be added. User contributions that are considered may be limited to a maximum number of queries. The output may indicate how often (possibly plus noise) that each query appeared. Other output may comprise a query-action graph, a query-inaction graph and/or a query-reformulation graph, with nodes representing queries and nodes representing actions, inactions or reformulations (e.g., clicked URLs, skipped URLs, or selected related queries), and edges between nodes representing action, skip or selection counts (possibly plus noise). The output may correspond to the top results/related queries returned from a search.
摘要翻译：描述了释放表示搜索日志的输出数据，其中数据适用于大多数数据挖掘/分析应用程序，但通过保护用户隐私来安全地发布。处理搜索日志，使得仅当存在该查询的足够计数时才包括查询; 可能会添加噪音。被考虑的用户贡献可能被限制为最大数量的查询。输出可以指示每个查询出现的频率（可能加噪声）。其他输出可以包括查询动作图，查询反应图和/或查询重构图，其中节点表示查询和节点，表示动作，不作为或重新设定（例如，点击的URL，跳过的URL或选择的相关查询），并且节点之间的边缘表示动作，跳过或选择计数（可能加上噪声）。输出可以对应于从搜索返回的最高结果/相关查询。

2. 发明授权

US08601024B2 Synopsis of a search log that respects user privacy 有权
标题翻译：搜索日志的简要说明，尊重用户隐私
公开(公告)号：US08601024B2
公开(公告)日：2013-12-03
申请号：US12485058
申请日：2009-06-16
申请人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
发明人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： Described is releasing output data representing a search log, in which the data is suitable for most data mining/analysis applications, but is safe to publish by preserving user privacy. The search log is processed such that a query is only included if a sufficient count of that query is present; noise may be added. User contributions that are considered may be limited to a maximum number of queries. The output may indicate how often (possibly plus noise) that each query appeared. Other output may comprise a query-action graph, a query-inaction graph and/or a query-reformulation graph, with nodes representing queries and nodes representing actions, inactions or reformulations (e.g., clicked URLs, skipped URLs, or selected related queries), and edges between nodes representing action, skip or selection counts (possibly plus noise). The output may correspond to the top results/related queries returned from a search.
摘要翻译：描述了释放表示搜索日志的输出数据，其中数据适用于大多数数据挖掘/分析应用程序，但通过保护用户隐私来安全地发布。处理搜索日志，使得仅当存在该查询的足够计数时才包括查询; 可能会添加噪音。被考虑的用户贡献可能被限制为最大数量的查询。输出可以指示每个查询出现的频率（可能加噪声）。其他输出可以包括查询动作图，查询反应图和/或查询重构图，其中节点表示查询和节点，表示动作，不作为或重新设定（例如，点击的URL，跳过的URL或选择的相关查询），并且节点之间的边缘表示动作，跳过或选择计数（可能加上噪声）。输出可以对应于从搜索返回的最高结果/相关查询。

3. 发明申请

US20170136362A1 AUTOMATED TUNING OF COMPUTER-IMPLEMENTED GAMES 审中-公开
公开(公告)号：US20170136362A1
公开(公告)日：2017-05-18
申请号：US15351190
申请日：2016-11-14
申请人： Jason Bucher , Alexandros Ntoulas , Xinxian Huang , Brett Bauleke , Moises Goldszmidt , Samer Ead
发明人： Jason Bucher , Alexandros Ntoulas , Xinxian Huang , Brett Bauleke , Moises Goldszmidt , Samer Ead
IPC分类号： A63F13/67 , A63F13/79
CPC分类号： A63F13/67 , A63F13/46 , A63F13/79 , A63F13/798
摘要： A system for automated tuning of a computer-implemented game is configured to enable definition of a performance metric indicative of player performance in a computer-implemented game that has tunable gameplay parameters. A performance target is defined that represents target values for the performance metric during progress in the game. The system executes a gameplay simulation using an automated player, and performs an iterative tuning operation based on results of the simulation. The tuning operation automatically determines a suggested value set for the tunable parameters.

4. 发明授权

US08990124B2 Assessing quality of user reviews 有权
标题翻译：评估用户评论的质量
公开(公告)号：US08990124B2
公开(公告)日：2015-03-24
申请号：US12687127
申请日：2010-01-14
申请人： Panayiotis Tsaparas , Yue Lu , Alexandros Ntoulas , Livia Polanyi
发明人： Panayiotis Tsaparas , Yue Lu , Alexandros Ntoulas , Livia Polanyi
IPC分类号： G06Q30/00 , G06F17/30 , G06Q30/02
CPC分类号： G06F17/30616 , G06Q30/02
摘要： User generated reviews and scores associated with the reviews may be used to train a review scoring model with textual features of the reviews. The review scoring model may be used to predict scores for newly received reviews. One or more constraints based on social networking application data associated with an author of a review may be used to adjust the predicted score of the review.
摘要翻译：用户生成的与评论相关的评论和分数可能用于训练评论模型与评论的文字功能。审查评分模型可用于预测新收到的评论的分数。可以使用基于与评论的作者相关联的社交网络应用数据的一个或多个约束来调整评论的预测得分。

5. 发明授权

US07685112B2 Method and apparatus for retrieving and indexing hidden pages 有权
标题翻译：用于检索和索引隐藏网页的方法和装置
公开(公告)号：US07685112B2
公开(公告)日：2010-03-23
申请号：US11570330
申请日：2005-05-27
申请人： Alexandros Ntoulas , Junghoo Cho , Petros Zerfos
发明人： Alexandros Ntoulas , Junghoo Cho , Petros Zerfos
IPC分类号： G06F17/30 , G06F15/173
CPC分类号： G06F17/30864
摘要： A method and system for autonomously downloading and indexing Hidden Web pages from Websites includes the steps of selecting a query term and issuing a query to a site-specific search interface containing Hidden Web pages. A results index is then acquired and the Hidden Web pages are downloaded from the results index. A plurality of potential query terms are then identified from the downloaded Hidden Web pages. The efficiency of each potential query term is then estimated and a next query term is selected from the plurality of potential query terms, wherein the next selected query term has the greatest efficiency. The next selected query term is then issued to the site-specific search interface using the next query term. The process is repeated until all or most of the Hidden Web pages are discovered.
摘要翻译：用于从网站自主下载和索引隐藏网页的方法和系统包括以下步骤：选择查询项并向包含隐藏网页的站点特定搜索界面发出查询。然后获取结果索引，并从结果索引中下载隐藏的网页。然后从下载的隐藏的网页中识别出多个潜在的查询词。然后估计每个潜在查询项的效率，并且从多个潜在查询项中选择下一个查询项，其中下一个所选择的查询项具有最大的效率。然后使用下一个查询项将下一个选定的查询项发布到特定于站点的搜索界面。重复该过程，直到发现所有或大部分隐藏的网页。

6. 发明授权

US08832133B2 Answering web queries using structured data sources 有权
标题翻译：使用结构化数据源回答Web查询
公开(公告)号：US08832133B2
公开(公告)日：2014-09-09
申请号：US12545872
申请日：2009-08-24
申请人： Stelios Paparizos , Alexandros Ntoulas , John C. Shafer
发明人： Stelios Paparizos , Alexandros Ntoulas , John C. Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/3056 , G06F17/30427
摘要： Described is answering online web queries from a structured data store, such as a products database. An online web search query is modified into an evaluation expression for accessing a structured data store (e.g., a database, XML file, a flat table) to find search results. A query is matched to a pattern, which is used to generate the expression, as well as determine to which structured data store the query is routed. Tokens (e.g., words) in the query are processed against a dictionary of token classes (sets of tokens) and patterns (sets of token classes) to annotate the query to map the query to the matching pattern. A translation process generates the expression based on translation hints that correspond to the matching pattern. Also described is offline mining of query logs to generate the dictionaries.
摘要翻译：描述的是回答来自结构化数据存储（如产品数据库）的在线Web查询。在线网络搜索查询被修改为用于访问结构化数据存储（例如，数据库，XML文件，平面表）以查找搜索结果的评估表达式。查询与一个模式相匹配，该模式用于生成表达式，以及确定查询路由到哪个结构化数据存储。根据令牌类（令牌集）和模式（令牌类集合）的字典处理查询中的令牌（例如，单词），以注释查询以将查询映射到匹配模式。翻译过程基于与匹配模式对应的翻译提示生成表达式。还描述了查询日志的离线挖掘以生成字典。

7. 发明申请

US20100306214A1 IDENTIFYING MODIFIERS IN WEB QUERIES OVER STRUCTURED DATA 审中-公开
标题翻译：通过结构化数据鉴定网络查询中的修改器
公开(公告)号：US20100306214A1
公开(公告)日：2010-12-02
申请号：US12473286
申请日：2009-05-28
申请人： Stelios Paparizos , Amrula Sadanand Joshi , Lise C. Getoor , Alexandros Ntoulas
发明人： Stelios Paparizos , Amrula Sadanand Joshi , Lise C. Getoor , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F16/951 , G06F16/3334
摘要： Described is using modifiers in online search queries for queries that map to a database table. A modifier (e.g., an adjective or a preposition) specifies the intended meaning of a target, in which the target maps to a column in that table. The modifier thus corresponds to one or more functions that determine which rows of data in the column match the query, e.g., “cameras under $400” maps to a camera (or product) table, and “under” is the modifier that represents a function (less than) that is used to evaluate a “price” target/data column. Also described are different classes of modifiers, and generating the dictionaries for a domain (corresponding to a table) via query log mining.
摘要翻译：描述的是在映射到数据库表的查询中使用在线搜索查询中的修饰符。修饰符（例如，形容词或介词）指定目标的意图，其中目标映射到该表中的列。因此，修改器对应于确定列中数据行与查询匹配的一个或多个功能，例如，“相机（$ 400以下的摄像机）”映射到相机（或产品）表，“下”是表示功能的修饰符（小于）用于评估“价格”目标/数据列。还描述了不同类别的修饰符，并通过查询日志挖掘生成域（对应于表）的字典。

8. 发明申请

US20160067612A1 AUTOMATED GAME MODIFICATION BASED ON PLAYING STYLE 审中-公开
标题翻译：基于播放风格的自动游戏修改
公开(公告)号：US20160067612A1
公开(公告)日：2016-03-10
申请号：US14849341
申请日：2015-09-09
申请人： Alexandros Ntoulas , Jeffrey Zakrewski , Oliver Attila Tabay , Yuko Yamazaki , Paul Yih Yarng Chong
发明人： Alexandros Ntoulas , Jeffrey Zakrewski , Oliver Attila Tabay , Yuko Yamazaki , Paul Yih Yarng Chong
IPC分类号： A63F13/67
摘要： A system, a non-transitory machine-readable storage medium storing instructions, and a computer-implemented method to modify a game based on playing style is provided. Player-specific playing style information that indicates one or more attributes of a playing style of a player is accessed. The playing style information is based on gameplay behavior of the player. Game parameters that defines at least some aspects of a game level forming part of the game is accessed. In an automated operation one or more of the game parameters are modified, thereby a difficulty of the game level for the player based on the one or more playing style attributes is modified. The modified game parameters are caused to be presented on a client device associated with the player of the game level.
摘要翻译：提供了一种系统，存储指令的非暂时性机器可读存储介质，以及基于播放风格修改游戏的计算机实现的方法。访问指示播放器的播放风格的一个或多个属性的特定于播放器的播放风格信息。播放风格信息基于玩家的游戏行为。访问定义游戏级别的至少一些方面的游戏参数，以形成游戏的一部分。在自动化操作中，一个或多个游戏参数被修改，从而修改了基于一个或多个演奏风格属性的玩家的游戏级别的难度。使修改的游戏参数呈现在与游戏级别的玩家相关联的客户端设备上。

9. 发明授权

US08458130B2 Indexing for limited search server availability 有权
标题翻译：索引有限的搜索服务器可用性
公开(公告)号：US08458130B2
公开(公告)日：2013-06-04
申请号：US13040261
申请日：2011-03-03
申请人： Krishnaram N. G. Kenthapadi , Shuai Ding , Sreenivas Gollapudi , Samuel Ieong , Alexandros Ntoulas
发明人： Krishnaram N. G. Kenthapadi , Shuai Ding , Sreenivas Gollapudi , Samuel Ieong , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30017 , G06F17/30864
摘要： Documents are replicated among servers comprising a search engine based on the value of each document by approximating its value as one of the top search results for one or more exemplary queries. Documents are allocated among servers comprising a search engine by calculating a relevance value for each document and then distributing the documents evenly to the servers. A subset of servers are selected from among a plurality of servers comprising a search engine using term-based, server-specific histograms reflecting the number of instances of the term in each document allocated to each server, and then selecting servers to service a query based on the documents on those servers.
摘要翻译：文档在包含基于每个文档的值的搜索引擎的服务器之间通过将其值近似作为一个或多个示例性查询的顶部搜索结果之一来复制。通过计算每个文档的相关性值，然后将文档均匀地分发到服务器，在包含搜索引擎的服务器之间分配文档。从包括使用基于术语的服务器特定直方图的搜索引擎的多个服务器中选择服务器的子集，所述服务器特定的直方图反映分配给每个服务器的每个文档中的术语的实例的数量，然后选择服务于基于查询的服务器在这些服务器上的文档上。

10. 发明申请

US20110307517A1 RELAXATION FOR STRUCTURED QUERIES 有权
标题翻译：结构性质疑的放松
公开(公告)号：US20110307517A1
公开(公告)日：2011-12-15
申请号：US12796678
申请日：2010-06-09
申请人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
发明人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30861 , G06F17/30864
摘要： A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要翻译：结构化查询可以指定属性的属性值。确定将结构化查询与应用于结构化数据库时匹配的项目数量的估计。如果估计的项目数量低于阈值，则可以放宽结构化查询以形成新的候选结构化查询。可以基于期望的运行时间来确定候选查询的数量。可以通过改变结构化查询的属性的一个或多个属性值来确定每个候选结构化查询。确定每个候选结构化查询将匹配的项目的数量的估计，并且使用具有最高匹配估计的候选结构化查询来查询数据库。可以输出匹配结果。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式