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.     

Recent trends in optical data processing

Optical data processing is an advancing field which has received much attention in recent years. Optical techniques have already shown their applicability in target identification, advanced signal processing operations and advanced linear algebra operations. The potential capabilities of processing of data using photons instead of electrons as the carrier of information have established, beyond any doubt, that the optical techniques will be the next generation technology surpassing electronic techniques in some important areas such as air traffic control, missile guidance and remote sensing. Although great strides have been made in all the areas of optical data processing, the goal of high performance, high speed and very accurate all-optical computers would be realised only around the year 1995. The main difficulty is that the required materials for high resolution and fast spatial light modulators and optical interconnects are yet to be perfected. The present paper reviews the recent trends and the future prospects of optical data processing.     

The α-arylation of α-bromo- and α-chloroenones using palladium-catalysed cross-coupling

The palladium-catalysed cross-coupling reaction of various arylboronic acids with α-bromoenones and α-chloroenones offers an operationally simple approach to the synthesis of both cyclic and acyclic α-arylenones.     

On the treatment of the pairing interaction in the particle-rotor model

Different ways of treating the pairing interaction in the particle-rotor model are discussed and compared in a model which can be solved exactly. Special attention is paid to the interaction between the yrast and yrare bands as function of the shell filling.     

A result on sets,with applications to vector optimization

In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems.     

Segregation of concurrent sounds. II: Effects of spectral envelope tracing, frequency modulation coherence, and frequency modulation width

The research presented here concerns the simultaneous grouping of the components of a vocal sound source. McAdams [J. Acoust. Soc. Am. 86, 2148-2159 (1989)] found that when three simultaneous vowels at different pitches were presented with subaudio frequency modulation, subjects judged them as being more prominent than when no vibrato was present. In a normal voice, when the harmonics of a vowel undergo frequency modulation they also undergo an amplitude modulation that traces the spectral envelope. Hypothetically, this spectral tracing could be one of the criteria used by the ear to group components of each vowel, which may help explain the lack of effect of frequency modulation coherence among different vowels in the previous study. In this experiment, two types of vowel synthesis were used in which the component amplitudes of each vowel either remained constant with frequency modulation or traced the spectral envelope. The stimuli for the experiment were chords of three different vowels at pitch intervals of five semitones (ratio 1.33). All the vowels of a given stimulus were produced by the same synthesis method. The subjects' task involved rating the prominence of each vowel in the stimulus. It was assumed that subjects would judge this prominence to be lower when they were not able to distinguish the vowel from the background sound. Also included as stimulus parameters were the different permutations of the three vowels at three pitches and a number of modulation conditions in which vowels were unmodulated, modulated alone, and modulated either coherently with, or independently of, the other vowels. Spectral tracing did not result in increased ratings of vowel prominence compared to stimuli where no spectral tracing was present. It would therefore seem that it has no effect on grouping components of sound sources. Modulated vowels received higher prominence ratings than unmodulated vowels. Vowels modulated alone were judged to be more prominent than vowels modulated with other vowels. There was, however, no significant difference between coherent and independent modulation of the three vowels. Differences among modulation conditions were more marked when the modulation width was 6% than when it was 3%.     

Particle scattering in Euclidean Lattice Field Theories

A Haag-Ruelle Scattering Theory for Euclidean Lattice Field Theories is developed.Work supported by DAAD, Deutscher Akademischer Austauschdienst. Partially supported by CNPq     

A note on acyclic domination number in graphs of diameter two

A subset S of the vertex set of a graph G is called acyclic if the subgraph it induces in G contains no cycles. S is called an acyclic dominating set of G if it is both acyclic and dominating. The minimum cardinality of an acyclic dominating set, denoted by γ_a(G), is called the acyclic domination number of G. Hedetniemi et al. [Acyclic domination, Discrete Math. 222 (2000) 151-165] introduced the concept of acyclic domination and posed the following open problem: if δ(G) is the minimum degree of G, is γ_a(G)?δ(G) for any graph whose diameter is two? In this paper, we provide a negative answer to this question by showing that for any positive k, there is a graph G with diameter two such that γ_a(G)-δ(G)?k.     

Order Embeddings with Irrational Codomain: Debreu Properties of Real Subsets

The objective of this paper is to investigate the role of the set of irrational numbers as the codomain of order-preserving functions defined on topological totally preordered sets. We will show that although the set of irrational numbers does not satisfy the Debreu property it is still nonetheless true that any lower (respectively, upper) semicontinuous total preorder representable by a real-valued strictly isotone function (semicontinuous or not) also admits a representation by means of a lower (respectively, upper) semicontinuous strictly isotone function that takes values in the set of irrational numbers. These results are obtained by means of a direct construction. Moreover, they can be related to Cantor’s characterization of the real line to obtain much more general results on the semicontinuous Debreu properties of a wide family of subsets of the real line.