Abstract: A natural language query can be processed via a main natural language processor. A request to produce an intent of the query can be dispatched from the main natural language processor to an extension natural language processor. An intent of the query can be generated via the extension natural language processor in response to the dispatched request, with the generating of the intent being performed independently of the main natural language processor. The intent of the natural language query can be passed from the extension natural language processor to the main natural language processor in response to the request to produce the intent of the query. A selection of a conversation query processor for responding to the intent can be produced via the main natural language processor. Additionally, an instruction to respond to the intent of the query can be passed to the selected conversation query processor.

Abstract: A method and apparatus for criterion-based retention of data object versions are disclosed. In the method and apparatus, a plurality of keys are sorted in accordance with an ordering scheme, whereby a key of the plurality of keys has an associated version of a data object and a timestamp. The key is inspected in accordance with the ordering scheme to determine based at least in part on the timestamp whether a criterion for performing an action on the associated version of the data object is satisfied. If the criterion is satisfied, a marker key is added to the plurality of keys, whereby the marker key precedes the inspected key according to the ordering scheme and indicates that the criterion is satisfied.

Abstract: Example embodiments provide a prediction-based caching system. The caching system receives an application program interface (API) request from a component of the client device. The request indicates a parameter for current requested information. The caching system causes a search of both a cache and a source for the current requested information based on the parameter. The caching system causes retrieval of the current requested information from one of the cache or the source. The caching system then transmits the current requested information to the component of the client device. The caching system also predicts a future request for information (or receives a predicted request for future information). The caching system retrieves predicted results based on the predicted request from the source, and stores the predicted results in a cache for faster retrieval.

Abstract: A method is described herein. The method includes generating an allocation map for a backup. The method also includes storing the allocation map in a storage device. The method further includes reading the allocation map to skip reading empty blocks during storing of a file from the backup. The method also further includes and reading the allocation map to skip writing zeros to a formatted target disk during a restore session of a file from the backup.

Abstract: Methods for providing metrics for a plurality of storage entities of a multi-array data storage system are disclosed. As a part of a method, data representing storage characteristics from one or more storage entities is collected and a selection of a storage entity of the one or more storage entities is allowed. Responsive to the selection, a value is presented that is indicative of a predicted impact on the selected storage entity when data migration is performed. The predicted impact is determined based on the amount of shared data between the selected entity and at least one other storage entity.

Abstract: According to an aspect of an embodiment, a computer system including at least one computer is configured to generate, specification concept graphs of nodes spec1, spec2, . . . , specm including concepts node and relation nodes according to at least one of a plurality of digitized data from user input from a plurality of computerized data sources d1, d2, . . . , dl forming a first set of evidences U; generate concept graphs of nodes c?1, c?2, . . . , c?n including concept nodes and relation nodes for corresponding obtained plurality of IKs ?1, ?2, . . . , ?n forming a second set of evidences U; select a subset of concept graphs of nodes c?i1, c?i2, . . . , c?ih from c?1, c?2, . . . , c?n according to a computable measure of any one or combinations of consistency, inconsistency or priority threshold between c?j in c?1, c?2, . . . , c?n to specification concept graph speck in spec1, spec2, . . . , specm. Generate knowledge fragments for corresponding obtained subset of concept graphs c?i1, c?i2, . . . c?ih.

Abstract: A method begins by a computing device of a dispersed storage network (DSN) selectively bringing online and taking offline storage units of a set of storage units of the DSN. When bringing a first storage unit of the set of storage units online and taking a second storage unit of the set of storage units offline in accordance with the selectively bringing online and taking offline storage units, the method continues with the computing device determining a rebuilding approach of the first storage unit and a first to second storage unit transition. The method continues with the computing device bringing the first storage unit online in accordance with the rebuilding approach and the first to second storage unit transition and taking the second storage unit offline in accordance with the first to second storage unit transition.

Abstract: Systems, methods, and computer readable storage mediums for optimizing performance in a storage system. A volume may be mapped to an anchor medium through an indirection layer. When a snapshot is taken of the volume, the allocation of a new anchor medium is delayed until a write operation targeting the volume is received. When a write operation targeting the volume is received, a new anchor medium may be allocated for only a portion of the volume corresponding to the portion of the volume which is targeted by the write operation. Also, when a snapshot is taken of the volume, read optimization operations are performed only the portions of the volume which have changed since the previous snapshot.

Abstract: The present disclosure, in some embodiments, describes a system for classifying members of a collection of texts into clusters to generate merged data collections. A member text can range from a single document to the contents of a column in a database table. The classification may indicate and/or provide an estimation as to which documents or columns are most closely similar to each other, without making any assertion about the actual contents of the document or column. In some embodiments, a system may include counting some characteristic of the text. The characteristic may be chosen such that each text produces a set of counts. A statistical measure is then applied to determine the similarity of sets of counts associated with each pair of texts.

Abstract: The present teaching relates to providing query suggestions. A query is received from a user. A plurality of suggestions with respect to the query are obtained. One or more garbled suggestions are identified from the plurality of suggestions. One or more identified garbled suggestions are removed from the plurality of suggestions. The plurality of suggestions with removed one or more garbled suggestions are provided to the user in response to the query.

Abstract: Suggesting query items based on database fields is described. A database system receives a character sequence entered in a search box. The database system identifies a first distribution of first field-based items that include the character sequence, and a second distribution of second field-based items that include the character sequence. The database system identifies a first item based on combining the first distribution with a distribution of queried fields, and a second item based on combining the second distribution with the distribution of queried fields. The database system outputs the first item and the second item to a location associated with the search box. The database system executes a search based on any requested item, in response to receiving a request to search for any item output to the location associated with the search box.

Abstract: A system and method are disclosed for categorizing search terms. The system accesses search history for the search terms. The system also categorizes each of the search terms based on the number of times that the respective search term appears in the search history. If the number of times the search term appears in the search history exceeds a first threshold, a search result of the search term is determined and the search term is categorized as a type that is provided for registration to a user with recognized association with the search term or a type that is excluded from registration, where the categorizing based on a ratio of a number of times the search result was selected subsequent to receiving the search term to the number of times that the search term appears in the search history.

Abstract: In one example, a computer-implemented method of generating a weather product is disclosed that comprises receiving a product generation input, the product generation input being indicative of a weather product. The method further comprises retrieving a weather data point, based on the product generation input. Further, the method comprises analyzing the weather data point with a weather analysis component to identify weather parameters relevant to the weather product. In addition, the method comprises generating the weather product to include the identified relevant weather parameters.

Abstract: Storage system accelerated techniques to distribute and run containerized applications are disclosed. In various embodiments, an indication to run a container is received. A snapshot identifier comprising an image data associated with the container is used to create a clone based on a snapshot with which the snapshot identifier is associated. The clone is used to store data associated with at least a topmost layer of the container.

Abstract: An action framework system provides context-based actions in association with a source application. The source application detects selection of a content element presented by the source application. The content element is associated with an application identifier identifying a target application and an action identifier identifying an operation to be executed by the target application on the content element. The target application identified by the application identifier is executed to perform the operation identified by the action identifier on the content element, responsive to detection of the selection of the content element. In one implementation, the source application is a search feature providing different contexts of search results (e.g., from a local file system search, a local application content search, a Web search, a remote application content search).

Abstract: In a datacenter setting, a summary of differences and similarities between two or more states of the same or similar systems are predicted. Initially, a Long Short-Term Memory (LSTM) neural network is trained with to predict a summary describing the state change between at least two states of the datacenter. Given a set of training data (at least two datacenter states that are annotated with a state change description), the LSTM neural network learns which similarities and differences between the datacenter states correspond to the annotations. Accordingly, given a set of test data comprising at least two states of a datacenter represented by context graphs that indicate a plurality of relationships among a plurality of nodes corresponding to components of a datacenter, the LSTM neural network is able to determine a state change description that summarizes the differences and similarities between the at least two states of the datacenter.

Abstract: The disclosed embodiments relate to implementation of a syntax for altering one or more rules by which a blockchain may be modified wherein the software implementing each client of a blockchain network are programmed to be responsive to requests or directives to alter one or more rules by which blocks may be added to a blockchain responsive to transactions received for storage therein, the requests/directives being processed by the client as a transaction and added to the block in accordance with the current state of the operating rules, thereby adding a new rule or modifying an existing rule for subsequent operation of the client.

Abstract: Techniques are disclosed to decompose a query from a client application. A micro-service storing each object and property requested by the query is identified. A micro-service query is generated for each micro-service. Upon receiving a response from each micro-service query, the responses are joined into a single response and returned to the client application.

Abstract: A unified context-aware content archive system allows enterprises to manage, enforce, monitor, moderate, and review business records associated with a variety of communication modalities. The system may store an information infoset derived or inferred from one or more documents representing communications according to the variety of communication modalities as interaction transcripts. An interaction transcript represents interactions between participants through the documents rather than the documents themselves allowing for derivation or inference of communication events, chronologies, and mappings to be stored in a common data structure. In one aspect, events correlation is provided between participants of communications that can be established by general time series analysis for the purposes of extracting meaningful statistics and interaction contexts and other characteristics of data. In another aspect, chronological mappings are provided of conversations between an established start and end time frame.

Abstract: In a method for gathering time-variable data from electronic slave devices in data communication through a data transmission channel with an electronic master device, the slave devices periodically measure and store a current value of at least one respective time-variable parameter (P1(t), . . . Pn(t)). The master device sends a freeze command to the slave devices. Upon receipt of the freeze command from the master device, the slave devices freeze the last measured value of the at least one time-variable parameter. During a data-gathering time interval following sending of the freeze command, the master device gathers the frozen values from the slave devices.