| Patent application number | Description | Published |
|---|
| 20100134221 | ADD-ON TRIP MODULE FOR MULTI-POLE CIRCUIT BREAKER - An add-on module adapted to be attached to the basic mechanical structure of a multi-pole circuit breaker includes multiple extended terminal plates each of which is adapted to replace one of the input and output terminals for one of the poles, multiple electromechanical transducers each of which is coupled to one of the extended terminal plates for producing a mechanical movement in response to a predetermined magnitude of electrical current in the extended terminal plate to which that transducer is coupled, a mechanical actuator coupled to the electromechanical transducers and to the movable contacts for operating the trip mechanism in response to a predetermined movement of any of the transducers, and a calibration element for adjusting mechanical movement of at least one of said multiple electromechanical transducers so as to control an aspect of trip actuation. | 06-03-2010 |
| 20100155136 | Circuit Breaker Current Transformer Conductor Location Device For Improved Sensing Accuracy And Assembly - A circuit breaker includes a breaker housing, a transformer housing, and a plurality of conductor locators. The transformer housing is enclosed within the breaker housing and has an opening for receiving a plurality of conductors. The plurality of conductor locators is desirably located adjacent to the transformer housing and is movable between an open position and a closed position. The conductors are generally centered in the opening of the transformer housing when the conductor locators are in the closed position. | 06-24-2010 |
| 20100164657 | Add-On Trip Module For Multi-Pole Circuit Breaker - An add-on module adapted to be attached to the basic mechanical structure of a multi-pole circuit breaker includes multiple extended terminal plates each of which is adapted to replace one of the input and output terminals for one of the poles, multiple electromechanical transducers each of which is coupled to one of the extended terminal plates for producing a mechanical movement in response to a predetermined magnitude of electrical current in the extended terminal plate to which that transducer is coupled, a mechanical actuator coupled to the electromechanical transducers and to the breaker contacts for operating a trip mechanism in response to a predetermined mechanical movement of any of the transducers, and a mechanical reset arm coupling the reset mechanism to the mechanical actuator for resetting the actuator in response to the resetting of the host circuit breaker. | 07-01-2010 |
| 20120325632 | MOVEABLE CONTACT CLOSING ENERGY TRANSFER SYSTEM FOR MINIATURE CIRCUIT BREAKERS - An energy transfer system absorbs impact forces and/or energy from a moveable conductive blade directly attached to a moveable contact in a circuit breaker. The energy transfer system includes a rotatable member and a biasing member. The rotatable member has an axis of rotation about which the rotatable member is rotatable between a first position and a second position. The rotatable member further includes a protrusion. The protrusion has an initial curved engagement surface portion, a planar engagement surface portion next to the initial curved engagement surface portion, and a final curved engagement surface portion next to the planar engagement surface portion. The biasing member biases the rotatable member towards the first position. The movable conductive blade impacts the initial curved engagement surface portion to cause the rotatable member to begin to rotate about the axis of rotation such that the moveable conductive blade then contacts the planar engagement surface portion and then the final curved engagement surface portion. | 12-27-2012 |
| Patent application number | Description | Published |
|---|
| 20100227947 | INK-JET INKS AND ENCAPSULATED PIGMENTS PREPARED BY RAFT REAGENTS - The present disclosure is drawn to methods and compositions directed at encapsulated pigments. As such, an encapsulated pigment can comprise a pigment and a polymer encapsulating the pigment, where the polymer comprises a monomer and a RAFT reagent. Additionally, a method of encapsulating pigments can comprise dispersing a pigment in an aqueous solution to form a pigment dispersion, adding a monomer to the pigment dispersion, adding a RAFT reagent to the pigment dispersion, and polymerizing the monomer using the RAFT reagent in the presence of the pigment to form an encapsulated pigment. Further, the present disclosure provides ink-jet inks comprising the encapsulated pigments. | 09-09-2010 |
| 20110104409 | INKJET PRINT MEDIA - An inkjet print medium includes a base substrate, a layer of a deinking solution at least partially diffused into the base substrate, and an ink-receiving layer established on the layer of the deinking solution. The deinking solution includes a flocculant in an amount ranging from about 0.1 wt. % to about 40 wt. % of a total wt. % of the deinking solution. | 05-05-2011 |
| 20120116012 | ENCAPSULATED PIGMENTS CONTAINING CROSS-LINKING AGENT - Polymer-encapsulated pigment which includes a pigment core and a polymer shell, the shell being a polymerized polymer including hydrophobic monomers and acidic monomers, and also including a specific cross-linking agent. | 05-10-2012 |
| 20130029111 | POST-TREATMENT COMPOSITION FOR A DIGITALLY PRINTED IMAGE - A post-treatment composition for a digitally printed image includes a non-polar solvent and a non-ionic surfactant. The non-ionic surfactant is present in an amount ranging from about 0.5 wt % to about 20 wt % of a total weight of substrate used to form the digitally printed image. The post-treatment composition renders the digitally printed image deinkable. | 01-31-2013 |
| Patent application number | Description | Published |
|---|
| 20090248764 | Implementing Dynamic Processor Allocation Based Upon Data Density - Dynamic processor allocation is implemented based upon bitmap data density. A bitmap index is used to process the query. A bitmap is created for the query. The bitmap is partitioned into single I/O operations. A variable partition size is provided based upon data density. Data density for each partition is calculated. Processors are assigned based upon data density of each partition. Then the partitions are processed and query results are returned. | 10-01-2009 |
| 20090287637 | Determining a Density of a Key Value Referenced in a Database Query Over a Range of Rows - A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query. | 11-19-2009 |
| 20090287639 | Embedding Densities in a Data Structure - A method, apparatus and program product that determine a density for each key value of a plurality of key values in a table over at least one range of rows in the database table, and store the determined densities in a data structure for use in optimizing a query that references a key value in the plurality of key values in the table. By doing so, the density of various key values may be determined and dynamically maintained, often resulting in optimization data for improved query optimization. | 11-19-2009 |
| 20120023092 | Feedback Loop Between A Query Optimizer And A Cache Manager - Systems, methods and computer program products are disclosed for managing a database cache. In one embodiment, access to a data object stored in a database is monitored. A memory residency priority for the data object is determined, based on the access patterns. Further, an access plan is determined for a query, based on the memory residency priority. Access to the data object is also monitored when the access plan is executed, thereby providing a feedback loop between determining memory residency priorities and determining query access plans. | 01-26-2012 |
| 20120023138 | DELETING OBJECTS WITH GROUP AUTHORITY - In an embodiment, a command is received from a sender that requests deletion of an object. A determination is made whether the object specifies group authority and whether all of a plurality of members of the group authority have requested deletion of the object. If the object specifies group authority and all of the plurality of members of the group authority have requested deletion of the object, then the object is deleted. If the object specifies group authority and not all of the plurality of members of the group authority have requested deletion of the object, then an indication is saved in the group authority that the sender requested deletion of the object. If the object does not specify group authority, then the object is deleted. | 01-26-2012 |
| 20120047125 | EXECUTING A QUERY PLAN WITH DISPLAY OF INTERMEDIATE RESULTS - In an embodiment, a FIRSTIO execution plan is selected that has a lowest estimated execution time for finding a number of records that satisfy the query and are simultaneously viewable. An ALLIO execution plan is selected that has a lowest estimated execution time for finding all records that satisfy the query. The FIRSTIO execution plan is executed for a first time period to create a FIRSTIO result set. The ALLIO execution plan is executed for a second time period to create an ALLIO result set. The FIRSTIO result set is displayed if the FIRSTIO result set comprises more records than the ALLIO result set. The ALLIO result set is displayed if the ALLIO result set comprises more records than the FIRSTIO result set. In an embodiment, the first and second time periods expire in response to the expiration of a maximum time specified by the query. | 02-23-2012 |
| 20120096054 | READING ROWS FROM MEMORY PRIOR TO READING ROWS FROM SECONDARY STORAGE - In an embodiment, a first plurality of rows of a first table are read from memory in an order of page addresses of pages in the memory that comprise the first plurality of rows. First selected rows from the first plurality of rows that meet a query predicate are stored into a result set. After the reading the first plurality of rows in the order of the page addresses, a second plurality of rows of the first table are read from secondary storage, in an order of row identifiers of the second plurality of the rows in the first table. Second selected rows from the second plurality of rows that meet the query predicate are stored into the result set. | 04-19-2012 |
| 20120124056 | DISAPPEARING INDEX FOR MORE EFFICIENT PROCESSING OF A DATABASE QUERY - A disappearing index allows faster processing of a database query without the startup time of a prior art sparse index. The disappearing index starts as a full index but is trimmed of index values that point to a row in the table that is not selected by the query. Thus the traditional index disappears as it becomes a sparse index tailored to the query. The query is able to execute faster using the now sparse index since the target database table is not accessed for duplicate values in the base table of the query. The query optimizer may determine to use a disappearing index based on estimates of the number of duplicate values in the base table. When the query is complete, the created disappearing table may be discarded or used for other queries that match the selection of the query that created the disappearing index. | 05-17-2012 |
| 20120290588 | REORGANIZING DATABASE TABLES - Techniques are disclosed for reorganizing rows of a database table. In one embodiment, each row is associated with a respective row identifier. A mapping is provided that assigns a logical identifier to each row identifier. Each database index on the database table is configured to use the logical identifier rather than the row identifier. Accordingly, the rows of the database table may be reorganized without having to modify any database index on the database table. | 11-15-2012 |
| 20120310921 | IDENTIFYING IMPACT OF INSTALLING A DATABASE PATCH - Techniques are disclosed for identifying impact of a patch. One embodiment of the invention provides a DBMS that is configured to manage one or more databases. The DBMS may receive a request to evaluate a patch for the DBMS. The DBMS provides a first execution environment that is not based on the patch and a second execution environment that is based on the patch. For each query, the DBMS compares a first access plan with a second access plan, where the first access plan is generated from the first execution environment and the second access plan is generated from the second execution environment. The DBMS identifies one or more queries having differing access plans, based on the comparisons. | 12-06-2012 |
| Patent application number | Description | Published |
|---|
| 20090188371 | METHODS AND APPARATUS FOR STRINGED CONTROLLERS AND/OR INSTRUMENTS - Stringed instruments, game controllers, and related structures and methods are described. A game controller having one or more strings is described for a computer gaming application. Output signals may be sent from the controller to the gaming application indicative of fingering of the game controller and the time at which the strings of the game controller are struck. Multi-mode apparatus are also described. A stringed apparatus may be used as both a game controller and an instrument. Bracing structures and methods are also described for bracing stringed apparatus, such as stringed game controllers and instruments. | 07-30-2009 |
| 20090191932 | METHODS AND APPARATUS FOR STRINGED CONTROLLERS AND/OR INSTRUMENTS - Stringed instruments, game controllers, and related structures and methods are described. A game controller having one or more strings is described for a computer gaming application. Output signals may be sent from the controller to the gaming application indicative of fingering of the game controller and the time at which the strings of the game controller are struck. Multi-mode apparatus are also described. A stringed apparatus may be used as both a game controller and an instrument. Bracing structures and methods are also described for bracing stringed apparatus, such as stringed game controllers and instruments. | 07-30-2009 |
| 20100279772 | METHODS AND APPARATUS FOR STRINGED CONTROLLERS AND/OR INSTRUMENTS - Stringed instruments, game controllers, and related structures and methods are described. A game controller having one or more strings is described for a computer gaming application. Output signals may be sent from the controller to the gaming application indicative of fingering of the game controller and the time at which the strings of the game controller are struck. Multi-mode apparatus are also described. A stringed apparatus may be used as both a game controller and an instrument. Bracing structures and methods are also described for bracing stringed apparatus, such as stringed game controllers and instruments. | 11-04-2010 |
