Abstract: A computer system creates a view that has a class definition and one or more attributes of a directory to support graphical representation of the directory. A distributed processing system includes the directory and a number of nodes, one of the nodes being a service node. The directory includes entries that are associated with the nodes. The service node receives an attribute value that is associated with one of nodes. The service node determines from the class definition of the view that the received attribute value is associated with an attribute type that describes a new attribute value and creates an updated view without defining the received attribute value in the entries of the directory. The updated view includes the received attribute value.

Abstract: According to one embodiment, a document analysis apparatus is an apparatus comprising first document storage circuit for storing first documents that include words, belong to respective categories constituting a hierarchical structure, and only comprise opinion documents for a desirable object, and a second document storage circuit for storing second documents that include words, belong or do not belong to the categories constituting the hierarchical structure and comprise opinion documents for the desirable object and documents other than the opinion documents, and the apparatus is configured to classify, into one of the categories constituting the hierarchical structure, the second documents that do not belong to the respective categories among the second documents stored in the second document storage circuit.

Abstract: A synchronization protocol for multi-premises hosting of digital content items. In one embodiment, for example, a method comprises the operations of: detecting creation or modification of a content item; determining a content item namespace to which the content item belongs; obtaining a plurality of identifiers of a plurality of block servers to which the content item namespace is assigned; making a selection of one of the plurality of block servers as a target block server; and uploading any content item blocks of the content item to the target block server that are not already stored at the target block server.

Abstract: A technique provides sync capability as an independent backend service, which developers can include, at their option, in their cloud-based applications. In accordance with the improved technique, a sync service runs in a backend system in connection with a set of data. The sync service syncs changes in the set of data among application instances that have access to the set of data. Sync services may be specified selectively for different sets of data, e.g., by specifying syncing for one set of data but not for another set of data.

Abstract: In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph.

Abstract: Systems and methods are provided for linking time-based metadata to media content so that as the metadata changes in synchronicity with media content during play, information associated with the media content can be outreached in the context of the media presentation. More particularly, according to one embodiment of the present invention, a media player device is provided that renders media content and retrieves and displays appropriate metadata information associated with the media content at an appropriate time to an ancillary metadata viewer device during play of a media resource.

Abstract: In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph.

Abstract: Embodiments are described for a method and system for improving B+Tree scan performance by receiving a data access instruction that specifies pages to be accessed in a data store utilizing a B+Tree data structure; defining a read-ahead context comprising an array of page numbers corresponding to the specified pages; loading the read-ahead context array into a read-ahead cache; and reading the first page of the read-ahead context in a synchronous manner, and each of the subsequent pages of the read-ahead context in an asynchronous manner.

Abstract: A method including the steps of: receiving a search query containing search terms from a user device; retrieving from one or more data storage devices, search configuration information in response to the received search query, wherein the search configuration information comprises a designated field set; generating a plurality of query partitions based on the received search query; generating one or more internal query clauses based on all possible combinations of sub-phrases of the plurality of query partitions and fields from the designated field set; executing a query on a database based on the one or more internal query clauses; generating query results based on the executed query; calculating match metrics for all query results; determining query results having match metrics that satisfy configured match constraints as legitimate matches; and detecting patterns based on corresponding matched terms and fields of the legitimate matches.

Abstract: A method trains a model for providing content items to users of a social networking system. The system generates profile vectors based on user profile information such as demographic data and personal data. The system logs actions performed by users on the social networking system and generates behavior vectors based on the logged actions. The profile vectors and behavior vectors are each associated with a user attribute, e.g., the age or gender of a user. The system generates a difference vector based on a profile vector and a behavior vector. The difference vector is then used as a feature to train the model using machine learning techniques. The trained model may select content items that a target user is most likely to be interested in and interact with.

Abstract: A data storage system includes storage nodes adapted to provide retrieval of time-based data in response to a receipt of a time-based data retrieval request associated with data streams. Each of the data streams includes time-ordered data items having a header. The header includes timestamps representing a time interval associated with the data items. The data storage system further includes applications issuing the time-based data retrieval requests associated with the data streams and session managers coupled to the applications and storage nodes. Shared resources are dynamically allocated between the applications submitting the requests. Data requested by the requests is retrieved from the storage nodes using timestamp based indexes associated with the data streams in a substantially parallel manner. The retrieved data is merge-sorted by time. The sorted data is transmitted to the applications based on a delivery rate controlled by each application.

Abstract: An information search method and apparatus includes receiving search information entered by a user, acquiring, according to the search information, at least one search element and at least one piece of key information associated with each search element, sending the at least one piece of key information associated with each search element, to at least one search application corresponding to the search element such that the at least one search application performs a search according to the at least one piece of key information associated with the search element, and receiving search results returned by the at least one search application, and outputting the search results.

Abstract: A method for recommending keywords can receive a first search term entered by a user, search a keyword library comprising a plurality of keywords and retrieve a preset number of keywords based on a similarity coefficient between each keyword and the first search term. After receiving a second search term entered by the user, the method obtains a correlation value between the second search term and the first search term based on whether a webpage in a search result of the first search term visited by the user includes the second search term, and determines the similarity coefficient between the second search term and the first search term in accordance with the correlation value. And then, the method updates the keyword library to save the similarity coefficient between the second search term and the first search term.

Abstract: Systems, apparatuses, and methods for cloud memory sizing are disclosed. An initial database memory allocation is determined for the provisioning of a database server instance. Periodically, sizes of key database tables of the database server instance are measured and an upper and a lower bound ratio are determined based on the key database table sizes and a buffer pool size. The upper and lower bound ratios are used to determine a desired memory allocation from which a report is generated including an interface for generating an instance move action for re-provisioning the database server instance with the desired memory allocation.

Abstract: In accordance with a first exemplary embodiment, there is provided a method for extracting semantic topics from document sets in which opinions about an object are described using an apparatus capable of calculating a probability distribution. The method include (a) extracting word distributions about sentiment global topics and sentiment local topics; (b) extracting a global topic distribution, a local topic distribution and sentiment distributions about the global and local topics from the document sets; (c) performing statistical inference about each of the distributions extracted in the step (a) and the step (b); (d) extracting a global or local topic and a sentiment relevant to the global or local topic from the distributions of the inference performed in the step (c); and (e) extracting a word from the word distributions about sentiment global topics or sentiment local topics on the basis of the topic and sentiment extracted in the step (d).

Abstract: A host-side network processing device coupled between a storage system and a host machine to reconstruct a data object that has been encoded according to a sharding technique. Reconstructing the data object includes receiving, at the network processing device from the host machine, a request for the data object. The network processing device provides the request for the data object and an in-line network object reconstruction indicator to the storage system. The network processing device receives a location list from the storage system, where the location list includes location identifiers corresponding to respective shards of the requested data object. The network processing device requests at least a subset of the shards of the location list via a plurality of shard requests and reconstructs the data object from the subset. The network processing device provides the reconstructed data object to the host machine.

Abstract: A system described herein includes a receiver component that receives a first dataset, wherein the first dataset comprises temporal dynamics pertaining to a document that is accessible by a search engine, wherein the temporal dynamics comprise an identity of a term corresponding to the document and an indication that the term has been subject to change over time. The system also includes a weight assignor component that assigns a relevance weight to the document based at least in part upon the temporal dynamics pertaining to the document, wherein the relevance weight is utilized by the search engine to assign a ranking to the document with respect to at least one other document when the search engine retrieves the document.

Abstract: A device receives, from a user device, a request to prune a primary database, and receives primary database information associated with the primary database and secondary database information associated with a secondary database that is different than the primary database. The device processes the primary database information and the secondary database information, with a machine learning model, to generate suggested pruning parameters, and provides the suggested pruning parameters to the user device. The device receives selected pruning parameters from the user device, where the selected pruning parameters are selected from the suggested pruning parameters or are input via the user device. The device removes pruned information from the primary database based on the selected pruning parameters, and provides the pruned information to the secondary database based on the selected pruning parameters.

Abstract: A document classification device includes a characteristic extraction unit, a clustering unit, and a category update unit. The characteristic extraction unit extracts characteristic information from each of plural document data which are classified in advance into specific categories. The clustering unit classifies the document data with similar appearance frequency of the characteristic information into a same cluster. The category update unit assigns the document data which is classified into the same cluster with a category of different document data which is classified into the same cluster as a category of the document data.

Abstract: This application relates to the technical field of network communications, and discloses a method and an apparatus for removing redundant information of a terminal. The method includes the steps of: calculating an estimated redundancy value of at least one type of redundant information in a terminal; determining that a redundancy value of a type of redundant information reaches a threshold of the type of redundancy value; prompting a user to remove redundant information; and according to confirmation from the user, removing the type of redundant information or all redundant information. The apparatus includes a first calculating unit, a determining unit, a prompting unit and a cleanup unit.