十进制展示的误差和函数

研究了十进制误差和函数,利用分形几何的方法,得到了误差和函数的积分值,介值定理以及其图的Hausdorff维数.     

β展式的误差和函数

介绍β展式的误差和函数,研究并得到了该误差和函数的连续性及积分性质.     

关于ε不敏感损失函数推广误差的界

本文研究了学习理论中推广误差的界的问题.利用ε不敏感损失函数的性质,分别获得r逼近误差和估计(样本)误差的界,并在特定的假设空间上得到了学习算法推广误差的界.     

多元样本定理及混淆误差的估计

本文证明了多元指数型整函数的一个Ｍａｒｃｉｎｋｉｅｗｉｃａ型不等式，并由此证得了多元Ｗｈｉｔｔａｋｅｒ－Ｋｏｔｅｌｎｉｋｏｖ－Ｓｈａｎｎｏｎ型的样本定理，从而得到了多元Ｓｏｂｏｌｅｖ类上的混淆误差界的阶的精确估计。     

圆环中的亚纯函数及其导数在重值条件下的一个唯一性定理

In this paper, we first obtain the famous Xiong Inequality of meromorphic functions on annuli. Next we get a uniqueness theorem of meromorphic function on annuli concerning to their multiple values and derivatives by using the inequality.     

Lǖroth误差和函数的若干性质

本文研究了L櫣roth展式的误差和函数.利用误差和函数的PerronFrobenius算子,得到其积分值.最后,考察并获得其介值性定理,从而得出其图形是一个分形.     

Lüroth误差和函数的若干性质

本文研究了Lüroth展式的误差和函数.利用误差和函数的Perron-Frobenius算子,得到其积分值.最后,考察并获得其介值性定理,从而得出其图形是一个分形.     

Lüroth误差和函数的若干性质

本文研究了Lüroth展式的误差和函数.利用误差和函数的Perron-Frobenius算子,得到其积分值.最后,考察并获得其介值性定理,从而得出其图形是一个分形.     

一类扰动迭代函数系生成的分形函数的矩量误差分析

对R3中的仿射迭代函数系进行扰动,得到了一类带扰动项的迭代函数系,它的吸引子是一个二元分形插值函数的图象,研究这类分形插值函数及其矩量的扰动误差问题,给出了相应的误差估计式.     

涉及分担值的正规定则

设F是区域D上的一个亚纯函数族,k(≥2)是一个正整数,b是一个非零复数,M是一个正数.若对任意给定的f∈F,f的零点重数至少为k,且f(z)=0=|f~((k))(z)|≤M.如果对任意给定的函数f,g∈F,L(f)与L(g)的零点都为重零点,且L(f)与L(g)在区域D内分担b,则F在区域D内正规.     

绿色食品需求函数的一种求解方法

本分析了影响绿色食品消费的因素，建立了消费消费绿色食品及同类一般食品的效用最大化数学规划模型，给出了Kuhn-Tucker条件；引入了绿色食品置信度参数并建立了一个可计算的二次效用函数，导出了该二次效用函数对应的需求函数，并详细地表述了求解过程和方法，讨论了绿色食品需求函数的性质。     

On characterizations of distributions by mean absolute deviation and variance bounds

In this paper we present a bound for the mean absolute deviation of an arbitrary real-valued function of a discrete random variable. Using this bound we characterize a mixture of two Waring (hence geometric) distributions by linearity of a function involved in the bound. A double Lomax distribution is characterized by linearity of the same function involved in the analogous bound for a continuous distribution. Finally, we characterize the Pearson system of distributions and the generalized hypergeometric distributions by a quadratic function involved in a similar bound for the variance of a function of a random variable.     

Properties of the probability density function of the non-central chi-squared distribution

In this paper we consider the probability density function (pdf) of a non-central χ² distribution with arbitrary number of degrees of freedom. For this function we prove that can be represented as a finite sum and we deduce a partial derivative formula. Moreover, we show that the pdf is log-concave when the degrees of freedom is greater or equal than 2. At the end of this paper we present some Turán-type inequalities for this function and an elegant application of the monotone form of l'Hospital's rule in probability theory is given.     

On the resolvent of singular Sturm-Liouville operators with transmission conditions

In this article, we investigate the resolvent operator of singular Sturm-Liouville problem with transmission conditions. We obtain integral representations for the resolvent of this operator in terms of the spectral function. Later, we discuss some properties of the resolvent operator, such as Hilbert-Schmidt kernel property, compactness. Finally, we give a formula in terms of the spectral function for the Weyl-Titchmarsh function of this problem.     

一类奇异积分算子的加权估计

假设A是一个Young函数,MD#为广义sharp极大函数.本文首先引进了LA-Hrmander条件,对于满足LA-Hrmander条件的算子T,得到了与T相关的广义sharp极大函数的估计.然后,再利用该估计得到了算子T的加权Lp范数被Hardy-Littlewood极大函数和与Aˉ相关的极大函数的加权Lp范数所控制(0相似文献   

Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems

As a result of our previous studies on finding the minimal element of a set in n-dimensional Euclidean space with respect to a total ordering cone, we introduced a method which we call “The Successive Weighted Sum Method” (Küçük et al., 2011 [1], [2]). In this study, we compare the Weighted Sum Method to the Successive Weighted Sum Method. A vector-valued function is derived from the special type of set-valued function by using a total ordering cone, which is a process we called vectorization, and some properties of the given vector-valued function are presented. We also prove that this vector-valued function can be used instead of the set-valued map as an objective function of a set-valued optimization problem. Moreover, by giving two examples we show that there is no relationship between the continuity of set-valued map and the continuity of the vector-valued function derived from this set-valued map.     

Cauchy-Stieltjes积分和面积平均p叶函数

本文研究由Cauchy-Stieltjes积分形成的函数空间Fα.首先给出这个空间的一个等价定义,然后研究面积平均p叶函数的对数函数和这个函数空间的关系,最后对单叶函数的情形做进一步的讨论.根据这种研究,我们得到了有界单叶函数的系数增长估计,这是目前最好的结果.     

A Fitzpatrick algorithm for multivariate rational interpolation

In this paper, we first apply the Fitzpatrick algorithm to osculatory rational interpolation. Then based on a Fitzpatrick algorithm, we present a Neville-like algorithm for Cauchy interpolation. With this algorithm, we can determine the value of the interpolating function at a single point without computing the rational interpolating function.     

A cohomology attached to a function

In this paper, we study a certain cohomology attached to a smooth function, which arose naturally in Poisson geometry. We explain how this cohomology depends on the function, and we prove that it satisfies both the excision and the Mayer-Vietoris axioms. For a regular function we show that the cohomology is related to the de Rham cohomology. Finally, we use it to give a new proof of a well-known result of A. Dimca [Compositio Math. 76 (1990) 19-47] in complex analytic geometry.     

An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem

In this paper we consider low-rank semidefinite programming (LRSDP) relaxations of combinatorial quadratic problems that are equivalent to the maxcut problem. Using the Gramian representation of a positive semidefinite matrix, the LRSDP problem can be formulated as the nonconvex nonlinear programming problem of minimizing a quadratic function with quadratic equality constraints. For the solution of this problem we propose a continuously differentiable exact merit function that exploits the special structure of the constraints and we use this function to define an efficient and globally convergent algorithm. Finally, we test our code on an extended set of instances of the maxcut problem and we report comparisons with other existing codes.