Patent application number | Description | Published |
20100079722 | OPTHALMIC PROGRESSIVE ADDITION LENS WITH CUSTOMIZED DESIGN FEATURE - A method for manufacturing an ophthalmic progressive addition lens ( | 04-01-2010 |
20120300172 | Process for Designing an Ophthalmic Progressive Eyeglass - A process for designing an ophthalmic progressive eyeglass comprises providing an initial front surface and an initial back surface. Respective addition values of front and back surfaces of the eyeglass are varied based on said initial front and back surfaces using a surface derivation tool. These surface addition values are selected so that the eyeglass exhibits an eyeglass addition value which matches a wearer's prescription and a value for a design feature which matches a target value. Said target value may be used for customizing the ophthalmic progressive eyeglass. The process does not require point-to-point surface optimization. | 11-29-2012 |
20130038833 | PROGRESSIVE MULTIFOCAL OPHTHALMIC LENS - The invention relates to a finished or semi-finished lens which comprises: a disc containing all the points of the lens that have the same abscissa and the same ordinate as points located within a circle in the reference plane having a diameter of 30 millimetres and centred on the prism reference point; a progression length of less than 14.5 millimetres; a first specific point having a cylinder value equal to the maximum cylinder value of all the points of the lens located in the nasal area and in the disc; and a second specific point having a cylinder value equal to the maximum cylinder value of all the points of the lens located in the temporal area and in the disc; a first ratio between: the maximum gradient of the cylinder for the points of the lens that have the same abscissa and the same ordinate as the points located on segments connecting the mounting cross to the first and second specific points, and surface addition of less than 0.095 per millimetre; and a second ratio between: the maximum cylinder value of the first and second specific points, and surface addition of no more than 0.85. The invention enhances the comfort of the wearer. | 02-14-2013 |
20130148078 | PROGRESSIVE MULTIFOCAL OPHTHALMIC LENS - The invention relates to a lens having certain properties, including: a circle grouping together all the points of the lens having the same abscissa and the same ordinate as points located on a circle in the reference plane, having a diameter of 35 millimetres and centred on a point located 8.5 millimetres below the mounting cross and horizontally offset on the nasal side by 1.25 millimetres; a disc grouping together all the points of the lens having the same abscissa and the same ordinate as points located inside said circle; a progression length of less than 14.5 millimetres; a ratio difference between the value of the cylinder and the surface addition of less than 0.2 as an absolute value for every pair of points of the lens that are symmetrical relative to the mounting cross and have the same ordinate as the mounting cross, and an abscissa with an absolute value of less than 20 millimetres; a first ratio between: the maximum cylinder value for all the points of the circle; and the surface addition of less than 0.7; and a second ratio between: the maximum cylinder value for all the points of the disc; and the surface addition of no more than 1.05. The invention is suitable for improving the comfort of the wearer. | 06-13-2013 |
Patent application number | Description | Published |
20080222159 | DATABASE SYSTEM WITH ACTIVE STANDBY AND NODES - A system includes an active node and a standby node and zero or more replica nodes. Each of the nodes includes a database system, such as an in-memory database system. Client updates applied to the active node are written through to the standby node, and the standby node writes the updates through to a primary database and updates the replica nodes. Commit ticket numbers tag entries in transaction logs and are used to facilitate recovery if either of the active node or the standby node fails. Updates applied to the primary database are autorefreshed to the active node and written through by the active node to the standby node which propagates the updates to the replica nodes. Bookmarks are used to track updated records of the primary database and are used to facilitate recovery if either of the active node or the standby node fails. | 09-11-2008 |
20110072217 | Distributed Consistent Grid of In-Memory Database Caches - A plurality of mid-tier databases form a single, consistent cache grid for data in a one or more backend data sources, such as a database system. The mid-tier databases may be standard relational databases. Cache agents at each mid-tier database swap in data from the backend database as needed. Consistency in the cache grid is maintained by ownership locks. Cache agents prevent database operations that will modify cached data in a mid-tier database unless and until ownership of the cached data can be acquired for the mid-tier database. Cache groups define what backend data may be cached, as well as a general structure in which the backend data is to be cached. Metadata for cache groups is shared to ensure that data is cached in the same form throughout the entire grid. Ownership of cached data can then be tracked through a mapping of cached instances of data to particular mid-tier databases. | 03-24-2011 |
20120284228 | User-Defined Parallelization in Transactional Replication of In-Memory Database - A replication track is a designated group of transactions that are to be replicated at a destination database in a way that, with respect to any other transaction in the replication track, preserves transactional dependency. Further, transactions in a replication track can be replicated at the destination database without regard to transactional dependency of other transactions in another track. This facilitates concurrent parallel replication of transactions of different tracks. Replicating data in this manner is referred to herein as track replication. An application may request execution of transactions and designate different tracks for transactions. | 11-08-2012 |
20130060780 | Column Domain Dictionary Compression - In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table. | 03-07-2013 |
20130198249 | DISTRIBUTED CONSISTENT GRID OF IN-MEMORY DATABASE CACHES - A plurality of mid-tier databases form a single, consistent cache grid for data in one or more backend data sources, such as a database system. The mid-tier databases may be standard relational databases. Cache agents at each mid-tier database swap in data from the backend database as needed. Ownership locks maintain consistency in the cache grid. Cache agents prevent database operations that will modify cached data in a mid-tier database unless and until ownership of the cached data can be acquired for the mid-tier database. Cache groups define what backend data may be cached, as well as a general structure in which the backend data is to be cached. Metadata for cache groups is shared to ensure that data is cached in the same form throughout the entire grid. Ownership of cached data can then be tracked through a mapping of cached instances of data to particular mid-tier databases. | 08-01-2013 |
20140280373 | AUTOMATICALLY DETERMINING AN OPTIMAL DATABASE SUBSECTION - A method, apparatus, and system for automatically determining an optimal database subsection is provided. A database subsection is selected to optimize certain benefits when the database subsection is translated, transferred, and cached on an alternative database system, which may utilize a different technology or database engine that provides certain performance benefits compared to the original database system. Algorithms such as multi-path greedy selection and/or dynamic programming may provide optimal or near-optimal results. A host for the alternative database server may be shared with or otherwise located in close physical proximity to improve latency for a database application or client layer. Once the database subsection analysis is completed, a report may be generated and presented to the user, and an implementation script may also be created to automatically configure a client host to function as a cache or replacement system according various cache size configurations described in the report. | 09-18-2014 |