CK-T系列高精度数控重型卧式车床

介绍了对航空航天、发电设备、冶金工业等制造领域可实现各种高精度大型轴类、盘类及复杂型面加工的高精度数控卧式车床。CK-T系列高精度数控卧式车床,可实现X、Y、Z、C等四轴联动及铣、钻、磨等多项功能,全闭环控制。通过对机床主要部件进行有限元分析提高了该车床性能,得到了显著的效果。

佳能CanoScan 3000 ex扫描仪入门产品 高端技术

佳能CanoScan 3000 ex扫描仪拥有1200 ×2400dpi的光学分辨率,扫描效果精确、细致,能够充分保存图像的所有细节。它的48bit色彩采集实现了真实的色彩还原,色彩过渡部分层次细腻丰富,并将色彩的损失减少到最低。 3000 ex拥有高端产品的技术,从而增强了其扫描速度,它以600dpi的精度扫描A4幅面图片仅需26秒。3000 ex还提供了“多项扫描”功能。

Two-Variable Hermite Polynomial Excitation of Two-Mode Squeezed Vacuum State as Squeezed Two-Mode Number State

We find that the squeezed two-mode number state is just a two-variable Hermite polynomial excitation of thetwo-mode squeezed vacuum state (THPES).We find that the Wigner function of THPES and its marginal distributionsare just related to two-variable Hermite polynomials (or Laguerre polynomials) and that the tomogram of THPES canbe expressed by one-mode Hermite polynomial.

Value Distribution of a Class of Differential Polynomials

Let f（z） be a transcendental meromorphic function in the complex plane and a ≠0 be a constant, for any positive integer m, n, k, satisfy m ≥ nk＋n＋2, ψ= f^m ＋a（f^（κ））^n has infinitely many zeros. The corresponding normal criterion also is proved.

Signal Separation and Instantaneous Frequency Estimation Based on Multi-scale Chirplet Sparse Signal Decomposition

An approach based on multi-scale ehirplet sparse signal decomposition is proposed to separate the malti-component polynomial phase signals, and estimate their instantaneous frequencies. In this paper, we have generated a family of multi-scale chirplet functions which provide good local correlations of chirps over shorter time interval. At every decomposition stage, we build the so-called family of chirplets and our idea is to use a structured algorithm which exploits information in the family to chain chirplets together adaptively as to form the polyncmial phase signal component whose correlation with the current residue signal is largest. Simultaueously, the polynomial instantaneous frequency is estimated by connecting the linear frequency of the chirplet functions adopted in the current separation. Simulation experiment demonstrated that this method can separate the camponents of the multi-component polynamial phase signals effectively even in the low signal-to-noise ratio condition, and estimate its instantaneous frequency accurately.

Linear recurring sequences and subfield subcodes of cyclic codes

Linear recurring sequences over finite fields play an important role in coding theory and cryptography. It is known that subfield subcodes of linear codes yield some good codes. In this paper, we study linear recurring sequences and subfield subcodes. Let Mqm(f(x)) denote the set of all linear recurring sequences over Fqm with characteristic polynomial f(x) over Fqm . Denote the restriction of Mqm(f(x)) to sequences over Fq and the set after applying trace function to each sequence in Mqm(f(x)) by Mqm(f(x)) | Fq and Tr( Mqm(f(x))), respectively. It is shown that these two sets are both complete sets of linear recurring sequences over Fq with some characteristic polynomials over Fq. In this paper, we firstly determine the characteristic polynomials for these two sets. Then, using these results, we determine the generator polynomials of subfield subcodes and trace codes of cyclic codes over Fqm .

A construction of hyperbent functions with polynomial trace form

This paper presents a construction of infinite classes of binary and p-ary hyperbent functions of polynomial trace form,based on finding a zero of a Kloosterman sum.

On Implementing the Symbolic Preprocessing Function over Boolean Polynomial Rings in Gr?bner Basis Algorithms Using Linear Algebra

Some techniques using linear algebra was introduced by Faugore in F4 to speed up the reduction process during Grobner basis computations. These techniques can also be used in fast implementations of F5 and some other signature-based Grobner basis algorithms. When these techniques are applied, a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function （given in F4）. Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function, this step can be very costly when the number of involved polynomials/monomials is huge. In this paper, multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported. Many examples have been tested by using this method, and the experimental data shows that the new method is very efficient.

Kostka functions associated to complex reflection groups and a conjecture of Finkelberg-Ionov

Kostka functions K_(λ,μ)~±(t), indexed by r-partitions λ and μ of n, are a generalization of Kostka polynomials K_(λ,μ)(t) indexed by partitions λ,μ of n. It is known that Kostka polynomials have an interpretation in terms of Lusztig's partition function. Finkelberg and Ionov(2016) defined alternate functions K_(λ,μ)(t) by using an analogue of Lusztig's partition function, and showed that K_(λ,μ)(t) ∈Z≥0[t] for generic μ by making use of a coherent realization. They conjectured that K_(λ,μ)(t) coincide with K_(λ,μ)^-(t). In this paper, we show that their conjecture holds. We also discuss the multi-variable version, namely, r-variable Kostka functions K_(λ,μ)~±(t_1,…,t_r).

ON FUNCTIONAL DECOMPOSITION OF MULTIVARIATE POLYNOMIALS WITH DIFFERENTIATION AND HOMOGENIZATION

This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye, Dai, and Lam （1999） and were developed by Faugere, Perret （2006, 2008, 2009）. The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homoge- nous polynomials can be computed using the algorithm with high probability. This solves a conjecture proposed by Ye, Dal, and Lam （1999）. The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials. Finally, the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.

Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity

This paper presents an infeasible-interior-point algorithm for aclass of nonmonotone complementarity problems, and analyses its convergence and computational complexity. The results indicate that the proposed algorithm is a polynomial-time one.