Abstract: Methods and media for forming a bound network are provided. In some embodiments, methods for forming a bound network include: decomposing an asynchronous input network to form a network of base functions, wherein the network of base functions includes simple base functions that include two-input threshold OR functions and two-input threshold AND functions with hysteresis, and complex base functions generated during the decomposing; partitioning the network of base functions into at least one subject graph, each portion of the at least one subject graph having a function; determining matches between the at least one subject graph and one or more pattern graphs; and selecting at least one of the one or more pattern graphs to be used in the bound network for the function of each of different portions of the at least one subject graph.

Abstract: A method, program and system for analyzing product price structures are provided by the present invention. The invention involves receiving product information about a multi-component product, such as a service plan, and analyzing individual price elements within the multi-component product. These individual price elements may include, purchase price, fixed periodic charges, up-front charges, variable charges, discounts, service contract length, service and maintenance costs, labor costs, and purchase minimums. The invention then determines customer requirements and calculates the total cost over an estimate service life of the product according to these requirements. This projected total cost is then converted to a single figure of merit that reduces the price structure of the product to a single financial figure that can be compared across products with different price structures.

Abstract: The present invention provides a reverse auction system for procuring goods and services. A customer business provides details concerning its needs by means of a detailed questionnaire. An invitation to bid is then sent to potential sellers. The invention rates bidders according to quality and risk based on historical data of customer service. The bidding occurs over a specified number of rounds. Bidding is semi-blind, wherein bidders can view the bids, bid evaluations, and bid ranking for each preceding round, but not the current round. Bidding may be done manually or through an automate proxy system. Bidders are identified only by their respective quality and risk ratings. After each round, bidders are ranked according to a three-factor evaluation that combines bid price, quality rating, and risk rating and compares them to the supplied customer information.

Abstract: The present invention provides a method, program and system for automated proxy bidding in an auction. The invention includes defining a desired price position relative to competing bids based on qualitative ratings associated with competing bidders and submitting a bid related to a product. Competing bids are retrieved along with the qualitative ratings associated with each competing bidder, and a determination is made as to whether the submitted bid achieves the desired price position relative to the competing bids. If the submitted bid does not achieve the desired price position relative to the competing bids, the bid is adjusted according to a predefined sequence of price moves. The desired price position might have a specified premium relative to competing bidders with lower qualitative ratings and a specified discount relative to competing bidders with comparable and higher qualitative ratings.

Abstract: A method, program and system for conducting a reverse auction are provided by the present invention. The auction is divided into a specified number of rounds of specified duration, and bids are received from a plurality of bidders. The bidders are rated according to specified qualitative parameters. While the auction is open the bidders are anonymous to each other and are identified only by their respective qualitative ratings. Bidders may only view competing bids, and their own relative bid ranking, from previously closed rounds. The customer of the reverse auction has complete discretion in choosing the winner.

Abstract: A latchless dynamic asynchronous digital pipeline circuit provides decoupled control of pull-up and pull-down. Using two decoupled input, a stage is driven through three distinct phases in sequence: evaluate, isolate and precharge. In the isolate phase, a stage holds its outputs stable irrespective of any changes at its inputs. Adjacent pipeline stages are capable of storing distinct data items without spacers.