Abstract: Embodiments of the invention are directed to systems, methods and computer program for providing an integrated supplier information tool. An exemplary apparatus is configured to provide a user interface associated with an integrated supplier information tool, whereby the integrated supplier information tool is associated with a contract database and an electronic invoicing database, and wherein the user interface enables a user to select one or more options for presenting information associated with the contract database and the electronic invoicing database; integrate data from the contract database and the electronic invoicing database; receive an indication to select at least one option within the supplier information tool; and in response to receiving the indication to select the at least one option, present on the user interface data related to at least one of the contract database or the electronic invoicing database.

Abstract: In searching an index in an original search structure for a database, portion(s) of the index are determined to be stored in a memory in an alternate search structure. The alternate search structure with the portion(s) is created and stored in the memory. The index is searched by traversing the alternate search structure and possibly the original search structure. The alternate search structure may be traversed more efficiently than the original search structure. The number of portions of the index may be a tunable parameter or selected based on a performance improvement/expense ratio. The search of the index begins at the alternate search structure. During traversal of the one or more portions in the alternate search structure, if traversal is to continue at a portion in the original search structure, the identity of this portion is obtained. The traversal is continued at this identified portion in the original search structure.

Abstract: In searching an index in an original search structure for a database, portion(s) of the index are determined to be stored in a memory in an alternate search structure. The alternate search structure with the portion(s) is created and stored in the memory. The index is searched by traversing the alternate search structure and possibly the original search structure. The alternate search structure may be traversed more efficiently than the original search structure. The number of portions of the index may be a tunable parameter or selected based on a performance improvement/expense ratio. The search of the index begins at the alternate search structure. During traversal of the one or more portions in the alternate search structure, if traversal is to continue at a portion in the original search structure, the identity of this portion is obtained. The traversal is continued at this identified portion in the original search structure.

Abstract: A method includes supplementing a database with multiple database views respectively representing a data model and including a first column representing a first attribute of the data model and a second column representing a second attribute of the data model; identifying a database view capable of retrieving requested data; retrieving instances of the data model represented by the identified view via the network using a first select criterion directed at the first column and a second select criterion directed at the second column of said view, the second attribute values of the data model instances being calculated selectively for instances having been dynamically identified by the first select criterion; and returning a result via the network.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering data points. One of the methods includes maintaining data representing a respective ordered tuple of skeleton data points for each of a plurality of clusters. One or more intersecting clusters are determined for a new data point. An updated tuple of skeleton data points is generated for an updated cluster by selecting updated skeleton data points, including selecting the new data point or an existing jth skeleton data point of one of the one or more intersecting clusters according to which random value, of the jth random value for the new data point or the random value for the jth existing skeleton data point, is closest to a limiting value. The new data point is then assigned to the updated cluster.

Abstract: A computer system identifies and prioritizes issues in electronic documents from electronic social media sources and/or from traditional media sources. The computer system includes a communication network linked to one or more of the sources and a computer server in communication with the communication network. The computer server is configured to receive electronic documents from the sources via the communication network. The computer server has memory and a processor, the memory including processor executable instructions stored in the memory and executable by the processor. The instructions comprise data collection instructions, topic modeling instructions including instructions for weighing and instructions for indicating a distribution for identified issues within each of the retrieved documents, issue assignment instructions, instructions for determining, and instructions for ranking.

Abstract: An image search device includes a common memory and a plurality of parallel processors for executing a same instruction. The image search device transfers, from storage, a plurality of representative feature vectors, which respectively represent a plurality of clusters including a plurality of image feature vectors, stores, in the common memory, one or more query feature vectors extracted from an image serving as a query, calculates a distance between the plurality of transferred representative feature vectors and the query feature vector using the plurality of parallel processors, and selects one or more of a plurality of images based on a distance between the plurality of image feature vectors, which belong to the cluster selected by the calculated distance, and the query feature vector.