A method is provided of communication between a user and a database of Patents and also of the display and the interactive exploration of data on information of interest relating to Patents/Patent applications. The method comprises: the generation, by means of an access interface, of a request allowing the database to be interrogated based on at least one selection criterion entered into the access interface; the interrogation of the database by means of the request and the loading of bibliographical data for the Patents/Patent applications found, the downloaded bibliographical data comprising data on the technological category; the processing of the bibliographical data, the processing comprising an analysis of co-occurrences comprising the determination of a number of co-occurrences of data on the technological category for all of the Patents/Patent applications found; the displaying, in interactive graphical and/or textual form, of a result and/or of an interpretation of the analysis of co-occurrences.

A system monitors an individual for conditions indicating a possibility of occurrence of irregular heart events. A database includes a plurality of combinations of at least a first signature and a second signature. A first portion of the plurality of combinations is associated with a normal heartbeat and a second portion of the plurality of combinations is associated with an irregular heart event. A wearable heart monitor that is worn on a body of the patient includes a heart sensor for generating a heart signal responsive to monitoring a beating of a heart of the individual. The monitor further includes a processor for receiving the heart signal from the heart sensor. The processor is configured to analyze the heart signal using a plurality of different processes. Each of the plurality of different processes generates at least one of the first signature and the second signature. The plurality of different processes provide a unique combination including at least the first signature and the second signature for the generated heart signal. The processor compares the unique combination with the plurality of combinations in the database, locates a combination of the plurality of combinations that substantially matches the unique combination and generates a first indication if the unique combination substantially matches one of the first portion of the plurality of combinations and a second indication if the unique combination substantially matches one of the second portion of the plurality of combinations.

The present disclosure relates to a method for scheduling a computation graph on heterogeneous computing resources. The method comprises generating an augmented computation graph that includes a first set of replica nodes corresponding to a first node in the computation graph and a second set of replica nodes corresponding to a second node in the computation graph, wherein the replica nodes of the first set are connected by edges to the replica nodes of the second set according to dependency between the first node and the second node in the computation graph, adapting the augmented computation graph to include performance values for the edges, the replica nodes of the first set, and the replica nodes of the second set, and determining a path across the adapted computation graph via one replica node of the first set and one replica node of the second set based on the performance values.

Crux detection in search definition sets is provided herein. Crux detection can include generating a hierarchical representation of a search definition set. The hierarchical representation can be reduced by removing search definitions unrelated to a target search definition. The search definitions in the reduced hierarchical representation can be focused by removing inapplicable elements or operations in the search definitions. Focusing the search definitions in the reduced hierarchical representation can include removing context-irrelevant elements and/or removing search-definition-irrelevant elements. The focused reduced hierarchical representation can be analyzed to identify implementation cruxes in the search definitions. Cruxes can include performance-impacting elements of the search definitions. The cruxes can be tagged and provided for redevelopment or analysis.

A method may include receiving a first definition of an object type from a first software component and a second definition of the object type from a second software component. The object type may be labeled by an ID. The method may further include storing, in a dynamic graph, a node labeled by the ID, and storing, in a type definition repository external to the dynamic graph, the first definition of the object type and the second definition of the object type. The method may further include receiving, from the first software component, a modified first definition of the object type. The method may further include replacing, in the type definition repository and using the ID, the first definition of the object type with the modified first definition, and transmitting, to the second software component, a message indicating a need to lookup, by the ID, the modified first definition.

Disclosed herein are a method and apparatus for generating a residual image of multi-view video. The method includes generating a pruning mask of an additional view image by mapping a basic view image to the additional view image, among multi-view images, and detecting outliers in the pruning mask using color information of the basic view image and the additional view image.

Described are methods, systems and computer readable media for dynamic updating of query result displays.

A computing system for generating a dynamic path for a fellow, includes a processor and a memory storing instructions that when executed by the processor cause the computing system to receive the fellow's skill graph, receive a target skill, receive a calendar object and generate the dynamic path including a task and/or a session. A non-transitory computer readable medium includes program instructions that when executed, cause a computer to receive the fellow's skill graph, receive a target skill, receive a calendar object and generate the dynamic path including a task and/or a session. A method for generating a dynamic path for a fellow includes receiving the fellow's skill graph, receiving a target skill, receiving a calendar object and generating the dynamic path including a task and/or a session.

Graph computing over micro and macro views includes expanding, with a processor at run-time, a set of nodes to include a node generated in response to received data corresponding to an event query. A first inference of an inference ensemble is determined by traversing a base graph whose nodes are associated with a discriminant power that exceeds a predetermined entity threshold. A second inference of the inference ensemble is determined by traversing a micro-view graph whose nodes are selected based on a number of references that exceeds a predetermined reference threshold. A third inference of the inference ensemble is determined by traversing a macro-view graph having one or more committee nodes and computing for each committee node a macro-node vote and generating a response to the event query based on the inference ensemble.

A computer implemented method of identifying anomalous behavior of a computer system in a set of intercommunicating computer systems, each computer system in the set being uniquely identifiable, the method including monitoring communication between computer systems in the set for a predetermined baseline time period to generate a baseline vector representation of each of the systems; monitoring communication between computer systems in the set for a subsequent predetermined time period to generate a subsequent vector representation of each of the systems; comparing baseline and subsequent vector representations corresponding to a target computer system using a vector similarity function to identify anomalous behavior of the target system in the subsequent time period compared to the baseline time period, wherein a vector representation of the target system for a time period is generated based on a deterministic walk of a graph representation of communications between the computer systems in which nodes of the graph correspond to computer systems in the set and weighted directed edges between nodes of the graph correspond to a characteristic of communication between pairs of computer systems in the set.