Abstract: Online learning of click-through rates on search result blocks from one or more federated sources may be provided. Click-through feedback for the search result blocks may be received from the one or more federated sources in response to a query. Weights may be assigned to each of the search result blocks based on the received click-through feedback. The search result blocks may then be ranked based on the assigned weights. Finally, a search results page may be generated for displaying the ranked search results blocks to a user.

Abstract: A composer interface allows a user to provide input, such as text data, to the social networking system. One or more images may be presented to the user via the composer interface, allowing the user to select one or more images to associate with the input. The images presented to the user may be selected based on associations of images with similar input by social networking system users. For example, images that a threshold number of users have associated with similar input are presented via the composer interface. If the user selects an image to associate with the input, the social networking system presents the selected image along with the received input in a content item presented to other social networking system users.

Abstract: An exemplary management system receives a designation of at least one step selected from a first step of writing data to the secondary volume, a second step of writing data to the secondary journal volume, a third step of reading data from the primary journal volume, and a fourth step of transferring data by the network, and a designation of an analysis period. The management system displays a graph of the history information on the load and the history information of the delay time for the analysis period for the at least one selected step.

Abstract: A computer system comprising a plurality of computers and a storage system, further comprising: a first data processing module configured to process data transmitted from an apparatus; a memory store; a database; a memory store control module; a second data processing module configured to execute predetermined processing using processed data included in a first data range; and a third data processing module configured to execute predetermined processing using the processed data included in a second data range, the memory store control module being configured to: specify a third data range, which is a time range of the processed data to be written to the database; and specify deletable processed data based on the first data range and the third data range.

Abstract: The present technology is directed to systems and methods for determining content of interest by determining the occurrence of fast-rising features (for example, URL, fingerprint, etc.) in posts or comments provided by users within an online community, for example, a social network. The systems and methods obtain user-generated content from an online community and determine signals based on the user-generated content to calculate a frequency of the signals as they post or occur in a pre-defined time bucket or window. A first derivative difference of the frequency and a second derivative difference of the frequency is calculated based on formulating consecutive time buckets or “dynamic windows” to determine if one or more of the frequency, the first derivative difference, and the second derivative difference satisfies one or more pre-defined thresholds. The user-generated content is prioritized based on whether it satisfies the one or more pre-defined thresholds.

Abstract: Described is technology to translate between tree-structured documents and electronic storage such as a relational data store. A document may be composed from the data store or decomposed to a data store using a document mapping command. The document mapping command includes follow commands that associate the columns in one table with columns in another table and resolve these associations during composition or decomposition. These follow commands allow for the retrieval of data from the data store and for inserting and/or modifying the data store by way of applying deltas to the data store.

Abstract: A method, system, and computer program product for managing time dimension tables are disclosed. In a first aspect, the method comprises providing an intelligent time dimension agent application and optimizing a time dimension table by the intelligent time dimension agent based upon changing data in associated fact tables. In a second aspect, the system comprises a processor and a memory coupled to the processor, wherein the memory includes an application which, when executed by the processor, causes the processor to carry out the steps of the method. In a third aspect, the computer program product comprises a non-transitory computer readable medium having a computer readable program recorded thereon, wherein the computer readable program, when executed on a computer device, causes the computer device to carry out the steps of the method.

Abstract: Performing database queries. A method includes receiving a particular database query. The method further includes accessing a query plan based on the particular database query. The query plan has operators and specific operational parameters associated with each of the operators. The association of operators and specific operational parameters is specific to the particular database query. From the query plan, the method further includes instantiating a plurality of compiled code templates. Each code template includes executable code that when executed performs functionality of one of the operators from the query plan with the specific operational parameters applied in the compilation. The method further includes binding the code templates together using programmatic control flow to create a functioning program.

Abstract: Techniques are disclosed to determine differences between a source table and a target table in a database environment, as being persistent or transient. A first set of differences between the source table and the target table is determined at a first point in time. A second set of differences between the source table and the target table is determined at a second point in time subsequent to the first point in time. At least one of a set of persistent differences and a set of transient differences is determined. The set of persistent differences includes a set intersection of the first and second sets of differences, the set intersection being filtered based on matching non-key values of the differences. The set of transient differences includes a relative complement of the second set of differences in the first set of differences.

Abstract: A method, system, and computer program product for managing time dimension tables are disclosed. In a first aspect, the method comprises providing an intelligent time dimension agent application and optimizing a time dimension table by the intelligent time dimension agent based upon changing data in associated fact tables. In a second aspect, the system comprises a processor and a memory coupled to the processor, wherein the memory includes an application which, when executed by the processor, causes the processor to carry out the steps of the method. In a third aspect, the computer program product comprises a non-transitory computer readable medium having a computer readable program recorded thereon, wherein the computer readable program, when executed on a computer device, causes the computer device to carry out the steps of the method.

Abstract: Technology is disclosed for organizing, managing and sharing data files as pages of an online binder (“the technology”). In various embodiments, the technology stores multiple data files received in multiple formats from multiple sources as pages of the online binder. The pages of the online binder are of a common format. The common format allows the pages, that is, the data files corresponding to the pages, to be accessed using a variety of devices regardless of a platform of the devices. The online binder is platform agnostic. The technology provides tools to create notes for the pages of the online binder. The notes can include text annotations, drawings, or audio visual annotations, including a recording of the user actions as presented on the device of the user. The technology provides a collaboration service for sharing the online binder with multiple users asynchronously or in real-time.

Abstract: A transmission device includes: a file processing means for performing processing with respect to a file to be transmitted to a receiving device; and a transmission means for transmitting the file to the receiving device, wherein the file has a data structure storing an original image, one or plural images for transmission different from the original image and attribute information concerning attributes of these images, and the file processing means generates a file having a data structure storing the image for transmission and the attribute information obtained by adding common attributes added to the original image to unique attributes added to the image for transmission.

Abstract: Tools can be provided for conducting a conference/meeting and/or obtaining, managing and archiving conference/meeting data. For example, a meeting participation application and multi-layer presentation data (including a presentation document and an overlay layer) can be provided through a network to a participant. The meeting participation application allows the participant to make annotations which overlay the presentation document, and captures the user input as data in the overlay layer. Thereafter, processing may be performed to extract keywords from the captured annotations, and such extracted keywords can be archived along with meeting materials, documents, information and other content as meeting data in a meeting database.

Abstract: A method, system, and computer program product for parsing an information string to extract requested information related to a remotely monitored device communicatively coupled to a network, including accessing the device using an HTTP protocol to obtain an information string associated with the device; determining, based on a type of the requested information, data extraction information for optimally extracting the requested information from the device; parsing the information string according to the data extraction information to identify substrings within the information string; and determining the requested information based on the information string, identified substrings, and the data extraction information.

Abstract: Systems and methods for efficiently processing electronically stored information (ESI) are described. The systems and methods describe processing ESI in preparation for, or association with, litigation. The invention preserves the contextual relationships among documents when processing and indexing data, allowing for increased precision and recall during data analytics.

Abstract: A recommendation method includes providing an ontology database, in which the ontology database includes a plurality of entities, and the entities are arranged in an ontology hierarchy structure with N hierarchy levels; storing a plurality of jth level user data respectively corresponding to a plurality of users; generating a plurality of kth level user data according to the jth level user data respectively; clustering the kth level user data; and recommending the entities in the ontology database to the users according to a clustering result.

Abstract: Various technologies described herein pertain to executing a mixed query to search a database retained in a data repository. The mixed query includes a regular expression, which is a pattern of elements, and a semantic constraint. The elements in the regular expression include a first wildcard, where the semantic constraint restricts a meaning of the first wildcard. Moreover, the elements in the regular expression include explicit lexical constraint(s) and/or disparate wildcard(s). For instance, semantic constraint(s) can restrict meaning(s) of the disparate wildcard(s). The mixed query is executed to retrieve results that match the pattern of the elements in the regular expression and satisfy the semantic constraint(s).

Abstract: A method includes hierarchically identifying occurrences of some of the words in the set of sentences; creating a first index for each of some of the words based on the upper hierarchy of occurrences identified for each word; receiving input of a queried word; hierarchically identifying occurrences of the queried word in the set of sentences; creating a second index based on the upper hierarchy of occurrences identified for the queried word; comparing the first index and the second index to calculate an estimated value for the number of occurrences of a word in the neighborhood of the queried word; and calculating the actual value of the number of occurrences of a word in the neighborhood of the queried word based on an upper hierarchy and lower hierarchy of the occurrences on condition that the estimated value is equal to or greater than a predetermined number.

Abstract: Systems and methods generate building process summary data depicting a process over time. A method includes receiving a process value and attribute information. The method includes calculating statistical moments for the received data. The method includes retrieving a “where used” database list for a specific process. The method further includes determining if received attribute information matches database record attributes. Where there is a match, the method includes storing calculated statistical moments for the received data into a current database record. While the received attribute information matches additional database record attributes according to the “where used” database list, the method includes storing calculated statistical moments for the received data into additional database records as building process summary data.

Abstract: A data block stores one or more rows of a database table or relation. An entire row may not fit in a data block. Part of the row is stored in one data block, and another part is stored in another data block. Each row part is referred to herein as a row segment and the data blocks are referred to as row-segmented data blocks. Data block dictionary compression is used to compress row-segmented data blocks. Each data block contains a dictionary that is used to compress rows in the data block, including row segments. The dictionary in a data block is used to compress row segments in the data block. Hence, multiple dictionaries may be used to decompress a row comprised of row segments.