RES011. Selecting a conference, presenting and networking. First edition

A training course that forms part of Epigeum's Research Skills Master Programme.

Proceedings of the West Africa Built Environment Research (WABER) Conference 2010

FOREWORD Welcome to this West Africa Built Environment Research (WABER) conference taking place here in Ghana. Thank you for coming and welcome to Accra. The main aims of the WABER conference are: to help young researchers and early-career scholars in West Africa to develop their research work and skills through constructive face-to-face interaction with experienced academics; to provide a platform for networking and collaborative work among senior built environment academics in West Africa; and to serve as a vehicle for developing the field of construction management and economics in Africa. Waber 2009 The WABER event in 2009 was held at the British Council in Accra, Ghana on 2-3 June. The event was a resounding success. It attracted participation from 32 researchers, from 12 different institutions, who presented their work to an audience of approximately 100 people. Each presenter received immediate and constructive feedback from an international panel. The event was opened by Professor K.K. Adarkwa, Vice Chancellor of KNUST, Kumasi, Ghana, with several senior academics and researchers from universities, polytechnics, and other institutions in Ghana and Nigeria in attendance. There was also a significant level of attendance by senior construction practitioners in Ghana. Thank you to the School of Construction Management and Engineering, University of Reading, UK for funding the inaugural event in 2009. We are also grateful to all of you who helped to make the event a success and to those of you who have joined us here today to build upon the success and legacy of WABER 2009. Waber 2010 This year, we have 60+ peer-reviewed papers and presentations on topics relating to Building services and maintenance, Construction costs, Construction design and technology, Construction education, Construction finance, Construction procurement, Contract administration, Contract management, Contractor development, Decision support systems, Dispute resolution, Economic development, Energy efficiency, Environment and sustainability, Health and safety, Human resources, Information technology, Marketing, Materials science, Organisation strategy and business performance, Productivity, Project management, Quantity surveying, Real estate and planning, Solar energy systems, Supply chain management and Urban development. We hope that these papers will generate interest among delagates and stimulate discussion here and beyond the conference into the wider community of academia and industry. The delegates at this conference come from 10 different countries. This provides a rich international and multicultural blend and a perfect platform for networking and developing collaborations. This year we are blessed to have three high profile keynote speakers in the persons of Professor George Ofori (National University of Singapore), Dr Roine Leiringer (University of Reading, UK) and Professor Will Hughes (University of Reading, UK). We are also thankful to Dr Chris Harty (University of Reading, UK) who is facilitating the Research Skills Workshop on ‘Writing a scientific article’. Thank you to Dr Sena Agyepong of our conference organising team for her capable management of local organising arrangements. And above all, thank you to all of you for coming to this conference. Enjoy and have a safe journey back home. Dr Samuel Laryea School of Construction Management and Engineering University of Reading, July 2010

Verification and FPGA circuits of a block-2 fast path-based predictor

This paper formally derives a new path-based neural branch prediction algorithm (FPP) into blocks of size two for a lower hardware solution while maintaining similar input-output characteristic to the algorithm. The blocked solution, here referred to as B2P algorithm, is obtained using graph theory and retiming methods. Verification approaches were exercised to show that prediction performances obtained from the FPP and B2P algorithms differ within one mis-prediction per thousand instructions using a known framework for branch prediction evaluation. For a chosen FPGA device, circuits generated from the B2P algorithm showed average area savings of over 25% against circuits for the FPP algorithm with similar time performances thus making the proposed blocked predictor superior from a practical viewpoint.

Proceedings of the 6th international conference on disability, virtual reality and associated technologies (ICDVRAT 2006)

The proceedings of the conference

Proceedings of the 5th international conference on disability, virtual reality and associated technologies (ICDVRAT 2004)

The proceedings of the conference

Using the web graph to influence application behaviour

The Web's link structure (termed the Web Graph) is a richly connected set of Web pages. Current applications use this graph for indexing and information retrieval purposes. In contrast the relationship between Web Graph and application is reversed by letting the structure of the Web Graph influence the behaviour of an application. Presents a novel Web crawling agent, AlienBot, the output of which is orthogonally coupled to the enemy generation strategy of a computer game. The Web Graph guides AlienBot, causing it to generate a stochastic process. Shows the effectiveness of such unorthodox coupling to both the playability of the game and the heuristics of the Web crawler. In addition, presents the results of the sample of Web pages collected by the crawling process. In particular, shows: how AlienBot was able to identify the power law inherent in the link structure of the Web; that 61.74 per cent of Web pages use some form of scripting technology; that the size of the Web can be estimated at just over 5.2 billion pages; and that less than 7 per cent of Web pages fully comply with some variant of (X)HTML.

Largest connected component of a star graph with faulty vertices

In order to make a full evaluation of an interconnection network, it is essential to estimate the minimum size of a largest connected component of this network provided the faulty vertices in the network may break its connectedness. Star graphs are recognized as promising candidates for interconnection networks. This article addresses the size of a largest connected component of a faulty star graph. We prove that, in an n-star graph (n >= 3) with up to 2n-4 faulty vertices, all fault-free vertices but at most two form a connected component. Moreover, all fault-free vertices but exactly two form a connected component if and only if the set of all faulty vertices is equal to the neighbourhood of a pair of fault-free adjacent vertices. These results show that star graphs exhibit excellent fault-tolerant abilities in the sense that there exists a large functional network in a faulty star graph.

Synthesised design of optical filters assisted by microcomputer

New algorithms and microcomputer-programs for generating original multilayer designs (and printing a spectral graph) from refractive-index input are presented. The programs are characterised TSHEBYSHEV, HERPIN, MULTILAYER-SPECTRUM and have originated new designs of narrow-stopband, non-polarizing edge, and Tshebyshev optical filter. Computation procedure is an exact synthesis (so far that is possible) numerical refinement not having been needed.