Abstract: A computer-implemented system and method for selecting documents for review is provided. A master array of messages and topics for the messages is generated. The messages in the master array are sorted by the topics and the sorted messages are processed. During processing, each message in the master array is identified as unique, duplicate, or near duplicate. The unique messages are extracted from the duplicate and near duplicate messages, and entered into a log by creating a log entry for each of the unique messages. Each log entry includes a source of and identification information for one of the unique messages. The unique messages are then provided for document review.

Abstract: A computer-implemented system and method for selecting documents for review is provided. A master array of messages and topics for the messages is generated. The messages in the master array are sorted by the topics and the sorted messages are processed. During processing, each message in the master array is identified as unique, duplicate, or near duplicate. The unique messages are extracted from the duplicate and near duplicate messages, and entered into a log by creating a log entry for each of the unique messages. Each log entry includes a source of and identification information for one of the unique messages. The unique messages are then provided for document review.

Abstract: A system and method for identifying related messages are provided. A set of messages, each having a header, sender and transmission time, is obtained. A message is selected from the set. A body of the selected message is compared to a body of a further message in the set. The further message is labeled as a duplicate of the selected message when the bodies match. The duplicate labeling of the further message is verified when the header, sender, and transmission time of the further message matches the header, sender, and transmission time of the selected message. The duplicate messages are removed from the set. The remaining messages are sorted in order of message length. A shorter message is compared with a longer message and is marked as a near duplicate of the longer message when the body of the shorter message is included in the body of the longer message.

Abstract: A system and method for identifying related messages are provided. A set of messages, each having a header, sender and transmission time, is obtained. A message is selected from the set. A body of the selected message is compared to a body of a further message in the set. The further message is labeled as a duplicate of the selected message when the bodies match. The duplicate labeling of the further message is verified when the header, sender, and transmission time of the further message matches the header, sender, and transmission time of the selected message. The duplicate messages are removed from the set. The remaining messages are sorted in order of message length. A shorter message is compared with a longer message and is marked as a near duplicate of the longer message when the body of the shorter message is included in the body of the longer message.

Abstract: A computer-implemented system and method for identifying duplicate and near duplicate messages is provided. A set of messages is obtained. A body of one such message is compared with the body of each other message. Those messages having matching bodies are identified as exact duplicates. The exact duplicates are removed from the set. The remaining messages are sorted in order of message length and a shorter message is compared with a longer message. A determination is made that the body of the shorter message is included in the body of the longer message and the shorter message is marked as a near duplicate of the longer message.

Abstract: A computer-implemented system and method for identifying duplicate and near duplicate messages is provided. A set of messages is obtained. A body of one such message is compared with the body of each other message. Those messages having matching bodies are identified as exact duplicates. The exact duplicates are removed from the set. The remaining messages are sorted in order of message length and a shorter message is compared with a longer message. A determination is made that the body of the shorter message is included in the body of the longer message and the shorter message is marked as a near duplicate of the longer message.

Abstract: A computer-implemented system and method for identifying near duplicate messages is provided. Messages each including a content body are grouped by conversation thread. One or more of the messages also includes an attachment. The messages for each conversation thread are sorted in order of message length. At least one of the messages is selected from one of the threads and the body of the selected message is compared with the body of one such shorter message in that thread. A determination is made that the body of the shorter message is included in the body of the selected message. Hash codes of the attachments for the selected message and the shorter message are compared. The shorter message is marked as a near duplicate message of the selected message when the hash codes of the attachments match.

Abstract: A computer-implemented system and method for identifying near duplicate messages is provided. Messages each including a content body are grouped by conversation thread. One or more of the messages also includes an attachment. The messages for each conversation thread are sorted in order of message length. At least one of the messages is selected from one of the threads and the body of the selected message is compared with the body of one such shorter message in that thread. A determination is made that the body of the shorter message is included in the body of the selected message. Hash codes of the attachments for the selected message and the shorter message are compared. The shorter message is marked as a near duplicate message of the selected message when the hash codes of the attachments match.

Abstract: A system and method for identifying unique and duplicate messages is provided. Messages are maintained, and a header and message body are extracted from each of the messages. A hash code is calculated for each message over at least part of the header and the body of that message. The messages with matching hash codes are grouped. One message in each group with two or more messages is randomly selected as a unique message. The remaining messages in the group are marked as exact duplicate messages.

Abstract: A system and method for identifying unique and duplicate messages is provided. Messages are maintained, and a header and message body are extracted from each of the messages. A hash code is calculated for each message over at least part of the header and the body of that message. The messages with matching hash codes are grouped. One message in each group with two or more messages is randomly selected as a unique message. The remaining messages in the group are marked as exact duplicate messages.

Abstract: A system and method for processing message threads is provided. A plurality of messages, each comprising a message body, is grouped by conversation thread. The message bodies of the messages are compared. Each message recursively contained in at least one other message is identified as a near duplicate message. An attachment sequence is generated for at least part of each attachment associated with one or more of the messages. The attachment sequences associated with the near duplicate messages are compared. Each near duplicate message having an attachment sequence not matching the attachment sequence of any other near duplicate message is identified as a unique message.

Abstract: A system and method for processing message threads is provided. A plurality of messages, each comprising a message body, is grouped by conversation thread. The message bodies of the messages are compared. Each message recursively contained in at least one other message is identified as a near duplicate message. An attachment sequence is generated for at least part of each attachment associated with one or more of the messages. The attachment sequences associated with the near duplicate messages are compared. Each near duplicate message having an attachment sequence not matching the attachment sequence of any other near duplicate message is identified as a unique message.

Abstract: A system and method for processing a message store for near duplicate messages is provided. Metadata, content, and each attachment associated with messages are extracted. Near duplicate messages in the message store are identified. Compound digests taken of the metadata for, of the content contained in, and of the each attachment associated with each of the messages in the message store are compared. Each message having a compound digest not matching the compound digest of any other message is marked as unique and each message having a compound digest matching the compound digest of at least one other message is marked as an exact duplicate. Messages remaining unmarked and having similar content are grouped into sets that each includes one or more near duplicate messages. One of the near duplicate messages is designated as unique and each remaining near duplicate message in the set is designated as a near duplicate.

Abstract: A system and method for processing a message store for near duplicate messages is provided. Metadata, content, and each attachment associated with messages are extracted. Near duplicate messages in the message store are identified. Compound digests taken of the metadata for, of the content contained in, and of the each attachment associated with each of the messages in the message store are compared. Each message having a compound digest not matching the compound digest of any other message is marked as unique and each message having a compound digest matching the compound digest of at least one other message is marked as an exact duplicate. Messages remaining unmarked and having similar content are grouped into sets that each includes one or more near duplicate messages. One of the near duplicate messages is designated as unique and each remaining near duplicate message in the set is designated as a near duplicate.

Abstract: A system and a process are provided for transferring a cryogenic fluid such as liquefied natural gas between a floating transport vessel and a storage vessel. The fluid is transferred through at least one submerged/subsea/subsurface catenary flexible conduit, the conduits being configured to avoid damage from waves and abrasion or contact with the other conduits, the vessels, or other objects. A conduit transfer vessel is provided for storing the conduit in the water, delivering the conduit to each transport vessel, but standing off from the transport vessel during cryogenic fluid transfer, and then retrieving the conduit from the transport vessel, which greatly improves the safety of the cryogenic fluid transfer operations.

Abstract: A system and method for identifying messages in a message store is provided. At least part of metadata associated with and at least part of content contained in each of a plurality of messages in a message store are encoded by generating a metadata sequence and a content sequence for each message. The messages are grouped into sets by similar metadata sequences and similar content sequences. The messages in each set are compared. Each such message not matching any other such message in the set is marked as a unique message. Each such message matching at least one other such message in the set is marked as an exact duplicate message. Each such message including a subset of at least one other such message in the set is marked as a near duplicate message.

Abstract: A system and a process are provided for transferring a cryogenic fluid such as liquefied natural gas between a floating transport vessel and a storage vessel. The fluid is transferred through at least one submerged/subsea/subsurface catenary flexible conduit, the conduits being configured to avoid damage from waves and abrasion or contact with the other conduits, the vessels, or other objects. A conduit transfer vessel is provided for storing the conduit in the water, delivering the conduit to each transport vessel, but standing off from the transport vessel during cryogenic fluid transfer, and then retrieving the conduit from the transport vessel, which greatly improves the safety of the cryogenic fluid transfer operations.

Abstract: A system is provided for transferring fluids such as liquefied natural gas between a floating transport vessel and a floating storage vessel utilizing a transfer vessel to deploy, operate and return a fluid conduit to the storage vessel. The fluid is transferred through at least one submerged-subsea catenary flexible conduit, at least one floating flexible conduit, or any combination thereof. A transfer vessel, including a releasable mooring system, is provided for deploying the conduit from the storage vessel to the transport vessel, mooring with a transport vessel, maintaining a unified connection during fluid transfer, releasing the mooring once fluid transfer is completed, returning to and parking on the storage vessel, and storing the conduit between fluid transfers. The transfer vessel and releasable mooring system allows safe, controlled operation and fluid transfer in open sea conditions.

Abstract: A system is provided for transferring fluids such as liquefied natural gas between a floating transport vessel and a floating storage vessel utilizing a transfer vessel to deploy, operate and return a fluid conduit to the storage vessel. The fluid is transferred through at least one submerged-subsea catenary flexible conduit, at least one floating flexible conduit, or any combination thereof. A transfer vessel, including a releasable mooring system, is provided for deploying the conduit from the storage vessel to the transport vessel, mooring with a transport vessel, maintaining a unified connection during fluid transfer, releasing the mooring once fluid transfer is completed, returning to and parking on the storage vessel, and storing the conduit between fluid transfers.

Abstract: A system and method for evaluating a structured message store for message redundancy is described. A header and a message body are extracted from each of a plurality of messages maintained in a structured message store. A substantially unique hash code is calculated over at least part of the header and over the message body of each message. The messages are grouped by the hash codes. One such message is identified as a unique message within each group. In a further embodiment, the messages are grouped by conversation thread. The message body for each message within each conversation thread group is compared. At least one such message within each conversation thread group is identified as a unique message.