International Business Machines Corporation

Jonathan Bnayahu

Aharon Abadi

Yishai Abraham Feldman

Mordechai Nisenson

Ran Ettinger

Yahalomit Simionovici

Artem Barger

Moria Abadi

Dany Moshkovich

Adi Sharabani

Peter Bak

Yinnon Avraham Haviv

Alexander Kofman

Eliezer Segev Wasserkrug

Moti Nisenson

Omer Tripp

Omri Weisman

Maayan Goldstein

Eli Packer

Ariel Landau

Yuval Nardi

Roy Abitbol

Edward F Nazarko

Corville O Allen

Pankaj Satyanarayan Dayama

Yacov Manevich

Shmuel Ur

Avi Yaeli

Idan Ben-Harrush

Inbal Ronen

Tal Drory

Ella Barkan

Gilad Mordechai Saadoun

Asaf Adi

Amnon Ribak

Harold Jeffrey Ship

Michael Katz

Julian I Kamil

Pratul Gupta

Ido Levy

Brian James Gamage

Shmuel Or

Yishai Fieldman

John Tarcson

Wael Shama

Amir Malki

Disclosed herein are methods and systems for executing verifiable computation modules to process private data at private data owner platform, comprising obtaining a computation module having a unique identifier recorded in a distributed ledger controlled by a plurality of computing nodes, generating a key pair comprising a signing key and a verification key derived from the signing key, recording, in the distributed ledger, an execution record associating an execution instance of the computation module with the verification key, initiating the execution instance of the computation module to process a private dataset incorporated with the signing key. outputting a computation outcome, computing an execution result signature for the execution instance based on the unique identifier and the private data and the signing key, and recording the execution result signature in the distributed ledger to enable verification of the execution instance.

Verifiable privacy preserving computation

Aspects of the present invention disclose a method for calculating a risk resulting from a network of networks that includes unknown relationships in a privacy preserving manner. The method includes one or more processors determining a set of conditions corresponding to a user of a network. The method further includes transmitting a compliance request corresponding to the set of conditions to one or more members of the network utilizing a privacy preserving algorithm. The method further includes determining a respective risk factor of one or more members of the network, wherein the respective risk factor corresponds to a response of each of the one or more members to the compliance request. The method further includes determining an overall risk of the network based at least in part on the risk factors of the one or more members.

Mitigating risk in business networks in a privacy preserving manner

In an approach for computing trade-offs between privacy and accuracy of data analysis on building a learning model, a processor receives a dataset for training a model. The dataset includes one or more pre-identified sensitive data fields. The processor determines a weight of each sensitive data field for the model. The processor evaluates resource cost of applying a privacy preservation technique to the one or more pre-identified sensitive data fields. The processor identifies correlation among the sensitive data fields. The processor presents a comparison of options for training the model, in terms of tradeoffs of accuracy for training the model and the resource cost of the privacy preservation technique.

Computing trade-offs between privacy and accuracy of data analysis

A processor may assign an indicator to each participant in a blockchain network. The indicator may respectively indicate a role of each participant. The processor may transform the indicator of each participant into respective scores. The respective scores may be directly associated with the role of each participant. The processor may aggregate the respective scores into an endorsement score. The processor may determine if the endorsement score exceeds an endorsement threshold.

Score based endorsement in a blockchain network

A system for executing a code for training an insurance response system, comprising at least one hardware processor adapted to: using a plurality of insurance attribute values, extracted from a received insurance claim to retrieve: at least one inquiry related to the insurance claim and at least one inquiry result, and historical insurance data related to the insurance claim; computing a similarity value indicative of a difference between the at least one inquiry result and a claim result; identifying in the historical insurance data a plurality of insurance conditions relevant to the claim result and the at least one inquiry result; identifying at least one insurance condition effecting the similarity value by analyzing data comprising the at least one inquiry and the plurality of insurance conditions; and training a protocol model of an insurance response system using the at least one insurance condition and the at least one inquiry.

Training a customer service system

In an example computer-implemented method, unstructured interactions between an unstructured conversation bot and a plurality of users are logged. A process flow model is generated based on the logged unstructured interactions. Instructions based on the process flow model are presented to a user in real time via the conversation bot.

Generating process flow models using unstructure conversation bots

An example system includes a processor to receive temperature data from a plurality of sensors disposed at locations more sensitive to temperature change in a plurality of server racks. The processor is to also generate a statistical model comprising a continuous spatial statistical distribution of temperature values based on the temperature data. The processor is to further generate a pseudo heat map based on the statistical model.

Generating pseudo heat maps

A computer-implemented method, computerized apparatus and computer program product for efficient solution of nearest object problems. A set of objects having non-point shapes representable by one or more geometric elements are obtained. For each object in the set the one or more geometric elements are sampled to obtain a set of points representing the set of objects. A Voronoi diagram is constructed for the set of points, whereby a subdivision of a space accommodating the set of objects into a plurality of cells, each cell containing a single point of the set of points and defining a region of closest neighbors of the point, is obtained. Cells containing points representing the same object are aggregated into a unified cell defining an estimated region of closest neighbors of the object.

Method, apparatus and product for efficient solution of nearest object problems

According to one embodiment, a method for solving a plurality of spatiotemporal planning problems. The method may include creating a domain model. The method may also include assigning a solution bound associated with the created domain model to infinity. The method may further include calculating a solution to the created domain model based on the assigned solution bound using at least one of a best-first search algorithm. The method may also include updating the assigned solution bound based on the calculated solution. The method may further include presenting the calculated solution to a user based on the updated solution bound not equaling infinity.

Optimizing spatiotemporal computational problems

According to an aspect of some embodiments of the present invention there is provided a computerized method of analyzing code of a software program for dominance relationships between a plurality of functions of the software program, the method comprising: receiving source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions; combining the plurality of intraprocedural dominator graphs to create an interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions; identifying a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions using the interprocedural dominance graph; and analyzing the software program according to the plurality of interprocedural dominance relations.

System and/or method for computing interprocedural dominators

A computerized method of identifying additional influential variables in multi-aspect adjudication frameworks comprising: acquiring an appraisal table having a set of variables affecting at least one adjudication aspect of a multi-aspect adjudication framework; identifying a set of additional variables affecting at least one adjudication aspect of a multi-aspect adjudication framework which fulfills an objective function, said objective function having a plurality of rules, said objective function assessing the compliance of at least one of said appraisal table and said set of additional variables with said plurality of rules; and outputting said set of additional variables.

Identifying additional variables for appraisal tables

A computer-implemented method, a computerized apparatus and a computer program product, the method comprising: receiving a program to be executed on a mobile device; building a data structure representing states within the program and transitions between the states; and based on the data structure, determining by a processor a location of at least one command related to using data retrieved from a server, such that at least one fetching command is to be provided for the data to be available when execution reaches the location.

Moving critical actions within a mobile application

A method for executing an event processing application in a multi-platform environment which includes a first computing platform and a second computing platform. The event processing application comprises a network of a plurality of processing rules, each of which, when executed by a computing platform, is configured to process incoming events and output outgoing events. The method comprises automatically identifying one or more processing rules comprised by the event processing application that are restricted to be executed in the first computing platform. The automatic identification comprises analyzing each rule in the plurality of processing rules to determine whether the rule is configured to perform a restricted activity. The method further comprises executing the plurality of processing rules in the multi-platform environment, some of which are executed in the first computing platform and some are executed in the second computing platform.

Multi platform based event processing

Growing community of inventors

Haifa, Israel

Jonathan Bnayahu