Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: Techniques facilitating generation of a fused kernel that can approximate a full kernel of a convolutional neural network are provided. In one example, a computer-implemented method comprises determining a first pattern of samples of a first sample matrix and a second pattern of samples of a second sample matrix. The first sample matrix can be representative of a sparse kernel, and the second sample matrix can be representative of a complementary kernel. The first pattern and second pattern can be complementary to one another. The computer-implemented method also comprises generating a fused kernel based on a combination of features of the sparse kernel and features of the complementary kernel that are combined according to a fusing approach and training the fused kernel.

Abstract: Embodiments include techniques for fine-grained scalable time-versioning support for large-scale property graph databases comprising 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. Techniques also include matching an entry 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. Techniques also include searching a second table having one or more 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: A Resilient Distributed Dataset (RDD) processing method, system, and computer program product include sending a different portion including a global identifier and different values of a message from a receiver to a sender and at a receiver side, an already-processed message is extracted from an RDD object repository corresponding to the global identifier of the different portion and the incoming differential portion is applied to the already-processed message

Abstract: A remote control system detects a directional signal at an alerting sensor package; activates an appliance to accept a control signal in response to the directional signal; accepts the control signal at the appliance from a muscle sensor package; and adjusts operation of the appliance in response to the control signal

Abstract: At a mobile electronic device, first sensor data is obtained from at least one wearable muscle sensor, suggesting that location tracking will imminently be desirable. A first indication that an external locator signal is not usable is also obtained. Responsive to the first sensor data and the indication, second sensor data, from at least one wearable muscle sensor, indicative of motion of a subject wearing the at least one muscle sensor, is recorded. A second indication that the external locator signal is now usable is obtained. Responsive to the second indication, the external locator signal is used to determine a current location of the mobile electronic device; and the second sensor data is sued to backtrack from the current location of the mobile electronic device to indicate a location of the mobile electronic device at a time when the recording of the second sensor data was initiated.

Abstract: A remote control system detects a directional signal at an alerting sensor package; activates an appliance to accept a control signal in response to the directional signal; accepts the control signal at the appliance from a muscle sensor package; and adjusts operation of the appliance in response to the control signal.

Abstract: A remote control system detects a directional signal at an alerting sensor package; activates an appliance to accept a control signal in response to the directional signal; accepts the control signal at the appliance from a muscle sensor package; and adjusts operation of the appliance in response to the control signal

Abstract: At a mobile electronic device, first sensor data is obtained from at least one wearable muscle sensor, suggesting that location tracking will imminently be desirable. A first indication that an external locator signal is not usable is also obtained. Responsive to the first sensor data and the indication, second sensor data, from at least one wearable muscle sensor, indicative of motion of a subject wearing the at least one muscle sensor, is recorded. A second indication that the external locator signal is now usable is obtained. Responsive to the second indication, the external locator signal is used to determine a current location of the mobile electronic device; and the second sensor data is sued to backtrack from the current location of the mobile electronic device to indicate a location of the mobile electronic device at a time when the recording of the second sensor data was initiated.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A generation apparatus that generates a mapping between individual properties included in an object in a program and individual elements of a structured document. The generation apparatus includes: an object tree generation unit that generates a tree structure representing hierarchical structure of the object by assigning the individual properties included in the object to nodes of the tree structure; and a selection unit that selects a mapping minimizing conversion cost of converting the tree structure of the object to a tree structure that includes the individual elements of the structured document as its nodes. The selection is from mappings that associate the individual properties included in the object with the individual elements of the structured document.

Abstract: Traffic simulation method, program, and system for automatically determining the value of an appropriate time step of a simulation in a traffic simulation technique. In order to calculate the filling rates of roads, top K intersections are selected from among intersections in a region that is an object of the simulation, for each synchronization timing in terms of the filling rate. For instance, the filling rate is calculated as a filing rate of vehicles on roads directly connected to the intersection. More specifically, the filling rate is calculated by dividing the number of vehicles traveling on each road directly connected to the intersection by the length of the road, and totalizing each quotient. The time step of the simulation is determined as a monotonically decreasing function with respect to the filling rate, preferably, as a value in inverse proportion to the square of the filing rate.

Abstract: Methods and systems for estimating a probability of re-sharing information include extracting keywords from a set of documents addressed to a user; weighting the keywords from the set of documents according a metric for the user's interest in the keywords' respective source documents to create an interest model; receiving a new document having one or more keywords; and determining a likelihood that the user will re-share the new document, where the likelihood is based on the interest model and the one or more keywords present in the new document.

Abstract: A generation apparatus that generates a mapping between individual properties included in an object in a program and individual elements of a structured document. The generation apparatus includes: an object tree generation unit that generates a tree structure representing hierarchical structure of the object by assigning the individual properties included in the object to nodes of the tree structure; and a selection unit that selects a mapping minimizing conversion cost of converting the tree structure of the object to a tree structure that includes the individual elements of the structured document as its nodes. The selection is from mappings that associate the individual properties included in the object with the individual elements of the structured document.

Abstract: Methods and systems for estimating a probability of re-sharing information include extracting keywords from a set of documents addressed to a user. The keywords from the set of documents are weighted according a metric for the user's interest in the keywords' respective source documents to create an interest model. A new document having one or more keywords is received. A likelihood that the user will re-share the new document is determined. The likelihood is based on the interest model and the one or more keywords present in the new document. The new document is automatically responded to based on the determined likelihood.