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.     

Protein Conformation of a Lattice Model Using Tabu Search

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia

In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant).     

Pointwise and L2 bounds in some nonstandard problems for the heat equation

We consider some initial-boundary value problems for the linear and nonlinear heat equation where the gradient of the solution is prescribed on the boundary. Assuming that a solution exists, we obtain bounds for the solution and its gradient by maximum principle arguments or by means of differential and integral inequalities.     

Riemann Zeta函数的六阶和

利用概率论与组合数学的方法,研究了与Riemann-zeta函数ξ(k)的部分和ξ_n(k)有关的一些级数,计算出了一些重要的和式．特别的,Euler的著名结果5ξ(4)= 2ξ~2(2)能够从四阶和式直接推出．因此,通过计算全部的11个六阶和式,研究它们之间的非平凡关系,就有可能得到ξ(3)的数值．     

Lower bounds for the blow-up time in a temperature dependent Navier-Stokes flow

In this paper we consider two different initial-boundary value problems in temperature dependent viscous flow when the temperature equation has a nonlinear heat source term. When blow-up occurs we derive lower bounds for the blow-up time in each case.     

Spatial decay in a double diffusive convection problem in Darcy flow

This paper deals with a model of time-dependent double diffusive convection in Darcy flow. In particular it is concerned with the spatial decay of solutions when the flow is confined to a semi-infinite cylinder. Decay bounds for an energy expression are derived.     

Regularity of Bunimovich’s stadia

Stadia are popular models of chaotic billiards introduced by Bunimovich in 1974. They are analogous to dispersing billiards due to Sinai, but their fundamental technical characteristics are quite different. Recently many new results were obtained for various chaotic billiards, including sharp bounds on correlations and probabilistic limit theorems, and these results require new, more powerful technical apparatus. We present that apparatus here, in the context of stadia, and prove “regularity” properties.      

Empirical minimization

We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp. The method of proof we use is based on Talagrand's concentration inequality for empirical processes. Research partially supported by NSF under award DMS-0434393. Research partially supported by the Australian Research Council Discovery Porject DP0343616.