会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 23. 发明授权
    • Method and apparatus for optimizing queries over vertically stored database
    • 用于优化垂直存储数据库查询的方法和装置
    • US07987179B2
    • 2011-07-26
    • US12271038
    • 2008-11-14
    • Li MaYue PanChen WangYing Yan
    • Li MaYue PanChen WangYing Yan
    • G06F17/30
    • G06F17/30451
    • A method and device for optimizing queries over a vertically stored database. Items in the database are partitioned into several partitions each having a partition signature. The method includes decomposing a first query received from a user into multiple first subqueries; generating a signature for each first subquery in a way corresponding to the way of generating the partition signature; comparing the signature of each first subquery with partition signatures of all partitions respectively to obtain all partitions matching the first subquery; rewriting a second subquery translated from the first subquery based on the matching partitions to obtain a rewritten second subquery; and composing rewritten second subqueries for all first subqueries to form a second query so that queries are executed over the database using the second query.
    • 一种用于通过垂直存储的数据库优化查询的方法和设备。 数据库中的项目被分成几个具有分区签名的分区。 该方法包括将从用户接收的第一查询分解成多个第一子查询; 以与生成分区签名的方式相对应的方式为每个第一子查询生成签名; 将每个第一子查询的签名分别与所有分区的分区签名进行比较,以获得与第一子查询匹配的所有分区; 基于匹配分区重写从第一子查询翻译的第二子查询,以获得重写的第二子查询; 并为所有第一个子查询组合重写的第二个子查询以形成第二个查询,以便使用第二个查询在数据库上执行查询。
    • 24. 发明授权
    • Path-based ranking of unvisited web pages
    • 基于路径的未访问网页排名
    • US07979444B2
    • 2011-07-12
    • US12183751
    • 2008-07-31
    • Xiaochuan MaYue PanHui Su
    • Xiaochuan MaYue PanHui Su
    • G06F17/30
    • G06F17/30864Y10S707/99933Y10S707/99936Y10S707/99943
    • Path-based ranking of unvisited Web pages for WWW crawling is provided, via identifying all the paths beginning with a “seed” URL and leading to visited relevant web pages as “good-path set”, and for each unvisited web page, identifying the paths beginning from the “seed” URL leading to it as “partial-path set”; classifying all the visited web pages and labeling each web Page with the labels of a class or classes it belongs to; training a statistic model for generalizing the common patterns among all ones of “good-path set”; and evaluating the “partial-path set” with the statistic model and ranking the unvisited web pages with the evaluation results.
    • 通过识别从“种子”URL开始的所有路径,并将访问过的相关网页导向为“良好路径集”,并为每个未访问的网页标识,以提供用于WWW抓取的未访问网页的基于路径的排名 从“种子”URL开始的路径导致它作为“部分路径集”; 对所有访问的网页进行分类,并使用所属类别的标签将每个网页标注; 培养统一模式,推广“好路径”的共同模式; 并用统计模型评估“部分路径集”,并通过评估结果对未访问的网页进行排序。
    • 25. 发明授权
    • System and method for automatically refining ontology within specific context
    • 在特定上下文中自动优化本体的系统和方法
    • US07925637B2
    • 2011-04-12
    • US11853852
    • 2007-09-12
    • Li MaYue PanChen Wang
    • Li MaYue PanChen Wang
    • G06F7/00G06F17/00
    • G06F17/30734
    • The present invention provides a system and method for automatically refining ontology within a specific context. The system comprises: a rich context extractor for discovering a semantics relationship conflict existing between an original ontology schema and application data; and an ontology schema and mapping refiner for refining the original ontology schema based on the semantics relationship conflict discovered by the rich context extractor, and creating a new mapping between the refined ontology schema and a data schema of the application data. According to the invention, users can save a lot of work of manual refinement, since the ontology schema is automatically refined based on contexts in the application data.
    • 本发明提供了一种用于在特定上下文内自动优化本体的系统和方法。 该系统包括:用于发现原始本体模式和应用数据之间存在的语义关系冲突的丰富上下文提取器; 以及本体模式和映射精简器,用于根据丰富上下文提取器发现的语义关系冲突来完善原始本体模式,并在精简本体模式和应用程序数据的数据模式之间创建新的映射。 根据本发明,用户可以节省大量的手工细化工作,因为基于应用数据中的上下文自动地改进了本体模式。
    • 26. 发明申请
    • TRANSLATION SYSTEM AND METHOD FOR SPARQL QUERIES
    • SPARQL QUERIES的翻译系统和方法
    • US20100250577A1
    • 2010-09-30
    • US12732240
    • 2010-03-26
    • Feng CaoGang HuLi MaYue PanXing Zhi Sun
    • Feng CaoGang HuLi MaYue PanXing Zhi Sun
    • G06F17/30
    • G06F17/30448
    • A computer-implemented system and method for translating a SPARQL query. The system includes: a parser/lexer for parsing the SPARQL query; a hidden negative pattern detector for detecting a hidden negative pattern in the parsed SPARQL query; a hidden negative pattern translator for translating the detected hidden negative pattern into an explicit negative pattern; a separator for separating the explicit negative pattern from a positive pattern in the parsed SPARQL query; a negative pattern translator for translating the explicit negative pattern into a negative portion of an SQL statement; a positive pattern translator for translating the positive pattern into a positive portion of the SQL statement; and an SQL statement combiner for combining the negative portion of the SQL statement with the positive portion of the SQL statement.
    • 用于翻译SPARQL查询的计算机实现的系统和方法。 该系统包括:用于解析SPARQL查询的解析器/词法分析器; 隐藏的负模式检测器,用于检测解析的SPARQL查询中的隐藏消极模式; 隐藏的负模式翻译器,用于将检测到的隐藏负模式转换成显式负模式; 用于将解析的SPARQL查询中的显式负模式与正模式分离的分隔符; 用于将显式负模式转换为SQL语句的负部分的负模式转换器; 一个积极的模式翻译器,用于将积极模式转换为SQL语句的正面部分; 以及用于将SQL语句的负部分与SQL语句的正部分组合的SQL语句组合器。
    • 27. 发明申请
    • SYSTEM AND METHOD FOR GRAPH COARSENING
    • 用于图形加密的系统和方法
    • US20080313251A1
    • 2008-12-18
    • US12136191
    • 2008-06-10
    • Li MaYue PanChen WangZhemin Zhu
    • Li MaYue PanChen WangZhemin Zhu
    • G06F17/10
    • G06Q30/02
    • A method for coarsening a graph, the graph including a plurality of vertices, the method incorporating: selecting a vertex from the plurality of vertices; calculating a merge modularity gain between the selected vertex and its adjacent vertices, wherein the adjacent vertices are a function of the position of the selected vertex in the graph; calculating mathematically a similarity between the selected vertex and its adjacent vertices; determining mathematically, based on the calculated merge modularity gain and similarity, whether the selected vertex can be merged with one of its adjacent vertices; and performing the merge when merge is determined possible and updating the list of adjacent vertices. A system and a storage medium to perform coarsening of the graph is also provided.
    • 一种用于粗化图形的方法,所述图形包括多个顶点,所述方法包括:从所述多个顶点中选择顶点; 计算所选择的顶点和其相邻顶点之间的合并模块化增益,其中所述相邻顶点是所述图中所选顶点的位置的函数; 在数学上计算所选顶点与其相邻顶点之间的相似度; 基于所计算的合并模块性增益和相似度,数学地确定所选择的顶点是否可以与其相邻顶点之一合并; 并且当合并确定时执行合并并且更新相邻顶点的列表。 还提供了用于执行图形粗化的系统和存储介质。
    • 28. 发明申请
    • METHOD AND APPARATUS FOR THE SEARCHING OF INFORMATION RESOURCES
    • 搜索信息资源的方法和设备
    • US20080306928A1
    • 2008-12-11
    • US12111898
    • 2008-04-29
    • JEAN-SEBASTIEN BRUNNERLI MAYUE PANLEI ZHANG
    • JEAN-SEBASTIEN BRUNNERLI MAYUE PANLEI ZHANG
    • G06F17/30
    • G06F16/907
    • The present invention discloses a method and apparatus for the searching of information resources. A method includes steps of: according to a current query for a first type of information resource, obtaining a result of query on said first type of information resource, one or more facets of said first type of information resource and metadata under each facet, and relationships between said first type of information resource and other types of information resource that at least include a second type of information resource; and returning to a user the obtained result of query on said first type of information resource, the one or more facets of said first type of information resource and the metadata under each facet, and the relationships between said first type of information resource and other types of information resource that at least include a second type of information resource.
    • 本发明公开了一种搜索信息资源的方法和装置。 一种方法包括以下步骤:根据对第一类信息资源的当前查询,获得对所述第一类信息资源的查询结果,所述第一类信息资源的一个或多个方面以及每个方面的元数据,以及 所述第一类型的信息资源与至少包括第二类型的信息资源的其他类型的信息资源之间的关系; 并且向所述用户返回所获得的对所述第一类型的信息资源的查询结果,所述第一类型的信息资源的一个或多个方面和每个方面的元数据,以及所述第一类信息资源与其他类型之间的关系 至少包括第二类信息资源的信息资源。
    • 29. 发明申请
    • System, and method for interactive browsing
    • 系统和方法进行交互式浏览
    • US20080222103A1
    • 2008-09-11
    • US11715090
    • 2007-03-07
    • Li ZhangTao LiuJian Min JianZhong SuYue Pan
    • Li ZhangTao LiuJian Min JianZhong SuYue Pan
    • G06F17/30
    • G06F17/30899G06F17/30716Y10S707/99931Y10S707/99933Y10S707/99934
    • The present invention provides a system and method for achieving interactive browsing. Said system is coupled to a knowledge base and a document database, said knowledge base stores a plurality of terms and information relating to each term, and said document database stores a plurality of documents. Said system comprises term acquiring means, for acquiring terms in which a user has much interest; first extracting means, for extracting information relating to the terms in which the user has much interest, from the knowledge base; second extracting means, for extracting documents containing the terms in which the user has much interest, from the document database; a first display part in a user interface, for displaying information extracted by the first extracting means; and a second display part in the user interface, for displaying a list of the documents extracted by the second extracting means. With the present invention, one can browse both documents and information on terms in the documents in a single interface.
    • 本发明提供了一种用于实现交互式浏览的系统和方法。 所述系统耦合到知识库和文档数据库,所述知识库存储与每个术语相关的多个术语和信息,并且所述文档数据库存储多个文档。 所述系统包括术语获取装置,用于获取用户感兴趣的术语; 第一提取装置,用于从知识库中提取与用户有兴趣的术语有关的信息; 第二提取装置,用于从文档数据库提取包含用户有兴趣的术语的文档; 用于显示由第一提取装置提取的信息的用户界面中的第一显示部分; 以及用户界面中的第二显示部分,用于显示由第二提取装置提取的文档的列表。 利用本发明,可以在单个界面中浏览文档中的文档和文档中的术语信息。