一类最速降线与最短路径问题

本结合梯度讨论了椭球面上一类最速降线问题,应用变分法及Ｍａｔｈｅｍａｔｉｃａ软件讨论了椭球面上最短路径问题;分析了二的关系,旨在加强应用数学知识的能力。     

椭球面上平面曲线类型的闭测地线

通过对椭球面上平截线的研究,找出了椭球面上所有平面曲线类型的闭测地线.     

关于椭球面上一道积分题目的探讨

主要研究椭球面上的一道曲面积分题目,分别从Gauss公式、椭球面的不同参数表示,以及余面积公式等角度对该积分的计算技巧进行了详细总结.同时,从微分几何的观点出发,对该题目进行了推广.     

椭球面圆截线问题的微分几何解法

本文用微分几何的方法求解出椭球面上圆截线所在平面的一般方程.     

浅议立体几何最值问题的处理方略

立体几何中有关角、距离、面积、体积等最值问题频频出现在近年的高考试卷中,此类问题涉及的知识面广,灵活性强.笔者通过对近年来高考题中几个典型的例题进行分析,浅谈这类问题的处理方略,供参考.一、定性分析法例1已知在半径为2的球面上有A、     

齐次思想在多元最值问题中的应用

<正>不等式是高中数学中的重要内容,也是数学研究的重要对象．数学中的最值问题实际上都是以不等式为背景的．在高中阶段,我们学习了不等式的基本性质以及基本不等式等重要内容．其中,利用基本不等式来求解最值问题不仅是高考的热点问题,同时也是学习的难点．在学习过程中,我们发现,很多涉及到多元的最值问题除了利用基本不等式来求解以外,还可以应用齐次化思想来求解．本文讨论齐次思想在多元最值问题中的一些应用,以供同学们参考．     

最短内接折线问题

本文对具有固定边界点的最短内接折线问题、退化的问题和非凸多边形的问题进行了讨论,并给出了有效的组合优化求解方法.我们还提出了通过固定内点的最短内接折线问题,并对特殊情况给出了一些结果.     

圆台上蚂蚁爬行最短路径问题

蚂蚁爬行的最短路径问题,是讨论在规则立体图形表面上蚂蚁从一点爬到另外一点如何选择路径所走路程最短的问题.此问题背景简单、生动、活泼,而解决此问题中需要运用几何学中两点之间线段最短等基础知识,并渗透了把空间问题转化为平面问题的等基本数学思想方法.对于蚂蚁在立方体、长方体、圆柱、圆锥、圆台表面爬行的最短路径问题,在文[1]、[2]中都进行了一些讨论.同时也有很多老师利用此背景进行了很多行之有效的教学设计.     

最短置信区间的近似计算

针对密度函数不对称时,未知参数最短置信区间计算的复杂性,文章讨论了正态分布x~N(μ,σ2)中的参数σ2在置信度为(1-α)下最短置信区间的近似计算,并给出两种搜索算法,应用分析表明该方法能准确快速的求出参数的最短置信区间     

运输最短时限问题的网络解法及讨论

本提出了运输最短时限问题的基于Ford-Fullerson最大流算法的网络解法，并讨论了这个算法给出的附加信息的意义和应用价值，特别是可据以解决“运输某给定量至少需费时多少”的问题。     

Optimal Path Planning Based on Visibility

Various problems associated with optimal path planning for mobile observers such as mobile robots equipped with cameras to obtain maximum visual coverage of a surface in the three-dimensional Euclidean space are considered. The existence of solutions to these problems is discussed first. Then, optimality conditions are derived by considering local path perturbations. Numerical algorithms for solving the corresponding approximate problems are proposed. Detailed solutions to the optimal path planning problems for a few examples are given.     

On Models of Directed Path Graphs Non Rooted Directed Path Graphs

A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted directed path graph is the intersection graph of a family of directed subpaths of a rooted tree. Clearly, rooted directed path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted directed path graphs. With the purpose of proving knowledge in this direction, we show in this paper properties of directed path models that can not be rooted for chordal graphs with any leafage and with leafage four. Therefore, we prove that for leafage four directed path graphs minimally non rooted directed path graphs have a unique asteroidal quadruple, and can be characterized by the presence of certain type of asteroidal quadruples.     

一类网络上的干线选址

考虑一类在网络上点到路的距离意义下的最优干线选址问题,这是一类新型的选址问题.首先证明所讨论的两个问题是NP-hard,然后讨论树的情况,给出了当G是树时求解问题的算法,该算法的复杂性是O(n2).并对一些特殊网络的情况进行了讨论.     

Path Boxplots: A Method for Characterizing Uncertainty in Path Ensembles on a Graph

Graphs are powerful and versatile data structures that can be used to represent a wide range of different types of information. In this article, we introduce a method to analyze and then visualize an important class of data described over a graph—namely, ensembles of paths. Analysis of such path ensembles is useful in a variety of applications, in diverse fields such as transportation, computer networks, and molecular dynamics. The proposed method generalizes the concept of band depth to an ensemble of paths on a graph, which provides a center-outward ordering on the paths. This ordering is, in turn, used to construct a generalization of the conventional boxplot or whisker plot, called a path boxplot, which applies to paths on a graph. The utility of path boxplot is demonstrated for several examples of path ensembles including paths defined over computer networks and roads. Supplementary materials for this article are available online.     

The Neumann problem on ellipsoids

The Neumann problem on an ellipsoid in \(\mathbf {R}^n\) asks for a function harmonic inside the ellipsoid whose normal derivative is some specified function on the ellipsoid. We solve this problem when the specified function on the ellipsoid is a normalized polynomial (a polynomial divided by the norm of the normal vector arising from the definition of the ellipsoid). Specifically, we give a necessary and sufficient condition for a solution to exist, and we show that if a solution exists then it is a polynomial whose degree is at most the degree of the polynomial giving the specified function. Furthermore, we give an algorithm for computing this solution. We also solve the corresponding generalized Neumann problem and give an algorithm for computing its solution.     

Path transferability of graphs

Path transferability of a graph is a notion that arises from the movement of a path along the graph, the behavior of the path seems as a train on a railroad. In this paper, we introduce two graph notions, transferability and reversibility, and study their properties.     

最短路的灵敏度分析

最短路的灵敏度分析就是讨论当网络中边的权值发生波动时，对目前的最短路带来的影响，本讨论了网络中边的权值在何种范围的变化时，极小最短路子网络不发生变化。     

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path graphs is isomorphism complete, whereas for rooted directed path graphs we present a polynomial-time isomorphism algorithm.     

On the Joint Path Length Distribution in Random Binary Trees

During the 10th Seminar on Analysis of Algorithms , MSRI, Berkeley, June 2004, Knuth posed the problem of analyzing the left and the right path length in a random binary tree. In particular, Knuth asked about properties of the generating function of the joint distribution of the left and the right path lengths. In this paper, we mostly focus on the asymptotic properties of the distribution of the difference between the left and the right path lengths. Among other things, we show that the Laplace transform of the appropriately normalized moment generating function of the path difference satisfies the first Painlevé transcendent . This is a nonlinear differential equation that has appeared in many modern applications, from nonlinear waves to random matrices. Surprisingly, we find out that the difference between path lengths is of the order n ^5/4 where n is the number of nodes in the binary tree. This was also recently observed by Marckert and Janson. We present precise asymptotics of the distribution's tails and moments. We will also discuss the joint distribution of the left and right path lengths. Throughout, we use methods of analytic algorithmics such as generating functions and complex asymptotics, as well as methods of applied mathematics such as the Wentzel, Kramers, Brillouin (WKB) method.