首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
This paper is mainly concerned with hybrid-driven H filtering for a class of Takagi–Sugeno (T–S) fuzzy systems with quantization. To reduce the redundancy of transmission data and save the network bandwidth, a hybrid-driven scheme and a logarithmic quantizer are introduced in this paper. Firstly, by taking the effect of hybrid-driven scheme and quantization into consideration, a mathematical H filter model for T–S fuzzy systems is constructed. Secondly, by applying Lyapunov stability theory, sufficient conditions for asymptotical stabilization of desired system are obtained. Moreover, an explicit algorithm for H filter design is presented with the help of linear matrix inequality (LMI) techniques. Finally, numerical and physical simulations show the usefulness of the proposed filter design approach.  相似文献   

2.
A level-dependent Lévy process solves the stochastic differential equation dU(t)=dX(t)??(U(t))dt, where X is a spectrally negative Lévy process. A special case is a multi-refracted Lévy process with ?k(x)=j=1kδj1{xbj}. A general rate function ? that is non-decreasing and locally Lipschitz continuous is also considered. We discuss solutions of the above stochastic differential equation and investigate the so-called scale functions, which are counterparts of the scale functions from the theory of Lévy processes. We show how fluctuation identities for U can be expressed via these scale functions. We demonstrate that the derivatives of the scale functions are solutions of Volterra integral equations.  相似文献   

3.
We consider the Griffith fracture model in two spatial dimensions, and prove existence of strong minimizers, with closed jump set and continuously differentiable deformation fields. One key ingredient, which is the object of the present paper, is a generalization to the vectorial situation of the decay estimate by De Giorgi, Carriero, and Leaci. This is based on replacing the coarea formula by a method to approximate SBDp functions with small jump set by Sobolev functions, and is restricted to two dimensions. The other two ingredients will appear in companion papers and consist respectively in regularity results for vectorial elliptic problems of the elasticity type and in a method to approximate in energy GSBDp functions by SBVp ones.  相似文献   

4.
《Discrete Mathematics》2019,342(5):1275-1292
A discrete function of n variables is a mapping g:X1××XnA, where X1,,Xn, and A are arbitrary finite sets. Function g is called separable if there exist n functions gi:XiA for i=1,,n, such that for every input x1,,xn the function g(x1,,xn) takes one of the values g1(x1),,gn(xn). Given a discrete function g, it is an interesting problem to ask whether g is separable or not. Although this seems to be a very basic problem concerning discrete functions, the complexity of recognition of separable discrete functions of n variables is known only for n=2. In this paper we will show that a slightly more general recognition problem, when g is not fully but only partially defined, is NP-complete for n3. We will then use this result to show that the recognition of fully defined separable discrete functions is NP-complete for n4.The general recognition problem contains the above mentioned special case for n=2. This case is well-studied in the context of game theory, where (separable) discrete functions of n variables are referred to as (assignable) n-person game forms. There is a known sufficient condition for assignability (separability) of two-person game forms (discrete functions of two variables) called (weak) total tightness of a game form. This property can be tested in polynomial time, and can be easily generalized both to higher dimension and to partially defined functions. We will prove in this paper that weak total tightness implies separability for (partially defined) discrete functions of n variables for any n, thus generalizing the above result known for n=2. Our proof is constructive. Using a graph-based discrete algorithm we show how for a given weakly totally tight (partially defined) discrete function g of n variables one can construct separating functions g1,,gn in polynomial time with respect to the size of the input function.  相似文献   

5.
6.
This paper studies the properties of ?1-symmetric vector random fields in Rd, whose direct/cross covariances are functions of ?1-norm. The spectral representation and a turning bands expression of the covariance matrix function are derived for an ?1-symmetric vector random field that is mean square continuous. We also establish an integral relationship between an ?1-symmetric covariance matrix function and an isotropic one. In addition, a simple but efficient approach is proposed to construct the ?1-symmetric random field in Rd, whose univariate marginal distributions may be taken as arbitrary infinitely divisible distribution with finite variance.  相似文献   

7.
We consider subordinators Xα=(Xα(t))t0 in the domain of attraction at 0 of a stable subordinator (Sα(t))t0 (where α(0,1)); thus, with the property that Π¯α, the tail function of the canonical measure of Xα, is regularly varying of index ?α(?1,0) as x0. We also analyse the boundary case, α=0, when Π¯α is slowly varying at 0. When α(0,1), we show that (tΠ¯α(Xα(t)))?1 converges in distribution, as t0, to the random variable (Sα(1))α. This latter random variable, as a function of α, converges in distribution as α0 to the inverse of an exponential random variable. We prove these convergences, also generalised to functional versions (convergence in D[0,1]), and to trimmed versions, whereby a fixed number of its largest jumps up to a specified time are subtracted from the process. The α=0 case produces convergence to an extremal process constructed from ordered jumps of a Cauchy subordinator. Our results generalise random walk and stable process results of Darling, Cressie, Kasahara, Kotani and Watanabe.  相似文献   

8.
This work concerns the Ornstein–Uhlenbeck type process associated to a positive self-similar Markov process (X(t))t0 which drifts to , namely U(t)?e?tX(et?1). We point out that U is always a (topologically) recurrent ergodic Markov process. We identify its invariant measure in terms of the law of the exponential functional I??0exp(ξ?s)ds, where ξ? is the dual of the real-valued Lévy process ξ related to X by the Lamperti transformation. This invariant measure is infinite (i.e. U is null-recurrent) if and only if ξ1?L1(P). In that case, we determine the family of Lévy processes ξ for which U fulfills the conclusions of the Darling–Kac theorem. Our approach relies crucially on a remarkable connection due to Patie (Patie, 2008) with another generalized Ornstein–Uhlenbeck process that can be associated to the Lévy process ξ, and properties of time-substitutions based on additive functionals.  相似文献   

9.
We consider Malliavin smoothness of random variables f(X1), where X is a pure jump Lévy process and the function f is either bounded and Hölder continuous or of bounded variation. We show that Malliavin differentiability and fractional differentiability of f(X1) depend both on the regularity of f and the Blumenthal–Getoor index of the Lévy measure.  相似文献   

10.
General Lp dual curvature measures have recently been introduced by Lutwak, Yang and Zhang [24]. These new measures unify several other geometric measures of the Brunn–Minkowski theory and the dual Brunn–Minkowski theory. Lp dual curvature measures arise from qth dual intrinsic volumes by means of Alexandrov-type variational formulas. Lutwak, Yang and Zhang [24] formulated the Lp dual Minkowski problem, which concerns the characterization of Lp dual curvature measures. In this paper, we solve the existence part of the Lp dual Minkowski problem for p>1 and q>0, and we also discuss the regularity of the solution.  相似文献   

11.
12.
Let (Zn)n0 be a branching process in a random environment defined by a Markov chain (Xn)n0 with values in a finite state space X. Let Pi be the probability law generated by the trajectories of Xnn0 starting at X0=iX. We study the asymptotic behaviour of the joint survival probability PiZn>0,Xn=j, jX as n+ in the critical and strongly, intermediate and weakly subcritical cases.  相似文献   

13.
14.
15.
Let Z denote a Hermite process of order q1 and self-similarity parameter H(12,1). This process is H-self-similar, has stationary increments and exhibits long-range dependence. When q=1, it corresponds to the fractional Brownian motion, whereas it is not Gaussian as soon as q?2. In this paper, we deal with a Vasicek-type model driven by Z, of the form dXt=a(b?Xt)dt+dZt. Here, a>0 and bR are considered as unknown drift parameters. We provide estimators for a and b based on continuous-time observations. For all possible values of H and q, we prove strong consistency and we analyze the asymptotic fluctuations.  相似文献   

16.
Huffman (2013) [12] studied Fq-linear codes over Fqm and he proved the MacWilliams identity for these codes with respect to ordinary and Hermitian trace inner products. Let S be a finite commutative Fq-algebra. An Fq-linear code over S of length n is an Fq-submodule of Sn. In this paper, we study Fq-linear codes over S. We obtain some bounds on minimum distance of these codes, and some large classes of MDR codes are introduced. We generalize the ordinary and Hermitian trace products over Fq-algebras and we prove the MacWilliams identity with respect to the generalized form. In particular, we obtain Huffman's results on the MacWilliams identity. Among other results, we give a theory to construct a class of quantum codes and the structure of Fq-linear codes over finite commutative graded Fq-algebras.  相似文献   

17.
Let D be a directed set without maximal element, S be an infinite semigroup and DS be the collection of all functions from D into S. It is shown that for a commutative semigroup S, A?S is a C-set with respect to NS if and only if A is a C-set with respect to DS. We investigate the Central Sets Theorem for arbitrary semigroups. In fact the Central Sets Theorem is stated with respect to SS for arbitrary semigroups.  相似文献   

18.
《Discrete Mathematics》2020,343(12):112127
Let r be a positive integer. The Bermond–Thomassen conjecture states that, a digraph of minimum out-degree at least 2r1 contains r vertex-disjoint directed cycles. A digraph D is called a local tournament if for every vertex x of D, both the out-neighbours and the in-neighbours of x induce tournaments. Note that tournaments form the subclass of local tournaments. In this paper, we verify that the Bermond–Thomassen conjecture holds for local tournaments. In particular, we prove that every local tournament D with δ+(D)2r1 contains r disjoint cycles C1,C2,,Cr, satisfying that either Ci has the length at most 4 or is a shortest cycle of the original digraph of DC1Ci1 for 1ir.  相似文献   

19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号