International Business Machines Corporation

Ilog Sa

Thomas Baudel

Frank Van Ham

Albertus H J Broeksema

Nicolas Changhai Ke

Jean-Yves B Rigolet

Pierre-Andre Paumelle

Nicolas Carre

Frederic Delhoume

Nicolas Sauterey

Georges-Henri Moll

Sebastien Blandin

Hugues Citeau

Olivier Artigue

Guilhem J Molines

Wiel A Bruls

Pierre D Feillet

Hervé Le Bars

Jerome Jochem

Marcos Didonet Del Fabro

Peter Leijten

Robin Schilham

Jean S Ashton

Techniques for duplicate code section detection for source code are described herein. An aspect includes receiving a plurality of input files corresponding to a software project comprising source code written in a computer programming language. Another aspect includes segmenting each of the plurality of input files into a plurality of statements based on instruction boundaries corresponding to the computer programming language, wherein a respective statement start index is determined for each of the plurality of statements. Another aspect includes populating an enhanced generalized suffix array (eGSA) based on the determined statement start indices, wherein each statement start index corresponds to a respective suffix in a row in the eGSA, and wherein each row comprises a longest common prefix (LCP) field and a preceding statement value corresponding to the row's respective suffix. Another aspect includes identifying duplicate code sections in the plurality of input files based on the eGSA.

Duplicate code section detection for source code

Methods and systems are provided for sequencing of input prompts for data structure completion. The method includes: providing a data structure including object classes with typed attributes and rules defining constraints to be met by a data instance of a data structure to meet a regulation body and building a data instance of the data structure by prompting user input via a user interface. The method includes: selecting a working object instance from the top of a stack of object instances; gathering applicable rules for the working object instance with missing required facts in the form of object attributes, including any related rules where a new object class is required; and sequencing input prompts in a user interface of a complex form to obtain the required facts in the form of missing object attributes.

Sequencing of input prompts for data structure completion

A method, system, and/or computer program product processes a data plot comprising a plurality of data points for inclusion of additional information content. A space of the data plot is divided into subspaces, where each subspace contains at least one data point of the data plot. A compressed information representation for each subspace is computed based on information about said at least one data point contained in said each subspace. The data plot is displayed with the compressed information representation for said each subspace, where each unit of compressed information is displayed, on a display, adjacent to a corresponding group of data points from the data plot.

Data plot processing

Embodiments of the present invention provide a method, system and computer program product for assertion management in a dynamically assembled programmatic environment. In an embodiment of the invention, a method for assertion management in a dynamically assembled programmatic environment can include dynamically assembling different execution units into a dynamically assembled computer program, applying an assertion to at least one of the different execution units through an introspection of the one of the different execution units, and generating an assertion result reporting a failure of the assertion responsive to the failure of the assertion.

Assertions in a business rule management system

A method, system, and/or computer program product processes a data plot comprising a plurality of data points for inclusion of additional information content. A space of the data plot is divided into subspaces, where each subspace contains at least one data point of the data plot. An available area on a display for each subspace is computed, and then a compressed information representation for each subspace is computed based on information about at least one data point contained in each subspace and a computed available area for each subspace. An available area of each subspace is computed based on a maximum size of a shape that can fit within each subspace. The data plot is displayed, where each unit of compressed information is displayed adjacent to a corresponding group of data points from the data plot.

A method, system, and/or computer program product processes a data plot comprising a plurality of data points for inclusion of additional information content. A space of the data plot is divided into subspaces, where each subspace contains at least one data point of the data plot. An available area on a display for each subspace is computed, and then a compressed information representation for each subspace is computed based on information about at least one data point contained in each subspace and a computed available area for each subspace. An available area of each subspace is computed based on a maximum size of a shape that can fit within each subspace, where the shape is centered on a barycenter of each subspace. The data plot is displayed, where each unit of compressed information is displayed adjacent to a corresponding group of data points from the data plot.

A method, system, and/or computer program product processes a data plot comprising a plurality of data points for inclusion of additional information content. A space of the data plot is divided into subspaces, where each subspace contains at least one data point of the data plot. An available area for each subspace is computed, and then a compressed information representation for each subspace is computed based on information about said at least one data point contained in said each subspace and a computed available area for said each subspace.

Embodiments relate to calculating a journey time for a planned journey between a chosen origin and a chosen destination over a network of roads in a region. A first journey time for the journey is estimated using a route scheduling algorithm and a second journey time for the journey is estimated using selected historical journeys characterized by journey origins and destinations. The historical journeys are selected based on their vicinity to the planned journey. An error in the second journey time is calculated based on the standard deviation in the selected historical journeys. The second journey time is selected as the estimated journey time from the planned journey if this error is below a defined threshold, otherwise the first journey time is selected as the estimated journey time for the planned journey.

Journey time estimation

A method, system, and/or computer program product performs rule execution in decision services. One or more specialized rulesets classified by decision partitions are based on defined clustering predicates of decision service signatures for business rules. A decision request is received from a client, and one or more parameters of the decision request are input to a clustering predicate based on decision service signatures to produce a decision category. A specialized ruleset for the decision request is determined based on the decision category, and the decision request is forwarded for processing to the specialized ruleset. A decision input is then returned from the specialized ruleset.

Efficient rule execution in decision services

Removing high level logic structure from a source program. Two or more source program fields are characterized by their respective value characteristics. A first field is mapped, with respect to the source program, to a second field having similar value characteristics as the first field. A target program is then created by replacing, in the source program, the first field with the second field and replacing each first field value with a corresponding second field value thereby preserving the value characteristics of the source program.

Sharing and executing sensitive logic semantics

Obfuscating denotational logic in a source program. A non-rule-based object oriented source program is received. The source program is transformed into a rule-based source program that includes an object model and a ruleset. Attribute domains of the rule-based source program are characterized by a structure of their values in which the structure of the values is nominal, ordered, interval, or ratio. A minimum cardinality is calculated for each domain attribute. First domain attributes are randomly mapped to second domain attributes, each second domain attribute having the same value structure and a same or higher cardinality as the corresponding first domain attribute. For each randomly mapped pair a domain range of the first domain attribute is mapped to a domain range of the second domain attribute. In the rule-based source program first domain input fields and values are replaced with the respective second domain input fields and values.

A method, system and apparatus for visualization of versions of a BOM (business object model) is provided. In accordance with an embodiment of the invention, data from at least two different BOMs can be extracted to create a flat table, where the flat table includes all versions of each of the different BOMs. A hierarchy of nodes can then be generated from the flat table. Additionally, a root node and a hierarchy of descendants based upon the hierarchy of nodes using a tree map can be displayed in a graphical user interface of a computer.

Computer aided visualization of a business object model lifecycle

A display of a source data model on a user interface component being associated with a target data model is provided. The source data model and the target data model comprise a collection of data types (class/object), each including a set of name and type attributes. For each source data type of the source data model, a matching target data type is determined among said target data types in the target data model. Said source data type is linked to said matching target data type. A display of said source data model using said link between a source data type and a target data type.

Growing community of inventors

Paris, France

Thomas Baudel