CALCULUS ON CANTOR TRIADIC SET （I）——DERIVATIVE

For real-valued functions defined on Cantor triadic ,set. a derivative with corresponding formula of Newton-Leihniz‘s type is given In particular, for the self-simltar functions and alter-nately jumping functions defined in this paper, their derivative and exceptional sets are studied ac-curately by using ergodic theory on Е2 and Duffin-Scbaeffer‘s theorem coneerning metric diophan-tine approximation. In addition, Haar basis of L2(Е2) is constructed and Flaar expansion of stan-drd self-similar function is given.     

STRICTLY WEAK MAJOR EFFICIENT POINT OF SET AND ITS PROPERTIES

Abstract. In this paper, the strictly weak major efficient point of set is introduced. A functional as a separate function is constructed, therefore, a necessary and sufficient condition for the strictly weak major efficient point of set is established.     

FIBONACCI SEQUENCE AND CANTOR＇S TERNARY SET

Let N be the set of positive integers and C be Cantor‘s ternary set.A function ζ：N→[0，1] is established by the help of the Fibonacci sequence such that —↑ζ（N），the closure of the set ζ（N）,is homeomorphic to the set C.     

STRUCTURES OF VALUES FOR SET GAMES RESTRICTED BY PARTITION SYSTEM

§1IntroductionA cooperative game with transferable utility(TU)is a pair(N,v),where N is anonempty,finite set and v∶2N→R is a characteristic function defined on the power set ofN satisfying v()∶=0.LetCGdenote the set of all cooperative TU-games with anarbitrary player set.An element of N(notation:i∈N)and a nonempty subset S of N(notation:S N or S∈2Nwith S≠)are called a player and coalition respectively,andthe associated real number v(S)is called the worth of coalition S to be in…     

EXAMPLES ON EXCEPTIONAL VALUES OF MEROMORPHIC FUNCTIONS

In this paper, by means of the definition of Borel exceptional value method, another exceptional value of meromorphic function which is a T exceptional value is defined by linking the concept of T direction. And we construct a meromorphic function with zero as Borel exceptional value, but not as T exceptional value; and another meromorphic function with zero as T exceptional value, but not as Borel exceptional value.     

ON BIRKHOFF INTERPOLATION (0;2) CASE

P. Turan and his associates considered in detail the problem of (0.2) interpolation based on the zeros of πn(x). Motivated by these results and an earlier result of Szabados and Varma[9] here we consider the problem of existence, uniqueness and explicit representation of the interpolatory polynomial Rn (x) satisfying the function values at one set of nodes and the second derivative on the other set of nodes. It is important to note that this problem has a unique solution provided these two sets of nodes are chosen properly. We also promise to have an interesting convergence theorem in the second paper of this series, which will provide a solution to the related open problem of P. Turan.     

Merit functions for nonsmooth complementarity problems and related descent algorithm

Under some assumptions, the solution set of a nonlinear complementarity problem coincides with the set of local minima of the corresponding minimization problem. This paper uses a family of new merit functions to deal with nonlinear complementarity problem where the underlying function is assumed to be a continuous but not necessarily locally Lipschitzian map and gives a descent algorithm for solving the nonsmooth continuous complementarity problems. In addition, the global convergence of the derivative free descent algorithm is also proved.     

涉及分担集的整函数的唯一性

In this paper,uniqueness of entire function related to shared set is studied.Let f be a non-constant entire function and k be a positive integer,d be a finite complex number.There exists a set S with 3 elements such that if f and its derivative f（k）satisfy E（S,f）= E（S,f（k））,and the zeros of f（z）-d are of multiplicity ≥ k ＋ 1,then f = f（k）.     

“MANDELBROT SET” FOR A PAIROF LINEAR MAPS： THE LOCAL GEOMETRY

We consider the iterated function system {λz-1, λz 1} in the complex plane, for λ in the open unit disk. Let M be the set of λ such that the attractor of the IFS is connected. We discuss some topological and geometric properties of the set M and prove a new result about possible corners on its boundary.Some open problems and directions for further research are discussed as well.     

符号混合控制问题的某些NP-完全性结果

Let G =(V, E) be a simple graph with vertex set V and edge set E. A signed mixed dominating function of G is a function f:V∪E→ {-1, 1} such that ∑_(y∈N_m(x)∪{x})f(y)≥ 1for every element x∈V∪E, where N_m(x) is the set of elements of V∪E adjacent or incident to x. The weight of f is w(f) =∑_(x∈V∪E)f(x). The signed mixed domination problem is to find a minimum-weight signed mixed dominating function of a graph. In this paper we study the computational complexity of signed mixed domination problem. We prove that the signed mixed domination problem is NP-complete for bipartite graphs, chordal graphs, even for planar bipartite graphs.     

A NEW FRAMEWORK OF PRIMAL-DUAL INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR PROGRAMMING*

On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear programming, we propose a new framework of primal-dual infeasible interiorpoint method for linear programming problems. Without the strict convexity of the logarithmic barrier function, we get the following results: (a) if the homotopy parameterμcan not reach to zero,then the feasible set of these programming problems is empty; (b) if the strictly feasible set is nonempty and the solution set is bounded, then for any initial point x, we can obtain a solution of the problems by this method; (c) if the strictly feasible set is nonempty and the solution set is unbounded, then for any initial point x, we can obtain a (?)-solution; and(d) if the strictly feasible set is nonempty and the solution set is empty, then we can get the curve x(μ), which towards to the generalized solutions.     

ON THE PARTIAL EQUIASYMPTOTIC STABILITY OF NONLINEAR TIME-VARYING DIFFERENTIAL EQUATIONS

In this paper, the problem of partial equiasymptotic stability for nonlinear time-varying differential equations are analyzed. A sufficient condition of partial stability and a set of sufficient conditions of partial equiasymptotic stability are given. Some of these conditions allow the derivative of Lyapunov function to be positive. Finally, several numerical examples are also given to illustrate the main results.     

A NEW TRUST-REGION ALGORITHM FOR NONLINEAR CONSTRAINED OPTIMIZATION

We propose a new trust region algorithm for nonlinear constrained optimization problems. In each iteration of our algorithm, the trial step is computed by minimizing a quadratic approximation to the augmented Lagrange function in the trust region. The augmented Lagrange function is also used as a merit function to decide whether the trial step should be accepted. Our method extends the traditional trust region approach by combining a filter technique into the rules for accepting trial steps so that a trial step could still be accepted even when it is rejected by the traditional rule based on merit function reduction. An estimate of the Lagrange multiplier is updated at each iteration, and the penalty parameter is updated to force sufficient reduction in the norm of the constraint violations. Active set technique is used to handle the inequality constraints. Numerical results for a set of constrained problems from the CUTEr collection are also reported.     

The best quadrature based on given Hermite information for the Sobolev class KW~r[a,b]

As usual, denote by KWr[a,b] the Sobolev class consisting of every function whose (r-1)th derivative is absolutely continuous on the interval [a,b] and rth derivative is bounded by K a.e. in [a, b]. For a function f∈KWr[a, b], its values and derivatives up to r -1 order at a set of nodes x are known. These values are said to be the given Hermite information. This work reports the results on the best quadrature based on the given Hermite information for the class KWr[a. b]. Existence and concrete construction issue of the best quadrature are settled down by a perfect spline interpolation. It turns out that the best quadrature depends on a system of algebraic equations satisfied by a set of free nodes of the interpolation perfect spline. From our another new result, it is shown that the system can be converted in a closed form to two single-variable polynomial equations, each being of degree approximately r/2. As a by-product, the best interpolation formula for the class KWr[a, b] is also obtained.     

Adjoint Method for an Inverse Problem of CCPF Model

The problem for determining the exchange rate function of 2D CCPF model by measurements on the partial boundary is considered and solved as one PDE-constraint optimization problem. The optimal variant is the minimum of a cost functional that quantifies the difference between the measurements and the exact solutions. Gradientbased algorithm is used to solve this optimization problem. At each step, the derivative of the cost functional with respect to the exchange rate function is calculated and only one forward solution and one adjoint solution are needed. One method based on the adjoint equation is developed and implemented. Numerical examples show the efficiency of the adjoint method.     

Nonexistence in power and gamma density regression, sum of nonnegative terms

When we use the power function α(c x)^b and gamma density αx^be^-cx to fit the data by the least squares method, we have to address the question of existence. The closure of the set of each type of these functions defined on a finite domain is determined. We derive a way to determine the closure of a sum of nonnegative functions if the closures of the summands are available.     

Optimal Delaunay Triangulations

The Delaunay triangulation, in both classic and more generalized sense, is studied in this paper for minimizing the linear interpolation error (measure in L^P-norm) for a given function. The classic Delaunay triangulation can then be characterized as an optimal triangulation that minimizes the interpolation error for the isotropic function ‖x‖^2 among all the triangulations with a given set of vertices. For a more general function, a functiondependent Delaunay triangulation is then defined to be an optimal triangulation that minimizes the interpolation error for this function and its construction can be obtained by a simple lifting and projection procedure. The optimal Delaunay triangulation is the one that minimizes the interpolation error among all triangulations with the same number of vertices, i.e. the distribution of vertices are optimized in order to minimize the interpolation error. Such a function-depend entoptimal Delaunay triangulation is proved to exist for any given convex continuous function.On an optimal Delaunay triangulation associated with f, it is proved that △↓f at the interior vertices can be exactly recovered by the function values on its neighboring vertices.Since the optimal Delaunay triangulation is difficult to obtain in practice, the concept of nearly optimal triangulation is introduced and two sufficient conditions are presented for a triangulation to be nearly optimal.     

解变分不等式问题的混合方法

By using Fukushima‘s differentiable merit function,Taji,Fukushima and Ibaraki have given a globally convergent modified Newton method for the strongly monotone variational inequality problem and proved their method to be quadratically convergent under certain assumptions in 1993. In this paper a hybrid method for the variational inequality problem under the assumptions that the mapping F is continuously differentiable and its Jacobian matrix F(x) is positive definite for all x∈S rather than strongly monotone and that the set S is nonempty, polyhedral,closed and convex is proposed. Armijo-type line search and trust region strategies as well as Fukushima‘s differentiable merit function are incorporated into the method. It is then shown that the method is well defined and globally convergent and that,under the same assumptions as those of Taji et al. ,the method reduces to the basic Newton method and hence the rate of convergence is quadratic. Computational experiences show the efficiency of the proposed method.     

关于亚纯函数导数的特征函数的一点注记

In this paper,the characteristic function of the derivative of meromorphic func- tion is studied.A expression of characteristic function T(r,f~1)is given.     

随机级数的例外函数

On random series, people usually study the case of equally distributed random variable sequences, such as Rademacher, Steinhaus and Gauss sequences, and discuss the exceptional constant values. In this paper, we extend the Lemma of PaleyZygmund to more general case, in order to study the random Taylor series of non equal distribution. Then we prove that for the random Taylor series almost surely (a. s.), there is no almost surely exceptional function, and that every point on the circumferen…