Abstract: A method for processing a time series includes dividing, with a processing device, the time series into a plurality of windows by time; extracting at least one group of similar subsequences from a current window among the plurality of windows; and updating a candidate list on the basis of comparison between similar subsequences in each group of the at least one group with k characteristic subsequences in the candidate list; wherein the k characteristic subsequences are k characteristic subsequences with a greatest number of occurrences in at least processed parts of the time series.

Abstract: Various embodiments are generally directed to an apparatus, method and other techniques to receiving a sequence of transactions, each transaction including a request to write data to a memory device, processing the sequence of transactions, and communicating a response to a host after the sequence of transaction have been completed.

Abstract: A method that includes establishing a layered attribute description network according to description values of the filtering requirements; extracting description values that are in the attribute description network; establishing a mapping relationship between the filtering requirements and the attribute description network, generating a path dependency graph; performing traversal comparison between the description values included in the description information of the data object to be filtered and description values in the path dependency graph; if all description values of one description path are included in the description information of the data object to be filtered, recording the description path as a matching path of the data object to be filtered; and determining a filtering requirement that the data object to be filtered meets.

Abstract: Embodiments include methods, systems and computer program products for storing graph data for a directed graph in a relational database. Aspects include creating a plurality of relational tables for the graph data, using a processor on a computer, the plurality of relational tables including adjacency tables and attribute tables. Each row of the attribute tables is dedicated to a subject of the graph data in the dataset and stores a JavaScript Object Notation (JSON) object corresponding to the subject. Each row of the adjacency tables includes a hashtable containing properties and values of the subject for that row.

Abstract: Embodiments include methods, systems and computer program products for storing graph data for a directed graph in a relational database. Aspects include creating a plurality of relational tables for the graph data, using a processor on a computer, the plurality of relational tables including adjacency tables and attribute tables. Each row of the attribute tables is dedicated to a subject of the graph data in the dataset and stores a JavaScript Object Notation (JSON) object corresponding to the subject. Each row of the adjacency tables includes a hashtable containing properties and values of the subject for that row.

Abstract: Initiating backups based on data changes is described. A system identifies an amount of data changed for a client since a previous backup operation for the client. The system determines whether the amount of data changed meets a threshold requirement. The system initiates a backup operation for the client if the amount of data changed meets the threshold requirement.

Abstract: A method for synchronizing a local file system (LFS) and a remote (cloud) file system (RFS) includes the step of storing events indicative of differences between the LFS and the RFS, where the events are associated with file system objects of the LFS and RFS. The method further includes the steps of prioritizing the events, generating file system operations for the events based at least in part on the prioritization of the events, and performing at least some of the file system operations to synchronize the LFS and RFS. Prioritizing the events includes defining a plurality of service classes (e.g., based on type of event, event attribute, etc.), assigning a priority to each of the service classes, and assigning each event to one of said service classes. Systems are also described. The invention allocates limited synchronization resources based on a predefined policy to synchronize important file system objects sooner.

Abstract: A computer scans a DITA library to identify DITA topic files. The computer then determines whether the identified DITA file has a concept, task, or reference scheme. Based on determining that the identified DITA topic file has a concept scheme, the computer generates a subject taxonomy. Based on determining that the identified DITA topic file has a task scheme, the computer generates a navigation taxonomy. Based on determining that the identified DITA topic file has a reference scheme, the computer generates a command relational taxonomy. Based on the generated subject, navigation, and command relational taxonomies, the computer generates a DITA file relationship table based on the contextual taxonomy density of the aforementioned taxonomies.

Abstract: A method for processing a time series includes dividing, with a processing device, the time series into a plurality of windows by time; extracting at least one group of similar subsequences from a current window among the plurality of windows; and updating a candidate list on the basis of comparison between similar subsequences in each group of the at least one group with k characteristic subsequences in the candidate list; wherein the k characteristic subsequences are k characteristic subsequences with a greatest number of occurrences in at least processed parts of the time series.

Abstract: A method, system, and recording medium for web Application Programming Interface (API) recommendation, including given a plurality of service description document, gathering a bag of words from the document, generating a service-word matrix based on the bags of words describing the service descriptions, and given a query by a user, recommending a ranked list of services based on the service-word matrix.

Abstract: The invention concerns a system having: a virtual assistant interactivity platform (102) including: a processing device; a memory device storing data identifying a plurality of virtual assistants, and one or more topics associated with each virtual assistant; a communication interface configured to receive an input query from a user device (104); and a memory coupled to the processing device and storing executable instructions that, when executed by the processing device, cause the processing device to: assess the input query to identify a subset of at least one of the virtual assistants based on a comparison between at least one topic of the query and the one or more topics associated with each virtual assistant; transmit a query based on the input query to each of the virtual assistants of the subset; evaluate answers to the input query received from the virtual assistants of the subset in order to generate a response comprising one or more of the answers; and transmit the response to the user device.

Abstract: One or more systems and/or methods for determining a query date range and/or searching a content corpus are provided. A set of content items (e.g., digital images, videos, etc.), associated with an event, may be identified from a content corpus. The set of content items may be evaluated to identify temporal features (e.g., digital time stamps) for the set of content items. A query date range for the event may be determined based upon the temporal features (e.g., users may capture photos that are related to Christmas from December 4th to December 27th). In an example, responsive to receiving a search query, associated with the event, the search query may be adjusted based upon the query date range to create an adjusted search query. The content corpus may be searched using the adjusted search query to create search query results for the search query.

Abstract: Mechanisms are provided for implementing a candidate answer variant engine. The mechanisms receive an indication of a structured portion of content in a corpus, generate a plurality of groupings of elements of the structured portion of content, and generate, for each grouping of elements in the plurality of groupings of elements, and for each element in the grouping of elements, a corresponding grouping vector representation, corresponding to the element. The mechanisms, for each grouping vector representation of each grouping of elements in the plurality of groupings of elements perform a similarity measure calculation between the grouping vector representation and a vector representation of an input question, and select an element corresponding to the grouping vector representation for inclusion as a candidate answer variant based on results of the similarity measure calculation. The mechanisms perform question answering operations based on an analysis of one or more candidate answer variants.

Abstract: A method for processing data is provided. Data is identified by a computer system. The data is processed in parallel by the computer system using temporal transformations to form pieces of temporal data. The pieces of temporal data are placed by the computer system in an order as the pieces of temporal data are generated by the temporal transformations to form a sequence of temporal data. The order of the sequence is based on a priority of when the pieces of temporal data should be processed, enabling performing an action.

Abstract: A data storage unit of a data editing apparatus stores both a base indicating a data attribute and a data value in association with each other as data to be edited. A code acquisition unit acquires a user code, which is a code described in a first program language for describing data editing details by intensive notation and which describes editing details for the data to be edited that are based on the base. A code generation unit generates, in accordance with a predetermined correspondence relationship between a second program language for describing data editing details by extensive notation and the first program language, an execution code described in the second program language based on the user code. An editing processing unit edits the data to be edited in accordance with the execution code.

Abstract: Described are techniques for request processing. A request may be received from a requester for first data to be returned to the requester. The request may be in accordance with an application programming interface. The first data may include a plurality of objects each including a value for a first property. The request may include a parameter of the application programming interface indicating to return the plurality of objects sorted in accordance with natural ordering based on the first property of each of the plurality of objects. The natural ordering may be performed as the default ordering. With natural ordering, one or more consecutive digits in a string are treated as a single numeric value rather than individual characters. First processing may be performed to service the request and obtain the first data. A response, including the first data, may be generated in accordance with the first processing.