Abstract: The present invention provides a computer network implementable integration of promoted information with non-promoted content before a consumer interaction with the network, such that when the consumer interacts with the network, a consumer information interacts with this integrated content and delivers a message to the consumer such that the consumer visualizes this message as part of consumer experience without distracting from the network interaction task at hand. The integration is facilitated by semantic analysis and synthesis to naturally position the promoted content as close to the consumer interaction tasks as possible at that instant. This approach displaces the current practise of matching message to media placement while further enabling a promoter to evaluate and respond to feedback data depicting the efficacy of the sponsor message. The network in question is any computer network such as the Internet or intranet.

Abstract: The present invention provides a computer network implementable integration of promoted information with non-promoted content before a consumer interaction with the network, such that when the consumer interacts with the network, a consumer information interacts with this integrated content and delivers a message to the consumer such that the consumer visualizes this message as part of consumer experience without distracting from the network interaction task at hand. The integration is facilitated by semantic analysis and synthesis to naturally position the promoted content as close to the consumer interaction tasks as possible at that instant. This approach displaces the current practise of matching message to media placement while further enabling a promoter to evaluate and respond to feedback data depicting the efficacy of the sponsor message. The network in question is any computer network such as the Internet or intranet.

Abstract: Automated facet analysis of input information selected from a domain of information in accordance with a source data structure is described. Facet analysis may proceed by discovering at least one of facets, facet attributes, and facet attribute hierarchies of the input information using pattern augmentation and statistical analyses to identify patterns of facet attribute relationships in the input information.

Abstract: A method (system and computer program product) performs facet classification synthesis to relate concepts represented by concept definitions defined in accordance with a faceted data set comprising facets, facet attributes, and facet attribute hierarchies. Dimensional concept relationships are expressed between the concept definitions. Two concept definitions are determined to be related in a particular dimensional concept relationship by examining whether at least one of explicit relationships and implicit relationships exist in the faceted data set between the respective facet attributes of the two concept definitions.

Abstract: A method (system and computer program product) performs facet classification synthesis to relate concepts represented by concept definitions defined in accordance with a faceted data set comprising facets, facet attributes, and facet attributes hierarchies. Dimensional concept relationships are expressed between the concept definitions. Two concept definitions are determined to be related in a particular dimensional concept relationship by examining whether at least one of explicit relationships and implicit relationships exist in the faceted data set between the respective facet attributes of the two concept definitions.

Abstract: This invention relates generally to classification systems. More particularly this invention relates to a system, method, and computer program to dynamically generate a domain of information synthesized by a classification system or semantic network. The invention discloses a method, system, and computer program providing a means by which an information store comprised of knowledge representations, such as a web site comprised of a plurality of web pages or a database comprised of a plurality of data instances, may be optimally organized and accessed based on relational links between ideas defined by one or more thoughts identified by an agent and one or more ideas embodied by the data instances. Such means is hereinafter referred to as a “thought network”.

Abstract: Computer-implemented systems and methods for synthesis of concept definitions and concept relationships from a domain of data, utilizing different semantic processing protocols such as formal concept analysis and faceted classification synthesis from existing domain concepts that have a confidence gradient built into them. A cognitive or an input agent provides an input of an active concept which is matched against existing domain concepts. The resultant pool of relevant domain concepts is then used to derive virtual concept definitions using a semantic processing protocol. The derivation is then overlaid with a concept of relative proximity of an attribute from another within an attribute set. An additional layer of coherence is given by the relative proximity measure. The end result is a pool of related virtual concept definitions in a tree structure.

Abstract: A system, computer program, and method for organizing and managing data structures including based on input from a feedback agent is provided, the method including: (a) a method for faceted classification that is applicable to a domain of information, said method of faceted classification including: (i) a facet analysis of said domain or receiving the results of facet analysis of the domain; and (ii) applying a faceted classification synthesis of said domain; and (b) a complex-adaptive method for selecting and returning information, on one or more iterations, from said faceted classification synthesis, said complex-adaptive method varying the organizing and managing of data structures in response to said returned information.

Abstract: Automated facet analysis of input information selected from a domain of information in accordance with a source data structure is described. Facet analysis may proceed by discovering at least one of facets, facet attributes, and facet attribute hierarchies of the input information using pattern augmentation and statistical analyses to identify patterns of facet attribute relationships in the input information.

Abstract: A method (system and computer program product) performs facet classification synthesis to relate concepts represented by concept definitions defined in accordance with a faceted data set comprising facets, facet attributes, and facet attributes hierarchies. Dimensional concept relationships are expressed between the concept definitions. Two concept definitions are determined to be related in a particular dimensional concept relationship by examining whether at least one of explicit relationships and implicit relationships exist in the faceted data se between the respective facet attributes of the two concept definitions.

Abstract: A method (system and computer program product) performs facet classification synthesis to relate concepts represented by concept definitions defined in accordance with a faceted data set comprising facets, facet attributes, and facet attributes hierarchies. Dimensional concept relationships are expressed between the concept definitions. Two concept definitions are determined to be related in a particular dimensional concept relationship by examining whether at least one of explicit relationships and implicit relationships exist in the faceted data set between the respective facet attributes of the two concept definitions.

Abstract: Automated facet analysis of input information selected from a domain of information in accordance with a source data structure is described. Facet analysis may proceed by discovering at least one of facets, facet attributes, and facet attribute hierarchies of the input information using pattern augmentation and statistical analyses to identify patterns of facet attribute relationships in the input information.

Abstract: A complex-adaptive system is described for providing a faceted classification of a domain of information. A dimensional concept taxonomy classifying a domain may be constructed from a faceted data set comprising facets, facet attributes, and facet attribute hierarchies. An enhanced method of faceted classification provides the taxonomy which assigns facet attributes to objects of the domain to be classified in accordance with concepts (defined using the facet attributes) that ascribe meaning to the objects. Further the taxonomy expresses dimensional concept relationships between concept definitions in accordance with the faceted data set. The complex-adaptive system selects dimensional concept taxonomy information to facilitate varying the faceted data set and subsequent iterations of the taxonomy. The complex-adaptive system may involve a machine-based approach using statistical analysis of source data structures or user interactions with the taxonomy to provide the feedback.

Abstract: A complex-adaptive system is described for providing a faceted classification of a domain of information. A dimensional concept taxonomy classifying a domain may be constructed from a faceted data set comprising facets, facet attributes, and facet attribute hierarchies. An enhanced method of faceted classification provides the taxonomy which assigns facet attributes to objects of the domain to be classified in accordance with concepts (defined using the facet attributes) that ascribe meaning to the objects. Further the taxonomy expresses dimensional concept relationships between concept definitions in accordance with the faceted data set. The complex-adaptive system selects dimensional concept taxonomy information to facilitate varying the faceted data set and subsequent iterations of the taxonomy. The complex-adaptive system may involve a machine-based approach using statistical analysis of source data structures or user interactions with the taxonomy to provide the feedback.

Abstract: A method for modeling the performance of memory address translation mechanism (MATM), comprises: a) receiving an execution profile that contains a memory address reference stream of an application, a set of page size mappings, and events about the application's data allocations and de-allocations; b) translating each memory reference in the input memory reference stream into a reference to the corresponding data object, by consulting the memory allocation and de-allocation events, to provide a data object reference stream; c) translating each data object reference into a corresponding page reference by consulting the page size mapping and by modeling the data allocation and de-allocation events in accordance with the mapping to provide a page reference stream and a number of pages of each page size that are needed by the respective mapping; d) using the page reference stream to provide a stream of reuse distance values; e) determining, for each reference in the reuse distance value stream, whether the referen

Abstract: Automated facet analysis of input information selected from a domain of information in accordance with a source data structure is described. Facet analysis may proceed by discovering at least one of facets, facet attributes, and facet attribute hierarchies of the input information using pattern augmentation and statistical analyses to identify patterns of facet attribute relationships in the input information.

Abstract: A method (system and computer program product) performs facet classification synthesis to relate concepts represented by concept definitions defined in accordance with a faceted data set comprising facets, facet attributes, and facet attribute hierarchies. Dimensional concept relationships are expressed between the concept definitions. Two concept definitions are determined to be related in a particular dimensional concept relationship by examining whether at least one of explicit relationships and implicit relationships exist in the faceted data set between the respective facet attributes of the two concept definitions.

Abstract: A system and method includes steps, or acts, of: defining one or more events to provide a unified specification; registering one or more events to be detected; detecting an occurrence of at least one of the registered event or events; generating a monitoring entry each time one of the registered events is detected; and entering each of the monitoring entries generated into a single logical entity. The method can also be implemented as machine executable instructions executed by a programmable information processing system or as hard coded logic in a specialized computing apparatus such as an application-specific integrated circuit (ASIC).

Abstract: Systems and methods for cache replacement monitoring (CRM) are provided. The system includes a monitored cache comprising a monitored cache line set, the monitored cache line set comprising at least one cache line capable of holding data of a monitored address; and a CRM mechanism operatively associated with the monitored cache. The CRM mechanism collects CRM information for the monitored address. The method includes the steps of collecting CRM information for a monitored address in a monitored cache; and recording the CRM information for the monitored address, when at least one of (1) the monitored address is cached in the monitored cache, (2) the monitored address is replaced in the monitored cache, (3) any cache line in a cache line set corresponding to the monitored address is cached in the monitored cache, and (4) any cache line in a cache line set corresponding to the monitored address is replaced in the monitored cache.

Abstract: An encoder and an encoding method are suitable for use in an optical communication system. A concatenated coding scheme is used, in which the source data are encoded by means of an outer encoder to produce outer encoded data, and the outer encoded data are encoded by means of an inner encoder to produce inner encoded data, which are transmitted over a communications medium, such as an optical fibre. The inner encoder acts to produce inner encoded data in a format which occupies the space occupied one or more (for example, two) frames as defined in a standard, in this case the ITU-T G.709 standard. The inner encoder forms a product code from two sets of codewords, for example Extended Hamming codes. More particularly, at least one of the two sets of codewords is a shortened code, in order that the inner encoded data exactly occupies a plurality of frames as defined in the standard.