矩母函数:拟对称概率测度

本文用凸函数的方法研究了概率测度的矩母函数和由C.J.Stone提出的拟对称性,并刻画了Martin边界的法向量.拟对称性在随机游动的比例极限定理中是一个重要的概念.这些结果可应用于Lévy过程的研究.     

弱拟Hopf代数上的积分理论

本文主要讨论弱拟Hopf代数上的积分理论.首先将Hopf模基本结构定理推 广到弱拟Hopf代数上,并在给出积分与余积分的概念后,考虑了有限维弱拟Hopf代 数的对称性及半单性.     

非二重性拟度量测度空间中修正的极大函数定理及其应用

主要研究了拟度量测度空间(X,d,μ)中修正的极大函数,其中X表示集合,μ表示不满足二重性的Borel测度,d表示不满足对称性的拟度量,本文对修正的极大函数建立了弱(1,1)估计和(Φ,Φ)型估计,其中Φ比N函数更一般.作为应用,证明了拟度量测度空间中推广的Lebesgue微分定理.本文的结果也适用于与常系数Kolmogorov型算子对应的Lie群G=(R~(N+1),o).     

双射线性变换视角下一般积分的对称性问题

针对高等数学课程中对称性问题,从双射变换的视角提出了刻画积分域对称性的新概念,借助新概念,研究了双射线性变换视角下一般积分的对称性,可用于简化积分计算.一般积分对称性的新视角可帮助学生加深对不同类型积分的对称性理解.     

非径向对称性度量为3/n(n≥3)的随机向量的结构及其最佳界

本文基于Copula研究随机向量的非径向对称性理论.首先研究了非径向对称性度量为3/4的随机变量的Copula结构,给出非径向对称性度量为3/4的Copula的精确最佳界.然后拓展到一般情况,给出一个Copula的非径向对称性度量为3/n的必要条件,研究了非径向对称性度量为3/n的随机变量的Copula结构,得到非径向对称性度量等于3/n的Copula的宽泛最佳界.     

非Chetaev型变质量非完整系统的Lie对称性与Noether对称性

研究非Chetaev型变质量非完整系统的Lie对称性与Noether对称性以及其间的 关系,给出Lie对称性导致Noether对称性以及Noether对称性导致Lie对称性的条件.     

压电堆叠作动器的对称性求解

研究了压电堆叠作动器的对称性,并给出了系统存在的守恒量和对称性解.以轴向运动的压电堆叠作动器为研究对象,根据其结构特点,选取位移和磁链作为广义坐标,运用能量方法,建立了压电堆叠作动器的Lagrange(拉格朗日)方程.引入位移和磁链广义坐标的无限小群变换,分别研究了压电堆叠作动器的Noether对称性和Lie对称性,给出了广义Noether恒等式、广义Killing方程、广义Noether定理和Lie定理,计算了压电堆叠作动器存在的Noether对称性和Lie对称性的生成元,并给出了相应系统存在的守恒量.最后,利用得到的守恒量,给出了压电堆叠作动器对称性解,并计算了在控制电压变化的情况下位移和速度的动态响应曲线.     

对称性在积分计算中的应用

一、引言 在积分的计算中充分利用积分区域的对称性及被积函数的奇、偶性,往往可以简化计算,达到事半功倍的效果.近年来,在全国研究生入学考试数学试题中不乏涉及对称性的积分试题.本文拟系统地介绍有关内容并举出相关例子.为简化叙述,我们假定以下涉及到的积分都是存在的,有关函数均满足通常的条件.     

汽车车体振动系统的对称性与守恒量研究

用Lie群方法研究汽车车体振动系统的对称性,寻找其存在的守恒量.以汽车车体做上下垂直振动和绕其质心的前后俯仰振动,采用Lagrange函数的方法,构建汽车车体振动系统.以此系统为对象,引入Lie群方法,给出该振动系统的Noether对称性理论与Lie对称性理论;由此推导该汽车系统存在的Noether对称性与Lie对称性,并得到系统相应的的守恒量.该方法对车体振动问题提出了新的对称性解法,同时扩大了Lie群方法的应用范围.     

函数对称性的探究

函数是中学数学教学的主线,是中学数学的核心内容,也是整个高中数学的基础．函数的性质是竞赛和高考的重点与热点,函数的对称性是函数的一个基本性质,对称关系不仅广泛存在于数学问题之中,而且利用对称性往往能更简捷地解决问题,对称关系还充分体现了数学之美．笔者拟通过函数自身的对称性和不同函数之间的对称性这两个方面来探讨函数与对称有关的性质．     

Quasi-planar graphs have a linear number of edges

A graph is calledquasi-planar if it can be drawn in the plane so that no three of its edges are pairwise crossing. It is shown that the maximum number of edges of a quasi-planar graph withn vertices isO(n).Work on this paper by Pankaj K. Agarwal, Boris Aronov and Micha Sharir has been supported by a grant from the U.S.-Israeli Binational Science Foundation. Work on this paper by Pankaj K. Agarwal has also been supported by NSF Grant CCR-93-01259, by an Army Research Office MURI grant DAAH04-96-1-0013, by an NYI award, and by matching funds from Xerox Corporation. Work on this paper by Boris Aronov has also been supported by NSF Grant CCR-92-11541 and by a Sloan Research Fellowship. Work on this paper by János Pach, Richard Pollack, and Micha Sharir has been supported by NSF Grants CCR-91-22103 and CCR-94-24398. Work by János Pach was also supported by Grant OTKA-4269 and by a CUNY Research Award. Work by Richard Pollack was also supported by NSF Grants CCR-94-02640 and DMS-94-00293. Work by Micha Sharir was also supported by NSF Grant CCR-93-11127, by a Max-Planck Research Award, and by grants from the Israel Science Fund administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development. Part of the work on this paper was done during the participation of the first four authors in the Special Semester on Computational and Combinatorial Geometry organized by the Mathematical Research Institute of Tel Aviv University, Spring 1995.     

带干扰的Erlang(2)过程

本篇论文主要讨论带干扰的E rlang(2)过程,首先通过指数分布的可加性来推得生存概率所满足的积分微分方程,进而得到破产概率(由干扰引起和由索赔引起)所满足的积分微分方程,最后得到破产概率的拉氏变换所满足的方程.     

A New Characterization of the Mathieu Groups and Alternating Groups with Degrees Primes

In the past thirty years, several kinds of quantitative characterizations of finite groups especially finite simple groups have been investigated by many mathematicians. Such as quantitative characterizations by group order and element orders, by element orders alone, by the set of sizes of conjugacy classes, by dimensions of irreducible characters, by the set of orders of maximal abelian subgroups and so on. Here the authors continue this topic in a new area tending to characterize finite simple groups with given orders by some special conjugacy class sizes, such as largest conjugacy class sizes, smallest conjugacy class sizes greater than 1 and so on.     

A five facets frame for the design of heuristics

The author suggested to distinguish between the ‘engineering approach’ and the ‘mathematical approach’ in connection with the design of heuristics. Stainton and Papoulias extended the scope by suggesting the ‘relational approach’. Based upon this extension, a five facets frame is presented here which is suggested to precede and accompany the ‘technical’ design of the heuristic. The facets are: coverage by participation, experience by doing, abstraction by structuring, extension by comparison, exploration by creativity.     

Fibrations by nonsmooth genus three curves in characteristic three

Bertini’s theorem on variable singular points may fail in positive characteristic, as was discovered by Zariski in 1944. In fact, he found fibrations by nonsmooth curves. In this work we continue to classify this phenomenon in characteristic three by constructing a two-dimensional algebraic fibration by nonsmooth plane projective quartic curves, that is universal in the sense that the data about some fibrations by nonsmooth plane projective quartics are condensed in it. Our approach has been motivated by the close relation between it and the theory of regular but nonsmooth curves, or equivalently, nonconservative function fields in one variable. Actually, it also provides an understanding of the interesting effect of the relative Frobenius morphism in fibrations by nonsmooth curves. In analogy to the Kodaira-Néron classification of special fibers of minimal fibrations by elliptic curves, we also construct the minimal proper regular model of some fibrations by nonsmooth projective plane quartic curves, determine the structure of the bad fibers, and study the global geometry of the total spaces.     

Realizability of words in mosaic labyrinths

In this paper we study mosaic labyrinths with the help of words generated by them in the alphabet of labels attached to arcs and vertices of a labyrinth. We consider the problem of the characterization of words generated by a labyrinth. We propose a constructive recognition criterion, it defines whether a word is generated by a labyrinth or not. We establish conditions under which a word can be generated by a unique labyrinth, by a finite number of labyrinths, or by infinitely many labyrinths.     

Adaptive robot under fuzzy control

This paper deals with the problem of ranking n fuzzy subsets of the unit interval. A number of methods suggested in the literature is reviewed and tested on a group of selected examples, where the fuzzy sets can be nonnormal and/or nonconvex.The ranking is obtained from: (i) the index of strict preference defined by Watson, (ii) three indexes proposed by Yager, (iii) the algorithm used by Chang, (iv) three versions of the a-preference index suggested by Adamo, (v) the index defined by Baas and Kwakernaak, (vi) three modified versions used by Baldwin and Guild, (vii) the method proposed by Kerre, (viii) three forms of the index suggested by Jain, (ix) the four grades of dominance studied by Dubois and Prade.In simple cases the results are good for all the methods, with some exceptions. In questionable cases, where the decision must be probably modelled in accordance with the context in which it is imbedded, the best indexes seem to be the dominances suggested by Dubois and Prade. These indexes do not force any particular choice, but clearly describe the situation, hence allowing the decision-maker himself to make his ‘best’ choice.     

Approximate Gradient Projection Method with Runge-Kutta Schemes for Optimal Control Problems

We consider an optimal control problem for systems governed by ordinary differential equations with control constraints. The state equation is discretized by the explicit fourth order Runge-Kutta scheme and the controls are approximated by discontinuous piecewise affine ones. We then propose an approximate gradient projection method that generates sequences of discrete controls and progressively refines the discretization during the iterations. Instead of using the exact discrete directional derivative, which is difficult to calculate, we use an approximate derivative of the cost functional defined by discretizing the continuous adjoint equation by the same Runge-Kutta scheme and the integral involved by Simpson's integration rule, both involving intermediate approximations. The main result is that accumulation points, if they exist, of sequences constructed by this method satisfy the weak necessary conditions for optimality for the continuous problem. Finally, numerical examples are given.     

On the strong convergence of derivatives in a time optimal problem

We consider a time optimal problem for a system described by a differential inclusion, whose right hand side is not necessarily convex valued. Under the assumption of strict convexity of the map obtained by convexifying the original, non-convex valued map, we obtain the strong convergence of the derivatives of any uniformly converging minimizing sequence. The assumptions required by this result are satisfied, for instance, by the classical brachystochrone problem and by Fermat’s principle.     

Solving combinatorial optimization problems using Karmarkar's algorithm

We describe a cutting plane algorithm for solving combinatorial optimization problems. The primal projective standard-form variant of Karmarkar's algorithm for linear programming is applied to the duals of a sequence of linear programming relaxations of the combinatorial optimization problem.Computational facilities provided by the Cornell Computational Optimization Project supported by NSF Grant DMS-8706133 and by the Cornell National Supercomputer Facility. The Cornell National Supercomputer Facility is a resource of the Center for Theory and Simulation in Science and Engineering at Cornell Unversity, which is funded in part by the National Science Foundation, New York State, and the IBM Corporation. The research of both authors was partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.Research partially supported by ONR Grant N00014-90-J-1714.Research partially supported by NSF Grant ECS-8602534 and by ONR Contract N00014-87-K-0212.