Abstract: Provided are a computer program product, system, and method for forming a hypothesis set from sentences across documents representative of different stances taken across the documents. Sentences from the documents are clustered into a plurality of clusters. Sentences in a cluster of the clusters have stance scores with respect to other sentences in the cluster that satisfy a stance criteria. At least one similarity group of sentences is formed in the clusters having similarity scores satisfying a similarity criteria. Sentences are selected from the similarity groups in the clusters based on stance scores of the sentences in a similarity group. A hypothesis set is formed of the selected sentences in the similarity groups. Stance scores are determined of sentences in the documents with the sentences in the hypothesis set to determine stances of the documents with respect to the sentences in the hypothesis set.

Abstract: An embodiment extracts, from a natural language document, using a first language model, a set of cause-effect pairs, each cause-effect pair comprising a pair of phrases, each phrase comprising a portion of the natural language document. An embodiment constructs a first graph representing the set of cause-effect pairs, each node in the first graph representing a phrase in the set of phrases, each edge in the first graph representing a cause-effect relationship between nodes connected by an edge. An embodiment measures a graph similarity between the first graph and a second graph constructed from phrases extracted from the natural language document. An embodiment incorporates, into a knowledge base responsive to determining that the graph similarity is above an acceptance threshold, the first graph.

Abstract: Systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to federated training and inferencing. A system can comprise a memory that stores computer executable components, and a processor that executes the computer executable components stored in the memory, wherein the computer executable components can comprise a modeling component that trains an inferential model using data from a plurality of parties and comprising horizontally partitioned data and vertically partitioned data, wherein the modeling component employs a random decision tree comprising the data to train the inferential model, and an inference component that responds to a query, employing the inferential model, by generating an inference, wherein first party private data, of the data, originating from a first passive party of the plurality of parties, is not directly shared with other passive parties of the plurality of parties to generate the inference.

Abstract: Input data is obtained and converted into a graph. Based on the converted input data, a time series of snapshot graphs is generated by selecting edges whose timestamps are in a given time window for each of a plurality of time windows, each edge having a corresponding attribute. Internal flow probabilities are computed for each snapshot graph of the time series of snapshot graphs and a system is controlled based on the internal flow probabilities.

Abstract: Provided is a mower that makes it possible to predict a consumption rate of its battery, a change in the remaining capacity of the battery, the workable time from the state in which the battery is fully charged, and the time when to replace the battery.

Abstract: Embodiments are disclosed for a method. The method includes determining that a thief thread attempted a work steal from a garbage collection (GC) owner queue. Additionally, the method includes determining that a number of tasks in the GC owner queue meets a predetermined threshold. Further, the method includes determining that the GC owner queue comprises a heavy-weight task. The method also includes moving the heavy-weight task to a top position of the GC owner queue.

Abstract: Methods and systems for traffic jam management include generating a representation of a road network that comprises a road graph, with vertices of the road graph representing road segments and edges of the road graph representing pairs of adjacent road segments at each intersection. The road graph is partitioned into sub-graphs to balance a number of messages received from vehicles within each sub-graph and to minimize vehicle transitions between sub-graphs. It is determined that a traffic jam is present on one or more road segments. Navigational information is provided to one or more vehicles responsive to the traffic jam.

Abstract: A computer-implemented method is presented for reducing data loading overhead of middleware to facilitate direct data loading to a database management system (DBMS). The method includes, while data loading, sending external-writes to a memory-based DBMS if corresponding internal-writes are for vertices, exporting all the external-writes to a disk-based DBMS as an export file, and sending an external-read for vertices to an in-memory DBMS if the middleware requests data. The method further includes, at the end of data loading, generating files for raw data of the disk-based DBMS from the export file and sending the generated raw files to the disk-based DBMS.

Abstract: Embodiments are disclosed for a method. The method includes determining that a thief thread attempted a work steal from a garbage collection (GC) owner queue. Additionally, the method includes determining that a number of tasks in the GC owner queue meets a predetermined threshold. Further, the method includes determining that the GC owner queue comprises a heavy-weight task. The method also includes moving the heavy-weight task to a top position of the GC owner queue.

Abstract: Systems and methods for processing hierarchical tasks in a garbage collection mechanism are provided. The method includes determining chunks in a task queue. Each chunk is a group of child tasks created after processing one task. The method includes popping, by an owner thread, tasks from a top side of the task queue pointed at by a chunk in a first in first out (FIFO) pop. The method also includes stealing, by a thief thread, tasks from a chunk in an opposite side of the task queue.

Abstract: A computer-implemented method is presented for reducing data loading overhead of middleware to facilitate direct data loading to a database management system (DBMS). The method includes, while data loading, sending external-writes to a memory-based DBMS if corresponding internal-writes are for vertices, exporting all the external-writes to a disk-based DBMS as an export file, and sending an external-read for vertices to an in-memory DBMS if the middleware requests data. The method further includes, at the end of data loading, generating files for raw data of the disk-based DBMS from the export file and sending the generated raw files to the disk-based DBMS.

Abstract: A computer-implemented method for increasing record availability on a distributed database system implementing multiple partitioning strategies includes identifying first processing devices of a distributed database system for storing one or more first records in accordance with multiple partitioning strategies, determining that at least two of the first processing devices are identified for storing a given one of the one or more first records, and selecting one or more new processing devices of the distributed database system for storing the given first record to achieve sufficiently high availability of the given record within the distributed database system.

Abstract: Systems and methods for processing hierarchical tasks in a garbage collection mechanism are provided. The method includes determining chunks in a task queue. Each chunk is a group of child tasks created after processing one task. The method includes popping, by an owner thread, tasks from a top side of the task queue pointed at by a chunk in a first in first out (FIFO) pop. The method also includes stealing, by a thief thread, tasks from a chunk in an opposite side of the task queue.

Abstract: A method is provided for consistent data processing by first and second distributed processing systems having different data partitioning and routing mechanisms such that the first system is without states and the second system is with states. The method includes dividing data in each system into a same number of partitions based on a same key and a same hash function. The method includes mapping partitions between the systems in a one-to-one mapping. The mapping step includes calculating a partition ID based on the hash function and a total number of partitions, and dynamically mapping a partition in the first system to a partition in the second system, responsive to the partition in the first system being unmapped to the partition in the second system.

Abstract: Methods and systems for performing garbage collection include issuing a memory fence that indicates that a number of tasks in a garbage collection deque, belonging to a first garbage collection thread, has decreased by more than one. A length of the garbage collection deque, after the memory fence is issued, is determined to be greater than zero. Multiple tasks are popped from the garbage collection deque responsive to the determination that the length of the garbage collection deque is greater than zero. Garbage collection is performed on the popped tasks.

Abstract: Methods and systems for performing garbage collection include issuing a memory fence that indicates that a number of tasks in a garbage collection deque, belonging to a first garbage collection thread, has decreased by more than one. A length of the garbage collection deque, after the memory fence is issued, is determined to be greater than zero. Multiple tasks are popped from the garbage collection deque responsive to the determination that the length of the garbage collection deque is greater than zero. Garbage collection is performed on the popped tasks.

Abstract: A computer-implemented method for increasing record availability on a distributed database system implementing multiple partitioning strategies includes identifying first processing devices of a distributed database system for storing one or more first records in accordance with multiple partitioning strategies, determining that at least two of the first processing devices are identified for storing a given one of the one or more first records, and selecting one or more new processing devices of the distributed database system for storing the given first record to achieve sufficiently high availability of the given record within the distributed database system.

Abstract: Methods and systems for traffic jam management include generating a representation of a road network that comprises a road graph, with vertices of the road graph representing road segments and edges of the road graph representing pairs of adjacent road segments at each intersection. The road graph is partitioned into sub-graphs to balance a number of messages received from vehicles within each sub-graph and to minimize vehicle transitions between sub-graphs. It is determined that a traffic jam is present on one or more road segments. Navigational information is provided to one or more vehicles responsive to the traffic jam.

Abstract: A method is provided for consistent data processing by first and second distributed processing systems having different data partitioning and routing mechanisms such that the first system is without states and the second system is with states. The method includes dividing data in each system into a same number of partitions based on a same key and a same hash function. The method includes mapping partitions between the systems in a one-to-one mapping. The mapping step includes calculating a partition ID based on the hash function and a total number of partitions, and dynamically mapping a partition in the first system to a partition in the second system, responsive to the partition in the first system being unmapped to the partition in the second system.

Abstract: A computer-implemented method is provided for deleting a given object from among a plurality of objects in an object-oriented programming language computing system which uses a Reference Count (RC) of each of the plurality of objects to check a liveness of the plurality of objects. The method includes decrementing, in a Reference Counts (RCs) decrement operation, RCs of objects referenced from the given object using one or more non-atomic operations in a transaction that utilizes a hardware transactional memory mechanism to accelerate the reference counts decrement operation.