会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Systems and methods for creating context sensitive graph topologies based on multidimensional context information
    • 基于多维上下文信息创建上下文敏感图拓扑的系统和方法
    • US09411555B2
    • 2016-08-09
    • US13645135
    • 2012-10-04
    • SAP AG
    • Wolfgang PfeiferMatthaeus MartynusBuenyamin EskiocakAlexander Straubach
    • G06F7/60G06F17/10G06F9/44G06F17/30G06F17/50
    • G06F8/10G06F17/30651G06F17/30958G06F17/50
    • In one embodiment, a computer-implemented method comprises receiving a first user instruction in a controller. The controller stores information about a first plurality of metaquarks and a first graph topology creating expression. The method further includes generating, by the controller, an original graph topology based on the first plurality of metaquarks and the first graph topology creating expression and the first user instruction, and generating first display information based on the original graph topology. The method may further comprise receiving a second user instruction in the controller; generating a second plurality of metaquarks and a second graph topology creating expression based on the second user instruction; generating, by the controller, a modified graph topology based on the first plurality of metaquarks, the second plurality of metaquarks, and the second graph topology creating expression; and generating second display information based on the modified graph topology.
    • 在一个实施例中,计算机实现的方法包括在控制器中接收第一用户指令。 控制器存储有关第一多个元标记和创建表达式的第一图形拓扑的信息。 该方法还包括由控制器基于第一多个元标记和第一图形拓扑创建表达式和第一用户指令来生成原始图形拓扑,以及基于原始图形拓扑生成第一显示信息。 该方法还可以包括在控制器中接收第二用户指令; 生成基于所述第二用户指令创建表达的第二多个元标记和第二图形拓扑; 由所述控制器生成基于所述第一多个元标记,所述第二多个元标记和所述第二图拓扑创建表达式的修改图形拓扑; 以及基于所述修改的图形拓扑生成第二显示信息。
    • 6. 发明申请
    • METHOD OF AND SYSTEM FOR DISPLAYING A PLURALITY OF USER-SELECTABLE REFINEMENTS TO A SEARCH QUERY
    • 用于显示用户选择性研究的多项搜索查询的方法和系统
    • US20150006504A1
    • 2015-01-01
    • US14243199
    • 2014-04-02
    • YANDEX EUROPE AG
    • Andrey Grigorievich PLAKHOVAlexander Ivanovich MAZAYKINMarina Sergeevna KHORUZHENKO
    • G06F17/30
    • G06F17/30651G06F17/3053G06F17/30554G06F17/30867
    • Method of displaying by a client application in communication with a search engine a plurality of user-selectable refinements to a search query including a search term, comprising: sending the search query; receiving search results and suggested search query refinements determined based at least in part on an analysis of groups of related search queries, each suggested search query refinement corresponding to a refined search query including the search term and an additional search term; displaying search results and, apart from a search bar, refinements, refinements being selectable by a user via a graphical object; receiving a selection of one of the refinements, the selection corresponding to a refined search query including the search term and an additional search term; receiving refined search results; and displaying refined search results and a visual representation of a refinement relationship between the search query and the refined search query. Related systems are also disclosed.
    • 一种由客户应用程序与搜索引擎进行通信的方法,所述方法包括:发送所述搜索查询; 接收至少部分地基于相关搜索查询组的分析确定的搜索结果和建议的搜索查询优化,每个建议的搜索查询细化对应于包括搜索项和附加搜索项的精简搜索查询; 显示搜索结果,并且除了搜索栏之外,经由图形对象可由用户选择的细化,细化; 接收对所述细化之一的选择,所述选择对应于包括所述搜索项和附加搜索项的精炼搜索查询; 接收精确的搜索结果; 并显示精确的搜索结果以及搜索查询和精确搜索查询之间的细化关系的视觉表示。 还公开了相关系统。
    • 9. 发明授权
    • Mechanisms for searching enterprise data graphs
    • 搜索企业数据图的机制
    • US08682932B2
    • 2014-03-25
    • US13398794
    • 2012-02-16
    • Nikhil RaghavanRavi MurthyAman Naimat
    • Nikhil RaghavanRavi MurthyAman Naimat
    • G06F7/00
    • G06F17/30651G06F17/30112G06F17/30958
    • Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.
    • 从规范化数据有效地识别非结构化查询的高度相关的搜索结果。 服务器显示每个数据对象之间的关系。 对于每个搜索项,服务器识别映射到该术语的候选数据对象集合。 服务器至少部分地基于图形的链接分析中的一个或多个来计算候选数据对象的优先级分数; 或描述对候选数据对象的结构约束的元数据的分析。 基于该图,服务器识别一个或多个搜索结果子图,每个包括来自每个候选集的至少一个数据对象。 服务器按照候选数据对象的优先级得分的顺序查找子图。 服务器可以提前终止其搜索,部分原因是优先级候选数据对象增加了首先接收相关搜索结果的可能性。