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 |
20130001201 | CONFIGURATION OF AN ARC RUNNER FOR A MINIATURE CIRCUIT BREAKER - An arc runner configured to provide a substantially constant separation between a side surface of a conductive contact carrier and an arc discharge surface of the arc runner during an initial portion of a separation of two contacts. The arc discharge surface is preferably a flat surface oriented perpendicular to an axis of rotation of one contact away from the other. The conductive contact carrier having the side surface is configured to allow the arc runner to repeatedly travel along its side without mechanical interference during repeated openings and closings of the contacts. During the initial portion of the separation of the contacts, an electrical arc generated between the contacts during the separation is desirably transferred off of the contacts to the arc discharge surface after the separation between the contacts exceeds the distance between the side surface and the arc discharge surface. | 01-03-2013 |
20130248335 | FLOATING STATIONARY CONTACT TO CREATE STABLE, LOW RESISTANCE CONTACT JOINTS - A floating contact assembly for use in a circuit breaker includes a contact, a floating member, a bearing element, a jaw member, and a flexible conductor. The floating member includes a joint surface and the contact is electrically connected to a surface of the floating member opposite the joint surface. The bearing element is configured to abut the joint surface of the floating member such that the floating member is configured to rotate about a first axis that passes through the bearing element. The jaw member is configured to electrically connect the floating contact assembly to an external electrical component and the flexible conductor electrically couples the jaw member to the floating member. | 09-26-2013 |
20130328657 | CIRCUIT BREAKER THERMAL LOAD VISUAL GAUGE - A thermal gauge for circuit breaker useful for indicating operating conditions, such as in a miniature circuit breaker, has a thermal transducer thermally connected to the current path of the circuit breaker such that heat transfer causes the transducer to give a visible display of heat, latch engagement, or current draw within the breaker directly through a window in the face of the circuit breaker. | 12-12-2013 |
20140158508 | FLEXIBLE CONDUCTOR (BRAID) BONDED TO LOW MATERIAL COST PLUG ON JAW - A substitute for the traditional single piece fixed contact/jaw member on a line-side of a miniature circuit breaker includes a line-side jaw member (e.g., a clip), a flexible conductor (e.g., braided wire), and a line-side contact. The line-side jaw member uses any springy metal or plastic for the clip function and inside the jaw member is the flexible conductor acting as a conductor (e.g., electrically connecting the circuit breaker to a busbar). The flexible conductor leads to the line-side contact. Such an arrangement can save on conductive metal in a circuit breaker. Additionally, the flexible conductor may provide better and more contact points for conduction. | 06-12-2014 |
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 |
20130041887 | ADDING ENTRIES TO AN INDEX BASED ON USE OF THE INDEX - In an embodiment, a threshold value is calculated for a current entry in a first column of an index. If the current entry has been read a number of times by execution of an execution plan that is more than the threshold value and the current entry points to at least one row in a table and not all of the at least one row have been selected by the execution plan for inclusion in a result set as satisfying a query that the execution plan implements, then a new entry is added to the index. | 02-14-2013 |
20130060752 | USING A PARTIALLY BUILT INDEX IN A COMPUTER DATABASE SYSTEM - A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table. | 03-07-2013 |
20130066850 | USING A PARTIALLY BUILT INDEX IN A COMPUTER DATABASE SYSTEM - A partially built index is used in a computer database system. When a database index is being built, or rebuilt, the database manager keeps track of the records processed using a relative row number (RRN) to track what part of the partially built index is complete. Queries are optimized by a query optimizer associated with the database manager that uses the portion of the index that is complete with reference to the RRN. The remainder of the database table beyond the RRN can be estimated or implemented using the completed data or can be determined by searching the relevant portion of the database table. | 03-14-2013 |
20130097430 | ENCRYPTING DATA AND CHARACTERIZATION DATA THAT DESCRIBES VALID CONTENTS OF A COLUMN - A method, computer-readable storage medium, and computer system are provided. In an embodiment, in response to receiving a first command that specifies first data, a first cryptographic key, and a column identifier that identifies a column of rows in a database, the first data is encrypted into encrypted data using the first cryptographic key. The encrypted data is stored to a first row in the column in the database. In response to the receiving the first command, characterization data is created that specifies valid contents of the column of the rows. In response to receiving a query command that specifies a second cryptographic key and the column, the column is decrypted using the second key to create decrypted data. If the decrypted data does not satisfy the valid contents specified by the characterization data, an invalid cryptographic key action is performed. | 04-18-2013 |
20130097599 | RESUMING EXECUTION OF AN EXECUTION PLAN IN A VIRTUAL MACHINE - In an embodiment, a query implemented by a first execution plan is executed at a first virtual machine. In response to a move command that requests a move of the first virtual machine from a first computer to a second computer while the first virtual machine is executing the query implemented by the first execution plan at the first computer, an attribute of a resource used by the executing at the first virtual machine is saved to memory at the first computer and a driver source used by the executing at the first virtual machine is saved to the memory at the first computer. In response to a command that requests starting a second virtual machine at the second computer, a determination is made whether the driver source that comprises the state of the partial execution of the first execution plan exists in memory of the second computer. | 04-18-2013 |
20130159316 | 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. | 06-20-2013 |
20130179433 | DATABASE QUERY OPTIMIZATION USING INDEX CARRYOVER TO SUBSET AN INDEX - A method, apparatus and program product use a first index associated with a field in a database table to identify a range of records in the database table that includes instances of a first key value in the field and use the identified range of records to subset a second index associated with another field in a database table. The database query identifies the first key value for the field in the database table and the second key value for the other field in the database table. By doing so, information from an index may be carried over and applied to another index to subset the other index, often reducing the quantity of entries that are searched in the other index and improving performance. | 07-11-2013 |
20130263117 | ALLOCATING RESOURCES TO VIRTUAL MACHINES VIA A WEIGHTED COST RATIO - In an embodiment, a plurality of estimates of costs of executing a plurality of respective queries is received from a plurality of respective virtual machines using a plurality of respective estimated resources allocated to the plurality of respective virtual machines. A selected virtual machine of the plurality of respective virtual machines is selected with a lowest weighted cost ratio, as compared to all other of the plurality of respective virtual machines. A source virtual machine is found with a lowest current resource usage. An amount of a resource to deallocate from the source virtual machine is calculated, which further comprises estimating the amount of the resource to deallocate that does not raise the lowest current resource usage over a maximum resource threshold. The amount of the resource from the source virtual machine is deallocated. The amount of the resource is allocated to the selected virtual machine. | 10-03-2013 |
20130304723 | CHANGING THE COMPRESSION LEVEL OF QUERY PLANS - In an embodiment, a query plan is compressed to data in a cache at a high compression level if a runtime of a query that the query plan implements is greater than a high time threshold. The query plan is compressed to the data in the cache at a medium compression level if the runtime of the query that the query plan implements is less than the high time threshold and greater than a low time threshold. The query plan is stored to the data in the cache at an uncompressed level if the runtime of the query that the query plan implements is less than the low time threshold. | 11-14-2013 |
20140046928 | QUERY PLANS WITH PARAMETER MARKERS IN PLACE OF OBJECT IDENTIFIERS - In an embodiment, a first query is received that specifies a first object identifier. If a first query plan exists that implements the first query, except that the first query plan does not comprise the first object identifier and instead comprises a parameter marker in place of the first object identifier, a first query execution plan is created from the first query plan, substituting the first object identifier in the first query execution plan for the parameter marker, and the first query execution plan is executed to read a first object identified by the first object identifier. | 02-13-2014 |
20140101131 | SWAPPING EXPECTED AND CANDIDATE AFFINITIES IN A QUERY PLAN CACHE - In an embodiment, a hit percentage of an expected affinity for a first query is calculated, wherein the expected affinity comprises a first address range in a query plan cache, a hit percentage of a candidate affinity for the first query is calculated, wherein the candidate affinity comprises a second address range in a query plan cache, and if the hit percentage of the candidate affinity is greater than the hit percentage of the expected affinity by more than a threshold amount, query plans in the candidate affinity are swapped with query plans in the expected affinity. | 04-10-2014 |
20140101132 | SWAPPING EXPECTED AND CANDIDATE AFFINITIES IN A QUERY PLAN CACHE - In an embodiment, a hit percentage of an expected affinity for a first query is calculated, wherein the expected affinity comprises a first address range in a query plan cache, a hit percentage of a candidate affinity for the first query is calculated, wherein the candidate affinity comprises a second address range in a query plan cache, and if the hit percentage of the candidate affinity is greater than the hit percentage of the expected affinity by more than a threshold amount, query plans in the candidate affinity are swapped with query plans in the expected affinity. | 04-10-2014 |
20140149386 | DATABASE ROW ACCESS CONTROL - A method, system, and computer program product to create an access control bit mapping (ACBM) structure for a corresponding database table are disclosed. The ACBM structure may include a relative record number (RRN) bit map. The RRN bit map may describe the access rights for a parameter. The computer-implemented method may maintain one or more statistics describing the RRN bit map. The method may additionally provide for updating the ACBM structure. The method may also provide for using the ACBM structure to process a database query. | 05-29-2014 |
20140149387 | DATABASE ROW ACCESS CONTROL - A method, system, and computer program product to create an access control bit mapping (ACBM) structure for a corresponding database table are disclosed. The ACBM structure may include a relative record number (RRN) bit map. The RRN bit map may describe the access rights for a parameter. The computer-implemented method may maintain one or more statistics describing the RRN bit map. The method may additionally provide for updating the ACBM structure. The method may also provide for using the ACBM structure to process a database query. | 05-29-2014 |
20140172905 | PERFORMING A FUNCTION ON ROWS OF DATA DETERMINED FROM TRANSITIVE RELATIONSHIPS BETWEEN COLUMNS - In an embodiment, a request is received that specifies a function and a specified key value. Rows from all tables that are accessible from the specified key value are transitively searched, wherein the transitively searching further comprises finding values in a plurality of pairs of columns, wherein found rows that are found by the transitively searching comprise values in a respective first column of the plurality of pairs of columns that satisfy a dependency relationship with values in a respective second column of the plurality of pairs of columns. The function is executed against only the found rows. | 06-19-2014 |
20140172908 | PERFORMING A FUNCTION ON ROWS OF DATA DETERMINED FROM TRANSITIVE RELATIONSHIPS BETWEEN COLUMNS - In an embodiment, a request is received that specifies a function and a specified key value. Rows from all tables that are accessible from the specified key value are transitively searched, wherein the transitively searching further comprises finding values in a plurality of pairs of columns, wherein found rows that are found by the transitively searching comprise values in a respective first column of the plurality of pairs of columns that satisfy a dependency relationship with values in a respective second column of the plurality of pairs of columns. The function is executed against only the found rows. | 06-19-2014 |
20140173599 | SENDING TASKS BETWEEN VIRTUAL MACHINES BASED ON EXPIRATION TIMES - In an embodiment, if an estimated time to perform a task by a first virtual machine is less than or equal to an expiration time of the first virtual machine minus the current time, the task is performed by the first virtual machine. If the estimated time to perform the task by the first virtual machine is greater than the expiration time of the first virtual machine minus the current time, a selected virtual machine is selected from among a plurality of virtual machines with a smallest estimated time to perform the task and a request to perform the task is sent to the selected virtual machine. | 06-19-2014 |
20140173614 | SENDING TASKS BETWEEN VIRTUAL MACHINES BASED ON EXPIRATION TIMES - In an embodiment, if an estimated time to perform a task by a first virtual machine is less than or equal to an expiration time of the first virtual machine minus the current time, the task is performed by the first virtual machine. If the estimated time to perform the task by the first virtual machine is greater than the expiration time of the first virtual machine minus the current time, a selected virtual machine is selected from among a plurality of virtual machines with a smallest estimated time to perform the task and a request to perform the task is sent to the selected virtual machine. | 06-19-2014 |
20140201132 | STORING A KEY VALUE TO A DELETED ROW BASED ON KEY RANGE DENSITY - In an embodiment, a first key value is received. A plurality of candidate rows are found in a database table, wherein the plurality of candidate rows are deleted. For the plurality of candidate rows, a plurality of respective impacts on a plurality of respective densities of each of other key values that are stored within a first key range of the first key value are calculated. For the plurality of candidate rows, a plurality of function results of the plurality of respective impacts on the plurality of respective densities are calculated. A selected candidate row of the plurality of candidate rows with a smallest function result of the plurality of function results of the plurality of respective impacts on the plurality of respective densities is selected. The first key value is stored to the selected candidate row. | 07-17-2014 |
20140324874 | MANAGEMENT OF A DATABASE SYSTEM - A method, system, and computer program product to manage a database is disclosed. The method, system, and computer program product may include structuring the database to have a first table having an index and a second table. A first key of the first table may be related to a second key of the second table. The method, system, and computer program product may include creating an entry locator in the index. The method, system, and computer program product may include maintaining an association between the second key of the second table and the entry locator of the index. | 10-30-2014 |
20140324876 | MANAGEMENT OF A DATABASE SYSTEM - A method, system, and computer program product to manage a database is disclosed. The method, system, and computer program product may include structuring the database to have a first table having an index and a second table. A first key of the first table may be related to a second key of the second table. The method, system, and computer program product may include creating an entry locator in the index. The method, system, and computer program product may include maintaining an association between the second key of the second table and the entry locator of the index. | 10-30-2014 |
20150019583 | INTELLIGENTLY UTILIZING NON-MATCHING WEIGHTED INDEXES - System, method, and computer program product to intelligently utilize non-matching weighted objects, by determining that a sort sequence of a query does not match a sort sequence of a shared weight object of a database, modifying the query based on the sort sequence of the query, and executing the modified query to obtain a result set, wherein the result set does not include a set of rows that would have been returned using the shared weight object to process the unmodified query. | 01-15-2015 |
20150088903 | DATA ALLOCATION CONTAINERS IN A PARTITIONED TABLE OF A COMPUTER DATABASE SYSTEM FOR HOLDING DATA BASED ON USAGE - An apparatus and method utilize partitioned database tables divided into data allocation containers (DACs) where data is placed into the DACs based on usage of the data in past queries. Records that are used most often are placed together and records that are used less often are placed together to improve database performance. In preferred embodiments, a database manager determines where to place data into the DACs based on how often the data is selected by a database query using a DAC selection ratio (DSR). The database manager may determine when to perform table maintenance to move rows of data to the appropriate DACs based on a timestamp or last check date (LCD) stored in the database. | 03-26-2015 |
20150088912 | DATA ALLOCATION CONTAINERS IN A PARTITIONED TABLE OF A COMPUTER DATABASE SYSTEM FOR HOLDING DATA BASED ON USAGE - An apparatus and method utilize partitioned database tables divided into data allocation containers (DACs) where data is placed into the DACs based on usage of the data in past queries. Records that are used most often are placed together and records that are used less often are placed together to improve database performance. In preferred embodiments, a database manager determines where to place data into the DACs based on how often the data is selected by a database query using a DAC selection ratio (DSR). The database manager may determine when to perform table maintenance to move rows of data to the appropriate DACs based on a timestamp or last check date (LCD) stored in the database. | 03-26-2015 |
Patent application number | Description | Published |
20090096696 | RFID TAG WITH A MODIFIED DIPOLE ANTENNA - In general, the disclosure describes an RFID tag designed such that the tag is both covert and not easily blocked from the interrogation signal by the hand or other body part of a person. In particular, the RFID tag is designed to have a long, narrow aspect that allows placement of the tag in locations on or in a book that are inconspicuous to the casual observer while extending beyond a hand of a person holding the book by the spine on or near a geometry centerline. The RFID tag includes a dipole segment and a loop segment coupled to the dipole segment. The loop segment of the modified dipole antenna provides the antenna with larger signal strength than conventional dipole antennas. Moreover, the conductive loop segment also provides improved impedance matching capabilities to allow the modified dipole antenna to match the impedance of an integrated circuit (IC) chip of the RFID tag. | 04-16-2009 |
20110220115 | RESPIRATOR HARNESS HAVING COLLAPSIBLE HEAD CRADLE - A respirator | 09-15-2011 |
20140216463 | RESPIRATORY PROTECTION DEVICE HARNESS ASSEMBLY - A harness assembly for a respiratory protection device is provided. In an exemplary embodiment, the harness assembly includes a strap support having an attachment point, a first strap having a first strap attachment element, and a second strap having a second strap attachment element, wherein the first strap attachment element is attachable to the second strap attachment element and attachable to the attachment point of the strap support, and the first and second straps are positionable between the first configuration in which the first strap attachment element is attached only to the second attachment element and a second configuration in which the first attachment element is attached to the second attachment element and the attachment point of the strap support. | 08-07-2014 |
20140216472 | PERSONAL PROTECTIVE EQUIPMENT STRAP RETAINING DEVICES - A strap retaining device having an actuation arm that may engage a retaining tab is provided. In an exemplary embodiment, the strap retaining device includes a frame, a retention tab pivotally connected to the frame, and an actuation arm connected to the frame and having a first actuation element movable towards the retention tab from a neutral position to an actuated. The first actuation ramp is movable in a first plane to cause the retention tab to move in a second plane that is perpendicular to the first plane. | 08-07-2014 |
20140216473 | RESPIRATORY MASK HAVING A CLEAN AIR INLET CHAMBER - A respiratory mask body defining a first chamber and a second chamber is provided. In an exemplary embodiment, the mask body includes one or more inlet ports adapted to receive one or more breathing air source components in communication with the first chamber and a fluid intake communication component allows communication of air from the first chamber to the second chamber during inhalation by a wearer. | 08-07-2014 |
20140216474 | RESPIRATOR NEGATIVE PRESSURE FIT CHECK DEVICES AND METHODS - A respiratory mask body defining a breathable air zone for a wearer and having a shut-off valve is provided. In an exemplary embodiment, the mask body includes one or more inlet ports configured to receive one or more breathing air source components. The shut-off valve is operable between a closed position and an open position, and when in a closed position the shut-off valve prevents fluid communication between the one or more inlet ports and the breathable air zone and the shut-off valve returns to an open position in the absence of an applied force. | 08-07-2014 |
20140216475 | SLEEVE-FIT RESPIRATOR CARTRIDGE - A respirator apparatus includes a respirator body, a filter cartridge receiver integral with and extending from the respirator body, and a filter cartridge. The filter cartridge includes a nozzle element being integral with the filter cartridge. The respirator body and filter cartridge are configured to be fluidically coupled through sleeve-fit engagement between the filter cartridge receiver and nozzle element and the filter cartridge receiver and nozzle element define an airflow channel. | 08-07-2014 |
20140216476 | PERSONAL PROTECTIVE EQUIPMENT STRAP RETAINING DEVICES - A strap retaining device having an actuation arm that may engage a retaining tab is provided. In an exemplary embodiment, the strap retaining device includes a frame, a retention tab pivotally connected to the frame, and an actuation arm connected to the frame and having a first actuation element movable towards the retention tab from a neutral position to an actuated. The first actuation ramp is movable in a first plane to cause the retention tab to move in a second plane that is perpendicular to the first plane. | 08-07-2014 |
20140251327 | RESPIRATOR NEGATIVE PRESSURE FIT CHECK DEVICES AND METHODS - A respiratory mask body defining a breathable air zone for a wearer and having a shut-off valve is provided. In an exemplary embodiment, the mask body includes one or more inlet ports configured to receive one or more breathing air source components. The shut-off valve is operable between a closed position and an open position, and when in a closed position the shut-off valve prevents fluid communication between the one or more inlet ports and the breathable air zone and the shut-off valve returns to an open position in the absence of an applied force. | 09-11-2014 |
20150083137 | RESPIRATORY MASK HAVING A NOSE SUPPORT EXTENSION - A respiratory mask body having a nose region including a seal and a support extension is provided. In an exemplary embodiment, the mask body has a nose region including a support extension which extends in a direction away from the seal and is configured to contact a user's nose at a position beyond the seal. | 03-26-2015 |