A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.     

Availability Analysis of Repairable <Emphasis Type="Italic">N</Emphasis>-Server <Emphasis Type="Italic">n</Emphasis><Subscript><Emphasis Type="Italic">i</Emphasis></Subscript>-Replicated Systems

We develop an exact closed-form expression for the steady-state availability of a repairable, N-server system in which the ith server contains n _i identical, reconfigurable, breakdown-prone units. Our approach, which follows from the Markov chain balance equations and the recursive properties of Hessenberg matrix determinants, is simpler than previously proposed matrix geometric approaches, and can readily be adapted to the availability analysis of more complicated structures. We illustrate this by computing the steady-state availability of a mixed parallel-serial gracefully degrading replicated system.     

Hardy Spaces on the Plane and Double Fourier Transforms

We provide a direct computational proof of the known inclusion where is the product Hardy space defined for example by R. Fefferman and is the classical Hardy space used, for example, by E.M. Stein. We introduce a third space of Hardy type and analyze the interrelations among these spaces. We give simple sufficient conditions for a given function of two variables to be the double Fourier transform of a function in and respectively. In particular, we obtain a broad class of multipliers on and respectively. We also present analogous sufficient conditions in the case of double trigonometric series and, as a by-product, obtain new multipliers on and respectively.     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.     

Anisotropic<Emphasis Type="Italic">s</Emphasis>-wave or<Emphasis Type="Italic">d</Emphasis>-wave pairing? Analysis of experiments on ion irradiation of YBa<Subscript>2</Subscript>Cu<Subscript>3</Subscript>O<Subscript>7-x</Subscript> films

The effect of ion irradiation on the superconducting transition temperatureT _c and resistivityρ _ab (T) of YBa₂Cu₃O_7-x films with different oxygen content (initial temperatureT _c0≈90 K and 60 K) is studied experimentally. The dependenciesT _c /T _c0 on residual resistivityρ _o are obtained in very wide range 0.2<T _c /T _c0 <1 andρ _o μΩ·cm. The critical values ofρ _o , corresponding to the vanishing of superconductivity, are found to be an order of magnitude larger then those predicted by theory ford-wave pairing. At 0.5÷0.6<T _c /T _c0<1 the experimental data are in close agreement with theoretical dependencies, obtained for the anisotropics-wave superconductor within the BCS-framework.     

Investigations of the interlayer coupling in high-<Emphasis Type="Italic">T</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript> cuprates

Low-field magnetizationM(H) measurements can be used to probe the nature of the screening currents and the interlayer coupling in high-T _c cuprates. Here we compare theM(H) behaviour of single crystals of Bi₂Sr₂CaCu₂O₈ and fully oxygenated and oxygen reduced YBa₂Cu₃O_7??. In YBa₂Cu₃O₇, theM(H) behaviour is consistent with anisotropic 3D superconductivity whilst in Bi₂Sr₂CaCu₂O₈, the surface screening currents are strongly affected by the presence of vortices, implying that the CuO₂ planes are coupled via a weak Josephson interaction. In oxygen-deficient YBa₂Cu₃O_6.7 (T _c =63K), theM(H) behaviour at low temperatures is similar to that found for Bi₂Sr₂CaCu₂O₈, implying that the removal of oxygen from the chains has resulted in a dimensional crossover of the superconducting state in YBa₂Cu₃O_7??. As the temperature approachesT _c , the 3D behaviour is eventually restored as thec-axis coherence length ξ _c becomes comparable with the interlayer spacingd.     

Transport studies in boron-ion implanted type II<Emphasis Type="Italic">a</Emphasis> diamond

We have investigated low-temperature electrical transport mechanisms in the surface layer of a type IIa diamond which has been heavily implanted with boron-ions at low temperatures and then annealed at high temperatures. The boron atoms occupy substitutional sites giving rise to a heavily doped wide-bandgap semiconductor. The dc-conductivity results suggest that for the maximum boron doping that has been achieved, the diamond sample is close to the insulator-metal transition. A model to account for the observed increase in activated boron centres with ion dose is presented. On the insulating side of the transition, the data are interpreted in terms of variable-range hopping laws.     

Magnetic structure of graphite ribbon

Anoble mechanism of spin polarization is proposed for finite graphite sheet with edge. For graphite ribbon with zigzag edge, there appear peculiar ‘edge states’. These localized states comprise nearly flat band at the Fermi level, which easily causes magnetic instability. Magnetic structure is suggested from Hartree-Fock analysis of the Hubbard model, where huge magnetic moments are induced at around both of edges by weak HubbardU and are coupled antiferromagnetically with each other.