Abstract: Disclosed is a service processing method, a server and a computer storage medium. In the method, for each of a plurality of services, a reservation amount of the service and a usage amount of the service are determined according to service usage information of a client; the reservation amount of the service and a usage-reservation ratio parameter of the service are processed on the basis of a characteristic value strategy to obtain a characteristic value of each service, the usage-reservation ratio parameter of the service is determined on the basis of the reservation amount of the service and the usage amount of the service; and a graphical interface of the client is called to present a ranking result of characteristic values of the plurality of services.

Abstract: A system that implements a data storage system may store data for a database table in multiple replicated partitions on respective storage nodes. An export of an active database partition may generate an exported copy of the database partition. A first exported copy may be stored locally on a source node and a second exported copy of the database partition may be sent to a recipient node. The source node may validate the first copy responsive to sending the second copy and may perform the validation while the second copy is being sent and processed at the recipient node. If the first copy cannot be validated, the source node may cause the second copy to be invalidated and abort further processing of the second copy. The source node may also cause the second copy to be marked as invalid to prevent reliance on an invalid database partition copy.

Abstract: A non-transitory computer-readable recording medium stores a data search program that causes a computer to execute a process including: receiving a search character string for target text data; and searching for the search character string by a logical operation between index information associated with appearance positions in the target text data of each of characters or words appearing in the target text data as bitmap data and search bitmap data generated to be associated with an appearance order in the search character string of respective characters or respective words constituting the search character string.

Abstract: There are provided mechanisms for associating metadata with a multimedia file. The method is performed by a mood detector. A method includes detecting presence of a mood indicator in the multimedia file by a mood detection module analysing the multimedia file. The method includes determining a mood descriptive value by a mood classification module analysing a segment of the multimedia file, wherein the segment is defined by the mood indicator. The method further includes associating the mood descriptive value with the multimedia file as metadata. Detecting presence of the mood indicator by the mood detection module acts as a trigger to determine the mood descriptive value by the mood classification module.

Abstract: A system and method for selecting a subset of images may include: obtaining a plurality of image files, each image file relating to a digital image of the plurality of digital images, each file including image data and metadata, the metadata including a first set of features, and a second set of features; clustering the plurality of images based on at least one of the first set of features to generate clusters of images; selecting a set of M largest clusters of images, wherein M is a positive integer; scoring the images of each of the selected clusters based on at least one of the second set of features; and selecting a set of N images with a highest score from the selected clusters, wherein N is a positive integer.

Abstract: A transaction execution method, apparatus, and system is disclosed. The method is applied to a CN of an OLTP cluster database, and the method includes: receiving a page request message sent by a first PN, where the first PN has a first transaction configured, the first transaction includes at least one operation, and the page request message includes an identifier of a to-be-processed page and an identifier of the first PN; if the to-be-processed page indicated by the identifier of the to-be-processed page is the same as a hot page in a preset hot page set, determining a target operation corresponding to the to-be-processed page, where the preset hot page set includes at least one hot page; executing the target operation on the to-be-processed page to obtain an execution result; and sending the execution result to the first PN indicated by the identifier of the first PN.

Abstract: A method, apparatus, and computer program product for assigning data to columnar storage is disclosed. In one aspect of the invention, a computer implemented method is provided comprising analyzing, on one or more computers, a database stored in a storage system accessible from the one or more computers. The method also comprises determining, on one or more computers, one or more database elements from the database to be assigned to a columnar storage in the database and assigning, on one or more computers, the one or more database elements to the columnar storage in the database. The one or more database elements to be assigned to the columnar storage is determined based on at least one of a table dimension, entity relationship, compatibility with a specified schema structure, relational data structure of the database, access statistics of the database element or incoming query workload of the database element.

Abstract: Systems and methods for building a distributed dwarf cube comprising dwarf cuboid using mapreduce technique are disclosed. Data comprising cube values and a cube definition may be received. The cube definition comprises dimensions defined for the cube values. The data received is processed. The data may be transformed to a format. Based upon the format of the data, indexes may be generated. The cube values in one or more dimensions may be sorted based on a cardinality of the cube values. The cube values may be sorted in an order of highest cardinality to lowest cardinality. The cardinality indicates distinctiveness of the cube values in the one or more dimensions. The data may be partitioned into data blocks. A dwarf cuboid may be built for one or more data blocks based upon the order of the cardinality of the cube values.

Abstract: Various aspects of the subject technology related to systems and methods for mapping communication content based on topic analysis to determine user knowledge scores. A system may be configured to receive communication content including spoken and non-spoken content. The system may convert spoken content to non-spoken content and a data set of the communication content may be generated. The system may construct a generative statistical model identifying a list of topics in the data set. The generative statistical model may also identify the topic percentage of words in the data set that are associated with a given topic. The system may generate a communication content graph identifying user nodes and word edges. The system may calculate a topic strength for each word edge and determine a user knowledge score for each user associated with each identified topic. The system may output the user knowledge score.

Abstract: An image deployment method includes obtaining a configuration policy for a container, where the configuration policy for the container includes an autoscaling policy or a replication control policy. The autoscaling policy includes a first image identifier, a maximum quantity of containers corresponding to the first image identifier that can be deployed, and a quantity of currently deployed containers corresponding to the first image identifier. The replication control policy includes a second image identifier and a quantity of containers corresponding to the second image identifier that are expected to be deployed. The method determines an identifier of a to-be-deployed image according to the configuration policy for the container.

Abstract: A cognitive assistant system which includes one or more components which may be worn or carried by a user for capturing sensory data of the user. The cognitive assistant system further includes a processor which processes captured data for structuring cognitive cued database and for an episodic cue-based display and navigation, which facilitates comprehension and effective recall of information to a particular user.

Abstract: A group forming unit acquires position information of a subject that is a user or a terminal device, and forms a group including a plurality of subjects on the basis of time series data of the position information pertaining to the plurality of subjects. A point calculator calculates, on the basis of the time series data of the position information, a characteristic action amount indicating the degree of being matched with a predetermined action pattern in which influence of a subject in the group is high, for each of the plurality of subjects included in the group formed in the group forming unit, and calculates a point for each of the subjects on the basis of the characteristic action amount. An item selector selects an item to be presented to the group such that a subject having a high point calculated in the point calculator is prioritized.

Abstract: The present invention discloses a device and a method for identifying the social relations of users and a terminal device. According to the present invention, the Wi-Fi connection information of terminal devices used by the users within a predetermined scene period is collected, a scene Wi-Fi corresponding to each terminal device in a predetermined scene is identified according to the Wi-Fi connection information, and it is determined that the users using the terminal devices corresponding to the same scene Wi-Fi have a first-level contact relation. In this way, the first-level contact relations among the users can be identified based on the collected Wi-Fi connection information of the terminal devices used by the users, thereby solving the problem that in an existing technology for identifying the social relations of the users, because of the relatively single source of social data, the social relations of the users cannot be accurately obtained in the absence of social data.

Abstract: Techniques for cloud data backup are disclosed. Example methods may store backup data from a client computer on portions of data storage media associated with peer computers. In some example embodiments, a file may be encoded into segments using an error-tolerant encoding scheme, and the segments may be stored on peer computers. In some example embodiments, individual segments may be stored on more than one peer machine and/or an individual peer machine may not receive all of the segments associated with the file.

Abstract: Event based analytics database synchronization is described. In one example, an event tracking engine can sequence through batches of records in a transactional database that is being synchronized to an analytics database. The event tracking engine can determine a last version attribute associated with the batch, and query the transactional database to identify any records for the batch having a more recent version attribute than the last version attribute. When any records in the transactional database having a more recent version attribute are identified, the event tracking engine finds the data values in the record are different than those in the analytics database. The data values can be normalized, for example, before being forwarded to an analytics system for incorporation into the a analytics database. Over time, changes in the transactional database are identified and populated or mirrored in the analytics database.

Abstract: Embodiments of the present disclosure provide a playlist list determining method and device, an electronic apparatus, and a storage medium. The method comprises: determining feature data of music features comprised in preselected playlists and feature data of music features of preferences of a target user, wherein the music features comprised in the preselected playlists correspond to the music features of the preferences of the target user; calculating correlation coefficients between the feature data of the music features comprised in the preselected playlists and the feature data of the music features corresponding to the preferences of the target user; and determining the preselected playlists to be candidate playlists when the correlation coefficient between the feature data of the music features comprised in the preselected playlists and the feature data of the music features corresponding to the preferences of the target user meets a preset condition.

Abstract: Techniques for retrieving electronic patent documents are disclosed. In one particular embodiment, the techniques may be realized as a method comprising receiving, by at least one computer processor communicatively coupled to a mobile device, an image containing an encoding of a patent number; decoding, by the at least one computer processor, the patent number; transmitting, by the at least one computer processor, the patent number to a patent database; and receiving, by the at least one computer processor, patent information based on the patent number.

Abstract: Systems and methods are discussed to automatically create a domain ontology that is a combination of ontologies. Some embodiments include systems and methods for developing a combined ontology for a website that includes extracting collocations for each webpage within the website, creating first and second ontologies from the collocations, and then aggregating the ontologies into a combined ontology. Some embodiments of the invention include unique ways to calculate collocations, to develop a smaller yet meaningful document sample from a large sample, to determine webpages of interest to users interacting with a website, and to determine topics of interest of users interacting with a website. Various other embodiments of the invention are disclosed.

Abstract: The present disclosure discloses a second-degree friend query method. The method includes storing a first-degree friend of each account, querying for the first-degree friend after receiving a second-degree friend query command, and query the first-degree friend to obtain a second-degree friend. A storage module stores the first-degree friend relationships. The second-degree friend is obtained through a query according to the first-degree friend in real time. The present disclosure further discloses a second-degree friend query apparatus and system corresponding to the foregoing method and a storage medium. The system includes a processing server and a storage server. The storage server stores a first-degree friend for each account, and queries for and returns the first-degree friend at the request of the processing server. The processing server controls an entire query procedure, and obtains a second-degree friend after twice queries.

Abstract: A data recovery method in a distributed storage system including a NameNode, a plurality of first storage nodes and a plurality of second storage nodes, where each of the first storage nodes includes a data processing apparatus communicatively coupled to the NameNode. The data processing apparatus receives a file block obtaining request carrying an identifier of a target file, determines that a target file block is lost according to the identifier of the target file, obtains, from the NameNode, an identifier of a target storage node on which a recovery dependence data block is located, and obtains the recovery dependence data block according to the identifier of the target storage node and the identifier of the target file to recover the target file block.