利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

12 条记录 (耗时 0.017 秒)

    METHODS FOR FILTERING DATA AND FILLING IN MISSING DATA USING NONLINEAR INFERENCE
    1.
    发明申请
    METHODS FOR FILTERING DATA AND FILLING IN MISSING DATA USING NONLINEAR INFERENCE 审中-公开
    使用非线性干扰过滤数据和填充数据丢失的方法

    公开(公告)号：US20100274753A1

    公开(公告)日：2010-10-28

    申请号：US12784155

    申请日：2010-05-20

    申请人： Edo Liberty ,  Steven Zucker ,  Yosi Keller ,  Mauro M. Maggioni ,  Ronald R. Coifman ,  Frank Geshwind

    发明人： Edo Liberty ,  Steven Zucker ,  Yosi Keller ,  Mauro M. Maggioni ,  Ronald R. Coifman ,  Frank Geshwind

    IPC分类号： G06N5/02

    CPC分类号： G06F16/951 ,  G06F16/3322 ,  G06F16/3338

    摘要： The present invention is directed to a method for inferring/estimating missing values in a data matrix d(q, r) having a plurality of rows and columns comprises the steps of: organizing the columns of the data matrix d(q, r) into affinity folders of columns with similar data profile, organizing the rows of the data matrix d(q, r) into affinity folders of rows with similar data profile, forming a graph Q of augmented rows and a graph R of augmented columns by similarity or correlation of common entries; and expanding the data matrix d(q, r) in terms of an orthogonal basis of a graph Q×R to infer/estimate the missing values in said data matrix d(q, r).on the diffusion geometry coordinates.

    摘要翻译： 本发明涉及一种用于推断/估计具有多个行和列的数据矩阵d（q，r）中的缺失值的方法，包括以下步骤：将数据矩阵d（q，r）的列组织成 具有相似数据简档的列的亲和文件夹，将数据矩阵d（q，r）的行组织成具有相似数据轮廓的行的亲和文件夹，通过相似性或相关性形成增强行的图形Q和增强列的图形R 的共同条目; 并且根据图形Q×R的正交基础扩展数据矩阵d（q，r），以推导/估计扩散几何坐标中所述数据矩阵d（q，r）中的缺失值。

    Design of tags for lookup of non-volatile registers
    2.
    发明授权
    Design of tags for lookup of non-volatile registers 失效
    用于查找非易失性寄存器的标签设计

    公开(公告)号：US6119206A

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

    申请号：US680575

    申请日：1996-07-12

    申请人： Vijay K. Tatkar ,  Bruce A. Delagi ,  Terrence C. Miller ,  Joel Steven Zucker

    发明人： Vijay K. Tatkar ,  Bruce A. Delagi ,  Terrence C. Miller ,  Joel Steven Zucker

    IPC分类号： G06F11/36 ,  G06F12/06

    CPC分类号： G06F11/3612

    摘要： Stack tracebacks are performed in debugging and exception handling routines, and involve providing the values of non-volatile registers at the time of entry into each function in a call chain. One stack traceback technique includes performing the following two steps for each virtual address at which a function call in the call chain is made: (1) locating the tag section whose virtual address range includes the virtual address; and (2) locating a tag in the tag section found in step (1), whose virtual address range includes the virtual address. The tag found in step (2) indicates which of the values, if any, respectively held by the non-volatile registers upon entry to the particular function in which the above function call is made, are stored in a stack frame for the particular function at the time of the function call.

    摘要翻译： 堆栈跟踪在调试和异常处理例程中执行，并且涉及在进入呼叫链中的每个功能时提供非易失性寄存器的值。 一种堆栈追溯技术包括对进行呼叫链中的功能调用的每个虚拟地址执行以下两个步骤：（1）定位虚拟地址范围包括虚拟地址的标签段; 以及（2）将标签定位在步骤（1）中找到的标签部分中，其虚拟地址范围包括虚拟地址。 在步骤（2）中找到的标签指示在进入上述功能调用的特定功能时分别由非易失性寄存器保持的值中的哪一个存储在特定功能的堆栈帧中 在函数调用时。

    Application binary interface and method of interfacing binary application program to digital computer
    3.
    发明授权
    Application binary interface and method of interfacing binary application program to digital computer 失效

    公开(公告)号：US5835743A

    公开(公告)日：1998-11-10

    申请号：US269035

    申请日：1994-06-30

    申请人： J. Steven Zucker

    发明人： J. Steven Zucker

    IPC分类号： G06F9/40 ,  G06F9/42 ,  G06F9/445 ,  G06F12/10

    CPC分类号： G06F9/4426 ,  G06F12/109 ,  G06F9/44521

    摘要： An application binary interface includes linkage structures for interfacing a binary application program to a digital computer. A function in a relocatable shared object module obtains the absolute address of a Global Offset Table (GOT) in the module using relative branch and link instructions through the computer's link register. A dynamic linker lazily constructs a Procedure Linkage Table (PLT) and a pointer table for an object module in a process memory image in which space is allocated for the PLT, but the PLT is not initially provided. The pointer table stores absolute addresses of external functions that cannot be reached by relative branching from the module. The PLT receives calls to these functions, gets the absolute addresses from the pointer table and branches to the absolute addresses of the functions. The PLT also receives calls to functions that can be reached by relative branching from the module, and causes relative branching to the functions. A status instruction precedes each call instruction to a variable argument list function that can pass floating point arguments, indicating if floating point arguments will actually be passed. If so, the function saves the contents of the floating point argument registers in memory. If not, the contents of the floating point argument registers are not saved. Virtual address spaces are allocated for processes respectively. Page table entries for translation of the virtual address spaces into physical addresses are not removed as processes terminate, but only after all virtual address spaces have been allocated.

    Application binary interface and method of interfacing binary application program to digital computer including efficient acquistion of global offset table (GOT) absolute base address
    4.
    发明授权
    Application binary interface and method of interfacing binary application program to digital computer including efficient acquistion of global offset table (GOT) absolute base address 失效
    应用二进制接口和将二进制应用程序连接到数字计算机的方法，包括全局偏移表（GOT）绝对基址的高效采集

    公开(公告)号：US5822787A

    公开(公告)日：1998-10-13

    申请号：US744446

    申请日：1996-11-08

    申请人： J. Steven Zucker

    发明人： J. Steven Zucker

    IPC分类号： G06F9/40 ,  G06F9/42 ,  G06F9/445 ,  G06F12/10 ,  G06F12/06

    CPC分类号： G06F9/4426 ,  G06F12/109 ,  G06F9/44521

    摘要： An application binary interface includes linkage structures for interfacing a binary application program to a digital computer. A function in a relocatable shared object module obtains the absolute address of a Global Offset Table (GOT) in the module using relative branch and link instructions through the computer's link register. The GOT contains addresses of global data such as constants and variables that are identified by symbols and are located outside the module. Implementation requires only three simple instructions, one in the GOT and two in the calling function. The module can load the absolute address of a data item into appropriate registers and read or write the data from memory using a conventional RISC relative address read or write instruction.

    摘要翻译： 应用二进制接口包括用于将二进制应用程序连接到数字计算机的连接结构。 可重新定位的共享对象模块中的功能通过计算机的链接寄存器使用相对分支和链接指令获取模块中的全局偏移表（GOT）的绝对地址。 GOT包含全局数据的地址，例如由符号标识并位于模块外部的常量和变量。 实现只需要三个简单的指令，一个在GOT中，另一个在调用函数中。 模块可以将数据项的绝对地址加载到适当的寄存器中，并使用常规RISC相对地址读或写指令从存储器中读取或写入数据。

    Method and structure for interrupt polling signal bandwidth allocation in universal serial bus (USB) system
    6.
    发明授权
    Method and structure for interrupt polling signal bandwidth allocation in universal serial bus (USB) system 失效
    通用串行总线（USB）系统中的中断轮询信号带宽分配的方法和结构

    公开(公告)号：US6101550A

    公开(公告)日：2000-08-08

    申请号：US814585

    申请日：1997-03-10

    申请人： J. Steven Zucker

    发明人： J. Steven Zucker

    IPC分类号： G06F13/366 ,  G06F13/24 ,  G06F13/38 ,  G06F15/16

    CPC分类号： G06F13/24

    摘要： A Universal Serial Bus (USB) controller includes an allocation unit configured to allocate bandwidths to a plurality of nodes in a polling list, each node being capable of storing at least one descriptor representing a respective polling signal. The nodes are arranged in a binary tree structure having a plurality of leaf nodes, a root node, and at least one level of intermediate nodes which are successor nodes for the leaf nodes and predecessor nodes for the root node. The allocation unit is configured to store variables P and S for each node, where P is a maximum bandwidth of polling signals entering a node from predecessor nodes, and S is a sum of bandwidths of polling signals represented by descriptors stored in the node and all successor nodes thereof. It assigns a new device to a node such that a maximum value of P+S for the nodes at each level is minimized. The allocation unit adds a descriptor representing a new polling signal to a node in a specified level which has a minimum value of P+S. After adding a descriptor to a node, the allocation unit alters values of S for the node and all predecessor nodes thereof by adding the bandwidth of the new polling signal represented by the descriptor to the values of S, and alters values of P for successor nodes thereof in accordance with the bandwidth of the polling signal represented by the descriptor.

    摘要翻译： 通用串行总线（USB）控制器包括被配置为向轮询列表中的多个节点分配带宽的分配单元，每个节点能够存储表示相应轮询信号的至少一个描述符。 节点被布置成具有多个叶节点，根节点和作为叶节点和根节点的前导节点的后继节点的中间节点的至少一个级别的二进制树结构。 分配单元被配置为存储每个节点的变量P和S，其中P是从前一个节点进入节点的轮询信号的最大带宽，S是由节点中存储的描述符表示的轮询信号的带宽总和和全部 其后继节点。 它将一个新设备分配给一个节点，使得每个级别的节点的最大P + S值最小化。 分配单元将表示新轮询信号的描述符添加到具有最小值P + S的指定级别中的节点。 在向节点添加描述符之后，分配单元通过将由描述符表示的新轮询信号的带宽与S的值相加来改变节点及其所有前导节点的S的值，并且为后继节点改变P的值 根据由描述符表示的轮询信号的带宽。

    Application binary interface and method of interfacing binary application program to digital computer
    9.
    发明授权
    Application binary interface and method of interfacing binary application program to digital computer 失效
    应用二进制接口和将二进制应用程序连接到数字计算机的方法

    公开(公告)号：US5991871A

    公开(公告)日：1999-11-23

    申请号：US744445

    申请日：1996-11-08

    申请人： J. Steven Zucker

    发明人： J. Steven Zucker

    IPC分类号： G06F9/40 ,  G06F9/42 ,  G06F9/445 ,  G06F12/10

    CPC分类号： G06F9/4426 ,  G06F12/109 ,  G06F9/44521

    摘要： An application binary interface includes linkage structures for interfacing a binary application program to a digital computer. A function in a relocatable shared object module obtains the absolute address of a Global Offset Table (GOT) in the module using relative branch and link instructions through the computer's link register. A dynamic linker lazily constructs a Procedure Linkage Table (PLT) and a pointer table for an object module in a process memory image in which space is allocated for the PLT, but the PLT is not initially provided. The pointer table stores absolute addresses of external functions that cannot be reached by relative branching from the module. The PLT receives calls to these functions, gets the absolute addresses from the pointer table and branches to the absolute addresses of the functions. The PLT also receives calls to functions that can be reached by relative branching from the module, and causes relative branching to the functions. A status instruction precedes each call instruction to a variable argument list function that can pass floating point arguments, indicating if floating point arguments will actually be passed. If so, the function saves the contents of the floating point argument registers in memory. If not, the contents of the floating point argument registers are not saved. Virtual address spaces are allocated for processes respectively. Page table entries for translation of the virtual address spaces into physical addresses are not removed as processes terminate, but only after all virtual address spaces have been allocated.

    摘要翻译： 应用二进制接口包括用于将二进制应用程序连接到数字计算机的连接结构。 可重新定位的共享对象模块中的功能通过计算机的链接寄存器使用相对分支和链接指令获取模块中的全局偏移表（GOT）的绝对地址。 动态连接器在PLT分配空间的过程存储器映像中轻松构造过程链接表（PLT）和对象模块的指针表，但是最初没有提供PLT。 指针表存储通过模块的相对分支无法达到的外部函数的绝对地址。 PLT接收对这些功能的调用，从指针表获取绝对地址，并分支到功能的绝对地址。 PLT还接收来自模块的相对分支可以达到的函数的调用，并导致函数的相对分支。 每个调用指令之前的状态指令都可以传递给可以传递浮点参数的变量参数列表函数，指示浮点参数是否实际上将被传递。 如果是这样，该功能将浮点参数寄存器的内容保存在存储器中。 如果不是，浮点参数寄存器的内容不会被保存。 虚拟地址空间分别用于进程。 将虚拟地址空间转换为物理地址的页表条目不会因为进程终止而在所有虚拟地址空间被分配之后才被删除。