Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。     

Non‐empirical calculations of NMR indirect carbon–carbon coupling constants. Part 4: Bicycloalkanes

A systematic study of the one‐bond and long‐range J(C,C), J(C,H) and J(H,H) in the series of nine bicycloalkanes was performed at the SOPPA level with special emphasis on the coupling transmission mechanisms at bridgeheads. Many unknown couplings were predicted with high reliability. Further refinement of SOPPA computational scheme adjusted for better performance was carried out using bicyclo[1.1.1]pentane as a benchmark to investigate the influence of geometry, basis set and electronic correlation. The calculations performed demonstrated that classical ab initio SOPPA applied with the locally dense Dunning's sets augmented with inner core s‐functions used for coupled carbons and Sauer's sets augmented with tight s‐functions used for coupled hydrogens performs perfectly well in reproducing experimental values of different types of coupling constants (the estimated reliability is ca 1–2 Hz) in relatively large organic molecules of up to 11 carbon atoms. Additive coupling increments were derived for J(C,C), J(C,H) and J(H,H) based on the calculated values of coupling constants within SOPPA in the model bicycloalkanes, in reasonably good agreement with the known values obtained earlier on pure empirical grounds. Most of the bridgehead couplings in all but one bicycloalkane appeared to be essentially additive within ca 2–3 Hz while bicyclo[1.1.1]pentane demonstrated dramatic non‐additivity of ?14.5 Hz for J(C,C), +16.6 Hz for J(H,H) and ?5.5 Hz for J(C,H), in line with previous findings. Non‐additivity effects in the latter compound established at the SOPPA level should be attributed to the through‐space non‐bonded interactions at bridgeheads due to the essential overlapping of the bridgehead rear lobes which provides an additional and effective non‐bonding coupling path for the bridgehead carbons and their protons in the bicyclopentane framework. Copyright © 2003 John Wiley & Sons, Ltd.     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.     

The Gram Matrix of a PT-Symmetric Quantum System

The eigenstates of a diagonalizable PT-symmetric Hamiltonian satisfy unconventional completeness and orthonormality relations. These relations reflect the properties of a pair of bi-orthonormal bases associated with non-hermitean diagonalizable operators. In a similar vein, such a dual pair of bases is shown to possess, in the presence of PT symmetry, a Gram matrix of a particular structure: its inverse is obtained by simply swapping the signs of some its matrix elements.     

多小波子空间上的单小波表示

本文在较弱的条件下,建立了2重多小波子空间与单小波子空间的关系.即由2重多小波构造出单小波.一方面,这种单小波的平移伸缩与2重多小波的平移伸缩生成的子空间是完全相同的;另一方面,它具有插值性.因此通过构造出的单小波建立了多小波子空间上的Shannon型采样定理.     

Banach空间上的框架与Riesz基

本文讨论Banach空间上框架、无冗框架与Riesz基之间的关系及它们的稳定性．     

Fractional programming and characterization of some vertices of the feasible region

This paper considers a problem of nonlinear programming in which the objective function is the ratio of two linear functions and the constraints define a bounded and connected feasible region. Using a coordinate transformation, this problem is transformed into a simpler one, whose geometric interpretation is of particular significance. The transformation leads to a characterization of some special vertices of the feasible region from both the theoretical and operational points of view.     

反恐怖安全检测技术的物理基础

反恐怖安全检测技术已成为人们的热门话题。安全检测技术的诞生和发展离不开物理学家的贡献。物理学为反恐怖安全检测孕育了多种手段和方法。文章简要介绍了X射线探测、γ射线探测、四极共振分析、脉冲式快中子分析、离子迁移率光谱测量、毫米波探测、声学探测、磁场探测、电磁脉冲探测等安全检测技术的物理基础。