882 resultados para exponential sum onelliptic curve


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Multistep surface processes involving a number of association reactions and desorption processes may be considered as hypothetical one-step desorption processes. Thus, heterogeneous catalytic reactions can be treated kinetically as consisting of two steps: adsorption and desorption. It is also illustrated that the hypothetical one-step desorption process follows the BEP relation. A volcano curve can be obtained from kinetic analysis by including both adsorption and desorption processes.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper studies a problem of dynamic pricing faced by a retailer with limited inventory, uncertain about the demand rate model, aiming to maximize expected discounted revenue over an infinite time horizon. The retailer doubts his demand model which is generated by historical data and views it as an approximation. Uncertainty in the demand rate model is represented by a notion of generalized relative entropy process, and the robust pricing problem is formulated as a two-player zero-sum stochastic differential game. The pricing policy is obtained through the Hamilton-Jacobi-Isaacs (HJI) equation. The existence and uniqueness of the solution of the HJI equation is shown and a verification theorem is proved to show that the solution of the HJI equation is indeed the value function of the pricing problem. The results are illustrated by an example with exponential nominal demand rate.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A robust method for fitting to the results of gel electrophoresis assays of damage to plasmid DNA caused by radiation is presented. This method makes use of nonlinear regression to fit analytically derived dose response curves to observations of the supercoiled, open circular and linear plasmid forms simultaneously, allowing for more accurate results than fitting to individual forms. Comparisons with a commonly used analysis method show that while there is a relatively small benefit between the methods for data sets with small errors, the parameters generated by this method remain much more closely distributed around the true value in the face of increasing measurement uncertainties. This allows for parameters to be specified with greater confidence, reflected in a reduction of errors on fitted parameters. On test data sets, fitted uncertainties were reduced by 30%, similar to the improvement that would be offered by moving from triplicate to fivefold repeats (assuming standard errors). This method has been implemented in a popular spreadsheet package and made available online to improve its accessibility. (C) 2011 by Radiation Research Society

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present spectroscopy and photometry of the He-rich supernova (SN) 2008ax. The early-time spectra show prominent P-Cygni H lines, which decrease with time and disappear completely about 2 months after the explosion. In the same period He I lines become the most prominent spectral features. SN 2008ax displays the ordinary spectral evolution of a Type IIb supernova. A stringent pre-discovery limit constrains the time of the shock breakout of SN 2008ax to within only a few hours. Its light curve, which peaks in the B band about 20 d after the explosion, strongly resembles that of other He-rich core-collapse supernovae. The observed evolution of SN 2008ax is consistent with the explosion of a young Wolf-Rayet (of WNL type) star, which had retained a thin, low-mass shell of its original H envelope. The overall characteristics of SN 2008ax are reminiscent of those of SN 1993J, except for a likely smaller H mass. This may account for the findings that the progenitor of SN 2008ax was a WNL star and not a K supergiant as in the case of SN 1993J, that a prominent early-time peak is missing in the light curve of SN 2008ax, and that H alpha is observed at higher velocities in SN 2008ax than in SN 1993J.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced. This can perform the main prime field arithmetic functions needed in these cryptosystems including modular inversion and multiplication. This is based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation. The processor described uses a full-word multiplier which requires much fewer clock cycles than previous methods, while still maintaining a competitive critical path delay. The benefits of the approach have been demonstrated by utilizing these techniques to create a field-programmable gate array (FPGA) design. This can perform a 256-bit prime field scalar point multiplication in 3.86 ms, the fastest FPGA time reported to date. The ECC architecture described can also perform four different types of modular inversion, making it suitable for use in many different ECC applications. © 2006 IEEE.