Improved and self-tuned occurrence heuristics

In this note we present three efficient variations of the occurrence heuristic, adopted by many exact string matching algorithms and first introduced in the well-known Boyer–Moore algorithm. Our first heuristic, called improved-occurrence heuristic, is a simple improvement of the rule introduced by Sunday in his Quick-Search algorithm. Our second heuristic, called worst-occurrence heuristic, achieves its speed-up by selecting the relative position which yields the largest average advancement. Finally, our third heuristic, called jumping-occurrence heuristic, uses two characters for computing the next shift. Setting the distance between these two characters optimally allows one to maximize the average advancement. The worst-occurrence and jumping-occurrence heuristics tune their parameters according to the distribution of the characters in the text. Experimental results show that the newly proposed heuristics achieve very good results on average, especially in the case of small alphabets.     

On the transposition anti-involution in real Clifford algebras I: the transposition map

A particular orthogonal map on a finite-dimensional real quadratic vector space (V,?Q) with a non-degenerate quadratic form Q of any signature (p,?q) is considered. It can be viewed as a correlation of the vector space that leads to a dual Clifford algebra C?(V*,?Q) of linear functionals (multiforms) acting on the universal Clifford algebra C?(V,?Q). The map results in a unique involutive automorphism and a unique involutive anti-automorphism of C?(V,?Q). The anti-involution reduces to reversion (resp. conjugation) for any Euclidean (resp. anti-Euclidean) signature. When applied to a general element of the algebra, it results in transposition of the element matrix in the left regular representation of C?(V,?Q). We also give an example for real spinor spaces. The general setting for spinor representations will be treated in part II of this work [R. Ab?amowicz and B. Fauser, On the transposition anti-involution in real Clifford algebras II: Stabilizer groups of primitive idempotents, Linear Multilinear Algebra, to appear].     

Banach空间中含间断项Sturm—Liouville问题的解

利用拟上下解方法和混合单调迭代法,研究了Banach空间中含间断项的非线性Sturm-liouville问题解的存在唯一性,并给出逼近解迭代序列的误差估计．     

Symmetric Powers of Nat 𝔰𝔩2(𝕂)

We identify the spaces of homogeneous polynomials in two variables 𝕂[Y^k, XY^k?1, ?, X^k] among representations of the Lie ring 𝔰𝔩₂(𝕂). This amounts to constructing a compatible 𝕂-linear structure on some abstract 𝔰𝔩₂(𝕂)-modules, where 𝔰𝔩₂(𝕂) is viewed as a Lie ring.     

Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems

In this article, a novel objective penalty function as well as its second-order smoothing is introduced for constrained optimization problems (COP). It is shown that an optimal solution to the second-order smoothing objective penalty optimization problem is an optimal solution to the original optimization problem under some mild conditions. Based on the second-order smoothing objective penalty function, an algorithm that has better convergence is introduced. Numerical examples illustrate that this algorithm is efficient in solving COP.     

A baire approach to quantitative resonance principles

The main purpose of this paper is to give a proof of quantitative resonance and condensation principles via Baire category arguments in contrast to the gliding hump method used previously. Thereby a new nonquantitative resonance principle is established which is concerned with dominated convergence in Frechet spaces, by the way yielding more detailed information on the structure of the underlying spaces. On the other hand, Baire's approach is an easy tool to develop condensation principles by considering residual sets. Finally, some typical applications concerning trigonometric Fourier partial sums may illustrate the result received.     

假期中顾客以概率θ进人的Geo/G/1(E,SV)排队系统的队长分布

考虑单重休假的Geo/G/1离散时间排队系统,其中在服务员休假期间到达的顾客以概率θ(0<θ≤1)进入系统.通过引入"服务员忙期"和使用全概率分解技术,从任意初始状态出发,研究了队长的瞬态和稳态性质,导出了在任意时刻n瞬态队长分布的z-变换的递推表达式和稳态队长分布的递推表达式,以及稳态队长的随机分解.最后,通过数值实例,讨论了稳态队长分布对系统参数的敏感性,并阐述了获得便于计算的稳态队长分布的表达式在系统容量设计中有重要的价值.