Abstract: A novel and useful method for enabling system logs to be effectively and efficiently monitored by ranking the system log messages by their estimated value to administrators and generating a log view that displays the most important messages. The ranking process uses a dataset of system logs from many computer systems to score messages. For better scoring, unsupervised clustering is used to identify sets of systems that behave similarly. The expected distribution of messages in a given system is estimated using the resulting clusters, and log messages are scored using this estimation.

Abstract: A method for visual representation of time based events in a target system comprises analyzing content related to occurrence of one or more events in a target system, wherein the content comprises information from which type of an event and time of occurrence of the event may be determined; grouping the events into one or more classes according to one or more predefined attributes; and generating a visual presentation of events occurring in a first time range, wherein the time range is selectable by an independent entity.

Abstract: In accordance with one embodiment, a method for detecting potential problems in the configuration or components of a complex system comprises comparing first configuration data for a first system with second configuration data compiled from analyzing a plurality of systems in a selected population; and reporting anomalies associated with the first system, in response to determining that the first configuration data deviates from components determined to be common to the selected population.

Abstract: A computer-implemented method for solving a constraint satisfaction problem (CSP), which is defined by variables and constraints applicable to the variables, and which has states corresponding to respective sets of values of the variables. The method includes assigning cost functions to the constraints so that the states have respective costs determined by application of the cost functions to the respective sets of values of the variables, the respective costs defining a problem topography of the CSP having global extrema corresponding to solutions of the CSP. The constraints of the CSP are reformulated so as to perform at least one of increasing a density of the solutions in the problem topography and smoothing a gradient of the problem topography. One or more of the solutions of the CSP are found by applying a stochastic CSP solver to the reformulated constraints.

Abstract: In accordance with one embodiment, a method for detecting potential problems in the configuration or components of a complex system comprises comparing first configuration data for a first system with second configuration data compiled from analyzing a plurality of systems in a selected population; and reporting anomalies associated with the first system, in response to determining that the first configuration data deviates from components determined to be common to the selected population.

Abstract: A method for visual representation of time based events in a target system comprises analyzing content related to occurrence of one or more events in a target system, wherein the content comprises information from which type of an event and time of occurrence of the event may be determined; grouping the events into one or more classes according to one or more predefined attributes; and generating a visual presentation of events occurring in a first time range, wherein the time range is selectable by an independent entity.

Abstract: A novel and useful method for enabling system logs to be effectively and efficiently monitored by ranking the system log messages by their estimated value to administrators and generating a log view that displays the most important messages. The ranking process uses a dataset of system logs from many computer systems to score messages. For better scoring, unsupervised clustering is used to identify sets of systems that behave similarly. The expected distribution of messages in a given system is estimated using the resulting clusters, and log messages are scored using this estimation.

Abstract: A computer-implemented method for solving a constraint satisfaction problem (CSP), which is defined by variables and constraints applicable to the variables, and which has states corresponding to respective sets of values of the variables. The method includes assigning cost functions to the constraints so that the states have respective costs determined by application of the cost functions to the respective sets of values of the variables, the respective costs defining a problem topography of the CSP having global extrema corresponding to solutions of the CSP. The constraints of the CSP are reformulated so as to perform at least one of increasing a density of the solutions in the problem topography and smoothing a gradient of the problem topography. One or more of the solutions of the CSP are found by applying a stochastic CSP solver to the reformulated constraints.