Patent application number | Description | Published |
20110111283 | THREE-DIMENSIONAL BATTERIES AND METHODS OF MANUFACTURING THE SAME - Various methods and apparatus relating to three-dimensional battery structures and methods of manufacturing them are disclosed and claimed. In certain embodiments, a three-dimensional battery comprises a battery enclosure, and a first structural layer within the battery enclosure, where the first structural layer has a first surface, and a first plurality of conductive protrusions extend from the first surface. A first plurality of electrodes is located within the battery enclosure, where the first plurality of electrodes includes a plurality of cathodes and a plurality of anodes, and wherein the first plurality of electrodes includes a second plurality of electrodes selected from the first plurality of electrodes, each of the second plurality of electrodes being in contact with the outer surface of one of said first plurality of conductive protrusions. Some embodiments relate to processes of manufacturing energy storage devices with or without the use of a backbone structure or layer. | 05-12-2011 |
20120115026 | NEGATIVE ELECTRODE STRUCTURE FOR NON-AQUEOUS LITHIUM SECONDARY BATTERY - The present invention relates to a negative electrode structure for use in a non-aqueous electrolyte secondary battery and a method of making such negative electrode structure. The negative electrode structure comprises: a monolithic anode comprising a semiconductor material, and a uniform ion transport structure disposed at the monolithic anode surface for contacting a non-aqueous electrolyte, wherein the uniform ion transport structure serves as a current collector and the negative electrode structure does not contain another current collector. The present invention also relates to a battery comprising the negative electrode structure of the present invention, a cathode, and a non-aqueous electrolyte. | 05-10-2012 |
20130189602 | MICROSTRUCTURED ELECTRODE STRUCTURES - A structure for use in an energy storage device, the structure comprising a backbone system extending generally perpendicularly from a reference plane, and a population of microstructured anodically active material layers supported by the lateral surfaces of the backbones, each of the microstructured anodically active material layers having a void volume fraction of at least 0.1 and a thickness of at least 1 micrometer. | 07-25-2013 |
20140050969 | ELECTRODE STRUCTURES FOR THREE-DIMENSIONAL BATTERIES - An electrode structure for use in an energy storage device comprising a population of electrodes, a population of counter-electrodes and a microporous separator separating members of the electrode population from members of the counter-electrode population. Each member of the electrode population comprises an electrode active material layer and an electrode current conductor layer, and each member of the electrode population has a bottom, a top, a length L | 02-20-2014 |
20140272547 | SEPARATORS FOR THREE-DIMENSIONAL BATTERIES - An electrode structure for use in an energy storage device, the electrode structure comprising a population of electrodes, a population of counter-electrodes and an electrically insulating material layer separating members of the electrode population from members of the counter-electrode population, each member of the electrode population having a longitudinal axis A | 09-18-2014 |
20140329132 | MICROSTRUCTURED ELECTRODE STRUCTURES - A structure for use in an energy storage device, the structure comprising a backbone system extending generally perpendicularly from a reference plane, and a population of microstructured anodically active material layers supported by the lateral surfaces of the backbones, each of the microstructured anodically active material layers having a void volume fraction of at least 0.1 and a thickness of at least 1 micrometer. | 11-06-2014 |
20140335395 | IONICALLY PERMEABLE STRUCTURES FOR ENERGY STORAGE DEVICES - An electrochemical stack comprising carrier ions, an anode comprising an anode active material layer, a cathode comprising a cathode active material layer, a separator between the anode and the cathode comprising a porous dielectric material and a non-aqueous electrolyte, and an ionically permeable conductor layer located between the separator and an electrode active material layer. | 11-13-2014 |
Patent application number | Description | Published |
20130331119 | Global-Positioning System (GPS) Update Interval Based on Sensor - In one embodiment, a method includes transmitting at a pre-determined polling frequency an activation signal waking from a sleep mode an application on a mobile computing device and causing the application to activate a location service of the mobile computing device for a pre-determined sampling duration. The pre-determined polling frequency and the pre-determined sampling duration are determined at least in part by detecting a movement of the mobile computing device. The method also includes receiving location data from the mobile computing device after the pre-determined sampling duration. The location data is responsive to a transmission signal. | 12-12-2013 |
20140221013 | Routine Estimation - In one embodiment, a method includes determining a geo-location centroid of each of one or more geo-location clusters. The geo-location centroid corresponds to one or more geo-location data points within its geo-location cluster. The geo-location data points represent one or more location readings from a mobile computing device associated with a user. The geo-location centroids are based at least in part on location readings obtained during a particular time of day of a particular day of a week. The method also includes grouping one or more geo-location centroids into one or more groups; and determining a time-based routine based at least in part on a number of geo-location centroids within each group. | 08-07-2014 |
20140221022 | Grouping Ambient-Location Updates - In one embodiment, a method includes receiving location data from a mobile device associated with a user. The location data includes one or more location readings sent automatically and without manual input from the user. The method also includes representing the location data as one or more geo-location data points based at least in part on a distance between the location readings and the geo-location data points; and grouping one or more of the geo-location data points into one or more geo-location clusters based at least in part on a distance between each geo-location data point and a geo-location centroid of each geo-location cluster. | 08-07-2014 |
20140222810 | Pattern Labeling - In one embodiment, a method includes accessing a log associated with a user. The log includes a number of entries that each indicate a geo-location of the user at a point in time. The log spans a period of time and some of the entries are based on a geo-location determined and reported by a mobile computing device of the user without manual user input. The method also includes determining a pattern among the geo-locations of the user at the points in time; and determining for some of the geo-locations of the user at the points in time, a place corresponding to the geo-location; and inferring by the computing device a routine of the user based at least in part the pattern and the places. | 08-07-2014 |
20140222954 | Routine Deviation Notification - In one embodiment, a method includes determining a pattern among a number of geo-locations of a user over a period of time. Each geo-location is determined and reported by a mobile computing device of the user without manual user input. The method also includes determining a particular geo-location among the geo-locations in the pattern with a minimum distance to a current geo-location of the mobile computing device; determining a distance between the particular geo-location and the current geo-location; and sending a notification of the current geo-location to one or more other users in response to the distance being longer than a pre-determined deviation threshold value. One or more of the other users have a relationship to the user based at least in part on social-graph information associated with the user. | 08-07-2014 |
Patent application number | Description | Published |
20080232592 | Method and apparatus for performing selective encryption/decryption in a data storage system - One embodiment of the present invention provides a system for performing selective encryption/decryption in a data storage system. During operation, the system receives a data block from a storage medium at an input/output layer, wherein the input/output layer serves as an interface between the storage medium and a buffer cache. Next, the system determines whether the data block is an encrypted data block. If not, the system stores the data block in the buffer cache. Otherwise, if the data block is an encrypted data block, the system retrieves a storage-key, wherein the storage-key is associated with a subset of storage, which is associated with the encrypted data block. Using the storage-key, the system then decrypts the encrypted data block to produce a decrypted data block. Finally, the system stores the decrypted data block in the buffer cache, wherein the data block remains encrypted in the storage medium. | 09-25-2008 |
20080235291 | Readable physical storage replica and standby database system - A standby database system or another replica data system replicates changes, made to data blocks at a source database system or another primary data copy, to replicas of the data blocks at the standby database system or other replica. While replicating the changes to the data blocks thereof, the standby database system (or other replica) receives queries (or reads) issued thereto and computes the queries based on data read from the data blocks thereof. | 09-25-2008 |
20080235481 | Managing memory in a system that includes a shared memory area and a private memory area - A method and apparatus for auto-tuning memory is provided. Memory on a computer system comprises at least one shared memory area and at least one private memory area. Addresses in the shared memory area are accessible to multiple processes. Addresses in the private memory area are dedicated to individual processes. Initially, a division in the amount of memory is established between the shared and private memory areas. Subsequently, a new division is determined. Consequently, memory from one memory area is “given” to the other memory area. In one approach, such sharing is achieved by causing the shared and private memory areas to be physically separate from each other both before and after a change in the division. The division of the amount of memory may be changed to a new division by deallocating memory from one of the memory areas and allocating that memory to the other of the memory areas. | 09-25-2008 |
20090157701 | PARTIAL KEY INDEXES - A partial reverse key index is described, which allows distributed contention as resources vie to insert data into an index as well as allows range scans to be performed on the index. To do so, before an index entry for a key value is inserted into an index, the key value is transformed using a transformation operation that affects a subset of the order of the key value. The index entry is then inserted based on the transformed key value. Because the transformation operation affects the order of the key value, the transformed values associated with two consecutive key values will not necessarily be consecutive. Therefore, the index entries associated with the consecutive key values may be inserted into unrelated portions of the index. | 06-18-2009 |
20100036843 | GLOBAL CHECKPOINT SCN - Described herein are techniques for generating a global checkpoint system change number and computing a snapshot query using the global checkpoint system change number without a need to acquire global locks. In many cases, the need to acquire global locks is eliminated, thereby saving the overhead attendant to processing global locks. | 02-11-2010 |
20110071981 | AUTOMATED INTEGRATED HIGH AVAILABILITY OF THE IN-MEMORY DATABASE CACHE AND THE BACKEND ENTERPRISE DATABASE - A cluster manager is configured to manage a plurality of copies of a mid-tier database as a mid-tier database cluster. The cluster manager may concurrently manage a backend database system. The cluster manager is configured to monitor for and react to failures of mid-tier database nodes. The cluster manager may react to a mid-tier database failure by, for example, assigning a new active node, creating a new standby node, creating new copies of the mid-tier databases, implementing new replication or backup schemes, reassigning the node's virtual address to another node, or relocating applications that were directly linked to the mid-tier database to another host. Each node or an associated agent may configure the cluster manager to behave in this fashion during initialization, based on common cluster configuration information. Each copy of the mid-tier database may be, for example, a memory resident database. Thus, a node must reload the entire database into memory to recover a copy of the database. | 03-24-2011 |
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 |
20130046731 | AUTOMATED INTEGRATED HIGH AVAILABILITY OF THE IN-MEMORY DATABASE CACHE AND THE BACKEND ENTERPRISE DATABASE - A cluster manager manages copies of a mid-tier database as a mid-tier database cluster. The cluster manager may concurrently manage a backend database system. The cluster manager is configured to monitor for and react to failures of mid-tier database nodes. The cluster manager may react to a mid-tier database failure by, for example, assigning a new active node, creating a new standby node, creating new copies of the mid-tier databases, implementing new replication or backup schemes, reassigning the node's virtual address to another node, or relocating applications that were directly linked to the mid-tier database to another host. Each node or an associated agent may configure the cluster manager during initialization, based on common cluster configuration information. Each copy of the mid-tier database may be, for example, a memory resident database. Thus, a node must reload the entire database into memory to recover a copy of the database. | 02-21-2013 |
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 |
20150088813 | Combined Row and Columnar Storage for In-Memory Databases for OLTP and Analytics Workloads - Columns of a table are stored in either row-major format or column-major format in an in-memory DBMS. For a given table, one set of columns is stored in column-major format; another set of columns for a table are stored in row-major format. This way of storing columns of a table is referred to herein as dual-major format. In addition, a row in a dual-major table is updated “in-place”, that is, updates are made directly to column-major columns without creating an interim row-major form of the column-major columns of the row. Users may submit database definition language (“DDL”) commands that declare the row-major columns and column-major columns of a table. | 03-26-2015 |
20150088830 | MIRRORING, IN MEMORY, DATA FROM DISK TO IMPROVE QUERY PERFORMANCE - Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data. | 03-26-2015 |