Patents Examined by Viva Miller
  • Patent number: 9098799
    Abstract: Business processes are implemented using a collection component for storing system knowledge comprising usage history and user input relative to activities within community of users, where the system knowledge comprises at least a folksonomy. At least one of a user client component interacts with the data collection component to enable a corresponding user to contribute user-derived information to the folksonomy and a monitoring component monitors activities associated with the community of users and interacts with the data collection component to contribute usage information to the system knowledge. Still further, a composition design application interacts with a user to build and/or modify processes built using services, wherein the composition design application recommends candidate services that can implement aspects of the business processes based upon information derived from the system knowledge.
    Type: Grant
    Filed: March 29, 2007
    Date of Patent: August 4, 2015
    Assignee: International Business Machines Corporation
    Inventors: Belinda Ying-Chieh Chang, Vijay Dheap, Christopher James Hardee, Heather Castelli Miller
  • Patent number: 9032365
    Abstract: An object is to provide a script description separation reconstructing device that can describe the same operation by the same command script regardless of a subsystem configuration of a controlled system, a configuration of a control system, and a kind of the command script. Using system configuration information indicating what kind of subsystem structure the controlled system is composed of, A script description separation reconstructing means reconstructs in a form of separating a system control command script description into a process inside each controller and a process by a host side.
    Type: Grant
    Filed: March 24, 2010
    Date of Patent: May 12, 2015
    Assignee: NEC Corporation
    Inventor: Noriaki Suzuki
  • Patent number: 9009684
    Abstract: A computer-implemented method and apparatus for transforming code to embedded environments, the method comprising: receiving program code not complying with a limitation of an embedded computing environment; transforming at least part of the program code to modified program code in order for the modified program code to be in compliance with the limitation; and storing the modified program code on a storage device. wherein the modified program code complies with the limitation of the embedded computing environment.
    Type: Grant
    Filed: April 18, 2012
    Date of Patent: April 14, 2015
    Assignee: International Business Machines Corporation
    Inventors: Aharon Abadi, Moria Abadi, Yishai Feldman, Maayan Goldstein
  • Patent number: 9009697
    Abstract: A hybrid cloud integrator provides a capability for integrating data processing resources provided as services across a hybrid cloud. The hybrid cloud integrator includes a software framework that provides for installing, configuring, activating, and controlling operation of a number of plug-in software components. The plug-in software components are configured to provide for using data processing resources provided as a service to process a consumer workload.
    Type: Grant
    Filed: February 8, 2011
    Date of Patent: April 14, 2015
    Assignee: International Business Machines Corporation
    Inventors: Gerd Breiter, David B. Lindquist, Vijay K. Naik, Holger Reinhardt, Marc-Thomas H. Schmidt
  • Patent number: 8959497
    Abstract: One embodiment of the present invention sets forth a technique for partitioning a predecessor thread program into sub-programs and dynamically spawning a thread grid of the sub-programs based on the outcome of a conditional statement in the predecessor thread program. The programming instructions for the predecessor thread program are analyzed to assess the benefit of partitioning the thread program at a conditional statement into sub-programs. If the predecessor thread program is partitioned, then each branch of the conditional statement may be used to form a separate sub-program. Predicate tables are populated at the predecessor thread program run-time to establish which possible instances of the thread sub-programs should be spawned in subsequent execution phases.
    Type: Grant
    Filed: August 29, 2008
    Date of Patent: February 17, 2015
    Assignee: NVIDIA Corporation
    Inventors: John A. Stratton, David Luebke
  • Patent number: 8949770
    Abstract: An exemplary system for electronically managing requirements for software development includes a projects module, a requirements module, a mapping module and a verification module. The projects module is configured to establish a software development project. The requirements module is configured to define requirements for the project based on requirements information captured from a requirements source. For each requirement, the projects module is configured to associate source code developed for the requirement with the project or assign the requirement for development of source code. The mapping module is configured to map procedures identified in the source code to the defined requirements. The verification module is configured to verify the defined requirements based on results of one or more of analysis, code coverage measurements and unit testing performed on the mapped procedures.
    Type: Grant
    Filed: April 3, 2008
    Date of Patent: February 3, 2015
    Assignee: LDRA Technology, Inc.
    Inventors: William Gryffyth StClair, Sumner Augustine StClair
  • Patent number: 8938485
    Abstract: One embodiment of the present invention sets forth a technique for performing fast integer division using commonly available arithmetic operations. The technique may be implemented in a four-stage process using a single-precision floating point reciprocal in conjunction with integer addition and multiplication. Furthermore, the technique may be fully pipelined on many conventional processors for overall performance that is comparable to the best available high-performance alternatives.
    Type: Grant
    Filed: February 12, 2008
    Date of Patent: January 20, 2015
    Assignee: NVIDIA Corporation
    Inventor: Julius Vanderspek
  • Patent number: 8924939
    Abstract: Method, system and computer program product for performing an operation, the operation including providing a plurality of processing elements comprising one or more operators, the operators configured to process streaming data tuples. The operation then establishes an operator graph of multiple operators, the operator graph defining at least one execution path in which a first operator of the plurality of operators is configured to receive data tuples from at least one upstream operator and transmit data tuples to at least one downstream operator. The operation then defines a breakpoint, the breakpoint comprising a condition, the condition based on attribute values of data tuples in a window of at least one operator, the window comprising a plurality of data tuples in an operator. The operation, upon detecting occurrence of the condition, triggers the breakpoint to halt processing by each of the plurality of operators in the operator graph.
    Type: Grant
    Filed: May 9, 2012
    Date of Patent: December 30, 2014
    Assignee: International Business Machines Corporation
    Inventors: Michael J. Branson, Ryan K. Cradick, John M. Santosuosso, Brandon W. Schulz
  • Patent number: 8924940
    Abstract: Method product for performing an operation, the operation including providing a plurality of processing elements comprising one or more operators, the operators configured to process streaming data tuples. The operation then establishes an operator graph of multiple operators, the operator graph defining at least one execution path in which a first operator of the plurality of operators is configured to receive data tuples from at least one upstream operator and transmit data tuples to at least one downstream operator. The operation then defines a breakpoint, the breakpoint comprising a condition, the condition based on attribute values of data tuples in a window of at least one operator, the window comprising a plurality of data tuples in an operator. The operation, upon detecting occurrence of the condition, triggers the breakpoint to halt processing by each of the plurality of operators in the operator graph.
    Type: Grant
    Filed: February 19, 2013
    Date of Patent: December 30, 2014
    Assignee: International Business Machines Corporation
    Inventors: Michael J. Branson, Ryan K. Cradick, John M. Santosuosso, Brandon W. Schulz
  • Patent number: 8914768
    Abstract: The embodiments provide a data processing apparatus for automated blueprint assembly. The data processing apparatus includes a micro-blueprint assembler configured to receive a request for automated blueprint assembly for assembling an application, where the request specifies at least one feature, and a model database configured to store model data. The model data includes a plurality of classes and class properties. The data processing apparatus further includes a micro-blueprint database configured to store a plurality of micro-blueprints. Each micro-blueprint corresponds to a functional component of a stack element or service tier, and the functional component is annotated with one or more classes of the plurality of classes and at least one required capability and available capability. The micro-blueprint assembler is configured to generate at least one application blueprint based on the model data and the plurality of micro-blueprints according to the request.
    Type: Grant
    Filed: March 28, 2012
    Date of Patent: December 16, 2014
    Assignee: BMC Software, Inc.
    Inventors: Neeran Mohan Karnik, Abhay Ghaisas, Abhijit Sharma
  • Patent number: 8898212
    Abstract: A data reordering system for determining addresses associated with a vector of transformed data and corresponding method of reordering transformed data, where the data reordering system includes: a first transform function coupled to a data vector and operable to provide the vector of transformed data; a reordering function, including a plurality of counters, that is operable to determine a plurality of offset addresses, with a, respective, offset address for each element in the vector of transformed data; and an adder operable to add a base address that corresponds to the first address to the each, respective, offset address to provide a sequence of addresses suitable for accessing the vector of transformed data to provide a re-sequenced vector of transformed data.
    Type: Grant
    Filed: October 24, 2008
    Date of Patent: November 25, 2014
    Assignee: Freescale Semiconductor, Inc
    Inventors: Ning Chen, Christopher J. Daniels, Leo G. Dehner, Gregory C. Ng, Wendy F. Reed
  • Patent number: 8881113
    Abstract: Methods and systems are provided for assigning exceptions in a multi-tenant system providing instances of a virtual application over a network to multiple tenants. One exemplary method of assigning an exception record corresponding to an anomalous condition identified by an instance of the virtual application involves obtaining context information associated with the anomalous condition from the instance of the virtual application and automatically assigning the exception record to a development entity based at least in part on the context information.
    Type: Grant
    Filed: February 14, 2012
    Date of Patent: November 4, 2014
    Assignee: salesforce.com, inc.
    Inventors: Zuye Zheng, James Iry, Nagraj Kulkarni
  • Patent number: 8863102
    Abstract: A method for assembling an information processing application, includes: inputting a plurality of component descriptions, wherein each of the component descriptions includes a graph pattern that semantically describes an applicability condition of a component and a graph pattern that semantically describes an inclusion effect of the component; inputting a processing request, wherein the processing request includes a goal that is represented by a graph pattern that semantically describes a desired processing outcome; assembling a processing graph, wherein the processing graph includes at least one component that satisfies the desired processing outcome; and outputting the processing graph.
    Type: Grant
    Filed: April 2, 2007
    Date of Patent: October 14, 2014
    Assignee: International Business Machines Corporation
    Inventors: Mark D. Feblowitz, Nagui Halim, Zhen Liu, Anand Ranganathan, Anton V. Riabov
  • Patent number: 8856295
    Abstract: In accordance with an embodiment, one or more software application products, such as Oracle Fusion Applications, can be installed and/or configured according to an integration and deployment design/blueprint that is built or optimized for use within a multi-tiered deployment topology at an organization's (i.e., customer's) data center. Based on the customer site topology, provisioning of the software applications can be optimized; and application life cycle operations performed. This enables each product to be aware of the topology, which in turn provides customers with an “out-of-the-box” solution. The topology can also be optimized for security, performance and simplicity. In accordance with an embodiment, the deployment topology can include thick client functionality.
    Type: Grant
    Filed: May 10, 2012
    Date of Patent: October 7, 2014
    Assignee: Oracle International Corporation
    Inventor: Janga Aliminati
  • Patent number: 8826261
    Abstract: Methods, systems and devices for remotely updating software installed on a digital signal processor (DSP) without setting the mode select pins on the DSP control card. Firmware configured to suspend operations upon receiving a programming signal is installed on the processor. A controlling computing device send the programming signal, causing the processor to halt execution, erase portions of the firmware, set an update firmware flag, and send control signals to the controlling computing device. The remote computing device sends updated firmware and an application program cyclic redundancy check to the processor. The processor compares a cyclic redundancy check of an on-chip flash memory with the received application program cyclic redundancy check. If the two match, the processor installs the received firmware, unsets the update firmware flag, and restarts itself.
    Type: Grant
    Filed: February 24, 2011
    Date of Patent: September 2, 2014
    Assignee: Bloom Energy Corporation
    Inventors: Vishal Anand AG, Jayanth Moodliar
  • Patent number: 8826228
    Abstract: A computer-implemented method for creating a program for a multi-processor system comprising a plurality of interspersed processors and memories. A user may specify or create source code using a programming language. The source code specifies a plurality of tasks and communication of data among the plurality of tasks. However, the source code may not (and preferably is not required to) 1) explicitly specify which physical processor will execute each task and 2) explicitly specify which communication mechanism to use among the plurality of tasks. The method then creates machine language instructions based on the source code, wherein the machine language instructions are designed to execute on the plurality of processors. Creation of the machine language instructions comprises assigning tasks for execution on respective processors and selecting communication mechanisms between the processors based on location of the respective processors and required data communication to satisfy system requirements.
    Type: Grant
    Filed: March 27, 2007
    Date of Patent: September 2, 2014
    Assignee: Coherent Logix, Incorporated
    Inventors: John Mark Beardslee, Michael B. Doerr, Tommy K. Eng
  • Patent number: 8812570
    Abstract: In one embodiment, a mechanism for string hashing using a random number generator is disclosed. In one embodiment, a method includes dividing an input stream provided to a hashing module into a plurality of subsets of ‘n’ bits, entangling, by a mixer of the hashing module, one of the subsets of ‘n’ bits by a next sequential output of a pseudo-random number generator (PRNG), adding a product of the entangling to an accumulator of the hashing module, repeating the entangling and adding until all subsets of the plurality of subsets have been processed, and returning a value in the accumulator as a hash result value.
    Type: Grant
    Filed: May 28, 2009
    Date of Patent: August 19, 2014
    Assignee: Red Hat, Inc.
    Inventor: James P. Schneider
  • Patent number: 8806430
    Abstract: Exemplary embodiments provide computer-implemented methods, computer-readable media, and systems for changing the identifier associated with an entity, such as a variable or function, in a portion of code. During editing, a reference may be maintained that identifies the location of each instance of the entity in the code. When the identifier associated with one instance of the entity is changed, the change in the identifier may be propagated throughout the code to change each instance of the identifier in the code. The identifier may be changed without interrupting the workflow of the user and without the need to change to a separate refactoring mode. In some embodiments, a syntactical analysis may be performed and some or all instances of the identifier may be changed based on one or more rules.
    Type: Grant
    Filed: September 21, 2011
    Date of Patent: August 12, 2014
    Assignee: The MathWorks, Inc.
    Inventors: Joseph Bienkowski, John Booker, Srinath Avadhanula, Vijay Raghavan
  • Patent number: 8806463
    Abstract: A method includes generating a first executable program module based on source code modules and collecting profile information for the source code modules by executing the first executable program module. The profile information includes information pertaining to invocation of procedures in the first executable program module. The method further includes determining module grouping information for the source code modules based on procedure invocation patterns in the profile information and according to one or more inter-procedural optimization (IPO) heuristics. The method includes performing IPO based on the module grouping information to generate object code modules and generating a second executable program module based on the plurality of object code modules.
    Type: Grant
    Filed: May 12, 2014
    Date of Patent: August 12, 2014
    Assignee: Google Inc.
    Inventors: Xinliang David Li, Raksit Ashok, Robert Hundt
  • Patent number: 8789032
    Abstract: Methods, systems, and apparatus, including computer program products, for inter-procedural optimization, are disclosed. In one aspect, a first executable program module is generated based on a plurality of source code modules. Profile information is collected for the plurality of source code modules by executing the first executable program module. Inter-procedural analysis for the plurality of source code modules is performed during execution of the first executable program module. The inter-procedural analysis is based on the collected profile information. IPO is performed based on the results from the inter-procedural analysis to generate a plurality of object code modules. A second executable program module is generated based on the plurality of object code modules.
    Type: Grant
    Filed: February 27, 2009
    Date of Patent: July 22, 2014
    Assignee: Google Inc.
    Inventors: Xinliang David Li, Raksit Ashok, Robert Hundt