Revisiting Gouy phase

The aim of this paper is to highlight the added value of the generalized Gouy phase shift introduced by Siegman. Although suited for optical systems study, including those more complex than free space, we note that it did not meet the use that it deserves so far. The analysis of the whole of the ideas and analytical approaches associated to the important concept of the Gouy phase proves its effectiveness.

Usually, the resonance condition is systematically built on the basis of the equivalent empty cavity. Unfortunately, this approach does not cover some of the useful parameters of the real resonator. By means of the generalized Gouy phase and the self-consistent complex parameter q, we derive here a new approach for the calculation of the resonance condition for the real cavity. Moreover, the use of the generalized Gouy phase clearly simplifies the study of resonators, while making it possible to avoid the use of the Huygens’ Fresnel integral.     

Solution of monotone complementarity problems with locally Lipschitzian functions

The paper deals with complementarity problems CP(F), where the underlying functionF is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equationsφ(x)=0 or as the problem of minimizing the merit functionΘ=1/2∥Φ∥ ₂ ² , we extend results which hold for sufficiently smooth functionsF to the nonsmooth case. In particular, ifF is monotone in a neighbourhood ofx, it is proved that 0 εδθ(x) is necessary and sufficient forx to be a solution of CP(F). Moreover, for monotone functionsF, a simple derivative-free algorithm that reducesΘ is shown to possess global convergence properties. Finally, the local behaviour of a generalized Newton method is analyzed. To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended top-order semismooth functions. Under a suitable regularity condition and ifF isp-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the order of 1+p.     

Partial scan design and test sequence generation based on reduced scan shift method

This paper presents a partial scan algorithm, calledPARES (PartialscanAlgorithm based onREduced Scan shift), for designing partial scan circuits. PARES is based on the reduced scan shift that has been previously proposed for generating short test sequences for full scan circuits. In the reduced scan shift method, one determines proch FFs must be controlled and observed for each test vector. According to the results of similar analysis, PARES selects these FFs that must be controlled or observed for a large number of test vectors, as scanned FFs. Short test sequences are generated by reducing scan shift operations using a static test compaction method. To minimize the loss of fault coverage, the order of test vectors is so determined that the unscanned FFs are in the state required by the next test vector. If there are any faults undetected yet by a test sequence derived from the test vectors, then PARES uses a sequential circuit test generator to detect the faults. Experimental results for ISCAS'89 benchmark circuits are given to demonstrate the effectiveness of PARES.     

The performance of a direct-sequence spread-spectrum acquisition system using a linear prediction filter for narrowband interference suppression

The coarse acquisition performance of a direct sequence spread-spectrum receiver is analyzed when a linear prediction filter is used for narrowband interference suppression. We show that once an appropriate matching strategy is identified, the linear prediction filter can provide favorable performance when narrowband interference is present over a considerable range of both interference power and bandwidth. In addition, the presence of the filter dramatically improves the performance over the case where there is no filter, except when the interference bandwidth and the power are both small (i.e., when the processing gain provides sufficient interference immunity without the filter). If long spreading sequences are used with moderately sized observation windows, the acquisition performance can be severely degraded when a parallel acquisition scheme is used due to the linear predication filter. We show, however, that a slower serial receiver will provide reliable performance.This work was supported in part by the Office of Naval Research under contract ONR N00014-91-J-1234, the Army Research Office under contract ARO DAAL03-91-0071, and the NSF Center for Ultra-High Speed Circuits and Systems (ICAS).     

Arithmetic Hodge Structure and Nonvanishing of the Cycle Class of 0-Cycles

We construct 0-cycles on a self-product of a curve whose cycle classes are linearly independent in the extension group of arithmetic Hodge structure. This is an extended version of Theorem 4.5 of Asakura's contribution to CMR Lecture Notes Ser. 24 ((2000), pp. 133–154).     

独立不同分布随机变盆序列的部分和的增量有多小

关于独立同分布随机变量部分和的增量有多小问题，目前已有了著名的结果.本文通过与独立同分布情形时完全不同的途径，讨论了独立不同分布情形时相应的问题.在矩母函数存在的条件下，获得了与同分布情形相近的结论.     

逆序数的应用

本文通过“1 4-1 5”智力玩具和最优戴断切割问题两个实例 ,讨论了逆序数在解决实际问题中的应用     

关于Erdos-Jacobson-Lehel 问题的门槛

设σ(k,n）表示最小的正整数m，使得对于每个n项正可图序列，当其项和至少为m时，有一个实现含k 1个顶点的团作为其子图。Erdos等人猜想：σ(k,n）＝（k-1)(2n-k) 2.Li等人证明了这个猜想对于k≥5，n≥（^k2））＋3是对的，并且提出如下问题：确定最小的整数N（k），使得这个猜想对于n≥N(k）成立。他们同时指出：当k≥5时，[5k-1/2]≤N(k）≤（^k2) 3.Mubayi猜想：当k≥5时，N(k）＝[5k-1/2]。在本文中，我们证明了N（8）＝20，即Mubayi猜想对于k=8是成立的。     

Separation of Variables in the Kovalevskaya–Goryachev–Chaplygin Gyrostat

We construct separation variables for the Kovalevskaya–Goryachev–Chaplygin gyrostat for arbitrary values of the parameters. We show that different separation variables can be constructed for the same integrable system if different integrals of motion are chosen.     

An extension of gap functions for a system of vector equilibrium problems with applications to optimization problems

In this paper, the notion of gap functions is extended from scalar case to vector one. Then, gap functions and generalized functions for several kinds of vector equilibrium problems are shown. As an application, the dual problem of a class of optimization problems with a system of vector equilibrium constraints (in short, OP) is established, the concavity of the dual function, the weak duality of (OP) and the saddle point sufficient condition are derived by using generalized gap functions. This work was supported by the National Natural Science Foundation of China (10671135) and the Applied Research Project of Sichuan Province (05JY029-009-1).