排序方式: 共有10条查询结果,搜索用时 15 毫秒
1
1.
2.
723Plus+UG电子液压式调速器在16V240ZC型船用柴油机上获得了广泛的应用并取得了良好的控制效果。针对该型号的调速器在实际使用过程中遇到的一些典型问题及解决过程进行了阐述。 相似文献
3.
S. K. Koh 《Fatigue & Fracture of Engineering Materials & Structures》1996,19(1):15-25
Abstract— Fatigue tests that simulate an autofrettaged thick-walled pressure vessel with an external groove under pulsating internal pressure loading conditions were performed using specimens taken from an autofrettaged thick-walled pressure vessel. Load-controlled simulation fatigue tests using rectangular, elliptic, and shot peened elliptic grooved specimens were performed for three different autofrettage levels of 50, 75, and 100% overstrains. In order to estimate the fatigue life of the thick-walled pressure vessel subjected to pulsating internal pressure, the local strain approach was considered to assess the crack formation life. A cyclic stress-strain relation and fatigue damage models determined from strain-controlled low cycle fatigue tests were employed to estimate the fatigue life of the autofrettaged thick-walled pressure vessel. Larger local stresses and strains were obtained from the Neuber's rule compared to the linear rule and these led to conservative fatigue life estimations. Estimated fatigue lives were obtained within factors of 2 to 4, compared to the experimental fatigue lives determined from the simulation fatigue tests. 相似文献
4.
5.
GPRS设备IP语音传输可行性研究 总被引:1,自引:0,他引:1
通过对多种语音编解码算法的分析,提出了采用G.723.1编解码算法并进行优化的方案。实验结果证实:在GPRS网络窄带宽下进行实时语音传输是可行的,该方案可以广泛应用到如长途物流管理、野外勘探等领域。 相似文献
6.
7.
8.
J.J. Liu 《Theoretical computer science》2010,411(49):4235-4241
Squares are strings of the form ww where w is any nonempty string. Two squares ww and w′w′ are of different types if and only if w≠w′. Fraenkel and Simpson [Avieri S. Fraenkel, Jamie Simpson, How many squares can a string contain? Journal of Combinatorial Theory, Series A 82 (1998) 112-120] proved that the number of square types contained in a string of length n is bounded by O(n). The set of all different square types contained in a string is called the vocabulary of the string. If a square can be obtained by a series of successive right-rotations from another square, then we say the latter covers the former. A square is called a c-square if no square with a smaller index can cover it and it is not a trivial square. The set containing all c-squares is called the covering set. Note that every string has a unique covering set. Furthermore, the vocabulary of the covering set are called c-vocabulary. In this paper, we prove that the cardinality of c-vocabulary in a string is less than , where N is the number of runs in this string. 相似文献
9.
L2-norms are often used in the multi-degree reduction problem of Bézier curves or surfaces. Conventional methods on curve cases are to minimize , where and are the given curve and the approximation curve, respectively. A much better solution is to minimize , where is the closest point to point , that produces a similar effect as that of the Hausdorff distance. This paper uses a piecewise linear function L(t) instead of t to approximate the function φ(t) for a constrained multi-degree reduction of Bézier curves. Numerical examples show that this new reparameterization-based method has a much better approximation effect under Hausdorff distance than those of previous methods. 相似文献
10.
1