Abstract: A method for merging transactions for execution by a database management system. The method includes a computer processor receiving a database query that is comprised of a plurality of transactions. The method further includes a computer processor placing each of the plurality of transactions, of the database query, in respective chronological order, in a scheduling queue. The method further includes a computer processor determining that at least a first transaction and a second transaction within the plurality of transactions each contains one or more transaction delineation descriptions. The method further includes computer processor responding to the determination that the first transaction and the second transaction, within the plurality of transactions, each contains one or more transaction delineation descriptions, and merging the first transaction and the second transaction to create a merged transaction combination and merging also includes combining two or more table-scan operations.

Abstract: An enhanced metadata structure and associated process is provided which captures and stores metadata gathered about the source and usage of a media asset or file. The source and usage metadata is integrated, such as by encoding within the enhanced media file, as the media asset is transferred and used. The integrated metadata accumulates, as a trail of source information and usage information in the enhanced media asset, and can be extracted upon arrival at a target computer system.

Abstract: An example method of processing a plurality of queries includes determining, at a database driver, that a first query and a second query are similar. The first query is sent from a first execution thread executing in an application server. The method also includes generating, at the database driver, a union query based on the first and second queries. The method further includes submitting the union query to a database that stores database tables from which data is selected based on the first and second queries. The method also includes receiving a combined result set of the union query from the database and submitting the first query against the combined result set. The method further includes receiving, at the database driver, a first result set of the first query in response to submitting the first query against the combined result set.

Abstract: Systems and methods for building a latent item vector and item bias for a new item in a collaborative filtering system are disclosed. The method includes dividing incoming users into intervals with each interval having a learning phase and a selection phase. The learning phase scores each incoming user according to a best estimate latent vector and bias and saves the highest score. In the selection each incoming user is scored and a user exceeding the highest score is selected. The best estimate latent vector and bias is then updated based on the user's vector and bias, and the user's interaction with the item. The updated best estimate latent vector is then used in further intervals for learning and selecting users.

Abstract: An online system generates implied links between objects distributed by the online system based on a plurality of users' behaviors with respect to the objects. For a behavior of a user with respect to an object that satisfies a link criterion, the online system identifies a connection between the user and the object. Local object graphs are generated to represent the relationships between the objects connected to each user, and the local object graphs are merged into a global object graph. An adjacency matrix is extracted from the global object graph as a representation of the strength of relationships between the objects distributed by the online system. The online system may then apply graph analysis techniques to the adjacency matrix, thereby analyzing the relationships between the objects without relying upon explicit links between the objects.

Abstract: The disclosed invention relates generally to a method and device for transferring a file. In accordance with one embodiment, the method may include, receiving a file transfer request including information of a file and the file receiver; separating the file into multiple file segments; pushing the multiple file segments to the file receiver; if receiving a retransfer request sent by the file receiver, pushing the file segment assigned by the retransfer request to the file receiver; if receiving an acknowledgement sent by the file receiver, ending the file transferring, the acknowledgement indicating all of the multiple file segments being received by the file receiver. The method and device provided in the disclosed embodiments can transfer file more reliable.

Abstract: Embodiments are directed to replicating data in distributed storage. A replication message may be retrieved from a message queue associated with a source table. The replication message may include a row identifier. One or more target storages within a same replication group as the source table may be identified. A row from each of the one or more target storages may be obtained corresponding to the row identifier. A winning row may be determined from the obtained rows based on a latest timestamp of the row. A replication operation may be created based on the winning row. The replication operation may be performed on the obtained rows from each of the target storages.

Abstract: Methods and apparatus are provided for compression and decompression of heteroscedastic data, such as seismic data, using Autoregressive Integrated Moving Average (ARIMA)-Generalized Autoregressive Conditional Heteroscedasticity (GARCH) model estimation. Heteroscedastic data is compressed by obtaining the heteroscedastic data; applying the heteroscedastic data to an ARIMA-GARCH model; determining residuals between the obtained heteroscedastic data and the ARIMA-GARCH model; and compressing parameters of the ARIMA-GARCH model and the residuals using entropy encoding, such as an arithmetic encoding, to generate compressed residual data. Parameters of the ARIMA-GARCH model are adapted to fit the obtained heteroscedastic data. The compressed residual data is decompressed by performing an entropy decoding and obtaining the parameters of the ARIMA-GARCH model and the residuals. The ARIMA-GARCH model predicts heteroscedastic data values and then the decompressed residuals are added.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: A stopword detection component detects stopwords (also stop-phrases) in search queries input to keyword-based information retrieval systems. Potential stopwords are initially identified by comparing the terms in the search query to a list of known stopwords. Context data is then retrieved based on the search query and the identified stopwords. In one implementation, the context data includes documents retrieved from a document index. In another implementation, the context data includes categories relevant to the search query. Sets of retrieved context data are compared to one another to determine if they are substantially similar. If the sets of context data are substantially similar, this fact may be used to infer that the removal of the potential stopword(s) is not material to the search. If the sets of context data are not substantially similar, the potential stopword can be considered material to the search and should not be removed from the query.

Abstract: A priority for one or more source components can be determined for use in providing metadata for a composite media presentation. For example, an audio component containing or associated with a text transcript may be prioritized based on a gain value, gain differential, and/or frequency range associated with the audio component, with data indicating the priority stored in a computer-readable medium. When transcript or other metadata is provided for the composite media presentation, the priority information can be used to select how (or whether) data or metadata associated with each component will be used in providing transcript metadata for the presentation as a whole.

Abstract: The present disclosure includes systems and techniques relating to ranking search results of a search query. In general, the subject matter described in this specification can be embodied in a computer-implemented method that includes determining a measure of relevance for a document result within a context of a search query for which the document result is returned, the determining being based on a first number in relation to a second number, the first number corresponding to longer views of the document result, and the second number corresponding to at least shorter views of the document result; and outputting the measure of relevance to a ranking engine for ranking of search results, including the document result, for a new search corresponding to the search query. The subject matter described in this specification can also be embodied in various corresponding computer program products, apparatus and systems.

Abstract: An expert archiving machine and a remote client machine; the remote client machine being configured and operable to send the document over LAN, WAN or internet networks; and to send an archiving output data signal to the expert archiving machine, and the expert archiving machine being configured and operable: to receive the archiving signal and the document; and to perform a computerized service including: saving the document in a destination directory; thereby forming a saved document. In an embodiment, a file path to the saved document is determined autonomously by a computer procedure in accordance with a predetermined set of conditional archiving rules and an asset parameter data source or database.

Abstract: In an industrial control setting, different components can have information that can be valuable to various entities, such as other components, technicians, and the like. A decision can be made as to what information should be available to entities and a determination can be made if the information should be published in a directory or be discoverable. Security can be taken into account in determining if information should be published and decision making can employ adaptive learning, such that a publish and/or discovery decision criterion can be modified based on the learning.

Abstract: Overlay datasets provide an efficient, flexible and scalable mechanism to represent the logical replication of one or more prior defined datasets. Only changes made to an entity in an overlay dataset's underlying dataset are replicated into the overlay dataset (such changes do not affect the underlying dataset). Read operations directed to the overlay dataset will find entities in the overlay dataset if they exist and in the underlying dataset(s) if no overlay-specific entity exists. Accordingly, overlay datasets provide an efficient mechanism for making changes to an existing dataset without suffering the high processing time and storage overhead associated with prior art copying and versioning techniques. Overlay datasets also provide a natural mechanism to keep two or more datasets in synchronization because changes to a base or underlying dataset's entities are “visible” in its associated overlay dataset (unless the entity has been modified in the overlay dataset).

Abstract: Systems and methods of the present invention provide for one or more server computers communicatively coupled to a network and configured to: receive a domain name search string; identify: a token, within the domain name search string, reflecting a user pattern; a next element in the sequence for the user pattern; and an available domain name comprising a string reflecting the next element in the sequence; and transmit the available domain name to a client computer communicatively coupled to the network.

Abstract: a system and method for providing search results is disclosed. One embodiment includes first presenting an image containing a product to a user and providing the user with a user interface for selecting the image, or a portion of the image associated with the product, from among several images. Search results are generated by searching for at least one characteristic based on one tag applied to the image or portion of the image in a database associated with a brand or designer identified in a second tag. In another embodiment, a user is provided with an upload interface to upload and tag an image so that the image is tagged for use in generating and providing search results to an independent user.

Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.

Abstract: Systems, apparatus, and methods are provided for providing dynamic interaction with a research publication database.

Abstract: Embodiments of the present invention provide, systems, methods, and computer program products for processing data in an extract, transform, and load system. Embodiments of the present invention provide protective enhancements to be applied to data during extract-transform-load operations, including protections that can prevent unauthorized access and/or modifications to data stored on an intermediate computer system. Embodiments of the present invention can afford users with the ability to modify the protective enhancements and provide users with transformation operations compatible with the protective enhancements during extract-transform-load operations.