OnQ-order andR-order of convergence

We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper.     

高精度视觉贴片机拾放程序设计编程

探讨了SMT高精度视觉贴片机难点之一拾放程序设计编程 ,重点介绍示教编程和CAD输入编程设计方法。     

Design Methodology of the Structure of Postal Express Mail Networks of Aviation Channels in China

1　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｏｒｄｅｒｔｏｉｍｐｒｏｖｅｔｈｅｑｕａｌｉｔｙｏｆｐｏｓｔａｌｓｅｒｖｉｃｅａｎｄｔａｋｅａｄｖａｎｔａｇｅｏｆａｕｔｏｍａｔｅｄｍａｉｌｓｏｒｔｉｎｇｅｑｕｉｐ ｍｅｎｔｓ,ｉｔｈａｓｂｅｅｎｄｅｔｅｒｍｉｎｅｄｔｏｃｏｎｓｔｒｕｃｔｔｈｅｐｏｓｔａｌａｒｅａｃｅｎｔｅｒｏｆｆｉｃｅｓｙｓｔｅｍｉｎＣｈｉｎａＰｏｓｔａｌＳｅｒ ｖｉｃｅ (ＣＰＳ) .ＴｈｅｃｒｕｘｏｆｔｈｅｐｒｏｂｌｅｍｆａｃｅｄｂｙＣＰＳｉｓｔｏｒｅｄｅｓｉｇｎｔｈｅｐｏｓｔａｌｃｏｍｍｕｎｉｃａ…     

Dynamical Running Mass of Quark in the Dyson-Schwinger Equation Approach

Based on the Dyson-Schwinger equations of QCD in the "rainbow" approximation, the fully dressed quarkpropagator Sf(p) is investigated, and then an algebraic parametrization form of the propagator is obtained as a solutionof the equations. The dressed quark amplitudes Af and Bf built up the fully dressed quark propagator and the dynamicalrunning masses Mf defined by Af and Bf for light quarks u, d and s are calculated, respectively. Using the predictedrunning masses Mf, quark condensates <0|q(0)q(0)|0> = -(0.255 GeV)a for u, d quarks, and <0|s s|0> = 0.8<0|q(0)q(0)]0)for s quark, and experimental pion decay constant fπ = 0.093 GeV, the masses of Goldstone bosons K, π, and η are alsoevaluated. The numerical results show that the masses of quarks are dependent on their momentum p2. The fully dressedquark amplitudes Af and Bf have correct behaviors which can be used for many purposes in our future researches onnonperturbative QCD.     

Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

宽带抽运情况下乙醇、丙酮溶液中受激拉曼散射光谱的实验研究

研究了乙醇、丙酮两种拉曼介质在宽带抽运情况下啁啾激光脉冲的受激拉曼散射频谱特性 ,得到的一级Stokes光频谱宽度与抽运光基本相当 ,且具有较高的转换效率 ,从而表明了利用“展宽—受激拉曼散射—压缩”的办法获得波长近 1μm的飞秒级超短脉冲激光信号源的实验方案具有可行性     

多功能半导体激光医疗仪电源的研制

根据“多功能半导体激光医疗仪”整机的要求,采用同一电源对667nm和808nm半导体激光器实施供电。为避免电源在开、关机时对半导体激光管产生浪涌冲击,电源在设计中采用了适当的逻辑功能。并可保证对667nm激光器供电时,即使打开808nm激光器供电开关,也不对808nm半导体激光器供电,反之亦然。电源设有手动、计算机两种控制方法,及恒定功率、电流两种工作方式。     

涂胶设备背面冲洗功能的开发与研制

本文根据涂胶设备在加工制品过程中所遇到的制品背面沾污问题，提出改进措施，并根据设备的具体情况，增加了涂胶设备的背面冲洗功能。使制品在涂胶过程中，及时地对制品背面进行冲洗，从而保证了制品背面的洁净度，对提高产品质量和提高产品的成品率有非常重要的意义，同时对开发一些技术要求较高的新品也有深远的影响。     

A Novel UWB Pulse Shape Modulation System

In this paper novel modified Hermite polynomial functions for use in impulse radio (ultra-wideband) communications are proposed. With these functions pulse shapes which are orthogonal and have nearly constant pulse width regardless of the pulse order are generated. These properties hold under the effects of differentiation. An M-ary communication system is constructed using these pulse shapes. A Matlab model for generating the pulses is designed and the effect of timing jitter on the performance of the system is investigated by computer simulation.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016