نتایج جستجو برای: binomial nodes

تعداد نتایج: 141690  

2015
Richard P. Brent

Tuenter considered centered binomial sums of the form Sr(n) = 2n ∑

2004
Octavian Agratini Ioan A. Rus

In this paper we are concerned with a general class of positive linear operators of discrete type. Based on the results of the weakly Picard operators theory our aim is to study the convergence of the iterates of the defined operators and some approximation properties of our class as well. Some special cases in connection with binomial type operators are also revealed.

1995
Ilia Krasikov

The binomial distribution is a well known approximation to the distance spectra of many classes of codes. We derive a lower estimate for the deviation from the binomial approximation.

1999
Hong-Chen Fu

Abstract:We introduce excited binomial states and excited negative binomial states of the radiation field by repeated application of the photon creation operator on binomial states and negative binomial states. They reduce to Fock states and excited coherent states in certain limits and can be viewed as intermediate states between Fock states and coherent states. We find that both the excited b...

 Background: Modeling is one of the most important ways for explanation of relationship between dependent and independent response. Since data, related to number of blood donations are discrete, to explain them it is better to use discrete variable distribution like Poison or Negative binomial. This research tries to analyze numerical methods by using neural network approach and compare ...

Journal: :The Journal of Derivatives 1997

2017
Muhammad Aslam Osama H. Arif Chi-Hyuck Jun

In this article, an attribute control chart has been proposed using the accelerated hybrid censoring logic for the monitoring of defective items whose life follows a Weibull distribution. The product can be tested by introducing the acceleration factor based on different pressurized conditions such as stress, load, strain, temperature, etc. The control limits are derived based on the binomial d...

Journal: :Discrete Mathematics 1994
Reid Davis Carl G. Wagner

The. theory of reduced incidence algebras of binomial posets furnishes a unified treatment of several types of generating functions that arise in enumerative combinatorics. Using this theory as a tool, we study ‘reduced covering algebras’ of binomial lattices and show that they are isomorphic to various algebras of q-binomial generating functions for certain modular binomial lattices.

2016
Alona Bock Ralf Korn

Binomial trees are very popular in both theory and applications of option pricing. As they often suffer from an irregular convergence behavior, improving this is an important task. We build upon a new version of the Edgeworth expansion for lattice models to construct new and quickly converging binomial schemes with a particular application to barrier options.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید