Microbial analysis of soil and groundwater from a gasworks site and comparison to a sequenced biological reactive barrier remediation process (SEREBAR)

Aims: To investigate the distribution of a polymicrobial community of biodegradative bacteria in (i) soil and groundwater at a former manufactured gas plant (FMGP) site and (ii) in a novel SEquential REactive BARrier (SEREBAR) bioremediation process designed to bioremediate the contaminated groundwater. Methods and Results: Culture-dependent and culture-independent analyses using denaturing gradient gel electrophoresis (DGGE) and polymerase chain reaction (PCR) for the detection of 16S ribosomal RNA gene and naphthalene dioxygenase (NDO) genes of free-living (planktonic groundwater) and attached (soil biofilm) samples from across the site and from the SEREBAR process was applied. Naphthalene arising from groundwater was effectively degraded early in the process and the microbiological analysis indicated a dominant role for Pseudomonas and Comamonas in its degradation. The microbial communities appeared highly complex and diverse across both the sites and in the SEREBAR process. An increased population of naphthalene degraders was associated with naphthalene removal. Conclusion: The distribution of micro-organisms in general and naphthalene degraders across the site was highly heterogeneous. Comparisons made between areas contaminated with polycyclic aromatic hydrocarbons (PAH) and those not contaminated, revealed differences in the microbial community profile. The likelihood of noncultured bacteria being dominant in mediating naphthalene removal was evident. Significance and Impact of the Study: This work further emphasizes the importance of both traditional and molecular-based tools in determining the microbial ecology of contaminated sites and highlights the role of noncultured bacteria in the process.

Performance assessment of nanoscale double- and triple- gate FinFETs

This is the first paper to describe performance assessment of triple and double gate FinFETs for High Performance (HP), Low Operating Power (LOP) and Low Standby Power (LSTP) logic technologies is investigated. The impact of gate work-function, spacer width, lateral source/drain doping gradient, fin aspect ratio, fin thickness on device performance, has been analysed in detail and guidelines are presented to meet ITRS specification at 65 and 45 nm nodes. Optimal design of lateral source/drain doping profile can not only effectively control short channel effects, yielding low off-current, but also achieve low values of intrinsic gate delay.

Quadratic Forms on Complex Random Matrices and Multiple-Antenna Systems

This research published in the foremost international journal in information theory and shows interplay between complex random matrix and multiantenna information theory. Dr T. Ratnarajah is leader in this area of research and his work has been contributed in the development of graduate curricula (course reader) in Massachusetts Institute of Technology (MIT), USA, By Professor Alan Edelman. The course name is "The Mathematics and Applications of Random Matrices", see http://web.mit.edu/18.338/www/projects.html

Finite-Element Time-Step Coupled Generator, Load, AVR and Brushless Exciter Modelling

This paper presented results from a details and comprehensive simulation using finite element method of the practical operation of an electrical machine. The results it displayed have been used in practice to design more efficient equipment.

Scheduling and Platforming Trains at Busy Complex Stations

We consider the problem of train planning or scheduling for large, busy, complex train stations, which are common in Europe and elsewhere, though not in North America. We develop the constraints and objectives for this problem, but these are too computationally complex to solve by standard combinatorial search or integer programming methods. Also, the problem is somewhat political in nature, that is, it does not have a clear objective function because it involves multiple train operators with conflicting interests. We therefore develop scheduling heuristics analogous to those successfully adopted by train planners using ''manual'' methods. We tested the model and algorithms by applying to a typical large station that exhibits most of the complexities found in practice. The results compare well with those found by traditional methods, and take account of cost and preference trade-offs not handled by those methods. With successive refinements, the algorithm eventually took only a few seconds to run, the time depending on the version of the algorithm and the scheduling problem. The scheduling models and algorithms developed and tested here can be used on their own, or as key components for a more general system for train scheduling for a rail line or network.Train scheduling for a busy station includes ensuring that there are no conflicts between several hundred trains per day going in and out of the station on intersecting paths from multiple in-lines and out-lines to multiple platforms, while ensuring that each train is allowed at least its minimum required headways, dwell time, turnaround time and trip time. This has to be done while minimizing (costs of) deviations from desired times, platforms or lines, allowing for conflicts due to through-platforms, dead-end platforms, multiple sub-platforms, and possible constraints due to infrastructure, safety or business policy.