Optimising the wave soldering process for lead free solders

Nitrogen is now used in wave soldering machines to help lower the amount of dross that can be formed on the solder bath surface. The paper provides details on the use of computational fluid dynamics in helping understand the flow profiles of nitrogen in a wave soldering machine and to predict the concentration of nitrogen and oxygen around the solder bath.

Matching search in fractal video compression and its parallel implementation in distributed computing environments

Fractal video compression is a relatively new video compression method. Its attraction is due to the high compression ratio and the simple decompression algorithm. But its computational complexity is high and as a result parallel algorithms on high performance machines become one way out. In this study we partition the matching search, which occupies the majority of the work in a fractal video compression process, into small tasks and implement them in two distributed computing environments, one using DCOM and the other using .NET Remoting technology, based on a local area network consists of loosely coupled PCs. Experimental results show that the parallel algorithm is able to achieve a high speedup in these distributed environments.

From sudoku to DNA in six steps

Tony Valsamidis, senior lecturer in information systems, Greenwich University reviews Genesis Machines: The New Science of Biocomputing by Martyn Amos - Atlantic Books ISBN - 184354 224 2. What do encryption, the double helix and sudoku have in common? They are all bound together by the newish science of biocomputing in rather surprising ways, as Martyn Amos masterfully shows in this compendious volume.

Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - a polymatroid optimization approach

We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be formulated as a polymatroid optimization problem. We develop a novel divide-and-conquer technique for the polymatroid optimization problem and then apply it to each scheduling problem. We show that each scheduling problem can be solved in $ \O({\rm T}_{\rm feas}(n) \times\log n)$ time by using our divide-and-conquer technique, where n is the number of jobs and Tfeas(n) denotes the time complexity of the corresponding feasible scheduling problem with n jobs. This approach yields faster algorithms for most of the scheduling problems discussed in this paper.

Transporting jobs through a two-machine open shop

We consider the two-machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a 7/5-approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009

Multicomponent gas-mixture measurements using an array of gas sensors and an artificial neural-network

An Electronic Nose is being jointly developed between the University of Greenwich and the Institute of Intelligent Machines to detect the gases given off from an oil filled transformer when it begins to break down. The gas sensors being used are very simple, consisting of a layer of Tin Oxide (SnO2) which is heated to approximately 640 K and the conductivity varies with the gas concentrations. Some of the shortcomings introduced by the commercial gas sensors available are being overcome by the use of an integrated array of gas sensors and the use of artificial neural networks which can be 'taught' to recognize when the gas contains several components. At present simulated results have achieved up to a 94% success rate of recognizing two component gases and future work will investigate alternative neural network configurations to maintain this success rate with practical measurements.