Parallelisation of a 3-D electromagnetic scattering code

A high-frequency time domain finite element scattering code using a combination of edge and piecewise constant elements on unstructured tetrahedral meshes is described. A comparison of computation with theory is given for scattering from a sphere. A parallel implementation making use of the bulk synchronous parallel (BSP) programming model is described in detail; a BSP performance model of the parallelized field calculation is derived and compared to timing measurements on up to 128 processors on a Cray T3D.

Tambalacoque. For a formal account of the gist of a scholarly argument

Argumentation as reflected in a short communication from the published literature of botany and zoology is discussed. Trying to capture the logic structure of the argument, however imperfectly, is relevant to information science and depends on a particular goal: namely, to potentially benefit the task of sketching the relationship between bibliographic entries in a better manner than is possible with present-day bibliometric or scientometric practice. This imposes tight limits on the depth of analysis of the text.

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval

In this note, we consider the scheduling problem of minimizing the sum of the weighted completion times on a single machine with one non-availability interval on the machine under the non-resumable scenario. Together with a recent 2-approximation algorithm designed by Kacem [I. Kacem, Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Computers & Industrial Engineering 54 (2008) 401–410], this paper is the first successful attempt to develop a constant ratio approximation algorithm for this problem. We present two approaches to designing such an algorithm. Our best algorithm guarantees a worst-case performance ratio of 2+ε. © 2008 Elsevier B.V. All rights reserved.