利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

13 条记录 (耗时 0.03 秒)

    LOCAL COMPUTATION OF RANK CONTRIBUTIONS
    1.
    发明申请
    LOCAL COMPUTATION OF RANK CONTRIBUTIONS 有权
    排名贡献的本地计算

    公开(公告)号：US20090030916A1

    公开(公告)日：2009-01-29

    申请号：US12124239

    申请日：2008-05-21

    申请人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    发明人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864

    摘要： The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.

    摘要翻译： 所要求保护的主题涉及可以识别，存储和/或输出有向图中的顶点等级的局部贡献的架构。 架构可以接收有向图和参数，并检查顶点的局部子集（例如，给定顶点的局部），以便确定本地支持集。 本地支持集可以包括一组局部顶点，每个顶点将参数的最小部分贡献给顶点的等级。 本地支持集可以作为对整个图的顶点的支持集和/或等级的估计的基础，并且可以用作检测链接或网络垃圾邮件以及其他基于影响的社交网络应用的手段。

    Local computation of rank contributions
    2.
    发明授权
    Local computation of rank contributions 有权
    地方计算等级的贡献

    公开(公告)号：US08438189B2

    公开(公告)日：2013-05-07

    申请号：US12124239

    申请日：2008-05-21

    申请人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    发明人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30864

    摘要： The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.

    摘要翻译： 所要求保护的主题涉及可以识别，存储和/或输出有向图中的顶点等级的局部贡献的架构。 架构可以接收有向图和参数，并检查顶点的局部子集（例如，给定顶点的局部），以便确定本地支持集。 本地支持集可以包括一组局部顶点，每个顶点将参数的最小部分贡献给顶点的等级。 本地支持集可以作为对整个图的顶点的支持集和/或等级的估计的基础，并且可以用作检测链接或网络垃圾邮件以及其他基于影响的社交网络应用的手段。

    Efficient large-scale access control for internet/intranet information systems
    5.
    发明授权
    Efficient large-scale access control for internet/intranet information systems 失效
    有效的大规模访问控制互联网/内部网信息系统

    公开(公告)号：US06219667B1

    公开(公告)日：2001-04-17

    申请号：US09086272

    申请日：1998-05-28

    申请人： Qi Lu ,  Shang-Hua Teng

    发明人： Qi Lu ,  Shang-Hua Teng

    IPC分类号： G06F1700

    CPC分类号： H04L63/10 ,  G06F21/6218 ,  Y10S707/954 ,  Y10S707/956 ,  Y10S707/99936 ,  Y10S707/99938 ,  Y10S707/99939 ,  Y10S707/99942

    摘要： An efficient method and apparatus for regulating access to information objects stored in a database in which there are a large number of users and access groups. The invention uses a representation of a hierarchical access group structure in terms of intervals over a set of integers and a decomposition scheme that reduces any group structure to ones that have interval representation. This representation allows the problem for checking access rights to be reduced to an interval containment problem. An interval tree, a popular data structure in computational geometry, may be implemented to efficiently execute the access-right checking method.

    摘要翻译： 一种有效的方法和装置，用于调节对存储在数据库中的信息对象的访问，其中存在大量的用户和访问组。 本发明使用对一组整数的间隔的分级存取组结构的表示，以及将任何组结构减小为具有间隔表示的组的结构的分解方案。 该表示允许将访问权限检查的问题减少到间隔容纳问题。 可以实现间隔树，即计算几何中的流行数据结构，以有效地执行访问权限检查方法。

    Collaborative team crawling:Large scale information gathering over the internet
    7.
    发明授权
    Collaborative team crawling:Large scale information gathering over the internet 失效
    协作小组爬行：通过互联网收集大量信息

    公开(公告)号：US06182085B2

    公开(公告)日：2001-01-30

    申请号：US09086379

    申请日：1998-05-28

    申请人： Matthias Eichstaedt ,  Daniel Alexander Ford ,  Tobin Jon Lehman ,  Qi Lu ,  Shang-Hua Teng

    发明人： Matthias Eichstaedt ,  Daniel Alexander Ford ,  Tobin Jon Lehman ,  Qi Lu ,  Shang-Hua Teng

    IPC分类号： G06F1730

    CPC分类号： G06F9/5083 ,  G06F17/30864 ,  Y10S707/99943 ,  Y10S707/99945 ,  Y10S707/99948

    摘要： A distributed collection of web-crawlers to gather information over a large portion of the cyberspace. These crawlers share the overall crawling through a cyberspace partition scheme. They also collaborate with each other through load balancing to maximally utilize the computing resources of each of the crawlers. The invention takes advantage of the hierarchical nature of the cyberspace namespace and uses the syntactic components of the URL structure as the main vehicle for dividing and assigning crawling workload to individual crawler. The partition scheme is completely distributed in which each crawler makes the partitioning decision based on its own crawling status and a globally replicated partition tree data structure.

    摘要翻译： 分布式的网络爬虫收集器，用于在大量网络空间中收集信息。 这些爬虫共享通过网络空间分区方案的整体爬网。 他们还通过负载平衡相互协作，最大限度地利用每个爬虫的计算资源。 本发明利用了网络空间命名空间的层次性，并将URL结构的句法组件作为将抓取工作量分配给各个爬虫的主要工具。 分区方案是完全分布的，其中每个爬行器根据其自身的爬行状态和全局复制的分区树数据结构进行分区决定。

    Generating local addresses and communication sets for data-parallel programs
    8.
    发明授权
    Generating local addresses and communication sets for data-parallel programs 失效
    生成数据并行程序的本地地址和通讯组

    公开(公告)号：US5450313A

    公开(公告)日：1995-09-12

    申请号：US217404

    申请日：1994-03-24

    申请人： John R. Gilbert ,  Shang-Hua Teng ,  Robert S. Schreiber ,  Siddhartha Chatterjee ,  Fred J. E. Long

    发明人： John R. Gilbert ,  Shang-Hua Teng ,  Robert S. Schreiber ,  Siddhartha Chatterjee ,  Fred J. E. Long

    IPC分类号： G06F9/45 ,  G06F15/16

    CPC分类号： G06F8/447 ,  G06F8/45

    摘要： An optimizing compilation process generates executable code which defines the computation and communication actions that are to be taken by each individual processor of a computer having a distributed memory, parallel processor architecture to run a program written in a data-parallel language. To this end, local memory layouts of the one-dimensional and multidimensional arrays that are used in the program are derived from one-level and two-level data mappings consisting of alignment and distribution, so that array elements are laid out in canonical order and local memory space is conserved. Executable code then is generated to produce at program run time, a set of tables for each individual processor for each computation requiring access to a regular section of an array, so that the entries of these tables specify the spacing between successive elements of said regular section resident in the local memory of said processor, and so that all the elements of said regular section can be located in a single pass through local memory using said tables. Further executable code is generated to produce at program run time, another set of tables for each individual processor for each communication action requiring a given processor to transfer array data to another processor, so that the entries of these tables specify the identity of a destination processor to which the array data must be transferred and the location in said destination processor's local memory at which the array data must be stored, and so that all of said array data can be located in a single pass through local memory using these communication tables. And, executable node code is generated for each individual processor that uses the foregoing tables at program run time to perform the necessary computation and communication actions on each individual processor of the parallel computer.

    摘要翻译： 优化编译过程产生可执行代码，其定义将由具有分布式存储器的计算机的每个单独处理器采取的计算和通信动作，并行处理器架构来运行以数据并行语言编写的程序。 为此，在程序中使用的一维和多维数组的本地存储器布局是从由对齐和分布组成的一级和两级数据映射导出的，因此数组元素以规范顺序排列， 本地存储空间是保守的。 然后生成可执行代码以在程序运行时产生用于每个单独处理器的一组表，用于需要访问数组的常规部分的每个计算，使得这些表的条目指定所述常规部分的连续元素之间的间隔 驻留在所述处理器的本地存储器中，并且使得所述常规部分的所有元素可以位于通过使用所述表的本地存储器的单次传递中。 生成进一步的可执行代码以在程序运行时产生用于每个单独处理器的另一组表，用于每个通信动作，要求给定处理器将阵列数据传送到另一个处理器，以便这些表的条目指定目标处理器的标识 必须传送数组数据以及必须存储阵列数据的所述目的地处理器的本地存储器中的位置，并且使得所有所述阵列数据可以位于通过使用这些通信表的本地存储器的单次传递中。 并且，对于在程序运行时使用上述表的每个单独处理器生成可执行节点代码，以在并行计算机的每个单独处理器上执行必要的计算和通信动作。

    Method and system for voice guided secure entry of private data in a public setting
    9.
    发明授权
    Method and system for voice guided secure entry of private data in a public setting 有权
    语音指导方法和系统在公共场合下安全地输入私人数据

    公开(公告)号：US06519699B2

    公开(公告)日：2003-02-11

    申请号：US09130594

    申请日：1998-08-07

    申请人： Qi (NMN) Lu ,  Shang-Hua Teng

    发明人： Qi (NMN) Lu ,  Shang-Hua Teng

    IPC分类号： H04K100

    CPC分类号： H04L9/00 ,  H04K1/00 ,  H04L2209/80 ,  H04M3/493 ,  H04M2203/609

    摘要： Private user data is securely entered from a public location in a way that the private user data cannot be ascertained by observers. A voice agent generates vocal instructions for a user, instructing the user to enter response data. The vocal instructions are communicated to the user with a telephonic link, in a manner that is secure from observers of entry of the response data. The instructions implement an encryption function, which causes the private user data to be encrypted within the response data. The response data is entered by the user vocally into a telephone, or by pressing buttons on a telephone keypad, or by pressing keys on a computer keyboard. The response data entered by the user is received by a security agent, which ascertains the private user data from the response data, and which also determines the validity of the data.

    摘要翻译： 私人用户数据以公共位置安全地输入，私人用户数据不能被观察者确定。 语音代理为用户生成声音指令，指示用户输入响应数据。 通过电话链接将声音指令以与响应数据的输入的观察者相当的方式传送给用户。 指令实现加密功能，这使得专用用户数据在响应数据内被加密。 响应数据由用户通过语音输入到电话中，或者通过按电话键盘上的按钮，或者按下计算机键盘上的键。 由用户输入的响应数据由安全代理接收，安全代理从响应数据确定私有用户数据，并且还确定数据的有效性。

    Graphical user interface to query music by examples
    10.
    发明授权
    Graphical user interface to query music by examples 失效
    图形用户界面，通过示例查询音乐

    公开(公告)号：US06674452B1

    公开(公告)日：2004-01-06

    申请号：US09543218

    申请日：2000-04-05

    申请人： Reiner Kraft ,  Qi Lu ,  Shang-Hua Teng

    发明人： Reiner Kraft ,  Qi Lu ,  Shang-Hua Teng

    IPC分类号： G06F1730

    CPC分类号： G06F17/30758 ,  G06F17/30017 ,  G06F17/30743 ,  G06F17/30749 ,  Y10S707/99943

    摘要： A According to the invention, a music search system includes a music player, music analyzer, a search engine and a sophisticated user interface that enables users to visually build complex query profiles from the structural information of one or more musical pieces. The complex query profiles are useful for performing searches for musical pieces matching the structural information in the query profile. The system allows the user to supply an existing piece of music, or some components thereof, as query arguments, and lets the music search engine find music that is similar to the given sample by certain similarity measurement.

    摘要翻译： 根据本发明，音乐搜索系统包括音乐播放器，音乐分析器，搜索引擎和复杂的用户界面，使得用户能够从一个或多个音乐作品的结构信息可视地构建复杂的查询配置文件。 复杂查询配置文件对于执行与查询配置文件中的结构信息匹配的音乐作品的搜索很有用。 该系统允许用户提供现有的音乐片段或其一些组件作为查询参数，并且使得音乐搜索引擎通过某种相似性度量来找到与给定样本类似的音乐。