Lipschitzian optimization without the Lipschitz constant

We present a new algorithm for finding the global minimum of a multivariate function subject to simple bounds. The algorithm is a modification of the standard Lipschitzian approach that eliminates the need to specify a Lipschitz constant. This is done by carrying out simultaneous searches using all possible constants from zero to infinity. On nine standard test functions, the new algorithm converges in fewer function evaluations than most competing methods.The motivation for the new algorithm stems from a different way of looking at the Lipschitz constant. In particular, the Lipschitz constant is viewed as a weighting parameter that indicates how much emphasis to place on global versus local search. In standard Lipschitzian methods, this constant is usually large because it must equal or exceed the maximum rate of change of the objective function. As a result, these methods place a high emphasis on global search and exhibit slow convergence. In contrast, the new algorithm carries out simultaneous searches using all possible constants, and therefore operates at both the global and local level. Once the global part of the algorithm finds the basin of convergence of the optimum, the local part of the algorithm quickly and automatically exploits it. This accounts for the fast convergence of the new algorithm on the test functions.     

Estimation on the optic loss for acrylic polymers by theoretical modification

Various fluorinated/chlorinated polymers were synthesized and characterized by FT-IR and NMR. Also, theoretical optic loss of the POF were investigated and proposed for the purpose of finding a definite rule of the optic loss.From the computation of the results, the modified equation was theoretically deduced, and the optic loss of each prepared polymer was measured and compared with the calculated optical loss of polymers. Also, it was found that the optic loss from the modified equation fitted well with the experimental data.     

Decomposition Rank of Subhomogeneous C*-Algebras

We analyze the decomposition rank (a notion of covering dimensionfor nuclear C*-algebras introduced by E. Kirchberg and the author)of subhomogeneous C*-algebras. In particular, we show that asubhomogeneous C*-algebra has decomposition rank n if and onlyif it is recursive subhomogeneous of topological dimension n,and that n is determined by the primitive ideal space. As an application, we use recent results of Q. Lin and N. C.Phillips to show the following. Let A be the crossed productC*-algebra coming from a compact smooth manifold and a minimaldiffeomorphism. Then the decomposition rank of A is dominatedby the covering dimension of the underlying manifold. 2000 MathematicsSubject Classification 46L85, 46L35.     

Almost flat locally finite coverings of the sphere

For any subset A of the unit sphere of a Banach space X and for [0,2) the notion of -flatness is introduced as a measure of non-flatness of A. For any positive , construction of locally finite tilings of the unit sphere by -flat sets is carried out under suitable -renormings of X in a quite general context; moreover, a characterization of spaces having separable dual is provided in terms of the existence of such tilings. Finally, relationships between the possibility of getting such tilings of the unit sphere in the given norm and smoothness properties of the norm are discussed.     

On asymmetric coverings and covering numbers

An asymmetric covering is a collection of special subsets S of an n‐set such that every subset T of the n‐set is contained in at least one special S with . In this paper we compute the smallest size of any for We also investigate “continuous” and “banded” versions of the problem. The latter involves the classical covering numbers , and we determine the following new values: , , , , and . We also find the number of non‐isomorphic minimal covering designs in several cases. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 218–228, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10022     

Equitable resolvable coverings

In an earlier article, Willem H. Haemers has determined the minimum number of parallel classes in a resolvable 2‐(qk,k,1) covering for all k ≥ 2 and q = 2 or 3. Here, we complete the case q = 4, by construction of the desired coverings using the method of simulated annealing. Secondly, we look at equitable resolvable 2‐(qk,k,1) coverings. These are resolvable coverings which have the additional property that every pair of points is covered at most twice. We show that these coverings satisfy k < 2q ? , and we give several examples. In one of these examples, k > q. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 113–123, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10024     

Controlled Wild Algebras

The controlled wild algebra is introduced, a covering criterionfor a finite-dimensional algebra to be controlled wild is given,and this criterion is applied to the algebras with radical squarezero, algebras with zero relations, local algebras and finitep-group algebras. 2000 Mathematical Subject Classification:16G20, 16G60.     

Compactifying sufficiently regular covering spaces of compact 3-manifolds

In this paper it is proven that if the group of covering translations of the covering space of a compact, connected, -irreducible 3-manifold corresponding to a non-trivial, finitely-generated subgroup of its fundamental group is infinite, then either the covering space is almost compact or the subgroup is infinite cyclic and has normalizer a non-finitely-generated subgroup of the rational numbers. In the first case additional information is obtained which is then used to relate Thurston's hyperbolization and virtual bundle conjectures to some algebraic conjectures about certain 3-manifold groups.     

Are covering (enveloping) morphisms minimal?

We prove that for certain classes of modules such that direct sums of -covers ( -envelopes) are -covers ( -envelopes), -covering ( -enveloping) homomorphisms are always right (left) minimal. As a particular case we see that over noetherian rings, essential monomorphisms are left minimal. The same type of results are given when direct products of -covers are -covers. Finally we prove that over commutative noetherian rings, any direct product of flat covers of modules of finite length is a flat cover.     

地面覆盖物对交通噪声衰减量的研究

就地面覆盖物（包括农作物、草地、裸露的土壤等）对交通噪声衰减量的影响进行了深入研究。通过大量现场测试、数据处理与分析，重新确定了衰减因子的取值，建立了由地面覆盖物所引起的交通噪声附加衰减量与水平距离之间更为合理的关系式，最后，对回归方程的精度进行了检验。