Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 38 for “"Recursive formula"”.

  1. A recursive formula for the Khovanov cohomology of a family of 3-stranded pretzel knots

    … the Khovanov cohomology. We then prove a recursive formula for the class of three-stranded pretzel knots P(-n,-m,m), where n and m are odd. This result shows that the rank of the Khovanov cohomology of P(-n-m,m) is an invariant of n.

    unr Repository record for A recursive formula for the Khovanov cohomology of a family of 3-stranded pretzel knots (opens in a new tab)

  2. Rekursinė formulė begalinio laiko bankroto tikimybei kelių rizikų modelyje /

    Recursive formula for infinite time ruin probability in the multi-seasonal discrete-time risk model In this paper we investigate the three-seasonal discrete time risk model. In the beginning we introduce the topic. Later we give all necessary definitions and explain them. Then we formulate two …

    vilnius Repository record for Rekursinė formulė begalinio laiko bankroto tikimybei kelių rizikų modelyje / (opens in a new tab)

  3. Dviejų žalų sezoninio rizikos modelio bankroto tikimybė /

    … reduce insurer's surplus. Therefore, we submit recursive formula to calculate ruin probability in bi-seasonal discrete time risk model and its proof. Consequently, theoretical part is illustrated with numerical examples.

    vilnius Repository record for Dviejų žalų sezoninio rizikos modelio bankroto tikimybė / (opens in a new tab)

  4. Dviejų žalų sezoninio rizikos modelio bankroto tikimybė /

    … reduce insurer's surplus. Therefore, we submit recursive formula to calculate ruin probability in bi-seasonal discrete time risk model and its proof. Consequently, theoretical part is illustrated with numerical examples.

    vilnius Repository record for Dviejų žalų sezoninio rizikos modelio bankroto tikimybė / (opens in a new tab)

  5. Diskretaus laiko E. Sparre Andersen modelio bankroto laiko analizė /

    … infinite time ruin probabilities are defined. A recursive formula for calculating ruin time probabilities is derived, and the net profit condition is discussed. In the practical part of the thesis, cases in which claim sizes and interarrival times between claims are described by Poisson …

    vilnius Repository record for Diskretaus laiko E. Sparre Andersen modelio bankroto laiko analizė / (opens in a new tab)

  6. Jungtinio diskretaus laiko rizikos modelio išgyvenimo tikimybės /

    … form {X,X+Y,X+Z,X+Y,X,X+Y+X}. Also, we prove the recursive formula for ultimate time survival probability in a discrete-time two-risk model - {X,X+Y,X,X+Y,...}, in a slightly different way than previously known. Finally, according to the theoretical results, practical calculations with specific …

    vilnius Repository record for Jungtinio diskretaus laiko rizikos modelio išgyvenimo tikimybės / (opens in a new tab)

  7. Diskretaus laiko rizikos modelio bankroto tikimybė dviejų rizikų atveju /

    … time risk model. Applying these theorems and the recursive formula is needed to calculate the ruin probabilities. Ruin is also known as bankruptcy and it is defined as a state of insolvency when bankruptcy proceedings are pending. In order for companies to avoid bankruptcy risks, the probability …

    vilnius Repository record for Diskretaus laiko rizikos modelio bankroto tikimybė dviejų rizikų atveju / (opens in a new tab)

  8. Jungtinis dviejų žalų diskretaus laiko rizikos modelis su premija lygia dviem /

    … Alencenovič and A. Grigutis. In this article, a recursive formula for calculation of both finite and ultimate time survival probabilities in the case of bi-risk model is presented. Additionally, several numerical examples illustrating the application of the derived formulas are presented.

    vilnius Repository record for Jungtinis dviejų žalų diskretaus laiko rizikos modelis su premija lygia dviem / (opens in a new tab)

  9. Acyclic and indifference-transitive collective choice functions.

    … a complete characterization, as well as a recursive formula for counting the number of Arrovian ACIT collective choice functions with two voters.

    louisville Repository record for Acyclic and indifference-transitive collective choice functions. (opens in a new tab)

  10. Geometrically Nonlinear Arc Length Sparse Finite Element Analysis and Optimal Design of Truss Structures

    … approach within a discrete finite element formulation. The optimization method uses an iterative scheme that evaluates the performance of the design variables and then updates them according to a recursive formula that is controlled by the arc length method. A minimum weight design is …

    odu Repository record for Geometrically Nonlinear Arc Length Sparse Finite Element Analysis and Optimal Design of Truss Structures (opens in a new tab)

  11. Some problems related to plethysm

    … the case where µ = (12 ) by the means of a recursive formula of Law and Okitani. We study the ramified partition algebra, proving some new results about its representation theory. We show that the ramified partition algebra is a cellular algebra and investigate its cell modules. We show that …

    kent Download PDF for Some problems related to plethysm (opens in a new tab)

  12. Sums of Powers and the Bernoulli Numbers

    … historical events tracing the discovery of formulas for finite sums of powers of integers, the discovery of a single formula by Jacob Bernoulli which gives the Bernoulli numbers, and important discoveries related to the Bernoulli numbers. A method of generating the sequence by means of a …

    eiu Repository record for Sums of Powers and the Bernoulli Numbers (opens in a new tab)

  13. Statistical system identification and classification using Laguerre functions

    … on a deterministic approach in the form of a recursive formula and a stochastic method based on a group Lasso model. The aim of system identification was to improve the classification accuracies by removing the effect of the system from the observed PD waveforms. Through numerical evaluations …

    manitoba Repository record for Statistical system identification and classification using Laguerre functions (opens in a new tab)

  14. Latent class profile analysis : inference, estimation and its applications

    … intensive. On the contrary, if one adapts recursive scheme in the update steps, calculations will be simplified and become generalized to more time points. In light of this, we formulate each update step with recursive terms which are directly analogous to forward-backward algorithm (Chib, …

    msu Repository record for Latent class profile analysis : inference, estimation and its applications (opens in a new tab)

  15. Combinatorial approaches to problems about integer partitions and q-series

    … study is a class of core partitions. We prove a recursive formula for the generating polynomial for the number of parts of s-core partitions into d-distinct parts with a given maximum hook length. Applications of the main result of this section include formulas for the maximum number of parts of …

    uiuc Repository record for Combinatorial approaches to problems about integer partitions and q-series (opens in a new tab)

  16. QUANTUM RANDOM WALK ON FRACTALS

    … main part of this dissertation is to derive a recursive formula to compute the amplitude Green function. The exiting probability will be computed and compared with the classical results. When the generation of graphs goes to infinity, the recursion of the walks will be investigated and the …

    temple Repository record for QUANTUM RANDOM WALK ON FRACTALS (opens in a new tab)

  17. Normal Supercharacter Theories

    … theories (abbreviated NSCT). We present a recursive formula for supercharacters in an NSCT. The finest NSCT is constructed from the whole lattice of normal subgroups of G, and is a mechanism to study the behavior of conjugacy classes by the lattice of normal subgroups. We will uncover a …

    york Repository record for Normal Supercharacter Theories (opens in a new tab)

  18. Certain Diagonal Equations over Finite Fields

    … r | t and a, b ∈ F*q are related to α and β. A recursive formula for I(r; a, b) will be given and we illustrate this by computing I(r; a, b) for 2 ≤ r ≤ 4. We also show that N3(α, β) can be expressed in terms of the number of monic irreducible cubic polynomials over Fq with prescribed trace and …

    usf Repository record for Certain Diagonal Equations over Finite Fields (opens in a new tab)

  19. On the structure of Foulkes modules for the symmetric group

    … the case where $m$ is even. Further, we prove a recursive formula for computing character multiplicities of any generalised Foulkes character $\varphi^{(m^n)}_\nu$, and we decompose completely the character $\varphi^{(2^n)}_\nu$ in the cases where $\nu$ has either two rows or two columns, or is a …

    kent Download PDF for On the structure of Foulkes modules for the symmetric group (opens in a new tab)

Page 1 of 2