Field Theory Methods in Classical Dynamics

A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta.     

蚕沙提取果胶水解环境研究

果胶的提取率和质量与水解的环境关系密切 .本文重点在蚕沙中提取果胶从产率和颜色方面对水解的环境进行一些定性和定量的研究 ,获知各水解介质采用 0 3 %的稀硫酸液、温度 70— 80℃ ,时间 1h、pH1 5 ,提取的果胶从质量和产率上较理想     

Some degenerate and quasilinear parabolic systems not in divergence form

This paper deals with positive solutions of degenerate and quasilinear parabolic systems not in divergence form: u_t=u^p(Δu+av), v_t=v^q(Δv+bu), with null Dirichlet boundary conditions and positive initial conditions, where p, q, a and b are all positive constants. The local existence and uniqueness of classical solution are proved. Moreover, it will be proved that all solutions exist globally if and only if ab?λ₁², where λ₁ is the first eigenvalue of −Δ in Ω with homogeneous Dirichlet boundary condition.     

具连续时滞Liénard方程概周期解的存在唯一性

结合Liapunov泛函，研究了具连续时滞Lienard方程概周期解的存在唯一性和安全一致渐进稳定性。     

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.     

High precision topographic data on Lop Nor basin's Lake "Great Ear" ? and the timing of its becoming a dry salt lake

High precision elevation measurements using DGPS were carried out along three representative tran- sects for the "Great Ear" area, a dry salt lake within the Lop Nor basin. Results indicate that the Lop Nor basin is only 5.2 m deep and its lowest point occurs at the center of the "Great Ear". In addition, the basin is asymmetric - steeper in the southwest (0.19‰) and gentler in the northeast (0.09‰). Points along the same "Great Ear" ring were found to have an identical elevation value, but different when from different ones (lower towards the center). The spacing of the "Great Ear" rings was found to be closely related with the surface steepness. The closer the "Great Ear" rings are spaced, the steeper the ground surface, and vice versa. These findings support the argument that the "Great Ear" rings are the former shoreline trails left behind by Lop Nor water during the last few episodes of recession towards its total dry up. A comprehensive analysis of the high precision elevation data, historical accounts, aerial and satellite photographs and imagery, and official topographic maps of the study area suggests that the "Great Ear" area in the Lop Nor basin was incorrectly mapped as being covered by a great body of water on the 1963 topographic maps. A re-interpretation of the 1958 aerial photographs and newer remote sensing imagery indicated that the "Great Ear" ring structure was already in place in 1958 and it continued to appear on the subsequent remote sensing data without any major changes. It is estimated that lake water in the "Great Ear" area of the Lop Nor basin disappeared between the late 1930s and early 1940s.     

基于多元时间序列融合的飞行动作识别方法

针对飞行动作数据随机性强与长度不一致的问题,提出通过减小动态时间规整(DTW)算法的搜索空间,并定义不同特征参数贡献度的概念,实现对飞行数据的多元时间序列融合,从而完成对战术机动动作的识别。通过引入预分类和细分类结合的方式,对动作数据进行预处理,然后根据改进的动态时间规整(WDTW)算法对待测数据进行识别。仿真实验表明,相比传统DTW算法,WDTW算法通过降低算法复杂度,识别计算时间变化明显;对核密度与精准度系数的分析表明识别准确率亦有所提高。实验结果验证了所提方法的准确性。     

Mathematical modelling of the oxidation of nickel titanium alloys

A one-dimensional bulk reaction model for the oxidation of nickeltitanium is formulated, with preferential oxidation of titaniumbeing included. The modelling is directed at the better understandingof the dominant mechanisms involved in the oxidation processand their significance for the biocompatibility of the alloy.Two different regimes for the relative diffusivities of oxygenand the metals are investigated. By assuming fast bulk reactions,different asymptotic structures emerge in different parameterregimes and the resulting models take the form of moving boundaryproblems. Different profiles of nickel concentration are obtained:in particular a nickel-rich layer (observed in practice) ispresent below the oxide/metal interface for the case when oxygenand the metals diffuse at comparable rates.     

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.     

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.