应用加权列联表分析预测汛期（4─9月）洪涝趋势

本文根据汉寿县１９６０─１９８８年洪涝灾害资料，应用加权列联表分析法，与前期气候因子建立洪涝趋势预测模式。最后对１９８９─１９９０年洪涝试报，取得了满意的效果。     

影响牦牛初生重因素的系统分析

分析了影响牦牛初生重的六个因素和众多因子，母牦牛的产犊季节、牦牛的胎次、犊牛的性别对牦牛初生重影响最大；母牛的年龄、营养情况对初生重影响次之；放牧管理水平对初生重影响最小。     

厄米-双曲余弦-高斯光束的瞄准稳定性

用失调叠加积分的方法 ,对厄米双曲余弦高斯光束的瞄准稳定性作了研究 ,得到了厄米双曲余弦高斯光束失调因子 ηm2 的精确解析公式和近似解析公式 ,并用数值计算了相对横向偏移和相对角向偏移对失调因子ηm2 的影响以及对精确解析公式和近似解析公式的适用范围作了分析和说明。     

中国电子工业企业微观环境分析

本文运用五种竞争作用力理论，具体分析了中国电子工业的微观环境，通过分析可以看出中国电子工业的外部微观环境主要就是电信运营企业和自身合资企业中中外双方的股东企业。这种结果对分析中国电子工业企业的发展简化了环境。     

信息化对区域经济影响的数理分析

本文以信息化与经济指标资料为基础,运用加权回归、因子分析和聚类分析等方法,讨论了全国31个省(市、区)信息化水平及其与经济发展关系,给出地区综合发展水平的排行榜。并提出若干促进信息化建设的建议。     

关于有限Abel群直接因子的平均数

对于有限Ａｂｅｌ群Ｇ，ｔ（Ｇ）定义为其直接因子的个数，在［５］中，Ｅ．Ｋｒａｔｚｅｌ对于和式得到一渐近公式，对应余项为△＿１（ｘ）．本文利用Ｅ．Ｆｏｕｖｒｙ和Ｈ　．Ｉｗａｎｉｅｃ的方法，得到了关于△＿１（ｘ）的一个新的估计，改进了Ｈ．Ｍｅｎｚｅｒ等人的结果．     

Characterization of strongly interacted multiple cracks in an infinite plate

Based on the Kachanov method and the alternating iteration technique, a new method is proposed to deal with the problem of the strongly interacted multiple cracks in an infinite plate. Unlike the Kachanov method which neglects the interaction of the tractions of the non-uniform components, the tractions of the non-uniform components on the surfaces of cracks are considered through the alternating technique. The accuracy and efficiency of present method are validated by comparing the results of two collinear and two parallel overlapped open the cracks obtained by the present method with those of the exact solutions, the results of the Kachanov method and the alternating iteration technique. Applications of present method in solving sliding close crack problems and evaluating the plastic zones demonstrate the versatility of present method.     

体育专业函授生自学能力培养浅议

首先分析了体育专业函授生的一般特点，并提出了构成体育专业函授生自学能力结构的四大要素，然后着重阐述了体育专业函授生自学能力培养的四项基本措施．     

Objective acoustic voice-quality parameters in the computer phonetogram

A phonetogram is a plot of the dynamic range of the voice as a function of fundamental frequency. Traditionally, the phonetogram only records the sound-pressure level (SPL) of the threshold of phonation and the upper limit in SPL the voice can reach with sustained phonation as a function of the fundamental frequency (F₀). In this study, the phonetogram is extended by including acoustic voice-quality parameters. Three additional parameters are tested: jitter, shimmer, and crest factor. For each individual voice, the variation in the three parameters is evaluated over the entire phonetogram area. By averaging individual phonetograms, standard or norm phonetograms are obtained revealing general patterns in voice-quality variation. These patterns reflect the complex relations between F₀, SPL, and the acoustic voice-quality parameters just mentioned. Jitter and shimmer distributions over the phonetogram show that large variations in perturbation values can be expected when production conditions are altered. Highest perturbation values are found for the low F₀ and low SPL phonations. For all voices, a gradual decrease of the crest factor is found with increasing F₀, reflecting the degrading of spectral complexity with F₀. The crest-factor parameter can also be used to mark those areas in the phonetogram where the fundamental dominates the waveform and where flow control is the main SPL regulating mechanism in voice production. The strong quality variations within the phonetogram stress the need for accurate control of F₀ and SPL in objective voice-quality measurement.     

A bound on the total size of a cut cover

A cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers every edge of G at least once. The total size of a cycle cover (cut cover) is the sum of the number of edges of the cycles (cuts) in the cover.We discuss several results for cycle covers and the corresponding results for cut covers. Our main result is that every connected graph on n vertices and e edges has a cut cover of total size at most 2e-n+1 with equality precisely when every block of the graph is an odd cycle or a complete graph (other than K₄ or K₈). This corresponds to the result of Fan [J. Combin. Theory Ser. B 74 (1998) 353-367] that every graph without cut-edges has a cycle cover of total size at most e+n-1.