顶凌覆盖节水增产技术研究

通过1998年、2000年的试验研究，系统分析了顶凌覆盖技术在高寒区节水增温保温、增产增收的机理及其应用效果。提出该技术可以缓解低温干旱特别是春旱对农业生产的困扰，是一项可以抗旱保春播增产增收的实用技术，在高寒地区具有较高的推广价值。     

A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50

In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K₅₀. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049     

The Covering Radius of Ternary Cyclic Codes with Length up to 25

The covering radius of all ternary cyclic codes of length up to 25 is given. Some of the results were obtained by computer and for others mathematical reasonings were applied. The minimal distances of all codes were recalculated.     

Sets of permutations that generate the symmetric group pairwise

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of ²n−1 permutations that pairwise generate the symmetric group Sn. There is no set of ²n−1+1 permutations having this property. For all sufficiently large integers n with n≡2mod4, there exists a set of ²n−2 even permutations that pairwise generate the alternating group An. There is no set of ²n−2+1 permutations having this property.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

On covering bridged plane triangulations with balls

We show that every plane graph of diameter 2r in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius r. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 65–80, 2003     

塑料光学元件的清洗、镀膜和胶合

各种塑料光学元件在光学系统中的应用越来越广泛。作为光学元件,必然涉及清洗、镀膜和胶合等工艺技术问题。本文就塑料光学元件的这三个技术作一介绍。     

两类拟共形映射的掩盖定理

In this paper we define two classes of quasiconformal mappings,and study their covering properties by methods of module.We obtain some new results.In the meantime,we give new methods to prove Koebe 1/2 covering theorem on convex conformal mappings.     

箱覆盖问题的半定松驰算法

箱覆盖问题是NP困难问题中的经典问题，得到了广泛地研究，九十年代以来，半定松驰策略被用来求解组合优化问题，取得了很好的结果[13]，本文首次给箱覆盖问题的半定松驰算法，算法的理论分析结果表明它适合于求解大规模的箱覆盖问题。     

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.