Exponential stability of impulsive jump linear systems with Markov process

The exponential stability is investigated for a class of continuous time linear systems with a finite state Markov chain form process and the impulsive jump at switching moments. The conditions, based on the average dwell time and the ratio of expectation of the total time running on all unstable subsystems to the expectation of the total time running on all stable subsystems,assure the exponential stability with a desired stability degree of the system irrespective of the impact of impulsive jump. The uniformly bounded result is realized for the case in which switched system is subjected to the impulsive effect of the excitation signal at some switching moments.

Hausdorff Dimension of Range and Graph for General Markov Processes

We establish the Hausdorff dimension of the graph of general Markov processes on Rd based on some probability estimates of the processes staying or leaving small balls in small time.In particular,our results indicate that,for symmetric diffusion processes(withα=2)or symmetricα-stable-like processes(withα∈(0,2))on Rd,it holds almost surely that dimH GrX([0,1])=1{α<1}+(2−1/α)1{α≥1,d=1}+(d∧α)1{α≥1,d≥2}.We also systematically prove the corresponding results about the Hausdorff dimension of the range of the processes.

THE EQUILIBRIUM PROBLEM AND CAPACITY FOR JUMP MARKOV PROCESSES

Let X=(Omega,F,F-t,X(t),theta(t),P-x) be a jump Markov process with q-pair q(x)-q(x, A). In this paper, the equilibrium principle is established and equilibrium functions, energy, capacity and related problems is investigated in terms of the q-pair q(x)-q(x, A).

Non-Recursive Base Conversion Using a Deterministic Markov Process

We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, in general. And we include a comparison between non-recursion and a deterministic Markov process, proving that the Markov process is twice as efficient.

MOMENTS OF PASSAGE TIMES AND ASYMPTOTIC BEHAVIOR OF INCREASING SELF-SIMILAR MARKOV PROCESSES

By using Lamperti＇s bijection between self-similar Markov processes and L@vy processes~ we prove finiteness of moments and asymptotic behavior of passage times for increasing self-similar Markov processes valued in （0, ~）. We Mso investigate the behavior of the process when it crosses a level. A limit theorem concerning the distribution of the process immediately before it crosses some level is proved. Some useful examples are given.

Seismic response evaluation of the impact of corrosion on buried pipelines based on the Markov process

Water distribution and gas supply systems are among the infrastructure systems that have many buried steel pipelines. Corrosion gradually appears inside and outside of the pipe walls over the service life of these pipelines, the corrosion is primarily caused by the surrounding soil and the materials that flow through the pipelines. However, due to the uncertainty of the characteristics of the soil and materials, the size of the corrosion region is a stochastic variable. In this paper, using a homogeneous Markov process, a model is presented to simulate the occurrence of corrosion. Then, in combinations with a linear corrosion development model, the probability density function of the pipeline area corrosion percentage is derived. Based on the corrosion model, the pipeline seismic displacements and stresses are predicted. Furthermore, using the random perturbation approach, the mean and variance of the pipeline seismic response are given. To illustrate the validity of the proposed approach, a 200-meter long pipeline is numerically investigated and its random seismic response is obtained.

Asymptotic Evaluations of the Stability Index for a Markov Control Process with the Expected Total Discounted Reward Criterion

In this work, for a control consumption-investment process with the discounted reward optimization criteria, a numerical estimate of the stability index is made. Using explicit formulas for the optimal stationary policies and for the value functions, the stability index is explicitly calculated and through statistical techniques its asymptotic behavior is investigated (using numerical experiments) when the discount coefficient approaches 1. The results obtained define the conditions under which an approximate optimal stationary policy can be used to control the original process.

Definition of Laplace Transforms for Distribution of the First Passage of Zero Level of the Semi-Markov Random Process with Positive Tendency and Negative Jump

One of the important problems of stochastic process theory is to define the Laplace transforms for the distribution of semi-markov random processes. With this purpose, we will investigate the semimarkov random processes with positive tendency and negative jump in this article. The first passage of the zero level of the process will be included as a random variable. The Laplace transforms for the distribution of this random variable is defined. The parameters of the distribution will be calculated on the basis of the final results.

On approximating multifractal traffic burstiness with Markov modulated Poisson processes

We investigate the approximating capability of Markov modulated Poisson processes (MMPP) for modeling multifractal Internet traffic. The choice of MMPP is motivated by its ability to capture the variability and correlation in moderate time scales while being analytically tractable. Important statistics of traffic burstiness are described and a customized moment-based fitting procedure of MMPP to traffic traces is presented. Our methodology of doing this is to examine whether the MMPP can be used to predict the performance of a queue to which MMPP sample paths and measured traffic traces are fed for comparison respectively, in addition to the goodness-of-fit test of MMPP. Numerical results and simulations show that the fitted MMPP can approximate multifractal traffic quite well, i.e. accurately predict the queueing performance.

Markov process functionals in finance and insurance

The Markov property of Markov process functionals which are frequently used in economy, finance, engineering and statistic analysis is studied. The conditions to judge Markov property of some important Markov process functionals are presented, the following conclusions are obtained： the multidimensional process with independent increments is a multidimensional Markov process; the functional in the form of path integral of process with independent increments is a Markov process; the surplus process with the doubly stochastic Poisson process is a vector Markov process. The conditions for linear transformation of vector Markov process being still a Markov process are given.

Modeling and Design of Real-Time Pricing Systems Based on Markov Decision Processes

A real-time pricing system of electricity is a system that charges different electricity prices for different hours of the day and for different days, and is effective for reducing the peak and flattening the load curve. In this paper, using a Markov decision process (MDP), we propose a modeling method and an optimal control method for real-time pricing systems. First, the outline of real-time pricing systems is explained. Next, a model of a set of customers is derived as a multi-agent MDP. Furthermore, the optimal control problem is formulated, and is reduced to a quadratic programming problem. Finally, a numerical simulation is presented.

SMALL PERTURBATION CRAMER METHODS AND MODERATE DEVIATIONS FOR MARKOV PROCESSES

This paper presents a small perturbation Cramer method for obtaining the large deviation principle of a family of measures (β,ε> 0) on a topological vector space. As an application, we obtain the moderate deviation estimations for uniformly ergodic Markov processes.

An Optimized Vertical Handoff Algorithm Based on Markov Process in Vehicle Heterogeneous Network

In order to solve the problem the existing vertical handoff algorithms of vehicle heterogeneous wireless network do not consider the diversification of network's status, an optimized vertical handoff algorithm based on markov process is proposed and discussed in this paper. This algorithm takes into account that the status transformation of available network will affect the quality of service(Qo S) of vehicle terminal's communication service. Firstly, Markov process is used to predict the transformation of wireless network's status after the decision via transition probability. Then the weights of evaluating parameters will be determined by fuzzy logic method. Finally, by comparing the total incomes of each wireless network, including handoff decision incomes, handoff execution incomes and communication service incomes after handoff, the optimal network to handoff will be selected. Simulation results show that: the algorithm proposed, compared to the existing algorithm, is able to receive a higher level of load balancing and effectively improves the average blocking rate, packet loss rate and ping-pang effect.

Robust H_∞ Control for Uncertain Markovian Jump Linear Time-Delay Systems

This paper studies the robust stochastic stabilization and robust H∞ control for linear time-delay systems with both Markovian jump parameters and unknown norm-bounded parameter uncertainties. This problem can be solved on the basis of stochastic Lyapunov approach and linear matrix inequality (LMI) technique. Sufficient conditions for the existence of stochastic stabilization and robust H∞ state feedback controller are presented in terms of a set of solutions of coupled LMIs. Finally, a numerical example is included to demonstrate the practicability of the proposed methods.

改进的Markov和联合密度特征的MP3隐写分析方法

提出了一种MDCT(修正的离散余弦变换)域的MP3隐写分析方法。该方法通过改进的Markov特征集和联合密度特征集提取出MDCT系数的特征,经过方差分析选择有效的特征用于支持向量机(SVM)的训练与检测。实验结果表明,与以往方法相比提高了对MP3Stego的检测率,能有效地检测常见的MDCT系数修改的MP3信息隐藏方法。

Convergence of Invariant Measures of Truncation Approximations to Markov Processes

Let Q be the Q-matrix of an irreducible, positive recurrent Markov process on a countable state space. We show that, under a number of conditions, the stationary distributions of the n × n north-west corner augmentations of Q converge in total variation to the stationary distribution of the process. Two conditions guaranteeing such convergence include exponential ergodicity and stochastic monotonicity of the process. The same also holds for processes dominated by a stochastically monotone Markov process. In addition, we shall show that finite perturbations of stochastically monotone processes may be viewed as being dominated by a stochastically monotone process, thus extending the scope of these results to a larger class of processes. Consequently, the augmentation method provides an attractive, intuitive method for approximating the stationary distributions of a large class of Markov processes on countably infinite state spaces from a finite amount of known information.

Digital Twin-based Quality Management Method for the Assembly Process of Aerospace Products with the Grey-Markov Model and Apriori Algorithm

The assembly process of aerospace products such as satellites and rockets has the characteristics of single-or small-batch production,a long development period,high reliability,and frequent disturbances.How to predict and avoid quality abnormalities,quickly locate their causes,and improve product assembly quality and efficiency are urgent engineering issues.As the core technology to realize the integration of virtual and physical space,digital twin(DT)technology can make full use of the low cost,high efficiency,and predictable advantages of digital space to provide a feasible solution to such problems.Hence,a quality management method for the assembly process of aerospace products based on DT is proposed.Given that traditional quality control methods for the assembly process of aerospace products are mostly post-inspection,the Grey-Markov model and T-K control chart are used with a small sample of assembly quality data to predict the value of quality data and the status of an assembly system.The Apriori algorithm is applied to mine the strong association rules related to quality data anomalies and uncontrolled assembly systems so as to solve the issue that the causes of abnormal quality are complicated and difficult to trace.The implementation of the proposed approach is described,taking the collected centroid data of an aerospace product’s cabin,one of the key quality data in the assembly process of aerospace products,as an example.A DT-based quality management system for the assembly process of aerospace products is developed,which can effectively improve the efficiency of quality management for the assembly process of aerospace products and reduce quality abnormalities.

Development of Optimal Maintenance Policies for Offshore Wind Turbine Gearboxes Based on the Non-homogeneous Continuous-Time Markov Process

Gearbox in offshore wind turbines is a component with the highest failure rates during operation. Analysis of gearbox repair policy that includes economic considerations is important for the effective operation of offshore wind farms. From their initial perfect working states, gearboxes degrade with time, which leads to decreased working efficiency. Thus, offshore wind turbine gearboxes can be considered to be multi-state systems with the various levels of productivity for different working states. To efficiently compute the time-dependent distribution of this multi-state system and analyze its reliability, application of the nonhomogeneous continuous-time Markov process(NHCTMP) is appropriate for this type of object. To determine the relationship between operation time and maintenance cost, many factors must be taken into account, including maintenance processes and vessel requirements. Finally, an optimal repair policy can be formulated based on this relationship.

ON THE HITTING PROBABILITY AND POLARITY FOR A CLASS OF SELF-SIMILAR MARKOV PROCESSES

The anthem investigate the hitting probability, polarity and the relationship between the polarity and Hausdorff dimension for self-similar Markov processes with state space (0, infinity) and increasing path.

MARKOV SKELETON PROCESS IN PERT NETWORKS

In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related to this path such that the completion time of the sub-network （only consisting of all the related activities） is equal to the completion time of this path. We use the elapsed time as the supplementary variables and model this sub-network as a Markov skeleton process, the state space is related to the subnetwork structure. Then use the backward equation to compute the distribution of the sub-network＇s completion time, which is an important rule in project management and scheduling.