Patents by Inventor David M. Ungar

David M. Ungar 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).

  • Patent number: 10689107
    Abstract: One embodiment provides a method comprising receiving a request to release a utility holder detachably mounted to a surface mount. The utility holder maintains a utility payload. A set of rotatable holding brackets is coupled to the surface mount in a pivotable fashion to engage the holding brackets with the utility holder in order to mount the utility holder to the surface mount. The method further comprises, in response to receiving the request, powering on a drone attached to the utility holder, and releasing the utility holder from the surface mount by actuating rotation of the holding brackets to disengage the holding brackets from the utility holder, enabling the drone to transport the utility holder from the surface mount to a desired location.
    Type: Grant
    Filed: April 25, 2017
    Date of Patent: June 23, 2020
    Assignee: International Business Machines Corporation
    Inventors: Nathalie Baracaldo Angel, Sandeep Gopisetty, Heiko H. Ludwig, David M. Ungar
  • Patent number: 10521434
    Abstract: A computer system includes processors that execute instructions stored on storage media to sort data using a data gravity well membrane. When executed, the program instructions: convert raw data into a first logical address that describes metadata about a first payload data; compare the first logical address to a second logical address for a second payload data to derive a Hamming distance between the first and second logical addresses; create a data vector for the second payload data that includes the Hamming distance between the first and second logical addresses; sort data vectors into specific data gravity wells on a data gravity wells membrane according to the Hamming distance stored in the data vector; incorporate a context object and a non-contextual data object into the data vector for the second payload data; and sort the second payload data into specific data gravity wells on the data gravity wells membrane.
    Type: Grant
    Filed: April 1, 2016
    Date of Patent: December 31, 2019
    Assignee: International Business Machines Corporation
    Inventors: Robert R. Friedlander, James R. Kraemer, David M. Ungar
  • Publication number: 20180305010
    Abstract: One embodiment provides a method comprising receiving a request to release a utility holder detachably mounted to a surface mount. The utility holder maintains a utility payload. A set of rotatable holding brackets is coupled to the surface mount in a pivotable fashion to engage the holding brackets with the utility holder in order to mount the utility holder to the surface mount. The method further comprises, in response to receiving the request, powering on a drone attached to the utility holder, and releasing the utility holder from the surface mount by actuating rotation of the holding brackets to disengage the holding brackets from the utility holder, enabling the drone to transport the utility holder from the surface mount to a desired location.
    Type: Application
    Filed: April 25, 2017
    Publication date: October 25, 2018
    Inventors: Nathalie Baracaldo Angel, Sandeep Gopisetty, Heiko H. Ludwig, David M. Ungar
  • Patent number: 10025564
    Abstract: A processor-implemented method, system, and/or computer program product generates and implements intuitively comfortable frames of task appropriate frames of reference for multiple dimensions of context constraints for related sets of objects within an integrated development environment (IDE). One or more processors identify a hierarchical set of context constraints for an object, and depict the hierarchical set of context constraints for the object on an IDE using a visual metaphor selected by a user. The processor(s) receive a zoom-in input for a first context constraint in the hierarchical set of context constraints, and place the IDE in mention mode, such that use of the hierarchical set of context constraints against the object is disabled. In response to the IDE being placed in mention mode, the processor(s) display detail of the first context constraint on the IDE, and receive changes to the first context constraint to create a modified first context constraint.
    Type: Grant
    Filed: November 25, 2015
    Date of Patent: July 17, 2018
    Assignee: International Business Machines Corporation
    Inventors: Robert R. Friedlander, John K. Gerken, III, James R. Kraemer, David M. Ungar
  • Patent number: 9898310
    Abstract: A method, system, and/or computer program product optimizes execution of a computation. Multiple slots, each of which is a container for information, are defined. A coordinate tuple is defined for each of the multiple slots. The coordinate tuple describes a position of a slot along multiple dimensions in a slot space. The multiple dimensions describe roles for executing a software object, and each of the multiple dimensions has a same level of primacy such that no dimension has primacy over another dimension in the slot space. Multiple method slots are populated with software method objects that address different contexts and purposes as defined by coordinate tuples of the multiple method slots. Software method objects are retrieved from coordinate tuples in the slot space that match a defined context and purpose of a particular computation, which is propagated to a processor that is executing a particular software method object.
    Type: Grant
    Filed: September 30, 2014
    Date of Patent: February 20, 2018
    Assignee: International Business Machines Corporation
    Inventors: Harold L. Ossher, David M. Ungar
  • Patent number: 9697240
    Abstract: A method, system, and/or computer program product associates new contextual state information about a changed data structure with a beneficial target data. Event data, which describes an event that modifies a data structure, is incorporated into the data structure to create a changed data structure state. New contextual state information, which describes the changed data structure state, is generated and transmitted to multiple beneficial target data stores, wherein applying the new contextual state information to a particular beneficial target data affects an activity that utilizes the particular beneficial target data.
    Type: Grant
    Filed: October 11, 2013
    Date of Patent: July 4, 2017
    Assignee: International Business Machines Corporation
    Inventors: Robert R. Friedlander, James R. Kraemer, Harold L. Ossher, David M. Ungar
  • Publication number: 20170147295
    Abstract: A processor-implemented method, system, and/or computer program product generates and implements intuitively comfortable frames of task appropriate frames of reference for multiple dimensions of context constraints for related sets of objects within an integrated development environment (IDE). One or more processors identify a hierarchical set of context constraints for an object, and depict the hierarchical set of context constraints for the object on an IDE using a visual metaphor selected by a user. The processor(s) receive a zoom-in input for a first context constraint in the hierarchical set of context constraints, and place the IDE in mention mode, such that use of the hierarchical set of context constraints against the object is disabled. In response to the IDE being placed in mention mode, the processor(s) display detail of the first context constraint on the IDE, and receive changes to the first context constraint to create a modified first context constraint.
    Type: Application
    Filed: November 25, 2015
    Publication date: May 25, 2017
    Inventors: Robert R. Friedlander, JOHN K. GERKEN, III, JAMES R. KRAEMER, DAVID M. UNGAR
  • Publication number: 20160217185
    Abstract: A computer system includes processors that execute instructions stored on storage media to sort data using a data gravity well membrane. When executed, the program instructions: convert raw data into a first logical address that describes metadata about a first payload data; compare the first logical address to a second logical address for a second payload data to derive a Hamming distance between the first and second logical addresses; create a data vector for the second payload data that includes the Hamming distance between the first and second logical addresses; sort data vectors into specific data gravity wells on a data gravity wells membrane according to the Hamming distance stored in the data vector; incorporate a context object and a non-contextual data object into the data vector for the second payload data; and sort the second payload data into specific data gravity wells on the data gravity wells membrane.
    Type: Application
    Filed: April 1, 2016
    Publication date: July 28, 2016
    Inventors: ROBERT R. FRIEDLANDER, JAMES R. KRAEMER, DAVID M. UNGAR
  • Patent number: 9348794
    Abstract: A method and/or system sorts data into data gravity wells on a data gravity wells membrane. A hashing logic executes instructions to convert raw data into a first logical address and first payload data, wherein the first logical address describes metadata about the first payload data. A hardware XOR unit compares the first logical address to a second logical address to derive a Hamming distance between the first and second logical addresses, wherein the second logical address is for a second payload data. A hardware data vector generator creates a data vector for the second payload data, wherein the data vector comprises the Hamming distance between the first and second logical addresses. A hardware data vector sorter then sorts data vectors into specific hardware data gravity wells on a data gravity wells membrane according to the Hamming distance stored in the data vector.
    Type: Grant
    Filed: May 17, 2013
    Date of Patent: May 24, 2016
    Assignee: International Business Machines Corporation
    Inventors: Robert R. Friedlander, James R. Kraemer, David M. Ungar
  • Patent number: 9195608
    Abstract: A system comprises a hashing logic, which executes instructions to convert raw data into a first logical address and payload data, where the first logical address describes metadata about the payload data. A hardware translation unit executes instructions to translate the first logical address into a first physical address on a storage device. A hardware load/storage unit stores the first logical address and the payload data at the first physical address on the storage device. A hardware exclusive OR (XOR) unit compares two logical address vectors to derive a Hamming distance between the two logical address vectors. A hardware retrieval unit retrieves other payload data that is stored at a second physical address whose second logical address is within a predefined Hamming distance from the first logical address, thus allowing payload data from the two logical addresses to be grouped/associated with one another.
    Type: Grant
    Filed: May 17, 2013
    Date of Patent: November 24, 2015
    Assignee: International Business Machines Corporation
    Inventors: Robert R. Friedlander, James R. Kraemer, David M. Ungar
  • Publication number: 20150106786
    Abstract: A method, system, and/or computer program product optimizes execution of a computation. Multiple slots, each of which is a container for information, are defined. A coordinate tuple is defined for each of the multiple slots. The coordinate tuple describes a position of a slot along multiple dimensions in a slot space. The multiple dimensions describe roles for executing a software object, and each of the multiple dimensions has a same level of primacy such that no dimension has primacy over another dimension in the slot space. Multiple method slots are populated with software method objects that address different contexts and purposes as defined by coordinate tuples of the multiple method slots. Software method objects are retrieved from coordinate tuples in the slot space that match a defined context and purpose of a particular computation, which is propagated to a processor that is executing a particular software method object.
    Type: Application
    Filed: September 30, 2014
    Publication date: April 16, 2015
    Inventors: HAROLD L. OSSHER, DAVID M. UNGAR
  • Publication number: 20150106408
    Abstract: A method, system, and/or computer program product associates new contextual state information about a changed data structure with a beneficial target data. Event data, which describes an event that modifies a data structure, is incorporated into the data structure to create a changed data structure state. New contextual state information, which describes the changed data structure state, is generated and transmitted to multiple beneficial target data stores, wherein applying the new contextual state information to a particular beneficial target data affects an activity that utilizes the particular beneficial target data.
    Type: Application
    Filed: October 11, 2013
    Publication date: April 16, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: ROBERT R. FRIEDLANDER, JAMES R. KRAEMER, HAROLD L. OSSHER, DAVID M. UNGAR
  • Publication number: 20140344548
    Abstract: A system comprises a hashing logic, which executes instructions to convert raw data into a first logical address and payload data, where the first logical address describes metadata about the payload data. A hardware translation unit executes instructions to translate the first logical address into a first physical address on a storage device. A hardware load/storage unit stores the first logical address and the payload data at the first physical address on the storage device. A hardware exclusive OR (XOR) unit compares two logical address vectors to derive a Hamming distance between the two logical address vectors. A hardware retrieval unit retrieves other payload data that is stored at a second physical address whose second logical address is within a predefined Hamming distance from the first logical address, thus allowing payload data from the two logical addresses to be grouped/associated with one another.
    Type: Application
    Filed: May 17, 2013
    Publication date: November 20, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Robert R. Friedlander, James R. Kraemer, David M. Ungar
  • Publication number: 20140344292
    Abstract: A method and/or system sorts data into data gravity wells on a data gravity wells membrane. A hashing logic executes instructions to convert raw data into a first logical address and first payload data, wherein the first logical address describes metadata about the first payload data. A hardware XOR unit compares the first logical address to a second logical address to derive a Hamming distance between the first and second logical addresses, wherein the second logical address is for a second payload data. A hardware data vector generator creates a data vector for the second payload data, wherein the data vector comprises the Hamming distance between the first and second logical addresses. A hardware data vector sorter then sorts data vectors into specific hardware data gravity wells on a data gravity wells membrane according to the Hamming distance stored in the data vector.
    Type: Application
    Filed: May 17, 2013
    Publication date: November 20, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: ROBERT R. FRIEDLANDER, JAMES R. KRAEMER, DAVID M. UNGAR
  • Publication number: 20080127072
    Abstract: In general, in one aspect, the invention relates to a computer readable medium comprising executable instructions for verifying generation of an intermediate representation (IR). The generation of the IR is verified by generating the IR from source code and interpreting the IR to obtain an interpretation result. Interpreting the IR includes encountering a method call in the IR, locating an execution unit corresponding to the method call, executing the execution unit to obtain an execution result, replacing a portion of the IR with the execution result to obtain a reduced IR, and obtaining the interpretation result from the reduced IR. Finally, the interpretation result is compared to an expected result of the source code, wherein the generation of the IR is verified if the interpretation result equals the expected result.
    Type: Application
    Filed: September 7, 2006
    Publication date: May 29, 2008
    Applicant: Sun Microsystems, Inc.
    Inventors: Bernd J.W. Mathiske, David M. Ungar, Mario I. Wolczko, Gregory M. Wright, Matthew L. Seidl
  • Patent number: 7089541
    Abstract: A modular parser architecture and methods related thereto make use of a number of miniparsers. Each miniparser is capable of receiving input and generating an output dependent thereon. In one embodiment, a lexer or a miniparser capable of lexical analysis receives certain code and provides an abstract syntax tree. Each miniparser performs operations on a set of syntactical constructs to produce a corresponding output syntax tree, which in turn may become an input syntax tree for a next miniparser which may operate on a different set of syntactical constructs.
    Type: Grant
    Filed: January 28, 2002
    Date of Patent: August 8, 2006
    Assignee: Sun Microsystems, Inc.
    Inventor: David M. Ungar
  • Patent number: 7036112
    Abstract: One embodiment of the present invention provides a system that facilitates implementing multi-mode specification-driven disassembler. During operation, the disassembler receives a machine-code version of a computer program. In order to disassemble a specific machine-code instruction from this machine-code version, the system compares the machine-code instruction against a set of instruction templates for assembly code instructions to identify a set of matching templates. Next, the system selects a matching template from the set of matching templates based on the state of a mode variable, which indicates a specificity mode for the disassembler. The system then disassembles the machine-code instruction using the operand fields defined by the matching template to produce a corresponding assembly code instruction.
    Type: Grant
    Filed: August 16, 2002
    Date of Patent: April 25, 2006
    Assignee: SUN Microsystems, Inc.
    Inventors: David M. Ungar, Mario I. Wolczko, Bernd J. W. Mathiske
  • Patent number: 6993755
    Abstract: Modern programming languages have stimulated work on systems that dynamically compile or optimize frequently executed portions of programs. In practice, such systems typically rely on ad hoc heuristics. For example, a system may optimize (or compile) some code once its execution count exceeds a given threshold. An analytical model has been developed that expresses performance of such a system. In one embodiment, the model is based on a bytecode frequency histogram, which indicates (for a given program) how many bytecodes run for how many times. It predicts that the optimal compilation threshold will occur where the hazard rate falls through the reciprocal of the break-even point, the number of times a compiled bytecode must be executed to recoup its compilation time. Based on the insight provided by the model, a dynamic compilation control technique has been developed.
    Type: Grant
    Filed: October 24, 2001
    Date of Patent: January 31, 2006
    Assignee: Sun Microsystems, Inc.
    Inventor: David M. Ungar
  • Patent number: 6842182
    Abstract: The present invention varies the highlight color of a highlighted display area such that the salience of the highlighted display area remains constant to a user as the highlighted display area varies. A perceptual highlight color is determined based upon the total amount of highlighted display area and the background color of the non-highlighted display area and applied to text selected to be highlighted by a user as well as to text already highlighted on the display. In other embodiments, the perceptual highlight color can be based upon the total amount of highlighted display area and the text color of the text in the highlighted display area, and the total amount of the highlighted display area, the background color of the non-highlighted display area, and the text color.
    Type: Grant
    Filed: December 13, 2002
    Date of Patent: January 11, 2005
    Assignee: Sun Microsystems, Inc.
    Inventors: David M. Ungar, Kristen A. McIntyre
  • Publication number: 20040113916
    Abstract: The present invention varies the highlight color of a highlighted display area such that the salience of the highlighted display area remains constant to a user as the highlighted display area varies. A perceptual highlight color is determined based upon the total amount of highlighted display area and the background color of the non-highlighted display area and applied to text selected to be highlighted by a user as well as to text already highlighted on the display. In other embodiments, the perceptual highlight color can be based upon the total amount of highlighted display area and the text color of the text in the highlighted display area, and the total amount of the highlighted display area, the background color of the non-highlighted display area, and the text color.
    Type: Application
    Filed: December 13, 2002
    Publication date: June 17, 2004
    Applicant: Sun Microsystems, Inc.
    Inventors: David M. Ungar, Kristen A. McIntyre