2018
SEQUENCING OF INPUT PROMPTS FOR DATA STRUCTURE COMPLETION
Thomas Baudel, Wiel A. Bruls, Peter Leijten, Guilhem Molines, Robin Schilham
user interface, object class, information retrieval, data structure, computer science
Abstract
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.
2016
SHARING AND EXECUTING SENSITIVE LOGIC SEMANTICS
Thomas Baudel, Nicolas Changhai Ke, Pierre-Andre Paumelle, Jean-Yves Rigolet
theoretical computer science, semantics, logic structure, computer science
Abstract
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.
2015
Handling Process Instance Migration In Business Process Management
Thomas Baudel, Nicolas Sauterey, Claudia Zentner
software engineering, object model, data modeling, data mining, computer science, business process management, business process discovery
Abstract
Process instance migration from a former process model to a new process model. A former process model and a new process model and their data models are analyzed to extract a process delta object model relating to changes in the new process model on which to define migration rules. One or more existing process instances are analyzed, and process instances whose current state has passed the changes in the new process model are retained. Candidate activities of the retained process instances, a set of conditions for the candidate activities, and a set of actions to be taken if a condition is met are generated. The generated set of conditions and set of actions may be presented to a user enabling the user to combine conditions and actions to produce a process instance migration program in the form of a set of rules.
Journey time estimation
Jean S. Ashton, Thomas Baudel, Sebastien Blandin
operations research, geography, destinations
Abstract
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.
2013
Data plot processing
Thomas Baudel, Albertus Hendrik Johan Broeksema
subspace topology, plot, mathematics, linear subspace, information representation, data point, data mining, computer program, algorithm
Abstract
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.
Efficient rule execution in decision services
Thomas Baudel, Pierre D. Feillet
predicate, decision tree, database, computer science, computer program, cluster analysis, business rule
Abstract
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.
2012
TRANSFORMATION OF A SOURCE MODEL TO A TARGET MODEL
Thomas Baudel, Hugues Citeau, Marcos Didonet Del Fabro
source model, data mining, computer science
Abstract
An aspect of the invention includes transforming a source model to a target model. A source model is received and a transformation specification that includes a set of rules is accessed. Each rule includes a pattern description and a production component. The pattern description includes a pattern in the source model and the production component includes an algorithm for generating an output in the target model from the pattern. For each expression in the source model, the expression is decomposed into sub-expressions, matching rules in the transformation specification for the expression and the sub-expressions are detected, one of the matching rules having the most specific pattern description is selected, and the production component of the selected rule is executed to generate the output in the target model. The target model is created from the generated output.
User interface (UI) color scheme generation and management according to visual consistency of visual attributes in the color scheme
Olivier Artigue, Thomas Baudel
visual presentation, user interface, information retrieval, hierarchy, graphical user interface elements, directed acyclic graph, computer vision, computer science, color scheme, artificial intelligence
Abstract
Embodiments of the invention provide a method of generating a UI visual presentation attribute scheme while preserving visual consistency of selected visual presentation attributes in the color scheme is provided. The method includes establishing a hierarchy of UI elements in a directed acyclic graph of nodes. The method yet further includes computing a visual presentation attribute for each child node of the hierarchy descending from a selected parent node according to an established transformation rule. Finally, the method includes exporting the hierarchy into a visual presentation attribute scheme. To the extent the visual presentation attribute is a color, the visual presentation attribute scheme can be a color scheme applicable to an application to define the color scheme of the application.
Focus-change invariance in a graphical display
Thomas Baudel, Bertjan Broeksema
mathematics, invariant, graphical display, geometric shape, engineering drawing, coordinate system, algorithm
Abstract
A method for focus-change invariance in a graphical display may include computing selected items in the graphical display for presentation of each item in a predetermined geometric shape. The predetermined geometric shape may include a set of predetermined coordinates in a local coordinate system. The plurality of items may be presented using the local coordinate system. The method may additionally include mapping the set of predetermined coordinates of a chosen item of the selected items in a [0,0,1,1] coordinate system to a set of transformed coordinates for the predetermined geometric shape of the chosen item. The set of transformed coordinates allow presentation of the chosen item in the coordinate system of the graphical display. The chosen item may be displayed in the predetermined geometric shape using the set of transformed coordinates without varying the layout of the chosen item and reverting to a previously used coordinate system.
2011
Assertions in a business rule management system
Thomas Baudel, Nicolas Sauterey
programming language, introspection, computer science, computer program, business rule management system, assertion
Abstract
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.
GUI FOR GOAL PROGRAMMING AND GOAL WEIGHTING IN OPTIMIZATION BASED APPLICATIONS
Georges-Henri Moll, Thomas Baudel
weighting, user interface, rendering, host, goal programming, engineering drawing, controller, computer science, computer program
Abstract
Embodiments of the present invention address deficiencies of the art in respect to mathematical programming for optimization based applications systems and provide a method, system and computer program product for providing an interface for generating and customizing optimization-based applications. A method for providing an interface for generating and customizing optimization-based applications can include generating an initial user interface having an objectives and sequences panel, the objectives and sequences panel can include a basic objective table, an aggregate objective table and an objective sequence table in a goal programming and goal weighting controller module executing in memory by a processor of a host computer. The method also includes rendering in the basic objective table a list of goals with corresponding indexes provided by the optimization application. The method further includes receiving selection of a subset of objectives to generate a new aggregate objective in the aggregate objective table.
Contextual feedback of rules proximity based upon co-occurence history in a collaborative rule editing system
Thomas Baudel, Frank Van Ham
information retrieval, computer science, computer program, business rule management system, artificial intelligence
Abstract
Embodiments of the present invention provide a method, system and computer program product for providing contextual feedback of rules proximity based on co-occurrence history in a business rules management system (BRMS). In an embodiment of the invention, a method for providing contextual feedback of rules proximity based on co-occurrence history can include selecting a rule for editing in a rules editor executing in memory of a computer, identifying different rules also having been applied to an input in common with the selected rule and displaying the identified different rules in the rules editor in connection with the selected rule.
RULE CORRELATION TO RULES INPUT ATTRIBUTES ACCORDING TO DISPARATE DISTRIBUTION ANALYSIS
Thomas Baudel, Frank Van Ham
pattern recognition, mathematics, guard, global distribution, data mining, correlation, computer program, artificial intelligence
Abstract
Embodiments of the present invention provide a method, system and computer program product for visualizing rule input attributes with a rule according to disparate rule attribute distributions. In an embodiment of the invention, a method for visualizing rule input attributes with a rule according to disparate rule attribute distributions has been provided. The method includes identifying in response to a selection of a rule for viewing in a rule viewer an input for the selected rule and determining an attribute for the input. However, attributes present in a guard for the selected rule can be excluded. The method also can include computing a global distribution of the attribute irrespective of the identified input and a specific distribution for the identified input. Thereafter, the attribute can be flagged as being correlated with the selected rule when it is determined that a sufficient disparity exists between the global distribution and the specific distribution.
COMPUTER AIDED VISUALIZATION OF A BUSINESS OBJECT MODEL LIFECYCLE
Thomas Baudel, Nicolas Carre
vocabulary, visualization, software versioning, engineering drawing, data processing system, computer science, computer aided visualization, business object
Abstract
A method, system and apparatus for visualization of versions of a BOM. In accordance with an embodiment of the invention, at least two different versions of a BOM can be loaded into a versioning data processing system of a modeling tool executing in memory of a computer. The data from both versions of the BOM can be loaded into a single table in which each row of the table can include columns for a class name of a corresponding class specified by one of the versions of the BOM, a version of the corresponding class and at least one characteristic of the corresponding class such as a member name, type, date, argument, or other annotations such as vocabulary, comments, date. Subsequently, the single table can be visualized in at least two different treemaps for at least two different attributes of the versions of the BOM set forth in the single table.
Method and system of adapting a data model to a user interface component
Thomas Baudel, Frederic Delhoume
user interface, source data, information retrieval, data type, data model, data mining, data domain, computer science
Abstract
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.
Method and system for executing a graphics application
Yunpeng Zhao, Thomas Baudel
pixel, graphics, data mapping, computer vision, computer science, computer graphics images, artificial intelligence
Abstract
A system, program product and method of executing a predefined graphics application on objects belonging to a rendered image. The method comprises receiving an array of properties representing properties of the image objects and a mapping data structure. The mapping data structure maps pixel locations in the rendered image to indices in the array of properties. In response to the reception of a user input identifying the location of a given object in the rendered image the method comprises the following steps: (i) determining from the mapping data structure an object index for the designated object using the location of the given object; (ii) retrieving the properties of the designated object from the array of properties at the object index; and (iii) executing the predefined graphics application using the properties determined in step ii for the designated object.
2010
MULTIWAY TRIE DATA STRUCTURE THAT DYNAMICALLY ADJUSTS NODE SIZES IN A MANNER THAT REDUCES MEMORY FOOTPRINT AND IMPROVES ACCESS SPEED
Thomas Baudel
trie, parallel computing, memory footprint, key distribution, hash table, data structure, computer science, computer program
Abstract
A method, system and computer program product for dynamically adjusting node sizes in a multiway trie data structure. Upon inserting a key/value pair in a node in a multiway trie data structure that causes the number of entries in the multiway trie data structure to exceed a threshold, a splitting method is implemented. The splitting method involves doubling the width of the node in the multiway trie data structure thereby resizing the node in a resized multiway trie data structure. Furthermore, a sub-node of the original node may be split into two sections and stored in two child level nodes of the resized node under certain circumstances. Hence, only the original node and its direct successors are resized. Such a data structure outperforms hash tables by taking advantage of patterns found in the key distribution to optimize both storage requirements and access speed.
2002
Interactive generation of graphical visualizations of large data structures
Thomas Baudel
timeline, rendering, rectangle, pie chart, histogram, expression, data structure, computer science, computer graphics images, bar chart
Abstract
A method and computer-executable program is disclosed for graphically rendering information of a database which can be arranged in form of a table, and for extraction associations between database records. An element and/or an arithmetic expression computed from the records in the database can be associated with a graphic representation consisting of instructions, such as setting a fill color, drawing a rectangle, and so on. Graphic renditions can include tables, histograms, bar charts, timeline displays, pie charts, and tree maps, as well as combinations of such displays. The proposed visualization-rendering method is flexible and computationally fast, since at most O(N) graphic instructions need to be generated for a database of N records.
1999
Drawing system using design guides
Thomas P. H. Baudel, George W. Fitzmaurice, William A. S. Buxton, Gordon P. Kurtenbach, Charles T. Tappen, Peter E. Liepe
stylus, pixel, line segment, input control, inkwell, french curve, engineering drawing, engineering, electronic design, cursor, computer graphics images
Abstract
An electronic design guide, such as a french curve, can be placed in the geometry layer of a drawing program. This allows the design guide and a drawing tool, such as an electronic paint brush, to be moved about with in the drawing simultaneously using two different input control devices, such as a mouse and an electronic stylus/tablet. The design guide can then be used block or mask paint from being applied to the drawing by comparing the coordinates of the cursor with the area of the guide and setting pixels of the drawing accordingly. The masking can be performed even as the guide is moved. The system also can be set to constrain the path of the ink applied by the drawing tool to the edge of the drawing guide even as the guide is moved. As the cursor is moved the position of the cursor is matched with the closest next line segment of the guide and that portion painted.
1996
Three dimensional input system using tilt
Ravin Balakrishnan, Thomas P. H. Baudel, Gordon P. Kurtenbach, George W. Fitzmaurice
resistor, orthogonal coordinates, hand held, engineering, electromagnetic coil, cursor, control theory, acoustics
Abstract
An input system for controlling the position or motion of a cursor, three dimensions that uses x, z position for inputting two coordinates and tilt in a plane (x-y or z-y) to input a third (and possibly a fourth coordinate). The invention is moved about on a surface for inputting two of the dimensions and tilted to input the third. The amount or degree of tilt and the direction of tilt controls the input of the third dimension. The base of the hand held device is curved so that the device can be tilted even while it is moved in two dimensions along the surface of the tablet. Tilting can be along two orthogonal axes allowing the device to input four coordinates if desired. The coil can also have switched resistors controlled by mouse buttons connected to it which the tablet can sense being activated to allow clutching and selection operations like those of a conventional mouse.
1995
Clickaround tool-based graphical interface with two cursors
Thomas Baudel, William A. S. Buxton, George W. Fitzmaurice, Beverly L. Harrison, Gordon P. Kurtenbach, Russell N. Owen
user interface, input device, human computer interaction, graphical user interface, cursor, computer science
Abstract
A graphical user interface with clickaround tools for enhanced user interaction with an application program utilizing "two-handed" techniques. The "tool-handed" technique provides two displayed cursors controlled by two distinct pointing input devices. Actuation of a secondary input device, corresponding a secondary cursor, provides a tool palette or menu near a displayed primary cursor. This technique allows a user to select and activate tools to perform substantive operations on displayed objects of the application program. The interface allows the user to invoke tools in a fluent and seamless fashion, thus maintaining the users focus on the substantive operations and not the procedural motions of tool access.
1