Properties of Quadratic Weighted Markov Branching Processes with Immigration and Resurrection
In this paper we study the regularity,uniqueness,recurrence and ergodicity of the quadratic weighted Markov branching processes with immigration and resurrection(QWMBPIR).Firstly,we investigate the properties of the generating function for QWMBIR q-matrix.It is proved that the QWMBPIR is regular and unique.Then we discuss the recurrence and ergodicity of QWMBPIR and give a sufficient condition for the ergodicity.
General Exchange Option Pricing in Sub-fractional Brownian Motion Environments
his paper studies the pricing problem of general exchange options in sub-fractional Brownian motion environments.Under the condition that the two stock pricing processes obey the stochastic differential equation driven by the sub-fractional Brownian motion,the pricing formula of the general exchange options is obtained by insurance actuary pricing.
Stability Analysis of Solutions for a Class of Stochastic Difference Equations
In this paper we study the image denoising algorithm based on total variation.The corresponding optimization model is solved by the steepest descend method,the difference iterative method and the split Bregman method,respectively.Experiment results show that the difference iterative method convergences rapidly,and achieves better denoising performances.
A Risk Model of Two Type Claims Under a Ruin Threshold
In this paper,we study a risk model of two type claims under a time-dependent ruin bound,where one term policy’s arrival intensity follows a Poisson process of parameterλand its refunding,its abnormal claims and normal claims are respectively relate to the policies ofρ1-thinning process,ρ2-thinning process andρ3 -thinning process,while the other term policy and claim arrival both follow the compound negative binomial distribution.For the risk model we investigate the properties of the surplus process by applying the martingale approach and derive the formula of ruin probability and the Lundberg inequality.
Ruin Probability of a Dependent Risk Model with Generalized Polya-Aeppli Distribution
In this paper,we study the ruin probability of a risk model with two dependent compensation processes based on the generalized Polya-Aeppli distribution.Firstly,the joint probability distribution function and the precise expressions of moments for a class of dependent processes are derived by applying the probability generating function defined by Kocherlakota (1995).Then two kinds of ruin models are formulated,and the corresponding ruin probabilities are obtained by using the Laplace transformation to covert computing ruin probability to calculating probability distribution function of the cumulative claims when the claims follow the exponential distribution.The generalized Polya-Aeppli distribution defines a class of discrete distributions with correlation.It overcomes the over-dispersion problem of the actual data which cannot be modeled by Poisson process,and is easy to estimate the parameters.Thus our approach has a wide range of applicability.
A New Cryptosystem Based on a Kind of Integer Matrix Equations
Numerical Simulation of Heavy Metal Migration Process in Submarine Near Deep Sea Mining
Extension of the Wallis Formula and Stirling Formula
Let {Xk,1≤k ≤n}be independent and identically distributed random variables with bilaterally truncated Cauchy distribution of parameters μ,λ,A,B,X1,n,X2,n,…,Xn,n be their order statistics.In this paper we obtain the density function of Xk,n,the joint density function of X1,n,X2,n,…,Xn,n,the asymptotic distributions of their extreme order statistics X1,n and Xn,n,and the asymptotic distributions of Xk,n and Xn-k+1,n.We also show that X1,n and Xn,n is asymptotically independent.
Solving the Optimization Model of Equipment Preventive Maintenance Period with the Genetic Algorithm and Nonlinear Programming
Branching and order-reducing are widely used for solving NP-Hard Problems.The main idea of the approach is to solve the problem by decomposing it into two or more sub-problems,and the sub-problems can be recursively solved.But we cannot get a better result by using the normal complexity analyticalmethod since it is not so accurate.The measure and conquer approach is a new technique for algorithm design and complexity analysis.This paper designs an algorithm to solve the weighted maximum clique problem and uses traditional analysis technology to analyze the worst-case running time of the algorithm and gets O(1.4656np(n))running time,where p(n)is the polynomial function of node number nin the problem.We employ the measure and conquer approach to improve the time complexity of the algorithm from O(1.4656np(n)) to O (1.3765np(n))without modifying the algorithm. Our results show that the measure and conquer approach can give more precise time complexity.
Research on Credit Risk Prevention of Commercial Bank in China Based on Multiple Linear Regression