Patent application number | Description | Published |
20120241506 | Concave Solder Tip - A solder tip having a bottom end. The bottom end includes a concave channel between a front side of the bottom end and a back side of the bottom end. The concave channel has a substantially uniform cross-sectional shape. | 09-27-2012 |
20130188325 | CABLE RETENTION HOUSING - A retention housing having a housing body is provided, the retention housing configured to be mounted to a substrate. At least one, such as a plurality of cables can be electrically connected to a respective surface of the substrate to which the retention housing is mounted. When the retention housing is mounted to the respective surface of the substrate, at least a portion of the at least one cable can be compressed between a ground element supported by the respective surface of the substrate and a corresponding upper wall of the housing body, such that the at least one cable is placed into electrical communication with a ground plane defined by the substrate. | 07-25-2013 |
20140182885 | ELECTRICAL CABLE ASSEMBLY - In accordance with an embodiment, an electrical cable can be configured to electrically connect to contact pads that are carried by a substrate. The electrical cable can include at least one, such as a pair, of electrical signal conductors and at least one, for instance a pair, of electrically conductive drain wires. A drain wire in the electrical cable can define a first surface that is configured to face the substrate and a second surface that is opposite the first surface. The drain wire can define a height that is greater than 0.2 mm as measured from the first surface to the second surface along a straight line. | 07-03-2014 |
20140182890 | ELECTRICAL CABLE ASSEMBLY - In accordance with an embodiment, an electrical cable can be configured to electrically connect to contact pads that are carried by a substrate. The electrical cable can include at least one, such as a pair, of electrical signal conductors and at least one, for instance a pair, of electrically conductive drain wires. A drain wire in the electrical cable can define a first surface that is configured to face the signal conductors and a second surface that is opposite the first surface. The drain wire can define a width that is greater than 0.12 mm as measured from the first surface to the second surface along a straight line. At least one auxiliary wire can be attached to at least one drain wire. The auxiliary wire can be configured to attach to the substrate. | 07-03-2014 |
Patent application number | Description | Published |
20100036850 | PROVIDING EXECUTING PROGRAMS WITH RELIABLE ACCESS TO NON-LOCAL BLOCK DATA STORAGE - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store block data that may be accessed over one or more networks by programs executing on other physical computing systems. Users may create block data storage volumes that are each stored by at least two of the server block data storage systems, and may initiate use of such volumes by one or more executing programs, such as in a reliable manner by enabling an automatic switch to a second volume copy if a first volume copy becomes unavailable. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center. | 02-11-2010 |
20100036851 | MANAGING ACCESS OF MULTIPLE EXECUTING PROGRAMS TO NON-LOCAL BLOCK DATA STORAGE - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store network-accessible block data storage volumes that may be used by programs executing on other physical computing systems. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center. If a program using a volume becomes unavailable, another program (e.g., another copy of the same program) may in some situations obtain access to and continue to use the same volume, such as in an automatic manner in some such situations. | 02-11-2010 |
20100036931 | PROVIDING A RELIABLE BACKING STORE FOR BLOCK DATA STORAGE - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store copies of network-accessible block data storage volumes that may be used by programs executing on other physical computing systems, and at least some stored data for some volumes may also be stored on remote archival storage systems. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other computing systems at that data center, while the archival storage systems may be located outside the data center. The data stored on the archival storage systems may be used in various ways, including to reduce the amount of data stored in at least some volume copies. | 02-11-2010 |
20100037031 | PROVIDING EXECUTING PROGRAMS WITH ACCESS TO STORED BLOCK DATA OF OTHERS - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store copies of network-accessible block data storage volumes that may be used by programs executing on other physical computing systems, and snapshot copies of some volumes may also be stored (e.g., on remote archival storage systems). A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other computing systems at that data center, while the archival storage systems may be located outside the data center. The snapshot copies of volumes may be used in various ways, including to allow users to obtain their own copies of other users' volumes (e.g., for a fee). | 02-11-2010 |
20110238546 | MANAGING COMMITTED PROCESSING RATES FOR SHARED RESOURCES - Commitments against various resources can be dynamically adjusted for customers in a shared-resource environment. A customer can provision a data volume with a committed rate of Input/Output Operations Per Second (IOPS) and pay only for that commitment (plus any overage), for example, as well as the amount of storage requested. The customer can subsequently adjust the committed rate of IOPS by submitting an appropriate request, or the rate can be adjusted automatically based on any of a number of criteria. Data volumes for the customer can be migrated, split, or combined in order to provide the adjusted rate. The interaction of the customer with the data volume does not need to change, independent of adjustments in rate or changes in the data volume, other than the rate at which requests are processed. | 09-29-2011 |
20110238857 | COMMITTED PROCESSING RATES FOR SHARED RESOURCES - Customers of a shared-resource environment can provision resources in a fine-grained manner that meets specific performance requirements. A customer can provision a data volume with a committed rate of Input/Output Operations Per Second (IOPS) and pay only for that commitment (plus any overage), and the amount of storage requested. The customer will then at any time be able to complete at least the committed rate of IOPS. If the customer generates submissions at a rate that exceeds the committed rate, the resource can still process at the higher rate when the system is not under pressure. Even under pressure, the system will deliver at least the committed rate. Multiple customers can be provisioned on the same resource, and more than one customer can have a committed rate on that resource. Customers without committed or guaranteed rates can utilize the uncommitted portion, or committed portions that are not being used. | 09-29-2011 |
20120042142 | PROVIDING EXECUTING PROGRAMS WITH RELIABLE ACCESS TO NON-LOCAL BLOCK DATA STORAGE - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store block data that may be accessed over one or more networks by programs executing on other physical computing systems. Users may create block data storage volumes that are each stored by at least two of the server block data storage systems, and may initiate use of such volumes by one or more executing programs, such as in a reliable manner by enabling an automatic switch to a second volume copy if a first volume copy becomes unavailable. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center. | 02-16-2012 |
20120060006 | MANAGING ACCESS OF MULTIPLE EXECUTING PROGRAMS TO NON-LOCAL BLOCK DATA STORAGE - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store network-accessible block data storage volumes that may be used by programs executing on other physical computing systems. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center. If a program using a volume becomes unavailable, another program (e.g., another copy of the same program) may in some situations obtain access to and continue to use the same volume, such as in an automatic manner in some such situations. | 03-08-2012 |
20140088979 | PROVIDING SYSTEM RESOURCES WITH SECURE CONTAINMENT UNITS - A system for providing resources to customers includes racks, sub-rack level secure containment units in the racks, and a provisioning control system. The sub-rack level secure containment units each enclose system resources. The racks hold two or more of the sub-rack level secure containment units. For each customer, the provisioning control system may provision a set of sub-rack level secure containment units to the customer. The provisioning control system may monitor, and create a record of, events of physical access to the system resources in each customer's set of sub-rack level secure containment units. | 03-27-2014 |
20140180862 | MANAGING OPERATIONAL THROUGHPUT FOR SHARED RESOURCES - Usage of shared resources can be managed by enabling users to obtain different types of guarantees at different times for various types and/or levels of resource capacity. A user can select to have an amount or rate of capacity dedicated to that user. A user can also select reserved capacity for at least a portion of the requests, tasks, or program execution for that user, where the user has priority to that capacity but other users can utilize the excess capacity during other periods. Users can alternatively specify to use the excess capacity or other variable, non-guaranteed capacity. The capacity can be for any appropriate functional aspect of a resource, such as computational capacity, throughput, latency, bandwidth, and storage. Users can submit bids for various types and combinations of excess capacity, and winning bids can receive dedicated use of the excess capacity for at least a period of time. | 06-26-2014 |
20140223125 | PROVIDING EXECUTING PROGRAMS WITH ACCESS TO STORED BLOCK DATA OF OTHERS - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store copies of network-accessible block data storage volumes that may be used by programs executing on other physical computing systems, and snapshot copies of some volumes may also be stored (e.g., on remote archival storage systems). A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other computing systems at that data center, while the archival storage systems may be located outside the data center. The snapshot copies of volumes may be used in various ways, including to allow users to obtain their own copies of other users' volumes (e.g., for a fee). | 08-07-2014 |
20140281317 | PROVIDING EXECUTING PROGRAMS WITH RELIABLE ACCESS TO NON-LOCAL BLOCK DATA STORAGE - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store block data that may be accessed over one or more networks by programs executing on other physical computing systems. Users may create block data storage volumes that are each stored by at least two of the server block data storage systems, and may initiate use of such volumes by one or more executing programs, such as in a reliable manner by enabling an automatic switch to a second volume copy if a first volume copy becomes unavailable. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center. | 09-18-2014 |
20140317370 | MANAGING ACCESS OF MULTIPLE EXECUTING PROGRAMS TO NON-LOCAL BLOCK DATA STORAGE - Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store network-accessible block data storage volumes that may be used by programs executing on other physical computing systems. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center. If a program using a volume becomes unavailable, another program (e.g., another copy of the same program) may in some situations obtain access to and continue to use the same volume, such as in an automatic manner in some such situations. | 10-23-2014 |
20150106331 | DATA SET CAPTURE MANAGEMENT WITH FORECASTING - A set of virtualized computing services may include multiple types of virtualized data store differentiated by characteristics such as latency, throughput, durability and cost. A sequence of captures of a data set from one data store to another may be scheduled to achieve a variety of virtualized computing service user and provider goals such as lowering a probability of data loss, lowering costs, and computing resource load leveling. Data set captures may be scheduled according to policies specifying fixed and flexible schedules and conditions including flexible scheduling windows, target capture frequencies, probability of loss targets and/or cost targets. Capture lifetimes may also be managed with capture retention policies, which may specify fixed and flexible lifetimes and conditions including cost targets. Such data set capture policies may be specified with a Web-based administrative interface to a control plane of the virtualized computing services. | 04-16-2015 |
20150271092 | FLEXIBLE-LOCATION RESERVATIONS AND PRICING FOR NETWORK-ACCESSIBLE RESOURCE CAPACITY - Methods and apparatus for flexible-location reservations and pricing for network-accessible resources are disclosed. A system includes a plurality of resources of a provider network distributed across multiple locations, and a resource manager. The resource manager implements a programmatic interface to allow a client to specify a flexible location option for a resource reservation request, indicating that the resource manager is to select one or more locations at which to reserve resource capacity. When a reservation request with the flexible location option specified is received, the resource manager selects a particular location based at least in part on heuristics using resource utilization data. In response to a resource activation request for the reservation, the resource manager activates a resource at a launch location selected from the multiple locations. | 09-24-2015 |
Patent application number | Description | Published |
20120179673 | PROFITABILITY BASED RANKING OF SEARCH RESULTS FOR LODGING RESERVATIONS - Method and apparatus for dynamic information connection search engine. User actions may be detected on at least one client system. Determination may be made whether the user is searching for supported information. When the user is searching for supported information, information may be extracted electronically from, e.g., third party websites, direct supplier connections, and/or intermediate databases. Suppliers may be automatically selected in response to the user search. Queries may be formulated from the user search and transferred to one or more selected suppliers over a network coupling (e.g., the Internet and/or intranet). Queries may include one or more requests for information. One or more responses may be received from suppliers, and responses may be used to generate results for the user. Results may include information and/or query status information. An electronic link may be provided to a website of one or more suppliers from which information was derived. | 07-12-2012 |
20130275425 | PROFITABILITY BASED RANKING OF SEACH RESULTS FOR LODGING RESERVATIONS - Method and apparatus for dynamic information connection search engine. User actions may be detected on at least one client system. Determination may be made whether the user is searching for supported information. When the user is searching for supported information, information may be extracted electronically from, e.g., third party websites, direct supplier connections, and/or intermediate databases. Suppliers may be automatically selected in response to the user search. Queries may be formulated from the user search and transferred to one or more selected suppliers over a network coupling (e.g., the Internet and/or intranet). Queries may include one or more requests for information. One or more responses may be received from suppliers, and responses may be used to generate results for the user. Results may include information and/or query status information. An electronic link may be provided to a website of one or more suppliers from which information was derived. | 10-17-2013 |
20150073868 | USE OF STORED SEARCH RESULTS BY A TRAVEL SEARCH SYSTEM - A method and apparatus are provided for a dynamic information connection search engine. User actions may be detected on at least one client system. In response, a determination may be made whether the user is searching for supported information. When the user is searching for supported information, information may be extracted electronically from, for example, third party websites, direct supplier connections, and/or intermediate databases. Potential suppliers may be automatically selected in response to the detected user search. Queries may be formulated from the user search and transferred to one or more selected suppliers over a network coupling (e.g., the Internet and/or an intranet). The queries may include one or more requests for information. One or more responses may be received from the suppliers, and the responses may be used to generate a result list for the user. The result list may include information and/or query status information. Further, an electronic link may be provided to a website of one or more of the supplies from which the information was derived. | 03-12-2015 |
20150199621 | PROFITABILITY BASED RANKING OF SEARCH RESULTS FOR LODGING RESERVATIONS - Method and apparatus for dynamic information connection search engine. User actions may be detected on at least one client system. Determination may be made whether the user is searching for supported information. When the user is searching for supported information, information may be extracted electronically from, e.g., third party websites, direct supplier connections, and/or intermediate databases. Suppliers may be automatically selected in response to the user search. Queries may be formulated from the user search and transferred to one or more selected suppliers over a network coupling (e.g., the Internet and/or intranet). Queries may include one or more requests for information. One or more responses may be received from suppliers, and responses may be used to generate results for the user. Results may include information and/or query status information. An electronic link may be provided to a website of one or more suppliers from which information was derived. | 07-16-2015 |