Abstract: A system, method and computer program product are provided for performing a contingent claim valuation of a multi-stage option including a plurality of contingent claims exercisable at a plurality of respective exercise points including one or more exercise points before an expiration exercise point. The method may include determining a present value distribution of contingent future benefits attributable to the exercise of the contingent claim at the expiration exercise point, including discounting a distribution of contingent future benefits according to a first discount rate; and determining present values of exercise prices required to exercise the contingent claim at respective exercise points, including discounting exercise prices at respective exercise points according to a second discount rate that need not equal the first discount rate.

Abstract: A system, method and computer program product are provided for determining a minimum future benefits value for exercising a contingent claim of an option. The method may include determining present value distribution(s) of contingent future value and present value(s) of respective exercise price(s) at an expiration exercise point and/or one or more decision points before that point. Determining these present value distribution(s) and present value(s) may include discounting respective distribution(s) and value(s) according to first and second discount rates, respectively. The method may also include repeatedly determining, for a plurality of candidate minimum asset values at a selected decision point, respective values based upon one or more of the present value distribution(s) and one or more of the present value(s), where the respective values may be conditioned on the candidate minimum asset values. A candidate minimum asset value that maximizes the value may then be selected.

Abstract: A system, method and computer program product are provided for performing a contingent claim valuation of an early-launch option including a contingent claim exercisable at one of a plurality of decision points including one or more decision points before an expiration exercise point. The method may include determining first and second values representing payoffs attributable to exercise of a contingent claim at a selected decision point before the expiration exercise point, and at the expiration exercise point, respectively. The first and/or second values may be determined based upon respective present value distribution of contingent future value and a respective present value of an exercise price, the present values including a respective distribution and exercise price discounted according to first and second discount rates, respectively. A value of the contingent claim may then be determined based upon the first value and/or the second value.

Abstract: A system, method and computer program product are provided for determining a minimum future benefits value for exercising a contingent claim of an option. The method may include determining a present value distribution of contingent future benefits at an expiration exercise point, and present values of respective exercise prices at the expiration exercise point and one or more decision points before that point. Determining these present value distribution and present values may include discounting a distribution and respective values according to first and second discount rates, respectively. The method may also include repeatedly determining, for a plurality of forecasted asset values at a selected decision point, respective values based upon the present value distribution and the present values, where the respective values may be conditioned on the forecasted asset values. A forecasted asset value that maximizes the value may then be selected.

Abstract: A system, method and computer program product are provided for performing a contingent claim valuation of a combination option including one or more multi-stage contingent claims, and an early-launch contingent claim. The method may include determining a first value representing payoffs attributable to exercise of the early-launch contingent claim at a selected decision point; and a second value representing payoffs the attributable to exercise of the multi-stage contingent claim(s) at respective decision point(s), and a contingent claim at an expiration exercise point. The first and/or second values may be determined based upon a respective present value distribution of contingent future value and a respective present value of an exercise price, the present values including a respective distribution and exercise price discounted according to first and second discount rates, respectively. A value of the contingent claim may then be determined based upon the first value and/or the second value.

Abstract: A system, method and computer program product are provided for determining a minimum future benefits value for exercising a contingent claim of an option. The method may include determining a present value of an asset at a selected decision point, and a present value of an exercise price required to exercise a contingent claim at the selected decision point. Determining the present values of the asset and exercise price may include discounting a respective candidate minimum asset value and exercise price according to first and second discount rates, respectively. A first value may be determined based thereupon, and may be repeatedly determined (along with present values of the asset and exercise price) for one or more candidate minimum asset values to identify a candidate for which a first value approximately equals a second value representing a payoff attributable to the exercise of a contingent claim at the expiration exercise point.

Abstract: A system and method for forming high resolution electronic circuits on a substrate is provided. The system (10) includes a substrate (12), a source of radiant energy (34) and a focusing means (16). The source of radiant energy (34) directs an energy beam (14) through the focusing means (16) in order to direct a focused energy beam (18) onto the surface of the substrate (12). The focused energy beam (18) creates a plurality of channels (20) in the surface of the substrate (12). A paste applicator (22) fills the channels (20) with an electrically conductive paste (24). Once heated and cured, the electrically conductive paste (24) makes up the electrically conductive pathways of the electronic circuit.

Abstract: A method of forming high resolution electronic circuits (10) on a substrate (12) is provided. The method includes the steps of laminating a dielectric layer (14) on a substrate (12), laser drilling channels (16 and 18) in the dielectric film (14) and the substrate (12), and filling channels (16 and 18) with a filler material (20). Further, a release layer (22) is applied to dielectric film layer (14) and filler material (20), the release layer (22) having an adhesive thereon. Release layer (22) is peeled or otherwise removed from substrate (12), leaving filler material (20) formed and shaped on substrate (12), thus producing a high resolution electronic circuit on substrate (12).

Abstract: A method is provided that includes modeling future demand and/or future supply for a good at one or more segments of a period of time. In accordance with the method, future demand/supply at a respective time segment is modeled based upon a price sensitivity distribution of a unit purchase of the good, as well as a market potential distribution of a number of units of the good in a market associated with the good, during the respective time segment. The price sensitivity distribution and/or the market potential distribution for a respective time segment is based upon a growth rate and an uncertainty for the respective time segment. The method can further include modeling cost and/or profitability of the good at a respective time segment. Profitability can be modeled based upon the demand model and the cost model for the respective time segment.

Abstract: A method is provided that includes defining a plurality of independent component markets for a good. In accordance with the method, each component market can be defined a respective price sensitivity distribution of a unit purchase of the good, as well as a market potential distribution of a number of units of the good. The demand and/or supply in the aggregate market can thus then be modeled based upon the price sensitivity distributions and market potential distributions of the component markets. The method can further include modeling cost and/or profitability of the good in an aggregate market. Profitability can be modeled based upon the demand model and the cost model for the aggregate market.

Abstract: A method is provided that includes modeling demand and/or future supply for a good in a differentiated market. In accordance with the method, demand/supply in a differentiated market is modeled by first modeling demand and/or supply for a good in a non-differentiated market based upon a price sensitivity distribution of a unit purchase of the good, as well as a market potential distribution of a number of units of the good in a market associated with the good. Thereafter, the model of demand and/or supply in the non-differentiated market is integrated to thereby model demand and/or supply for a good in a differentiated market. The method can further include modeling cost and/or profitability of the good in a differentiated market. Profitability can be modeled based upon the demand model and the cost model for the differentiated market.

Abstract: A method includes providing a plurality of component modules in a spreadsheet environment. Each component module is capable of modeling a portion of an event and includes at least one process. Each component module can be accessed independent of the other component modules, and at least one component module includes at least one input and at least one component module includes at least one output. The inputs and the outputs can be linked to thereby model the event. Thereafter, the processes of the component modules can be performed to simulate the event.

Abstract: A method of forming high resolution electronic circuits (10) on a substrate (12) is provided. The method includes the steps of laminating a dielectric layer (14) on a substrate (12), laser drilling channels (16 and 18) in the dielectric film (14) and the substrate (12), and filling channels (16 and 18) with a filler material (20). Further, a release layer (22) is applied to dielectric film layer (14) and filler material (20), the release layer (22) having an adhesive thereon. Release layer (22) is peeled or otherwise removed from substrate (12), leaving filler material (20) formed and shaped on substrate (12), thus producing a high resolution electronic circuit on substrate (12).

Abstract: A method of creating microstructures by contact transfer process includes the step of positioning a material covered ribbon in proximity with the surface of the substrate, directing a laser beam onto the material covered ribbon, so that the laser beam releases a portion of the material layer and transfers the released material onto the surface of the substrate. The material covered ribbon includes a transparent support and a material layer of the thickness in the range of 2-15 microns of highly homogeneous and uniformly distributed material, which includes a powder of very small particles the dimensions of which do not exceed 10 microns bound by a binder which provides a needed degree of viscosity to the material, which, being released from the material layer, is transferred to the surface of the substrate as a single piece. In order to create a microstructure, several repetitions of releasing the material and transferring the released material to the substrate is needed.

Abstract: A computer product, method, and apparatus for causing a computer to perform load operations in a particular way are disclosed. The computer is made to replace a load instruction at a particular location in a computer program instruction sequence with two instructions, an advanced load instruction and a load check instruction. The advanced load instruction is inserted into the instruction sequence up-stream from where the original load instruction was located, and may be inserted above store instructions. The load check instruction is inserted into the instruction sequence after the store instructions. An Advanced Load Address Table (ALAT) structure, containing physical address data and validity data for each non-speculative advanced load, is updated with data about each advanced load and each store instruction executed, and queried on execution of each load check instruction about whether or not a particular advanced load is safe to use.

Abstract: The invention provides for a content addressable memory (CAM). The CAM includes an input port and a plurality of locations to store page addresses for comparing to an address received from the input port. Each location includes a plurality of lower cells and at least one page size mask cell to send signals to an associated one of the lower cells. The associated one of the lower cells produces a match signal in response to either the page size cell sending a mask signal or to the portion page address stored therein matching a corresponding portion of the address received from the input port. Each location produces a match signal in response to each cell therein producing a match signal. The invention provides for a method of translating logical to physical addresses.

Abstract: A method and apparatus for managing a memory region that stores locked and unlocked data. Data stored in the memory region is accessed. The data has an associated index that is stored in a locked index queue. While the index is stored in the locked index queue, the data is locked.

Abstract: A method and apparatus for storing, locking, and unlocking data in a memory array. The memory array includes a first line to store a first type of data while the first line is unlocked during a first period of time and to store a second type of data while the first line is locked during a subsequent second period of time. The memory array further includes a second line to store the second type of data while the second line is locked during the first period of time and to store the first type of data while the second line is unlocked during the second period of time.