Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

~ Transform Demonstration of Dark Soliton Solutions Found by Inverse Scattering

One of the basic problems about the inverse scattering transform for solving a completely integrable nonlinear evolutions equation is to demonstrate that the Jost solutions obtained from the inverse scattering equations of Cauchy integral satisfy the Lax equations. Such a basic problem still exists in the procedure of deriving the dark soliton solutions of the NLS equation in normal dispersion with non-vanishing boundary conditions through the inverse scattering transform. In this paper, a pair of Jost solutions with same analytic properties are composed to be a 2 × 2 matrix and then another pair are introduced to be its right inverse confirmed by the Liouville theorem. As they are both 2 × 2 matrices, the right inverse should be the left inverse too, based upon which it is not difficult to show that these Jost solutions satisfy both the first and second Lax equations. As a result of compatibility condition, the dark soliton solutions definitely satisfy the NLS equation in normal dispersion with non-vanishing boundary conditions.     

Estimating Invariant Probability Densities for Dynamical Systems

Knowing a probability density (ideally, an invariant density) for the trajectories of a dynamical system allows many significant estimates to be made, from the well-known dynamical invariants such as Lyapunov exponents and mutual information to conditional probabilities which are potentially more suitable for prediction than the single number produced by most predictors. Densities on typical attractors have properties, such as singularity with respect to Lebesgue measure, which make standard density estimators less useful than one would hope. In this paper we present a new method of estimating densities which can smooth in a way that tends to preserve fractal structure down to some level, and that also maintains invariance. We demonstrate with applications to real and artificial data.     

Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over F_q of length qⁿ defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes.     

Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings

Recently, S. Reich and S. Simons provided a novel proof of the Kirszbraun-Valentine extension theorem using Fenchel duality and Fitzpatrick functions. In the same spirit, we provide a new proof of an extension result for firmly nonexpansive mappings with an optimally localized range.

     

多时滞随机神经网络的稳定性

通过构建李雅普偌夫函数的方法和利用半鞅收敛定理对一类随机时滞神经网络的全局指数稳定进行了分析,提出了易于判定随机时滞神经网络几乎必然指数稳定性新的代数判据,推广了[1]中的主要结论.     

Molecular dynamics simulations on the structures and properties of ε-CL-20-based PBXs ——Primary theoretical studies on HEDM formulation design

Five polymer bonded explosives (PBXs) with the base explosive ε-CL-20 (hexanitrohexaazaisowurtzi- tane), the most important high energy density compound (HEDC), and five polymer binders (Estane 5703, GAP, HTPB, PEG, and F2314) were constructed. Molecular dynamics (MD) method was employed to investigate their binding energies (Ebind), compatibility, safety, mechanical properties, and energetic properties. The information and rules were reported for choosing better binders and guiding formula- tion design of high energy density material (HEDM). According to the calculated binding energies, the ordering of compatibility and stability of the five PBXs was predicted as ε-CL-20/PEG > ε-CL-20/ Estane5703 ≈ε-CL-20/GAP > ε-CL-20/HTPB > ε-CL-20/F2314. By pair correlation function g(r) analyses, hydrogen bonds and vdw are found to be the main interactions between the two components. The elasticity and isotropy of PBXs based ε-CL-20 can be obviously improved more than pure ε-CL-20 crystal. It is not by changing the molecular structures of ε-CL-20 for each binder to affect the sensitivity. The safety and energetic properties of these PBXs are mainly influenced by the thermal capability (C°p) and density (ρ) of binders, respectively.     

Hajek—Renyi不等式的推广及其应用

对Hajek-Renyi不等式进行了推广，利用推广的不等式给出了随机变量序列绝对平均意义下的强大数定律的一个条件．     

Hilbert Space of Probability Density Functions Based on Aitchison Geometry

The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison＇s ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space.     

关于微分熵的一类强偏差定理

利用关于乘积分布密度的相对熵和相对熵率的概念,建立了相依连续型随机变量序列关于参考微分熵的一类强偏差定理,证明中给出了将Laplace变换应用于微分熵强偏差定理的研究的一种途径．