Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.     

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.     

Metastability of a circular o-ring due to intrinsic curvature

An o-ring takes spontaneously the shape of a chair when strong enough torsion is applied in its tangent plane. This state is metastable, since work has to be done on the o-ring to return to the circular shape. We show that this metastable state exists in a Hamiltonian where curvature and torsion are coupled via an intrinsic curvature term. If the o-ring is constrained to be planar (2d case), this metastable state displays a kink-anti-kink pair. This state is metastable if the ratio is less than , where C and A are the torsion and the bending elastic constants [#!landau!#]. In three dimensions, our variational approach shows that . This model can be generalized to the case where the bend is induced by a concentration field which follows the variations of the curvature. Received: 27 August 1997 / Revised: 23 October 1997 / Accepted: 12 November 1997     

既不离散也不连续的随机变量

讨论了既不离散也不连续的随机变量 ,并纠正了有关文献中关于连续型随机变量定义中的错误 .     

On the properties of solutions to the Goursat-Darboux problem with boundary and distributed controls

We consider a control system described by the Goursat-Darboux equation. The system is controlled by distributed and boundary controls. The controls are subject to the constraints given as multivalued mappings with closed, possibly nonconvex, values depending on the phase variable. Alongside the initial constraints, we consider the convexified constraints and the constraints whose values are the extreme points of the convexified constraints. We study the questions of existence of solutions and establish connections between the solutions under various constraints.     

Automatic continuity and representation of group homomorphisms defined between groups of continuous functions

Let C(X,G) be the group of continuous functions from a topological space X into a topological group G with pointwise multiplication as the composition law, endowed with the uniform convergence topology. To what extent does the group structure of C(X,G) determine the topology of X? More generally, when does the existence of a group homomorphism H between the groups C(X,G) and C(Y,G) implies that there is a continuous map h of Y into X such that H is canonically represented by h? We prove that, for any topological group G and compact spaces X and Y, every non-vanishing C-isomorphism (defined below) H of C(X,G) into C(Y,G) is automatically continuous and can be canonically represented by a continuous map h of Y into X. Some applications to specific groups and examples are given in the paper.     

Feature Selection using Fuzzy Support Vector Machines

The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets show that feature selection using fuzzy SVM obtains better results than using SVM.     

Analysis of Static Simulated Annealing Algorithms

Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms to address intractable discrete optimization problems. This paper introduces a measure for determining the expected number of iterations to visit a predetermined objective function level, given that an inferior objective function level has been reached in a finite number of iterations. A variation of simulated annealing (SA), termed static simulated annealing (S²A), is analyzed using this measure. S²A uses a fixed cooling schedule during the algorithm execution. Though S²A is probably nonconvergent, its finite-time performance can be assessed using the finite-time performance measure defined in this paper.     

Extension of the range of resonator scanning spectrometer into submillimeter band and some perspectives of its further developments

Extension of the working frequency of modern resonator spectrometers into submillimeter wave range is described. Experimental record of atmospheric absorption spectrum covering 45-370 GHz range is demonstrated for the first time, and measured water vapor J′_{ka′, kc′}-J_{ka, kc} = 5_1,5-4_2,2 at 325 GHz line parameters are presented. For the first time pressure lineshift for the 325-GHz water vapor line is measured. Further extension of working range is discussed. New estimations of physical limits of time needed for measurements of absorption in the whole Backward Wave Oscillator (BWO) range are given for phase continuous synthesizer regime. Basic schemes of fast broadband continuous phase synthesized sources are discussed. Verification of the previous measurements of water vapor 3_1,3-2_2,0 at 183 GHz line parameters is presented. Comparisons with ringdown resonator spectrometers are given.     

Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions

A domain partitioning algorithm for minimizing or maximizing a Lipschitz continuous function is enhanced to yield two new, more efficient algorithms. The use of interval arithmetic in the case of rational functions and the estimates of Lipschitz constants valid in subsets of the domain in the case of others and the addition of local optimization have resulted in an algorithm which, in tests on standard functions, performs well.