A Generalization about Congruent Pairs on a Set

ＡＧｅｎｅｒａｌｉｚａｔｉｏｎａｂｏｕｔＣｏｎｇｒｕｅｎｔＰａｉｒｓｏｎａＳｅｔＨｕａｎｇＪｕｎｍｉｎ（黄骏敏）（ＳｈａｎｇｈａｉＪｉａｏｔｏｎｇＵｎｉｖｅｒｓｉｔｙ）Ａｂｓｔｒａｃｔ：Ｉｎｔｈｉｓｐａｐｅｒ，ｗｅｃａｎｃｅｌｔｈｅｃｏｎｄｉｔｉｏｎ...     

The zeros of Faber polynomials generated by an -star

It is shown that the zeros of the Faber polynomials generated by a regular -star are located on the -star. This proves a recent conjecture of J. Bartolomeo and M. He. The proof uses the connection between zeros of Faber polynomials and Chebyshev quadrature formulas.

     

A Hecke Algebra Quotient and Some Combinatorial Applications

Let (W, S) be a Coxeter group associated to a Coxeter graph which has no multiple bonds. Let H be the corresponding Hecke Algebra. We define a certain quotient \-H of H and show that it has a basis parametrized by a certain subset W _cof the Coxeter group W. Specifically, W _cconsists of those elements of W all of whose reduced expressions avoid substrings of the form sts where s and t are noncommuting generators in S. We determine which Coxeter groups have finite W _cand compute the cardinality of W _cwhen W is a Weyl group. Finally, we give a combinatorial application (which is related to the number of reduced expressions for w W _cof an exponential formula of Lusztig which utilizes a specialization of a subalgebra of \-H.     

A comparison of local search methods for flow shop scheduling

Local search techniques are widely used to obtain approximate solutions to a variety of combinatorial optimization problems. Two important categories of local search methods are neighbourhood search and genetic algorithms. Commonly used neighbourhood search methods include descent, threshold accepting, simulated annealing and tabu search. In this paper, we present a computational study that compares these four neighbourhood search methods, a genetic algorithm, and a hybrid method in which descent is incorporated into the genetic algorithm. The performance of these six local search methods is evaluated on the problem of scheduling jobs in a permutation flow shop to minimize the total weighted completion time. Based on the results of extensive computational tests, simulated annealing is found to generate better quality solutions than the other neighborhood search methods. However, the results also indicate that the hybrid genetic descent algorithm is superior to simulated annealing.     

二元化合物内聚能的线性化缀加平面波能带方法的计算研究

采用线性化缀加平面波能带方法,研究了典型二元化合物NiAl,SiC,GaAs,MgS和NaCl的晶体总能和内聚能,着重考查了二元素Muffin-tin半径的选取对各晶体总能和内聚能的影响。计算结果表明,对NiAl合金,Muffin-tin半径的变动几乎不改变其晶体总能;组元原子的共价键半径可以作为共价键晶体如SiC和GaAs的Muffin-tin半径;但是,元素的离子半径不适合于作为具有较强离子键合的离子性晶体如MgS和NaCl的Muffin-tin半径,因为这时阳离子有较多的芯电子溢出Muffin-tin球。通过选取适当的Muffin-tin半径,对如上化合物计算得到的内聚能与实验结果符合。     

Double Feature Extraction Method of Ship-Radiated Noise Signal Based on Slope Entropy and Permutation Entropy

In order to accurately identify various types of ships and develop coastal defenses, a single feature extraction method based on slope entropy (SlEn) and a double feature extraction method based on SlEn combined with permutation entropy (SlEn&PE) are proposed. Firstly, SlEn is used for the feature extraction of ship-radiated noise signal (SNS) compared with permutation entropy (PE), dispersion entropy (DE), fluctuation dispersion entropy (FDE), and reverse dispersion entropy (RDE), so that the effectiveness of SlEn is verified, and SlEn has the highest recognition rate calculated by the k-Nearest Neighbor (KNN) algorithm. Secondly, SlEn is combined with PE, DE, FDE, and RDE, respectively, to extract the feature of SNS for a higher recognition rate, and SlEn&PE has the highest recognition rate after the calculation of the KNN algorithm. Lastly, the recognition rates of SlEn and SlEn&PE are compared, and the recognition rates of SlEn&PE are higher than SlEn by 4.22%. Therefore, the double feature extraction method proposed in this paper is more effective in the application of ship type recognition.     

Zernike多项式展开系数的时间相关性

 分析了受大气湍流扰动的光波波前在系统接收孔径上的Zernike多项式展开系数的时间相关性,在此基础上进一步分析了从不同方向到达系统接收孔径的光波波前整体倾斜之间的相关性,并给出了光波在水平均匀大气中传播时的结果。     

关于三维各向同性谐振子径向矩阵元计算的讨论

根据广义Laguerre多项式的数学性质，导出了较为简单的三维各向同性谐振子径向矩阵元的普遍公式,并在这基础上计算了一些重要特殊情形的径向矩阵元: 矢径r整数次幂的平均值，电偶极跃迁矩阵元和电四极跃迁矩阵元. 关键词： 三维各向同性谐振子 径向矩阵元 广义Laguerre多项式 偶极跃迁 四极跃迁     

Vicious random walkers in the limit of a large number of walkers

The vicious random walker problem on a line is studied in the limit of a large number of walkers. The multidimensional integral representing the probability that thep walkers will survive a timet (denotedP _t ^(p) ) is shown to be analogous to the partition function of a particular one-component Coulomb gas. By assuming the existence of the thermodynamic limit for the Coulomb gas, one can deduce asymptotic formulas forP _t ^(p) in the large-p, large-t limit. A straightforward analysis gives rigorous asymptotic formulas for the probability that after a timet the walkers are in their initial configuration (this event is termed a reunion). Consequently, asymptotic formulas for the conditional probability of a reunion, given that all walkers survive, are derived. Also, an asymptotic formula for the conditional probability density that any walker will arrive at a particular point in timet, given that allp walkers survive, is calculated in the limittp.