Synchronization Analysis of Coupled Noncoherent Oscillators

We present two different approaches to detect and quantify phase synchronization in the case of coupled non-phase coherent oscillators. The first one is based on the general idea of curvature of an arbitrary curve. The second one is based on recurrences of the trajectory in phase space. We illustrate both methods in the paradigmatic example of the R?ssler system in the funnel regime. We show that the second method is applicable even in the case of noisy data. Furthermore, we extend the second approach to the application of chains of coupled systems, which allows us to detect easily clusters of synchronized oscillators. In order to illustrate the applicability of this approach, we show the results of the algorithm applied to experimental data from a population of 64 electrochemical oscillators.     

NONLOCAL INITIAL PROBLEM FOR NONLINEAR NONAUTONOMOUS DIFFERENTIAL EQUATIONS IN A BANACH SPACE

The nonlocal initial problem for nonlinear nonautonomous evolution equati-ons in a Banach space is considered. It is assumed that the nonlinearities havethe local Lipschitz properties. The existence and uniqueness of mild solutionsare proved. Applications to integro-differential equations are discussed.The main tool in the paper is the normalizing mapping (the generalizednorm).     

一类非线性抛物方程弱解的L~2 衰减(英文)

本文研究了非线性抛物方程弱解的L2 衰减 ,证明了若u是非线性抛物方程的一个弱解 ,则u满足‖u‖L2 ≤C( 1 t) -n/ 4,其中C是常数且仅依赖于初始值u0 的范数 .     

The Computable Dimension of I-Trees of Infinite Height

We study computable trees with distinguished initial subtree (briefly, I-trees). It is proved that all I-trees of infinite height are computably categorical, and moreover, they all have effectively infinite computable dimension.     

Stability of Markovian structure observed in high frequency foreign exchange data

Contrary to the common sense in economics and financial engineering, price fluctuations at very fine level of motion exhibit various evidences against the efficient market hypothesis. We attempt to investigate this issue by studying extensive amount of foreign currency exchange data for over five years at the finest level of resolution. We specifically focus on the proposed stability in binomial conditional probabilities originally found in much smaller examples of financial time series. In order to handle very large data, we have written an efficient program in C that automatically generates those conditional probabilities. It is found that the stability is maintained for extremely large time duration that covers almost the entire period. Based on the length of conditions for which the conditional probabilities are distinguishable each other, we identify the length of memory being less than 3 movements.     

中子俘获瞬发γ射线数据评价(英文)

简要地介绍了中子俘获瞬发γ射线数据及其衰变纲图的评价方法技术、主要程序及其功能、数据评价流程、强度平衡检验，以及对A=1-44的稳定核素和A>190的部分稳定核素的热中子俘获瞬发γ射线数据及其衰变纲图评价的具体应用.The method of prompt γ-ray data evaluation for neutron capture and how to calculate the prompt γ-ray intensities of neutron capture have been briefly presented. The prompt γ-ray data of thermal-neutron capture of some stable nuclei for A=1-44 and A>190 have been evaluated. The ENSDF format has been adopted. The checks of intensity balance and format have been made. The examples are given to illustrate its application.     

基于Karhunen-Loève变换和小波谱特征矢量量化的三维谱像数据压缩

提出了基于Karhunen Lo埁ｖｅ变换的小波谱特征矢量量化三维谱像数据压缩方法耍幔颍瑁酰睿澹?Lo埁ｖｅ变换 /小波变换 /小波谱特征矢量量化方法应用了Karhunen Lo埁ｖｅ变换的消除谱相关性优良性能 ,应用二维小波变换消除空间相关性 ,在小波变换域内应用二维集分割嵌入块编码和一维谱特征矢量量化对三维谱像数据压缩 ,获得较高的压缩性能。实验结果表明 :Karhunen Lo埁ｖｅ变换 /小波变换 /小波谱特征矢量量化编码比Karhunen Lo埁ｖｅ变换 /小波变换 /改进对块零树编码和Karhunen Lo埁ｖｅ变换 /小波变换 /快速矢量量化编码方法在同样压缩比条件下 ,峰值信噪比提高 2dB和 1dB以上 ,而速度提高了 1.5和 8倍 ,整体压缩性能有较大的提高     

Tail probabilities of the limiting null distributions of the Anderson–Stephens statistics

For the purpose of testing the spherical uniformity based on i.i.d. directional data (unit vectors) z_i, i=1,…,n, Anderson and Stephens (Biometrika 59 (1972) 613–621) proposed testing procedures based on the statistics S_max=max_u S(u) and S_min=min_u S(u), where u is a unit vector and nS(u) is the sum of squares of u′z_i's. In this paper, we also consider another test statistic S_range=S_max−S_min. We provide formulas for the P-values of S_max, S_min, S_range by approximating tail probabilities of the limiting null distributions by means of the tube method, an integral-geometric approach for evaluating tail probability of the maximum of a Gaussian random field. Monte Carlo simulations for examining the accuracy of the approximation and for the power comparison of the statistics are given.     

Sobolev bounds on functions with scattered zeros, with applications to radial basis function surface fitting

In this paper we discuss Sobolev bounds on functions that vanish at scattered points in a bounded, Lipschitz domain that satisfies a uniform interior cone condition. The Sobolev spaces involved may have fractional as well as integer order. We then apply these results to obtain estimates for continuous and discrete least squares surface fits via radial basis functions (RBFs). These estimates include situations in which the target function does not belong to the native space of the RBF.

     

A fully linear-time approximation algorithm for grammar-based compression

A linear-time approximation algorithm for the grammar-based compression is presented. This is an optimization problem to minimize the size of a context-free grammar deriving a given string. For each string of length n, the algorithm guarantees approximation ratio without suffix tree construction.