Abstract: A method, non-transitory computer readable medium and apparatus for optimizing a web service by adaptively using compression are disclosed. For example, the method receives a request for a data file, determines whether the data file should be compressed based upon a previous request for the data file, compresses the data file if it is determined that the data file should be compressed, and sends the data file in a compressed format.
Abstract: A distributed data processing system executes database operations, and includes a first group of host processors and a second group of job processing units (JPUs). A software application for executing database operations executes in a distributed fashion with portions of the database application executing on at least one central database processor and other portions executing on the data storage processors. At least a portion of the database application is implemented within and/or coordinated by a communication process that is executing the communication protocol. The communication process implements a load balancing function in front of the host processors, the load balancing function directing individual transactions to selected processors so as to evenly distribute workload.
Type:
Grant
Filed:
April 6, 2010
Date of Patent:
November 4, 2014
Assignee:
IBM International Group B.V.
Inventors:
Foster D. Hinshaw, Raymond A. Andraka, David L. Meyers, Sharon L. Miller, William K. Stewart
Abstract: In one embodiment, a method includes accessing a profile page of a user on an online social network, accessing cached content from a syndicated feed, determining the last time the content from the syndicated feed was updated, and if the last time the content was update was before a particular time, then updated the profile page of the user to include the cached content, else, accessing the syndicated feed and updating the profile page of the user to include updated content.
Type:
Grant
Filed:
October 19, 2011
Date of Patent:
October 28, 2014
Assignee:
Facebook, Inc.
Inventors:
William K. Tiu, Jr., Kent Lindstrom, Ross Ainsley MacKinnon
Abstract: A method and apparatus for dynamically retrieving ontological context are described herein. In one embodiment, the method includes receiving pattern language code that includes definitions of business classes and field classes, wherein the field classes include ontological contexts. The method also includes generating high-level object-oriented code that includes the business classes and the field classes with ontological contexts.
Abstract: Methods and systems for improved readability of URLS includes receiving a query requesting a universal resource locators relating to the query; parsing the query based on parsing criteria to determine keywords for the query; identifying a plurality of words in the universal resource locator; inserting space between at least two of the plurality of words; and generating display data comprising the result having the plurality of words and the inserted space therebetween.
Abstract: The navigation overhead and/or the content managing/updating overhead is reduced by providing link objects with condition data being associated with the link items of the link objects so that, depending on a check as to whether the condition data is fulfilled or not, an automatic handling of a link object may be performed. For example, the automatic handling may have an automatic appointing an object ID referred to by a link item of the link object that has condition data associated therewith which is fulfilled, as a newly-selected object ID.
Type:
Grant
Filed:
October 14, 2011
Date of Patent:
October 14, 2014
Assignee:
Fraunhofer-Gesellschaft zur Foerderung der Angewandten Forschung E.V.
Inventors:
Christian Kellermann, Bernd Linz, Markus Prosch, Alexander Zink
Abstract: Embodiments of the invention allow structured data to be transferred between a source application and a service-oriented target application that process data in different formats. The data to be transferred may be divided into different sections, where each section is processed by a respective service of the target application. To transform each section of data into a format compatible with a respective service, the data may have a set of associated rules which transform data based on a set of variables. The source application may provide variable definitions for each of the variables. Each service of the target application may specify values for each of the variables. Once the variables have a specified value, a transformation engine may transform each section of the data and subsequently transfer the transformed sections of the data to respective services of the target application for processing.
Type:
Grant
Filed:
January 22, 2009
Date of Patent:
October 7, 2014
Assignee:
International Business Machines Corporation
Inventors:
Thomas J. Eggebraaten, Jeffrey W. Tenner, Shannon E. Wenzel, Eric W. Will
Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for aggregating and presenting tags. A system configured to practice the method identifies a type for each tag describing a media event received from a tagging system, generates aggregate tags representing at least a portion of the set of tags based on the identified types, associates each aggregate tag with the media event based on the at least the portion of the plurality of tags represented by each respective aggregate tag, and optionally outputs the aggregate tags with the media event. A system configured to combine media segments based on aggregated tags first retrieves aggregate tags associated with a media event, receives input from a user, identifies a subset of aggregate tags related to the input, and outputs portions of the media event associated with the subset of aggregate tags.
Abstract: In a publish/subscribe system, a plurality of publishers provide information on a range of topics and a plurality of subscribers subscribe to one or more topics and topic sets on which they wish to receive information. Subscribers can also unsubscribe from topics and topic sets on which they do not wish to receive information. A subscription matcher such as a message broker is used to generate a subscription list of topic and topic set identifiers—from both the subscribe and unsubscribe requests of each subscriber. The subscription matcher then matches items of information from each publisher with topics and topic set definitions in the subscription list of each subscriber, and distributes matched items of information in accordance with subscription lists. The subscription matcher determines precedence between any overlapping subscribed and unsubscribed topics and topic sets based on the sequence in which they were stored.
Type:
Grant
Filed:
October 17, 2006
Date of Patent:
September 30, 2014
Assignee:
International Business Machines Corporation
Abstract: A method system and program for performing a query in which context and information including opcodes accompanies an execution plan for the query. The opcodes determine operations to retrieve a set of bind variables. The execution plan and context information shared by a plurality of application programs.
Abstract: A system, method, and computer program product are provided for improving performance of positional text conditions in concert with bitmap-based conditions. This is accomplished, for example, by focusing positional text condition evaluation to candidate rows based on a bitmap resulting from application of a prior condition. Additionally, the result of a positional text condition may itself be provided in the form of a bitmap to accelerate further bitmap-based condition processing.
Type:
Grant
Filed:
December 29, 2010
Date of Patent:
September 23, 2014
Assignee:
Sybase, Inc.
Inventors:
Steven A. Kirk, Roland F. McKenney, Anil K. Goel, Evguenia A. Eflov
Abstract: A method for dynamic management of one or more cloud database nodes is provided. The method enables gathering information related to usage of one or more cloud database nodes. The method further enables comparing time required by the one or more cloud database nodes for responding to one or more requests with a predetermined threshold. Furthermore, the method enables provisioning one or more new cloud database nodes or removing one or more new cloud database nodes based on at least one of: the gathered information, the comparison and a combination thereof.
Abstract: Virtually managing repositories to provide retention management services is disclosed. An indication is received that a retention management service is desired to be performed with respect to an external content item. A reference object is created that represents the external content item. The reference object is used to perform the retention management service with respect to the external content item.
Type:
Grant
Filed:
February 16, 2006
Date of Patent:
August 26, 2014
Assignee:
EMC Corporation
Inventors:
Razmik Abnous, Victor Spivak, Eric Merhoff
Abstract: An enterprise content management federation and integration system integrates a plurality of applications and federates information seamlessly by receiving, by a composite system, a request from a client system. The system then translates, by a manager system, the request from the client system. The manager system performs one or more high level validations and retrieves information from a mapping stored by an ontology modeling system, a plurality of content types, repositories, actions and object types based at least in part on a plurality of attributes including one or more metadata models or attribute models. The manager system then invokes one or more composites based at least in part on the request from the client system and some or all the information retrieved from the mapping.
Type:
Grant
Filed:
February 1, 2011
Date of Patent:
August 19, 2014
Assignee:
Bank of America Corporation
Inventors:
Jeffrey S. Engelhardt, Jorge A. Chrystman, Michelle Coffey, Christine Cottrell, Kelly D. Cummings, Michael R. Evans, David Michael Fredrikson, Robert C. Gorter, Kenneth B. Kebel, Edmund M. Knowles, Shawn Christopher Ledbury, John W. Sullivan
Abstract: Systems and methods are provided for processor-assisted indexing and searching, in which categories or individual documents within a database are annotated to the terms of an ontology, searched and then prioritized by rank. Items of the domain of interest, as well as the ontologies that describe attributes of those items, are embedded into a Bayesian network. Search queries correspond to user activations of items. An error model mimics incomplete or falsely specific items. Search results correspond to a subset of the items to which the query items are semantically-related. A probabilistic inference is performed to obtain marginal probabilities of each search result to explain the presence of the queries. These probabilities can then be used for ranking the search results.
Type:
Grant
Filed:
June 8, 2011
Date of Patent:
August 19, 2014
Assignee:
Max-Planck-Gesellschaft zur Foerderung der Wissenschaften e.V
Inventors:
Peter N. Robinson, Sebastian Bauer, Sebastian Koehler, Marcel H. Schulz
Abstract: According to one embodiment, an apparatus stores a plurality of datapoints. A datapoint comprises a first value and a second value that depends upon the value of the first value. The apparatus associates the datapoint with a group from a plurality of groups. The group is associated with an identifying range and the datapoint is associated with the group based at least in part upon the first value of the datapoint and the identifying range of the group. The apparatus calculates a median of the second values of the datapoints associated with the group and a performance value by performing a regression based at least in part upon the identifying range and the calculated median of the group. The apparatus determines that the performance value exceeds a baseline value and in response, presents, on a display, an illustration depicting the identifying range and the associated median of the group.
Type:
Grant
Filed:
August 27, 2012
Date of Patent:
August 12, 2014
Assignee:
Bank of America Corporation
Inventors:
Kasilingam B. Laxmanan, Yudong Chen, Julea K. Duke, Ming Xue
Abstract: The management of data storage channel utilization in a computing system that has multiple users. The system receives file-level requests from requesters and then creates a history for each requester. Upon evaluating the history of each requester, the system determines whether to delay the file-level requests from entering the file system stack based on the result of the evaluation. The system delays one or more of the file-level requests if the history of the corresponding requester meets one or more criteria. If the history of the corresponding requester does not meet the criteria, the system allows the file-level requests to be passed to the file system stack without being delayed.
Abstract: A computer system for processing data related to medical insurance has a communications device in communication with a network; a data storage device in communication with the communications device; and a processor in communication with the communications device and the data storage device. The processor is configured to receive, via the communications device, from a first source data indicative of medical provider claims, from a second source data indicative of insurance payments, and from a third source data indicative of medical provider data; identify common information items in said data from said first, second and third sources; and store the received data, in a data storage device, in a database, wherein said data from said first, second and third sources is cross-referenced with regard to said common information items.
Abstract: A method for submatch extraction may include receiving an input string, receiving a regular expression, and converting the regular expression with capturing groups into a plurality of finite automata to extract submatches. The method further includes using a first automaton to determine whether the input string is in a language described by the regular expression, and to process the input string, and using states of the first automaton in a second automaton to extract the submatches. In addition, input partitioning and automaton minimization techniques may be employed to reduce the storage area consumed by the plurality of finite automata.
Type:
Grant
Filed:
July 31, 2012
Date of Patent:
July 29, 2014
Assignee:
Hewlett-Packard Development Company, L.P.
Abstract: In an illustrative embodiment, an apparatus, computer-readable medium, or method may be configured to manage a configuration. Files may be inserted into a file container in a computing environment and state information on the files may be stored. A change to a file in the file container may be received. A comparison result may be obtained by comparing a previous version of the file container to the file container after receiving the change to the file. The comparison result may be provided.
Type:
Grant
Filed:
June 7, 2011
Date of Patent:
July 8, 2014
Assignee:
The Math Works, Inc.
Inventors:
Gavin William Walker, Robert Olson Aberg