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.     

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.     

三角函数有理式积分技巧

结合实际例子给出四种处理三角有理式积分的技巧与方法,即利用对称性积分法、递推公式法、组合积分法、利用留数法.     

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.     

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.     

Well-posedness by perturbations of mixed variational inequalities in Banach spaces

In this paper, we consider an extension of the notion of well-posedness by perturbations, introduced by Zolezzi for a minimization problem, to a mixed variational inequality problem in a Banach space. We establish some metric characterizations of the well-posedness by perturbations. We also show that under suitable conditions, the well-posedness by perturbations of a mixed variational inequality problem is equivalent to the well-posedness by perturbations of a corresponding inclusion problem and a corresponding fixed point problem. Also, we derive some conditions under which the well-posedness by perturbations of a mixed variational inequality is equivalent to the existence and uniqueness of its solution.     

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.     

分部积分与Taylor公式

利用定积分的分部积分法由简到繁的推导得到了微分学中的Taylor公式从而给出了Taylor公式的另一种证法,并利用这种方法还可得到复变函数或泛函分析中的Taylor公式及某些函数的渐进级数和更广泛的函数展开.     

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.     

Generalized Arrow-Barankin-Blackwell theorems in locally convex spaces

This paper deals with generalizations of the Arrow-Barankin-Blackwell theorem in locally convex spaces, partially ordered by cones whose duals have nonempty quasi-interiors.This research has been partially supported by the World Laboratory, Lausanne, Switzerland, by the Department of Mathematics, University of Pisa, Pisa, Italy, and by the National Natural Sciences Foundation of China. Useful discussions with Professor F. Ferro are gratefully acknowledged.     

集合环

本文用集环来表现模糊集，得到了表现定理的新形式，并证明了这种表现可以有限化，即用有限个经典集近似刻划模糊集并且这样的刻划是同态的。最后，证明了集对方法是集环表现的特殊情形。     

BOOK REVIEWS

Book reviewed in this article: Beloved Scientist , by David O. Woodbury. Physics , A Textbook for Colleges , by Oscar M. Stewart. Modern Physics , by Charles E. Dull. Experiments in Organic Chemistry , by E. Wertheim. Dynamical Analogies , by Harry F. Olson, E.E., Ph.D. A Peimer of Electronics , by Don P. Caverly. Applied Mechanics and Heat , by L. Raymond Smith. An Elementary Course in Qualitative Analysis , by William Lloyd Evans, Jesse Erwin Day, and Alfred Benjamin Garrett. Fundamentals of Machines , by John A. Clark. Fundamentals of Machines , by Charles E. Dull. Algebra (Mathematics for Technical Training ), by Paul L. Evans. Geometry with Military and Naval Applications , by Willis F. Kern and James R. Bland. Plane Trigonometry with Tables , by Paul L. Evans. Elementary Applied Electricity , by L. Raymond Smith. Fundamentals of Electricity , Based on Material Developed for the Teaching of Learners and Apprentices of the Carnegie -Illinois Steel Corporation . Rewritten to Conform to the Preinduction Training Course in Fundamentals of Electricity as Prepared by the War Department . Fundamental Jobs in Electricity , by Edgar C. Perry, A. M. and Harry V. Schafebook.     

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.     

Rigid and Finite Type Geometric Structures

Rigid geometric structures on manifolds, introduced by Gromov, are characterized by the fact that their infinitesimal automorphisms are determined by their jets of a fixed order. Important examples of such structures are those given by an H-reduction of the first order frame bundle of a manifold, where the Lie algebra of H is of finite type; in fact, for structures given by reductions to closed subgroups of first order frame bundles, finite type implies rigidity. The goal of this paper is to generalize this to geometric structures defined by reductions of frame bundles of arbitrary order, and to give an algebraic characterization of the property of being rigid in terms of a suitable notion of finite type.     

Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation

Combinatorial identities that were needed in [25] are proved, mostly with C. Schneider’s computer algebra package Sigma. The form of the Padé approximation of the logarithm of arbitrary order is stated as a conjecture. 2000 Mathematics Subject Classification Primary—41A21, 05A19, 33F10 Supported by NRF-grant 2047226. Supported by NRF-grant 2053748. Supported by the Austrian Academy of Sciences, by the John Knopfmacher Research Centre for Applicable Analysis and Number Theory, and by the SFB-grant F1305 and the grant P16613-N12 of the Austrian FWF. Supported by NRF-grant 2053756.     

CVaR、VaR应用在RAROC的比较研究

本文将CVaR引入到RAROC(R isk-Ad justed Return on Cap ital)中,进行绩效评价。而且,将CVaR与VaR的结果进行了比较。在正态分布的情况下,CVaR与VaR的RAPM(R isk-Ad justedPerform ance M easure)对于绩效评价都是充分的、可靠的、有效的,且两者是等价的。但在非正态的情况下,CVaR的RAPM相对于VaR的RAPM更加充分、谨慎、可靠、有效。我们运用Bootstrap方法进行了实证研究。     

Controllability of Second-Order Differential and Integro-Differential Inclusions in Banach Spaces

In this paper, the controllability of second-order differential and integro-differential inclusions in Banach spaces are investigated. Two new results are obtained by using the theory of strongly continuous cosine families and a fixed point theorem for multivalued maps. Communicated by F. Zirilli Research supported by NNSF of China Grant 10571078, by NSF of Gansu Province of China Grant ZS011-A25-007-Z, and by the Teaching and Research Award Program for Outstanding Young Teacher in Higher Education Institutions, Ministry of Education of China.