Abstract: An apparatus and method is provided for auditing the configuration of an enterprise comprising the steps of: collecting information relating to the configuration of the enterprise, analyzing the configuration information based on expert knowledge; and providing the result of the analysis in the form of reports, and other results of the analyses.

Abstract: A method and apparatus for of high-speed and memory efficient rule matching, the rule matching being performed on an m-dimensional universe with each dimension bound by a given range of coordinate values, and a set of rules that apply to an undetermined number of coordinates in that universe. More specifically, a high-speed computer based packet classification system, uses an innovative set intersection memory configuration to provide efficient matching of packets flowing through a network system to a specific process flow based on a packet tuple. The system also provides classification of packets as they flow through a network system. More particularly, this system correlates these flowing packets with previously received packets, along with identifying the packets so that they are handled efficiently. The ability to correlate packets to their corresponding process flows permits the implementation of service aware networks (SAN) that are capable of handling network situations at the application level.

Abstract: Apparata, articles and methods for discovering partially periodic temporal associations, referred to herein as p-patterns, are provided. For example, a p-pattern in computer networks might comprise five repetitions every 30 seconds of a port-down event followed by a port-up event, which in turn is followed by a random gap until the next five repetitions of these events. In one embodiment, the present invention comprises: (i) a normalization step to convert application-oriented event data into an application-independent normalized table; (ii) an algorithm for finding significant period lengths from normalized events (e.g., 30 seconds) using a Chi-squared test; and (iii) an algorithm for finding a partially periodic temporal association (e.g., port-down followed by port-up) given a known period.

Abstract: A method and apparatus of training a neural network. The method and apparatus include creating a model for a desired function as a multi-dimensional function, determining if the created model fits a simple finite geometry model, and generating a Radon transform to fit the simple finite geometry model. The desired function is fed through the Radon transform to generate weights. A multilayer perceptron of the neural network is trained using the weights.

Abstract: A process is described based on activities and dependence relationship between the activities. The dependence relationship is described based on resource and coordination method. An epistemological ground is set corresponding to the domain of the process and other components of the process are described for each epistemological ground. The epistemological grounds are classified according to abstract-concrete relationship, inclusion relationship, cluster relationship, etc., and are retrieved. The activity, dependence relationship, and resource also have classification structures. Setting an epistemological ground or using a global epistemological ground, the activity, dependence relationship, and resource are defined and the process is described and analyzed.

Abstract: A method of rule processing includes defining/entering attributes, enumerations, and/or relationships; packaging the definitions in a reduced canonical form suitable for propositional logic manipulation using zero-suppressed binary decision diagrams (Zdd) to produce a prime Zdd; and/or (iii) executing the rule by applying a series of user inputs to the prime Zdd to determine a result that preferably includes conflict and selection advice to guide the user to satisfaction. Elective events, such as but not limited to the display of messages or the performance of calculations, may optionally be packaged along with the prime rule or components thereof, and presented during execution to help guide the end user to satisfaction or compliancy when choosing among possible selections. The invention automates determination of a complex rule having a combinatorial exploded number of rule components, or a combinatorial number of possible outcomes, exceeding computational capacity of present day computing systems.

Abstract: Scheme for enriching an input network with knowledge from a fractal semantic knowledge network. The input network comprises objects and pointers between these objects, and the knowledge network comprises semantic units, and a plurality of Jani, whereby any of these Jani is associated with one or more of the semantic units such that the respective Janus is able to operate on one or more of the semantic units. The following steps are carried out: finding a counterpart element for an object or a pointer by looking for a semantic unit that is related to the object or the pointer; establishing a classification connection between the object or the pointer and its counterpart element; assigning the module that is associated with the counterpart element, if any, to the object or the pointer; examining the objects' or the pointers' neighborhoods in the input network by comparing them with the counterpart elements' neighborhoods in knowledge network to verify the classification connection.

Abstract: A method and apparatus for producing a keyword dictionary using a computer includes inputting a user's necessity or a user's non-necessity for each of pieces of information data, wherein one or more keywords are attached to the information data. A summed necessity value relating to the user's necessities inputted for the pieces of information data and a summed non-necessity value relating to the user's non-necessities inputted for the pieces of information data are calculated. A difference between the summed necessity value and the summed non-necessity value for each of the keywords is calculated, and a predication value predicting a user's necessity degree for each of the keywords according to the differences, respectively, relating to the keywords, is calculated. Each prediction value calculated is assigned to the corresponding keyword.

Abstract: A method for computing all occurrences of a compound event from occurrences of primitive events where the compound event is a defined combination of the primitive events. The method includes the steps of: (a) defining primitive event types; (b) defining combinations of the primitive event types as a compound event type; (c) inputting the primitive event occurrences, such occurrences being specified as the set of temporal intervals over which a given primitive event type is true; and (d) computing the compound event occurrences, such occurrences being specified as the set of temporal intervals over which the compound event type is true, where the sets of temporal intervals in steps (c) and (d) are specified as smaller sets of spanning intervals, each spanning interval representing a set of intervals.

Abstract: A method for problem solving in a computer system includes an applications module for sending a problem statement to a complexity module, which configures a solving module with configuration parameters and also determines expected problem solver behavior. The solving module selects a set of parameter configuration vectors, determines a set of search space points, performs a partial search based on the parameter configuration vectors, and determines actual problem solver behavior. The solving module then determines whether a problem solution has been found, whether to perform a solver iteration step or request a complexity module to perform an adaptation step.

Abstract: The calculation circuit comprises a subtracter having a first and a second input receiving a first and, respectively, a second input datum; a first output supplying a first output datum equal to the difference between the first and the second input datum; and a second output supplying a sign flag indicating the sign of the first output datum; an XOR logic gate having a first input receiving the sign flag, a second input receiving a first logic selection signal assuming a first level for the selection of the logical fuzzy union operation and a second level for the selection of the logical fuzzy intersection operation, and an output supplying a second logic selection signal; and a multiplexer having a first and a second datum input receiving the first and, respectively, the second input datum; a selection input receiving the second selection signal; and an output supplying a second output datum constituted by the first or the second input datum (A, B) as a function of the level assumed by the second selection s