Abstract: A system including a GUI displayed on a display device is disclosed. The GUI includes a website that, when loaded onto a user device, permits the user device to communicate with at least one server to send to the at least one server item information to electronically manage one or more items in a product information database, to receive from the at least one server item information from the product information database, and to cause display of the item information received. The at least one server is remote from the user device on which the website is loaded and that is able to communicate with the user device. The at least one server is configured to receive the item information about the one or more items from the product information database, update the item information in the product information database, and send the item information to the website.

Abstract: A maintenance information sharing device includes a maintenance record obtainer configured to obtain a maintenance record of a maintenance target, a maintenance record storage configured to associate the maintenance record obtained by the maintenance record obtainer with identification information for identifying the maintenance target, the maintenance record storage storing the maintenance record associated with the identification information, a maintenance information generator configured to generate maintenance information based on the maintenance record associated with the identification information and stored by the maintenance record storage, a maintenance information storage which stores the maintenance information generated by the maintenance information generator, a searcher configured to search the maintenance information stored by the maintenance information storage based on the identification information, and a maintenance information provider configured to provide the maintenance information sear

Abstract: Systems and methods include identifying a media segment of audio or video content. The video segment is identified by deriving data from media content and comparing said data to a reference database in order to identify said video segment. Embodiments of the invention improve the speed and accuracy of the media identification process by advantageously partitioning the indexes in subdivisions where high value reference information is separated from the bulk information, for example.

Abstract: Systems and methods for backing up and restoring virtual machines in a cluster environment. An instrumentation interface enables configuration data to be stored with save sets during backup and enables the configuration of the destination to be adjusted based on the stored configuration during a restore.

Abstract: A method, apparatus, system, and computer program product for processing a query received through a network. A computer system identifies a topic in the query. The computer system identifies a set of friends of a user from a set of social media networks in which the set of the friends have an expertise in the topic identified in the query. The computer system ranks the set of the friends based on a level of the expertise of the set of the friends for the topic and an availability of the set of the friends to form a ranked set of the friends. The computer system returns results that contain the ranked set of the friends for the topic.

Abstract: A system and method for leveraging a native operating system (130) page cache (315) when using non-block system storage devices (120) is disclosed. A computer (105) may include a processor (110), memory (115), and a non-block system storage device (120). A file system (135) may be stored in memory (115) and running on the processor (110), which may include a page cache (315). A key-value file system (KVFS) (145) may reside between the file system (135) and the storage device (120) and may map received file system commands (310) to key-value system commands (330) that may be executed by the storage device (120). Results of the key-value system commands (330) may be returned to the file system (135), permitting the operating system (130) to cache data in the page cache (315).

Abstract: A control method for performing a multi-table join operation and a corresponding apparatus are disclosed. Fields in a table whose fields participating in a theta join operation and used in the query statement meet a first preset condition are decomposed, to obtain a plurality of first field groups, so that the theta join operation can be implemented in steps in a form of the plurality of field groups. This can reduce a data amount of Cartesian product calculation during one join operation, greatly reduce network transmission overheads, computing overheads, and memory overheads, and improve execution efficiency.

Abstract: This disclosure provides an apparatus and method for use in industrial control systems and other systems. A method includes detecting, by a primary node, that a backup node is available and unconfigured. The method includes automatically replicating, by the primary node, the primary node to the backup node, including replicating a personality of the primary node to the backup node.

Abstract: Techniques are provided for maintaining timestamp parity during a transition replay phase to a synchronous state. During a transition logging phase where metadata operations executed by a primary node are logged into a metadata log and regions modified by data operations executed by the primary node are tracked within a dirty region log, a close stream operation to close a stream associated with a basefile of the primary node is identified. A determination is made as to whether the dirty region log comprises an entry for the stream indicating that a write data operation previously modified the stream. In an example, in response to the dirty region log comprising the entry, an indicator is set to specify that the stream was deleted by the close stream operation. In another example, a modify timestamp of the basefile is logged into the metadata log for subsequent replication to the secondary node.

Abstract: Methods and systems for client side search ranking improvements are disclosed. In one example, a search query is received from a user on a client device. The local search results are filtered based on the received search query and one or more local ranking rules. Features for each filtered local search result are computed. The computed features of each filtered local search result are input to one or more machine learning (ML) models. Each ML model can generate a score for each filtered local search result. The filtered local search results are ranked based on the generated score within a category. In one example, local search results and remote server search results are obtained. The local search results and remote server search results are ranked using at least one machine learning (ML) ranking model. The ranked local search results and remote server search results are displayed on the client device by category.

Abstract: One embodiment provides a method, including: receiving a query from a user; identifying that a desired definition of the at least one term is unknown, by determining that the at least one term does not map to a term having a known definition; receiving the definition of the at least one term from the user; adding the definition to a domain grammar comprising (i) domain-specific terminology and (ii) definitions corresponding to the terms within the domain grammar, wherein the adding comprises (a) extracting expressions from the requested definition and (b) adding, for the at least one term, the expressions into a structured format within the domain grammar; combining (iii) the requested definition and (iv) terms from the parsed query having previously known definitions into a complete query; and providing a response to the query by executing the complete query on a knowledge store.

Abstract: A method, system and computer program product for providing enhanced action fulfillment using classification valency. At least a first message from a user in a channel is analyzed, the first message containing first data of a first data type, and a classification of the first message is inferred based on the first data's content. At least a second message from the user in the channel is analyzed, the second message containing second data of a second data type different from the first data type, and a classification model of the second message is derived based on the second data's content. The classification of the first message and the classification model of the second message are used to determine whether an additional inference is available based on the classification valency. The additional inference is incorporated to determine the enhanced action fulfillment, and the enhanced action is presented to the user for fulfillment.

Abstract: A method includes receiving, at a processor, first source data structured according to a first schema. The method further includes receiving, at the processor, second source data structured according to a second schema different from the first schema. The method further includes outputting, by the processor, event stream data for storage at a storage device, the event stream data representing a first event extracted from the first source data and a second event extracted from the second source. The event stream data includes a plurality of events corresponding to changes associated with a subject instance. The method also includes generating a profile of the subject instance based on the event stream data. The profile indicates a chronology of the changes associated with the subject instance.

Abstract: A computer-implemented data processing system and method writes a first plurality of copies of a data set at a first plurality of hosts and reads a second plurality of copies of the data set at a second plurality of hosts. The first and second pluralities of copies may be overlapping and the first and second pluralities of hosts may be overlapping. A hashing function may be used to select the first and second pluralities of hosts. Version histories for each of the first copies of the data set may also be written at the first plurality of hosts and read at the second plurality of hosts. The version histories for the second copies of the data set may be compared and causal between the second copies of the data set may be evaluated based on the version histories for the second copies of the data set.

Abstract: A computer system identifies and prioritizes issues in electronic documents from electronic social media sources and/or from traditional media sources. The computer system includes a communication network linked to one or more of the sources and a computer server in communication with the communication network. The computer server is configured to receive electronic documents from the sources via the communication network. The computer server has memory and a processor, the memory including processor executable instructions stored in the memory and executable by the processor. The instructions comprise data collection instructions, topic modeling instructions including instructions for weighing and instructions for indicating a distribution for identified issues within each of the retrieved documents, issue assignment instructions, instructions for determining, and instructions for ranking.

Abstract: This application discloses an information search method and apparatus. The method includes the steps of receiving a voice message from a first terminal, the voice message including a first request, and the first request requesting a search operation; parsing out a search keyword of the first request from the voice message; and performing the search operation by using the search keyword to obtain a search result. The method further includes sending the search result to a second terminal, the first terminal being associated with the second terminal, and the second terminal being configured to present the search result.

Abstract: Managing performance metrics includes: obtaining a plurality of performance metrics associated with a plurality of sources on a network; aggregating, at a first rate, the plurality of performance metrics associated with the plurality of sources to generate a plurality of first aggregated results; maintaining at least some of the plurality of first aggregated results in one or more memories; aggregating, at a second rate, the plurality of first aggregated results to generate a plurality of second aggregated results, the second rate being a lower rate than the first rate; and maintaining at least some of the plurality of second aggregated results in the one or more memories.

Abstract: A fine-grained scalable time-versioning support for large-scale property graph databases includes receiving a request, wherein the request includes an entity identifier (ID) and reference time information, and searching entries of a first table using the entity ID as a first key. Matching an entry is performed corresponding to the first key in the first table, determining the entry is valid based at least in part on comparing the reference time information of the request with stored time information for the entry, and responsive to the determination, creating a second key, wherein the second key concatenates an ID associated with the entity ID with the reference time information of the request. Searching a second table is performed having entries based at least in part on the second key, and responsive to searching the second table, retrieving data associated with the second key.

Abstract: Techniques and solutions are provided for performing adaptive database table placement in a non-uniform memory access (NUMA) architecture. The adaptive table placement can occur in response to changing workloads on the NUMA nodes. For example, if a particular NUMA node is saturated, a database table may be moved from the memory of the saturated NUMA node to the memory of another NUMA node that is underutilized. In some cases, an entire database table is moved, while in other cases the database table is partitioned and only part of the table is moved.

Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.