Abstract: A wire-spring retained heatsink installation and removal tool for installing and removing wire-spring retained heatsinks. The wire-spring retained heatsink installation and removal tool includes a shaped portion that, when placed over a section of a torsion spring of a wire-spring retained heatsink, allows a force to be applied to the torsion spring such that a hook end of the torsion spring is forced into an associated hook on an assembly on which the wire-spring retained heatsink is being attached. The wire-spring retained heatsink installation and removal tool includes a handle that couples to the shaped portion thereby allowing a user to grasp the wire-spring retained heatsink installation and removal tool in order to apply the force necessary to engage the hook end of the torsion spring into the associated hook on the assembly on which the wire-spring retained heatsink is being attached.

Abstract: A wire-spring retained heatsink installation and removal tool for installing and removing wire-spring retained heatsinks. The wire-spring retained heatsink installation and removal tool includes a shaped portion that, when placed over a section of a torsion spring of a wire-spring retained heatsink, allows a force to be applied to the torsion spring such that a hook end of the torsion spring is forced into an associated hook on an assembly on which the wire-spring retained heatsink is being attached. The wire-spring retained heatsink installation and removal tool includes a handle that couples to the shaped portion thereby allowing a user to grasp the wire-spring retained heatsink installation and removal tool in order to apply the force necessary to engage the hook end of the torsion spring into the associated hook on the assembly on which the wire-spring retained heatsink is being attached.

Abstract: A wire-spring retained heatsink installation and removal tool for installing and removing wire-spring retained heatsinks. The wire-spring retained heatsink installation and removal tool includes a shaped portion that, when placed over a section of a torsion spring of a wire-spring retained heatsink, allows a force to be applied to the torsion spring such that a hook end of the torsion spring is forced into an associated hook on an assembly on which the wire-spring retained heatsink is being attached. The wire-spring retained heatsink installation and removal tool includes a handle that couples to the shaped portion thereby allowing a user to grasp the wire-spring retained heatsink installation and removal tool in order to apply the force necessary to engage the hook end of the torsion spring into the associated hook on the assembly on which the wire-spring retained heatsink is being attached.

Abstract: A wire-spring retained heatsink installation and removal tool for installing and removing wire-spring retained heatsinks. The wire-spring retained heatsink installation and removal tool includes a shaped portion that, when placed over a section of a torsion spring of a wire-spring retained heatsink, allows a force to be applied to the torsion spring such that a hook end of the torsion spring is forced into an associated hook on an assembly on which the wire-spring retained heatsink is being attached. The wire-spring retained heatsink installation and removal tool includes a handle that couples to the shaped portion thereby allowing a user to grasp the wire-spring retained heatsink installation and removal tool in order to apply the force necessary to engage the hook end of the torsion spring into the associated hook on the assembly on which the wire-spring retained heatsink is being attached.

Abstract: Techniques for determining a suggested bid value that surpasses a selected bid are disclosed. A user selectable facility is provided. In response to receiving a selection event associated with the user selectable facility: (1) the value of the selected bid, which is other than the first ranked bid value, is established; (2) the suggested bid value is calculated by applying a predetermined minimum differential value to the selected bid value; and (3) the suggested bid value is conveyed to a user.

Abstract: Techniques for soliciting and receiving bids for goods or services necessary to satisfy a spot need of a buyer are disclosed. A request to procure goods or services is received. At least one aspect associated with the request is a requirement that the requested goods or services be available for immediate delivery. Potential bidders are electronically notified. An auction is conducted. One or more winning bidders are selected in accordance with received bids.

Abstract: A system and method for soliciting and receiving bids for goods or services necessary to satisfy a spot need of a buyer. The system receives a request to procure goods or services that are required to satisfy the spot need of the buyer. The request includes information identifying the type of goods or services being procured by the buyer. Next, the system automatically selects a plurality of suppliers to invite to the on-line auction by querying a supplier database with information from the request. The supplier database includes records identifying suppliers capable of supplying a plurality of different goods and services to a spot marketplace. For each supplier represented in the supplier database, a record is stored in the supplier database, which includes information representing the capabilities of the supplier to deliver at least one good or service.

Abstract: Techniques for advancing a first bidder to a desired rank in an electronic auction are disclosed. In response to actuation of a bid rank advancement function by a first bidder, a new bid for the first bidder is calculated by applying a predetermined minimum differential value to a current bid of a second bidder that holds the desired rank in the electronic auction. The new bid is automatically submitted to the electronic auction on behalf of the first bidder.

Abstract: Techniques for advancing a first bidder to a desired rank in an electronic auction are disclosed. In response to actuation of a bid rank advancement function by a first bidder, a new bid for the first bidder is calculated by applying a predetermined minimum differential value to a current bid of a second bidder that holds the desired rank in the electronic auction. The new bid is automatically submitted to the electronic auction on behalf of the first bidder.

Abstract: An auction is conducted by obtaining, from a buyer, information associated with a product to be purchased using an auction, where the buyer purchases the product from a winning bidder. The obtained information associated with the product is made available to at least a first bidder and a second bidder. A first bid that includes a first price and a first non-price information is received from the first bidder. A second bid that includes a second price and a second non-price information is received, from the second bidder. Non-price information is associated with (1) a description of a particular product a given bidder will provide in the event the given bidder wins the auction and/or (2) delivery of a product by the given bidder in the event the given bidder wins the auction. A first comparison value is generated based at least in part on the first price and the first non-price information. A second comparison value is generated based at least in part on the second price and the second non-price information.

Abstract: The present invention provides a method for advancing a first bidder to a selected rank in an electronic auction. This method includes calculating, in response to actuation of a bid rank advancement function, a new bid for the first bidder, and displaying the new bid to the first bidder. The new bid is calculated by applying a predetermined minimum differential value to a current bid of a second bidder that holds the rank selected by the first bidder. In one embodiment, the rank selected by the first bidder is a rank other than first. The present invention also provides a system and apparatus for advancing a first bidder to a selected rank in an electronic auction.

Abstract: A method and apparatus for automatically updating the value of a bid variable or the total bid for a multi-variable bid in an online auction is disclosed. The method includes displaying an automatically adjustable mechanism interfaced to a bidder. Thereafter, the automatic bid adjustments are calculated using the mechanism.

Abstract: Controlling overtime in an auction is disclosed. A first time interval and a second time interval are defined. A first closing time for a first lot is also defined. A first bid is received for the first lot. A second bid is received for the first lot. A correlation between the second bid and the first bid is determined. The first closing time is extended using the second time interval if the correlation between the second bid and the first bid satisfies a trigger criterion. The trigger criterion is selected from a group consisting of a rank behind market and a quantity behind market.

Abstract: Control of overtime in an auction is disclosed. A first time interval, a second time interval, and a first closing time for a first lot are defined. It is determined that at least one new bid for the first lot is received during the first time interval. The new bid is received close to the first closing time. The first closing time is extended using the second time interval if the correlation between the new bid and the at least one other bid satisfies a trigger criterion that is based on a rank of the new bid and the at least one other bid.

Abstract: A method and system for conducting electronic online auctions having disguised bidding is disclosed. Submitted bids are ordered on a basis of a comparative bid parameter used by an originator of an auction. The ordinal rank of a bid is reported to the bidder.

Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.

Abstract: Information about a first lot and a second lot is displayed. The information includes a first closing time for the first lot, and a second closing time for the second lot. The second closing time is later than the first closing time. Responsive to the receipt of a bid for the first lot within a first predefined timer interval of the first closing time, an updated first closing time for the first lot is determined. The updated first closing time is displayed. If the updated first closing time is less than a second predefined time interval from the second closing time, an updated second closing time is displayed.

Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.

Abstract: A method and system for conducting electronic auctions is described. A dynamic lot closing extension feature avoids collisions in closing times of multiple lots by dynamically extending the closing time of a subsequent lot if a preceding lot's closing time is extended to be too close to the subsequent lot's then-currently scheduled closing time. Scheduled closing times can be extended with a flexible overtime feature, in which the properties of the event triggering the extension and the duration of the overtime period(s) can be tailored to a particular auction, particular lots of products within an auction, and to the particular time within an auction process. The bidding status of a lot can be set to a “pending” status after the nominal closing time for submission of bids to allow bidders to alert the auction coordinator of technical problems in submission of bids. This allows the possibility for a lot to be return to open status for further bidding by all bidders.

Abstract: A first lot and a second lot are presented to a plurality of bidders in a multi-lot electronic auction between an originator and the plurality of bidders. A closing time of the first lot precedes a closing time of the second lot. Bids are received from the plurality of bidders for the first lot. A closing time of the first lot is extended by an incremental amount of time upon an occurrence of an overtime trigger. If the difference in time between the extended closing time of the first lot precedes a closing time of the second lot by less than a minimum time interval, the closing time of the second lot is extended by the incremental amount of time.