International Business Machines Corporation

Yu-Ching Chen

Lior Aronovich

Tuo Wang

Ziyue Jason Wang

Nodes of a weighted tree each have their own weight. A normalized weight of a node, relative to other nodes in the tree, is determined based on a proportional weight of the node and a lesser unique sum of the node, as well as those of the node's parents and grandparents, up to a root of the tree. The proportional weight and lesser unique sum of a given node depend only on the unique weights of the sibling group including the given node. Thus, if a weight is modified, the normalized weight can be updated without necessarily recalculating the entire tree.

Normalizing weights of weighted tree leaf nodes

Provided is a method for identifying problematic input fields in a webform. The method comprises obtaining a set of user interaction data for a plurality of user interactions with input fields of a webform. The user interaction data for each input field includes data corresponding to at least one aspect. The method comprises assigning an aspect value to each aspect of each user interaction with each input field. The method comprises aggregating aspect values into an aggregated aspect value for each input field, generating a score for each input field based at least in part on the aggregated aspect field, ranking the input fields by their respective scores to identify at least one particular input field in the webform as problematic, and indicating that the at least one particular input field in the webform is problematic.

Identification of problematic webform input fields

A method for normalizing leaf nodes of a weighted tree for use in a scheduler is disclosed. In one embodiment, such a method includes obtaining a weighted tree structure having a root node and multiple downstream nodes. Each downstream node is assigned a weight value. The method assigns a global maximum number and a global minimum number to the root node. The method derives, from the weight values and the global maximum number and global minimum number, a maximum number and a minimum number for each downstream node. The method further assigns, to each leaf node of the downstream nodes, an absolute weight value that is related to at least one of its maximum number and its minimum number. The method schedules items associated with the leaf nodes based on the absolute weight values associated with the leaf nodes. A corresponding system and computer program product are also disclosed.

Growing community of inventors

North York, Canada

Yu-Ching Chen