International Business Machines Corporation

Dany Moshkovich

Jonathan Bnayahu

Maayan Goldstein

Michael Katz

Itzhack Goldberg

Erik Rueger

Neil Sondhi

Thorsten Muehge

Segev Eliezer Wasserkrug

Michael Masin

Yahalomit Simionovici

Vladimir Lipets

Artem Barger

Shmuel Ur

Samuel Kallner

Alexander Kofman

Mordechai Nisenson

Yoav Rubin

Moti Nisenson

Shmuel Or

Amir Rubinstein

Tomer Bentov

Balunaini Prasad

Ravi Ray

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

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

A method comprising obtaining a scheduling problem comprising: a set of agents and a set of tasks to be performed by the set of agents, wherein solving the scheduling problem using an automated solver is not feasible using available predetermined resources. The method comprises automatically generating a plurality of alternative scheduling problems, wherein a solution to each such alternative scheduling problem defines a solution to the scheduling problem and determining a solution to the scheduling problem by applying the automated solver to solve, while using the available predetermined resources, an alternative problem of the plurality of alternative scheduling problems to determine a solution to the alternative problem and by mapping the solution to the alternative problem to the scheduling problem, whereby determining the solution.

Automatic solution to a scheduling problem

For efficient data storage utilization and recycling, gradually degrading data according to data classes and using degrading data policies, predefined degrading rules, and data access patterns for conserving storage space prior. Each data class is associated with one of a plurality of degrading data policies, and each data policy includes a plurality of degrading rules to be applied to a corresponding data class of a corresponding data policy, the degrading rules defining data classes to be degraded based on data access patterns per data class to automatically degrade the data items according to each of the plurality of data classes until a predefined expiration date. Essential data is defined by a user such that the essential data is not subject to the data degradation so as to preserve at least a portion of files, documents, and videos comprising the essential data.

Efficient data storage utilization and recycling by gradual data degradation

A computerized method for converting a graphical representation of an activity flow to a structural text-based representation according to a plurality of human readability considerations, said computerized method comprising: converting a graphical representation of an activity flow to a structural text-based representation having a plurality of text elements which are related to one another in a hierarchical manner; identifying a subset of said plurality of text elements having an equal number of hierarchical degrees of separation from a root of said plurality of text elements; acquiring a plurality of human readability rules; ordering said subset of plurality of text elements by applying said plurality of human readability rules to said subset of plurality of text elements.

Readable structural text-based representation of activity flows

A computer program product comprising a non-transitory computer readable storage medium retaining program instructions configured to cause a processor to perform actions, which program instructions implement: a framework for creating a model of an NP-hard problem, the model comprising at least one entity selected from the group comprising: an objective, a variable, an equation and a constraint, wherein the framework provides methods for automatically transforming the model, comprising: one or more methods for manipulating or changing a status of the entity of the model, the methods comprising a method for imposing or ignoring the constraint; and one or more methods related to operations to be applied to the entity of the model.

Reusable modeling for solving problems

For efficient data storage utilization and recycling, gradually degrading data according to data classes and using degrading data policies, predefined degrading rules, and data access patterns for conserving storage space prior.

A computerized method, system and computer product for untangling cyclic dependencies between components in software architecture is disclosed. The method includes receiving a software architecture that includes a set of components wherein the components include further elements. The method includes finding one or more cyclic dependencies between the set of components and creating a set of rearranged untangled components. The method includes outputting the rearranged components.

Automatic untangling cyclic dependencies in software systems

A method that includes: running a set of functional tests over a computer code; determining, for each code element of the computer code, which functional test covered it, to yield a tests-elements coverage map; associating portions of the computer code with corresponding design portions or requirements derived from a design document or a requirements document respectively, associated with the computer code, to yield a design/requirements-code tracing map; deriving, from the tests-code coverage map and the design/requirements-code tracing map, a design/requirements-tests coverage map, exhibiting coverage of the computer code by the functional tests, in terms of the design or the requirements, wherein at least one of the running, the determining, the associating, and the deriving is executed by at least one processor.

Determining functional design/requirements coverage of a computer code

A method that may include: building a dependencies graph representing dependencies between code elements of a computer code; associating portions of the computer code with corresponding design specifications or requirements derived from a design specifications document or a requirements document respectively which is associated with the computer code, to yield a design specifications or requirements-code tracing map; and analyzing the design specifications or requirements-code tracing map based on the dependencies graph to yield an ordered list of design specifications or requirements respectively, wherein the order is selected such that functional tests written for the computer code and addressing design specifications or requirements of a higher order, will yield a higher level of functional test coverage of the computer code in terms of design specifications or requirements.

Enhancing functional tests coverage using traceability and static analysis

A computer-implemented technique for analysis of software, is carried out using a semantic intensity calculation module, a coupling calculation module, and a software decomposition module. Software elements are identified in a computer program code, and respective roles of the software elements established. With the semantic intensity calculation module respective semantic intensity metrics are calculated for the software elements according to the roles thereof. With the coupling calculation module semantic intensity metrics are calculated to determine coupling factors between different software elements. With the software decomposition module the software elements are organized into distinct software components according to the coupling factors therebetween. Then, an optimized computer program code is generated from the software components.

Growing community of inventors

Yokneam Ilit, Israel

Dany Moshkovich