Abstract: A method for providing one or more random sample documents from a corpus of documents using a search engine is provided. The providing of each of the random sample documents comprises selecting randomly a time window from a set of time windows. A search query is sent to the search engine defining a search for documents of the corpus with time-stamps within the time window defined by the randomly selected time window. In response to the sending of the search query, a search result is receiving from the search engine. The search result comprises a set of the documents of the corpus with time-stamps within the time window. One of the documents comprised by the received set of documents is then selected randomly.

Abstract: Discovering second-order documents and latent custodians in an e-discovery system is provided. A list of first-order documents and document custodians within a base state of the e-discovery system are identified based on a plurality of terms corresponding to a meet and confer practice for a legal matter instance. The plurality of terms is masked within the first-order documents. The first-order documents having the plurality of terms masked are divided into groups. A list of second-order documents is generated from a group of documents. A list of second-order document custodians is generated based on corresponding custodian relationships to second-order documents. Finally, each second-order document custodian in the list of second-order document custodians that has a corresponding rank exceeding a defined rank threshold level is identified as an official document custodian in the e-discovery system.

Abstract: A method for providing one or more random sample documents from a corpus of documents using a search engine is provided. The providing of each of the random sample documents comprises selecting randomly a time window from a set of time windows. A search query is sent to the search engine defining a search for documents of the corpus with time-stamps within the time window defined by the randomly selected time window. In response to the sending of the search query, a search result is received from the search engine. The search result comprises a set of the documents of the corpus with time-stamps within the time window. One of the documents comprised by the received set of documents is then selected randomly.

Abstract: A method for processing electronic documents comprises an iteration including: (i) applying, by a computer device, a first statistical test process to a first subset of the documents, the first statistical test process estimating whether or not content of the documents of the first subset comply with a predefined criterion; (ii) in response to a result of the first statistical test process, estimating, by the computer device, that the documents of the first subset do not comply with the criterion, selecting, by the computer device, a part of the documents of the first subset, and moving, by the computer device, the part of the documents to a second subset of the documents; and (iii) applying, by the computer device, a second statistical test process to the second subset of the documents, the second statistical test process calculating at least one statistical metric related to the documents of the second subset.

Abstract: Ensuring that there is a consistent and reliable manner for detecting and remedying potential policy violations from enterprise data sources by automating the scheduling of compliance checks on these enterprise data sources. These enterprise data sources include documents that are used by an enterprise that must be in compliance with a particular regulation.

Abstract: Predicting potential policy violations in a given data source (such as a set of documents) so that a deeper analysis can be performed on the set of documents to gain additional insights into the potential policy violation(s) that may be contained therein. In some instances, this prediction is done by performing a random sampling operation on the set of documents and collecting the metadata from these documents in order to determine whether or not the set of documents that are randomly sampled include a policy violation that can be remediated.

Abstract: Discovering second-order documents and latent custodians in an e-discovery system is provided. A list of first-order documents and document custodians within a base state of the e-discovery system are identified based on a plurality of terms corresponding to a meet and confer practice for a legal matter instance. The plurality of terms is masked within the first-order documents. The first-order documents having the plurality of terms masked are divided into groups. A list of second-order documents is generated from a group of documents. A list of second-order document custodians is generated based on corresponding custodian relationships to second-order documents. Finally, each second-order document custodian in the list of second-order document custodians that has a corresponding rank exceeding a defined rank threshold level is identified as an official document custodian in the e-discovery system.

Abstract: A method for providing one or more random sample documents from a corpus of documents using a search engine is provided. The providing of each of the random sample documents comprises selecting randomly a time window from a set of time windows. A search query is sent to the search engine defining a search for documents of the corpus with time-stamps within the time window defined by the randomly selected time window. In response to the sending of the search query, a search result is receiving from the search engine. The search result comprises a set of the documents of the corpus with time-stamps within the time window. One of the documents comprised by the received set of documents is then selected randomly.

Abstract: A method for processing electronic documents comprises an iteration including: (i) applying, by a computer device, a first statistical test process to a first subset of the documents, the first statistical test process estimating whether or not content of the documents of the first subset comply with a predefined criterion; (ii) in response to a result of the first statistical test process, estimating, by the computer device, that the documents of the first subset do not comply with the criterion, selecting, by the computer device, a part of the documents of the first subset, and moving, by the computer device, the part of the documents to a second subset of the documents; and (iii) applying, by the computer device, a second statistical test process to the second subset of the documents, the second statistical test process calculating at least one statistical metric related to the documents of the second subset.

Abstract: A hybrid event processing network (EPN) having at least one event processing agent (EPA) consists of a first set of EPAs defined declaratively and a second set of EPAs defined dynamically at runtime via an interface. Deploying the hybrid EPN includes loading the hybrid EPN, constructing an EPN structure, and creating indexes of nodes of the EPN structure. Deploying the hybrid EPN further includes representing an event in a hybrid EPN, and, in response to the event occurrence at an event source, receiving a notification from the hybrid EPN based on the event, and publishing the notification in an event channel. Embodiments of the invention includes propagating the event received within the hybrid EPN, determining a subsequent EPA associated with the event within the hybrid EPN, and propagating the event to the subsequent EPA in the hybrid EPN until the last element of the hybrid EPN is reached.

Abstract: Change tracking for a structured language document is provided. A first interaction indicating a change to an entity represented by a structured language document is received, wherein the change modifies a portion of prior content of the entity to a portion of new content. The portion of prior content to a change history is stored, wherein the change history is associated with the entity. The entity and the portion of new content is presented via a user interface. In response to receiving a second interaction with the user interface, a presentation of the entity is modified based, at least in part, on an ordering of one or more changes of the change history associated with the entity.

Abstract: Change tracking for a structured language document is provided. A first interaction indicating a change to an entity represented by a structured language document is received, wherein the change modifies a portion of prior content of the entity to a portion of new content. The portion of prior content to a change history is stored, wherein the change history is associated with the entity. The entity and the portion of new content is presented via a user interface. In response to receiving a second interaction with the user interface, a presentation of the entity is modified based, at least in part, on an ordering of one or more changes of the change history associated with the entity.

Abstract: A method for auto-calibrating parameters in traffic prediction. The method includes determining a first subnet of traffic links that is associated with a plurality of traffic links in a traffic network. The method includes determining a second subnet of traffic links that is associated with the first subnet of traffic links and has a first traffic predicting accuracy value. The method includes generating a set of optimized traffic predicting parameters associated with the second subnet of traffic links, and applying the set of optimized traffic parameters onto a third subnet of traffic links. The method includes determining the set of optimized traffic predicting parameters used to calculate prediction results having a second traffic predicting accuracy value, and applying said set of optimized traffic predicting parameters to subnets associated with the traffic network. Further, the first traffic predicting accuracy value is lower than the second traffic predicting accuracy value.

Abstract: A method for auto-calibrating parameters in traffic prediction. The method includes determining a first subnet of traffic links that is associated with a plurality of traffic links in a traffic network. The method includes determining a second subnet of traffic links that is associated with the first subnet of traffic links and has a first traffic predicting accuracy value. The method includes generating a set of optimized traffic predicting parameters associated with the second subnet of traffic links, and applying the set of optimized traffic parameters onto a third subnet of traffic links. The method includes determining the set of optimized traffic predicting parameters used to calculate prediction results having a second traffic predicting accuracy value, and applying said set of optimized traffic predicting parameters to subnets associated with the traffic network. Further, the first traffic predicting accuracy value is lower than the second traffic predicting accuracy value.

Abstract: A method for auto-calibrating parameters in traffic prediction. The method includes determining a first subnet of traffic links that is associated with a plurality of traffic links in a traffic network. The method includes determining a second subnet of traffic links that is associated with the first subnet of traffic links and has a first traffic predicting accuracy value. The method includes generating a set of optimized traffic predicting parameters associated with the second subnet of traffic links, and applying the set of optimized traffic parameters onto a third subnet of traffic links. The method includes determining the set of optimized traffic predicting parameters used to calculate prediction results having a second traffic predicting accuracy value, and applying said set of optimized traffic predicting parameters to subnets associated with the traffic network. Further, the first traffic predicting accuracy value is lower than the second traffic predicting accuracy value.

Abstract: A method for auto-calibrating parameters in traffic prediction. The method includes determining a first subnet of traffic links that is associated with a plurality of traffic links in a traffic network. The method includes determining a second subnet of traffic links that is associated with the first subnet of traffic links and has a first traffic predicting accuracy value. The method includes generating a set of optimized traffic predicting parameters associated with the second subnet of traffic links, and applying the set of optimized traffic parameters onto a third subnet of traffic links. The method includes determining the set of optimized traffic predicting parameters used to calculate prediction results having a second traffic predicting accuracy value, and applying said set of optimized traffic predicting parameters to subnets associated with the traffic network. Further, the first traffic predicting accuracy value is lower than the second traffic predicting accuracy value.

Abstract: A method, a system and a computer program for parallel event processing in an event processing network (EPN) are disclosed. The EPN has at least one event processing agent (EPA). The method includes assigning an execution mode for the at least one EPA, the execution mode including a concurrent mode and a sequential mode. The execution mode for the at least one EPA is stored in the EPN metadata. The method also includes loading and initializing the EPN. The method further includes routing the event in the EPN and, when an EPA is encountered, depending on the execution mode of the encountered EPA, further processing of the event. Also disclosed are a system and a computer program for parallel event processing in an event processing network (EPN).

Abstract: A batch of data records generated by at least one application for persistent storage is cached by a cache management device. At least one of the batch of data records includes at least one foreign key reference that each references one non-existent data record. It is determined that one of a group of batch database storage events has occurred. In response to one of the group of batch database storage events, it is iteratively determined which of the at least one of the batch of data records do not include the at least one foreign key reference that each references the one non-existent data record. Each of the cached batch of data records that do not include the at least one foreign key reference that each references the one non-existent data record is persisted to a database by a batch storage operation.

Abstract: A batch of data records generated by at least one application for persistent storage is cached by a cache management device. At least one of the batch of data records includes at least one foreign key reference that each references one non-existent data record. It is determined that one of a group of batch database storage events has occurred. In response to one of the group of batch database storage events, it is iteratively determined which of the at least one of the batch of data records do not include the at least one foreign key reference that each references the one non-existent data record. Each of the cached batch of data records that do not include the at least one foreign key reference that each references the one non-existent data record is persisted to a database by a batch storage operation.

Abstract: A method, a system and a computer program for parallel event processing in an event processing network (EPN) are disclosed. The EPN has at least one event processing agent (EPA). The method includes assigning an execution mode for the at least one EPA, the execution mode including a concurrent mode and a sequential mode. The execution mode for the at least one EPA is stored in the EPN metadata. The method also includes loading and initializing the EPN. The method further includes routing the event in the EPN and, when an EPA is encountered, depending on the execution mode of the encountered EPA, further processing of the event. Also disclosed are a system and a computer program for parallel event processing in an event processing network (EPN).