A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

氢化丁苯共聚物结构的核磁共振波谱表征Ⅱ.微观结构的定量计算

在氢化丁苯共聚物¹³C-NMR谱脂肪碳部分谱带归属的基础上,根据各谱带的主要来源,推导出六个二单元浓度的计算公式。计算出二单元、一单元的相对含量,各结构单元的数均序列长度、嵌段含量和其它结构参数。加氢前后的¹H-和¹³C-NMR谱的组成计算结果基本一致。初步探讨了作为粘度指数改进剂的氢化丁苯共聚物微观结构与性能的关系,为合成提供了依据。     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

小波变换在金融数据分析中的应用

市场上的数据,从本质上讲都是一种时间序列。它和小波分析中的信号具有相同的特性。因此,完全可以将这些经济时间序列看成信号,应用小波变换进行分析和预测。     

Harmonic mappings of the Sierpinski gasket to the circle

Harmonic mappings from the Sierpinski gasket to the circle are described explicitly in terms of boundary values and topological data. In particular, all such mappings minimize energy within a given homotopy class. Explicit formulas are also given for the energy of the mapping and its normal derivatives at boundary points.

     

无穷矩阵拓扑代数的理想(Ⅰ)(英文)

本文给出了所有弱紧算子 ,强紧算子 ,Mackey紧算子 ,构成无穷矩阵拓扑下相同紧集的特征的刻画 .     

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     

On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

Investigation and optimization of the covering power and coloristic properties of paint coatings of complex composition

A method for finding the optimum sizes of pigment particles, their volume concentration, and the paint coating thickness that provide the covering power and the required coloristic characteristics of reflected light for the minimum flow rate of pigments is based on using a four-flow approximation of the solution to the equation of radiation transfer in dispersion media and is extended to coatings of complex composition. The capabilities of the method are demonstrated by examples of coatings of mixtures of hematite and rutile particles in a binder with n=1.5 for variations of the modal size and the half-width of the size distribution of the pigment particles. B. I. Stepanov Institute of Physics, Academy of Sciences of Belarus, 70, F. Skorina Ave., Minsk, 220072, Belarus. Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 64, No. 1, pp. 90–96, January–February, 1997.