Analytical Study of Nonlinear Dust Acoustic Waves in Two-Dimensional Dust Plasma with Dust Charge Variation

The nonlinear dust acoustic waves in two-dimensional dust plasma with dust charge variation is analytically investigated by using the formally variable separation approach. New analytical solutions for the governing equation of this system have been obtained for dust acoustic waves in a dust plasma for the first time. We derive exact analytical expressions for the general case of the nonlinear dust acoustic waves in two-dimensional dust plasma with dust charge variation.     

Three-Step Predictor-Corrector of Exponential Fitting Method for Nonlinear Schroedinger Equations

We develop the three-step explicit and implicit schemes of exponential fitting methods. We use the three- step explicit exponential fitting scheme to predict an approximation, then use the three-step implicit exponential fitting scheme to correct this prediction. This combination is called the three-step predictor-corrector of exponential fitting method. The three-step predictor-corrector of exponential fitting method is applied to numerically compute the coupled nonlinear Schroedinger equation and the nonlinear Schroedinger equation with varying coefficients. The numerical results show that the scheme is highly accurate.     

凹整数规划的分枝定界解法

凹整数规划是一类重要的非线性整数规划问题，也是在经济和管理中有着广泛应用的最优化问题．本文主要研究用分枝定界方法求解凹整数规划问题，这一方法的基本思想是对目标函数进行线性下逼近，然后用乘子搜索法求解连续松弛问题．数值结果表明，用这种分枝定界方法求解凹整数规划是有效的．     

对求解非线性方程方法的探索

BaiCL在2001年提出了双曲函数法，并把解设成具体的双曲函数，即sinhw和coshw的线性组合．本文把解设成是由2个函数f(ξ)和g(ξ)组成的线性组合，它们可以有多种取法，从而使方程更直接、更有效．借助数学软件Maple，用改进后的方法和吴文俊消元法，求解Bai C L文中的一个例子，获得了包含Bai文结果在内的更为丰富、精确的行波解．     

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.     

Synthesis and Crystal Structure of a Novel Organic Adduct Nonlinear Optical Material: 3,5-Dinitrobenzonic Acid·ethanolamine (3,5-DNBEA)

The title compound (C2H7NO·C7H4N2O6) has been obtained by the reaction of etha- nolamine with 3,5-dinitrobenzoic acid in deionized water at room temperature. The crystal crystal- lizes in orthorhombic, space group P212121 with a = 6.048(2), b = 9.146(3), c = 21.955(7)(A), C9H11N3O7, Mr = 273.21, Z = 4, V = 1214.3(7)(A)3, Dc = 1.494 g/cm3, F(000) = 568, μ(MoKα) = 0.131 mm-1, R1 = 0.0338 and wR2 = 0.0497. The new organic adduct is composed of one ethanolamine and one 3,5-dinitrobenzoic acid, which are linked up by O-H…O and N-H…O types of hydrogen bonds to form a nine-membered ring and an eleven-membered ring, extending into a one-dimensional network structure.     

Asymptotics of estimates in constrained nonlinear regression with long-range dependent innovations

The purpose of this paper is to investigate the asymptotic properties of the least squares estimates (L ₂-estimates) and the least absolute deviation estimates (L ₁-estimates) of the parameters of a nonlinear regression model subject to a set of equality and inequality restrictions, which has a long-range dependent stationary process as its stochastic errors. Then we will compare the asymptotic relative efficiencies of the above estimators.     

试探方程法及其在非线性发展方程中的应用

提出了一种比较系统的求解非线性发展方程精确解的新方法, 即试探方程法. 以一个带5阶 导数项的非线性发展方程为例, 利用试探方程法化成初等积分形式，再利用三阶多项式的完 全判别系统求解，由此求得的精确解包括有理函数型解, 孤波解, 三角函数型周期解, 多项 式型Jacobi椭圆函数周期解和分式型Jacobi椭圆函数周期解 关键词： 试探方程法 非线性发展方程 孤波解 Jacobi椭圆函数 周期解     

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.