Patents by Inventor Steven Zucker

Steven Zucker has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20150332483
    Abstract: The identification and determination of aspects of the construction of a patient's heart is important for cardiologists and cardiac surgeons in the diagnosis, analysis, treatment, and management of cardiac patients. For example minimally invasive heart surgery demands knowledge of heart geometry, heart fiber orientation, etc. Whilst medical imaging has advanced significantly the accurate three dimensional (3D) rendering from a series of imaging slices remains a critical step in the planning and execution of patient treatment. Embodiments of the invention construct using diffuse MRI data 3D renderings from iterating connections forms derived from arbitrary smooth frame fields to not only corroborate biological measurements of heart fiber orientation but also provide novel biological views in respect of heart fiber orientation etc.
    Type: Application
    Filed: May 14, 2015
    Publication date: November 19, 2015
    Inventors: KALEEM SIDDIQI, EMMANUEL PIUZE-PHANEUF, JON SPORRING, PETER SAVADJIEV, GUSTAV STRIJKERS, STEVEN ZUCKER
  • Publication number: 20140114977
    Abstract: The present invention is directed to a method and computer system for representing a dataset comprising N documents by computing a diffusion geometry of the dataset comprising at least a plurality of diffusion coordinates. The present method and system stores a number of diffusion coordinates, wherein the number is linear in proportion to N.
    Type: Application
    Filed: December 19, 2013
    Publication date: April 24, 2014
    Applicants: PLAIN SIGHT SYSTEMS, INC., YALE UNIVERSITY
    Inventors: RONALD R. COIFMAN, ANDREAS C. COPPI, FRANK B. GESHWIND, STEPHANE S. LAFON, ANN B. LEE, MAURO M. MAGGIONI, FREDERICK J. WARNER, STEVEN ZUCKER, WILLIAM G. FATELEY
  • Publication number: 20130212104
    Abstract: The present invention is directed to a method and computer system for representing a dataset comprising N documents by computing a diffusion geometry of the dataset comprising at least a plurality of diffusion coordinates. The present method and system stores a number of diffusion coordinates, wherein the number is linear in proportion to N.
    Type: Application
    Filed: July 9, 2012
    Publication date: August 15, 2013
    Inventors: RONALD R. COIFMAN, ANDREAS C. COPPI, FRANK GESHWIND, STEPHANE S. LAFON, ANN B. LEE, MAURO M. MAGGIONI, FREDERICK J. WARNER, STEVEN ZUCKER, WILLIAM G. FATELY
  • Publication number: 20120047123
    Abstract: The present invention is directed to a method and computer system for representing a dataset comprising N documents by computing a diffusion geometry of the dataset comprising at least a plurality of diffusion coordinates. The present method and system stores a number of diffusion coordinates, wherein the number is linear in proportion to N.
    Type: Application
    Filed: November 3, 2011
    Publication date: February 23, 2012
    Inventors: RONALD R. COIFMAN, Andreas C. COPPI, Frank GESHWIND, Stephane S. LAFON, Ann B. LEE, Mauro M. MAGGIONI, Frederick J. WARNER, Steven ZUCKER, William G. FATELEY
  • Publication number: 20100274753
    Abstract: 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.
    Type: Application
    Filed: May 20, 2010
    Publication date: October 28, 2010
    Inventors: Edo Liberty, Steven Zucker, Yosi Keller, Mauro M. Maggioni, Ronald R. Coifman, Frank Geshwind
  • Publication number: 20090299975
    Abstract: The present invention is directed to a method and computer system for representing a dataset comprising N documents by computing a diffusion geometry of the dataset comprising at least a plurality of diffusion coordinates. The present method and system stores a number of diffusion coordinates, wherein the number is linear in proportion to N.
    Type: Application
    Filed: March 3, 2009
    Publication date: December 3, 2009
    Inventors: RONALD R. COIFMAN, Andreas C. Coppi, Frank Geshwind, Stephane S. Lafon, Ann B. Lee, Mauro M. Maggioni, Frederick J. Warner, Steven Zucker, William G. Fateley
  • Publication number: 20070214133
    Abstract: 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.
    Type: Application
    Filed: March 7, 2007
    Publication date: September 13, 2007
    Inventors: Edo Liberty, Steven Zucker, Yosi Keller, Mauro Maggioni, Ronald Coifman, Frank Geshwind
  • Publication number: 20060004753
    Abstract: The present invention is directed to a method and computer system for representing a dataset comprising N documents by computing a diffusion geometry of the dataset comprising at least a plurality of diffusion coordinates. The present method and system stores a number of diffusion coordinates, wherein the number is linear in proportion to N.
    Type: Application
    Filed: June 23, 2005
    Publication date: January 5, 2006
    Inventors: Ronald Coifman, Andreas Coppi, Frank Geshwind, Stephane Lafon, Ann Lee, Mauro Maggioni, Frederick Warner, Steven Zucker, William Fateley
  • Patent number: 6119206
    Abstract: 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.
    Type: Grant
    Filed: July 12, 1996
    Date of Patent: September 12, 2000
    Assignee: Sun Microsystems, Inc.
    Inventors: Vijay K. Tatkar, Bruce A. Delagi, Terrence C. Miller, Joel Steven Zucker
  • Patent number: 6101550
    Abstract: 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.
    Type: Grant
    Filed: March 10, 1997
    Date of Patent: August 8, 2000
    Assignee: Sun Microsystems, Inc.
    Inventor: J. Steven Zucker
  • Patent number: 6047362
    Abstract: An application binary interface includes linkage structures for interfacing a binary application program to a digital computer. 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.
    Type: Grant
    Filed: November 8, 1996
    Date of Patent: April 4, 2000
    Assignee: Sun Microsystems, Inc.
    Inventor: J. Steven Zucker
  • Patent number: 5991871
    Abstract: 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.
    Type: Grant
    Filed: November 8, 1996
    Date of Patent: November 23, 1999
    Assignee: Sun Microsystems, Inc.
    Inventor: J. Steven Zucker
  • Patent number: 5835743
    Abstract: 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.
    Type: Grant
    Filed: June 30, 1994
    Date of Patent: November 10, 1998
    Assignee: Sun Microsystems, Inc.
    Inventor: J. Steven Zucker
  • Patent number: 5822787
    Abstract: 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.
    Type: Grant
    Filed: November 8, 1996
    Date of Patent: October 13, 1998
    Assignee: Sun Microsystems, Inc.
    Inventor: J. Steven Zucker