International Business Machines Corporation

Kenneth James Barker

Samuel Steven Allison

Joseph Kinman Lee

Fabrice Jean Verplanken

Jean Louis Calvignac

Jennifer Chu-Carroll

Mihaela Ancuta Bornea

Sugato Bagchi

Murthy V Devarakonda

John Gary Waclawsky

James J Fan

John Martin Prager

Paul C Hershey

Rolf Clauberg

Andreas Guenther Herkersdorf

David J Webb

Ching-Huei Tsou

Sara Rosenthal

Michael A Barborak

Steven Howard Johnson

Adam R Faulkner

Charles S Lingafelt, Sr

Charles Steven Lingafelt

Gordon Taylor Davis

Michael Steven Siegel

Clark Debs Jeffries

Marco C Heddes

Edward Stanely Suffern

Brian Mitchell Bass

Wlodek Wlodzimierz Zadrozny

Aditya Anand Kalyanpur

Chad Balling McBride

Jean L Calvignac

Michael Raymond Trombley

Branimir Konstantinov Boguraev

Mark Anthony Rinaldi

Charles R Hoffman

Pei-Yun S Hsueh

Siddharth A Patwardhan

Christopher A Welty

John Kenneth Stacy

Apoorv Agarwal

Subhro Das

Paul Henry Nichols

Jean Claude Dispensa

Mark Crane Wartski

Michel L Costes

Kartik Sudeep

Ching-Hua Chen

Gerard Dalboussiere

Rene R Castel

Chandramouli Maduri

George M Calhoun

Yves J Huchet

Russell Evan Schroter

Ryan Lance Badger

Gema Almoguera

Yanpeng Li

Ruggero Ulivastro

A mechanism is provided in a data processing system to implement a personalized patient engagement engine. The personalized patient engagement engine develops a set of models for a plurality of behavioral phenotypes based on anonymized unstructured and structured patient-care management records for a plurality of patients over a period of time; matches a given patient to a behavioral phenotype; estimates a propensity of positive and/or negative behavioral responses of each of a plurality of targeted behaviors; dynamically updates personalized intervention effectiveness rankings in context for care manager and patient decision-making based on what has been shown to lead to positive responses for individuals with a similar behavioral profile; generates an intervention recommendation for the given patient based on the personalized intervention effectiveness rankings relative to the patient given an assigned goal and an individual intervention effect estimation; and provides the intervention recommendation to the care manager.

Personalized patient engagement in care management using explainable behavioral phenotypes

A mechanism is provided in a data processing system for exploring knowledge. The mechanism receives a set of known facts. The mechanism traverses paths in an ontology for a domain of knowledge from known facts in the set of known facts to one or more hypotheses. The ontology includes a plurality of entity types and a plurality of relationships between the entity types. The mechanism presents one or more hypotheses to a user.

Leveraging an external ontology for graph expansion in inference systems

The present invention embodiments are directed to methods, systems, and computer programs for identifying relations, within at least one taxonomy, between taxonomy categories and concepts extracted from electronic content. The relations represent semantic similarities for the concepts. The concepts are clustered based on the identified relations within the at least one taxonomy.

Clinically relevant medical concept clustering

Provided herein are techniques for processing a context-situated inquiry to provide results satisfying the inquiry. An inquiry and its supporting context are processed using natural language processing to determine an interpretation for the inquiry and context, and the interpretation is presented to receive corrective information for the interpretation. The corrective information is applied to the interpretation and content is retrieved based on the interpretation of inquiry and context to produce candidate results for the inquiry. Supplemental information is iteratively received to generate updated candidate results.

Processing context-based inquiries for knowledge retrieval

Predefined relation items on paths traversing predefined entities of a knowledge base are collected and feature sets are assembled from the collected relation items. A classifier is computed for the feature sets and a relation score of a query pair of the entities is computed using the classifier.

Discovery of implicit relational knowledge by mining relational paths in structured data

According to an aspect, a heterogeneous graph in a data store is accessed. The heterogeneous graph includes a plurality of nodes having a plurality of node types. The nodes are connected by edges having a plurality of relation types. One or more intermediary graphs are created based on the heterogeneous graph. The intermediary graphs include intermediary nodes that are the relation types of the edges of the heterogeneous graph and include intermediary links between the intermediary nodes based on shared instances of the nodes between relation types in the heterogeneous graph. The intermediary graphs are traversed to find sets of relations based on intermediary links according to a template. An inference rule is extracted from the heterogeneous graph based on finding sets of relations in the intermediary graphs. The inference rule defines an inferred relation type between at least two of the nodes of the heterogeneous graph.

Extraction of inference rules from heterogeneous graphs

The present invention relates to a device for combining at least two data signals having an input data rate into a single data stream having an output data rate being higher than the input data rate for transmission on a shared medium or vice versa, particularly, to a single SDH/SONET framer capable of handling a large range of SDH/SONET frames from STM-i to STM-j with an aggregated total capacity corresponding to an STM-j frame where i and j are integers in the range from 1 to 64 or higher according to the STM-N definition of the SDH/SONET standards. More over, the present invention can also be extended to work with STS-1 as lowest range. STS-1 exists in SONET only not SDH and corresponds to a data rate of 51.5 Mb/s a third of the 156 Mb/s of STM-1. The device according to the present invention comprises at least two ports for receiving and/or sending said at least two data signals, a port scanning unit for extracting data from the data signals received by said ports and/or synthesizing data to be transmitted via the ports, respectively, whereby said port scanning unit is configured to extract data from ports providing data streams having at least two different input data rates and/or to synthesize data to be transmitted via the ports taking data streams having at least two different data rates.

STM-1 to STM-64 SDH/SONET framer with data multiplexing from a series of configurable I/O ports

In a first aspect, a first method is provided for controlling the flow of data between a first and second clock domain. The first method includes the steps of (1) selecting one of a plurality of ports included in a physical layer interface in the second clock domain to which to send data; and (2) transmitting data from a transmit buffer in the first clock domain to the selected port in the physical layer interface in the second clock domain. Numerous other aspects are provided.

Shared transmit buffer for network processor and methods for using same

A system and method of reducing the input and output pins used to interface a fast serial port Ethernet processing system using multiplexing. Using the system of the present invention, four pins can allow a plurality of Ethernet communication paths to be connected to a single processor on a substrate. These four connections include a clocking input as well as a strobe signal which coordinates the multiplexing and identifies the time period for a predetermined source. The physical layer and the processor are each provided with a multiplexor which is controlled by the strobe to select the network to be coupled at any given time. The multiplexor includes a counter which is incremented by the clocking input and reset by the strobe signal.

Method and system for fast ethernet serial port multiplexing to reduce I/O pin count

Stations in a communications network are awakened by matching a pattern received from the communications network with patterns in the stations. When a match occurs, the stations are awakened. The patterns are arranged contiguously on word boundaries. A nibble (4 bits) in a mask word identifies the part of the pattern word to be used in the comparison.

Pattern matching in communications network where first memory stores set of patterns, and second memory stores mask data identifying patterns in the first memory

The decision to discard or forward a packet is made by a flow control mechanism, upstream from the forwarding engine in the node of a communication network. The forwarding engine includes a switch with mechanism to detect congestion in the switch and return a binary signal B indicating congestion or no congestion. The flow control mechanism uses B and other network related information to generate a probability transmission table against which received packets are tested to determine proactively whether a packet is to be discarded or forwarded.

Quality of service functions implemented in input interface circuit interface devices in computer network hardware

Growing community of inventors

Cary, NC, United States of America

Kenneth James Barker