Sets with two associative operations

In this paper we consider duplexes, which are sets with two associative binary operations. Dimonoids in the sense of Loday are examples of duplexes. The set of all permutations carries a structure of a duplex. Our main result asserts that it is a free duplex with an explicitly described set of generators. The proof uses a construction of the free duplex with one generator by planary trees.     

Applying a Mode Selector to Improve the Pulse-Compression Performance of Asymmetric-Coupled-Waveguide-Based Dispersion Compensators

An InGaAsP slab-type asymmetric-coupled-waveguide-based dispersion compensator with a mode selector has been designed and fabricated. The mode selector is necessary to select either a symmetric [with a positive group-velocity dispersion (GVD)] or antisymmetric (with a negative GVD) supermode. These supermodes exist simultaneously in the dispersion-compensation region of the device. Pulse-compression experiments were used to test the dispersion compensator, evaluating the function of the mode selector. A theoretical study of the experimental results shows that the mode selector obtains a very strong selectivity (nearly 100%) for the antisymmetric supermode.     

Synchronized whistlers recorded at Varanasi

Some interesting events of synchronized whistlers recorded at low latitude station Varanasi during magnetic storm period of the year 1977 are presented. The dynamic spectrum analysis shows that the component whistlers are Eckersley whistlers having dispersion 10 s^1/2 and 30 s^1/2. An attempt has been made to explain the dynamic spectra using lightning discharge generated from magnetospheric sources     

An experimental analysis of a population based approach for global optimization

In this paper we perform a computational analysis of a population based approach for global optimization, Population Basin Hopping (PBH), which was proven to be very efficient on very challenging global optimization problems by the authors (see ). The experimental analysis aims at understanding more deeply how the approach works and why it is successful on challenging problems.     

Peritectic phase growth in directionally solidified Cu-70% Sn alloy

The growth mechanism of the peritectic η phase involving the peritectic reaction and peritectic transformation in Cu-70%Sn alloy was investigated under directional solidification. The results show that a major growth mechanism in thickening of the peritectic η-layer is not the peritectic reaction but the peritectic transformation. The transformation temperature and isothermal time play crucial roles in determining the volume fraction and the thickness of the peritectic η phase. With the increase of the temperature and isothermal time, the volume fraction of the peritectic η phase increases. The regressed data show that the relationship between the thickness of η phase (Δx) and the transformation temperature (T) meets the following equation In Δx=6.5−1673 1 / T. Additionally, there exists a relationship between the thickness of the η phase (Δx) and the isothermal time (t) at the 9 mm solidification distance below the peritectic reaction interface, Δx=0.72t ^1/2, which is consistent with the theoretical model. Supported by the National Science Foundation of China (Grant No. 50395102)     

New isothermal equation of state of solids applied to high pressures

In the present paper, a new two-parameter inverted equation of state (EOS) is developed which is found to be working very well in the high-pressure region. To check its success and validity, this EOS has been applied in a number of solids. The computed volume compression is found to be in very good agreement with the experimental data in the whole range of pressure in all the solids. The minimum and the maximum pressure range used in the present study is 0–320 kbar and 0–3000 kbar, respectively.     

Vanishing of local homology

 We study the vanishing properties of local homology of complexes of modules without assuming that its homology is artinian. Using vanishing results for local homology and cohomology we prove new vanishing results for Ext- and Tor-modules. Received: 1 August 2002; in final form: 23 September 2002 / Published online: 16 May 2003 Mathematics Subject Classification (1991): 13C12, 13D07, 13D45.     

A column generation approach for the timetabling problem of Greek high schools

A column generation (CG) approach for the solution of timetabling problems is presented. This methodology could be used for various instances of the timetabling problem, although in this paper the solution of the high-school situation in Greece is presented. The results obtained show clearly that the CG approach that has been extremely successful in recent years in the solution of airline crew scheduling problems could also be very efficient and robust for the solution of timetabling problems. Several large timetabling problems corresponding to real problems have been successfully solved, with the solutions obtained feasible and of very high quality in accordance with the problem definition. In addition, none of the solutions contained any idle hour for any of the teachers, which was one of the main goals of this optimization effort.     

20-relative neighborhood graphs are hamiltonian

For any two points p and q in the Euclidean plane, define LUN_pq = { v | v ∈ R², d_pv < d_pq and d_qv < d_pq}, where d_uv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUN_pq(V) = V ∩ LUN_pq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of RNG(V) if and only if LUN_pq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of kRNG(V) if and only if | LUN_pq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn₂) time. Let E_c = {e_pq| p ∈ V and q ∈ V}. Then G_c = (V,E_c) is a complete graph. For any subset F of E_c, define the maximum distance of F as max_epq∈Fd_pq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph G_c whose maximum distance is the minimum among all Hamiltonian cycles in graph G_c. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.