Fujitsu Corporation

Sap Ag

Bo Hu

Nuno Carvalho

Victor De La Torre

Takahide Matsutsuka

Boris Villazón-Terrazas

Aisha Naseer Butt

Roger Menday

Jesus Garcia Salinas

Loredana Laera

Ying Du

Vivian Lee

Aisha Naseer

A computer apparatus to assist diagnosis of a patient including: a memory storing instructions for execution and an output for results of a processor that provides a patient builder and a vertex filter. Where the builder inputs patient data including historical clinical; and open data, and to create a patient clinical object, PCO, graph; and a full patient graph PCOs for each patient. The filter includes: a context builder to build a domain based on a specification and open data; a context-based vertex filter ranking vertices in the full patient graph based on domain affiliation, retaining any vertices with high domain affiliation; and computing a similarity between the patient PCO and other PCOs in the full patient graph using the retained vertices; and a patient ranker ranks the PCOs according to t similarity where the output lists patients similar to the patient to suggest patient diagnoses.

Method and apparatus of context-based patient similarity

A processor is to monitor social media for links between a drug and an adverse drug reaction (ADR), and to extract a relation between the drug and the ADR using named entity recognition to provide a weighted social media relation between the drug and the ADR. The weighted social media relation is based on a confidence of a link between the drug and the ADR. A domain knowledge of ontologies of drug names and/or ADRs is used to refine the weighted social media relation and to quantify the weighted social media relation by using drugs and ADR links extracted from research publications and/or from clinical trial reports, to provide a research weight for the weighted social media relation; and/or by using a search engine to search the Internet for the drug and the ADR, where a number of hits quantifies an internet weight for the weighted social media relation.

System and method to produce and validate weighted relations between drug and adverse drug reactions

A computer-implemented method of executing a query in a network of data centres, the method comprising a preparation stage and an execution stage; wherein the preparation stage includes: each data centre providing information relating to data centre parameters and/or proximity, allowing arrangement of the data centres in a dynamic hierarchical cluster topology of a parent data centre and child data centres, each child data centre having its own local data sequence which is to be processed by individual analysis tasks of the query, the child data centres together forming a cluster of similar and/or proximate data centres, the cluster having a single parent data centre; and the execution stage includes: the parent data centre sending the tasks to the child data centres and the child data centres sending to the parent data centre a sequence of outcomes derived from the local data sequence and the tasks; wherein both a child data centre and its parent data centre cache executed tasks executed by the child and the sequence of outcomes of the tasks executed by the child data centre.

Computer-implemented method of executing a query in a network of data centres

A system to align codes between two coding standards, including: an expert mapping module, a syntactical mapping module, and a case-based mapping module; a module adjustment unit or system; and an alignment unit or system; where the expert mapping module collects established mappings between pairs of codes of the two coding standards from the internet and/or from machine-readable publications; the syntactical mapping module accesses the two coding standards including descriptions for each code, and to find the similarity of pairs of codes of the two coding standards using the descriptions to provide syntactical mappings; the case-based mapping module accesses existing cases that are annotated with both coding standards and to find case-based mappings between pairs of codes of the two coding standards; the module adjustment unit aggregates the mappings from the modules; and the alignment unit accepts input of codes from one of the coding standards and to use the aggregated mappings from the module adjustment unit to extract one or more suitable mappings from each input code to a code of the other coding standard.

Method and system to align two coding standards

Embodiments include a method, apparatus, program, and system for distributing data items among a plurality of data storage units, the data items being an aggregation of data from a plurality of data sources. The method comprises generating a semantic description of each of the plurality of data sources; calculating, for each pair of data sources from among the plurality of data sources, a degree of similarity between the semantic descriptions of the pair of data sources; and allocating data items to data storage units in dependence upon the calculated degree of similarity between the data source of a data item being allocated and the or each data source of data items already allocated to the data storage units.

System, apparatus, program and method for data aggregation

A database controller for a database of data items distributed across a plurality of storage units. The database controller configured to store an ordered list comprising, for each of the data items individually, the identifying information of the storage unit upon which the data item is stored. The database controller configured to maintain a frequency record, recording the values of prefix portions of the data items and the number of data items having each prefix portion. Wherein, the ordered list and the frequency record are ordered by applying the same ordering metric to the prefix portions. The database controller being configured to receive a range query specifying a search prefix portion, to use the frequency record to calculate where to find in the ordered list the identifying information of storage units storing the data items having the search prefix, and using that identifying information to retrieve query results.

Database controller, method, and program for handling range queries

A computer-implemented method includes a principal process including performing a computational procedure in which the or each vertex preceding a particular vertex receives a notification that a computational procedure has been completed for the preceding vertex; and calculates new path lengths for the particular vertex by adding the length value attributed to the edge from the preceding vertex to the particular vertex to each of the recorded k shortest path lengths from the first vertex to the preceding vertex. A record of the k shortest path lengths calculated for the particular vertex is maintained. After the new path lengths have been calculated for the or each of the preceding vertices, a notification that the computational procedure has been completed for the particular vertex is issued. The computational procedure is performed with the source vertex as the first vertex and each vertex on a path from the source vertex to the destination vertex as the particular vertex.

Computer-implemented K-shortest path finding method

A querying method for a database of graph data encoded as triples being stored on storage servers. The method including dividing a query into a plurality of result criteria triple patterns which query results match, each triple pattern element being either: a single value triple pattern element; or a variable value triple pattern element specifying an ID of a variable. The method includes forming one or more sub-queries each having triple patterns having the same single value triple pattern element or specifying the same ID of a variable as a variable value triple pattern element, issuing each formed sub-query to each of the servers, and receiving triples satisfying a sub-query as results from the servers and using the sub-query results in as a response to the query.

Graph database query handling method and apparatus

A method, program, and data storage system for performing reconciliation of resources represented in a graph of data as nodes, comprising selecting an initial subset of the nodes of the graph for which reconciliation processing with a particular node is to be carried out, performing reconciliation processing between the particular node and each of the initial subset of nodes, and delaying reconciliation processing between the particular node and a further subset of the nodes of the graph for which reconciliation with the particular node is to be carried out.

Method, controller, program and data storage system for performing reconciliation processing

Embodiments of the present invention relate to systems and methods for task-based tagging and resource classification, which allow tags or metadata to emerge from execution of work-related tasks and activities. In certain embodiments, tags can be automatically extracted from activities performed, for example utilizing a textual description of tasks carried out by an employee. Accumulated tags can then be utilized to describe enterprise resources. Automatic tagging or metadata annotation can be integrated with everyday work utilizing one or more techniques. Candidate tags can be extracted from a task written description utilizing an algorithm that analyzes keywords. Candidate tags can be refined, for example by clustering utilizing a K-means approach. Candidate tags can be ranked based on an overall frequency adjusted against time, with the importance of a tag declining with time.

Task-based tagging and classification of enterprise resources

Implementations of the present disclosure include receiving a task including structured data and unstructured data, processing the task to generate a current task object, the current task object comprising a plurality of task attributes, retrieving a previous task object, for each task attribute of the plurality of task attributes, calculating a task attribute similarity value based on a corresponding task attribute of the previous task object, determining whether a rule is applicable to a task similarity calculation, weighting each of the plurality of task attribute similarity values using a plurality of weight values, wherein a first weight value applied to a first task similarity value is different than a second weight value applied to a second task similarity calculation when determining that the rule is applicable to the task similarity calculation, calculating a task similarity value, and providing the task similarity value to be displayed on a display.

Growing community of inventors

Winchester, United Kingdom

Bo Hu