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.     

Local search algorithms for the min-max loop layout problem

In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines dictates the number of circuits of the conveyor belt required to manufacture each of several products. The goal is to find an ordering of the machines that minimises the maximum number of circuits required for the manufacture of any of the products. Since the problem is strongly NP-hard, the study of heuristic methods is of interest. This paper proposes iterated descent and tabu search algorithms, and a randomised insertion algorithm. Results of extensive computational tests show that all of our algorithms outperform a previously known algorithm that applies a greedy heuristic to the solution of a linear programming relaxation. The best quality solutions are obtained with iterated descent. This adds further evidence to the belief that iterated descent can produce high quality solutions to a variety of combinatorial optimisation problems. Moreover, unlike some other local search algorithms, iterated descent does not require much tuning in order to be competitive.     

Interaction of metals with an organic semiconductor: Ag and In on PTCDA

The interaction of Ag and In with a thin film of 3,4,9,10-perylenetetracarboxylic dianhydride (PTCDA) was studied by near-edge X-ray absorption fine structure (NEXAFS). Upon Ag deposition on a PTCDA film of 20 nm thickness the relative intensities and lineshapes, as well as the angular dependence of the spectra remains unchanged, illustrating the formation of a chemically unreactive Ag/PTCDA interface. On the other hand, the adsorption of 0.3 nm In strongly decreases the intensity of the π^* resonances in C and O K-edge NEXAFS spectra. This is attributed to a strong charge transfer between In and PTCDA, leading to a redistribution of the charge in the molecule. However, the absence of a strong shift or new features and negligible dependence of peak intensities corresponding to π^* resonances on the In thickness indicate that the interaction between In and PTCDA is not accompanied by a covalent bond formation.     

Tight-binding method modelling of photonic crystal waveguides

We present here a tight-binding-like modelling of two-dimensional (2D) photonic crystals (PCs). Adopted from solid-state physics, the concept of generalized Wannier functions is used to construct a localized state basis that allows a parameter-free ab initio study of defects in PCs. We demonstrate here for a 2D triangular lattice of dielectric rods in air, the existence of this localized basis and the possibility to study large scale complex dielectric structures deviating from periodicity. Specific numerical simulations on a split waveguide embedded in this triangular lattice are performed, and they demonstrate the superiority of this method over plane wave based techniques.     

An efficient two-step synthesis of 3-allylindoles

A two-step synthetic sequence for an efficient synthesis of 3-allylindoles is described.     

Hamiltonization of theories with degenerate coordinates

We consider a class of Lagrangian theories where part of the coordinates does not have any time derivatives in the Lagrange function (we call such coordinates degenerate). We advocate that it is reasonable to reconsider the conventional definition of singularity based on the usual Hessian and, moreover, to simplify the conventional hamiltonization procedure. In particular, in such a procedure, it is not necessary to complete the degenerate coordinates with the corresponding conjugate momenta.     

Adaptive classification method and measurement of intermittent random process characteristics

Results are presented of an analytic construction and investigation of adaptive data classification algorithms for intermittent turbulence. A decision making rule is presented, relationships are derived to estimate the classification accuracy. A three-level procedure is described for processing the intermittency, including the calculation algorithms for the initial point, self-teaching, and optimal classification. It is shown that the method proposed permits realization of total automation of intermittency data processing.Translated from Teoreticheskaya i Prikladnaya Mekhanika, No. 18, pp. 119–123, 1987.