| Patent application number | Description | Published |
|---|
| 20100114555 | HANDLING MUTEX LOCKS IN A DYNAMIC BINARY TRANSLATION ACROSS HETEROGENOUS COMPUTER SYSTEMS - A method for executing non-native binaries on a host computer architecture comprises receiving a guest executable binary encoded on a computer readable medium. The guest executable binary is executable on a first computer architecture. Moreover, the guest executable binary includes a mutex lock encoded instructions for implementing a mutex lock. The guest executable binary is then executed on the host computer architecture by first translating the guest executable binary to a translated executable binary. The encoded instructions for implementing a mutex lock are translated by mapping the mutex lock to an instance of a compound mutex lock data structure. A computer system implementing methods for executing non-native binaries on a host computer architecture is also provided. | 05-06-2010 |
| 20100115497 | HANDLING SIGNALS AND EXCEPTIONS IN A DYNAMIC TRANSLATION ENVIRONMENT - A method for executing non-native binaries on a host computer architecture comprises receiving the guest executable binary into a computer readable medium. The guest executable binary is executed on the host computer architecture by translating the guest executable binary into a translated executable binary. Each instruction of the translated executed binary is then executed on the host computer architecture. Signals are responded to by placing signal information on a signal queue and deferring signal handling until a safe point is reached. A computer system implementing the method is also provided. | 05-06-2010 |
| 20100169308 | DYNAMIC TRANSLATOR FOR REQUESTS FOR SYSTEM RESOURCES - Techniques for selectively translating resource requests from a program running on a computer system are disclosed. The resource request may be a request to access a file, library file, API, etc. The resource request may be a system call or library call. The computer program may be non-native to the computer system. Translation of resource requests may occur within the operating system or outside it. A resource request containing a reference to a first path and file name may be selectively translated by altering the resource request to contain a reference to a second path and file name. After selectively translating a request, he request is caused to be serviced. A resource request may be serviced by forwarding it to an operating system, and a result may be sent back to the program. | 07-01-2010 |
| 20100274551 | SUPPORT FOR A NON-NATIVE APPLICATION - Aspects of the invention are directed to a systems and methods for operating a non-native binary in dynamic binary translation environment. In accordance with an embodiment, there is provided a computer program product in a computer readable medium. The product includes program code for receiving a non-native binary in a computer readable medium and program code for translating the non-native binary. Additionally, the product includes program code for executing the translated non-native binary, the non-native binary including one or more threads, and program code for pausing execution of the translated non-native binary. The product also includes program code for providing guest instruction boundary information to a monitoring process and program code for analyzing a state of each thread of the translated non-native binary. Moreover, the product includes program code for fast-forwarding at least one thread so that its state is consistent with the guest instruction boundary | 10-28-2010 |
| Patent application number | Description | Published |
|---|
| 20080247351 | Scalable Satellite Deployment - A scalable subscriber terminal for bi-directional communication with a gateway through one or more satellites is provided according to another embodiment of the invention. The scalable subscriber terminal may comprise a plurality of antennas and be configured to operate in at least a first communication mode prior to switching to a second communication mode. The first communication mode may comprise communicating with the gateway through a first satellite. The second communication mode may include communicating with the gateway through the first satellite and a second transceiver. The scalable subscriber terminal may download MIMO operational firmware from the gateway through the first satellite prior to switching to the second communication mode. The first communication mode may be a SISO or SIMO mode. The second communication mode may be a MISO or MIMO mode. The second transceiver may be a second satellite or a terrestrial repeater. | 10-09-2008 |
| 20080261522 | Multi-Antenna Satellite System With Wireless Interface To Vehicle - A wireless satellite communication device is provided according to one embodiment of the invention. The wireless satellite communication device may include one or more satellite antennas, one or more local antennas and circuitry. A satellite antenna may be configured to communicate with one or more satellites. The local antenna may be configured to communicate with one or more wireless user devices within the vicinity of the wireless satellite communication device. The local antennas may include a local antenna. The circuitry may be coupled with the satellite antenna and the local antenna and may be configured to receive data from the satellite antenna and transmit the data with the local antenna. The wireless satellite communication device may also include a solar panel configured to provide electrical power to at least the satellite antenna, the local antenna, and the circuitry. | 10-23-2008 |
| 20090034448 | MIMO SATELLITE SYSTEM - A satellite communication system is disclosed that utilizes multiple antenna for subscriber terminals to process streams. A first node relays a first stream between the ground station and the subscriber terminals. A second node relays the second lower information rate signal to the subscriber terminals. Spatial relationships are used to differentiate the first stream from the second stream. At least one of the first and second nodes includes a satellite, and the first and second nodes are separated by 50 miles or more. Optionally, frequency ranges for the first and second streams overlap in time. In some cases, the second stream can contain additional information where the second node is terrestrial. | 02-05-2009 |
| 20110176628 | SYMBOL TIMING RELATIVE OFFSET MULTI ANTENNA SYSTEM AND METHOD - A multi-antenna communication method. A transmitter accepts a plurality of n data sources, and a plurality of MT independent data streams are prepared for transmission through a plurality of MT different antennae. The transmitter introduces a sub-symbol offset between symbols in the plurality of MT independent data streams transmitted by adjacent ones of the plurality of MT different antennae. Receivers for receiving and processing the Mτ independent data streams are also provided. | 07-21-2011 |
| Patent application number | Description | Published |
|---|
| 20110010161 | MODELING COMPUTER APPLICATIONS AND STORAGE USED THEREBY - Embodiments of the invention provide a technique to model applications and storage used thereby. An aspect of the present invention is directed to a method for managing a computer system which includes at least one host computer and at least one storage system which are connected via a network, the at least one host computer having an application running thereon. The method comprises modeling an application running on a host of a computer system as an application object, which includes associating storage utilized by the application with the application object; tracking operation of the storage associated with the application object as a service being delivered by the storage to the application; and presenting result on the service being delivered by the storage to the application based on tracking the operation of the storage. | 01-13-2011 |
| 20110010445 | MONITORING APPLICATION SERVICE LEVEL OBJECTIVES - Embodiments of the invention provide a technique to model applications and storage used thereby, and to monitor application service level objectives. An aspect is directed to a method for managing a computer system which includes at least one host computer and at least one storage system which are connected via a network, the at least one host having an application running thereon. The method comprises modeling an application running on a host of a computer system as an application object, which includes associating storage utilized by the application with the application object; monitoring one or more application-based storage service level objectives for the storage utilized by the application, each service level objective being defined by a user to be threshold specific to the application; and alerting the user when any of the one or more service level objectives being monitored is violated. | 01-13-2011 |
| 20110010664 | FLEXIBLE REPORTING ON STORAGE RESOURCES - A method for providing flexible reporting for applications which utilize storage in at least one storage system comprises presenting a plurality of business views which aggregate application storage characteristics for a plurality of applications according to a reporting structure which is defined by a user, each of the business views being a hierarchical folder structure of the applications and a plurality of folders, wherein at least one folder in the hierarchical folder structure contains at least one of an application or another folder; for each of the business views, presenting the applications and folders as a plurality of nodes which are selectable by the user; and in response to a selection of one of the nodes from the plurality of business views and a report type specified by the user, generating a report based on the report type of the selected node, the report aggregating any of the application storage characteristics for the selected node according to the report type. | 01-13-2011 |
| Patent application number | Description | Published |
|---|
| 20090030874 | Techniques for Optimizing SQL Statements Using User-Defined Indexes with Auxiliary Properties - In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs. From the plurality of execution plans, the query optimizer selects an optimal execution plan that is associated with an optimal total cost of the plurality of total costs. | 01-29-2009 |
| 20090030883 | Techniques for Extending User-Defined Indexes with Auxiliary Properties - In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The one or more functions are operable to generate index entries of the user-defined index for the one or more auxiliary properties. The one or more auxiliary properties are different than, and in addition to, a primary property of the user-defined index that provides for evaluating a query operator. The database server receives a first statement that defines the user-defined index, where the first statement includes one or more parameters that define the one or more auxiliary properties. The database server invokes the one or more functions in response to the first statement, where the one or more functions when invoked generate and store the index entries of the user-defined index according to the one or more parameters that define the one or more auxiliary properties. | 01-29-2009 |
| 20090106219 | SQL Execution Plan Verification - Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed. | 04-23-2009 |
| 20090106306 | SQL Execution Plan Baselines - Approaches, techniques, and mechanisms are disclosed for maintaining a set of baseline query plans for a database command. Except in rare circumstances, a database server may only execute a command according to a baseline plan, even if the database server predicts that a different plan has a lower cost. The set of baseline plans are plans that, for one reason or another, have been determined to provide acceptable actual performance in at least one execution context. When the database server receives a request to execute a particular command, the database server, if possible, always executes the command according to the lowest predicted cost baseline plan. The database server may evolve the plan baseline to include additional plans by generating and testing new plans in response to new requests to execute the database command, or as part of a query optimization or tuning process. | 04-23-2009 |
| 20090106320 | Automatic Recognition and Capture of SQL Execution Plans - Approaches, techniques, and mechanisms are disclosed for capturing and utilizing information related to query plans exhibiting interesting characteristics. A database server receives a request to execute a command. The database server executes the command according to a query plan. In response to determining that the command matches one or more pre-defined criteria, the database server captures information related to the execution of the first command. The criteria may include, for example, whether or not the command is repeatable, the existence of bind variables, access of a particular object, high resource utilization, receipt from a particular user, client, or application, etc. The information recorded may include, for example, performance statistics collected during execution of the first plan, data indicating the execution context during execution of the first plan, and properties of the first plan. The recorded information may subsequently be utilized by the database server in executing other database other database commands. | 04-23-2009 |
| 20090106321 | Maintaining and Utilizing SQL Execution Plan Histories - Approaches, techniques, and mechanisms are disclosed for maintaining a history of query plans executed for a database command, along with information related to each query plan. A database server receives a request to execute a particular command. The database server determines a plan for executing the particular command. The database server adds first information to a plan history associated with the particular command. The plan history comprises information related to a plurality of plans that have been generated for the particular command. The first information may include, for example, properties of the plan (including an outline of the plan) as well as statistics collected during execution of the plan. The database server may implement techniques for periodically refreshing information in a plan history. The database server may also implement techniques for purging old or less important plans. | 04-23-2009 |
| Patent application number | Description | Published |
|---|
| 20110145704 | PROVIDING MULTIPLE VIEWS OF A BUSINESS PROCESS DEFINITION TO DIFFERENT VIEWS - In one embodiment, a method for providing multiple views of a business process definition includes storing a model of a business process, and providing different view points of the model to different classes of users. | 06-16-2011 |
| 20110202473 | Progressive Refinement Model for Business Processes - In one embodiment, a method for refining a business process model includes receiving business process data pertaining to a first phase of a business process definition from a first class of users, creating a model of a business process using the business process data received from the first class of users, receiving business process data pertaining to a second phase of the business process definition from a second class of users, and augmenting the model of the business process based on the business process data received from the second class of users. The method further includes iteratively refining the model of the business process in response to input provided by the first class of users and/or the second class of users. | 08-18-2011 |
| 20120005116 | MODELING OF BUSINESS PROCESS DATA - In one embodiment, a business process meta-model is defined that represents a business process. The business process meta-model includes control flow elements pertaining to a control flow of the business process, and annotation elements providing details for the control flow elements. | 01-05-2012 |
| Patent application number | Description | Published |
|---|
| 20080215546 | Time Series Search Engine - Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is organized into discrete events with normalized time stamps and the events are indexed by time and keyword. A search is received and relevant event information is retrieved based in whole or in part on the time indexing mechanism, keyword indexing mechanism, or statistical indices calculated at the time of the search. | 09-04-2008 |
| 20110208743 | MACHINE DATA WEB - Methods and apparatus consistent with the invention provide the ability to organize and build understandings of machine data generated by a variety of information-processing environments. Machine data is a product of information-processing systems (e.g., activity logs, configuration files, messages, database records) and represents the evidence of particular events that have taken place and been recorded in raw data format. In one embodiment, machine data is turned into a machine data web by organizing machine data into events and then linking events together. | 08-25-2011 |
| Patent application number | Description | Published |
|---|
| 20110153942 | REDUCING IMPLEMENTATION COSTS OF COMMUNICATING CACHE INVALIDATION INFORMATION IN A MULTICORE PROCESSOR - A processor may include several processor cores, each including a respective higher-level cache, wherein each higher-level cache includes higher-level cache lines; and a lower-level cache including lower-level cache lines, where each of the lower-level cache lines may be configured to store data that corresponds to multiple higher-level cache lines. In response to invalidating a given lower-level cache line, the lower-level cache may be configured to convey a sequence including several invalidation packets to the processor cores via an interface, where each member of the sequence of invalidation packets corresponds to a respective higher-level cache line to be invalidated, and where the interface is narrower than an interface capable of concurrently conveying all invalidation information corresponding to the given lower-level cache line. Each invalidation packet may include invalidation information indicative of a location of the respective higher-level cache line within different ones of the processor cores. | 06-23-2011 |
| 20110185125 | RESOURCE SHARING TO REDUCE IMPLEMENTATION COSTS IN A MULTICORE PROCESSOR - A processor may include several processor cores, each including a respective higher-level cache; a lower-level cache including several tag units each including several controllers, where each controller corresponds to a respective cache bank configured to store data, and where the controllers are concurrently operable to access their respective cache banks; and an interconnect network configured to convey data between the cores and the lower-level cache. The controllers may share access to an interconnect egress port coupled to the interconnect network, and may generate multiple concurrent requests to convey data via the shared port, where each of the requests is destined for a corresponding core, and where a datapath width of the port is less than a combined width of the multiple requests. The given tag unit may arbitrate among the controllers for access to the shared port, such that the requests are transmitted to corresponding cores serially rather than concurrently. | 07-28-2011 |
| Patent application number | Description | Published |
|---|
| 20090083399 | NETWORK TRAFFIC ROUTING - A service appliance is installed between production servers running service applications and service users. The production servers and their service applications provide services to the service users. In the event that a production server is unable to provide its service to users, the service appliance can transparently intervene to maintain service availability. To maintain transparency to service users and service applications, service users are located on a first network and production servers are located on a second network. The service appliance assumes the addresses of the service users on the second network and the addresses of the production servers on the first network. Thus, the service appliance obtains all network traffic sent between the production server and service users. While the service application is operating correctly, the service appliance forwards network traffic between the two networks using various network layers. | 03-26-2009 |
| 20090083443 | AUTONOMOUS SERVICE BACKUP AND MIGRATION - A service appliance is installed between a production server running a service applications and service users. Upon being connected with the production server, the service appliance contacts the production server and/or service application and automatically replicates the service data from the service application. As additional service data is added to or modified by the service application of the production server, the service appliance automatically updates its replica of the data. In the event that a production server is unable to provide its service to users, the service appliance can transparently intervene to maintain service availability using the replica of the data. When an operational production server is connected with the service appliance, the service appliance can automatically copy its service data to the service application of the operational production server. The operational production server can be the same as the original production server or a new production server. | 03-26-2009 |
| 20100192005 | Method and system for managing computer systems - A management system for a computer system is disclosed. The computer system operates or includes various products (e.g., software products) that can be managed in a management system or collectively by a group of management systems. Typically, the management system operates on a computer separate from the computer system being managed. The management system can make use of a knowledge base of causing symptoms for previously observed problems at other sites or computer systems. In other words, the knowledge base can built from and shared by different users across different products to leverage knowledge that is otherwise disparate. The knowledge base typically grows over time. The management system can use its ability to request information from the computer system being managed together with the knowledge base to infer a problem root cause in the computer system being managed. The computer system being managed can also request the management system to process its knowledge base for possible problem cause analysis. The management system can also continually identify persisting problem causing symptoms. | 07-29-2010 |
| Patent application number | Description | Published |
|---|
| 20100228597 | Transferring Targeting and Marketing Information from an Online Advertisement System - An online advertising system integrates third party agents to permit the third party agents to participate in auctions to bid on a per opportunity basis. An advertising exchange module receives requests for opportunities to serve online advertisements to users. In response, an advertising exchange module applies one or more business rules to determine third party agents that qualify to serve the online advertisement. A bid gateway module generates and transmits requests for bids to the third party agents. The bid gateway module then receives bids from the third party agents in response to the requests for bids. The advertising exchange module then selects an advertisement based on the bid. The online advertisement exchange system provides a unified marketplace to permit integrator networks to bid on both ads pursuant to guaranteed contracts and ads not subject to guaranteed contracts (e.g., non-guaranteed ads). The online advertisement system further includes traffic management to allow the third parties to regulate bid requests sent from the online advertisement system. In some embodiments, the online advertising system caches bids, to efficiently implement the per opportunity auction, and transmits information, such as targeting information, to the third party agents to aid in the third party agents' formulation of bids. | 09-09-2010 |
| 20100228641 | Bid Gateway Architecture for an Online Advertisement Bidding System - An online advertising system integrates third party agents to permit the third party agents to participate in auctions to bid on a per opportunity basis. An advertising exchange module receives requests for opportunities to serve online advertisements to users. In response, an advertising exchange module applies one or more business rules to determine third party agents that qualify to serve the online advertisement. A bid gateway module generates and transmits requests for bids to the third party agents. The bid gateway module then receives bids from the third party agents in response to the requests for bids. The advertising exchange module then selects an advertisement based on the bid. The online advertisement exchange system provides a unified marketplace to permit integrator networks to bid on both ads pursuant to guaranteed contracts and ads not subject to guaranteed contracts (e.g., non-guaranteed ads). The online advertisement system further includes traffic management to allow the third parties to regulate bid requests sent from the online advertisement system. In some embodiments, the online advertising system caches bids, to efficiently implement the per opportunity auction, and transmits information, such as targeting information, to the third party agents to aid in the third party agents' formulation of bids. | 09-09-2010 |
| 20110035259 | COST AND PARTICIPATION MODELS FOR EXCHANGE THIRD-PARTY INTEGRATION IN ONLINE ADVERTISING - A modeling system to evaluate cost-based viability of a real-time, auction-based advertising system with third-party integration includes an exchange server configured to receive advertising bids, create bid requests to third-party entities based thereon, and select a winning bid from responses to the requests. A computer, coupled with the exchange server: computes a plurality of valid paths from publishers to and from the third-party entities through the exchange server; estimates server and network costs, including fixed hardware costs and variable operational costs, amortized over a predetermined period of time, based on a number of average queries per second (QPS) transmitted at different portions of the valid paths; compares current periodic fees paid by the third-party entities to the amortized costs, to determine cost-based system viability; and determines updates, if needed, to the periodic fees based on the plurality of costs to maintain cost-based system viability. | 02-10-2011 |
| 20110208559 | Automatic Management of Networked Publisher-Subscriber Relationships - Automatic management of networked publisher-subscriber relationships in an advertising server network. The method comprises steps for constructing a directed graph representation comprising at least one publisher node (e.g. an Internet property), at least one subscriber node (e.g. an Internet advertiser), at least one intermediary node (e.g. an Internet advertising agent), and at least one edge (e.g. an advertising target predicate) wherein any one of the edges is directly associated with at least one target predicate. The directed graph representation is used in conjunction with an inverted index for retrieving a valid node list comprising only nodes having at least one target predicate that matches at least one event predicate. The event predicate (as well as any target predicate) is any arbitrarily complex Boolean expression, and is used in producing a result node list comprising only nodes that concurrently match the event predicate with an advertising target predicate and are reachable. | 08-25-2011 |
| Patent application number | Description | Published |
|---|
| 20100160464 | Zeolite Supported Cobalt Hybrid Fischer-Tropsch Catalyst - A method for forming a catalyst for synthesis gas conversion comprises impregnating a zeolite extrudate using a solution, for example, a substantially non-aqueous solution, comprising a cobalt salt to provide an impregnated zeolite extrudate and activating the impregnated zeolite extrudate by a reduction-oxidation-reduction cycle. | 06-24-2010 |
| 20100312030 | PROCESS OF SYNTHESIS GAS CONVERSION TO LIQUID FUELS USING SYNTHESIS GAS CONVERSION CATALYST AND NOBLE METAL-PROMOTED ACIDIC ZEOLITE HYDROCRACKING-HYDROISOMERIZATION CATALYST - A process is disclosed for converting a feed comprising synthesis gas to liquid hydrocarbons within a single reactor at essentially common reaction conditions. The synthesis gas contacts a first catalyst bed comprising a synthesis gas conversion catalyst, and a second catalyst bed comprising a mixture of a hydrogenation catalyst and a solid acid catalyst. A Fischer-Tropsch wax is formed over the first catalyst bed and the wax is then hydrocracked and hydroisomerized over the second catalyst bed, resulting in liquid hydrocarbons substantially free of solid wax. | 12-09-2010 |
| 20110118368 | PROCESS OF SYNTHESIS GAS CONVERSION TO LIQUID FUELS USING MIXTURE OF SYNTHESIS GAS CONVERSION CATALYST AND DUAL FUNCTIONALITY CATALYST - A process is disclosed for converting a feed comprising synthesis gas to liquid hydrocarbons within a single reactor at essentially common reaction conditions. The synthesis gas contacts a catalyst bed comprising a mixture of a synthesis gas conversion catalyst on a support containing an acidic component and a dual functionality catalyst including a hydrogenation component and a solid acid component. The hydrocarbons produced are liquid at about 0° C., contain at least 25% by volume C | 05-19-2011 |
| 20110124750 | ZEOLITE SUPPORTED COBALT HYBRID FISCHER-TROPSCH CATALYST - A method for performing synthesis gas conversion is disclosed which comprises contacting synthesis gas with a hybrid Fischer-Tropsch catalyst formed by impregnating a ZSM-12 zeolite extrudate using a solution, for example, a substantially non-aqueous solution, comprising a cobalt salt and activating the impregnated zeolite extrudate by a reduction-oxidation-reduction cycle. The method results in reduced methane yield and increased yield of liquid hydrocarbons substantially free of solid wax. | 05-26-2011 |
| 20110160315 | PROCESS OF SYNTHESIS GAS CONVERSION TO LIQUID HYDROCARBON MIXTURES USING SYNTHESIS GAS CONVERSION CATALYST AND HYDROISOMERIZATION CATALYST - A process is disclosed for converting synthesis gas to a liquid hydrocarbon mixture useful as distillate fuel and/or lube base oil which is substantially free of solid wax. A synthesis gas feed is contacted with a synthesis gas conversion catalyst in an upstream bed and a hydroisomerization catalyst containing a metal promoter and an acidic component in a downstream bed within a single reactor at essentially common reaction conditions. A Fischer-Tropsch wax is formed over the synthesis gas conversion catalyst and said wax is subsequently hydroisomerized over the hydroisomerization catalyst, thereby resulting in a liquid hydrocarbon mixture having a desirable product distribution. | 06-30-2011 |
| 20110240288 | PROCESS AND SYSTEM FOR BLENDING SYNTHETIC AND NATURAL CRUDE OILS DERIVED FROM OFFSHORE PRODUCED FLUIDS - A process and system are described for the processing of gas associated with crude oil production, i.e. associated gas. A separation complex is used to separate produced fluids produced from a hydrocarbon reservoir into crude oil, liquefied petroleum gas, water, and natural gas. At least a portion of the natural gas is converted into synthesis gas in a synthesis gas generator. A combination of a synthesis gas conversion catalysts and hydroconversion catalysts are used in a synthesis gas reactor to convert the synthesis gas into a liquid effluent stream containing liquefied petroleum gas and a synthetic crude oil. The liquefied petroleum gas and synthetic crude oil from the synthesis gas reactor is sent to the separation complex. Liquefied petroleum gas is separated both from the synthetic crude oil and a natural crude oil obtained from the produced fluids. The system and process permits synthetic crude oil to be blended with the natural crude oil producing a blended stabilized crude oil having 2 wt % or more of the synthetic crude oil and with a pour point of 60° C. or less. Use of a common facility for separation operations on the natural crude oil and synthetic crude oil thus reduces capital costs and allows converted associated gases to be shipped with the natural crude oil on a conventional crude oil tanker. | 10-06-2011 |
| 20110306685 | PROCESS AND SYSTEM FOR REDUCING THE OLEFIN CONTENT OF A FISCHER-TROPSCH PRODUCT STREAM - A method is provided for converting synthesis gas to liquid hydrocarbon mixtures useful as distillate fuel and/or lube base oil containing no greater than about 25 wt % olefins and containing no greater than about 5 wt % C | 12-15-2011 |
