WKB Wave Function of the General Time-Dependent Quadratic Hamiltonian System

We derived the WKB wave function for the general time-dependent quadratic Hamiltonian system using a unitary transformation method. We applied our research to sinusodially drived Caldirola–Kanai oscillator and confirmed that the time evolution of our approximated WKB wave function is similar to that of the exact one. This wave function can be used to analyze the interference between the probability amplitudes contributed by the area of overlap in phase space of quantum states.     

首次穿过边界概率及其在金融中的应用

本文把数学和管理科学有机结合,为数学应用提出问题,得出新结果,推广了J.Michel Harrison(1985)[1]第43页的命题27,并给出了在金融中的应用.     

Variational Derivative for Buckling Loads of Beams and Frames

The finite-difference method is a numerical technique for obtaining approximate solutions to differential equations. The main objective of the present study is to give a new aspect to the finite-difference method by using a variational derivative. By applying this formulation, accurate values of the buckling loads of beams and frames with various end supports are obtained. The performance of this formulation is verified by comparison with numerical examples in the literature __________ Published in Prikladnaya Mekhanika, Vol. 41, No. 7, pp. 139–144, July 2005.     

A WKB analysis of the buckling condition for a cylindrical shell of arbitrary thickness subjected to an external pressure

We consider the plane-strain buckling of a cylindrical shellof arbitrary thickness which is made of a Varga material andis subjected to an external hydrostatic pressure on its outersurface. The WKB method is used to solve the eigenvalue problemthat results from the linear bifurcation analysis. We show thatthe circular cross-section buckles into a non-circular shapeat a value of µ₁ which depends on A₁/A₂ and a mode number,where A₁ and A₂ are the undeformed inner and outer radii, andµ₁ is the ratio of the deformed inner radius to A₁. Inthe large mode number limit, we find that the dependence ofµ₁ on A₁/A₂ has a boundary layer structure: it is constantover almost the entire region of 0 < A₁/A₂ < 1 and decreasessharply from this constant value to unity as A₁/A₂ tends tounity. Our asymptotic results for A₁ – 1 = O(1) and A₁– 1 = O(1/n) are shown to agree with the numerical resultsobtained by using the compound matrix method.     

Absorbing boundary conditions for reaction-diffusion equations

We treat here of the question of absorbing boundary conditionsfor nonlinear diffusion equations. We use the conditions designedfor the linear equation, we prove them to be well posed forthe nonlinear problem, and through numerical experiments thatthey are well suited for reaction–diffusion equations.     

Time Series Prediction Based on Chaotic Attractor

A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series.     

CAP-子群与p-幂零性

设G是有限群。H是G的一个正规子群。P是|H|的一个素因子。P是H的一个Sylow p-子群。若下列条件之一满足。则H是p-幂零：1)P的极大子群都是G的CAP-子群且(|H|，P-1)=1；2)P的二次极大子群都是G的CAP-子群且(|H|，P^2-1)=1。特别地，若进一步假设G／H为P-幂零且(|G|，P-1)=1或(|G|，P^2-1)=1。则G自身亦为P-幂零。     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

On the degree of convergence of lemniscates in finite connected domains

For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω.     

Scheduling data transfers in a network and the set scheduling problem

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.