The global address space (GAS) programming model provides important potential productivity advantages over traditional parallel programming models. Languages using the GAS model currently have insufficient support from existing performance analysis tools, due in part to their implementation complexity. We have designed the Global Address Space Performance (GASP) tool interface that is flexible ...

Neisseria gonorrhoeae has consistently developed resistance to antimicrobials used therapeutically for gonorrhoea and few antimicrobials remain for effective empiric first-line therapy. Since 2009 the European gonococcal antimicrobial surveillance programme (Euro-GASP) has been running as a sentinel surveillance system across Member States of the European Union (EU) and European Economic Area (...

Acknowledgements I sincerely thank my advisor, Dr. Peter Beerel for inspiring me to take up one of the most significant academic challenges that I have taken in my life. He has been the best advisor a graduate student can wish for and without his support, guidance and patience; this work would not have been completed. I also thank his wife Janet and baby Kira for considering me as a part of the...

Placing a certain number of sinks at appropriate locations in WSNs reduces the number of hops between a sensor and its sink resulting in less exchanged messages between nodes and consequently less energy consumption. Since finding the optimal number of the sinks to be added and their locations is an NP Hard problem, we propose in this paper, a topological level solution that uses a meta-heurist...

The Glial cells missing transcription factor is necessary and sufficient to induce glial-cell fates in the Drosophila embryonic nervous system. A study by Chotard et al. in this issue of Neuron reveals that this "master regulator" of glial cell fate specification is also required (gasp!) to generate neurons.

In this paper we present a novel methodology to compute stable models in Answer Set Programming. The process is performed with a bottom-up approach that does not require the preprocessing of the typical grounding phase. The implementation is completely in Prolog and Constraint Logic Programming over finite domains.