Existence of periodic orbits and shift-invariant curve sequences near multiple homoclinics简

In this paper, the complicated dynamics is studied near a double homoclinic loops with bellows configuration for general systems. For the non-twisted multiple homoclinics, the existence of periodic orbit with the specified route and the existence of shift-invariant curve sequences defined on the cross sections of multiple homoclinics corresponding to any specified one-side infinite sequences are given. In addition, the existence regions are also located.     

Convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems

The convergence analysis of a nonlinear Lagrange algorithm for solving nonlinear constrained optimization problems with both inequality and equality constraints is explored in detail. The estimates for the derivatives of the multiplier mapping and the solution mapping of the proposed algorithm are discussed via the technique of the singular value decomposition of matrix. Based on the estimates, the local convergence results and the rate of convergence of the algorithm are presented when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions. Furthermore, the condition number of the Hessian of the nonlinear Lagrange function with respect to the decision variables is analyzed, which is closely related to efficiency of the algorithm. Finally, the preliminary numericM results for several typical test problems are reported.     

Low-cost addition–subtraction sequences for the final exponentiation in pairings

In this paper, we address the problem of finding low cost addition–subtraction sequences for situations where a doubling step is significantly cheaper than a non-doubling one. One application of this setting appears in the computation of the final exponentiation step of the reduced Tate pairing defined on ordinary elliptic curves. In particular, we report efficient addition–subtraction sequences for the Kachisa–Schaefer–Scott family of pairing-friendly elliptic curves, whose parameters involve computing the multi-exponentiation of relatively large sequences of exponents with a size of up to 26 bits.     

Calderón–Zygmund Operators in the Bessel Setting for All Possible Type Indices

We show that many harmonic analysis operators in the Bessel setting,including maximal operators,Littlewood–Paley–Stein type square functions,multipliers of Laplace or Laplace–Stieltjes transform type and Riesz transforms are,or can be viewed as,Calderón–Zygmund operators for all possible values of type parameter λ in this context.This extends results existing in the literature,but being justified only for a restricted range of λ.     

Proofs of some conjectures on monotonicity of number-theoretic and combinatorial sequences

In 2012,Zhi-Wei Sun posed many conjectures about the monotonicity of sequences of form {n√zn},where {zn} is a familiar number-theoretic or combinatorial sequence. We show that if the sequence {zn+1/zn}is increasing(resp.,decreasing),then the sequence {n√zn} is strictly increasing(resp.,decreasing) subject to a certain initial condition. We also give some sufficient conditions when {zn+1/zn} is increasing,which is equivalent to the log-convexity of {zn}. As consequences,a series of conjectures of Zhi-Wei Sun are verified in a unified approach.     

共轭可交换性及其在集合形式单调类定理中的应用

引入了集列的极限运算与二元集运算之间的共轭可交换性的概念,讨论了常见的和重要的集列的极限运算与集代数运算之间所具有的共轭可交换性质,在一般的情形下证明了共轭可交换性是集类的极限运算生成类对集代数运算具有封闭性的一个充分条件,使得集合形式的单调类定理的理论得到了统一的解释,并且证明更简单,思路更清晰,最后还给出了一个新的集合形式的单调类定理.     

相协样本半参数回归模型估计的矩相合性

考虑半参数回归模型Y(j) (xin,tin) =tinβ g(xin) e(j) (xin) ,1 ≤j≤m ,1 ≤i≤n .利用最小二乘法和权函数估计方法 ,定义 β ,g的估计量βm ,n和gm ,n(x) ,在负相依样本及较弱的条件下证明了这些估计的矩相合性 ,这些结论推广和改进了胡舒合 ( 1 997)关于独立情形的相应结论 .     

Unconventional Coding Technique Applied to Multi-Level Polarization Modulation

A new technique is proposed to improve information confidentiality in optical-fiber communications without bandwidth consumption. A pseudorandom vectorial sequence was generated by a dynamic system algorithm and used to codify a multi-level polarization modulation based on the Stokes vector. Optical-fiber birefringence, usually considered as a disturbance, was exploited to obfuscate the signal transmission. At the receiver end, the same pseudorandom sequence was generated and used to decode the multi-level polarization modulated signal. The proposed scheme, working at the physical layer, provides strong information security without introducing complex processing and thus latency.     

A parametric view on the Mangasarian–Fromovitz constraint qualification

The growth of the multipliers, when the parameter approaches such a critical parameter, is characterized by a parametric constraint qualification which is introduced here. It is equivalent to a bound on the growth of the multipliers. Received May 8, 1995 / Revised version received February 12, 1998 Published online February 25, 1999