On the Spectral Radius of Trees with the Given Diameter d

Let T denote a tree with the diameter d(d≥2) and order n. Let P^*d,r,n-d-1denote the tree obtained by identifying the rth vertex of path Pd l and the center of starKl,K1,n-d-1, where r = r(d) is the integer part about d 2/2. Then p(T)≤ p(P^*d,r,n-d-1), andequality holds if and only if T≌P^*d,r,n-d-1     

多目标最优化的一种积分型实现算法

在文[1]中给出了求解多目标最优化的一种积分总极值的概念性算法．本文利用数论中的一致分布佳点集列，较为简便的得出了多目标最优化的积分总极值的实现算法和算法终止准则．并经过有关函数数值计算表明该算法是有效的，可用来求解多目标最优化问题的有效解．     

On tolerance lattices of algebras in congruence modular varieties

We prove that the tolerance lattice TolA of an algebra A from a congruence modular variety V is 0-1 modular and satisfies the general disjointness property. If V is congruence distributive, then the lattice Tol A is pseudocomplemented. If V admits a majority term, then Tol A is 0-modular. This revised version was published online in June 2006 with corrections to the Cover Date.     

Computing homotopic shortest paths in the plane

We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log²n) time per output vertex which is an improvement by a factor of O(n/log²n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n²⁺) for any positive constant . In the case k<n²⁺, where k is the total size of the input and output, we improve the running to O((n+k+(nk)^2/3)log^O(1)n).     

高压下某些导电高分子色散关系的研究

利用晶格动力学方法,研究在高压下几种导电高分子具有不同晶格链时的色散关系及其曲线的变化.链间耦合作用的减弱使横波与纵波的ω差值相应增大,且在BZ边界处拉开一个间隙,这是维度作用的结果.     

Motion Control by ZV Shaper Synthesis Extended for Fractional Systems and Its Application to CRONE Control

Shaping command input or preshaping is used for reducing system oscillation in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual oscillation. This technique, developed by N.C. Singer and W.P. Seering, is used for example in the aerospace field, in particular in flexible structure control. This paper presents the study of ZV shaper for explicit fractional derivative systems (generalized derivative systems). A robustness study of ZV shaper is then presented and applied to improve second generation CRONE control response time. Results from simulation and from a DC motor bench are also given.     

All Subvarieties of ℒpq Have Finite Bases of Identities

We consider the varieties of lattice ordered groups with the identity of commutation of the nth powers of elements. We establish that every such l-variety with n=pq, where p and q are distinct prime numbers, has a finite basis of identities.     

Note on André's reflection principle

This note generalizes André's reflection principle to give a new combinatorial proof of a formula for the number of lattice paths lying within certain trapezoids.