Abstract: The present teaching relates to a method and system for securely sharing data between a group of data owners. A data owner generates mapping information in accordance with a model. The data owner generates a first data-sketch corresponding to proprietary data associated with the data owner. The mapping information and the first data-sketch are transmitted by the data owner to other data owners in the group of data owners. The data owner receives, from each of the other data owners, a second data-sketch corresponding to proprietary data associated with the other data owner, wherein the second data-sketch is generated based on the mapping information. The data owner processes the first data-sketch and the second data-sketches to generate combined data.

Abstract: A method for converting a distributed system includes providing a central database in communication with a database, in which the central database includes central schema information for accessing data stored in the central database. The method further includes transferring content data and schema information from the database to the central database for storage. The method further includes connecting schema information stored in the database to the central schema information such that each database is configured to receive a request for information, redirect the request from the database to the central database based on the referenced schema information, and receive, from the central database, the requested information.

Abstract: A system for managing electronic information in a distributed system includes a shared central database for which a plurality of servers transmits data for storage. The shared central database is configured to store central schema information used for accessing the one or more data stores of the central database. Local databases each reference at least a portion of the central schema information for accessing the central database. Upon receiving a request for information, a local database directs the request to the central database based on the referenced schema information. The central database processes the request and transmits the data to the local database from which data was requested.

Abstract: A method for converting a distributed system includes providing a central database in communication with a database, in which the central database includes central schema information for accessing data stored in the central database. The method further includes transferring content data and schema information from the database to the central database for storage. The method further includes connecting schema information stored in the database to the central schema information such that each database is configured to receive a request for information, redirect the request from the database to the central database based on the referenced schema information, and receive, from the central database, the requested information.

Abstract: A system for managing electronic information in a distributed system includes a shared central database for which a plurality of servers transmits data for storage. The shared central database is configured to store central schema information used for accessing the one or more data stores of the central database. Local databases each reference at least a portion of the central schema information for accessing the central database. Upon receiving a request for information, a local database directs the request to the central database based on the referenced schema information. The central database processes the request and transmits the data to the local database from which data was requested.

Abstract: A method of monitoring an element in a computer network including monitoring a preselected variable relating to that element; defining a threshold for the monitored preselected variable; establishing a sliding window in time; repeatedly generating a time above threshold value, the time above threshold value being a measure of an amount of time during which the monitored variable exceeded the threshold during the sliding window of time; detecting when the time above threshold value exceeds a condition window value; and in response to detecting when the time above threshold value exceeds the condition window, generating an alarm.

Abstract: A method of monitoring an element in a computer network including monitoring a preselected variable relating to that element; defining a threshold for the monitored preselected variable; establishing a sliding window in time; repeatedly generating a time above threshold value, the time above threshold value being a measure of an amount of time during which the monitored variable exceeded the threshold during the sliding window of time; detecting when the time above threshold value exceeds a condition window value; and in response to detecting when the time above threshold value exceeds the condition window, generating an alarm.

Abstract: A method of monitoring an element in a computer network including monitoring a preselected variable relating to that element; defining a threshold for the monitored preselected variable; establishing a sliding window in time; repeatedly generating a time above threshold value, the time above threshold value being a measure of an amount of time during which the monitored variable exceeded the threshold during the sliding window of time; detecting when the time above threshold value exceeds a condition window value; and in response to detecting when the time above threshold value exceeds the condition window, generating an alarm.

Abstract: A method provides for merging lists of newly found and old network elements. The method comprises receiving the list of newly found elements and deriving a potential key value for a portion of the newly found elements from configuration data associated therewith and a key format. The method also updates one of the old elements with the configuration data of a newly found keyed element having the same key. The method compares attributes of newly found elements for components to attributes of old network elements for attribute matches and reports matches. The report lists matching old elements and newly found elements as unresolved if either one does not have a unique key.

Abstract: A method provides for merging lists of newly found and old network elements. The method comprises receiving the list of newly found elements and deriving a potential key value for a portion of the newly found elements from configuration data associated therewith and a key format. The method also updates one of the old elements with the configuration data of a newly found keyed element having the same key. The method compares attributes of newly found elements for components to attributes of old network elements for attribute matches and reports matches. The report lists matching old elements and newly found elements as unresolved if either one does not have a unique key.

Abstract: A method of monitoring an element in a computer network including monitoring a preselected variable relating to that element; defining a threshold for the monitored preselected variable; establishing a sliding window in time; repeatedly generating a time above threshold value, the time above threshold value being a measure of an amount of time during which the monitored variable exceeded the threshold during the sliding window of time; detecting when the time above threshold value exceeds a condition window value; and in response to detecting when the time above threshold value exceeds the condition window, generating an alarm.

Abstract: A method for collecting and reporting monitored data for network traffic, which has been accumulated by a plurality of remote probes. The method includes making a series of polling requests for lists of monitoring data to each probe and receiving the requested lists. Each list has traffic count values that are identified by at least a sampling time, a source address, a destination address and a probe identifier. The method also includes calculating the traffic observed by each probe between successive sampling times and apportioning the calculated traffic data among a single set of consecutive temporal intervals and selecting best counts to avoid overcounting.