Patent application number | Description | Published |
20090019767 | HEAT INTEGRATION AND CONDENSATE TREATMENT IN A SHIFT FEED GAS SATURATOR - Systems and processes for adjusting hydrogen content of a synthesis gas are provided. At least a portion of carbon monoxide in a syngas can be converted to carbon dioxide to provide a shifted syngas and condensed water. The syngas can have a first hydrogen to carbon monoxide ratio and a first temperature, and the shifted syngas can have a second hydrogen to carbon monoxide ratio and a second temperature, both greater than the first. Heat from the shifted syngas can be at least partially transferred from the shifted syngas to the condensed water to at least partially vaporize the condensed water. The syngas can be at least partially saturated with the at least partially vaporized condensed water. A ratio of the water vapor to syngas can be about 1.0 or less. | 01-22-2009 |
20090188165 | LOW OXYGEN CARRIER FLUID WITH HEATING VALUE FOR FEED TO TRANSPORT GASIFICATION - Systems and processes for producing synthesis gas. A carbonaceous feedstock can be combined with one or more low-oxygen carrier fluids having a high heating value. The feedstock and carrier fluid, in the presence of one or more oxidants, can be gasified to provide a synthesis gas. In one or more embodiments, at least a portion of the synthesis gas can be recycled for use as the carrier fluid. | 07-30-2009 |
20100011664 | SYSTEMS AND METHODS FOR PRODUCING SUBSTITUTE NATURAL GAS - Systems and methods for producing synthetic natural gas are provided. The method can include gasifying a carbonaceous feedstock within a gasifier to provide a raw syngas. The raw syngas can be cooled to provide a cooled raw syngas. The cooled raw syngas can be processed in a purification system to provide treated syngas. The purification system can include a flash gas separator in fluid communication with the gasifier and a saturator. The treated syngas can be converted to synthetic natural gas to provide steam, a methanation condensate, and a synthetic natural gas. The methanation condensate can be introduced to the flash gas separator. | 01-21-2010 |
20110210292 | Gasification System And Process For Maximizing Production Of Syngas and Syngas-Derived Products - A gasification system and method. The system can include a gasifier and a purification unit fluidly coupled to the gasifier, with the purification unit receiving raw syngas from the gasifier and producing waste gas and a syngas product. The system can also include a first reformer fluidly coupled to the purification unit, with the first reformer receiving a first portion of the waste gas and producing reformed hydrocarbon. The system can further include a second reformer having a first inlet fluidly coupled to the purification unit, a second inlet fluidly coupled to the first reformer, and an outlet fluidly coupled to the purification unit. The second inlet can receive the reformed hydrocarbon from the first reformer, and the first inlet can receive a second portion of the waste gas from the purification unit. The second reformer can produce a recovered raw syngas that is directed to the purification unit. | 09-01-2011 |
20120101323 | SYSTEMS AND METHODS FOR PRODUCING SUBSTITUTE NATURAL GAS - Systems and methods for producing synthetic natural gas are provided. The method can include gasifying a carbonaceous feedstock within a gasifier to provide a raw syngas. The raw syngas can be cooled to provide a cooled raw syngas. The cooled raw syngas can be processed in a purification system to provide treated syngas. The purification system can include a flash gas separator in fluid communication with the gasifier and a saturator. The treated syngas can be converted to synthetic natural gas to provide steam, a methanation condensate, and a synthetic natural gas. The methanation condensate can be introduced to the flash gas separator. | 04-26-2012 |
20130055637 | Systems And Methods For Producing Substitute Natural Gas - Systems and methods for processing a hydrocarbon are provided. The method can include gasifying a feedstock within a gasifier to provide a raw syngas. The raw syngas can be processed within a purification system to provide a treated syngas. A first portion of the treated syngas can be converted into a first effluent in a first methanator. The first effluent can be mixed with a second portion of the treated syngas to provide a first mixed effluent. The first mixed effluent can be converted into a second effluent in a second methanator. The second effluent can be mixed with a third portion of the treated syngas to provide a second mixed effluent. The second mixed effluent can be converted into a third effluent in a third methanator. | 03-07-2013 |
20140117287 | Systems And Methods For Producing Substitute Natural Gas - Systems and methods for producing synthetic gas are provided. The method can include gasifying a carbonaceous feedstock in the presence of an oxidant within a gasifier to provide a raw syngas. The raw syngas can be cooled within a cooler to provide a cooled syngas. The cooled syngas can be processed within a purification system to provide a treated syngas. The purification system can include a saturator adapted to increase a moisture content of the cooled syngas. The treated syngas and a first heat transfer medium can be introduced to a methanator to provide a synthetic gas, a second heat transfer medium, and a methanation condensate. At least a portion of the methanation condensate can be recycled from the methanator to the saturator. | 05-01-2014 |
20150034876 | Systems And Methods For Producing Substitute Natural Gas - Systems and methods for producing synthetic gas are provided. The method can include gasifying a carbonaceous feedstock in the presence of an oxidant within a gasifier to provide a raw syngas. The raw syngas can be cooled within a cooler to provide a cooled syngas. The cooled syngas can be processed within a purification system to provide a treated syngas. The purification system can include a saturator adapted to increase a moisture content of the cooled syngas. The treated syngas and a first heat transfer medium can be introduced to a methanator to provide a synthetic gas, a second heat transfer medium, and a methanation condensate. At least a portion of the methanation condensate can be recycled from the methanator to the saturator. | 02-05-2015 |
Patent application number | Description | Published |
20090005728 | THERAPY DELIVERY SYSTEM HAVING AN OPEN ARCHITECTURE AND A METHOD THEREOF - A therapy delivery system having an open architecture and method of providing thereof are disclosed. The present invention provides a therapy dosage module having a control algorithm that can be replaced with a predefined or independently defined control algorithm. The tools necessary to create and test such control algorithms in the therapy dosage module in a simulated environment before implementing it in a live therapy system are also disclosed. | 01-01-2009 |
20090006061 | SYSTEM FOR DEVELOPING PATIENT SPECIFIC THERAPIES BASED ON DYNAMIC MODELING OF PATIENT PHYSIOLOGY AND METHOD THEREOF - A system for developing patient-specific therapies based on dynamic modeling of patient-specific physiology and method thereof are disclosed. The system includes software modules configured to provide access via a computer to one or more data collection protocols defining at least a type of patient-specific data to be collected and a manner in which the patient-specific data is to be collected, and to information from which one or more patient-specific models, configured to simulate one or more aspects of the patient's physiology, is developed. Another software module of the system is configured to provide access via the computer to one or more software tools that apply patient-specific data, collected according to the one or more data collection protocols, to the one or more patient specific models to determine therefrom one or more patient-specific therapies. | 01-01-2009 |
20090006129 | Medical Diagnosis, Therapy, And Prognosis System For Invoked Events And Methods Thereof - A diagnosis, therapy and prognosis system (DTPS) and method thereof to help either the healthcare provider or the patient in diagnosing, treating and interpreting data are disclosed. The apparatus provides data collection based on protocols, and mechanism for testing data integrity and accuracy. The data is then driven through an analysis engine to characterize in a quantitative sense the metabolic state of the patient's body. The characterization is then used in diagnosing the patient, determining therapy, evaluating algorithm strategies and offering prognosis of potential use case scenarios. | 01-01-2009 |
20120116347 | THERAPY DELIVERY SYSTEM HAVING AN OPEN ARCHITECTURE AND A METHOD THEREOF - A therapy delivery system having an open architecture and method of providing thereof are disclosed. The present invention provides a therapy dosage module having a control algorithm that can be replaced with a predefined or independently defined control algorithm. The tools necessary to create and test such control algorithms in the therapy dosage module in a simulated environment before implementing it in a live therapy system are also disclosed. | 05-10-2012 |
20150377828 | METHODS OF FAILSAFING ELECTROCHEMICAL MEASUREMENTS OF AN ANALYTE AS WELL AS DEVICES, APPARATUSES AND SYSTEMS INCORPORATING THE SAME - Methods are disclosed for measuring an analyte concentration in a fluidic sample. Such methods further allow one to provide an error code or correct and/or compensate for interferents such as an antioxidant before providing an analyte concentration. The measurement methods utilize information obtained from test sequences having at least one DC block, where DC block includes at least one recovery potential, and where a closed circuit condition of the electrode system is maintained during the DC block. The methods use information relating to status of a redox mediator during the electrochemical analysis to provide a statistical antioxidant failsafe using either a classifier or a discriminator to determine whether the antioxidant is interfering with the analyte concentration. Also disclosed are devices, apparatuses and systems incorporating the various measurement methods. | 12-31-2015 |
Patent application number | Description | Published |
20090198702 | SYNCHRONIZATION INFRASTRUCTURE FOR NETWORKED DEVICES, APPLICATIONS AND SERVICES IN A LOOSELY COUPLED MULTI-MASTER SYNCHRONIZATION ENVIRONMENT - The subject disclosure relates to an efficient multi-master synchronization infrastructure is provided enabling loosely coupled networked client and server devices, applications and services to efficiently convey and receive synchronization knowledge across interconnecting network(s). A set of synchronization methods and standardized interfaces are also provided that enable rich offline application experiences and collaboration among devices, applications and services predicated on the efficient synchronization infrastructure. | 08-06-2009 |
20100100527 | FORGETTING ITEMS WITH KNOWLEDGE BASED SYNCHRONIZATION - Systems and methods that enable removal of data from an endpoint, while not propagating such removal to other endpoints when synchronizing data sources associated therewith. A designation component can indicate items as forgotten items, wherein such items are being known to an endpoint and deleted therefrom—yet, reintroduced therein and reappearing (e.g., as a create) upon re-synchronizing with the replica over again. Moreover, the forgotten items can employ additional metadata such as in from of an additional bit that indicates whether an item is a forgotten item. | 04-22-2010 |
20100106684 | SYNCHRONIZATION OF A CONCEPTUAL MODEL VIA MODEL EXTENSIONS - A method of synchronizing data between multiple endpoints each storing a copy of the data in accordance with different underlying schemas. An application model that provides a logical representation of an underlying schema is extended with a synchronization model that provides a logical representation of changes made to the data. The synchronization model comprises functions that provide synchronization information on the changes in a common format. Using such synchronization information, changes in a copy of the data stored in a first underlying schema on a first endpoints are applied to another copy of the data stored in a second underlying schema on a second endpoint in synchronization relationship with the first endpoint. | 04-29-2010 |
20110295796 | SYNCHRONIZATION OF SUBSETS OF DATA INCLUDING SUPPORT FOR VARYING SET MEMBERSHIP - An efficient way and general mechanism is provided to represent and exchange knowledge and/or partial knowledge across nodes when synchronizing between any two nodes including custom or move filters where set membership can change over time at a device as data items come in and out of filter scope. A first node sends a second node its knowledge and/or partial knowledge, including objects and versions of those objects. The second node compares its knowledge and/or partial knowledge with the knowledge and/or partial knowledge of the first node, and then sends the first node any latest versions of objects of which the first node is unaware. In addition, the second node sends its knowledge and/or partial knowledge to the first node. The first node then performs a similar object-by-object version comparison to determine any conflicts due to independent evolution of objects and any changes that can be sent to the second node in order to bring the objects of the second node up to date with the knowledge and/or partial knowledge of the first node. Replicas can track filters to efficiently support synchronizing with filtered replicas. Filter forgotten knowledge is also used to represent how recently a replica can guarantee to know which items have been in the filter. Ghosts can be used to represent items that have been in the filter recently but have currently moved out. Filter forgotten knowledge concept allows both new filters to be tracked when they are introduced into the community, as well as periodically cleaning up of tombstones and ghosts. | 12-01-2011 |
20120210017 | EFFICIENTLY ISOLATING MALICIOUS DATA REQUESTS - Embodiments are directed to efficiently routing data requests from a plurality of tenants and to using smart routing to limit service denials. In an embodiment, a gateway node receives data requests from a tenant subscriber requesting data for an indicated service. The gateway node determines which server node the received data requests are to be routed to. The determination evaluates various criteria associated with the data request. The gateway node queries the determined server node to determine the health of the server nodes and receives a reply from the determined server node indicating the server node's current operating status. The gateway node also, based on the determined server node's reply, routes the received data requests to the determined server node, according to the evaluated criteria. | 08-16-2012 |
20140250074 | FORGETTING ITEMS WITH KNOWLEDGE BASED SYNCHRONIZATION - Systems and methods that enable removal of data from an endpoint, while not propagating such removal to other endpoints when synchronizing data sources associated therewith. A designation component can indicate items as forgotten items, wherein such items are being known to an endpoint and deleted therefrom—yet, reintroduced therein and reappearing (e.g., as a create) upon re-synchronizing with the replica over again. Moreover, the forgotten items can employ additional metadata such as in from of an additional bit that indicates whether an item is a forgotten item. | 09-04-2014 |
Patent application number | Description | Published |
20090091568 | Three dimensional spatial engine in a relational database management system - Systems, methodologies, media, and other embodiments associated with a three dimensional spatial engine in an RDBMS are described. One example system includes logic to receive and store data representing a set of spatial features of a three dimensional geometry object. The example system may also include logic to validate the three dimensional geometry object and to provide a signal concerning the validity of the object. | 04-09-2009 |
20090094010 | Three dimensional surface and solid query processing - Systems, methods, and other embodiments associated with determining whether geometries represented by geometry objects intersect are described. One example method recursively decomposes a higher order geometry (e.g., solid) into a set of lower order geometries (e.g., surfaces) and examines the lower order geometries, continuing the recursion until an intersection decision is reached. The example method includes accessing geometry objects and accessing a spatial index that stores MBVs associated with the geometry objects. The method includes extracting candidate pairs of intersecting features upon determining MBVs associated with the geometry objects intersect and providing the candidate features to a feature-feature logic. The method includes providing an intersection signal based on a features intersection signal provided by the feature-feature logic. | 04-09-2009 |
20090187587 | Managing feature data based on spatial collections - Systems, methods, and other embodiments associated with registering a WFS feature type are described. One example method includes creating a feature instance table and a set of collection item tables to register the WFS feature type. Elements in the feature instance table and a collection item table may be related by a feature instance primary key value. The example method may also include producing an r-tree based spatial index for spatial content collection items stored in the set of collection item tables. The method may also include selectively processing a WFS request to manipulate (e.g., insert, delete, update) a WFS feature instance based, at least in part, on the feature instance table and the set of collection item tables. The method may also include selectively processing a WFS query associated with a WFS feature instance based, at least in part, on the r-tree based spatial index. | 07-23-2009 |
20090204632 | Triangulated irregular network - Methods and other embodiments associated with performing an in-memory triangulation of an arbitrarily large data set are described. One example method for performing in-memory triangulation of an arbitrarily large data set includes striping a data set into multiple stripes, selecting a first stripe to triangulate, and then performing an in-memory triangulation on the stripe. The method may also include removing certain triangles from the triangulated irregular network produced by the triangulation, merging another stripe with the leftover data, and repeating the process until the arbitrarily large data set has been triangulated piece-by-piece, with the triangulations occurring in memory. | 08-13-2009 |
20100091016 | Point in polyhedron - Systems, methods, and other embodiments associated with determining whether a point is located in a polyhedron are described. One example method includes identifying a ray that connects a query point to a second point located outside a minimum bounding volume of a solid polyhedron without intersecting a vertex of the solid polyhedron. The method includes counting crossings of planar faces of the solid polyhedron by the ray. The crossings may be mid-face crossings, edge crossings, and/or coplanar crossings. The crossings are selectively counted based on whether the ray actually crosses a face, grazes a face without crossing it, or runs coplanar with a face without crossing another face. The method includes controlling an automated process based on whether first point is inside the solid polyhedron. | 04-15-2010 |
20100281017 | Partition pruning via query rewrite - Systems, methods, and other embodiments associated with query pruning via query rewrite are described. One example method includes receiving a query on a partitioned table that will result in a first query plan that includes accessing a local domain index on each partition in the database. The query is rewritten to generate a second query that will result in a second query plan that includes accessing a global domain index instead of the local domain index on each partition in the database. | 11-04-2010 |
20100325382 | TRIANGULATED IRREGULAR NETWORK - Methods and other embodiments associated with performing an in-memory triangulation of a large data set are described. One example method for performing in-memory triangulation of a large data set includes partitioning a large geographical information data set into a set of stripes and generating, in-memory, a set of local triangulated irregular networks (TINs) corresponding to members of the set of stripes. Information associated with triangles associated with the set of local TINs are stored. | 12-23-2010 |
20120191682 | DATABASE SYSTEM THAT PROVIDES FOR HISTORY-ENABLED TABLES - Techniques for history enabling a table in a database system so that past versions of rows of the history-enabled table are available for temporal querying. The table is history enabled by adding a start time column to the table and creating a history table for the history-enabled table. The start time field's value in a row of the history-enabled table indicates when the contents of the row last changed. The rows of the history table are copies of rows of the history-enabled table that have been deleted or updated. The rows include end time fields whose values indicate when the row was updated or deleted. A history table's row thus indicates a period in which the history table's row was in the history-enabled table. Temporal queries are performed on a view which is the union of the history-enabled table and the history table. | 07-26-2012 |
20140052711 | CONSTRUCTING MULTIDIMENSIONAL HISTOGRAMS FOR COMPLEX SPATIAL GEOMETRY OBJECTS - Techniques are described for generating histograms for a multidimensional space. In the presence of large spatial objects, fuzzy splitting techniques are utilized to recursively divide the multidimensional space into partitions, where a single spatial object may belong to multiple partitions. Large spatial objects are essentially broken down into smaller objects that may allow for more efficient partitioning of the multidimensional space. A count of spatial objects in each partition yields a spatial histogram. A spatial object that belongs to multiple partitions may have a weighted count for each of the multiple partitions, based on the extent to which the spatial object overlaps with each partition. Thus, an object that is split among a handful of partitions will only contribute a fraction of a count to each partition. Small partitions having relatively few objects are avoided by refusing to subdivide a partition whose members drop below a threshold number. | 02-20-2014 |
20140244635 | Methods For Query Processing Of Topological Relationships Among Complex Spatial Objects - An optimized method of processing queries requesting a description of a spatial relationship between a test geometry and a query geometry, such as points, lines, polygons, and collections thereof, is disclosed. A first part of the method finds a first spatial relationship between a minimum bounding rectangle (MBR) of the test geometry and an In-Memory R-tree (IMR-tree) built to describe the query geometry. If the first relationship does not specify the requested description, then a second part of the method uses the IMR-tree of the query geometry to find a second spatial relationship between the test geometry itself and the query geometry. Optimizations are applied to the first part and to the second part. Optimizations in the second part depend on the test geometry. | 08-28-2014 |
20140250060 | IMPLEMENTING A MULTI-COLUMN/MULTI-ROW CONSTRAINT IN A RELATIONAL DATABASE TABLE - A method, system, and computer program product for implementing a multi-column/multi-row constraint. Lock techniques prevent access collisions even when two or more concurrently running software applications are attempting to insert rows into the same relational database table (subject to the same multi-column/multi-row constraints). The method commences by receiving (e.g., from a first process) a first row to be inserted into a relational database table where the row comprises at least two constrained columns corresponding to the multi-column/multi-row constraint, then receiving (e.g., from a second process) a second row to be inserted into the same table. Using column locks, the method recognizes the potential for conflicting row insertions, and manages locks to prevent conflicting access grants to the two constrained columns of the existing database table. The evaluation of the multi-column/multi-row constraint is performed over the first row to be inserted and a row or rows of the relational database table. | 09-04-2014 |
20150049944 | MEMORY-EFFICIENT SPATIAL HISTOGRAM CONSTRUCTION - Techniques are described for memory-efficient spatial histogram construction. A hierarchical spatial index has leaf nodes and non-leaf nodes, each leaf node representing a bounding region containing a spatial object, each non-leaf node representing a bounding region at least partially containing one or more spatial objects. A plurality of selected nodes is selected from the plurality of non-leaf nodes. The plurality of selected nodes includes an ancestor of each leaf node. For each particular node in the plurality of selected nodes, a weight is determined. The weight is based on the number of spatial objects contained within the bounding region of the particular node. A spatial partitioning of the plurality of selected nodes is determined. A spatial histogram is generated based on the spatial partitioning of the weights of the plurality of selected nodes. | 02-19-2015 |
20150149479 | Lidar Model With Hybrid-Columnar Format and No Indexes for Spatial Searches - A method and apparatus for querying a database table containing point spatial data and without indexes is provided. A request for point spatial data in the table includes a query window provided by the user and describing an area of interest in which the user desires the point spatial data contained therein. The query window is tiled to create interior tiles and boundary tiles. A first query is formed to determine the point spatial data contained in the interior tiles. A second query is formed to determine the point spatial data contained within the boundary tiles and also within the query window. The second query includes a function that tests to determine whether the point spatial data within a boundary tile also lies within the query window. The first and second queries are executed in part on an enhanced data storage device and the results joined and returned to the user in answer to the request. | 05-28-2015 |
20150161438 | FEATURE GENERALIZATION USING TOPOLOGICAL MODEL - Systems, methods, and other embodiments associated with feature generalization leveraging topological model functionality are described. In one embodiment, a method includes loading primitives associated with a first feature and a second feature into a topological model. The topological model may be an existing topological model or a topological model that is created by the feature generalization methods and systems described herein. The topological model stores primitives that are shared by the first feature and the second feature as a single unique shared primitive. The method includes generalizing respective primitives including at least one shared primitive to produce corresponding respective generalized primitives, and associating a generalized primitive corresponding to the shared primitive with the first feature and the second feature, while maintaining alignment across shared edges of adjacent features and hierarchical relationships between features. | 06-11-2015 |
20150254302 | INDEX-BASED OPTIMIZATION OF CONVEX HULL AND MINIMUM BOUNDING CIRCLE QUERIES - Systems, methods, and other embodiments associated with index-based optimization of geometric figured-related queries are described. In one embodiment, a method includes receiving two points selected from a corpus of spatial data. A hierarchical index on the data is accessed to choose candidate nodes. The index is a hierarchical arrangement of nodes arranged in paths from root node entries to leaf node entries such that each node is contained in all nodes in a path leading to the node. The method includes determining a spatial relationship between the two points and the candidate nodes in the index. The candidate nodes are a proper subset of the nodes in the index, such that the spatial relationship is not determined between the two points and some non-candidate nodes. A candidate node is selected based on the determined angles for processing related to construction of a geometric figure describing the spatial data. | 09-10-2015 |
20150317358 | Methods For Query Processing Of Topological Relationships Among Complex Spatial Objects - An optimized method of processing queries requesting a description of a spatial relationship between a test geometry and a query geometry, such as points, lines, polygons, and collections thereof, is disclosed. A first part of the method finds a first spatial relationship between a minimum bounding rectangle (MBR) of the test geometry and an In-Memory R-tree (IMR-tree) built to describe the query geometry. If the first relationship does not specify the requested description, then a second part of the method uses the IMR-tree of the query geometry to find a second spatial relationship between the test geometry itself and the query geometry. Optimizations are applied to the first part and to the second part. Optimizations in the second part depend on the test geometry. | 11-05-2015 |