Current Students

Announcements

  • Operational Review

    The University is undertaking an operational review of faculty and professional services starting in March 2015.

    For student information please click here.

  • Phishing Email Warning – IT Service: FILL OUT THE ACCOUNT UPDATE FORM

    You may have recently received a phishing email titled ‘IT Service: Fill out the account update form’. Please be aware that this is a spoof email, University IT would under no circumstances request that you forward your account details in this way.

    If you receive emails requesting your username and password they should be immediately deleted as they have not been generated by University IT. If you have clicked on the link and provided your account details you must reset your password immediately.

    Instructions and a link to change your password can be obtained by visiting the University IT web pages and clicking “Password Changer” under the Quick Links section or by contacting the User Support Help Desk by phone on: 01483 689898 or email: usersupport@surrey.ac.uk.

    If you have clicked on the link and provided your account details it is essential that you contact usersupport@surrey.ac.uk for further advice.

  • Anti-virus Protection Improvement

    Please be aware University IT are implementing an update to improve the level of anti-virus protection.  While no impact to usability is expected, if you do experience any desktop or laptop issues, please contact the IT User Support Help Desk by emailing usersupport@surrey.ac.uk or calling 01483 689898

Event Calendar

  • BEO International Education Fair

    30 March 2015

    Come and meet representatives from the University of Surrey and learn about the study options available to you.

    Find out more »

  • New approaches to the min-cost flow problem

    1 April 2015

    Min-cost flows belong to one of the most important combinatorial optimization problems and have applications in image processing, among many other areas. In the past years, interior point methods for network flow problems have become popular and led to a series of improvements in terms of worst-case running time guarantees. These methods are rather involved numerical algorithms using combinatorial pre-conditioners for solving systems of linear equations. We present a simpler variant of a potential reduction interior point method for the min-cost flow problem that sheds more light on combinatorial aspects of the whole approach. We first construct an equivalent auxiliary network and initial interior primal and dual points, i.e., flows, node potentials, and reduced costs.

    By augmenting flows along cycles or adjusting the reduced costs along the arcs over cuts, we transform the initial primal and dual interior points to ones with a duality gap less than 1. These updates are computed by solving an electrical flow problem with a resistor and a voltage source on each edge. Finally, we present a crossover procedure that computes optimal integral node potentials in O(m+n log n) time. This is joint work with Ruben Becker.

    Find out more »

  • New Oriental Beijing

    4 April 2015

    Come and meet representatives from the University of Surrey and learn about the study options available to you.

    Find out more »

  • All events »