Kokhan
Alexander Kokhan, Tarzana, CA US
Patent application number | Description | Published |
---|---|---|
20150246293 | Electrical construction toy system - An electrical construction toy system is comprised of a flat base having a large surface area and a detachable central power block, which includes a battery or DC transformer from which electrical power is provided to building blocks which modularly connect to the power block and each other. The connection between blocks does not have to only be mechanical, but can be magnetic as well. The building blocks may provide electrical connections from the power block to one or more additional building blocks in varying directions. The connections conduct electricity and some building blocks also provide powered effects, such as lighting, sound, and motion effects. In addition, there are several switch blocks to operate the lighting, sound, and motion by a wireless remote control | 09-03-2015 |
Artsiom Kokhan, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20120310887 | AUTOMATIC CONFIGURATION OF A RECOVERY SERVICE - A secondary location is configured as a recovery service for a primary location of the service. The secondary location is maintained in a warm state that is configured to replace the primary location in a case of a failover. During normal operation, the secondary location is automatically updated to reflect a current state of the primary location that is actively servicing user load. Content changes to the primary location are automatically reflected to the secondary location. System changes applied to the primary location are automatically applied to the secondary location. For example, removing/adding machines, updating machine/role assignments, removing adding/database are automatically applied to the secondary location such that the secondary location substantially mirrors the primary location. After a failover to the secondary location, the secondary location becomes the primary location and begins to actively service the user load. | 12-06-2012 |
20120311376 | RECOVERY SERVICE LOCATION FOR A SERVICE - A secondary location of a network acts as a recovery network for a primary location of the service. The secondary location is maintained in a warm state that is configured to replace the primary location in a case of a failover. During normal operation, the primary location actively services user load and performs backups that include full backups, incremental backups and transaction logs that are automatically replicated to the secondary location. Information is stored (e.g. time, retry count) that may be used to assist in determining when the backups are restored correctly at the secondary location. The backups are restored and the transaction logs are replayed at the secondary location to reflect changes (content and administrative) that are made to the primary location. After failover to the secondary location, the secondary location becomes the primary location and begins to actively service the user load. | 12-06-2012 |
Artsiom Ivanovic Kokhan, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20120179668 | SEARCH INDEX FORMAT OPTIMIZATIONS - A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance. | 07-12-2012 |
Artsiom Ivanovich Kokhan, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090313238 | SEARCH INDEX FORMAT OPTIMIZATIONS - A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance. | 12-17-2009 |
20100191707 | TECHNIQUES FOR FACILITATING COPY CREATION - Various techniques are disclosed for creating a snapshot of application data. A snapshot is taken by pausing parts of the application over time. Modifications are paused to a first part of data and the first part is copied into a snapshot. After the first part has finished copying, modifications are paused to remaining data, and the remaining data is copied. The application is unpaused. A snapshot can be taken by unpausing parts of the application over time. Modifications to data in an application are paused. A first part of data is copied, and after the first part has finished copying, modifications to the first part are unpaused. The final part of data is copied, and after the final part has finished copying, modifications to the final part are unpaused. Techniques for creating a snapshot of data residing in multiple locations are described. | 07-29-2010 |
20150066899 | SEARCH INDEX FORMAT OPTIMIZATIONS - A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance. | 03-05-2015 |