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.

     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

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

本文选取了可能影响企业资本结构的多个指标变量进行分析 ,利用主成分分析提供的方法将变量综合成彼此互不相关的少数几个主成分。再用主成分 (作为回归自变量 )对企业的 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.     

Maximum Shannon Entropy, Minimum Fisher Information, and an Elementary Game

We formulate an elementary statistical game which captures the essence of some fundamental quantum experiments such as photon polarization and spin measurement. We explore and compare the significance of the principle of maximum Shannon entropy and the principle of minimum Fisher information in solving such a game. The solution based on the principle of minimum Fisher information coincides with the solution based on an invariance principle, and provides an informational explanation of Malus' law for photon polarization. There is no solution based on the principle of maximum Shannon entropy. The result demonstrates the merits of Fisher information, and the demerits of Shannon entropy, in treating some fundamental quantum problems. It also provides a quantitative example in support of a general philosophy: Nature intends to hide Fisher information, while obeying some simple rules.     

Entropy for frame bundle systems and Grassmann bundle systems induced by a diffeomorphism

A Liao hyperbolic diffeomorphism has equal measure entropy and topological entropy to that of its induced systems on frame bundles and Grassmann bundles. This solves a problem Liao posed in 1996 for Liao hyperbolic diffeomorphisms.     

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     

Metastability in the Potts model on the Cayley tree

Metastability in the ferromagneticp-state Potts model defined on the Cayley tree is discussed. It is shown that the sign of the boundary fieldH _s determines the order of the transition as well as the stability of the low-temperature phase. Lowering the temperature withH _s >0, a system withp<2 (p>2) will display a second (first)-order transition to a metastable (stable) phase. ForH _s >0 a second (first)-order transition to a metastable (stable) phase occurs ifp>2 (p<2). In this case the system also has a residual entropy which is negative forp<2.     

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.