International Business Machines Corporation

Harold Jeffrey Ship

Peter Bak

Avi Yaeli

Gilad Mordechai Saadoun

Craig A Statchuk

Odellia Boni

Evgeny Shindin

Mattias Marder

Jonathan Bnayahu

Matthias Kormaksson

Sivan Harary

Eliezer Segev Wasserkrug

Eli Packer

Yuval Nardi

Roy Abitbol

Aspects of the present invention disclose a method for managing the control policies associated with processing of a set of resources by a distribution system. The method includes one or more computer processors determining information associated with a configuration of a distribution system. The method further includes determining information related to a set of resource to process utilizing the distribution system. The method further includes determining respective values for a plurality of parameters related to processing the set of resources utilizing the distribution system. The method further includes selecting an initial set of control policies; The method further includes updating the initial set of control policies. The method further includes instructing the distribution system to process the set of resources utilizing the updated set of control policies.

Managing control policies of a distribution system

An example system includes a processor to receive parameters of a fluid network control system. The processor can formulate an optimal control problem as proportions of server effort. The processor can also solve the optimal control problem using a robust counterpart of a separated continuous linear programming (SCLP). The processor can further adjust a parameter of the fluid network control system based on the optimal solution.

Adjustable control of fluid processing networks based on proportions of server effort

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

Visualizations of a serial process are provided. A process model of a serial process is constructed using an underlying statististical model. The process model represents each instance of the serial process as a series of interconnected nodes, wherein (i) the serial process includes a plurality of events; (ii) each node is associated with an event and a time at which the associated event occurred in an instance of the serial process; and (iii) connectors link nodes together to form the series of interconnected nodes, the connectors representing stages of serial process. The stages are scored and categorized into various categories based, at least in part, on the process model. One or more of the categories is associated with outlier stages. A visualization of the process model is presented such that the visualization associates the stages of the instances of serial process with respective categories.

Visualization of serial processes

A method and system for generating a map using a computer is based on data and weighted factors to minimize corresponding projection distortions. The method and system includes determining visualization goals from analyzing a set of datasets for a map using the computer. A set of visualization characteristics are calculated for each dataset based on the visualization goals using the computer. The visualization characteristics are analyzed to weight factors for each of the datasets. Each of the weighted factors is adjusted based on the relevance of each of the datasets for visualization of the map. An aggregate vector of weighted factors is calculated based on all of the datasets, and the map for visualization is generated based on the aggregate vector of weighted factors.

Method to optimize the visualization of a map's projection based on data and tasks

A computerized clustering method. The method comprises receiving a spatial point dataset comprising a plurality of spatial points in a space, heuristically calculating, using a processor, a plurality of &#x3b1;-shape based segmentations such that each of the plurality of &#x3b1;-shape based segmentations defines a plurality of polygonal areas that cluster the plurality of spatial points in a plurality of clusters which collectively bounds the plurality of spatial points, presenting to an operator in each sequential iteration of a plurality of sequential iterations another of the plurality of &#x3b1;-shape based segmentations, and selecting by the operator one or more of the plurality of &#x3b1;-shape based segmentations.

Visual analytics for spatial clustering

Methods, system and computer program products for spatiotemporal encounters detection of a plurality of moving objects are disclosed. The method includes receiving a dataset of a plurality of objects moving in a domain, structuring the dataset in a data structure to detect a plurality of spatiotemporal encounters among the plurality of objects, outputting a list of the detected spatiotemporal encounters. The plurality of spatiotemporal encounters may be detected in a single sweep over the received dataset.

Growing community of inventors

Mitzpe Netofa, Israel

Harold Jeffrey Ship