Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Burukhin
Alexander Burukhin, Moscow RU
| Patent application number | Description | Published |
|---|---|---|
| 20080206554 | Hydroxyapatite With Controllable Size And Morphology - A ceramic powder of non-agglomerated non-aggregated phase-pure hydroxyapatite having a controllable morphology. Also presented is a film of phasepure crystalline hydroxyapatite grains having a controllable morphology. Methods for preparing the same are also provided. | 08-28-2008 |
Alexander Burukhin, Novosibirsk RU
| Patent application number | Description | Published |
|---|---|---|
| 20110114313 | HETEROGENEOUS PROPPANT PLACEMENT IN A FRACTURE WITH REMOVABLE CHANNELANT FILL - A method of heterogeneous proppant placement in a subterranean fracture is disclosed. The method comprises injecting well treatment fluid including proppant ( | 05-19-2011 |
Anatoliy Burukhin, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090315744 | DYNAMIC CHARACTER ENCODING - In one embodiment, a computing device may compress a text file for storage by dynamically creating an encoding table. A storage device of the computing device may store an encoding table populated by string characters from a text file. A processor of the computing device may encode the text file by replacing a string character in a text string of the text file with a table index position of that string character in the encoding table. The processor of the computing device may decode the text file by replacing the table index position with the string character at the table index position in the encoding table. | 12-24-2009 |
| 20100251227 | BINARY RESOURCE FORMAT AND COMPILER - Optimization architecture for applications that uses a localization model in which localizable resources are separated from code. The resources are typically located in separate DLL files as binary blobs in a unique format. The format is designed for optimized performance and to accommodate various requirements of complex office applications. The binary blobs are produced by a resource compiler based on the format. The architecture includes a resource binary format that facilitates resource identification and lookup, optimization of memory paging by grouping and ordering resources according to runtime use, optimization by compressing resources with an optimal algorithm that is fast in decompression, fast reverse lookup of a resource identifier by resource content, resource grouping, resource substitution, branding, and resource runtime metadata (also referred to as user data). | 09-30-2010 |
Anatoliy Burukhin, Issaquah, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090094609 | DYNAMICALLY PROVIDING A LOCALIZED USER INTERFACE LANGUAGE RESOURCE - Technologies are described herein for dynamically providing a localized user interface (“UI”) resource. A localization framework includes a resource manager, resource sets, and resource readers. The resource manager exposes an application programming interface (“API”) to application programs for requesting a localized UI resource from the resource manager. When the resource manager receives a request for a localized UI resource on the API, the resource manager queries the resource sets for the requested resource. If the first resource set is unable to provide the requested localized UI resource, another resource set may be queried. Multiple resource readers within each resource set may also be configured to provide flexibility in how UI resources are loaded and processed. | 04-09-2009 |
| 20090222479 | UNIFIED FORMATS FOR RESOURCES AND REPOSITORIES FOR MANAGING LOCALIZATION - Tools and techniques for unified formats for resources and repositories for managing localization are described herein. The unified resource repositories may include representations of any number of resources, the resources representing textual information that is displayable in user interface presented by software applications. The representations of the resources may include respective data tags that are associated with name attributes identifying the resources, value tags providing values of the resources. Meta tags provide recursive nesting mechanisms for associating the name attribute and the value tag with additional instances of name attributes and value tags. | 09-03-2009 |
| 20090222787 | REPOSITORIES AND RELATED SERVICES FOR MANAGING LOCALIZATION OF RESOURCES - Tools and techniques for repositories and related services for managing localization of resources are described herein. These repositories may include representations of resources provided in first human languages, representations of software products that may incorporate these resources; and representations of other human languages into which the resources are localized. The repositories may relate the resources to the software products and to the other human languages. Methods provided by these tools may receive the resources as provided in the first human languages, send the resources for localization into other human languages, and receive localized resources. The methods may convert the localized resources into binary representations, and build software products that incorporate the binary representations. The tools may also provide systems that include processors, suitable bus systems, and computer-readable storage media that contains the resource repository. | 09-03-2009 |
Anatoly Burukhin, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100293176 | RANGE INCLUSIVE PROBE ALGORITHM - A range inclusive probe algorithm for searching sorted, partially sorted, or unsorted data arrays is provided. The range inclusive probe algorithm begins like a binary array searching for a value with interactive range reduction. The search is continued even if the value is not found during the initial pass applying the same technique to the remaining ranges if the array is unsorted. Every element of the array may be checked once if the sought value is not in the array, but due to the binary approach at the beginning, search speed is higher than a linear search. | 11-18-2010 |