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.     

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.

     

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.     

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.     

非空交定理及其应用

本文得到了广义区间空间中几个参数型非空交定理，并用此结果证明了一些新型极大极小定理，截口定理，重合定理，以及变分不等式解的存在性定理。本文中的结果包含（１，３，５－１２，１４－１６）中相应结果。     

Finite Degree Holomorphic Covers of Compact Riemann Surfaces

A conjecture of Ehrenpreis states that any two compact Riemann surfaces of genus at least two have finite degree unbranched holomorphic covers that are arbitrarily close to each other in moduli space. Here we prove a weaker result where certain branched covers associated with arithmetic Riemann surfaces are allowed, and investigate the connection of our result with the original conjecture.