Abstract: A computer-implemented method, computer program product, and system for determination of critical parts and component correlations in a circuit using a correlation graph and centrality analysis including; receiving a circuit layout portion of a larger circuit layout, converting the circuit layout portion into a correlation graph representing components as nodes and connecting wires as edges, determining, using ground truth and Naïve Bayes to determine correlation weighting, scaling the correlation graph to represent the larger circuit, and presenting the larger correlation graph on a graphical user interface (GUI).

Abstract: A computer-implemented method for identifying pre-join operations, when accessing a database of relational tables, based on a usage history and/or a priority needs, comprises creating a graph of weighted edges and nodes, the nodes represent relational tables and edges represent join operations to be performed on the tables, partitioning the graph into a plurality of graph communities based on graph community densities, with a density indicating a number of edges touching a particular node, with the number of edges being greater than a predetermined edge number threshold, with each edge further including an edge weight indicative of a frequency of referencing within a predetermined recent duration of time and/or indicative of urgency of quick access to the corresponding join result within a predetermined recent duration of time, and generating pre-join results based on the partitioned graph communities and graph community densities.

Abstract: A graph data processing method and a distributed system is disclosed. The distributed system includes a master node and a plurality of worker nodes. The master node obtains master node graph data, divides the graph data to obtain P shards, where the P shards include a first shard and a second shard. The master node determines at least two edge sets from each shard, schedules at least two edge sets included in the first shard to at least two worker nodes for processing, and schedules an associate edge set included in the second shard to the at least two worker nodes for processing, where the associate edge set is an edge set that includes an outgoing edge of a target vertex corresponding to the first shard.

Abstract: A computer-executed method is disclosed for collective navigation of distributed virtual reality (VR) devices. The method obtains a source vertex and a destination vertex for a VR device. The source vertex and the destination vertex include vertices of a graph model of a navigable space having a plurality of vertices. The vertices represent a point within the navigable space and the plurality of edges represent a path segment between two corresponding vertices. A subset of possible vertices, selected from the plurality of vertices, is determined for a navigable path. A vertex traffic potential is determined for each vertex of the subset of possible vertices. The navigable path, including one or more consecutive path segments selected to minimize both segment path lengths and vertex traffic potentials, is determined from the source vertex to the destination vertex.

Abstract: A computer implemented method includes capturing, via a camera, one or more digital images of a face of a person representative of blood circulation of the person, collecting context information via one or more processors corresponding to the person contemporaneously with the capturing of the one or more digital images, labeling, via a trained individual health model executing on the one or more processors, the one or more digital images based on the blood circulation represented in the image and the collected context information via the trained individual health model that has been trained on prior such digital images and context information; and analyzing, via the one or more processors, the one or more labeled digital images to generate a health index of the person.

Abstract: Method and apparatus for monitoring eating behavior are disclosed. A wearable device including an imaging sensor, an electromyography (EMG) sensor, and a processing unit is configured to collect EMG data via the EMG sensor, transmit the EMG data to a computing device, receive a control signal to capture one or more images via the imaging sensor, capture, one or more images, and transmit the one or more images. A computing device is disclosed including a processor and a memory containing a machine learning model and computer program code that, when executed, performs an operation. The operation includes receiving EMG data, processing the EMG data as input to a trained machine learning model, transmitting the control signal to capture one or more images via the imaging sensor, receiving the one or more images, and determining nutritional content of the food or beverage using the one or more images.

Abstract: One or more biological signals are obtained. The one or more biological signals are converted to one or more graph structures. Correlation between two or more of the biological signals are determined using the one or more graph structures. One or more changes in the one or more graph structures within a time window are recorded. A signal graph model is generated based on the recorded changes.

Abstract: Identity recognition is achieved using user's living signatures, such as a heartbeat signal, from multiple devices. A user requests identity recognition for using a first registered device, such as a mobile device. The request is provided to a cloud. When the cloud confirms the mobile device is a registered device, the cloud directs the first registered device to upload the user living signature to the cloud. The cloud also sends a request to a user second registered device to upload the user living signature from the second registered device to the cloud. The user second registered device may be a headband monitor, watch, Google glasses, or the like capable of monitoring and uploading the user living signature to the cloud. The cloud compares both living signature signals from the first registered device and from the second registered device. If the signals are matched, the user identity is confirmed. If the signals are not matched, the user identity is not confirmed.

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: At each of a plurality of unmanned aerial vehicles operating in a three-dimensional space, current relative locations of other ones of the plurality of unmanned aerial vehicles which are visible to each of the plurality of unmanned aerial vehicles are determined based on two-dimensional camera images from on-board dual-lens cameras. The current relative locations are wirelessly transmitted to a controller. At the plurality of unmanned aerial vehicles, specification of a path to be followed by each of the plurality of unmanned aerial vehicles is wirelessly received from the controller. At each of the plurality of unmanned aerial vehicles, on-board collision avoidance is carried out based on the two-dimensional camera images from the on-board dual-lens cameras, while following the path specification.

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 system and method for painting a structure. The system comprises: a computer vision processing system configured to obtain images of a target structure and generate first instructions signals for real time communication to an unmanned aerial vehicle (UAV) having a paint fluid dispensing system provided thereon; a control device at the UAV responsive to received the first instruction signals for controlling real time navigating of the UAV to a location at the target structure; and the computer vision processing system configured to generate second instruction signals for real time communication to the UAV, wherein the control device at the UAV is configured to automatically actuate the paint fluid dispensing system to apply a paint fluid at the location on the target structure in response, the received second instruction signals configuring the UAV to render a desired visual image on the target structure.

Abstract: A computer-implemented method for identifying pre-join operations, when accessing a database of relational tables, based on a usage history and/or a priority needs, comprises creating a graph of weighted edges and nodes, the nodes represent relational tables and edges represent join operations to be performed on the tables, partitioning the graph into a plurality of graph communities based on graph community densities, with a density indicating a number of edges touching a particular node, with the number of edges being greater than a predetermined edge number threshold, with each edge further including an edge weight indicative of a frequency of referencing within a predetermined recent duration of time and/or indicative of urgency of quick access to the corresponding join result within a predetermined recent duration of time, and generating pre-join results based on the partitioned graph communities and graph community densities.

Abstract: Graph communities detection is used to separate out pre-load candidates that have a high probability of being needed or a high urgency for being quickly available from those with lesser probability and/or urgency. Pre-loads are performed for the candidate tables having the higher probability and/or higher urgency.

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: An apparatus and method are provided for scheduling graph computing on heterogeneous platforms based on energy efficiency. A scheduling engine receives an edge set that represents a portion of a graph comprising vertices with at least one edge connecting two or more of the vertices. The scheduling engine obtains an operating characteristic for each processing resource of a plurality of heterogeneous processing resources. The scheduling engine computes, based on the operating characteristics and an energy parameter, a set of processing speed values for the edge set, each speed value corresponding to a combination of the edge set and a different processing resource of the plurality of heterogeneous processing resources. The scheduling engine identifies an optimal processing speed value from the set of computed speed values for the edge set.

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 data storage and retrieval system for a computer memory includes a stream graph engine extracting graph data from streaming data, the graph data occupying a sliding window and comprising a plurality of slices representing a set of contiguous graphs, and where each slice of the plurality of slices corresponds to a given graph structure and its properties at a particular time, the stream graph engine causing the computer memory to store an on-disk portion of the graph data including a key table, a timestamp table and a plurality of property files, wherein the key table comprises a plurality of pointers to corresponding entries of the timestamp table, wherein each of the entries of the timestamp table comprise a corresponding timestamp and a pointer to the properties files, wherein the properties files comprise properties of a corresponding graph of the set of contiguous graphs, an in-memory portion of the graph data having a cache data structure storing a subset of the key table, and a versioning control modu