Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

空间遥感相机长条反射镜组件的动力学特性分析

空间遥感相机长条反射镜较圆反射镜的整体刚度相差很大,整个组件在随火箭发射过程中因力学环境引起的自身位置改变导致面形的微小畸变从而对成像质量造成严重影响。因此,反射镜组件的设计就成为整个相机系统研制的重点与难点之一。对其进行科学、严谨的力学环境仿真是设计中的有效辅助手段。对某相机的长条反射镜组件动力学响应进行了较为深入的研究,借助MSC-patran,用有限元法进行了求解。获得了组件的动力学特性。     

Clifford分析中无界域上正则函数的边值问题

在引入修正Cauchy核的基础上,讨论了无界域上正则函数的带共轭值的边值问题：a(t)Φ (t) b(t)Φ (t) c(t)Φ-(t) d(t)Φ=g(t)．首先给出了无界域上正则函数的Plemelj公式,然后利用积分方程方法和压缩不动点原理证明了问题解的存在唯一性．     

An efficient numerical scheme for precise time integration of a diffusion-dissolution/precipitation chemical system

A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.

     

Harmonic mappings of the Sierpinski gasket to the circle

Harmonic mappings from the Sierpinski gasket to the circle are described explicitly in terms of boundary values and topological data. In particular, all such mappings minimize energy within a given homotopy class. Explicit formulas are also given for the energy of the mapping and its normal derivatives at boundary points.

     

我国上市公司资本结构影响因素实证分析

本文选取了可能影响企业资本结构的多个指标变量进行分析 ,利用主成分分析提供的方法将变量综合成彼此互不相关的少数几个主成分。再用主成分 (作为回归自变量 )对企业的 5种资本负债比 (作为回归因变量 )进行多元回归分析 ,得出了影响企业资本结构的主要因素 ,以及这些因素与企业资本结构之间的关系 ,为企业确定资本结构提供参考依据 ,为企业财务决策提供支持。     

A FUNDAMENTAL SOLUTION FOR THE LAPLACE OPERATOR ON THE QUATERNIONIC HEISENBERG GROUP

In this paper, the author studies the Laplace operator on the quaternionic Heisenberg group, construct a fundamental solution for it and use this solution to prove the Lp-boundedness and the weak (1-1) boundedness of certain singular convolution operators on the quaternionic Heisenberg group.     

Algebraic methods in quantum mechanics: from molecules to polymers

We present a brief review of algebraic techniques developed and applied in molecular spectroscopy in the last five years. We also outline perspectives for new applications of the Lie algebraic method in the first decade of the new century. Received 21 November 2001     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.