-
公开(公告)号：US20090313237A1
公开(公告)日：2009-12-17
申请号：US12138970
申请日：2008-06-13
申请人： Nitin Agrawal , Krishna Gade
发明人： Nitin Agrawal , Krishna Gade
CPC分类号： G06F17/30731 , G06F17/3064
摘要： A method for suggesting related queries to a user query using semantic relationships that are present in informational content stored in public domains. Semantic relationships between named entities are discovered and the named entities are extracted. The entities are indexed according to the relationships. When a user query is received that includes one of the entities, query suggestions are returned to the user based on indexed relationships corresponding to the entity named in the user query.
摘要翻译： 使用存在于公共领域中的信息内容中存在的语义关系向用户查询建议相关查询的方法。 发现命名实体之间的语义关系，并提取命名实体。 实体根据关系进行索引。 当接收到包含其中一个实体的用户查询时，将根据与用户查询中指定的实体对应的索引关系向用户返回查询建议。
-
公开(公告)号：US08082278B2
公开(公告)日：2011-12-20
申请号：US12138970
申请日：2008-06-13
申请人： Nitin Agrawal , Krishna Gade
发明人： Nitin Agrawal , Krishna Gade
IPC分类号： G06F17/30
CPC分类号： G06F17/30731 , G06F17/3064
摘要： A method for suggesting related queries to a user query using semantic relationships that are present in informational content stored in public domains. Semantic relationships between named entities are discovered and the named entities are extracted. The entities are indexed according to the relationships. When a user query is received that includes one of the entities, query suggestions are returned to the user based on indexed relationships corresponding to the entity named in the user query.
摘要翻译： 使用存在于公共领域中的信息内容中存在的语义关系向用户查询建议相关查询的方法。 发现命名实体之间的语义关系，并提取命名实体。 实体根据关系进行索引。 当接收到包含其中一个实体的用户查询时，将根据与用户查询中指定的实体对应的索引关系向用户返回查询建议。
-
公开(公告)号：US08719246B2
公开(公告)日：2014-05-06
申请号：US12824879
申请日：2010-06-28
申请人： Robert Williams , Nitin Agrawal , Farid Hosseini , Sanaz Ahari , Maxim Stepin , Jason Bolla , Bo-June Hsu
发明人： Robert Williams , Nitin Agrawal , Farid Hosseini , Sanaz Ahari , Maxim Stepin , Jason Bolla , Bo-June Hsu
CPC分类号： G06F17/30864 , G06F17/3064
摘要： The present invention is directed to presenting a suggested search query. Responsive to receiving a user-devised search parameter, a suggested search query is identified. The user-devised search parameter might have been previously received by a search system, or alternatively, might be a unique query that has not been previously received. A suggested search query might be generated using various techniques, such as by applying an n-gram language model. A classification of the suggested search query is determined, and the suggested search query is presented together with a visual indicator, which signifies the classification.
摘要翻译： 本发明旨在呈现建议的搜索查询。 响应于接收用户设计的搜索参数，识别出建议的搜索查询。 用户设计的搜索参数可能先前已经被搜索系统接收，或者可以是先前未被接收到的唯一查询。 可以使用各种技术来生成建议的搜索查询，例如通过应用n-gram语言模型。 确定建议的搜索查询的分类，并将建议的搜索查询与视觉指示符一起呈现，这意味着分类。
-
公开(公告)号：US6044448A
公开(公告)日：2000-03-28
申请号：US991392
申请日：1997-12-16
申请人： Nitin Agrawal , Sunil Nanda
发明人： Nitin Agrawal , Sunil Nanda
CPC分类号： G06F9/30032 , G06F15/7867 , G06F15/8015 , G06F9/30036 , G06F9/30101 , G06F9/30109 , G06F9/3885
摘要： A processor having a sliceable architecture wherein a slice is the minimum configuration of the processor datapath. The processor can instantiate multiple slices and each slice has a separate datapath. The total processor datapath is the sum of the number of slices multiplied by the width of a slice. Accordingly, all general purpose registers in the processor are as wide as the total datapath. A program executing on the processor can determine the maximum number of slices available in a particular processor by reading a register. In addition, a program can select the number of slices it will use by writing to a different register. The processor replicates control signals for each active slice in the processor and supports instructions for transferring data among the slices. Furthermore, the processor supports a set of instructions for fetching and storing data between multiple slices and the memory. The effective addresses of the fetch and store instructions can either be aligned or misaligned with respect to slice boundaries and doubleword boundaries in the memory.
摘要翻译： 具有可切片架构的处理器，其中切片是处理器数据路径的最小配置。 处理器可以实例化多个片段，每个片段具有单独的数据路径。 总处理器数据路径是切片数乘以切片宽度的总和。 因此，处理器中的所有通用寄存器与总数据路径一样宽。 在处理器上执行的程序可以通过读取寄存器来确定特定处理器中可用的最大片数。 此外，程序可以通过写入不同的寄存器来选择要使用的片数。 处理器为处理器中的每个活动切片重复控制信号，并且支持在切片之间传送数据的指令。 此外，处理器支持用于在多个片和存储器之间取出和存储数据的一组指令。 获取和存储指令的有效地址可以相对于存储器中的切片边界和双字边界对准或不对准。
-
公开(公告)号：US08650173B2
公开(公告)日：2014-02-11
申请号：US12821134
申请日：2010-06-23
IPC分类号： G06F7/00
CPC分类号： G06F17/3089
摘要： Technologies are described herein for placing search results on a search engine results page (SERP). A query may be received. The query may be transmitted to a plurality of search result providers. A first set of search results and a second set of search results may be received from the search result providers. Intent features may be extracted from the first set of search results. User intent of the second set of search results may be inferred based on the extracted intent features. The first set of search results and the second set of search results may be ranked based on the inferred user intent. The SERP may be rendered according to the ranked first set and second set of search results.
摘要翻译： 这里描述了将搜索结果放置在搜索引擎结果页（SERP）上的技术。 可能会收到查询。 查询可以被发送到多个搜索结果提供者。 可以从搜索结果提供者接收第一组搜索结果和第二组搜索结果。 可以从第一组搜索结果中提取意图特征。 可以基于提取的意图特征来推断第二组搜索结果的用户意图。 第一组搜索结果和第二组搜索结果可以基于推断的用户意图进行排名。 可以根据排名的第一组和第二组搜索结果呈现SERP。
-
公开(公告)号：US08150841B2
公开(公告)日：2012-04-03
申请号：US12690184
申请日：2010-01-20
申请人： Christopher Avery Meyers , Gopi Prashanth Gopal , Andrew Peter Oakley , Nitin Agrawal , Nicholas Eric Craswell , Milad Shokouhi , Derrick Leslie Connell , Sanaz Ahari , Neil Bruce Sharman , Gaurav Sareen , Hugh Evan Williams , Jay Kumar Goyal
发明人： Christopher Avery Meyers , Gopi Prashanth Gopal , Andrew Peter Oakley , Nitin Agrawal , Nicholas Eric Craswell , Milad Shokouhi , Derrick Leslie Connell , Sanaz Ahari , Neil Bruce Sharman , Gaurav Sareen , Hugh Evan Williams , Jay Kumar Goyal
CPC分类号： G06F17/30448 , G06Q30/0254
摘要： Methods, systems, and media are provided for identifying and clustering queries that are rising in popularity. Resultant clustered queries can be compared to other stored queries using textual and temporal correlations. Fresh indices containing information and results from recently crawled content sources are searched to obtain the most recent query activity. Historical indices are also searched to obtain temporally correlated information and results that match the clustered query stream. A weighted average acceleration of a spike can be calculated to distinguish between a legitimate spike and a non-legitimate spike. Legitimate clusters are combined with other stored clusters and presented as grouped content results to a user output device.
摘要翻译： 提供了方法，系统和媒体，用于识别和聚集正在日益普及的查询。 可以使用文本和时间相关性将所产生的聚类查询与其他存储的查询进行比较。 搜索包含最近爬取的内容源的信息和结果的新索引以获取最近的查询活动。 还搜索历史索引以获得与聚集查询流匹配的时间相关信息和结果。 可以计算穗的加权平均加速度，以区分合法穗和非合法穗。 合法集群与其他存储的集群组合，并以分组的内容结果呈现给用户输出设备。
-
公开(公告)号：US20110320440A1
公开(公告)日：2011-12-29
申请号：US12821134
申请日：2010-06-23
IPC分类号： G06F17/30
CPC分类号： G06F17/3089
摘要： Technologies are described herein for placing search results on a search engine results page (SERP). A query may be received. The query may be transmitted to a plurality of search result providers. A first set of search results and a second set of search results may be received from the search result providers. Intent features may be extracted from the first set of search results. User intent of the second set of search results may be inferred based on the extracted intent features. The first set of search results and the second set of search results may be ranked based on the inferred user intent. The SERP may be rendered according to the ranked first set and second set of search results.
摘要翻译： 这里描述了将搜索结果放置在搜索引擎结果页（SERP）上的技术。 可能会收到查询。 查询可以被发送到多个搜索结果提供者。 可以从搜索结果提供者接收第一组搜索结果和第二组搜索结果。 可以从第一组搜索结果中提取意图特征。 可以基于提取的意图特征来推断第二组搜索结果的用户意图。 第一组搜索结果和第二组搜索结果可以基于推断的用户意图进行排名。 可以根据排名的第一组和第二组搜索结果呈现SERP。
-
公开(公告)号：US20100228744A1
公开(公告)日：2010-09-09
申请号：US12392015
申请日：2009-02-24
CPC分类号： G06F17/30905
摘要： A method, system, and medium are provided for enhancing a search result snippet that is associated with a URL. Potentially descriptive terms of the URL are identified by reconciling multiple sources of terms related to the URL. One aspect includes comparing search terms of historically relevant queries to anchor text for the URL. The search result snippet might be intelligently enhanced by causing common terms to be visibly distinguished when the snippet is displayed.
摘要翻译： 提供了一种方法，系统和介质，用于增强与URL相关联的搜索结果片段。 通过协调与URL相关的多个术语来源来识别URL的潜在描述性术语。 一个方面包括将历史相关查询的搜索条件与URL的锚文本进行比较。 搜索结果代码段可能会通过在显示代码段时明显区分通用术语来智能地增强。
-
9.发明授权Computer processor with two addressable memories and two stream registers and method of data streaming of ALU operation 失效具有两个可寻址存储器和两个流寄存器的计算机处理器和ALU操作的数据流传输方法
公开(公告)号：US5958038A
公开(公告)日：1999-09-28
申请号：US966904
申请日：1997-11-07
申请人： Nitin Agrawal , Sunil Nanda
发明人： Nitin Agrawal , Sunil Nanda
CPC分类号： G06F9/3001 , G06F9/3013 , G06F9/345 , G06F9/3885
摘要： A processor having a modified Harvard architecture having first and second memories, an address register file divided into first and second sets of registers, first and second stream registers, and a general purpose register file for performing data streaming. The first and second sets of registers respectively address the first and second memories which, in turn, load data into the first and second stream registers. An arithmetic logic unit (ALU) accepts the stream registers and general purpose registers as inputs. Stream instructions are encoded such that a single instruction specifies an ALU operation performed on selected ALU inputs and where to store the results of the ALU operation, loads new values into the stream registers, and updates the address registers. A stream instruction has three operand fields respectively specifying two operands for the next ALU operation and a location to store the result of the current ALU operation. The bits in the fields for specifying a stream register and addressing mode are positionally overlapped with the bits for specifying a particular general purpose register. This encoding allows a simple instruction decoding mechanism while enabling parallel memory accesses and address update in a compact instruction.
摘要翻译： 具有经修改的哈佛架构的处理器具有第一和第二存储器，被分成第一和第二组寄存器的地址寄存器文件，第一和第二流寄存器以及用于执行数据流的通用寄存器文件。 第一和第二组寄存器分别对第一和第二存储器进行寻址，其又将数据加载到第一和第二流寄存器中。 算术逻辑单元（ALU）接受流寄存器和通用寄存器作为输入。 流指令被编码，使得单个指令指定对所选ALU输入执行的ALU操作以及在哪里存储ALU操作的结果，将新值加载到流寄存器中，并更新地址寄存器。 流指令具有三个操作数字段，分别指定下一个ALU操作的两个操作数和存储当前ALU操作结果的位置。 用于指定流寄存器和寻址模式的字段中的位与用于指定特定通用寄存器的位位置地重叠。 该编码允许简单的指令解码机制，同时在紧凑指令中实现并行存储器访问和地址更新。
-
公开(公告)号：US09911167B2
公开(公告)日：2018-03-06
申请号：US13401057
申请日：2012-02-21
申请人： Alan Ferris James , Nitin Agrawal
发明人： Alan Ferris James , Nitin Agrawal
摘要： Certain examples provide methods, systems and apparatus of content-driven clinical information management. An example method includes facilitating authoring of content and combination of the content into a content-based application, wherein content represents a parameterization of instructions to instruct the content-based application how to operate, the content formulated according to one or more detailed clinical models. The example method includes packaging and deploying the content-based application using a processor to one or more targets for installation. The example method includes facilitating installation of the packaged content-based application at the one or more targets. The example method includes managing the content-based application remotely from the one or more targets. In the example method, content is to be created, stored, deployed, and retrieved independently of the creation and deployment of the content-based application consuming data based on the content.
-
-
-
-
-
-
-
-
-
搜索结果
24 条记录 (耗时 0.022 秒)