International Business Machines Corporation

Vadakkedathu Thomas Rajan

Mark N Wegman

David Francis Bacon

Perry S Cheng

Tova Roth

Douglas Neil Kimelman

Vugranam Chakravarthy Sreedhar

Paul Michael Matchen

Clay Edwin Williams

Richard B Segal

Murray Robert Cantor

Karin Hogstedt

Peter Kenneth Malkin

Ya Bin Dang

Lin Luo

Matthew R Arnold

Jason L Crawford

Ping Ping Cheng

Barry Leiba

Joel P Ossher

Jing Min Xu

Lin Y Yang

Jeffrey Owen Kephart

Fan Jing Meng

Yuan Yuan

Roger C Evans

George M Koppelman

Shlomo Hershkop

Adam Welc

Sunita Devnani Chulani

Giuiseppe Valetto

A method for automatically detecting and diagnosing problems in computer system functioning includes determining changed objects from computer system monitoring data, calculating temporal correlations from errors and changes sequences for each changed object, identifying and ranking suspicious computer system behavior patterns from the temporal correlations, and outputting said ranked suspicious computer system behavior patterns.

Automatic troubleshooting from computer system monitoring data based on analyzing sequences of changes

A system and method are provided for direct manipulation of a triangular distribution of information. The system includes a graphical user interface for receiving user inputted values. The system further includes a data calculator for generating estimates based on the user inputted values, and for generating curves for display on a grid based on at least one of, the user inputted values and the estimates. The graphical user interface respectively receives the user inputted values based at least on a current position of a pointer on the grid. The graphical user interface is capable of applying a direct manipulation to at least one of the user inputted values and the estimates, such that a result of the direct manipulation is displayed on the grid and enters triplets corresponding to an expected value, an upper bound for the expected value, and a lower bound for the expected value.

System and method for direct manipulation of a triangular distribution of information using a graphical user interface

A system and method are provided for direct manipulation of a triangular distribution of information using a graphical user interface. The system includes a graphical user interface for receiving user inputted values. The system further includes a data calculator for generating estimates based on the user inputted values, and for generating curves for display on a grid based on at least one of, the user inputted values and the estimates. The graphical user interface respectively receives the user inputted values based at least on a current position of a pointer on the grid. The graphical user interface is capable of applying a direct manipulation, based at least on the current position of the pointer on the grid, to at least one of the user inputted values and the estimates, such that a result of the direct manipulation is displayed on the grid.

Method and system for determining estimation variance associated with project planning are provided. In one aspect, information associated with a project is obtained and initial estimations for the tasks in the project are determined using available information. The tasks are performed and actual measurements are obtained from the completed tasks. The actual measurements are used to revise the estimates of the remaining tasks. The revised estimates are used to compute a project level estimate and a variance on that estimate, and to enable better project management.

Determining estimation variance associated with project planning

The present invention provides techniques that allow concurrent collection of cyclic garbage on reference counting systems. In general, candidate objects are found that may be part of cyclic garbage. Each candidate object has a reference count. Two tests are performed to determine if concurrent operations have affected the reference counts of the candidate objects. If concurrent operations have not affected the reference counts, the candidate objects are collected as garbage. Additionally, during garbage collection, the decrements to reference counts are delayed so that increments occur before decrements and so that decrements are held a predetermined time before being applied. This prevents decrementing a reference and collecting a cycle as garbage right before a reference is added to an object in the cycle.

Processing changes to reference counts associated with an object in reference counting systems

A system includes at least one router for routing email messages from a sender node to a destination node; a system memory; a network interface; a database; and a processor configured for: extracting the delivery path information from the email message; determining a network path for the email message using delivery path information; comparing the delivery path information with the plurality of prior delivery paths; determining a measure of similarity between the network path of the received email message and one or more of the plurality of prior email paths; and determining a spam score for the email received, based on the measure of similarity.

Recognizing spam email

A method and system for detecting a source-related risk and generating an alert concerning the source-related risk are disclosed. Criteria of the source-related risk are defined. Thresholds associated with the source-related risk are defined. Every operation on an object is detected. If an operation on an object satisfies a criterion among the criteria or if the operation causes to exceed a threshold among the thresholds, an alert is generated for the operation.

Method for source-related risk detection and alert generation

Concurrent collection of cyclic garbage in reference counting systems

A method for minimizing total cost of interaction among components of a computer program, each of the components being characterized by at least one implementation property includes steps of: a) carrying out at least a partial run of the program; b) monitoring the at least partial run of the program to measure an amount of interaction between each pair of components; c) determining a cost of interaction between each pair of interacting components; d) determining a choice of implementation properties which minimizes total cost of the at least partial run; and e) assigning that choice of implementation properties to the components for a subsequent at least partial run of the program.

Minimizing interaction costs among components of computer programs

A method and system for dynamically providing a composite source information report whenever source information of a composite object is updated. The system includes a subscription handler for receiving a subscription request and generating a subscription query, a means for determining whether source information of an element in a composite object has been edited (added, deleted and/or modified), a source information determining handler for automatically determining source information of an element in a composite object and a composite source information report generation handler for generating a composite source information report and providing the report to users. The system further comprises an authentication handler, an editing handler, an editing monitor, a source information recording handler, subscription source information retrieving handler and a server database.

Method of dynamically providing a compound object's source information during its development

A method for performing garbage collection for a real-time application uses a memory for determining an amount of memory required to run the garbage collection process and waits until the determined amount of memory is available, then allocates memory space for the application by segmenting the memory space into a number of pages of a predetermined size. A mutator is used for assuring that only non-null, unmarked objects are placed into a write buffer. A hybrid collector is used for removing the dead objects and defragmenting the memory space.

Scheduling and performing garbage collection in a real-time system with guaranteed space bounds

A garbage collection system that needs to meet real-time requirements uses an eager read barrier that performs a forwarding operation as soon as a quantity is loaded. The barrier maintains a to-space invariant by including a forwarding pointer in the header of objects to be moved or accessed that normally points to the object itself. However, if the object has been moved, the forwarding pointer points to the new object location. The eager read barrier maintains the registers and stack cells such that the registers and stack cells always point into to-space. Barrier-sinking and common sub-expression elimination are used to minimize the overhead associated with the read barrier.

Garbage collector with eager read barrier

A method for detecting undesirable emails combines input from two or more spam classifiers to provide improved classification effectiveness and robustness. The method includes obtaining a score from each of a plurality of constituent spam classifiers by applying them to a given input email. The method further includes obtaining a combined spam score from a combined spam classifier that takes as input the plurality of constituent spam classifier scores, the combined spam classifier being computed automatically in accordance with a specified false-positive vs. false-negative tradeoff. The method further includes identifying the given input email as an undesirable email if the combined spam score indicates that the input e-mail is undesirable.

Detecting spam email using multiple spam classifiers

A garbage collection system that needs to meet real-time requirements breaks large objects that need to be moved into a series of arraylets. The arraylets are sized such that the amount of time required to move the arraylets is bounded by a predetermined amount. The arrays are preferably uniformly represented in the header for each array with a series of arraylet pointers that indicate the location of the arraylets. Control-flow graph splitting is used to eliminate multiple tests and allow common sub-expression elimination. Strip-mining can also be used to improve the efficiency of the process.

Method and apparatus for efficient implementation of discontiguous objects

A system, method, and computer readable medium, for automatically improving performance of, and optimizing, a program based on on-line profile data of the program and profile data () collected across multiple runs of the program and stored in a persistent off-line repository (). The method includes executing a program in an execution environment. Profile data () is collected for the program across multiple runs thereof. The performance of the program is improved, such as by optimization of the program, based on on-line profile data of the executing program and the collected profile data in the persistent off-line repository.

Growing community of inventors

Briarcliff Manor, NY, United States of America

Vadakkedathu Thomas Rajan