Abstract: A system comprising a well drilled into an underground formation comprising hydrocarbons; a production facility at a topside of the well; a water production facility connected to the production facility; wherein the water production facility produces water by passing the water through a first and a second nanofiltration module, and then injects the water 5 into the well.

Abstract: A system comprising a well drilled into an underground formation comprising hydrocarbons; a production facility at a topside of the well; a water production facility connected to the production facility; wherein the water production facility produces water by removing some multivalent ions, then removing some monovalent ions, and then adding back some monovalent ions, and then injects the water into the well.

Abstract: A system comprising a well drilled into an underground formation comprising hydrocarbons; a production facility at a topside of the well; and a water production facility connected to the production facility; wherein the water production facility produces water by removing some multivalent ions, then removing some monovalent ions, and then adding back some multivalent ions, and then injects the water into the well.

Abstract: A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, the method comprising: accessing an inverted index to obtain an initial retrieval of results in response to a query, and to generate a rank list of the results, the results referring to information units (IUs) where the query occurs; and determining a number of “N” IUs in the results that are assumed to be relevant by accessing a forward index; wherein the forward index and inverted index have pointers to locations in the IUs where terms of the query occur, and the forward index retrieves a term frequency vector of the IU or a set of contexts of the IU.

Abstract: A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, the method comprising: accessing an inverted index to obtain an initial retrieval of results in response to a query, and to generate a rank list of the results, the results referring to information units (IUs) where the query occurs; and determining a number of “N” IUs in the results that are assumed to be relevant by accessing a forward index; wherein the forward index and inverted index have pointers to locations in the IUs where terms of the query occur, and the forward index retrieves a term frequency vector of the IU or a set of contexts of the IU.

Abstract: A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, comprising using a computing device to: access an inverted index to obtain an initial retrieval of results in response to a query, and to generate a rank list of the results, the results referring to information units (IUs) where the query occurs; and determine a number of “N” IUs in the results that are regarded by the computing device to be relevant by accessing a forward index; and use the forward index to perform any one from the group consisting of: computing query expansion weights for top “N” retrieved IUs, building the relevance models by the contexts of query terms in the top “N” retrieved IUs, and finding the longest contiguous sequences of query terms in a query found in an IU; wherein the forward index and inverted index have pointers to locations in the IUs where terms of the query occur, and the forward index retrieves a term frequency vector o

Abstract: A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.

Abstract: A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.

Abstract: There is disclosed a system comprising a well drilled into an underground formation comprising hydrocarbons; a production facility at a topside of the well; a water production facility connected to the production facility; wherein the water production facility produces water by passing the water through a first and a second nanofiltration module, and then injects the water into the well.

Abstract: Embodiments of the invention provide an RBE that uses a logical abstraction for a set of application rules that allows the rules to be implemented, presented and modified efficiently. For one embodiment, rules logic for implementing a set of application rules is stored. The rules logic is specified by a processing sequence using one or more application factors, each of which has one or more application factor values. A plurality of entries corresponding to each application factor is separately stored. Each entry contains a data point set having one or more data points and a result corresponding to the data point set. Each of the one or more data points of a data point set corresponds to a distinct factor value.

Abstract: An oil and gas collection system, comprising a source of oil and gas flowing into a body of water; a collector located adjacent the source of oil and gas; a riser to transport the oil and gas towards a surface of the body of water, a first end of the riser fluidly connected to the collector; and a separator fluidly connected to a second end of the riser, the separator adapted to separate the oil and gas into a first oil rich stream and a second gas rich stream, the separator comprising an oil rich stream outlet and a gas rich stream outlet. In some embodiments, the source of oil and gas comprises a blow out preventer.

Abstract: There is disclosed a system comprising a well drilled into an underground formation comprising hydrocarbons; a production facility at a topside of the well; a water production facility connected to the production facility; wherein the water production facility produces water by removing some multivalent ions, then removing some monovalent ions, and then adding back some monovalent ions, and then injects the water into the well.

Abstract: A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.

Abstract: A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.

Abstract: There is disclosed a system comprising a well drilled into an underground formation comprising hydrocarbons; a production facility at a topside of the well; a water production facility connected to the production facility; wherein the water production facility produces water by removing some multivalent ions, then removing some monovalent ions, and then adding back some multivalent ions, and then injects the water into the well.

Abstract: A tree data structure for storing strings of searchable data divided into substrings has at least one first type node that has a substring associated with it and at least one second type node that does not having a substring associated with it. A second type node is directly linked to a first type node by a fail transition. A first type node is directly linked to a second type node by a match transition. An IP address lookup system has memory for storing a tree data structure and a controller for storing and loading an incoming IP address. The system has a finite state machine having three stages including a first stage for loading the IP address and performing a length calculation, a second stage for searching the data structure to find a match, and a third stage for determine the next-hop address index.

Abstract: A method for using dual indices to support query expansion, relevance/non-relevance models, blind/relevance feedback and an intelligent search interface, comprising using a computing device (89) to: access (101) an inverted index (103) to obtain an initial retrieval of results in response to a query, and to generate a rank list of the results, the results referring to information units (IUs) where the query occurs; and determine (105) a number of “N” IUs in the results that are assumed to be relevant by accessing a forward index (104); wherein the forward index (104) and inverted index (103) have pointers to locations in the IUs where terms of the query occur, and the forward index (104) retrieves a term frequency vector of the IU or a set of contexts of the IU.

Abstract: Embodiments of the invention provide an RBE that uses a logical abstraction for a set of application rules that allows the rules to be implemented, presented and modified efficiently. For one embodiment, rules logic for implementing a set of application rules is stored. The rules logic is specified by a processing sequence using one or more application factors, each of which has one or more application factor values. A plurality of entries corresponding to each application factor is separately stored. Each entry contains a data point set having one or more data points and a result corresponding to the data point set. Each of the one or more data points of a data point set corresponds to a distinct factor value.

Abstract: Embodiments of the invention provide an RBE that uses a logical abstraction for a set of application rules that allows the rules to be implemented, presented and modified efficiently. For one embodiment, rules logic for implementing a set of application rules is stored. The rules logic is specified by a processing sequence using one or more application factors, each of which has one or more application factor values. A plurality of entries corresponding to each application factor is separately stored. Each entry contains a data point set having one or more data points and a result corresponding to the data point set. Each of the one or more data points of a data point set corresponds to a distinct factor value.

Abstract: A system for the intelligent management of knowledge and delivery of content is provided. The system allows end users to access targeted fixes in connection with resolving problems with appliances, such as computers or other devices. The system further provides for the delivery of inventory information and information regarding attempts that have been made to fix problems with an appliance to technical support personnel. Technical support personnel may selectively access approved fixes or potential fixes through selections made from a tree of devices and/or problems or through the identification of key indicators. Technicians may also create fixes and made such fixes available to other technicians immediately.