Solitary wave solutions of nonlinear financial markets :data-modeling-concept-practicing

This paper seeks to solve the difficult nonlinear problem in financial markets on the complex system theory and the nonlinear dynamics principle, with the data-model-concept-practice issue-oriented reconstruction of the phase space by the high frequency trade data. In theory, we have achieved the differentiable manifold geometry configuration, discovered the Yang-Mills functional in financial markets, obtained a meaningful conserved quantity through corresponding space-time non-Abel localization gauge symmetry transformation, and derived the financial solitons, which shows that there is a strict symmetry between manifold fiber bundle and guage field in financial markets. In practical applications of financial markets, we have repeatedly carried out experimental tests in a fluctuant evolvement, directly simulating and validating the existence of solitons by researching the price fluctuations (society phenomena) using the same methods and criterion as in natural science and in actual trade to test the stock Guangzhou Proprietary and the futures Fuel Oil in China. The results demonstrate that the financial solitons discovered indicates that there is a kind of new substance and form of energy existing in financial trade markets, which likely indicates a new science paradigm in the economy and society domains beyond physics.      

Local algorithms in exterior tomography

Exterior tomographic data are taken over lines outside a central region, and such data occur in the industrial nondestructive evaluation of large objects such as rockets. We explain, using microlocal analysis, which singularities are well reconstructed from exterior data, and we explain how this phenomenon is reflected in the singular value decomposition for the exterior transform [E.T. Quinto, Singular value decompositions and inversion methods for the exterior Radon transform and a spherical transform, J. Math. Anal. Appl. 95 (1983) 437–448]. We extend Lambda Tomography to exterior data and to limited angle exterior data. The algorithm is tested on industrial data from Perceptics, Inc.     

Robust Dynamics and Control of a Partially Observed Markov Chain

In a seminal paper, Martin Clark (Communications Systems and Random Process Theory, Darlington, 1977, pp. 721–734, 1978) showed how the filtered dynamics giving the optimal estimate of a Markov chain observed in Gaussian noise can be expressed using an ordinary differential equation. These results offer substantial benefits in filtering and in control, often simplifying the analysis and an in some settings providing numerical benefits, see, for example Malcolm et al. (J. Appl. Math. Stoch. Anal., 2007, to appear). Clark’s method uses a gauge transformation and, in effect, solves the Wonham-Zakai equation using variation of constants. In this article, we consider the optimal control of a partially observed Markov chain. This problem is discussed in Elliott et al. (Hidden Markov Models Estimation and Control, Applications of Mathematics Series, vol. 29, 1995). The innovation in our results is that the robust dynamics of Clark are used to compute forward in time dynamics for a simplified adjoint process. A stochastic minimum principle is established.     

Banach空间中极大单调算子的一个邻近点算法

设E是Banach空间,T∶E→2E*是极大单调算子,T-10≠ф.令x0∈E,yn=(J λnT)-1xn en,xn 1=J-1(αnJxn (1-αn)Jyn),n0,λn>0,αn∈[0,1],文章研究了{xn}收敛性.     

Excess enthalpy of ternary mixture for diamine+heptane+cyclohexan

The excess molar enthalpy of ternary mixture for 3-diethylaminopropylamine+heptane+cyclohexane were measured using a Calvet microcalorimeter at 303.15 K. Empirical equations, Redlich-Kister, Tsao-Smith, and Kohler and group contribution models, UNIFAC (modified version) and DISQUAC have been applied. A reasonable representation of ternary data is obtained. This revised version was published online in August 2006 with corrections to the Cover Date.     

Semideterministic Global Optimization Method: Application to a Control Problem of the Burgers Equation

This paper has two objectives. We introduce a new global optimization algorithm reformulating optimization problems in terms of boundary-value problems. Then, we apply this algorithm to a pointwise control problem of the viscous Burgers equation, where the control weight coefficient is progressively decreased. The results are compared with those obtained with a genetic algorithm and an LM-BFGS algorithm in order to check the efficiency of our method and the necessity of using global optimization techniques.     

Simplified analytic solutions and a novel fast algorithm for Yb-doped double-clad fiber lasers

In this paper, continuous wave Yb³⁺-doped double-clad fiber lasers (DCFLs) with linear-cavity are investigated theoretically and numerically using the rate equations. Under the steady state conditions, the simplified analytic solutions of Yb³⁺-doped DCFLs under considering the scattering loss are deduced in the strongly pump condition. Compared with the known analytic solutions in published literatures, our analytic solutions are more accurate, especially, at higher reflectivity of output mirror. In addition, a fast and stable algorithm based on the Newton-Raphson method is proposed to simulate numerically Yb³⁺-doped DCFLs. The results by simplified analytic solutions are in good agreement with those by the numerical simulation. Moreover, we have performed the optimization of an Yb³⁺-doped DCFL using the simplified analytic solutions and the numerical simulations, respectively.     

Weighted Kolmogrov–Smirnov type tests for grouped Rayleigh data

We consider goodness of fit tests for the Rayleigh distribution with grouped data. New Kolmogrov–Smirnov type tests are suggested and compared with the traditional chi-square and likelihood ratio tests. The results show that some of the suggested tests have a good power performance as compared with the traditional ones.     

On solving energy-dependent partitioned eigenvalue problem by genetic algorithm: The case of real symmetric Hamiltonian matrices

An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed     

A competitive algorithm in searching for many edges in a hypergraph

We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. Damaschke did the d=1 case for 2-graphs, Triesch extended the d=1 case to r-graphs, and Johann did the general d case for 2-graphs. So ours is the first attempt to solve the searching for defective edges problem in its full generality. Further, all the above three papers assumed d known. We give a competitive algorithm where d is unknown.